/******/ (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] = {
/******/ 			i: moduleId,
/******/ 			l: false,
/******/ 			exports: {}
/******/ 		};

/******/ 		// Execute the module function
/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);

/******/ 		// Flag the module as loaded
/******/ 		module.l = 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__(__webpack_require__.s = 123);
/******/ })
/************************************************************************/
/******/ ([
/* 0 */
/***/ function(module, exports) {

	var g;

	// This works in non-strict mode
	g = (function() { return this; })();

	try {
		// This works if eval is allowed (see CSP)
		g = g || Function("return this")() || (1,eval)("this");
	} catch(e) {
		// This works if the window reference is available
		if(typeof window === "object")
			g = window;
	}

	// g can still be undefined, but nothing to do about it...
	// We return undefined, instead of nothing here, so it's
	// easier to handle this case. if(!global) { ...}

	module.exports = g;


/***/ },
/* 1 */
/***/ function(module, exports, __webpack_require__) {

	var store      = __webpack_require__(64)('wks')
	  , uid        = __webpack_require__(68)
	  , Symbol     = __webpack_require__(2).Symbol
	  , USE_SYMBOL = typeof Symbol == 'function';

	var $exports = module.exports = function(name){
	  return store[name] || (store[name] =
	    USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));
	};

	$exports.store = store;

/***/ },
/* 2 */
/***/ function(module, exports) {

	// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028
	var global = module.exports = typeof window != 'undefined' && window.Math == Math
	  ? window : typeof self != 'undefined' && self.Math == Math ? self : Function('return this')();
	if(typeof __g == 'number')__g = global; // eslint-disable-line no-undef

/***/ },
/* 3 */
/***/ function(module, exports, __webpack_require__) {

	
	/**
	 * This is the web browser implementation of `debug()`.
	 *
	 * Expose `debug()` as the module.
	 */

	exports = module.exports = __webpack_require__(169);
	exports.log = log;
	exports.formatArgs = formatArgs;
	exports.save = save;
	exports.load = load;
	exports.useColors = useColors;
	exports.storage = 'undefined' != typeof chrome
	               && 'undefined' != typeof chrome.storage
	                  ? chrome.storage.local
	                  : localstorage();

	/**
	 * Colors.
	 */

	exports.colors = [
	  'lightseagreen',
	  'forestgreen',
	  'goldenrod',
	  'dodgerblue',
	  'darkorchid',
	  'crimson'
	];

	/**
	 * Currently only WebKit-based Web Inspectors, Firefox >= v31,
	 * and the Firebug extension (any Firefox version) are known
	 * to support "%c" CSS customizations.
	 *
	 * TODO: add a `localStorage` variable to explicitly enable/disable colors
	 */

	function useColors() {
	  // is webkit? http://stackoverflow.com/a/16459606/376773
	  return ('WebkitAppearance' in document.documentElement.style) ||
	    // is firebug? http://stackoverflow.com/a/398120/376773
	    (window.console && (console.firebug || (console.exception && console.table))) ||
	    // is firefox >= v31?
	    // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages
	    (navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/) && parseInt(RegExp.$1, 10) >= 31);
	}

	/**
	 * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.
	 */

	exports.formatters.j = function(v) {
	  return JSON.stringify(v);
	};


	/**
	 * Colorize log arguments if enabled.
	 *
	 * @api public
	 */

	function formatArgs() {
	  var args = arguments;
	  var useColors = this.useColors;

	  args[0] = (useColors ? '%c' : '')
	    + this.namespace
	    + (useColors ? ' %c' : ' ')
	    + args[0]
	    + (useColors ? '%c ' : ' ')
	    + '+' + exports.humanize(this.diff);

	  if (!useColors) return args;

	  var c = 'color: ' + this.color;
	  args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));

	  // the final "%c" is somewhat tricky, because there could be other
	  // arguments passed either before or after the %c, so we need to
	  // figure out the correct index to insert the CSS into
	  var index = 0;
	  var lastC = 0;
	  args[0].replace(/%[a-z%]/g, function(match) {
	    if ('%%' === match) return;
	    index++;
	    if ('%c' === match) {
	      // we only are interested in the *last* %c
	      // (the user may have provided their own)
	      lastC = index;
	    }
	  });

	  args.splice(lastC, 0, c);
	  return args;
	}

	/**
	 * Invokes `console.log()` when available.
	 * No-op when `console.log` is not a "function".
	 *
	 * @api public
	 */

	function log() {
	  // this hackery is required for IE8/9, where
	  // the `console.log` function doesn't have 'apply'
	  return 'object' === typeof console
	    && console.log
	    && Function.prototype.apply.call(console.log, console, arguments);
	}

	/**
	 * Save `namespaces`.
	 *
	 * @param {String} namespaces
	 * @api private
	 */

	function save(namespaces) {
	  try {
	    if (null == namespaces) {
	      exports.storage.removeItem('debug');
	    } else {
	      exports.storage.debug = namespaces;
	    }
	  } catch(e) {}
	}

	/**
	 * Load `namespaces`.
	 *
	 * @return {String} returns the previously persisted debug modes
	 * @api private
	 */

	function load() {
	  var r;
	  try {
	    r = exports.storage.debug;
	  } catch(e) {}
	  return r;
	}

	/**
	 * Enable namespaces listed in `localStorage.debug` initially.
	 */

	exports.enable(load());

	/**
	 * Localstorage attempts to return the localstorage.
	 *
	 * This is necessary because safari throws
	 * when a user disables cookies/localstorage
	 * and you attempt to access it.
	 *
	 * @return {LocalStorage}
	 * @api private
	 */

	function localstorage(){
	  try {
	    return window.localStorage;
	  } catch (e) {}
	}


/***/ },
/* 4 */
/***/ function(module, exports, __webpack_require__) {

	var isObject = __webpack_require__(12);
	module.exports = function(it){
	  if(!isObject(it))throw TypeError(it + ' is not an object!');
	  return it;
	};

/***/ },
/* 5 */
/***/ function(module, exports) {

	var core = module.exports = {version: '2.4.0'};
	if(typeof __e == 'number')__e = core; // eslint-disable-line no-undef

/***/ },
/* 6 */
/***/ function(module, exports, __webpack_require__) {

	// Thank's IE8 for his funny defineProperty
	module.exports = !__webpack_require__(59)(function(){
	  return Object.defineProperty({}, 'a', {get: function(){ return 7; }}).a != 7;
	});

/***/ },
/* 7 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(setImmediate, clearImmediate) {var nextTick = __webpack_require__(196).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__(7).setImmediate, __webpack_require__(7).clearImmediate))

/***/ },
/* 8 */
/***/ function(module, exports, __webpack_require__) {

	var dP         = __webpack_require__(14)
	  , createDesc = __webpack_require__(30);
	module.exports = __webpack_require__(6) ? function(object, key, value){
	  return dP.f(object, key, createDesc(1, value));
	} : function(object, key, value){
	  object[key] = value;
	  return object;
	};

/***/ },
/* 9 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * Module dependencies.
	 */

	var keys = __webpack_require__(176);
	var hasBinary = __webpack_require__(177);
	var sliceBuffer = __webpack_require__(120);
	var base64encoder = __webpack_require__(127);
	var after = __webpack_require__(119);
	var utf8 = __webpack_require__(202);

	/**
	 * Check if we are running an android browser. That requires us to use
	 * ArrayBuffer with polling transports...
	 *
	 * http://ghinda.net/jpeg-blob-ajax-android/
	 */

	var isAndroid = navigator.userAgent.match(/Android/i);

	/**
	 * Check if we are running in PhantomJS.
	 * Uploading a Blob with PhantomJS does not work correctly, as reported here:
	 * https://github.com/ariya/phantomjs/issues/11395
	 * @type boolean
	 */
	var isPhantomJS = /PhantomJS/i.test(navigator.userAgent);

	/**
	 * When true, avoids using Blobs to encode payloads.
	 * @type boolean
	 */
	var dontSendBlobs = isAndroid || isPhantomJS;

	/**
	 * Current protocol version.
	 */

	exports.protocol = 3;

	/**
	 * Packet types.
	 */

	var packets = exports.packets = {
	    open:     0    // non-ws
	  , close:    1    // non-ws
	  , ping:     2
	  , pong:     3
	  , message:  4
	  , upgrade:  5
	  , noop:     6
	};

	var packetslist = keys(packets);

	/**
	 * Premade error packet.
	 */

	var err = { type: 'error', data: 'parser error' };

	/**
	 * Create a blob api even for blob builder when vendor prefixes exist
	 */

	var Blob = __webpack_require__(129);

	/**
	 * Encodes a packet.
	 *
	 *     <packet type id> [ <data> ]
	 *
	 * Example:
	 *
	 *     5hello world
	 *     3
	 *     4
	 *
	 * Binary is encoded in an identical principle
	 *
	 * @api private
	 */

	exports.encodePacket = function (packet, supportsBinary, utf8encode, callback) {
	  if ('function' == typeof supportsBinary) {
	    callback = supportsBinary;
	    supportsBinary = false;
	  }

	  if ('function' == typeof utf8encode) {
	    callback = utf8encode;
	    utf8encode = null;
	  }

	  var data = (packet.data === undefined)
	    ? undefined
	    : packet.data.buffer || packet.data;

	  if (global.ArrayBuffer && data instanceof ArrayBuffer) {
	    return encodeArrayBuffer(packet, supportsBinary, callback);
	  } else if (Blob && data instanceof global.Blob) {
	    return encodeBlob(packet, supportsBinary, callback);
	  }

	  // might be an object with { base64: true, data: dataAsBase64String }
	  if (data && data.base64) {
	    return encodeBase64Object(packet, callback);
	  }

	  // Sending data as a utf-8 string
	  var encoded = packets[packet.type];

	  // data fragment is optional
	  if (undefined !== packet.data) {
	    encoded += utf8encode ? utf8.encode(String(packet.data)) : String(packet.data);
	  }

	  return callback('' + encoded);

	};

	function encodeBase64Object(packet, callback) {
	  // packet data is an object { base64: true, data: dataAsBase64String }
	  var message = 'b' + exports.packets[packet.type] + packet.data.data;
	  return callback(message);
	}

	/**
	 * Encode packet helpers for binary types
	 */

	function encodeArrayBuffer(packet, supportsBinary, callback) {
	  if (!supportsBinary) {
	    return exports.encodeBase64Packet(packet, callback);
	  }

	  var data = packet.data;
	  var contentArray = new Uint8Array(data);
	  var resultBuffer = new Uint8Array(1 + data.byteLength);

	  resultBuffer[0] = packets[packet.type];
	  for (var i = 0; i < contentArray.length; i++) {
	    resultBuffer[i+1] = contentArray[i];
	  }

	  return callback(resultBuffer.buffer);
	}

	function encodeBlobAsArrayBuffer(packet, supportsBinary, callback) {
	  if (!supportsBinary) {
	    return exports.encodeBase64Packet(packet, callback);
	  }

	  var fr = new FileReader();
	  fr.onload = function() {
	    packet.data = fr.result;
	    exports.encodePacket(packet, supportsBinary, true, callback);
	  };
	  return fr.readAsArrayBuffer(packet.data);
	}

	function encodeBlob(packet, supportsBinary, callback) {
	  if (!supportsBinary) {
	    return exports.encodeBase64Packet(packet, callback);
	  }

	  if (dontSendBlobs) {
	    return encodeBlobAsArrayBuffer(packet, supportsBinary, callback);
	  }

	  var length = new Uint8Array(1);
	  length[0] = packets[packet.type];
	  var blob = new Blob([length.buffer, packet.data]);

	  return callback(blob);
	}

	/**
	 * Encodes a packet with binary data in a base64 string
	 *
	 * @param {Object} packet, has `type` and `data`
	 * @return {String} base64 encoded message
	 */

	exports.encodeBase64Packet = function(packet, callback) {
	  var message = 'b' + exports.packets[packet.type];
	  if (Blob && packet.data instanceof global.Blob) {
	    var fr = new FileReader();
	    fr.onload = function() {
	      var b64 = fr.result.split(',')[1];
	      callback(message + b64);
	    };
	    return fr.readAsDataURL(packet.data);
	  }

	  var b64data;
	  try {
	    b64data = String.fromCharCode.apply(null, new Uint8Array(packet.data));
	  } catch (e) {
	    // iPhone Safari doesn't let you apply with typed arrays
	    var typed = new Uint8Array(packet.data);
	    var basic = new Array(typed.length);
	    for (var i = 0; i < typed.length; i++) {
	      basic[i] = typed[i];
	    }
	    b64data = String.fromCharCode.apply(null, basic);
	  }
	  message += global.btoa(b64data);
	  return callback(message);
	};

	/**
	 * Decodes a packet. Changes format to Blob if requested.
	 *
	 * @return {Object} with `type` and `data` (if any)
	 * @api private
	 */

	exports.decodePacket = function (data, binaryType, utf8decode) {
	  // String data
	  if (typeof data == 'string' || data === undefined) {
	    if (data.charAt(0) == 'b') {
	      return exports.decodeBase64Packet(data.substr(1), binaryType);
	    }

	    if (utf8decode) {
	      try {
	        data = utf8.decode(data);
	      } catch (e) {
	        return err;
	      }
	    }
	    var type = data.charAt(0);

	    if (Number(type) != type || !packetslist[type]) {
	      return err;
	    }

	    if (data.length > 1) {
	      return { type: packetslist[type], data: data.substring(1) };
	    } else {
	      return { type: packetslist[type] };
	    }
	  }

	  var asArray = new Uint8Array(data);
	  var type = asArray[0];
	  var rest = sliceBuffer(data, 1);
	  if (Blob && binaryType === 'blob') {
	    rest = new Blob([rest]);
	  }
	  return { type: packetslist[type], data: rest };
	};

	/**
	 * Decodes a packet encoded in a base64 string
	 *
	 * @param {String} base64 encoded message
	 * @return {Object} with `type` and `data` (if any)
	 */

	exports.decodeBase64Packet = function(msg, binaryType) {
	  var type = packetslist[msg.charAt(0)];
	  if (!global.ArrayBuffer) {
	    return { type: type, data: { base64: true, data: msg.substr(1) } };
	  }

	  var data = base64encoder.decode(msg.substr(1));

	  if (binaryType === 'blob' && Blob) {
	    data = new Blob([data]);
	  }

	  return { type: type, data: data };
	};

	/**
	 * Encodes multiple messages (payload).
	 *
	 *     <length>:data
	 *
	 * Example:
	 *
	 *     11:hello world2:hi
	 *
	 * If any contents are binary, they will be encoded as base64 strings. Base64
	 * encoded strings are marked with a b before the length specifier
	 *
	 * @param {Array} packets
	 * @api private
	 */

	exports.encodePayload = function (packets, supportsBinary, callback) {
	  if (typeof supportsBinary == 'function') {
	    callback = supportsBinary;
	    supportsBinary = null;
	  }

	  var isBinary = hasBinary(packets);

	  if (supportsBinary && isBinary) {
	    if (Blob && !dontSendBlobs) {
	      return exports.encodePayloadAsBlob(packets, callback);
	    }

	    return exports.encodePayloadAsArrayBuffer(packets, callback);
	  }

	  if (!packets.length) {
	    return callback('0:');
	  }

	  function setLengthHeader(message) {
	    return message.length + ':' + message;
	  }

	  function encodeOne(packet, doneCallback) {
	    exports.encodePacket(packet, !isBinary ? false : supportsBinary, true, function(message) {
	      doneCallback(null, setLengthHeader(message));
	    });
	  }

	  map(packets, encodeOne, function(err, results) {
	    return callback(results.join(''));
	  });
	};

	/**
	 * Async array map using after
	 */

	function map(ary, each, done) {
	  var result = new Array(ary.length);
	  var next = after(ary.length, done);

	  var eachWithIndex = function(i, el, cb) {
	    each(el, function(error, msg) {
	      result[i] = msg;
	      cb(error, result);
	    });
	  };

	  for (var i = 0; i < ary.length; i++) {
	    eachWithIndex(i, ary[i], next);
	  }
	}

	/*
	 * Decodes data when a payload is maybe expected. Possible binary contents are
	 * decoded from their base64 representation
	 *
	 * @param {String} data, callback method
	 * @api public
	 */

	exports.decodePayload = function (data, binaryType, callback) {
	  if (typeof data != 'string') {
	    return exports.decodePayloadAsBinary(data, binaryType, callback);
	  }

	  if (typeof binaryType === 'function') {
	    callback = binaryType;
	    binaryType = null;
	  }

	  var packet;
	  if (data == '') {
	    // parser error - ignoring payload
	    return callback(err, 0, 1);
	  }

	  var length = ''
	    , n, msg;

	  for (var i = 0, l = data.length; i < l; i++) {
	    var chr = data.charAt(i);

	    if (':' != chr) {
	      length += chr;
	    } else {
	      if ('' == length || (length != (n = Number(length)))) {
	        // parser error - ignoring payload
	        return callback(err, 0, 1);
	      }

	      msg = data.substr(i + 1, n);

	      if (length != msg.length) {
	        // parser error - ignoring payload
	        return callback(err, 0, 1);
	      }

	      if (msg.length) {
	        packet = exports.decodePacket(msg, binaryType, true);

	        if (err.type == packet.type && err.data == packet.data) {
	          // parser error in individual packet - ignoring payload
	          return callback(err, 0, 1);
	        }

	        var ret = callback(packet, i + n, l);
	        if (false === ret) return;
	      }

	      // advance cursor
	      i += n;
	      length = '';
	    }
	  }

	  if (length != '') {
	    // parser error - ignoring payload
	    return callback(err, 0, 1);
	  }

	};

	/**
	 * Encodes multiple messages (payload) as binary.
	 *
	 * <1 = binary, 0 = string><number from 0-9><number from 0-9>[...]<number
	 * 255><data>
	 *
	 * Example:
	 * 1 3 255 1 2 3, if the binary contents are interpreted as 8 bit integers
	 *
	 * @param {Array} packets
	 * @return {ArrayBuffer} encoded payload
	 * @api private
	 */

	exports.encodePayloadAsArrayBuffer = function(packets, callback) {
	  if (!packets.length) {
	    return callback(new ArrayBuffer(0));
	  }

	  function encodeOne(packet, doneCallback) {
	    exports.encodePacket(packet, true, true, function(data) {
	      return doneCallback(null, data);
	    });
	  }

	  map(packets, encodeOne, function(err, encodedPackets) {
	    var totalLength = encodedPackets.reduce(function(acc, p) {
	      var len;
	      if (typeof p === 'string'){
	        len = p.length;
	      } else {
	        len = p.byteLength;
	      }
	      return acc + len.toString().length + len + 2; // string/binary identifier + separator = 2
	    }, 0);

	    var resultArray = new Uint8Array(totalLength);

	    var bufferIndex = 0;
	    encodedPackets.forEach(function(p) {
	      var isString = typeof p === 'string';
	      var ab = p;
	      if (isString) {
	        var view = new Uint8Array(p.length);
	        for (var i = 0; i < p.length; i++) {
	          view[i] = p.charCodeAt(i);
	        }
	        ab = view.buffer;
	      }

	      if (isString) { // not true binary
	        resultArray[bufferIndex++] = 0;
	      } else { // true binary
	        resultArray[bufferIndex++] = 1;
	      }

	      var lenStr = ab.byteLength.toString();
	      for (var i = 0; i < lenStr.length; i++) {
	        resultArray[bufferIndex++] = parseInt(lenStr[i]);
	      }
	      resultArray[bufferIndex++] = 255;

	      var view = new Uint8Array(ab);
	      for (var i = 0; i < view.length; i++) {
	        resultArray[bufferIndex++] = view[i];
	      }
	    });

	    return callback(resultArray.buffer);
	  });
	};

	/**
	 * Encode as Blob
	 */

	exports.encodePayloadAsBlob = function(packets, callback) {
	  function encodeOne(packet, doneCallback) {
	    exports.encodePacket(packet, true, true, function(encoded) {
	      var binaryIdentifier = new Uint8Array(1);
	      binaryIdentifier[0] = 1;
	      if (typeof encoded === 'string') {
	        var view = new Uint8Array(encoded.length);
	        for (var i = 0; i < encoded.length; i++) {
	          view[i] = encoded.charCodeAt(i);
	        }
	        encoded = view.buffer;
	        binaryIdentifier[0] = 0;
	      }

	      var len = (encoded instanceof ArrayBuffer)
	        ? encoded.byteLength
	        : encoded.size;

	      var lenStr = len.toString();
	      var lengthAry = new Uint8Array(lenStr.length + 1);
	      for (var i = 0; i < lenStr.length; i++) {
	        lengthAry[i] = parseInt(lenStr[i]);
	      }
	      lengthAry[lenStr.length] = 255;

	      if (Blob) {
	        var blob = new Blob([binaryIdentifier.buffer, lengthAry.buffer, encoded]);
	        doneCallback(null, blob);
	      }
	    });
	  }

	  map(packets, encodeOne, function(err, results) {
	    return callback(new Blob(results));
	  });
	};

	/*
	 * Decodes data when a payload is maybe expected. Strings are decoded by
	 * interpreting each byte as a key code for entries marked to start with 0. See
	 * description of encodePayloadAsBinary
	 *
	 * @param {ArrayBuffer} data, callback method
	 * @api public
	 */

	exports.decodePayloadAsBinary = function (data, binaryType, callback) {
	  if (typeof binaryType === 'function') {
	    callback = binaryType;
	    binaryType = null;
	  }

	  var bufferTail = data;
	  var buffers = [];

	  var numberTooLong = false;
	  while (bufferTail.byteLength > 0) {
	    var tailArray = new Uint8Array(bufferTail);
	    var isString = tailArray[0] === 0;
	    var msgLength = '';

	    for (var i = 1; ; i++) {
	      if (tailArray[i] == 255) break;

	      if (msgLength.length > 310) {
	        numberTooLong = true;
	        break;
	      }

	      msgLength += tailArray[i];
	    }

	    if(numberTooLong) return callback(err, 0, 1);

	    bufferTail = sliceBuffer(bufferTail, 2 + msgLength.length);
	    msgLength = parseInt(msgLength);

	    var msg = sliceBuffer(bufferTail, 0, msgLength);
	    if (isString) {
	      try {
	        msg = String.fromCharCode.apply(null, new Uint8Array(msg));
	      } catch (e) {
	        // iPhone Safari doesn't let you apply to typed arrays
	        var typed = new Uint8Array(msg);
	        msg = '';
	        for (var i = 0; i < typed.length; i++) {
	          msg += String.fromCharCode(typed[i]);
	        }
	      }
	    }

	    buffers.push(msg);
	    bufferTail = sliceBuffer(bufferTail, msgLength);
	  }

	  var total = buffers.length;
	  buffers.forEach(function(buffer, i) {
	    callback(exports.decodePacket(buffer, binaryType, true), i, total);
	  });
	};

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 10 */
/***/ function(module, exports, __webpack_require__) {

	// optional / simple context binding
	var aFunction = __webpack_require__(26);
	module.exports = function(fn, that, length){
	  aFunction(fn);
	  if(that === undefined)return fn;
	  switch(length){
	    case 1: return function(a){
	      return fn.call(that, a);
	    };
	    case 2: return function(a, b){
	      return fn.call(that, a, b);
	    };
	    case 3: return function(a, b, c){
	      return fn.call(that, a, b, c);
	    };
	  }
	  return function(/* ...args */){
	    return fn.apply(that, arguments);
	  };
	};

/***/ },
/* 11 */
/***/ function(module, exports) {

	var hasOwnProperty = {}.hasOwnProperty;
	module.exports = function(it, key){
	  return hasOwnProperty.call(it, key);
	};

/***/ },
/* 12 */
/***/ function(module, exports) {

	module.exports = function(it){
	  return typeof it === 'object' ? it !== null : typeof it === 'function';
	};

/***/ },
/* 13 */
/***/ function(module, exports) {

	module.exports = {};

/***/ },
/* 14 */
/***/ function(module, exports, __webpack_require__) {

	var anObject       = __webpack_require__(4)
	  , IE8_DOM_DEFINE = __webpack_require__(61)
	  , toPrimitive    = __webpack_require__(67)
	  , dP             = Object.defineProperty;

	exports.f = __webpack_require__(6) ? Object.defineProperty : function defineProperty(O, P, Attributes){
	  anObject(O);
	  P = toPrimitive(P, true);
	  anObject(Attributes);
	  if(IE8_DOM_DEFINE)try {
	    return dP(O, P, Attributes);
	  } catch(e){ /* empty */ }
	  if('get' in Attributes || 'set' in Attributes)throw TypeError('Accessors not supported!');
	  if('value' in Attributes)O[P] = Attributes.value;
	  return O;
	};

/***/ },
/* 15 */
/***/ function(module, exports) {

	var core = module.exports = {version: '2.4.0'};
	if(typeof __e == 'number')__e = core; // eslint-disable-line no-undef

/***/ },
/* 16 */
/***/ function(module, exports, __webpack_require__) {

	// Thank's IE8 for his funny defineProperty
	module.exports = !__webpack_require__(22)(function(){
	  return Object.defineProperty({}, 'a', {get: function(){ return 7; }}).a != 7;
	});

/***/ },
/* 17 */
/***/ function(module, exports) {

	
	module.exports = function(a, b){
	  var fn = function(){};
	  fn.prototype = b.prototype;
	  a.prototype = new fn;
	  a.prototype.constructor = a;
	};

/***/ },
/* 18 */
/***/ function(module, exports) {

	var toString = {}.toString;

	module.exports = function(it){
	  return toString.call(it).slice(8, -1);
	};

/***/ },
/* 19 */
/***/ function(module, exports, __webpack_require__) {

	// to indexed object, toObject with fallback for non-array-like ES3 strings
	var IObject = __webpack_require__(138)
	  , defined = __webpack_require__(27);
	module.exports = function(it){
	  return IObject(defined(it));
	};

/***/ },
/* 20 */
/***/ function(module, exports, __webpack_require__) {

	exports.nextTick = function nextTick(fn) {
		setTimeout(fn, 0);
	};

	exports.platform = exports.arch = 
	exports.execPath = exports.title = 'browser';
	exports.pid = 1;
	exports.browser = true;
	exports.env = {};
	exports.argv = [];

	exports.binding = function (name) {
		throw new Error('No such module. (Possibly not yet loaded)')
	};

	(function () {
	    var cwd = '/';
	    var path;
	    exports.cwd = function () { return cwd };
	    exports.chdir = function (dir) {
	        if (!path) path = __webpack_require__(77);
	        cwd = path.resolve(dir, cwd);
	    };
	})();

	exports.exit = exports.kill = 
	exports.umask = exports.dlopen = 
	exports.uptime = exports.memoryUsage = 
	exports.uvCounters = function() {};
	exports.features = {};


/***/ },
/* 21 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	/* WEBPACK VAR INJECTION */(function(process) {'use strict';

	const fs = __webpack_require__(73);
	const format = __webpack_require__(204).format;

	let isNodejs = process.version ? true : false;

	const LogLevels = {
	  'DEBUG': 'DEBUG',
	  'INFO':  'INFO',
	  'WARN':  'WARN',
	  'ERROR': 'ERROR',
	  'NONE':  'NONE',
	};

	// Global log level
	let GlobalLogLevel = LogLevels.DEBUG;

	// Global log file name
	let GlobalLogfile = null;

	// ANSI colors
	let Colors = {
	  'Black':   0,
	  'Red':     1,
	  'Green':   2,
	  'Yellow':  3,
	  'Blue':    4,
	  'Magenta': 5,
	  'Cyan':    6,
	  'Grey':    7,
	  'White':   9,
	  'Default': 9,
	};

	// CSS colors
	if(!isNodejs) {
	  Colors = {
	    'Black':   'Black',
	    'Red':     'IndianRed',
	    'Green':   'LimeGreen',
	    'Yellow':  'Orange',
	    'Blue':    'RoyalBlue',
	    'Magenta': 'Orchid',
	    'Cyan':    'SkyBlue',
	    'Grey':    'DimGrey',
	    'White':   'White',
	    'Default': 'Black',
	  };
	}

	const loglevelColors = [Colors.Cyan, Colors.Green, Colors.Yellow, Colors.Red, Colors.Default];

	const defaultOptions = {
	  useColors: true,
	  color: Colors.Default,
	  showTimestamp: true,
	  showLevel: true,
	  filename: GlobalLogfile,
	  appendFile: true,
	};

	class Logger {
	  constructor(category, options) {
	    this.category = category;
	    let opts = {};
	    Object.assign(opts, defaultOptions);
	    Object.assign(opts, options);
	    this.options = opts;
	  }

	  debug() {
	    this._write(LogLevels.DEBUG, format.apply(null, arguments));
	  }

	  log() {
	    this.debug.apply(this, arguments);
	  }

	  info() {
	    this._write(LogLevels.INFO, format.apply(null, arguments));
	  }

	  warn() {
	    this._write(LogLevels.WARN, format.apply(null, arguments));
	  }

	  error() {
	    this._write(LogLevels.ERROR, format.apply(null, arguments));
	  }

	  _write(level, text) {
	    if(!this._shouldLog(level))
	      return;

	    if((this.options.filename || GlobalLogfile) && !this.fileWriter)
	      this.fileWriter = fs.openSync(this.options.filename || GlobalLogfile, this.options.appendFile ? 'a+' : 'w+');

	    let format = this._format(level, text);
	    let unformattedText = this._createLogMessage(level, text);
	    let formattedText = this._createLogMessage(level, text, format.timestamp, format.level, format.category, format.text);

	    if(this.fileWriter)
	      fs.writeSync(this.fileWriter, unformattedText + '\n', null, 'utf-8');

	    if(isNodejs) {
	      console.log(formattedText)
	    } else {
	      // TODO: clean this up
	      if(level === LogLevels.ERROR) {
	        if(this.options.showTimestamp && this.options.showLevel) {
	          console.error(formattedText, format.timestamp, format.level, format.category, format.text)
	        } else if(this.options.showTimestamp && !this.options.showLevel) {
	          console.error(formattedText, format.timestamp, format.category, format.text)
	        } else if(!this.options.showTimestamp && this.options.showLevel) {
	          console.error(formattedText, format.level, format.category, format.text)
	        } else {
	          console.error(formattedText, format.category, format.text)
	        }
	      } else {
	        if(this.options.showTimestamp && this.options.showLevel) {
	          console.log(formattedText, format.timestamp, format.level, format.category, format.text)
	        } else if(this.options.showTimestamp && !this.options.showLevel) {
	          console.log(formattedText, format.timestamp, format.category, format.text)
	        } else if(!this.options.showTimestamp && this.options.showLevel) {
	          console.log(formattedText, format.level, format.category, format.text)
	        } else {
	          console.log(formattedText, format.category, format.text)
	        }
	      }
	    }
	  }

	  _format(level, text) {
	    let timestampFormat = '';
	    let levelFormat     = '';
	    let categoryFormat  = '';
	    let textFormat      = ': ';

	    if(this.options.useColors) {
	        const levelColor    = Object.keys(LogLevels).map((f) => LogLevels[f]).indexOf(level);
	        const categoryColor = this.options.color;

	      if(isNodejs) {
	        if(this.options.showTimestamp)
	          timestampFormat = '\u001b[3' + Colors.Grey + 'm';

	        if(this.options.showLevel)
	          levelFormat = '\u001b[3' + loglevelColors[levelColor] + ';22m';

	        categoryFormat = '\u001b[3' + categoryColor + ';1m';
	        textFormat = '\u001b[0m: ';
	      } else {
	        if(this.options.showTimestamp)
	          timestampFormat = 'color:' + Colors.Grey;

	        if(this.options.showLevel)
	          levelFormat = 'color:' + loglevelColors[levelColor];

	        categoryFormat = 'color:' + categoryColor + '; font-weight: bold';
	      }
	    }

	    return {
	      timestamp: timestampFormat,
	      level: levelFormat,
	      category: categoryFormat,
	      text: textFormat
	    };
	  }

	  _createLogMessage(level, text, timestampFormat, levelFormat, categoryFormat, textFormat) {
	    timestampFormat = timestampFormat || '';
	    levelFormat     = levelFormat     || '';
	    categoryFormat  = categoryFormat  || '';
	    textFormat      = textFormat      || ': ';

	    if(!isNodejs) {
	      if(this.options.showTimestamp)
	        timestampFormat = '%c';

	      if(this.options.showLevel)
	        levelFormat = '%c';

	      categoryFormat  = '%c';
	      textFormat = ': %c';
	    }

	    let result = '';

	    if(this.options.showTimestamp)
	      result += '' + new Date().toISOString() + ' ';

	    result = timestampFormat + result;

	    if(this.options.showLevel)
	      result += levelFormat + '[' + level +']' + (level === LogLevels.INFO || level === LogLevels.WARN ? ' ' : '') + ' ';

	    result += categoryFormat + this.category;
	    result += textFormat + text;
	    return result;
	  }

	  _shouldLog(level) {
	    const levels   = Object.keys(LogLevels).map((f) => LogLevels[f]);
	    const index    = levels.indexOf(level);
	    const levelIdx = levels.indexOf(GlobalLogLevel);
	    return index >= levelIdx;
	  }
	};

	/* Public API */
	module.exports = {
	  Colors: Colors,
	  LogLevels: LogLevels,
	  setLogLevel: (level) => {
	    GlobalLogLevel = level;
	  },
	  setLogfile: (filename) => {
	    GlobalLogfile = filename;
	  },
	  create: (category, options) => {
	    const logger = new Logger(category, options);
	    return logger;
	  },
	  forceBrowserMode: (force) => isNodejs = !force, // for testing
	};

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(20)))

/***/ },
/* 22 */
/***/ function(module, exports) {

	module.exports = function(exec){
	  try {
	    return !!exec();
	  } catch(e){
	    return true;
	  }
	};

/***/ },
/* 23 */
/***/ function(module, exports) {

	// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028
	var global = module.exports = typeof window != 'undefined' && window.Math == Math
	  ? window : typeof self != 'undefined' && self.Math == Math ? self : Function('return this')();
	if(typeof __g == 'number')__g = global; // eslint-disable-line no-undef

/***/ },
/* 24 */
/***/ function(module, exports) {

	module.exports = function(it){
	  return typeof it === 'object' ? it !== null : typeof it === 'function';
	};

/***/ },
/* 25 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	/* 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__(128)
	var ieee754 = __webpack_require__(182)
	var isArray = __webpack_require__(184)

	exports.Buffer = Buffer
	exports.SlowBuffer = SlowBuffer
	exports.INSPECT_MAX_BYTES = 50

	/**
	 * 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.
	 *
	 *   - 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()

	/*
	 * Export kMaxLength after typed array support is determined.
	 */
	exports.kMaxLength = kMaxLength()

	function typedArraySupport () {
	  try {
	    var arr = new Uint8Array(1)
	    arr.foo = function () { return 42 }
	    return arr.foo() === 42 && // typed array instances can be augmented
	        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
	}

	function createBuffer (that, length) {
	  if (kMaxLength() < length) {
	    throw new RangeError('Invalid typed array length')
	  }
	  if (Buffer.TYPED_ARRAY_SUPPORT) {
	    // Return an augmented `Uint8Array` instance, for best performance
	    that = new Uint8Array(length)
	    that.__proto__ = Buffer.prototype
	  } else {
	    // Fallback: Return an object instance of the Buffer class
	    if (that === null) {
	      that = new Buffer(length)
	    }
	    that.length = length
	  }

	  return that
	}

	/**
	 * The Buffer constructor returns instances of `Uint8Array` that have their
	 * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
	 * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
	 * and the `Uint8Array` methods. Square bracket notation works as expected -- it
	 * returns a single octet.
	 *
	 * The `Uint8Array` prototype remains unmodified.
	 */

	function Buffer (arg, encodingOrOffset, length) {
	  if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {
	    return new Buffer(arg, encodingOrOffset, length)
	  }

	  // Common case.
	  if (typeof arg === 'number') {
	    if (typeof encodingOrOffset === 'string') {
	      throw new Error(
	        'If encoding is specified then the first argument must be a string'
	      )
	    }
	    return allocUnsafe(this, arg)
	  }
	  return from(this, arg, encodingOrOffset, length)
	}

	Buffer.poolSize = 8192 // not used by this implementation

	// TODO: Legacy, not needed anymore. Remove in next major version.
	Buffer._augment = function (arr) {
	  arr.__proto__ = Buffer.prototype
	  return arr
	}

	function from (that, value, encodingOrOffset, length) {
	  if (typeof value === 'number') {
	    throw new TypeError('"value" argument must not be a number')
	  }

	  if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {
	    return fromArrayBuffer(that, value, encodingOrOffset, length)
	  }

	  if (typeof value === 'string') {
	    return fromString(that, value, encodingOrOffset)
	  }

	  return fromObject(that, value)
	}

	/**
	 * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
	 * if value is a number.
	 * Buffer.from(str[, encoding])
	 * Buffer.from(array)
	 * Buffer.from(buffer)
	 * Buffer.from(arrayBuffer[, byteOffset[, length]])
	 **/
	Buffer.from = function (value, encodingOrOffset, length) {
	  return from(null, value, encodingOrOffset, length)
	}

	if (Buffer.TYPED_ARRAY_SUPPORT) {
	  Buffer.prototype.__proto__ = Uint8Array.prototype
	  Buffer.__proto__ = Uint8Array
	  if (typeof Symbol !== 'undefined' && Symbol.species &&
	      Buffer[Symbol.species] === Buffer) {
	    // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97
	    Object.defineProperty(Buffer, Symbol.species, {
	      value: null,
	      configurable: true
	    })
	  }
	}

	function assertSize (size) {
	  if (typeof size !== 'number') {
	    throw new TypeError('"size" argument must be a number')
	  }
	}

	function alloc (that, size, fill, encoding) {
	  assertSize(size)
	  if (size <= 0) {
	    return createBuffer(that, size)
	  }
	  if (fill !== undefined) {
	    // Only pay attention to encoding if it's a string. This
	    // prevents accidentally sending in a number that would
	    // be interpretted as a start offset.
	    return typeof encoding === 'string'
	      ? createBuffer(that, size).fill(fill, encoding)
	      : createBuffer(that, size).fill(fill)
	  }
	  return createBuffer(that, size)
	}

	/**
	 * Creates a new filled Buffer instance.
	 * alloc(size[, fill[, encoding]])
	 **/
	Buffer.alloc = function (size, fill, encoding) {
	  return alloc(null, size, fill, encoding)
	}

	function allocUnsafe (that, size) {
	  assertSize(size)
	  that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)
	  if (!Buffer.TYPED_ARRAY_SUPPORT) {
	    for (var i = 0; i < size; i++) {
	      that[i] = 0
	    }
	  }
	  return that
	}

	/**
	 * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
	 * */
	Buffer.allocUnsafe = function (size) {
	  return allocUnsafe(null, size)
	}
	/**
	 * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
	 */
	Buffer.allocUnsafeSlow = function (size) {
	  return allocUnsafe(null, size)
	}

	function fromString (that, string, encoding) {
	  if (typeof encoding !== 'string' || encoding === '') {
	    encoding = 'utf8'
	  }

	  if (!Buffer.isEncoding(encoding)) {
	    throw new TypeError('"encoding" must be a valid string encoding')
	  }

	  var length = byteLength(string, encoding) | 0
	  that = createBuffer(that, length)

	  that.write(string, encoding)
	  return that
	}

	function fromArrayLike (that, array) {
	  var length = checked(array.length) | 0
	  that = createBuffer(that, length)
	  for (var i = 0; i < length; i += 1) {
	    that[i] = array[i] & 255
	  }
	  return that
	}

	function fromArrayBuffer (that, array, byteOffset, length) {
	  array.byteLength // this throws if `array` is not a valid ArrayBuffer

	  if (byteOffset < 0 || array.byteLength < byteOffset) {
	    throw new RangeError('\'offset\' is out of bounds')
	  }

	  if (array.byteLength < byteOffset + (length || 0)) {
	    throw new RangeError('\'length\' is out of bounds')
	  }

	  if (length === undefined) {
	    array = new Uint8Array(array, byteOffset)
	  } else {
	    array = new Uint8Array(array, byteOffset, length)
	  }

	  if (Buffer.TYPED_ARRAY_SUPPORT) {
	    // Return an augmented `Uint8Array` instance, for best performance
	    that = array
	    that.__proto__ = Buffer.prototype
	  } else {
	    // Fallback: Return an object instance of the Buffer class
	    that = fromArrayLike(that, array)
	  }
	  return that
	}

	function fromObject (that, obj) {
	  if (Buffer.isBuffer(obj)) {
	    var len = checked(obj.length) | 0
	    that = createBuffer(that, len)

	    if (that.length === 0) {
	      return that
	    }

	    obj.copy(that, 0, 0, len)
	    return that
	  }

	  if (obj) {
	    if ((typeof ArrayBuffer !== 'undefined' &&
	        obj.buffer instanceof ArrayBuffer) || 'length' in obj) {
	      if (typeof obj.length !== 'number' || isnan(obj.length)) {
	        return createBuffer(that, 0)
	      }
	      return fromArrayLike(that, obj)
	    }

	    if (obj.type === 'Buffer' && isArray(obj.data)) {
	      return fromArrayLike(that, obj.data)
	    }
	  }

	  throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')
	}

	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 (length) {
	  if (+length != length) { // eslint-disable-line eqeqeq
	    length = 0
	  }
	  return Buffer.alloc(+length)
	}

	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

	  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
	    if (a[i] !== b[i]) {
	      x = a[i]
	      y = b[i]
	      break
	    }
	  }

	  if (x < y) return -1
	  if (y < x) return 1
	  return 0
	}

	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 Buffer.alloc(0)
	  }

	  var i
	  if (length === undefined) {
	    length = 0
	    for (i = 0; i < list.length; i++) {
	      length += list[i].length
	    }
	  }

	  var buffer = Buffer.allocUnsafe(length)
	  var pos = 0
	  for (i = 0; i < list.length; i++) {
	    var buf = list[i]
	    if (!Buffer.isBuffer(buf)) {
	      throw new TypeError('"list" argument must be an Array of Buffers')
	    }
	    buf.copy(buffer, pos)
	    pos += buf.length
	  }
	  return buffer
	}

	function byteLength (string, encoding) {
	  if (Buffer.isBuffer(string)) {
	    return string.length
	  }
	  if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&
	      (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {
	    return string.byteLength
	  }
	  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':
	      case undefined:
	        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

	  // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
	  // property of a typed array.

	  // This behaves neither like String nor Uint8Array in that we set start/end
	  // to their upper/lower bounds if the value passed is out of range.
	  // undefined is handled specially as per ECMA-262 6th Edition,
	  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
	  if (start === undefined || start < 0) {
	    start = 0
	  }
	  // Return early if start > this.length. Done here to prevent potential uint32
	  // coercion fail below.
	  if (start > this.length) {
	    return ''
	  }

	  if (end === undefined || end > this.length) {
	    end = this.length
	  }

	  if (end <= 0) {
	    return ''
	  }

	  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.
	  end >>>= 0
	  start >>>= 0

	  if (end <= start) {
	    return ''
	  }

	  if (!encoding) encoding = 'utf8'

	  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
	    }
	  }
	}

	// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect
	// Buffer instances.
	Buffer.prototype._isBuffer = true

	function swap (b, n, m) {
	  var i = b[n]
	  b[n] = b[m]
	  b[m] = i
	}

	Buffer.prototype.swap16 = function swap16 () {
	  var len = this.length
	  if (len % 2 !== 0) {
	    throw new RangeError('Buffer size must be a multiple of 16-bits')
	  }
	  for (var i = 0; i < len; i += 2) {
	    swap(this, i, i + 1)
	  }
	  return this
	}

	Buffer.prototype.swap32 = function swap32 () {
	  var len = this.length
	  if (len % 4 !== 0) {
	    throw new RangeError('Buffer size must be a multiple of 32-bits')
	  }
	  for (var i = 0; i < len; i += 4) {
	    swap(this, i, i + 3)
	    swap(this, i + 1, i + 2)
	  }
	  return this
	}

	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 (target, start, end, thisStart, thisEnd) {
	  if (!Buffer.isBuffer(target)) {
	    throw new TypeError('Argument must be a Buffer')
	  }

	  if (start === undefined) {
	    start = 0
	  }
	  if (end === undefined) {
	    end = target ? target.length : 0
	  }
	  if (thisStart === undefined) {
	    thisStart = 0
	  }
	  if (thisEnd === undefined) {
	    thisEnd = this.length
	  }

	  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {
	    throw new RangeError('out of range index')
	  }

	  if (thisStart >= thisEnd && start >= end) {
	    return 0
	  }
	  if (thisStart >= thisEnd) {
	    return -1
	  }
	  if (start >= end) {
	    return 1
	  }

	  start >>>= 0
	  end >>>= 0
	  thisStart >>>= 0
	  thisEnd >>>= 0

	  if (this === target) return 0

	  var x = thisEnd - thisStart
	  var y = end - start
	  var len = Math.min(x, y)

	  var thisCopy = this.slice(thisStart, thisEnd)
	  var targetCopy = target.slice(start, end)

	  for (var i = 0; i < len; ++i) {
	    if (thisCopy[i] !== targetCopy[i]) {
	      x = thisCopy[i]
	      y = targetCopy[i]
	      break
	    }
	  }

	  if (x < y) return -1
	  if (y < x) return 1
	  return 0
	}

	function arrayIndexOf (arr, val, byteOffset, encoding) {
	  var indexSize = 1
	  var arrLength = arr.length
	  var valLength = val.length

	  if (encoding !== undefined) {
	    encoding = String(encoding).toLowerCase()
	    if (encoding === 'ucs2' || encoding === 'ucs-2' ||
	        encoding === 'utf16le' || encoding === 'utf-16le') {
	      if (arr.length < 2 || val.length < 2) {
	        return -1
	      }
	      indexSize = 2
	      arrLength /= 2
	      valLength /= 2
	      byteOffset /= 2
	    }
	  }

	  function read (buf, i) {
	    if (indexSize === 1) {
	      return buf[i]
	    } else {
	      return buf.readUInt16BE(i * indexSize)
	    }
	  }

	  var foundIndex = -1
	  for (var i = 0; byteOffset + i < arrLength; i++) {
	    if (read(arr, byteOffset + i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
	      if (foundIndex === -1) foundIndex = i
	      if (i - foundIndex + 1 === valLength) return (byteOffset + foundIndex) * indexSize
	    } else {
	      if (foundIndex !== -1) i -= i - foundIndex
	      foundIndex = -1
	    }
	  }
	  return -1
	}

	Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {
	  if (typeof byteOffset === 'string') {
	    encoding = byteOffset
	    byteOffset = 0
	  } else 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') {
	    val = Buffer.from(val, encoding)
	  }

	  if (Buffer.isBuffer(val)) {
	    // special case: looking for empty string/buffer always fails
	    if (val.length === 0) {
	      return -1
	    }
	    return arrayIndexOf(this, val, byteOffset, encoding)
	  }
	  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, encoding)
	  }

	  throw new TypeError('val must be string, number or Buffer')
	}

	Buffer.prototype.includes = function includes (val, byteOffset, encoding) {
	  return this.indexOf(val, byteOffset, encoding) !== -1
	}

	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)) return i
	    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 {
	    throw new Error(
	      'Buffer.write(string, encoding, offset[, length]) is no longer supported'
	    )
	  }

	  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 = this.subarray(start, end)
	    newBuf.__proto__ = Buffer.prototype
	  } else {
	    var sliceLen = end - start
	    newBuf = new Buffer(sliceLen, undefined)
	    for (var i = 0; i < sliceLen; i++) {
	      newBuf[i] = this[i + start]
	    }
	  }

	  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" argument must be a Buffer instance')
	  if (value > max || value < min) throw new RangeError('"value" argument 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) {
	    var maxBytes = Math.pow(2, 8 * byteLength) - 1
	    checkInt(this, value, offset, byteLength, maxBytes, 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) {
	    var maxBytes = Math.pow(2, 8 * byteLength) - 1
	    checkInt(this, value, offset, byteLength, maxBytes, 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 = 0
	  this[offset] = value & 0xFF
	  while (++i < byteLength && (mul *= 0x100)) {
	    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
	      sub = 1
	    }
	    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 = 0
	  this[offset + i] = value & 0xFF
	  while (--i >= 0 && (mul *= 0x100)) {
	    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
	      sub = 1
	    }
	    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 (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 {
	    Uint8Array.prototype.set.call(
	      target,
	      this.subarray(start, start + len),
	      targetStart
	    )
	  }

	  return len
	}

	// Usage:
	//    buffer.fill(number[, offset[, end]])
	//    buffer.fill(buffer[, offset[, end]])
	//    buffer.fill(string[, offset[, end]][, encoding])
	Buffer.prototype.fill = function fill (val, start, end, encoding) {
	  // Handle string cases:
	  if (typeof val === 'string') {
	    if (typeof start === 'string') {
	      encoding = start
	      start = 0
	      end = this.length
	    } else if (typeof end === 'string') {
	      encoding = end
	      end = this.length
	    }
	    if (val.length === 1) {
	      var code = val.charCodeAt(0)
	      if (code < 256) {
	        val = code
	      }
	    }
	    if (encoding !== undefined && typeof encoding !== 'string') {
	      throw new TypeError('encoding must be a string')
	    }
	    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {
	      throw new TypeError('Unknown encoding: ' + encoding)
	    }
	  } else if (typeof val === 'number') {
	    val = val & 255
	  }

	  // Invalid ranges are not set to a default, so can range check early.
	  if (start < 0 || this.length < start || this.length < end) {
	    throw new RangeError('Out of range index')
	  }

	  if (end <= start) {
	    return this
	  }

	  start = start >>> 0
	  end = end === undefined ? this.length : end >>> 0

	  if (!val) val = 0

	  var i
	  if (typeof val === 'number') {
	    for (i = start; i < end; i++) {
	      this[i] = val
	    }
	  } else {
	    var bytes = Buffer.isBuffer(val)
	      ? val
	      : utf8ToBytes(new Buffer(val, encoding).toString())
	    var len = bytes.length
	    for (i = 0; i < end - start; i++) {
	      this[i + start] = bytes[i % len]
	    }
	  }

	  return this
	}

	// HELPER FUNCTIONS
	// ================

	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
	}

	function isnan (val) {
	  return val !== val // eslint-disable-line no-self-compare
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(25).Buffer, __webpack_require__(0)))

/***/ },
/* 26 */
/***/ function(module, exports) {

	module.exports = function(it){
	  if(typeof it != 'function')throw TypeError(it + ' is not a function!');
	  return it;
	};

/***/ },
/* 27 */
/***/ function(module, exports) {

	// 7.2.1 RequireObjectCoercible(argument)
	module.exports = function(it){
	  if(it == undefined)throw TypeError("Can't call method on  " + it);
	  return it;
	};

/***/ },
/* 28 */
/***/ function(module, exports, __webpack_require__) {

	var isObject = __webpack_require__(12)
	  , document = __webpack_require__(2).document
	  // in old IE typeof document.createElement is 'object'
	  , is = isObject(document) && isObject(document.createElement);
	module.exports = function(it){
	  return is ? document.createElement(it) : {};
	};

/***/ },
/* 29 */
/***/ function(module, exports, __webpack_require__) {

	var global    = __webpack_require__(2)
	  , core      = __webpack_require__(5)
	  , ctx       = __webpack_require__(10)
	  , hide      = __webpack_require__(8)
	  , PROTOTYPE = 'prototype';

	var $export = function(type, name, source){
	  var IS_FORCED = type & $export.F
	    , IS_GLOBAL = type & $export.G
	    , IS_STATIC = type & $export.S
	    , IS_PROTO  = type & $export.P
	    , IS_BIND   = type & $export.B
	    , IS_WRAP   = type & $export.W
	    , exports   = IS_GLOBAL ? core : core[name] || (core[name] = {})
	    , expProto  = exports[PROTOTYPE]
	    , target    = IS_GLOBAL ? global : IS_STATIC ? global[name] : (global[name] || {})[PROTOTYPE]
	    , key, own, out;
	  if(IS_GLOBAL)source = name;
	  for(key in source){
	    // contains in native
	    own = !IS_FORCED && target && target[key] !== undefined;
	    if(own && key in exports)continue;
	    // export native or passed
	    out = own ? target[key] : source[key];
	    // prevent global pollution for namespaces
	    exports[key] = IS_GLOBAL && typeof target[key] != 'function' ? source[key]
	    // bind timers to global for call from export context
	    : IS_BIND && own ? ctx(out, global)
	    // wrap global constructors for prevent change them in library
	    : IS_WRAP && target[key] == out ? (function(C){
	      var F = function(a, b, c){
	        if(this instanceof C){
	          switch(arguments.length){
	            case 0: return new C;
	            case 1: return new C(a);
	            case 2: return new C(a, b);
	          } return new C(a, b, c);
	        } return C.apply(this, arguments);
	      };
	      F[PROTOTYPE] = C[PROTOTYPE];
	      return F;
	    // make static versions for prototype methods
	    })(out) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;
	    // export proto methods to core.%CONSTRUCTOR%.methods.%NAME%
	    if(IS_PROTO){
	      (exports.virtual || (exports.virtual = {}))[key] = out;
	      // export proto methods to core.%CONSTRUCTOR%.prototype.%NAME%
	      if(type & $export.R && expProto && !expProto[key])hide(expProto, key, out);
	    }
	  }
	};
	// type bitmap
	$export.F = 1;   // forced
	$export.G = 2;   // global
	$export.S = 4;   // static
	$export.P = 8;   // proto
	$export.B = 16;  // bind
	$export.W = 32;  // wrap
	$export.U = 64;  // safe
	$export.R = 128; // real proto method for `library` 
	module.exports = $export;

/***/ },
/* 30 */
/***/ function(module, exports) {

	module.exports = function(bitmap, value){
	  return {
	    enumerable  : !(bitmap & 1),
	    configurable: !(bitmap & 2),
	    writable    : !(bitmap & 4),
	    value       : value
	  };
	};

/***/ },
/* 31 */
/***/ function(module, exports, __webpack_require__) {

	var def = __webpack_require__(14).f
	  , has = __webpack_require__(11)
	  , TAG = __webpack_require__(1)('toStringTag');

	module.exports = function(it, tag, stat){
	  if(it && !has(it = stat ? it : it.prototype, TAG))def(it, TAG, {configurable: true, value: tag});
	};

/***/ },
/* 32 */
/***/ function(module, exports, __webpack_require__) {

	var shared = __webpack_require__(64)('keys')
	  , uid    = __webpack_require__(68);
	module.exports = function(key){
	  return shared[key] || (shared[key] = uid(key));
	};

/***/ },
/* 33 */
/***/ function(module, exports) {

	// 7.1.4 ToInteger
	var ceil  = Math.ceil
	  , floor = Math.floor;
	module.exports = function(it){
	  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);
	};

/***/ },
/* 34 */
/***/ function(module, exports, __webpack_require__) {

	/**
	 * Module dependencies.
	 */

	var parser = __webpack_require__(9);
	var Emitter = __webpack_require__(36);

	/**
	 * Module exports.
	 */

	module.exports = Transport;

	/**
	 * Transport abstract constructor.
	 *
	 * @param {Object} options.
	 * @api private
	 */

	function Transport (opts) {
	  this.path = opts.path;
	  this.hostname = opts.hostname;
	  this.port = opts.port;
	  this.secure = opts.secure;
	  this.query = opts.query;
	  this.timestampParam = opts.timestampParam;
	  this.timestampRequests = opts.timestampRequests;
	  this.readyState = '';
	  this.agent = opts.agent || false;
	  this.socket = opts.socket;
	  this.enablesXDR = opts.enablesXDR;

	  // SSL options for Node.js client
	  this.pfx = opts.pfx;
	  this.key = opts.key;
	  this.passphrase = opts.passphrase;
	  this.cert = opts.cert;
	  this.ca = opts.ca;
	  this.ciphers = opts.ciphers;
	  this.rejectUnauthorized = opts.rejectUnauthorized;

	  // other options for Node.js client
	  this.extraHeaders = opts.extraHeaders;
	}

	/**
	 * Mix in `Emitter`.
	 */

	Emitter(Transport.prototype);

	/**
	 * Emits an error.
	 *
	 * @param {String} str
	 * @return {Transport} for chaining
	 * @api public
	 */

	Transport.prototype.onError = function (msg, desc) {
	  var err = new Error(msg);
	  err.type = 'TransportError';
	  err.description = desc;
	  this.emit('error', err);
	  return this;
	};

	/**
	 * Opens the transport.
	 *
	 * @api public
	 */

	Transport.prototype.open = function () {
	  if ('closed' == this.readyState || '' == this.readyState) {
	    this.readyState = 'opening';
	    this.doOpen();
	  }

	  return this;
	};

	/**
	 * Closes the transport.
	 *
	 * @api private
	 */

	Transport.prototype.close = function () {
	  if ('opening' == this.readyState || 'open' == this.readyState) {
	    this.doClose();
	    this.onClose();
	  }

	  return this;
	};

	/**
	 * Sends multiple packets.
	 *
	 * @param {Array} packets
	 * @api private
	 */

	Transport.prototype.send = function(packets){
	  if ('open' == this.readyState) {
	    this.write(packets);
	  } else {
	    throw new Error('Transport not open');
	  }
	};

	/**
	 * Called upon open
	 *
	 * @api private
	 */

	Transport.prototype.onOpen = function () {
	  this.readyState = 'open';
	  this.writable = true;
	  this.emit('open');
	};

	/**
	 * Called with data.
	 *
	 * @param {String} data
	 * @api private
	 */

	Transport.prototype.onData = function(data){
	  var packet = parser.decodePacket(data, this.socket.binaryType);
	  this.onPacket(packet);
	};

	/**
	 * Called with a decoded packet.
	 */

	Transport.prototype.onPacket = function (packet) {
	  this.emit('packet', packet);
	};

	/**
	 * Called upon close.
	 *
	 * @api private
	 */

	Transport.prototype.onClose = function () {
	  this.readyState = 'closed';
	  this.emit('close');
	};


/***/ },
/* 35 */
/***/ function(module, exports, __webpack_require__) {

	// browser shim for xmlhttprequest module
	var hasCORS = __webpack_require__(181);

	module.exports = function(opts) {
	  var xdomain = opts.xdomain;

	  // scheme must be same when usign XDomainRequest
	  // http://blogs.msdn.com/b/ieinternals/archive/2010/05/13/xdomainrequest-restrictions-limitations-and-workarounds.aspx
	  var xscheme = opts.xscheme;

	  // XDomainRequest has a flow of not sending cookie, therefore it should be disabled as a default.
	  // https://github.com/Automattic/engine.io-client/pull/217
	  var enablesXDR = opts.enablesXDR;

	  // XMLHttpRequest can be disabled on IE
	  try {
	    if ('undefined' != typeof XMLHttpRequest && (!xdomain || hasCORS)) {
	      return new XMLHttpRequest();
	    }
	  } catch (e) { }

	  // Use XDomainRequest for IE8 if enablesXDR is true
	  // because loading bar keeps flashing when using jsonp-polling
	  // https://github.com/yujiosaka/socke.io-ie8-loading-example
	  try {
	    if ('undefined' != typeof XDomainRequest && !xscheme && enablesXDR) {
	      return new XDomainRequest();
	    }
	  } catch (e) { }

	  if (!xdomain) {
	    try {
	      return new ActiveXObject('Microsoft.XMLHTTP');
	    } catch(e) { }
	  }
	}


/***/ },
/* 36 */
/***/ function(module, exports) {

	
	/**
	 * Expose `Emitter`.
	 */

	module.exports = Emitter;

	/**
	 * Initialize a new `Emitter`.
	 *
	 * @api public
	 */

	function Emitter(obj) {
	  if (obj) return mixin(obj);
	};

	/**
	 * Mixin the emitter properties.
	 *
	 * @param {Object} obj
	 * @return {Object}
	 * @api private
	 */

	function mixin(obj) {
	  for (var key in Emitter.prototype) {
	    obj[key] = Emitter.prototype[key];
	  }
	  return obj;
	}

	/**
	 * Listen on the given `event` with `fn`.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.on =
	Emitter.prototype.addEventListener = function(event, fn){
	  this._callbacks = this._callbacks || {};
	  (this._callbacks[event] = this._callbacks[event] || [])
	    .push(fn);
	  return this;
	};

	/**
	 * Adds an `event` listener that will be invoked a single
	 * time then automatically removed.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.once = function(event, fn){
	  var self = this;
	  this._callbacks = this._callbacks || {};

	  function on() {
	    self.off(event, on);
	    fn.apply(this, arguments);
	  }

	  on.fn = fn;
	  this.on(event, on);
	  return this;
	};

	/**
	 * Remove the given callback for `event` or all
	 * registered callbacks.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.off =
	Emitter.prototype.removeListener =
	Emitter.prototype.removeAllListeners =
	Emitter.prototype.removeEventListener = function(event, fn){
	  this._callbacks = this._callbacks || {};

	  // all
	  if (0 == arguments.length) {
	    this._callbacks = {};
	    return this;
	  }

	  // specific event
	  var callbacks = this._callbacks[event];
	  if (!callbacks) return this;

	  // remove all handlers
	  if (1 == arguments.length) {
	    delete this._callbacks[event];
	    return this;
	  }

	  // remove specific handler
	  var cb;
	  for (var i = 0; i < callbacks.length; i++) {
	    cb = callbacks[i];
	    if (cb === fn || cb.fn === fn) {
	      callbacks.splice(i, 1);
	      break;
	    }
	  }
	  return this;
	};

	/**
	 * Emit `event` with the given args.
	 *
	 * @param {String} event
	 * @param {Mixed} ...
	 * @return {Emitter}
	 */

	Emitter.prototype.emit = function(event){
	  this._callbacks = this._callbacks || {};
	  var args = [].slice.call(arguments, 1)
	    , callbacks = this._callbacks[event];

	  if (callbacks) {
	    callbacks = callbacks.slice(0);
	    for (var i = 0, len = callbacks.length; i < len; ++i) {
	      callbacks[i].apply(this, args);
	    }
	  }

	  return this;
	};

	/**
	 * Return array of callbacks for `event`.
	 *
	 * @param {String} event
	 * @return {Array}
	 * @api public
	 */

	Emitter.prototype.listeners = function(event){
	  this._callbacks = this._callbacks || {};
	  return this._callbacks[event] || [];
	};

	/**
	 * Check if this emitter has `event` handlers.
	 *
	 * @param {String} event
	 * @return {Boolean}
	 * @api public
	 */

	Emitter.prototype.hasListeners = function(event){
	  return !! this.listeners(event).length;
	};


/***/ },
/* 37 */
/***/ function(module, exports) {

	// Copyright Joyent, Inc. and other Node contributors.
	//
	// Permission is hereby granted, free of charge, to any person obtaining a
	// copy of this software and associated documentation files (the
	// "Software"), to deal in the Software without restriction, including
	// without limitation the rights to use, copy, modify, merge, publish,
	// distribute, sublicense, and/or sell copies of the Software, and to permit
	// persons to whom the Software is furnished to do so, subject to the
	// following conditions:
	//
	// The above copyright notice and this permission notice shall be included
	// in all copies or substantial portions of the Software.
	//
	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
	// USE OR OTHER DEALINGS IN THE SOFTWARE.

	function EventEmitter() {
	  this._events = this._events || {};
	  this._maxListeners = this._maxListeners || undefined;
	}
	module.exports = EventEmitter;

	// Backwards-compat with node 0.10.x
	EventEmitter.EventEmitter = EventEmitter;

	EventEmitter.prototype._events = undefined;
	EventEmitter.prototype._maxListeners = undefined;

	// By default EventEmitters will print a warning if more than 10 listeners are
	// added to it. This is a useful default which helps finding memory leaks.
	EventEmitter.defaultMaxListeners = 10;

	// Obviously not all Emitters should be limited to 10. This function allows
	// that to be increased. Set to zero for unlimited.
	EventEmitter.prototype.setMaxListeners = function(n) {
	  if (!isNumber(n) || n < 0 || isNaN(n))
	    throw TypeError('n must be a positive number');
	  this._maxListeners = n;
	  return this;
	};

	EventEmitter.prototype.emit = function(type) {
	  var er, handler, len, args, i, listeners;

	  if (!this._events)
	    this._events = {};

	  // If there is no 'error' event listener then throw.
	  if (type === 'error') {
	    if (!this._events.error ||
	        (isObject(this._events.error) && !this._events.error.length)) {
	      er = arguments[1];
	      if (er instanceof Error) {
	        throw er; // Unhandled 'error' event
	      }
	      throw TypeError('Uncaught, unspecified "error" event.');
	    }
	  }

	  handler = this._events[type];

	  if (isUndefined(handler))
	    return false;

	  if (isFunction(handler)) {
	    switch (arguments.length) {
	      // fast cases
	      case 1:
	        handler.call(this);
	        break;
	      case 2:
	        handler.call(this, arguments[1]);
	        break;
	      case 3:
	        handler.call(this, arguments[1], arguments[2]);
	        break;
	      // slower
	      default:
	        args = Array.prototype.slice.call(arguments, 1);
	        handler.apply(this, args);
	    }
	  } else if (isObject(handler)) {
	    args = Array.prototype.slice.call(arguments, 1);
	    listeners = handler.slice();
	    len = listeners.length;
	    for (i = 0; i < len; i++)
	      listeners[i].apply(this, args);
	  }

	  return true;
	};

	EventEmitter.prototype.addListener = function(type, listener) {
	  var m;

	  if (!isFunction(listener))
	    throw TypeError('listener must be a function');

	  if (!this._events)
	    this._events = {};

	  // To avoid recursion in the case that type === "newListener"! Before
	  // adding it to the listeners, first emit "newListener".
	  if (this._events.newListener)
	    this.emit('newListener', type,
	              isFunction(listener.listener) ?
	              listener.listener : listener);

	  if (!this._events[type])
	    // Optimize the case of one listener. Don't need the extra array object.
	    this._events[type] = listener;
	  else if (isObject(this._events[type]))
	    // If we've already got an array, just append.
	    this._events[type].push(listener);
	  else
	    // Adding the second element, need to change to array.
	    this._events[type] = [this._events[type], listener];

	  // Check for listener leak
	  if (isObject(this._events[type]) && !this._events[type].warned) {
	    if (!isUndefined(this._maxListeners)) {
	      m = this._maxListeners;
	    } else {
	      m = EventEmitter.defaultMaxListeners;
	    }

	    if (m && m > 0 && this._events[type].length > m) {
	      this._events[type].warned = true;
	      console.error('(node) warning: possible EventEmitter memory ' +
	                    'leak detected. %d listeners added. ' +
	                    'Use emitter.setMaxListeners() to increase limit.',
	                    this._events[type].length);
	      if (typeof console.trace === 'function') {
	        // not supported in IE 10
	        console.trace();
	      }
	    }
	  }

	  return this;
	};

	EventEmitter.prototype.on = EventEmitter.prototype.addListener;

	EventEmitter.prototype.once = function(type, listener) {
	  if (!isFunction(listener))
	    throw TypeError('listener must be a function');

	  var fired = false;

	  function g() {
	    this.removeListener(type, g);

	    if (!fired) {
	      fired = true;
	      listener.apply(this, arguments);
	    }
	  }

	  g.listener = listener;
	  this.on(type, g);

	  return this;
	};

	// emits a 'removeListener' event iff the listener was removed
	EventEmitter.prototype.removeListener = function(type, listener) {
	  var list, position, length, i;

	  if (!isFunction(listener))
	    throw TypeError('listener must be a function');

	  if (!this._events || !this._events[type])
	    return this;

	  list = this._events[type];
	  length = list.length;
	  position = -1;

	  if (list === listener ||
	      (isFunction(list.listener) && list.listener === listener)) {
	    delete this._events[type];
	    if (this._events.removeListener)
	      this.emit('removeListener', type, listener);

	  } else if (isObject(list)) {
	    for (i = length; i-- > 0;) {
	      if (list[i] === listener ||
	          (list[i].listener && list[i].listener === listener)) {
	        position = i;
	        break;
	      }
	    }

	    if (position < 0)
	      return this;

	    if (list.length === 1) {
	      list.length = 0;
	      delete this._events[type];
	    } else {
	      list.splice(position, 1);
	    }

	    if (this._events.removeListener)
	      this.emit('removeListener', type, listener);
	  }

	  return this;
	};

	EventEmitter.prototype.removeAllListeners = function(type) {
	  var key, listeners;

	  if (!this._events)
	    return this;

	  // not listening for removeListener, no need to emit
	  if (!this._events.removeListener) {
	    if (arguments.length === 0)
	      this._events = {};
	    else if (this._events[type])
	      delete this._events[type];
	    return this;
	  }

	  // emit removeListener for all listeners on all events
	  if (arguments.length === 0) {
	    for (key in this._events) {
	      if (key === 'removeListener') continue;
	      this.removeAllListeners(key);
	    }
	    this.removeAllListeners('removeListener');
	    this._events = {};
	    return this;
	  }

	  listeners = this._events[type];

	  if (isFunction(listeners)) {
	    this.removeListener(type, listeners);
	  } else if (listeners) {
	    // LIFO order
	    while (listeners.length)
	      this.removeListener(type, listeners[listeners.length - 1]);
	  }
	  delete this._events[type];

	  return this;
	};

	EventEmitter.prototype.listeners = function(type) {
	  var ret;
	  if (!this._events || !this._events[type])
	    ret = [];
	  else if (isFunction(this._events[type]))
	    ret = [this._events[type]];
	  else
	    ret = this._events[type].slice();
	  return ret;
	};

	EventEmitter.prototype.listenerCount = function(type) {
	  if (this._events) {
	    var evlistener = this._events[type];

	    if (isFunction(evlistener))
	      return 1;
	    else if (evlistener)
	      return evlistener.length;
	  }
	  return 0;
	};

	EventEmitter.listenerCount = function(emitter, type) {
	  return emitter.listenerCount(type);
	};

	function isFunction(arg) {
	  return typeof arg === 'function';
	}

	function isNumber(arg) {
	  return typeof arg === 'number';
	}

	function isObject(arg) {
	  return typeof arg === 'object' && arg !== null;
	}

	function isUndefined(arg) {
	  return arg === void 0;
	}


/***/ },
/* 38 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const EventEmitter = __webpack_require__(37).EventEmitter;
	const Log          = __webpack_require__(121);
	const Index        = __webpack_require__(194);
	const Cache        = __webpack_require__(193);

	class Store {
	  constructor(ipfs, id, dbname, options) {
	    this.id = id;
	    this.dbname = dbname;
	    this.events = new EventEmitter();

	    if(!options) options = {};
	    if(!options.Index) Object.assign(options, { Index: Index });
	    if(!options.cacheFile) Object.assign(options, { cacheFile: null });

	    this.options = options;
	    this._index = new this.options.Index(this.id);
	    this._oplog = null;
	    this._ipfs = ipfs;
	    this._lastWrite = null;
	  }

	  use() {
	    this.events.emit('load', this.dbname);
	    this._oplog = new Log(this._ipfs, this.id, this.dbname, this.options);
	    return Cache.loadCache(this.options.cacheFile).then(() => {
	      const cached = Cache.get(this.dbname);
	      if(cached) {
	        this._lastWrite = cached;
	        return Log.fromIpfsHash(this._ipfs, cached)
	          .then((log) => this._oplog.join(log))
	          .then((merged) => this._index.updateIndex(this._oplog, merged))
	          .then(() => this.events.emit('ready', this.dbname))
	          .then(() => this)
	      }

	      this.events.emit('ready', this.dbname)
	      return Promise.resolve(this);
	    });
	  }

	  close() {
	    this.events.emit('close', this.dbname);
	  }

	  sync(hash) {
	    if(!hash || hash === this._lastWrite) {
	      this.events.emit('updated', this.dbname, []);
	      return Promise.resolve([]);
	    }

	    const oldCount = this._oplog.items.length;
	    let newItems = [];
	    this.events.emit('sync', this.dbname);
	    this._lastWrite = hash;
	    return Log.fromIpfsHash(this._ipfs, hash)
	      .then((log) => this._oplog.join(log))
	      .then((merged) => newItems = merged)
	      .then(() => Cache.set(this.dbname, hash))
	      .then(() => this._index.updateIndex(this._oplog, newItems))
	      .then(() => {
	        // if(newItems.length > 0)
	          this.events.emit('updated', this.dbname, newItems);
	      })
	      .then(() => newItems)
	  }

	  delete() {
	    this._index = new this.options.Index(this.id);
	    if(this._oplog)
	      this._oplog.clear();
	  }

	  _addOperation(data) {
	    let result, logHash;
	    if(this._oplog) {
	      return this._oplog.add(data)
	        .then((res) => result = res)
	        .then(() => Log.getIpfsHash(this._ipfs, this._oplog))
	        .then((hash) => logHash = hash)
	        .then(() => this._lastWrite = logHash)
	        .then(() => Cache.set(this.dbname, logHash))
	        .then(() => this._index.updateIndex(this._oplog, [result]))
	        .then(() => this.events.emit('data', this.dbname, logHash))
	        .then(() => result.hash);
	    }
	  }
	}

	module.exports = Store;


/***/ },
/* 39 */
/***/ function(module, exports) {

	/**
	 * Compiles a querystring
	 * Returns string representation of the object
	 *
	 * @param {Object}
	 * @api private
	 */

	exports.encode = function (obj) {
	  var str = '';

	  for (var i in obj) {
	    if (obj.hasOwnProperty(i)) {
	      if (str.length) str += '&';
	      str += encodeURIComponent(i) + '=' + encodeURIComponent(obj[i]);
	    }
	  }

	  return str;
	};

	/**
	 * Parses a simple querystring into an object
	 *
	 * @param {String} qs
	 * @api private
	 */

	exports.decode = function(qs){
	  var qry = {};
	  var pairs = qs.split('&');
	  for (var i = 0, l = pairs.length; i < l; i++) {
	    var pair = pairs[i].split('=');
	    qry[decodeURIComponent(pair[0])] = decodeURIComponent(pair[1]);
	  }
	  return qry;
	};


/***/ },
/* 40 */
/***/ function(module, exports, __webpack_require__) {

	
	/**
	 * Module dependencies.
	 */

	var debug = __webpack_require__(3)('socket.io-parser');
	var json = __webpack_require__(185);
	var isArray = __webpack_require__(82);
	var Emitter = __webpack_require__(200);
	var binary = __webpack_require__(199);
	var isBuf = __webpack_require__(81);

	/**
	 * Protocol version.
	 *
	 * @api public
	 */

	exports.protocol = 4;

	/**
	 * Packet types.
	 *
	 * @api public
	 */

	exports.types = [
	  'CONNECT',
	  'DISCONNECT',
	  'EVENT',
	  'ACK',
	  'ERROR',
	  'BINARY_EVENT',
	  'BINARY_ACK'
	];

	/**
	 * Packet type `connect`.
	 *
	 * @api public
	 */

	exports.CONNECT = 0;

	/**
	 * Packet type `disconnect`.
	 *
	 * @api public
	 */

	exports.DISCONNECT = 1;

	/**
	 * Packet type `event`.
	 *
	 * @api public
	 */

	exports.EVENT = 2;

	/**
	 * Packet type `ack`.
	 *
	 * @api public
	 */

	exports.ACK = 3;

	/**
	 * Packet type `error`.
	 *
	 * @api public
	 */

	exports.ERROR = 4;

	/**
	 * Packet type 'binary event'
	 *
	 * @api public
	 */

	exports.BINARY_EVENT = 5;

	/**
	 * Packet type `binary ack`. For acks with binary arguments.
	 *
	 * @api public
	 */

	exports.BINARY_ACK = 6;

	/**
	 * Encoder constructor.
	 *
	 * @api public
	 */

	exports.Encoder = Encoder;

	/**
	 * Decoder constructor.
	 *
	 * @api public
	 */

	exports.Decoder = Decoder;

	/**
	 * A socket.io Encoder instance
	 *
	 * @api public
	 */

	function Encoder() {}

	/**
	 * Encode a packet as a single string if non-binary, or as a
	 * buffer sequence, depending on packet type.
	 *
	 * @param {Object} obj - packet object
	 * @param {Function} callback - function to handle encodings (likely engine.write)
	 * @return Calls callback with Array of encodings
	 * @api public
	 */

	Encoder.prototype.encode = function(obj, callback){
	  debug('encoding packet %j', obj);

	  if (exports.BINARY_EVENT == obj.type || exports.BINARY_ACK == obj.type) {
	    encodeAsBinary(obj, callback);
	  }
	  else {
	    var encoding = encodeAsString(obj);
	    callback([encoding]);
	  }
	};

	/**
	 * Encode packet as string.
	 *
	 * @param {Object} packet
	 * @return {String} encoded
	 * @api private
	 */

	function encodeAsString(obj) {
	  var str = '';
	  var nsp = false;

	  // first is type
	  str += obj.type;

	  // attachments if we have them
	  if (exports.BINARY_EVENT == obj.type || exports.BINARY_ACK == obj.type) {
	    str += obj.attachments;
	    str += '-';
	  }

	  // if we have a namespace other than `/`
	  // we append it followed by a comma `,`
	  if (obj.nsp && '/' != obj.nsp) {
	    nsp = true;
	    str += obj.nsp;
	  }

	  // immediately followed by the id
	  if (null != obj.id) {
	    if (nsp) {
	      str += ',';
	      nsp = false;
	    }
	    str += obj.id;
	  }

	  // json data
	  if (null != obj.data) {
	    if (nsp) str += ',';
	    str += json.stringify(obj.data);
	  }

	  debug('encoded %j as %s', obj, str);
	  return str;
	}

	/**
	 * Encode packet as 'buffer sequence' by removing blobs, and
	 * deconstructing packet into object with placeholders and
	 * a list of buffers.
	 *
	 * @param {Object} packet
	 * @return {Buffer} encoded
	 * @api private
	 */

	function encodeAsBinary(obj, callback) {

	  function writeEncoding(bloblessData) {
	    var deconstruction = binary.deconstructPacket(bloblessData);
	    var pack = encodeAsString(deconstruction.packet);
	    var buffers = deconstruction.buffers;

	    buffers.unshift(pack); // add packet info to beginning of data list
	    callback(buffers); // write all the buffers
	  }

	  binary.removeBlobs(obj, writeEncoding);
	}

	/**
	 * A socket.io Decoder instance
	 *
	 * @return {Object} decoder
	 * @api public
	 */

	function Decoder() {
	  this.reconstructor = null;
	}

	/**
	 * Mix in `Emitter` with Decoder.
	 */

	Emitter(Decoder.prototype);

	/**
	 * Decodes an ecoded packet string into packet JSON.
	 *
	 * @param {String} obj - encoded packet
	 * @return {Object} packet
	 * @api public
	 */

	Decoder.prototype.add = function(obj) {
	  var packet;
	  if ('string' == typeof obj) {
	    packet = decodeString(obj);
	    if (exports.BINARY_EVENT == packet.type || exports.BINARY_ACK == packet.type) { // binary packet's json
	      this.reconstructor = new BinaryReconstructor(packet);

	      // no attachments, labeled binary but no binary data to follow
	      if (this.reconstructor.reconPack.attachments === 0) {
	        this.emit('decoded', packet);
	      }
	    } else { // non-binary full packet
	      this.emit('decoded', packet);
	    }
	  }
	  else if (isBuf(obj) || obj.base64) { // raw binary data
	    if (!this.reconstructor) {
	      throw new Error('got binary data when not reconstructing a packet');
	    } else {
	      packet = this.reconstructor.takeBinaryData(obj);
	      if (packet) { // received final buffer
	        this.reconstructor = null;
	        this.emit('decoded', packet);
	      }
	    }
	  }
	  else {
	    throw new Error('Unknown type: ' + obj);
	  }
	};

	/**
	 * Decode a packet String (JSON data)
	 *
	 * @param {String} str
	 * @return {Object} packet
	 * @api private
	 */

	function decodeString(str) {
	  var p = {};
	  var i = 0;

	  // look up type
	  p.type = Number(str.charAt(0));
	  if (null == exports.types[p.type]) return error();

	  // look up attachments if type binary
	  if (exports.BINARY_EVENT == p.type || exports.BINARY_ACK == p.type) {
	    var buf = '';
	    while (str.charAt(++i) != '-') {
	      buf += str.charAt(i);
	      if (i == str.length) break;
	    }
	    if (buf != Number(buf) || str.charAt(i) != '-') {
	      throw new Error('Illegal attachments');
	    }
	    p.attachments = Number(buf);
	  }

	  // look up namespace (if any)
	  if ('/' == str.charAt(i + 1)) {
	    p.nsp = '';
	    while (++i) {
	      var c = str.charAt(i);
	      if (',' == c) break;
	      p.nsp += c;
	      if (i == str.length) break;
	    }
	  } else {
	    p.nsp = '/';
	  }

	  // look up id
	  var next = str.charAt(i + 1);
	  if ('' !== next && Number(next) == next) {
	    p.id = '';
	    while (++i) {
	      var c = str.charAt(i);
	      if (null == c || Number(c) != c) {
	        --i;
	        break;
	      }
	      p.id += str.charAt(i);
	      if (i == str.length) break;
	    }
	    p.id = Number(p.id);
	  }

	  // look up json data
	  if (str.charAt(++i)) {
	    try {
	      p.data = json.parse(str.substr(i));
	    } catch(e){
	      return error();
	    }
	  }

	  debug('decoded %s as %j', str, p);
	  return p;
	}

	/**
	 * Deallocates a parser's resources
	 *
	 * @api public
	 */

	Decoder.prototype.destroy = function() {
	  if (this.reconstructor) {
	    this.reconstructor.finishedReconstruction();
	  }
	};

	/**
	 * A manager of a binary event's 'buffer sequence'. Should
	 * be constructed whenever a packet of type BINARY_EVENT is
	 * decoded.
	 *
	 * @param {Object} packet
	 * @return {BinaryReconstructor} initialized reconstructor
	 * @api private
	 */

	function BinaryReconstructor(packet) {
	  this.reconPack = packet;
	  this.buffers = [];
	}

	/**
	 * Method to be called when binary data received from connection
	 * after a BINARY_EVENT packet.
	 *
	 * @param {Buffer | ArrayBuffer} binData - the raw binary data received
	 * @return {null | Object} returns null if more binary data is expected or
	 *   a reconstructed packet object if all buffers have been received.
	 * @api private
	 */

	BinaryReconstructor.prototype.takeBinaryData = function(binData) {
	  this.buffers.push(binData);
	  if (this.buffers.length == this.reconPack.attachments) { // done with buffer list
	    var packet = binary.reconstructPacket(this.reconPack, this.buffers);
	    this.finishedReconstruction();
	    return packet;
	  }
	  return null;
	};

	/**
	 * Cleans up binary packet reconstruction variables.
	 *
	 * @api private
	 */

	BinaryReconstructor.prototype.finishedReconstruction = function() {
	  this.reconPack = null;
	  this.buffers = [];
	};

	function error(data){
	  return {
	    type: exports.ERROR,
	    data: 'parser error'
	  };
	}


/***/ },
/* 41 */
/***/ function(module, exports) {

	module.exports = function(module) {
		if(!module.webpackPolyfill) {
			module.deprecate = function() {};
			module.paths = [];
			// module.parent = undefined by default
			module.children = [];
			Object.defineProperty(module, "loaded", {
				enumerable: true,
				configurable: false,
				get: function() { return module.l; }
			});
			Object.defineProperty(module, "id", {
				enumerable: true,
				configurable: false,
				get: function() { return module.i; }
			});
			module.webpackPolyfill = 1;
		}
		return module;
	}


/***/ },
/* 42 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = { "default": __webpack_require__(89), __esModule: true };

/***/ },
/* 43 */
/***/ function(module, exports) {

	"use strict";
	"use strict";

	exports.__esModule = true;

	exports.default = function (instance, Constructor) {
	  if (!(instance instanceof Constructor)) {
	    throw new TypeError("Cannot call a class as a function");
	  }
	};

/***/ },
/* 44 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	"use strict";

	exports.__esModule = true;

	var _defineProperty = __webpack_require__(87);

	var _defineProperty2 = _interopRequireDefault(_defineProperty);

	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

	exports.default = 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;
	      (0, _defineProperty2.default)(target, descriptor.key, descriptor);
	    }
	  }

	  return function (Constructor, protoProps, staticProps) {
	    if (protoProps) defineProperties(Constructor.prototype, protoProps);
	    if (staticProps) defineProperties(Constructor, staticProps);
	    return Constructor;
	  };
	}();

/***/ },
/* 45 */
/***/ function(module, exports) {

	// 7.2.1 RequireObjectCoercible(argument)
	module.exports = function(it){
	  if(it == undefined)throw TypeError("Can't call method on  " + it);
	  return it;
	};

/***/ },
/* 46 */
/***/ function(module, exports, __webpack_require__) {

	var global    = __webpack_require__(23)
	  , core      = __webpack_require__(15)
	  , ctx       = __webpack_require__(96)
	  , hide      = __webpack_require__(100)
	  , PROTOTYPE = 'prototype';

	var $export = function(type, name, source){
	  var IS_FORCED = type & $export.F
	    , IS_GLOBAL = type & $export.G
	    , IS_STATIC = type & $export.S
	    , IS_PROTO  = type & $export.P
	    , IS_BIND   = type & $export.B
	    , IS_WRAP   = type & $export.W
	    , exports   = IS_GLOBAL ? core : core[name] || (core[name] = {})
	    , expProto  = exports[PROTOTYPE]
	    , target    = IS_GLOBAL ? global : IS_STATIC ? global[name] : (global[name] || {})[PROTOTYPE]
	    , key, own, out;
	  if(IS_GLOBAL)source = name;
	  for(key in source){
	    // contains in native
	    own = !IS_FORCED && target && target[key] !== undefined;
	    if(own && key in exports)continue;
	    // export native or passed
	    out = own ? target[key] : source[key];
	    // prevent global pollution for namespaces
	    exports[key] = IS_GLOBAL && typeof target[key] != 'function' ? source[key]
	    // bind timers to global for call from export context
	    : IS_BIND && own ? ctx(out, global)
	    // wrap global constructors for prevent change them in library
	    : IS_WRAP && target[key] == out ? (function(C){
	      var F = function(a, b, c){
	        if(this instanceof C){
	          switch(arguments.length){
	            case 0: return new C;
	            case 1: return new C(a);
	            case 2: return new C(a, b);
	          } return new C(a, b, c);
	        } return C.apply(this, arguments);
	      };
	      F[PROTOTYPE] = C[PROTOTYPE];
	      return F;
	    // make static versions for prototype methods
	    })(out) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;
	    // export proto methods to core.%CONSTRUCTOR%.methods.%NAME%
	    if(IS_PROTO){
	      (exports.virtual || (exports.virtual = {}))[key] = out;
	      // export proto methods to core.%CONSTRUCTOR%.prototype.%NAME%
	      if(type & $export.R && expProto && !expProto[key])hide(expProto, key, out);
	    }
	  }
	};
	// type bitmap
	$export.F = 1;   // forced
	$export.G = 2;   // global
	$export.S = 4;   // static
	$export.P = 8;   // proto
	$export.B = 16;  // bind
	$export.W = 32;  // wrap
	$export.U = 64;  // safe
	$export.R = 128; // real proto method for `library` 
	module.exports = $export;

/***/ },
/* 47 */
/***/ function(module, exports, __webpack_require__) {

	// fallback for non-array-like ES3 and non-enumerable old V8 strings
	var cof = __webpack_require__(95);
	module.exports = Object('z').propertyIsEnumerable(0) ? Object : function(it){
	  return cof(it) == 'String' ? it.split('') : Object(it);
	};

/***/ },
/* 48 */
/***/ function(module, exports, __webpack_require__) {

	var anObject       = __webpack_require__(93)
	  , IE8_DOM_DEFINE = __webpack_require__(101)
	  , toPrimitive    = __webpack_require__(113)
	  , dP             = Object.defineProperty;

	exports.f = __webpack_require__(16) ? Object.defineProperty : function defineProperty(O, P, Attributes){
	  anObject(O);
	  P = toPrimitive(P, true);
	  anObject(Attributes);
	  if(IE8_DOM_DEFINE)try {
	    return dP(O, P, Attributes);
	  } catch(e){ /* empty */ }
	  if('get' in Attributes || 'set' in Attributes)throw TypeError('Accessors not supported!');
	  if('value' in Attributes)O[P] = Attributes.value;
	  return O;
	};

/***/ },
/* 49 */
/***/ function(module, exports) {

	// 7.1.4 ToInteger
	var ceil  = Math.ceil
	  , floor = Math.floor;
	module.exports = function(it){
	  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);
	};

/***/ },
/* 50 */
/***/ function(module, exports, __webpack_require__) {

	// to indexed object, toObject with fallback for non-array-like ES3 strings
	var IObject = __webpack_require__(47)
	  , defined = __webpack_require__(45);
	module.exports = function(it){
	  return IObject(defined(it));
	};

/***/ },
/* 51 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = { "default": __webpack_require__(130), __esModule: true };

/***/ },
/* 52 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = { "default": __webpack_require__(132), __esModule: true };

/***/ },
/* 53 */
/***/ function(module, exports) {

	"use strict";
	"use strict";

	exports.__esModule = true;

	exports.default = function (instance, Constructor) {
	  if (!(instance instanceof Constructor)) {
	    throw new TypeError("Cannot call a class as a function");
	  }
	};

/***/ },
/* 54 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	"use strict";

	exports.__esModule = true;

	var _defineProperty = __webpack_require__(125);

	var _defineProperty2 = _interopRequireDefault(_defineProperty);

	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

	exports.default = 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;
	      (0, _defineProperty2.default)(target, descriptor.key, descriptor);
	    }
	  }

	  return function (Constructor, protoProps, staticProps) {
	    if (protoProps) defineProperties(Constructor.prototype, protoProps);
	    if (staticProps) defineProperties(Constructor, staticProps);
	    return Constructor;
	  };
	}();

/***/ },
/* 55 */
/***/ function(module, exports) {

	/**
	 * Slice reference.
	 */

	var slice = [].slice;

	/**
	 * Bind `obj` to `fn`.
	 *
	 * @param {Object} obj
	 * @param {Function|String} fn or string
	 * @return {Function}
	 * @api public
	 */

	module.exports = function(obj, fn){
	  if ('string' == typeof fn) fn = obj[fn];
	  if ('function' != typeof fn) throw new Error('bind() requires a function');
	  var args = slice.call(arguments, 2);
	  return function(){
	    return fn.apply(obj, args.concat(slice.call(arguments)));
	  }
	};


/***/ },
/* 56 */
/***/ function(module, exports) {

	
	/**
	 * Expose `Emitter`.
	 */

	module.exports = Emitter;

	/**
	 * Initialize a new `Emitter`.
	 *
	 * @api public
	 */

	function Emitter(obj) {
	  if (obj) return mixin(obj);
	};

	/**
	 * Mixin the emitter properties.
	 *
	 * @param {Object} obj
	 * @return {Object}
	 * @api private
	 */

	function mixin(obj) {
	  for (var key in Emitter.prototype) {
	    obj[key] = Emitter.prototype[key];
	  }
	  return obj;
	}

	/**
	 * Listen on the given `event` with `fn`.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.on =
	Emitter.prototype.addEventListener = function(event, fn){
	  this._callbacks = this._callbacks || {};
	  (this._callbacks['$' + event] = this._callbacks['$' + event] || [])
	    .push(fn);
	  return this;
	};

	/**
	 * Adds an `event` listener that will be invoked a single
	 * time then automatically removed.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.once = function(event, fn){
	  function on() {
	    this.off(event, on);
	    fn.apply(this, arguments);
	  }

	  on.fn = fn;
	  this.on(event, on);
	  return this;
	};

	/**
	 * Remove the given callback for `event` or all
	 * registered callbacks.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.off =
	Emitter.prototype.removeListener =
	Emitter.prototype.removeAllListeners =
	Emitter.prototype.removeEventListener = function(event, fn){
	  this._callbacks = this._callbacks || {};

	  // all
	  if (0 == arguments.length) {
	    this._callbacks = {};
	    return this;
	  }

	  // specific event
	  var callbacks = this._callbacks['$' + event];
	  if (!callbacks) return this;

	  // remove all handlers
	  if (1 == arguments.length) {
	    delete this._callbacks['$' + event];
	    return this;
	  }

	  // remove specific handler
	  var cb;
	  for (var i = 0; i < callbacks.length; i++) {
	    cb = callbacks[i];
	    if (cb === fn || cb.fn === fn) {
	      callbacks.splice(i, 1);
	      break;
	    }
	  }
	  return this;
	};

	/**
	 * Emit `event` with the given args.
	 *
	 * @param {String} event
	 * @param {Mixed} ...
	 * @return {Emitter}
	 */

	Emitter.prototype.emit = function(event){
	  this._callbacks = this._callbacks || {};
	  var args = [].slice.call(arguments, 1)
	    , callbacks = this._callbacks['$' + event];

	  if (callbacks) {
	    callbacks = callbacks.slice(0);
	    for (var i = 0, len = callbacks.length; i < len; ++i) {
	      callbacks[i].apply(this, args);
	    }
	  }

	  return this;
	};

	/**
	 * Return array of callbacks for `event`.
	 *
	 * @param {String} event
	 * @return {Array}
	 * @api public
	 */

	Emitter.prototype.listeners = function(event){
	  this._callbacks = this._callbacks || {};
	  return this._callbacks['$' + event] || [];
	};

	/**
	 * Check if this emitter has `event` handlers.
	 *
	 * @param {String} event
	 * @return {Boolean}
	 * @api public
	 */

	Emitter.prototype.hasListeners = function(event){
	  return !! this.listeners(event).length;
	};


/***/ },
/* 57 */
/***/ function(module, exports, __webpack_require__) {

	// getting tag from 19.1.3.6 Object.prototype.toString()
	var cof = __webpack_require__(18)
	  , TAG = __webpack_require__(1)('toStringTag')
	  // ES3 wrong here
	  , ARG = cof(function(){ return arguments; }()) == 'Arguments';

	// fallback for IE11 Script Access Denied error
	var tryGet = function(it, key){
	  try {
	    return it[key];
	  } catch(e){ /* empty */ }
	};

	module.exports = function(it){
	  var O, T, B;
	  return it === undefined ? 'Undefined' : it === null ? 'Null'
	    // @@toStringTag case
	    : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T
	    // builtinTag case
	    : ARG ? cof(O)
	    // ES3 arguments fallback
	    : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;
	};

/***/ },
/* 58 */
/***/ function(module, exports) {

	// IE 8- don't enum bug keys
	module.exports = (
	  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'
	).split(',');

/***/ },
/* 59 */
/***/ function(module, exports) {

	module.exports = function(exec){
	  try {
	    return !!exec();
	  } catch(e){
	    return true;
	  }
	};

/***/ },
/* 60 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = __webpack_require__(2).document && document.documentElement;

/***/ },
/* 61 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = !__webpack_require__(6) && !__webpack_require__(59)(function(){
	  return Object.defineProperty(__webpack_require__(28)('div'), 'a', {get: function(){ return 7; }}).a != 7;
	});

/***/ },
/* 62 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	var LIBRARY        = __webpack_require__(63)
	  , $export        = __webpack_require__(29)
	  , redefine       = __webpack_require__(153)
	  , hide           = __webpack_require__(8)
	  , has            = __webpack_require__(11)
	  , Iterators      = __webpack_require__(13)
	  , $iterCreate    = __webpack_require__(141)
	  , setToStringTag = __webpack_require__(31)
	  , getPrototypeOf = __webpack_require__(148)
	  , ITERATOR       = __webpack_require__(1)('iterator')
	  , BUGGY          = !([].keys && 'next' in [].keys()) // Safari has buggy iterators w/o `next`
	  , FF_ITERATOR    = '@@iterator'
	  , KEYS           = 'keys'
	  , VALUES         = 'values';

	var returnThis = function(){ return this; };

	module.exports = function(Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED){
	  $iterCreate(Constructor, NAME, next);
	  var getMethod = function(kind){
	    if(!BUGGY && kind in proto)return proto[kind];
	    switch(kind){
	      case KEYS: return function keys(){ return new Constructor(this, kind); };
	      case VALUES: return function values(){ return new Constructor(this, kind); };
	    } return function entries(){ return new Constructor(this, kind); };
	  };
	  var TAG        = NAME + ' Iterator'
	    , DEF_VALUES = DEFAULT == VALUES
	    , VALUES_BUG = false
	    , proto      = Base.prototype
	    , $native    = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT]
	    , $default   = $native || getMethod(DEFAULT)
	    , $entries   = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined
	    , $anyNative = NAME == 'Array' ? proto.entries || $native : $native
	    , methods, key, IteratorPrototype;
	  // Fix native
	  if($anyNative){
	    IteratorPrototype = getPrototypeOf($anyNative.call(new Base));
	    if(IteratorPrototype !== Object.prototype){
	      // Set @@toStringTag to native iterators
	      setToStringTag(IteratorPrototype, TAG, true);
	      // fix for some old engines
	      if(!LIBRARY && !has(IteratorPrototype, ITERATOR))hide(IteratorPrototype, ITERATOR, returnThis);
	    }
	  }
	  // fix Array#{values, @@iterator}.name in V8 / FF
	  if(DEF_VALUES && $native && $native.name !== VALUES){
	    VALUES_BUG = true;
	    $default = function values(){ return $native.call(this); };
	  }
	  // Define iterator
	  if((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])){
	    hide(proto, ITERATOR, $default);
	  }
	  // Plug for library
	  Iterators[NAME] = $default;
	  Iterators[TAG]  = returnThis;
	  if(DEFAULT){
	    methods = {
	      values:  DEF_VALUES ? $default : getMethod(VALUES),
	      keys:    IS_SET     ? $default : getMethod(KEYS),
	      entries: $entries
	    };
	    if(FORCED)for(key in methods){
	      if(!(key in proto))redefine(proto, key, methods[key]);
	    } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);
	  }
	  return methods;
	};

/***/ },
/* 63 */
/***/ function(module, exports) {

	module.exports = true;

/***/ },
/* 64 */
/***/ function(module, exports, __webpack_require__) {

	var global = __webpack_require__(2)
	  , SHARED = '__core-js_shared__'
	  , store  = global[SHARED] || (global[SHARED] = {});
	module.exports = function(key){
	  return store[key] || (store[key] = {});
	};

/***/ },
/* 65 */
/***/ function(module, exports, __webpack_require__) {

	var ctx                = __webpack_require__(10)
	  , invoke             = __webpack_require__(137)
	  , html               = __webpack_require__(60)
	  , cel                = __webpack_require__(28)
	  , global             = __webpack_require__(2)
	  , process            = global.process
	  , setTask            = global.setImmediate
	  , clearTask          = global.clearImmediate
	  , MessageChannel     = global.MessageChannel
	  , counter            = 0
	  , queue              = {}
	  , ONREADYSTATECHANGE = 'onreadystatechange'
	  , defer, channel, port;
	var run = function(){
	  var id = +this;
	  if(queue.hasOwnProperty(id)){
	    var fn = queue[id];
	    delete queue[id];
	    fn();
	  }
	};
	var listener = function(event){
	  run.call(event.data);
	};
	// Node.js 0.9+ & IE10+ has setImmediate, otherwise:
	if(!setTask || !clearTask){
	  setTask = function setImmediate(fn){
	    var args = [], i = 1;
	    while(arguments.length > i)args.push(arguments[i++]);
	    queue[++counter] = function(){
	      invoke(typeof fn == 'function' ? fn : Function(fn), args);
	    };
	    defer(counter);
	    return counter;
	  };
	  clearTask = function clearImmediate(id){
	    delete queue[id];
	  };
	  // Node.js 0.8-
	  if(__webpack_require__(18)(process) == 'process'){
	    defer = function(id){
	      process.nextTick(ctx(run, id, 1));
	    };
	  // Browsers with MessageChannel, includes WebWorkers
	  } else if(MessageChannel){
	    channel = new MessageChannel;
	    port    = channel.port2;
	    channel.port1.onmessage = listener;
	    defer = ctx(port.postMessage, port, 1);
	  // Browsers with postMessage, skip WebWorkers
	  // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'
	  } else if(global.addEventListener && typeof postMessage == 'function' && !global.importScripts){
	    defer = function(id){
	      global.postMessage(id + '', '*');
	    };
	    global.addEventListener('message', listener, false);
	  // IE8-
	  } else if(ONREADYSTATECHANGE in cel('script')){
	    defer = function(id){
	      html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function(){
	        html.removeChild(this);
	        run.call(id);
	      };
	    };
	  // Rest old browsers
	  } else {
	    defer = function(id){
	      setTimeout(ctx(run, id, 1), 0);
	    };
	  }
	}
	module.exports = {
	  set:   setTask,
	  clear: clearTask
	};

/***/ },
/* 66 */
/***/ function(module, exports, __webpack_require__) {

	// 7.1.15 ToLength
	var toInteger = __webpack_require__(33)
	  , min       = Math.min;
	module.exports = function(it){
	  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991
	};

/***/ },
/* 67 */
/***/ function(module, exports, __webpack_require__) {

	// 7.1.1 ToPrimitive(input [, PreferredType])
	var isObject = __webpack_require__(12);
	// instead of the ES6 spec version, we didn't implement @@toPrimitive case
	// and the second argument - flag - preferred type is a string
	module.exports = function(it, S){
	  if(!isObject(it))return it;
	  var fn, val;
	  if(S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
	  if(typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it)))return val;
	  if(!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
	  throw TypeError("Can't convert object to primitive value");
	};

/***/ },
/* 68 */
/***/ function(module, exports) {

	var id = 0
	  , px = Math.random();
	module.exports = function(key){
	  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));
	};

/***/ },
/* 69 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * Module dependencies
	 */

	var XMLHttpRequest = __webpack_require__(35);
	var XHR = __webpack_require__(174);
	var JSONP = __webpack_require__(173);
	var websocket = __webpack_require__(175);

	/**
	 * Export transports.
	 */

	exports.polling = polling;
	exports.websocket = websocket;

	/**
	 * Polling transport polymorphic constructor.
	 * Decides on xhr vs jsonp based on feature detection.
	 *
	 * @api private
	 */

	function polling(opts){
	  var xhr;
	  var xd = false;
	  var xs = false;
	  var jsonp = false !== opts.jsonp;

	  if (global.location) {
	    var isSSL = 'https:' == location.protocol;
	    var port = location.port;

	    // some user agents have empty `location.port`
	    if (!port) {
	      port = isSSL ? 443 : 80;
	    }

	    xd = opts.hostname != location.hostname || port != opts.port;
	    xs = opts.secure != isSSL;
	  }

	  opts.xdomain = xd;
	  opts.xscheme = xs;
	  xhr = new XMLHttpRequest(opts);

	  if ('open' in xhr && !opts.forceJSONP) {
	    return new XHR(opts);
	  } else {
	    if (!jsonp) throw new Error('JSONP disabled');
	    return new JSONP(opts);
	  }
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 70 */
/***/ function(module, exports, __webpack_require__) {

	/**
	 * Module dependencies.
	 */

	var Transport = __webpack_require__(34);
	var parseqs = __webpack_require__(39);
	var parser = __webpack_require__(9);
	var inherit = __webpack_require__(17);
	var yeast = __webpack_require__(83);
	var debug = __webpack_require__(3)('engine.io-client:polling');

	/**
	 * Module exports.
	 */

	module.exports = Polling;

	/**
	 * Is XHR2 supported?
	 */

	var hasXHR2 = (function() {
	  var XMLHttpRequest = __webpack_require__(35);
	  var xhr = new XMLHttpRequest({ xdomain: false });
	  return null != xhr.responseType;
	})();

	/**
	 * Polling interface.
	 *
	 * @param {Object} opts
	 * @api private
	 */

	function Polling(opts){
	  var forceBase64 = (opts && opts.forceBase64);
	  if (!hasXHR2 || forceBase64) {
	    this.supportsBinary = false;
	  }
	  Transport.call(this, opts);
	}

	/**
	 * Inherits from Transport.
	 */

	inherit(Polling, Transport);

	/**
	 * Transport name.
	 */

	Polling.prototype.name = 'polling';

	/**
	 * Opens the socket (triggers polling). We write a PING message to determine
	 * when the transport is open.
	 *
	 * @api private
	 */

	Polling.prototype.doOpen = function(){
	  this.poll();
	};

	/**
	 * Pauses polling.
	 *
	 * @param {Function} callback upon buffers are flushed and transport is paused
	 * @api private
	 */

	Polling.prototype.pause = function(onPause){
	  var pending = 0;
	  var self = this;

	  this.readyState = 'pausing';

	  function pause(){
	    debug('paused');
	    self.readyState = 'paused';
	    onPause();
	  }

	  if (this.polling || !this.writable) {
	    var total = 0;

	    if (this.polling) {
	      debug('we are currently polling - waiting to pause');
	      total++;
	      this.once('pollComplete', function(){
	        debug('pre-pause polling complete');
	        --total || pause();
	      });
	    }

	    if (!this.writable) {
	      debug('we are currently writing - waiting to pause');
	      total++;
	      this.once('drain', function(){
	        debug('pre-pause writing complete');
	        --total || pause();
	      });
	    }
	  } else {
	    pause();
	  }
	};

	/**
	 * Starts polling cycle.
	 *
	 * @api public
	 */

	Polling.prototype.poll = function(){
	  debug('polling');
	  this.polling = true;
	  this.doPoll();
	  this.emit('poll');
	};

	/**
	 * Overloads onData to detect payloads.
	 *
	 * @api private
	 */

	Polling.prototype.onData = function(data){
	  var self = this;
	  debug('polling got data %s', data);
	  var callback = function(packet, index, total) {
	    // if its the first message we consider the transport open
	    if ('opening' == self.readyState) {
	      self.onOpen();
	    }

	    // if its a close packet, we close the ongoing requests
	    if ('close' == packet.type) {
	      self.onClose();
	      return false;
	    }

	    // otherwise bypass onData and handle the message
	    self.onPacket(packet);
	  };

	  // decode payload
	  parser.decodePayload(data, this.socket.binaryType, callback);

	  // if an event did not trigger closing
	  if ('closed' != this.readyState) {
	    // if we got data we're not polling
	    this.polling = false;
	    this.emit('pollComplete');

	    if ('open' == this.readyState) {
	      this.poll();
	    } else {
	      debug('ignoring poll - transport state "%s"', this.readyState);
	    }
	  }
	};

	/**
	 * For polling, send a close packet.
	 *
	 * @api private
	 */

	Polling.prototype.doClose = function(){
	  var self = this;

	  function close(){
	    debug('writing close packet');
	    self.write([{ type: 'close' }]);
	  }

	  if ('open' == this.readyState) {
	    debug('transport open - closing');
	    close();
	  } else {
	    // in case we're trying to close while
	    // handshaking is in progress (GH-164)
	    debug('transport not open - deferring close');
	    this.once('open', close);
	  }
	};

	/**
	 * Writes a packets payload.
	 *
	 * @param {Array} data packets
	 * @param {Function} drain callback
	 * @api private
	 */

	Polling.prototype.write = function(packets){
	  var self = this;
	  this.writable = false;
	  var callbackfn = function() {
	    self.writable = true;
	    self.emit('drain');
	  };

	  var self = this;
	  parser.encodePayload(packets, this.supportsBinary, function(data) {
	    self.doWrite(data, callbackfn);
	  });
	};

	/**
	 * Generates uri for connection.
	 *
	 * @api private
	 */

	Polling.prototype.uri = function(){
	  var query = this.query || {};
	  var schema = this.secure ? 'https' : 'http';
	  var port = '';

	  // cache busting is forced
	  if (false !== this.timestampRequests) {
	    query[this.timestampParam] = yeast();
	  }

	  if (!this.supportsBinary && !query.sid) {
	    query.b64 = 1;
	  }

	  query = parseqs.encode(query);

	  // avoid port if default for schema
	  if (this.port && (('https' == schema && this.port != 443) ||
	     ('http' == schema && this.port != 80))) {
	    port = ':' + this.port;
	  }

	  // prepend ? to query
	  if (query.length) {
	    query = '?' + query;
	  }

	  var ipv6 = this.hostname.indexOf(':') !== -1;
	  return schema + '://' + (ipv6 ? '[' + this.hostname + ']' : this.hostname) + port + this.path + query;
	};


/***/ },
/* 71 */
/***/ function(module, exports) {

	
	var indexOf = [].indexOf;

	module.exports = function(arr, obj){
	  if (indexOf) return arr.indexOf(obj);
	  for (var i = 0; i < arr.length; ++i) {
	    if (arr[i] === obj) return i;
	  }
	  return -1;
	};

/***/ },
/* 72 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(setImmediate, clearImmediate) {var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_RESULT__;/*
	 * @name Lazy.js
	 *
	 * @fileOverview
	 * Lazy.js is a lazy evaluation library for JavaScript.
	 *
	 * This has been done before. For examples see:
	 *
	 * - [wu.js](http://fitzgen.github.io/wu.js/)
	 * - [Linq.js](http://linqjs.codeplex.com/)
	 * - [from.js](https://github.com/suckgamoni/fromjs/)
	 * - [IxJS](http://rx.codeplex.com/)
	 * - [sloth.js](http://rfw.name/sloth.js/)
	 *
	 * However, at least at present, Lazy.js is faster (on average) than any of
	 * those libraries. It is also more complete, with nearly all of the
	 * functionality of [Underscore](http://underscorejs.org/) and
	 * [Lo-Dash](http://lodash.com/).
	 *
	 * Finding your way around the code
	 * --------------------------------
	 *
	 * At the heart of Lazy.js is the {@link Sequence} object. You create an initial
	 * sequence using {@link Lazy}, which can accept an array, object, or string.
	 * You can then "chain" together methods from this sequence, creating a new
	 * sequence with each call.
	 *
	 * Here's an example:
	 *
	 *     var data = getReallyBigArray();
	 *
	 *     var statistics = Lazy(data)
	 *       .map(transform)
	 *       .filter(validate)
	 *       .reduce(aggregate);
	 *
	 * {@link Sequence} is the foundation of other, more specific sequence types.
	 *
	 * An {@link ArrayLikeSequence} provides indexed access to its elements.
	 *
	 * An {@link ObjectLikeSequence} consists of key/value pairs.
	 *
	 * A {@link StringLikeSequence} is like a string (duh): actually, it is an
	 * {@link ArrayLikeSequence} whose elements happen to be characters.
	 *
	 * An {@link AsyncSequence} is special: it iterates over its elements
	 * asynchronously (so calling `each` generally begins an asynchronous loop and
	 * returns immediately).
	 *
	 * For more information
	 * --------------------
	 *
	 * I wrote a blog post that explains a little bit more about Lazy.js, which you
	 * can read [here](http://philosopherdeveloper.com/posts/introducing-lazy-js.html).
	 *
	 * You can also [create an issue on GitHub](https://github.com/dtao/lazy.js/issues)
	 * if you have any issues with the library. I work through them eventually.
	 *
	 * [@dtao](https://github.com/dtao)
	 */

	(function(root, factory) {
	  if (true) {
	    !(__WEBPACK_AMD_DEFINE_FACTORY__ = (factory), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.call(exports, __webpack_require__, exports, module)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
	  } else if (typeof exports === 'object') {
	    module.exports = factory();
	  } else {
	    root.Lazy = factory();
	  }
	})(this, function(context) {
	  /**
	   * Wraps an object and returns a {@link Sequence}. For `null` or `undefined`,
	   * simply returns an empty sequence (see {@link Lazy.strict} for a stricter
	   * implementation).
	   *
	   * - For **arrays**, Lazy will create a sequence comprising the elements in
	   *   the array (an {@link ArrayLikeSequence}).
	   * - For **objects**, Lazy will create a sequence of key/value pairs
	   *   (an {@link ObjectLikeSequence}).
	   * - For **strings**, Lazy will create a sequence of characters (a
	   *   {@link StringLikeSequence}).
	   *
	   * @public
	   * @param {Array|Object|string} source An array, object, or string to wrap.
	   * @returns {Sequence} The wrapped lazy object.
	   *
	   * @exampleHelpers
	   * // Utility functions to provide to all examples
	   * function increment(x) { return x + 1; }
	   * function isEven(x) { return x % 2 === 0; }
	   * function isPositive(x) { return x > 0; }
	   * function isNegative(x) { return x < 0; }
	   *
	   * @examples
	   * Lazy([1, 2, 4])       // instanceof Lazy.ArrayLikeSequence
	   * Lazy({ foo: "bar" })  // instanceof Lazy.ObjectLikeSequence
	   * Lazy("hello, world!") // instanceof Lazy.StringLikeSequence
	   * Lazy()                // sequence: []
	   * Lazy(null)            // sequence: []
	   */
	  function Lazy(source) {
	    if (source instanceof Array) {
	      return new ArrayWrapper(source);

	    } else if (typeof source === "string") {
	      return new StringWrapper(source);

	    } else if (source instanceof Sequence) {
	      return source;
	    }

	    if (Lazy.extensions) {
	      var extensions = Lazy.extensions, length = extensions.length, result;
	      while (!result && length--) {
	        result = extensions[length](source);
	      }
	      if (result) {
	        return result;
	      }
	    }

	    return new ObjectWrapper(source);
	  }

	  Lazy.VERSION = '0.4.2';

	  /*** Utility methods of questionable value ***/

	  Lazy.noop = function noop() {};
	  Lazy.identity = function identity(x) { return x; };

	  /**
	   * Provides a stricter version of {@link Lazy} which throws an error when
	   * attempting to wrap `null`, `undefined`, or numeric or boolean values as a
	   * sequence.
	   *
	   * @public
	   * @returns {Function} A stricter version of the {@link Lazy} helper function.
	   *
	   * @examples
	   * var Strict = Lazy.strict();
	   *
	   * Strict()                  // throws
	   * Strict(null)              // throws
	   * Strict(true)              // throws
	   * Strict(5)                 // throws
	   * Strict([1, 2, 3])         // instanceof Lazy.ArrayLikeSequence
	   * Strict({ foo: "bar" })    // instanceof Lazy.ObjectLikeSequence
	   * Strict("hello, world!")   // instanceof Lazy.StringLikeSequence
	   *
	   * // Let's also ensure the static functions are still there.
	   * Strict.range(3)           // sequence: [0, 1, 2]
	   * Strict.generate(Date.now) // instanceof Lazy.GeneratedSequence
	   */
	  Lazy.strict = function strict() {
	    function StrictLazy(source) {
	      if (source == null) {
	        throw new Error("You cannot wrap null or undefined using Lazy.");
	      }

	      if (typeof source === "number" || typeof source === "boolean") {
	        throw new Error("You cannot wrap primitive values using Lazy.");
	      }

	      return Lazy(source);
	    };

	    Lazy(Lazy).each(function(property, name) {
	      StrictLazy[name] = property;
	    });

	    return StrictLazy;
	  };

	  /**
	   * The `Sequence` object provides a unified API encapsulating the notion of
	   * zero or more consecutive elements in a collection, stream, etc.
	   *
	   * Lazy evaluation
	   * ---------------
	   *
	   * Generally speaking, creating a sequence should not be an expensive operation,
	   * and should not iterate over an underlying source or trigger any side effects.
	   * This means that chaining together methods that return sequences incurs only
	   * the cost of creating the `Sequence` objects themselves and not the cost of
	   * iterating an underlying data source multiple times.
	   *
	   * The following code, for example, creates 4 sequences and does nothing with
	   * `source`:
	   *
	   *     var seq = Lazy(source) // 1st sequence
	   *       .map(func)           // 2nd
	   *       .filter(pred)        // 3rd
	   *       .reverse();          // 4th
	   *
	   * Lazy's convention is to hold off on iterating or otherwise *doing* anything
	   * (aside from creating `Sequence` objects) until you call `each`:
	   *
	   *     seq.each(function(x) { console.log(x); });
	   *
	   * Defining custom sequences
	   * -------------------------
	   *
	   * Defining your own type of sequence is relatively simple:
	   *
	   * 1. Pass a *method name* and an object containing *function overrides* to
	   *    {@link Sequence.define}. If the object includes a function called `init`,
	   *    this function will be called upon initialization.
	   * 2. The object should include at least either a `getIterator` method or an
	   *    `each` method. The former supports both asynchronous and synchronous
	   *    iteration, but is slightly more cumbersome to implement. The latter
	   *    supports synchronous iteration and can be automatically implemented in
	   *    terms of the former. You can also implement both if you want, e.g. to
	   *    optimize performance. For more info, see {@link Iterator} and
	   *    {@link AsyncSequence}.
	   *
	   * As a trivial example, the following code defines a new method, `sample`,
	   * which randomly may or may not include each element from its parent.
	   *
	   *     Lazy.Sequence.define("sample", {
	   *       each: function(fn) {
	   *         return this.parent.each(function(e) {
	   *           // 50/50 chance of including this element.
	   *           if (Math.random() > 0.5) {
	   *             return fn(e);
	   *           }
	   *         });
	   *       }
	   *     });
	   *
	   * (Of course, the above could also easily have been implemented using
	   * {@link #filter} instead of creating a custom sequence. But I *did* say this
	   * was a trivial example, to be fair.)
	   *
	   * Now it will be possible to create this type of sequence from any parent
	   * sequence by calling the method name you specified. In other words, you can
	   * now do this:
	   *
	   *     Lazy(arr).sample();
	   *     Lazy(arr).map(func).sample();
	   *     Lazy(arr).map(func).filter(pred).sample();
	   *
	   * Etc., etc.
	   *
	   * @public
	   * @constructor
	   */
	  function Sequence() {}

	  /**
	   * Create a new constructor function for a type inheriting from `Sequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `Sequence` prototype so that it can be chained with any other
	   *     sequence methods, like {@link #map}, {@link #filter}, etc.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. **Must** include either `getIterator` or `each` (or
	   *     both). *May* include an `init` method as well. For these overrides,
	   *     `this` will be the new sequence, and `this.parent` will be the base
	   *     sequence from which the new sequence was constructed.
	   * @returns {Function} A constructor for a new type inheriting from `Sequence`.
	   *
	   * @examples
	   * // This sequence type logs every element to the specified logger as it
	   * // iterates over it.
	   * Lazy.Sequence.define("verbose", {
	   *   init: function(logger) {
	   *     this.logger = logger;
	   *   },
	   *
	   *   each: function(fn) {
	   *     var logger = this.logger;
	   *     return this.parent.each(function(e, i) {
	   *       logger(e);
	   *       return fn(e, i);
	   *     });
	   *   }
	   * });
	   *
	   * Lazy([1, 2, 3]).verbose(logger).each(Lazy.noop) // calls logger 3 times
	   */
	  Sequence.define = function define(methodName, overrides) {
	    if (!overrides || (!overrides.getIterator && !overrides.each)) {
	      throw new Error("A custom sequence must implement *at least* getIterator or each!");
	    }

	    return defineSequenceType(Sequence, methodName, overrides);
	  };

	  /**
	   * Gets the number of elements in the sequence. In some cases, this may
	   * require eagerly evaluating the sequence.
	   *
	   * @public
	   * @returns {number} The number of elements in the sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).size();                 // => 3
	   * Lazy([1, 2]).map(Lazy.identity).size(); // => 2
	   * Lazy([1, 2, 3]).reject(isEven).size();  // => 2
	   * Lazy([1, 2, 3]).take(1).size();         // => 1
	   * Lazy({ foo: 1, bar: 2 }).size();        // => 2
	   * Lazy('hello').size();                   // => 5
	   */
	  Sequence.prototype.size = function size() {
	    return this.getIndex().length();
	  };

	  /**
	   * Creates an {@link Iterator} object with two methods, `moveNext` -- returning
	   * true or false -- and `current` -- returning the current value.
	   *
	   * This method is used when asynchronously iterating over sequences. Any type
	   * inheriting from `Sequence` must implement this method or it can't support
	   * asynchronous iteration.
	   *
	   * Note that **this method is not intended to be used directly by application
	   * code.** Rather, it is intended as a means for implementors to potentially
	   * define custom sequence types that support either synchronous or
	   * asynchronous iteration.
	   *
	   * @public
	   * @returns {Iterator} An iterator object.
	   *
	   * @examples
	   * var iterator = Lazy([1, 2]).getIterator();
	   *
	   * iterator.moveNext(); // => true
	   * iterator.current();  // => 1
	   * iterator.moveNext(); // => true
	   * iterator.current();  // => 2
	   * iterator.moveNext(); // => false
	   */
	  Sequence.prototype.getIterator = function getIterator() {
	    return new Iterator(this);
	  };

	  /**
	   * Gets the root sequence underlying the current chain of sequences.
	   */
	  Sequence.prototype.root = function root() {
	    return this.parent.root();
	  };

	  /**
	   * Whether or not the current sequence is an asynchronous one. This is more
	   * accurate than checking `instanceof {@link AsyncSequence}` because, for
	   * example, `Lazy([1, 2, 3]).async().map(Lazy.identity)` returns a sequence
	   * that iterates asynchronously even though it's not an instance of
	   * `AsyncSequence`.
	   *
	   * @returns {boolean} Whether or not the current sequence is an asynchronous one.
	   */
	  Sequence.prototype.isAsync = function isAsync() {
	    return this.parent ? this.parent.isAsync() : false;
	  };

	  /**
	   * Evaluates the sequence and produces the appropriate value (an array in most
	   * cases, an object for {@link ObjectLikeSequence}s or a string for
	   * {@link StringLikeSequence}s).
	   *
	   * @returns {Array|string|Object} The value resulting from fully evaluating
	   *     the sequence.
	   */
	  Sequence.prototype.value = function value() {
	    return this.toArray();
	  };

	  /**
	   * Applies the current transformation chain to a given source, returning the
	   * resulting value.
	   *
	   * @examples
	   * var sequence = Lazy([])
	   *   .map(function(x) { return x * -1; })
	   *   .filter(function(x) { return x % 2 === 0; });
	   *
	   * sequence.apply([1, 2, 3, 4]); // => [-2, -4]
	   */
	  Sequence.prototype.apply = function apply(source) {
	    var root = this.root(),
	        previousSource = root.source,
	        result;

	    try {
	      root.source = source;
	      result = this.value();
	    } finally {
	      root.source = previousSource;
	    }

	    return result;
	  };

	  /**
	   * The Iterator object provides an API for iterating over a sequence.
	   *
	   * The purpose of the `Iterator` type is mainly to offer an agnostic way of
	   * iterating over a sequence -- either synchronous (i.e. with a `while` loop)
	   * or asynchronously (with recursive calls to either `setTimeout` or --- if
	   * available --- `setImmediate`). It is not intended to be used directly by
	   * application code.
	   *
	   * @public
	   * @constructor
	   * @param {Sequence} sequence The sequence to iterate over.
	   */
	  function Iterator(sequence) {
	    this.sequence = sequence;
	    this.index    = -1;
	  }

	  /**
	   * Gets the current item this iterator is pointing to.
	   *
	   * @public
	   * @returns {*} The current item.
	   */
	  Iterator.prototype.current = function current() {
	    return this.cachedIndex && this.cachedIndex.get(this.index);
	  };

	  /**
	   * Moves the iterator to the next item in a sequence, if possible.
	   *
	   * @public
	   * @returns {boolean} True if the iterator is able to move to a new item, or else
	   *     false.
	   */
	  Iterator.prototype.moveNext = function moveNext() {
	    var cachedIndex = this.cachedIndex;

	    if (!cachedIndex) {
	      cachedIndex = this.cachedIndex = this.sequence.getIndex();
	    }

	    if (this.index >= cachedIndex.length() - 1) {
	      return false;
	    }

	    ++this.index;
	    return true;
	  };

	  /**
	   * Creates an array snapshot of a sequence.
	   *
	   * Note that for indefinite sequences, this method may raise an exception or
	   * (worse) cause the environment to hang.
	   *
	   * @public
	   * @returns {Array} An array containing the current contents of the sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).toArray() // => [1, 2, 3]
	   */
	  Sequence.prototype.toArray = function toArray() {
	    return this.reduce(function(arr, element) {
	      arr.push(element);
	      return arr;
	    }, []);
	  };

	  /**
	   * Provides an indexed view into the sequence.
	   *
	   * For sequences that are already indexed, this will simply return the
	   * sequence. For non-indexed sequences, this will eagerly evaluate the
	   * sequence.
	   *
	   * @returns {ArrayLikeSequence} A sequence containing the current contents of
	   *     the sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).filter(isEven)            // instanceof Lazy.Sequence
	   * Lazy([1, 2, 3]).filter(isEven).getIndex() // instanceof Lazy.ArrayLikeSequence
	   */
	  Sequence.prototype.getIndex = function getIndex() {
	    return new ArrayWrapper(this.toArray());
	  };

	  /**
	   * Returns the element at the specified index. Note that, for sequences that
	   * are not {@link ArrayLikeSequence}s, this may require partially evaluating
	   * the sequence, iterating to reach the result. (In other words for such
	   * sequences this method is not O(1).)
	   *
	   * @public
	   * @param {number} i The index to access.
	   * @returns {*} The element.
	   *
	   */
	  Sequence.prototype.get = function get(i) {
	    var element;
	    this.each(function(e, index) {
	      if (index === i) {
	        element = e;
	        return false;
	      }
	    });
	    return element;
	  };

	  /**
	   * Provides an indexed, memoized view into the sequence. This will cache the
	   * result whenever the sequence is first iterated, so that subsequent
	   * iterations will access the same element objects.
	   *
	   * @public
	   * @returns {ArrayLikeSequence} An indexed, memoized sequence containing this
	   *     sequence's elements, cached after the first iteration.
	   *
	   * @example
	   * function createObject() { return new Object(); }
	   *
	   * var plain    = Lazy.generate(createObject, 10),
	   *     memoized = Lazy.generate(createObject, 10).memoize();
	   *
	   * plain.toArray()[0] === plain.toArray()[0];       // => false
	   * memoized.toArray()[0] === memoized.toArray()[0]; // => true
	   */
	  Sequence.prototype.memoize = function memoize() {
	    return new MemoizedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function MemoizedSequence(parent) {
	    this.parent = parent;
	  }

	  // MemoizedSequence needs to have its prototype set up after ArrayLikeSequence

	  /**
	   * Creates an object from a sequence of key/value pairs.
	   *
	   * @public
	   * @returns {Object} An object with keys and values corresponding to the pairs
	   *     of elements in the sequence.
	   *
	   * @examples
	   * var details = [
	   *   ["first", "Dan"],
	   *   ["last", "Tao"],
	   *   ["age", 29]
	   * ];
	   *
	   * Lazy(details).toObject() // => { first: "Dan", last: "Tao", age: 29 }
	   */
	  Sequence.prototype.toObject = function toObject() {
	    return this.reduce(function(object, pair) {
	      object[pair[0]] = pair[1];
	      return object;
	    }, {});
	  };

	  /**
	   * Iterates over this sequence and executes a function for every element.
	   *
	   * @public
	   * @aka forEach
	   * @param {Function} fn The function to call on each element in the sequence.
	   *     Return false from the function to end the iteration.
	   * @returns {boolean} `true` if the iteration evaluated the entire sequence,
	   *     or `false` if iteration was ended early.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4]).each(fn) // calls fn 4 times
	   */
	  Sequence.prototype.each = function each(fn) {
	    var iterator = this.getIterator(),
	        i = -1;

	    while (iterator.moveNext()) {
	      if (fn(iterator.current(), ++i) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  Sequence.prototype.forEach = function forEach(fn) {
	    return this.each(fn);
	  };

	  /**
	   * Creates a new sequence whose values are calculated by passing this sequence's
	   * elements through some mapping function.
	   *
	   * @public
	   * @aka collect
	   * @param {Function} mapFn The mapping function used to project this sequence's
	   *     elements onto a new sequence. This function takes up to two arguments:
	   *     the element, and the current index.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function addIndexToValue(e, i) { return e + i; }
	   *
	   * Lazy([]).map(increment)              // sequence: []
	   * Lazy([1, 2, 3]).map(increment)       // sequence: [2, 3, 4]
	   * Lazy([1, 2, 3]).map(addIndexToValue) // sequence: [1, 3, 5]
	   *
	   * @benchmarks
	   * function increment(x) { return x + 1; }
	   *
	   * var smArr = Lazy.range(10).toArray(),
	   *     lgArr = Lazy.range(100).toArray();
	   *
	   * Lazy(smArr).map(increment).each(Lazy.noop) // lazy - 10 elements
	   * Lazy(lgArr).map(increment).each(Lazy.noop) // lazy - 100 elements
	   * _.each(_.map(smArr, increment), _.noop)    // lodash - 10 elements
	   * _.each(_.map(lgArr, increment), _.noop)    // lodash - 100 elements
	   */
	  Sequence.prototype.map = function map(mapFn) {
	    return new MappedSequence(this, createCallback(mapFn));
	  };

	  Sequence.prototype.collect = function collect(mapFn) {
	    return this.map(mapFn);
	  };

	  /**
	   * @constructor
	   */
	  function MappedSequence(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  MappedSequence.prototype = new Sequence();

	  MappedSequence.prototype.getIterator = function getIterator() {
	    return new MappingIterator(this.parent, this.mapFn);
	  };

	  MappedSequence.prototype.each = function each(fn) {
	    var mapFn = this.mapFn;
	    return this.parent.each(function(e, i) {
	      return fn(mapFn(e, i), i);
	    });
	  };

	  /**
	   * @constructor
	   */
	  function MappingIterator(sequence, mapFn) {
	    this.iterator = sequence.getIterator();
	    this.mapFn    = mapFn;
	    this.index    = -1;
	  }

	  MappingIterator.prototype.current = function current() {
	    return this.mapFn(this.iterator.current(), this.index);
	  };

	  MappingIterator.prototype.moveNext = function moveNext() {
	    if (this.iterator.moveNext()) {
	      ++this.index;
	      return true;
	    }

	    return false;
	  };

	  /**
	   * Creates a new sequence whose values are calculated by accessing the specified
	   * property from each element in this sequence.
	   *
	   * @public
	   * @param {string} propertyName The name of the property to access for every
	   *     element in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var people = [
	   *   { first: "Dan", last: "Tao" },
	   *   { first: "Bob", last: "Smith" }
	   * ];
	   *
	   * Lazy(people).pluck("last") // sequence: ["Tao", "Smith"]
	   */
	  Sequence.prototype.pluck = function pluck(property) {
	    return this.map(property);
	  };

	  /**
	   * Creates a new sequence whose values are calculated by invoking the specified
	   * function on each element in this sequence.
	   *
	   * @public
	   * @param {string} methodName The name of the method to invoke for every element
	   *     in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function Person(first, last) {
	   *   this.fullName = function fullName() {
	   *     return first + " " + last;
	   *   };
	   * }
	   *
	   * var people = [
	   *   new Person("Dan", "Tao"),
	   *   new Person("Bob", "Smith")
	   * ];
	   *
	   * Lazy(people).invoke("fullName") // sequence: ["Dan Tao", "Bob Smith"]
	   */
	  Sequence.prototype.invoke = function invoke(methodName) {
	    return this.map(function(e) {
	      return e[methodName]();
	    });
	  };

	  /**
	   * Creates a new sequence whose values are the elements of this sequence which
	   * satisfy the specified predicate.
	   *
	   * @public
	   * @aka select
	   * @param {Function} filterFn The predicate to call on each element in this
	   *     sequence, which returns true if the element should be included.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5, 6];
	   *
	   * Lazy(numbers).filter(isEven) // sequence: [2, 4, 6]
	   *
	   * @benchmarks
	   * function isEven(x) { return x % 2 === 0; }
	   *
	   * var smArr = Lazy.range(10).toArray(),
	   *     lgArr = Lazy.range(100).toArray();
	   *
	   * Lazy(smArr).filter(isEven).each(Lazy.noop) // lazy - 10 elements
	   * Lazy(lgArr).filter(isEven).each(Lazy.noop) // lazy - 100 elements
	   * _.each(_.filter(smArr, isEven), _.noop)    // lodash - 10 elements
	   * _.each(_.filter(lgArr, isEven), _.noop)    // lodash - 100 elements
	   */
	  Sequence.prototype.filter = function filter(filterFn) {
	    return new FilteredSequence(this, createCallback(filterFn));
	  };

	  Sequence.prototype.select = function select(filterFn) {
	    return this.filter(filterFn);
	  };

	  /**
	   * @constructor
	   */
	  function FilteredSequence(parent, filterFn) {
	    this.parent   = parent;
	    this.filterFn = filterFn;
	  }

	  FilteredSequence.prototype = new Sequence();

	  FilteredSequence.prototype.getIterator = function getIterator() {
	    return new FilteringIterator(this.parent, this.filterFn);
	  };

	  FilteredSequence.prototype.each = function each(fn) {
	    var filterFn = this.filterFn,
	        j = 0;

	    return this.parent.each(function(e, i) {
	      if (filterFn(e, i)) {
	        return fn(e, j++);
	      }
	    });
	  };

	  FilteredSequence.prototype.reverse = function reverse() {
	    return this.parent.reverse().filter(this.filterFn);
	  };

	  /**
	   * @constructor
	   */
	  function FilteringIterator(sequence, filterFn) {
	    this.iterator = sequence.getIterator();
	    this.filterFn = filterFn;
	    this.index    = 0;
	  }

	  FilteringIterator.prototype.current = function current() {
	    return this.value;
	  };

	  FilteringIterator.prototype.moveNext = function moveNext() {
	    var iterator = this.iterator,
	        filterFn = this.filterFn,
	        value;

	    while (iterator.moveNext()) {
	      value = iterator.current();
	      if (filterFn(value, this.index++)) {
	        this.value = value;
	        return true;
	      }
	    }

	    this.value = undefined;
	    return false;
	  };

	  /**
	   * Creates a new sequence whose values exclude the elements of this sequence
	   * identified by the specified predicate.
	   *
	   * @public
	   * @param {Function} rejectFn The predicate to call on each element in this
	   *     sequence, which returns true if the element should be omitted.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).reject(isEven)              // sequence: [1, 3, 5]
	   * Lazy([{ foo: 1 }, { bar: 2 }]).reject('foo')      // sequence: [{ bar: 2 }]
	   * Lazy([{ foo: 1 }, { foo: 2 }]).reject({ foo: 2 }) // sequence: [{ foo: 1 }]
	   */
	  Sequence.prototype.reject = function reject(rejectFn) {
	    rejectFn = createCallback(rejectFn);
	    return this.filter(function(e) { return !rejectFn(e); });
	  };

	  /**
	   * Creates a new sequence whose values have the specified type, as determined
	   * by the `typeof` operator.
	   *
	   * @public
	   * @param {string} type The type of elements to include from the underlying
	   *     sequence, i.e. where `typeof [element] === [type]`.
	   * @returns {Sequence} The new sequence, comprising elements of the specified
	   *     type.
	   *
	   * @examples
	   * Lazy([1, 2, 'foo', 'bar']).ofType('number')  // sequence: [1, 2]
	   * Lazy([1, 2, 'foo', 'bar']).ofType('string')  // sequence: ['foo', 'bar']
	   * Lazy([1, 2, 'foo', 'bar']).ofType('boolean') // sequence: []
	   */
	  Sequence.prototype.ofType = function ofType(type) {
	    return this.filter(function(e) { return typeof e === type; });
	  };

	  /**
	   * Creates a new sequence whose values are the elements of this sequence with
	   * property names and values matching those of the specified object.
	   *
	   * @public
	   * @param {Object} properties The properties that should be found on every
	   *     element that is to be included in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var people = [
	   *   { first: "Dan", last: "Tao" },
	   *   { first: "Bob", last: "Smith" }
	   * ];
	   *
	   * Lazy(people).where({ first: "Dan" }) // sequence: [{ first: "Dan", last: "Tao" }]
	   *
	   * @benchmarks
	   * var animals = ["dog", "cat", "mouse", "horse", "pig", "snake"];
	   *
	   * Lazy(animals).where({ length: 3 }).each(Lazy.noop) // lazy
	   * _.each(_.where(animals, { length: 3 }), _.noop)    // lodash
	   */
	  Sequence.prototype.where = function where(properties) {
	    return this.filter(properties);
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, but to be iterated
	   * in the opposite order.
	   *
	   * Note that in some (but not all) cases, the only way to create such a sequence
	   * may require iterating the entire underlying source when `each` is called.
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).reverse() // sequence: [3, 2, 1]
	   * Lazy([]).reverse()        // sequence: []
	   */
	  Sequence.prototype.reverse = function reverse() {
	    return new ReversedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function ReversedSequence(parent) {
	    this.parent = parent;
	  }

	  ReversedSequence.prototype = new Sequence();

	  ReversedSequence.prototype.getIterator = function getIterator() {
	    return new ReversedIterator(this.parent);
	  };

	  /**
	   * @constuctor
	   */
	  function ReversedIterator(sequence) {
	    this.sequence = sequence;
	  }

	  ReversedIterator.prototype.current = function current() {
	    return this.getIndex().get(this.index);
	  };

	  ReversedIterator.prototype.moveNext = function moveNext() {
	    var index  = this.getIndex(),
	        length = index.length();

	    if (typeof this.index === "undefined") {
	      this.index = length;
	    }

	    return (--this.index >= 0);
	  };

	  ReversedIterator.prototype.getIndex = function getIndex() {
	    if (!this.cachedIndex) {
	      this.cachedIndex = this.sequence.getIndex();
	    }

	    return this.cachedIndex;
	  };

	  /**
	   * Creates a new sequence with all of the elements of this one, plus those of
	   * the given array(s).
	   *
	   * @public
	   * @param {...*} var_args One or more values (or arrays of values) to use for
	   *     additional items after this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var left  = [1, 2, 3];
	   * var right = [4, 5, 6];
	   *
	   * Lazy(left).concat(right)         // sequence: [1, 2, 3, 4, 5, 6]
	   * Lazy(left).concat(Lazy(right))   // sequence: [1, 2, 3, 4, 5, 6]
	   * Lazy(left).concat(right, [7, 8]) // sequence: [1, 2, 3, 4, 5, 6, 7, 8]
	   */
	  Sequence.prototype.concat = function concat(var_args) {
	    return new ConcatenatedSequence(this, arraySlice.call(arguments, 0));
	  };

	  /**
	   * @constructor
	   */
	  function ConcatenatedSequence(parent, arrays) {
	    this.parent = parent;
	    this.arrays = arrays;
	  }

	  ConcatenatedSequence.prototype = new Sequence();

	  ConcatenatedSequence.prototype.each = function each(fn) {
	    var done = false,
	        i = 0;

	    this.parent.each(function(e) {
	      if (fn(e, i++) === false) {
	        done = true;
	        return false;
	      }
	    });

	    if (!done) {
	      Lazy(this.arrays).flatten().each(function(e) {
	        if (fn(e, i++) === false) {
	          return false;
	        }
	      });
	    }
	  };

	  /**
	   * Creates a new sequence comprising the first N elements from this sequence, OR
	   * (if N is `undefined`) simply returns the first element of this sequence.
	   *
	   * @public
	   * @aka head, take
	   * @param {number=} count The number of elements to take from this sequence. If
	   *     this value exceeds the length of the sequence, the resulting sequence
	   *     will be essentially the same as this one.
	   * @returns {*} The new sequence (or the first element from this sequence if
	   *     no count was given).
	   *
	   * @examples
	   * function powerOfTwo(exp) {
	   *   return Math.pow(2, exp);
	   * }
	   *
	   * Lazy.generate(powerOfTwo).first()          // => 1
	   * Lazy.generate(powerOfTwo).first(5)         // sequence: [1, 2, 4, 8, 16]
	   * Lazy.generate(powerOfTwo).skip(2).first()  // => 4
	   * Lazy.generate(powerOfTwo).skip(2).first(2) // sequence: [4, 8]
	   */
	  Sequence.prototype.first = function first(count) {
	    if (typeof count === "undefined") {
	      return getFirst(this);
	    }
	    return new TakeSequence(this, count);
	  };

	  Sequence.prototype.head =
	  Sequence.prototype.take = function (count) {
	    return this.first(count);
	  };

	  /**
	   * @constructor
	   */
	  function TakeSequence(parent, count) {
	    this.parent = parent;
	    this.count  = count;
	  }

	  TakeSequence.prototype = new Sequence();

	  TakeSequence.prototype.getIterator = function getIterator() {
	    return new TakeIterator(this.parent, this.count);
	  };

	  TakeSequence.prototype.each = function each(fn) {
	    var count = this.count,
	        i     = 0;

	    var result;
	    var handle = this.parent.each(function(e) {
	      if (i < count) { result = fn(e, i++); }
	      if (i >= count) { return false; }
	      return result;
	    });

	    if (handle instanceof AsyncHandle) {
	      return handle;
	    }

	    return i === count && result !== false;
	  };

	  /**
	   * @constructor
	   */
	  function TakeIterator(sequence, count) {
	    this.iterator = sequence.getIterator();
	    this.count    = count;
	  }

	  TakeIterator.prototype.current = function current() {
	    return this.iterator.current();
	  };

	  TakeIterator.prototype.moveNext = function moveNext() {
	    return ((--this.count >= 0) && this.iterator.moveNext());
	  };

	  /**
	   * Creates a new sequence comprising the elements from the head of this sequence
	   * that satisfy some predicate. Once an element is encountered that doesn't
	   * satisfy the predicate, iteration will stop.
	   *
	   * @public
	   * @param {Function} predicate
	   * @returns {Sequence} The new sequence
	   *
	   * @examples
	   * function lessThan(x) {
	   *   return function(y) {
	   *     return y < x;
	   *   };
	   * }
	   *
	   * Lazy([1, 2, 3, 4]).takeWhile(lessThan(3)) // sequence: [1, 2]
	   * Lazy([1, 2, 3, 4]).takeWhile(lessThan(0)) // sequence: []
	   */
	  Sequence.prototype.takeWhile = function takeWhile(predicate) {
	    return new TakeWhileSequence(this, predicate);
	  };

	  /**
	   * @constructor
	   */
	  function TakeWhileSequence(parent, predicate) {
	    this.parent    = parent;
	    this.predicate = predicate;
	  }

	  TakeWhileSequence.prototype = new Sequence();

	  TakeWhileSequence.prototype.each = function each(fn) {
	    var predicate = this.predicate,
	        finished = false,
	        j = 0;

	    var result = this.parent.each(function(e, i) {
	      if (!predicate(e, i)) {
	        finished = true;
	        return false;
	      }

	      return fn(e, j++);
	    });

	    if (result instanceof AsyncHandle) {
	      return result;
	    }

	    return finished;
	  };

	  /**
	   * Creates a new sequence comprising all but the last N elements of this
	   * sequence.
	   *
	   * @public
	   * @param {number=} count The number of items to omit from the end of the
	   *     sequence (defaults to 1).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4]).initial()                    // sequence: [1, 2, 3]
	   * Lazy([1, 2, 3, 4]).initial(2)                   // sequence: [1, 2]
	   * Lazy([1, 2, 3]).filter(Lazy.identity).initial() // sequence: [1, 2]
	   */
	  Sequence.prototype.initial = function initial(count) {
	    return new InitialSequence(this, count);
	  };

	  function InitialSequence(parent, count) {
	    this.parent = parent;
	    this.count = typeof count === "number" ? count : 1;
	  }

	  InitialSequence.prototype = new Sequence();

	  InitialSequence.prototype.each = function each(fn) {
	    var index = this.parent.getIndex();
	    return index.take(index.length() - this.count).each(fn);
	  };

	  /**
	   * Creates a new sequence comprising the last N elements of this sequence, OR
	   * (if N is `undefined`) simply returns the last element of this sequence.
	   *
	   * @public
	   * @param {number=} count The number of items to take from the end of the
	   *     sequence.
	   * @returns {*} The new sequence (or the last element from this sequence
	   *     if no count was given).
	   *
	   * @examples
	   * Lazy([1, 2, 3]).last()                 // => 3
	   * Lazy([1, 2, 3]).last(2)                // sequence: [2, 3]
	   * Lazy([1, 2, 3]).filter(isEven).last(2) // sequence: [2]
	   */
	  Sequence.prototype.last = function last(count) {
	    if (typeof count === "undefined") {
	      return this.reverse().first();
	    }
	    return this.reverse().take(count).reverse();
	  };

	  /**
	   * Returns the first element in this sequence with property names and values
	   * matching those of the specified object.
	   *
	   * @public
	   * @param {Object} properties The properties that should be found on some
	   *     element in this sequence.
	   * @returns {*} The found element, or `undefined` if none exists in this
	   *     sequence.
	   *
	   * @examples
	   * var words = ["foo", "bar"];
	   *
	   * Lazy(words).findWhere({ 0: "f" }); // => "foo"
	   * Lazy(words).findWhere({ 0: "z" }); // => undefined
	   */
	  Sequence.prototype.findWhere = function findWhere(properties) {
	    return this.where(properties).first();
	  };

	  /**
	   * Creates a new sequence comprising all but the first N elements of this
	   * sequence.
	   *
	   * @public
	   * @aka skip, tail, rest
	   * @param {number=} count The number of items to omit from the beginning of the
	   *     sequence (defaults to 1).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4]).rest()  // sequence: [2, 3, 4]
	   * Lazy([1, 2, 3, 4]).rest(0) // sequence: [1, 2, 3, 4]
	   * Lazy([1, 2, 3, 4]).rest(2) // sequence: [3, 4]
	   * Lazy([1, 2, 3, 4]).rest(5) // sequence: []
	   */
	  Sequence.prototype.rest = function rest(count) {
	    return new DropSequence(this, count);
	  };

	  Sequence.prototype.skip =
	  Sequence.prototype.tail =
	  Sequence.prototype.drop = function drop(count) {
	    return this.rest(count);
	  };

	  /**
	   * @constructor
	   */
	  function DropSequence(parent, count) {
	    this.parent = parent;
	    this.count  = typeof count === "number" ? count : 1;
	  }

	  DropSequence.prototype = new Sequence();

	  DropSequence.prototype.each = function each(fn) {
	    var count   = this.count,
	        dropped = 0,
	        i       = 0;

	    return this.parent.each(function(e) {
	      if (dropped++ < count) { return; }
	      return fn(e, i++);
	    });
	  };

	  /**
	   * Creates a new sequence comprising the elements from this sequence *after*
	   * those that satisfy some predicate. The sequence starts with the first
	   * element that does not match the predicate.
	   *
	   * @public
	   * @aka skipWhile
	   * @param {Function} predicate
	   * @returns {Sequence} The new sequence
	   */
	  Sequence.prototype.dropWhile = function dropWhile(predicate) {
	    return new DropWhileSequence(this, predicate);
	  };

	  Sequence.prototype.skipWhile = function skipWhile(predicate) {
	    return this.dropWhile(predicate);
	  };

	  /**
	   * @constructor
	   */
	  function DropWhileSequence(parent, predicate) {
	    this.parent    = parent;
	    this.predicate = predicate;
	  }

	  DropWhileSequence.prototype = new Sequence();

	  DropWhileSequence.prototype.each = function each(fn) {
	    var predicate = this.predicate,
	        done      = false;

	    return this.parent.each(function(e) {
	      if (!done) {
	        if (predicate(e)) {
	          return;
	        }

	        done = true;
	      }

	      return fn(e);
	    });
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, but ordered
	   * using the specified comparison function.
	   *
	   * This has essentially the same behavior as calling
	   * [`Array#sort`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort),
	   * but obviously instead of modifying the collection it returns a new
	   * {@link Sequence} object.
	   *
	   * @public
	   * @param {Function=} sortFn The function used to compare elements in the
	   *     sequence. The function will be passed two elements and should return:
	   *     - 1 if the first is greater
	   *     - -1 if the second is greater
	   *     - 0 if the two values are the same
	   * @param {boolean} descending Whether or not the resulting sequence should be
	   *     in descending order (defaults to `false`).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([5, 10, 1]).sort()                // sequence: [1, 5, 10]
	   * Lazy(['foo', 'bar']).sort()            // sequence: ['bar', 'foo']
	   * Lazy(['b', 'c', 'a']).sort(null, true) // sequence: ['c', 'b', 'a']
	   * Lazy([5, 10, 1]).sort(null, true)      // sequence: [10, 5, 1]
	   *
	   * // Sorting w/ custom comparison function
	   * Lazy(['a', 'ab', 'aa', 'ba', 'b', 'abc']).sort(function compare(x, y) {
	   *   if (x.length && (x.length !== y.length)) { return compare(x.length, y.length); }
	   *   if (x === y) { return 0; }
	   *   return x > y ? 1 : -1;
	   * });
	   * // => sequence: ['a', 'b', 'aa', 'ab', 'ba', 'abc']
	   */
	  Sequence.prototype.sort = function sort(sortFn, descending) {
	    sortFn || (sortFn = compare);
	    if (descending) { sortFn = reverseArguments(sortFn); }
	    return new SortedSequence(this, sortFn);
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, but ordered by
	   * the results of the given function.
	   *
	   * You can pass:
	   *
	   * - a *string*, to sort by the named property
	   * - a function, to sort by the result of calling the function on each element
	   *
	   * @public
	   * @param {Function} sortFn The function to call on the elements in this
	   *     sequence, in order to sort them.
	   * @param {boolean} descending Whether or not the resulting sequence should be
	   *     in descending order (defaults to `false`).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function population(country) {
	   *   return country.pop;
	   * }
	   *
	   * function area(country) {
	   *   return country.sqkm;
	   * }
	   *
	   * var countries = [
	   *   { name: "USA", pop: 320000000, sqkm: 9600000 },
	   *   { name: "Brazil", pop: 194000000, sqkm: 8500000 },
	   *   { name: "Nigeria", pop: 174000000, sqkm: 924000 },
	   *   { name: "China", pop: 1350000000, sqkm: 9700000 },
	   *   { name: "Russia", pop: 143000000, sqkm: 17000000 },
	   *   { name: "Australia", pop: 23000000, sqkm: 7700000 }
	   * ];
	   *
	   * Lazy(countries).sortBy(population).last(3).pluck('name') // sequence: ["Brazil", "USA", "China"]
	   * Lazy(countries).sortBy(area).last(3).pluck('name')       // sequence: ["USA", "China", "Russia"]
	   * Lazy(countries).sortBy(area, true).first(3).pluck('name') // sequence: ["Russia", "China", "USA"]
	   *
	   * @benchmarks
	   * var randoms = Lazy.generate(Math.random).take(100).toArray();
	   *
	   * Lazy(randoms).sortBy(Lazy.identity).each(Lazy.noop) // lazy
	   * _.each(_.sortBy(randoms, Lazy.identity), _.noop)    // lodash
	   */
	  Sequence.prototype.sortBy = function sortBy(sortFn, descending) {
	    sortFn = createComparator(sortFn);
	    if (descending) { sortFn = reverseArguments(sortFn); }
	    return new SortedSequence(this, sortFn);
	  };

	  /**
	   * @constructor
	   */
	  function SortedSequence(parent, sortFn) {
	    this.parent = parent;
	    this.sortFn = sortFn;
	  }

	  SortedSequence.prototype = new Sequence();

	  SortedSequence.prototype.each = function each(fn) {
	    var sortFn = this.sortFn,
	        result = this.parent.toArray();

	    result.sort(sortFn);

	    return forEach(result, fn);
	  };

	  /**
	   * @examples
	   * var items = [{ a: 4 }, { a: 3 }, { a: 5 }];
	   *
	   * Lazy(items).sortBy('a').reverse();
	   * // => sequence: [{ a: 5 }, { a: 4 }, { a: 3 }]
	   *
	   * Lazy(items).sortBy('a').reverse().reverse();
	   * // => sequence: [{ a: 3 }, { a: 4 }, { a: 5 }]
	   */
	  SortedSequence.prototype.reverse = function reverse() {
	    return new SortedSequence(this.parent, reverseArguments(this.sortFn));
	  };

	  /**
	   * Creates a new {@link ObjectLikeSequence} comprising the elements in this
	   * one, grouped together according to some key. The value associated with each
	   * key in the resulting object-like sequence is an array containing all of
	   * the elements in this sequence with that key.
	   *
	   * @public
	   * @param {Function|string} keyFn The function to call on the elements in this
	   *     sequence to obtain a key by which to group them, or a string representing
	   *     a parameter to read from all the elements in this sequence.
	   * @param {Function|string} valFn (Optional) The function to call on the elements
	   *     in this sequence to assign to the value for each instance to appear in the
	   *     group, or a string representing a parameter to read from all the elements
	   *     in this sequence.
	   * @returns {ObjectLikeSequence} The new sequence.
	   *
	   * @examples
	   * function oddOrEven(x) {
	   *   return x % 2 === 0 ? 'even' : 'odd';
	   * }
	   * function square(x) {
	   *   return x*x;
	   * }
	   *
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).groupBy(oddOrEven)                     // sequence: { odd: [1, 3, 5], even: [2, 4] }
	   * Lazy(numbers).groupBy(oddOrEven).get("odd")          // => [1, 3, 5]
	   * Lazy(numbers).groupBy(oddOrEven).get("foo")          // => undefined
	   * Lazy(numbers).groupBy(oddOrEven, square).get("even") // => [4, 16]
	   *
	   * Lazy([
	   *   { name: 'toString' },
	   *   { name: 'toString' }
	   * ]).groupBy('name');
	   * // => sequence: {
	   *   'toString': [
	   *     { name: 'toString' },
	   *     { name: 'toString' }
	   *   ]
	   * }
	   */
	  Sequence.prototype.groupBy = function groupBy(keyFn, valFn) {
	    return new GroupedSequence(this, keyFn, valFn);
	  };

	  /**
	   * @constructor
	   */
	  function GroupedSequence(parent, keyFn, valFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	    this.valFn  = valFn;
	  }

	  // GroupedSequence must have its prototype set after ObjectLikeSequence has
	  // been fully initialized.

	  /**
	   * Creates a new {@link ObjectLikeSequence} comprising the elements in this
	   * one, indexed according to some key.
	   *
	   * @public
	   * @param {Function|string} keyFn The function to call on the elements in this
	   *     sequence to obtain a key by which to index them, or a string
	   *     representing a property to read from all the elements in this sequence.
	   * @param {Function|string} valFn (Optional) The function to call on the elements
	   *     in this sequence to assign to the value of the indexed object, or a string
	   *     representing a parameter to read from all the elements in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var people = [
	   *   { name: 'Bob', age: 25 },
	   *   { name: 'Fred', age: 34 }
	   * ];
	   *
	   * var bob  = people[0],
	   *     fred = people[1];
	   *
	   * Lazy(people).indexBy('name')        // sequence: { 'Bob': bob, 'Fred': fred }
	   * Lazy(people).indexBy('name', 'age') // sequence: { 'Bob': 25, 'Fred': 34 }
	   */
	  Sequence.prototype.indexBy = function(keyFn, valFn) {
	    return new IndexedSequence(this, keyFn, valFn);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedSequence(parent, keyFn, valFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	    this.valFn  = valFn;
	  }

	  // IndexedSequence must have its prototype set after ObjectLikeSequence has
	  // been fully initialized.

	  /**
	   * Creates a new {@link ObjectLikeSequence} containing the unique keys of all
	   * the elements in this sequence, each paired with the number of elements
	   * in this sequence having that key.
	   *
	   * @public
	   * @param {Function|string} keyFn The function to call on the elements in this
	   *     sequence to obtain a key by which to count them, or a string representing
	   *     a parameter to read from all the elements in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function oddOrEven(x) {
	   *   return x % 2 === 0 ? 'even' : 'odd';
	   * }
	   *
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).countBy(oddOrEven)            // sequence: { odd: 3, even: 2 }
	   * Lazy(numbers).countBy(oddOrEven).get("odd") // => 3
	   * Lazy(numbers).countBy(oddOrEven).get("foo") // => undefined
	   */
	  Sequence.prototype.countBy = function countBy(keyFn) {
	    return new CountedSequence(this, keyFn);
	  };

	  /**
	   * @constructor
	   */
	  function CountedSequence(parent, keyFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	  }

	  // CountedSequence, like GroupedSequence, must have its prototype set after
	  // ObjectLikeSequence has been fully initialized.

	  /**
	   * Creates a new sequence with every unique element from this one appearing
	   * exactly once (i.e., with duplicates removed).
	   *
	   * @public
	   * @aka unique
	   * @param {Function} keyFn An optional function to produce the key for each
	   *     object. This key is then tested for uniqueness as  opposed to the
	   *     object reference.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 2, 3, 3, 3]).uniq() // sequence: [1, 2, 3]
	   * Lazy([{ name: 'mike' }, 
	   * 	{ name: 'sarah' }, 
	   * 	{ name: 'mike' }
	   * ]).uniq('name')
	   * // sequence: [{ name: 'mike' }, { name: 'sarah' }]
	   *
	   * @benchmarks
	   * function randomOf(array) {
	   *   return function() {
	   *     return array[Math.floor(Math.random() * array.length)];
	   *   };
	   * }
	   *
	   * var mostUnique = Lazy.generate(randomOf(_.range(100)), 100).toArray(),
	   *     someUnique = Lazy.generate(randomOf(_.range(50)), 100).toArray(),
	   *     mostDupes  = Lazy.generate(randomOf(_.range(5)), 100).toArray();
	   *
	   * Lazy(mostUnique).uniq().each(Lazy.noop) // lazy - mostly unique elements
	   * Lazy(someUnique).uniq().each(Lazy.noop) // lazy - some unique elements
	   * Lazy(mostDupes).uniq().each(Lazy.noop)  // lazy - mostly duplicate elements
	   * _.each(_.uniq(mostUnique), _.noop)      // lodash - mostly unique elements
	   * _.each(_.uniq(someUnique), _.noop)      // lodash - some unique elements
	   * _.each(_.uniq(mostDupes), _.noop)       // lodash - mostly duplicate elements
	   */
	  Sequence.prototype.uniq = function uniq(keyFn) {
	    return new UniqueSequence(this, keyFn);
	  };

	  Sequence.prototype.unique = function unique(keyFn) {
	    return this.uniq(keyFn);
	  };

	  /**
	   * @constructor
	   */
	  function UniqueSequence(parent, keyFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	  }

	  UniqueSequence.prototype = new Sequence();

	  UniqueSequence.prototype.each = function each(fn) {
	    var cache = new Set(),
	        keyFn = this.keyFn,
	        i     = 0;

	    if (keyFn) {
	      keyFn = createCallback(keyFn);
	      return this.parent.each(function(e) {
	        if (cache.add(keyFn(e))) {
	          return fn(e, i++);
	        }
	      });

	    } else {
	      return this.parent.each(function(e) {
	        if (cache.add(e)) {
	          return fn(e, i++);
	        }
	      });
	    }
	  };

	  /**
	   * Creates a new sequence by combining the elements from this sequence with
	   * corresponding elements from the specified array(s).
	   *
	   * @public
	   * @param {...Array} var_args One or more arrays of elements to combine with
	   *     those of this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2]).zip([3, 4]) // sequence: [[1, 3], [2, 4]]
	   *
	   * @benchmarks
	   * var smArrL = Lazy.range(10).toArray(),
	   *     smArrR = Lazy.range(10, 20).toArray(),
	   *     lgArrL = Lazy.range(100).toArray(),
	   *     lgArrR = Lazy.range(100, 200).toArray();
	   *
	   * Lazy(smArrL).zip(smArrR).each(Lazy.noop) // lazy - zipping 10-element arrays
	   * Lazy(lgArrL).zip(lgArrR).each(Lazy.noop) // lazy - zipping 100-element arrays
	   * _.each(_.zip(smArrL, smArrR), _.noop)    // lodash - zipping 10-element arrays
	   * _.each(_.zip(lgArrL, lgArrR), _.noop)    // lodash - zipping 100-element arrays
	   */
	  Sequence.prototype.zip = function zip(var_args) {
	    if (arguments.length === 1) {
	      return new SimpleZippedSequence(this, (/** @type {Array} */ var_args));
	    } else {
	      return new ZippedSequence(this, arraySlice.call(arguments, 0));
	    }
	  };

	  /**
	   * @constructor
	   */
	  function ZippedSequence(parent, arrays) {
	    this.parent = parent;
	    this.arrays = arrays;
	  }

	  ZippedSequence.prototype = new Sequence();

	  ZippedSequence.prototype.each = function each(fn) {
	    var arrays = this.arrays,
	        i = 0;
	    this.parent.each(function(e) {
	      var group = [e];
	      for (var j = 0; j < arrays.length; ++j) {
	        if (arrays[j].length > i) {
	          group.push(arrays[j][i]);
	        }
	      }
	      return fn(group, i++);
	    });
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, in a randomized
	   * order.
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).shuffle().value() // =~ [1, 2, 3, 4, 5]
	   */
	  Sequence.prototype.shuffle = function shuffle() {
	    return new ShuffledSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function ShuffledSequence(parent) {
	    this.parent = parent;
	  }

	  ShuffledSequence.prototype = new Sequence();

	  ShuffledSequence.prototype.each = function each(fn) {
	    var shuffled = this.parent.toArray(),
	        floor = Math.floor,
	        random = Math.random,
	        j = 0;

	    for (var i = shuffled.length - 1; i > 0; --i) {
	      swap(shuffled, i, floor(random() * (i + 1)));
	      if (fn(shuffled[i], j++) === false) {
	        return;
	      }
	    }
	    fn(shuffled[0], j);
	  };

	  /**
	   * Creates a new sequence with every element from this sequence, and with arrays
	   * exploded so that a sequence of arrays (of arrays) becomes a flat sequence of
	   * values.
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, [2, 3], [4, [5]]]).flatten() // sequence: [1, 2, 3, 4, 5]
	   * Lazy([1, Lazy([2, 3])]).flatten()     // sequence: [1, 2, 3]
	   */
	  Sequence.prototype.flatten = function flatten() {
	    return new FlattenedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function FlattenedSequence(parent) {
	    this.parent = parent;
	  }

	  FlattenedSequence.prototype = new Sequence();

	  FlattenedSequence.prototype.each = function each(fn) {
	    var index = 0;

	    return this.parent.each(function recurseVisitor(e) {
	      if (e instanceof Array) {
	        return forEach(e, recurseVisitor);
	      }

	      if (e instanceof Sequence) {
	        return e.each(recurseVisitor);
	      }

	      return fn(e, index++);
	    });
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, except for all
	   * falsy values (`false`, `0`, `""`, `null`, and `undefined`).
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy(["foo", null, "bar", undefined]).compact() // sequence: ["foo", "bar"]
	   */
	  Sequence.prototype.compact = function compact() {
	    return this.filter(function(e) { return !!e; });
	  };

	  /**
	   * Creates a new sequence with all the elements of this sequence that are not
	   * also among the specified arguments.
	   *
	   * @public
	   * @aka difference
	   * @param {...*} var_args The values, or array(s) of values, to be excluded from the
	   *     resulting sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).without(2, 3)   // sequence: [1, 4, 5]
	   * Lazy([1, 2, 3, 4, 5]).without([4, 5]) // sequence: [1, 2, 3]
	   */
	  Sequence.prototype.without = function without(var_args) {
	    return new WithoutSequence(this, arraySlice.call(arguments, 0));
	  };

	  Sequence.prototype.difference = function difference(var_args) {
	    return this.without.apply(this, arguments);
	  };

	  /**
	   * @constructor
	   */
	  function WithoutSequence(parent, values) {
	    this.parent = parent;
	    this.values = values;
	  }

	  WithoutSequence.prototype = new Sequence();

	  WithoutSequence.prototype.each = function each(fn) {
	    var set = createSet(this.values),
	        i = 0;
	    return this.parent.each(function(e) {
	      if (!set.contains(e)) {
	        return fn(e, i++);
	      }
	    });
	  };

	  /**
	   * Creates a new sequence with all the unique elements either in this sequence
	   * or among the specified arguments.
	   *
	   * @public
	   * @param {...*} var_args The values, or array(s) of values, to be additionally
	   *     included in the resulting sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy(["foo", "bar"]).union([])             // sequence: ["foo", "bar"]
	   * Lazy(["foo", "bar"]).union(["bar", "baz"]) // sequence: ["foo", "bar", "baz"]
	   */
	  Sequence.prototype.union = function union(var_args) {
	    return this.concat(var_args).uniq();
	  };

	  /**
	   * Creates a new sequence with all the elements of this sequence that also
	   * appear among the specified arguments.
	   *
	   * @public
	   * @param {...*} var_args The values, or array(s) of values, in which elements
	   *     from this sequence must also be included to end up in the resulting sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy(["foo", "bar"]).intersection([])             // sequence: []
	   * Lazy(["foo", "bar"]).intersection(["bar", "baz"]) // sequence: ["bar"]
	   */
	  Sequence.prototype.intersection = function intersection(var_args) {
	    if (arguments.length === 1 && arguments[0] instanceof Array) {
	      return new SimpleIntersectionSequence(this, (/** @type {Array} */ var_args));
	    } else {
	      return new IntersectionSequence(this, arraySlice.call(arguments, 0));
	    }
	  };

	  /**
	   * @constructor
	   */
	  function IntersectionSequence(parent, arrays) {
	    this.parent = parent;
	    this.arrays = arrays;
	  }

	  IntersectionSequence.prototype = new Sequence();

	  IntersectionSequence.prototype.each = function each(fn) {
	    var sets = Lazy(this.arrays).map(function(values) {
	      return new UniqueMemoizer(Lazy(values).getIterator());
	    });

	    var setIterator = new UniqueMemoizer(sets.getIterator()),
	        i = 0;

	    return this.parent.each(function(e) {
	      var includedInAll = true;
	      setIterator.each(function(set) {
	        if (!set.contains(e)) {
	          includedInAll = false;
	          return false;
	        }
	      });

	      if (includedInAll) {
	        return fn(e, i++);
	      }
	    });
	  };

	  /**
	   * @constructor
	   */
	  function UniqueMemoizer(iterator) {
	    this.iterator     = iterator;
	    this.set          = new Set();
	    this.memo         = [];
	    this.currentValue = undefined;
	  }

	  UniqueMemoizer.prototype.current = function current() {
	    return this.currentValue;
	  };

	  UniqueMemoizer.prototype.moveNext = function moveNext() {
	    var iterator = this.iterator,
	        set = this.set,
	        memo = this.memo,
	        current;

	    while (iterator.moveNext()) {
	      current = iterator.current();
	      if (set.add(current)) {
	        memo.push(current);
	        this.currentValue = current;
	        return true;
	      }
	    }
	    return false;
	  };

	  UniqueMemoizer.prototype.each = function each(fn) {
	    var memo = this.memo,
	        length = memo.length,
	        i = -1;

	    while (++i < length) {
	      if (fn(memo[i], i) === false) {
	        return false;
	      }
	    }

	    while (this.moveNext()) {
	      if (fn(this.currentValue, i++) === false) {
	        break;
	      }
	    }
	  };

	  UniqueMemoizer.prototype.contains = function contains(e) {
	    if (this.set.contains(e)) {
	      return true;
	    }

	    while (this.moveNext()) {
	      if (this.currentValue === e) {
	        return true;
	      }
	    }

	    return false;
	  };

	  /**
	   * Checks whether every element in this sequence satisfies a given predicate.
	   *
	   * @public
	   * @aka all
	   * @param {Function} predicate A function to call on (potentially) every element
	   *     in this sequence.
	   * @returns {boolean} True if `predicate` returns true for every element in the
	   *     sequence (or the sequence is empty). False if `predicate` returns false
	   *     for at least one element.
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * var objects = [{ foo: true }, { foo: false, bar: true }];
	   *
	   * Lazy(numbers).every(isEven)     // => false
	   * Lazy(numbers).every(isPositive) // => true
	   * Lazy(objects).all('foo')        // => false
	   * Lazy(objects).all('bar')        // => false
	   */
	  Sequence.prototype.every = function every(predicate) {
	    predicate = createCallback(predicate);

	    return this.each(function(e, i) {
	      return !!predicate(e, i);
	    });
	  };

	  Sequence.prototype.all = function all(predicate) {
	    return this.every(predicate);
	  };

	  /**
	   * Checks whether at least one element in this sequence satisfies a given
	   * predicate (or, if no predicate is specified, whether the sequence contains at
	   * least one element).
	   *
	   * @public
	   * @aka any
	   * @param {Function=} predicate A function to call on (potentially) every element
	   *     in this sequence.
	   * @returns {boolean} True if `predicate` returns true for at least one element
	   *     in the sequence. False if `predicate` returns false for every element (or
	   *     the sequence is empty).
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).some()           // => true
	   * Lazy(numbers).some(isEven)     // => true
	   * Lazy(numbers).some(isNegative) // => false
	   * Lazy([]).some()                // => false
	   */
	  Sequence.prototype.some = function some(predicate) {
	    predicate = createCallback(predicate, true);

	    var success = false;
	    this.each(function(e) {
	      if (predicate(e)) {
	        success = true;
	        return false;
	      }
	    });
	    return success;
	  };

	  Sequence.prototype.any = function any(predicate) {
	    return this.some(predicate);
	  };

	  /**
	   * Checks whether NO elements in this sequence satisfy the given predicate
	   * (the opposite of {@link Sequence#all}, basically).
	   *
	   * @public
	   * @param {Function=} predicate A function to call on (potentially) every element
	   *     in this sequence.
	   * @returns {boolean} True if `predicate` does not return true for any element
	   *     in the sequence. False if `predicate` returns true for at least one
	   *     element.
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).none()           // => false
	   * Lazy(numbers).none(isEven)     // => false
	   * Lazy(numbers).none(isNegative) // => true
	   * Lazy([]).none(isEven)          // => true
	   * Lazy([]).none(isNegative)      // => true
	   * Lazy([]).none()                // => true
	   */
	  Sequence.prototype.none = function none(predicate) {
	    return !this.any(predicate);
	  };

	  /**
	   * Checks whether the sequence has no elements.
	   *
	   * @public
	   * @returns {boolean} True if the sequence is empty, false if it contains at
	   *     least one element.
	   *
	   * @examples
	   * Lazy([]).isEmpty()        // => true
	   * Lazy([1, 2, 3]).isEmpty() // => false
	   */
	  Sequence.prototype.isEmpty = function isEmpty() {
	    return !this.any();
	  };

	  /**
	   * Performs (at worst) a linear search from the head of this sequence,
	   * returning the first index at which the specified value is found.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {number} The index within this sequence where the given value is
	   *     located, or -1 if the sequence doesn't contain the value.
	   *
	   * @examples
	   * function reciprocal(x) { return 1 / x; }
	   *
	   * Lazy(["foo", "bar", "baz"]).indexOf("bar")   // => 1
	   * Lazy([1, 2, 3]).indexOf(4)                   // => -1
	   * Lazy([1, 2, 3]).map(reciprocal).indexOf(0.5) // => 1
	   */
	  Sequence.prototype.indexOf = function indexOf(value) {
	    var foundIndex = -1;
	    this.each(function(e, i) {
	      if (e === value) {
	        foundIndex = i;
	        return false;
	      }
	    });
	    return foundIndex;
	  };

	  /**
	   * Performs (at worst) a linear search from the tail of this sequence,
	   * returning the last index at which the specified value is found.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {number} The last index within this sequence where the given value
	   *     is located, or -1 if the sequence doesn't contain the value.
	   *
	   * @examples
	   * Lazy(["a", "b", "c", "b", "a"]).lastIndexOf("b")    // => 3
	   * Lazy([1, 2, 3]).lastIndexOf(0)                      // => -1
	   * Lazy([2, 2, 1, 2, 4]).filter(isEven).lastIndexOf(2) // 2
	   */
	  Sequence.prototype.lastIndexOf = function lastIndexOf(value) {
	    var reversed = this.getIndex().reverse(),
	        index    = reversed.indexOf(value);
	    if (index !== -1) {
	      index = reversed.length() - index - 1;
	    }
	    return index;
	  };

	  /**
	   * Performs a binary search of this sequence, returning the lowest index where
	   * the given value is either found, or where it belongs (if it is not already
	   * in the sequence).
	   *
	   * This method assumes the sequence is in sorted order and will fail otherwise.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {number} An index within this sequence where the given value is
	   *     located, or where it belongs in sorted order.
	   *
	   * @examples
	   * Lazy([1, 3, 6, 9]).sortedIndex(3)                    // => 1
	   * Lazy([1, 3, 6, 9]).sortedIndex(7)                    // => 3
	   * Lazy([5, 10, 15, 20]).filter(isEven).sortedIndex(10) // => 0
	   * Lazy([5, 10, 15, 20]).filter(isEven).sortedIndex(12) // => 1
	   */
	  Sequence.prototype.sortedIndex = function sortedIndex(value) {
	    var indexed = this.getIndex(),
	        lower   = 0,
	        upper   = indexed.length(),
	        i;

	    while (lower < upper) {
	      i = (lower + upper) >>> 1;
	      if (compare(indexed.get(i), value) === -1) {
	        lower = i + 1;
	      } else {
	        upper = i;
	      }
	    }
	    return lower;
	  };

	  /**
	   * Checks whether the given value is in this sequence.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {boolean} True if the sequence contains the value, false if not.
	   *
	   * @examples
	   * var numbers = [5, 10, 15, 20];
	   *
	   * Lazy(numbers).contains(15) // => true
	   * Lazy(numbers).contains(13) // => false
	   */
	  Sequence.prototype.contains = function contains(value) {
	    return this.indexOf(value) !== -1;
	  };

	  /**
	   * Aggregates a sequence into a single value according to some accumulator
	   * function.
	   *
	   * For an asynchronous sequence, instead of immediately returning a result
	   * (which it can't, obviously), this method returns an {@link AsyncHandle}
	   * whose `onComplete` method can be called to supply a callback to handle the
	   * final result once iteration has completed.
	   *
	   * @public
	   * @aka inject, foldl
	   * @param {Function} aggregator The function through which to pass every element
	   *     in the sequence. For every element, the function will be passed the total
	   *     aggregated result thus far and the element itself, and should return a
	   *     new aggregated result.
	   * @param {*=} memo The starting value to use for the aggregated result
	   *     (defaults to the first element in the sequence).
	   * @returns {*} The result of the aggregation, or, for asynchronous sequences,
	   *     an {@link AsyncHandle} whose `onComplete` method accepts a callback to
	   *     handle the final result.
	   *
	   * @examples
	   * function multiply(x, y) { return x * y; }
	   *
	   * var numbers = [1, 2, 3, 4];
	   *
	   * Lazy(numbers).reduce(multiply)    // => 24
	   * Lazy(numbers).reduce(multiply, 5) // => 120
	   */
	  Sequence.prototype.reduce = function reduce(aggregator, memo) {
	    if (arguments.length < 2) {
	      return this.tail().reduce(aggregator, this.head());
	    }

	    var eachResult = this.each(function(e, i) {
	      memo = aggregator(memo, e, i);
	    });

	    // TODO: Think of a way more efficient solution to this problem.
	    if (eachResult instanceof AsyncHandle) {
	      return eachResult.then(function() { return memo; });
	    }

	    return memo;
	  };

	  Sequence.prototype.inject =
	  Sequence.prototype.foldl = function foldl(aggregator, memo) {
	    return this.reduce(aggregator, memo);
	  };

	  /**
	   * Aggregates a sequence, from the tail, into a single value according to some
	   * accumulator function.
	   *
	   * @public
	   * @aka foldr
	   * @param {Function} aggregator The function through which to pass every element
	   *     in the sequence. For every element, the function will be passed the total
	   *     aggregated result thus far and the element itself, and should return a
	   *     new aggregated result.
	   * @param {*} memo The starting value to use for the aggregated result.
	   * @returns {*} The result of the aggregation.
	   *
	   * @examples
	   * function append(s1, s2) {
	   *   return s1 + s2;
	   * }
	   *
	   * function isVowel(str) {
	   *   return "aeiou".indexOf(str) !== -1;
	   * }
	   *
	   * Lazy("abcde").reduceRight(append)                 // => "edcba"
	   * Lazy("abcde").filter(isVowel).reduceRight(append) // => "ea"
	   */
	  Sequence.prototype.reduceRight = function reduceRight(aggregator, memo) {
	    if (arguments.length < 2) {
	      return this.initial(1).reduceRight(aggregator, this.last());
	    }

	    // This bothers me... but frankly, calling reverse().reduce() is potentially
	    // going to eagerly evaluate the sequence anyway; so it's really not an issue.
	    var indexed = this.getIndex(),
	        i = indexed.length() - 1;
	    return indexed.reverse().reduce(function(m, e) {
	      return aggregator(m, e, i--);
	    }, memo);
	  };

	  Sequence.prototype.foldr = function foldr(aggregator, memo) {
	    return this.reduceRight(aggregator, memo);
	  };

	  /**
	   * Groups this sequence into consecutive (overlapping) segments of a specified
	   * length. If the underlying sequence has fewer elements than the specfied
	   * length, then this sequence will be empty.
	   *
	   * @public
	   * @param {number} length The length of each consecutive segment.
	   * @returns {Sequence} The resulting sequence of consecutive segments.
	   *
	   * @examples
	   * Lazy([]).consecutive(2)        // => sequence: []
	   * Lazy([1]).consecutive(2)       // => sequence: []
	   * Lazy([1, 2]).consecutive(2)    // => sequence: [[1, 2]]
	   * Lazy([1, 2, 3]).consecutive(2) // => sequence: [[1, 2], [2, 3]]
	   * Lazy([1, 2, 3]).consecutive(0) // => sequence: [[]]
	   * Lazy([1, 2, 3]).consecutive(1) // => sequence: [[1], [2], [3]]
	   */
	  Sequence.prototype.consecutive = function consecutive(count) {
	    var queue    = new Queue(count);
	    var segments = this.map(function(element) {
	      if (queue.add(element).count === count) {
	        return queue.toArray();
	      }
	    });
	    return segments.compact();
	  };

	  /**
	   * Breaks this sequence into chunks (arrays) of a specified length.
	   *
	   * @public
	   * @param {number} size The size of each chunk.
	   * @returns {Sequence} The resulting sequence of chunks.
	   *
	   * @examples
	   * Lazy([]).chunk(2)        // sequence: []
	   * Lazy([1, 2, 3]).chunk(2) // sequence: [[1, 2], [3]]
	   * Lazy([1, 2, 3]).chunk(1) // sequence: [[1], [2], [3]]
	   * Lazy([1, 2, 3]).chunk(4) // sequence: [[1, 2, 3]]
	   * Lazy([1, 2, 3]).chunk(0) // throws
	   */
	  Sequence.prototype.chunk = function chunk(size) {
	    if (size < 1) {
	      throw new Error("You must specify a positive chunk size.");
	    }

	    return new ChunkedSequence(this, size);
	  };

	  /**
	   * @constructor
	   */
	  function ChunkedSequence(parent, size) {
	    this.parent    = parent;
	    this.chunkSize = size;
	  }

	  ChunkedSequence.prototype = new Sequence();

	  ChunkedSequence.prototype.getIterator = function getIterator() {
	    return new ChunkedIterator(this.parent, this.chunkSize);
	  };

	  /**
	   * @constructor
	   */
	  function ChunkedIterator(sequence, size) {
	    this.iterator = sequence.getIterator();
	    this.size     = size;
	  }

	  ChunkedIterator.prototype.current = function current() {
	    return this.currentChunk;
	  };

	  ChunkedIterator.prototype.moveNext = function moveNext() {
	    var iterator  = this.iterator,
	        chunkSize = this.size,
	        chunk     = [];

	    while (chunk.length < chunkSize && iterator.moveNext()) {
	      chunk.push(iterator.current());
	    }

	    if (chunk.length === 0) {
	      return false;
	    }

	    this.currentChunk = chunk;
	    return true;
	  };

	  /**
	   * Passes each element in the sequence to the specified callback during
	   * iteration. This is like {@link Sequence#each}, except that it can be
	   * inserted anywhere in the middle of a chain of methods to "intercept" the
	   * values in the sequence at that point.
	   *
	   * @public
	   * @param {Function} callback A function to call on every element in the
	   *     sequence during iteration. The return value of this function does not
	   *     matter.
	   * @returns {Sequence} A sequence comprising the same elements as this one.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).tap(fn).each(Lazy.noop); // calls fn 3 times
	   */
	  Sequence.prototype.tap = function tap(callback) {
	    return new TappedSequence(this, callback);
	  };

	  /**
	   * @constructor
	   */
	  function TappedSequence(parent, callback) {
	    this.parent = parent;
	    this.callback = callback;
	  }

	  TappedSequence.prototype = new Sequence();

	  TappedSequence.prototype.each = function each(fn) {
	    var callback = this.callback;
	    return this.parent.each(function(e, i) {
	      callback(e, i);
	      return fn(e, i);
	    });
	  };

	  /**
	   * Seaches for the first element in the sequence satisfying a given predicate.
	   *
	   * @public
	   * @aka detect
	   * @param {Function} predicate A function to call on (potentially) every element
	   *     in the sequence.
	   * @returns {*} The first element in the sequence for which `predicate` returns
	   *     `true`, or `undefined` if no such element is found.
	   *
	   * @examples
	   * function divisibleBy3(x) {
	   *   return x % 3 === 0;
	   * }
	   *
	   * var numbers = [5, 6, 7, 8, 9, 10];
	   *
	   * Lazy(numbers).find(divisibleBy3) // => 6
	   * Lazy(numbers).find(isNegative)   // => undefined
	   */
	  Sequence.prototype.find = function find(predicate) {
	    return this.filter(predicate).first();
	  };

	  Sequence.prototype.detect = function detect(predicate) {
	    return this.find(predicate);
	  };

	  /**
	   * Gets the minimum value in the sequence.
	   *
	   * @public
	   * @param {Function=} valueFn The function by which the value for comparison is
	   *     calculated for each element in the sequence.
	   * @returns {*} The element with the lowest value in the sequence, or
	   *     `Infinity` if the sequence is empty.
	   *
	   * @examples
	   * function negate(x) { return x * -1; }
	   *
	   * Lazy([]).min()                       // => Infinity
	   * Lazy([6, 18, 2, 49, 34]).min()       // => 2
	   * Lazy([6, 18, 2, 49, 34]).min(negate) // => 49
	   */
	  Sequence.prototype.min = function min(valueFn) {
	    if (typeof valueFn !== "undefined") {
	      return this.minBy(valueFn);
	    }

	    return this.reduce(function(x, y) { return y < x ? y : x; }, Infinity);
	  };

	  Sequence.prototype.minBy = function minBy(valueFn) {
	    valueFn = createCallback(valueFn);
	    return this.reduce(function(x, y) { return valueFn(y) < valueFn(x) ? y : x; });
	  };

	  /**
	   * Gets the maximum value in the sequence.
	   *
	   * @public
	   * @param {Function=} valueFn The function by which the value for comparison is
	   *     calculated for each element in the sequence.
	   * @returns {*} The element with the highest value in the sequence, or
	   *     `-Infinity` if the sequence is empty.
	   *
	   * @examples
	   * function reverseDigits(x) {
	   *   return Number(String(x).split('').reverse().join(''));
	   * }
	   *
	   * Lazy([]).max()                              // => -Infinity
	   * Lazy([6, 18, 2, 48, 29]).max()              // => 48
	   * Lazy([6, 18, 2, 48, 29]).max(reverseDigits) // => 29
	   */
	  Sequence.prototype.max = function max(valueFn) {
	    if (typeof valueFn !== "undefined") {
	      return this.maxBy(valueFn);
	    }

	    return this.reduce(function(x, y) { return y > x ? y : x; }, -Infinity);
	  };

	  Sequence.prototype.maxBy = function maxBy(valueFn) {
	    valueFn = createCallback(valueFn);
	    return this.reduce(function(x, y) { return valueFn(y) > valueFn(x) ? y : x; });
	  };

	  /**
	   * Gets the sum of the values in the sequence.
	   *
	   * @public
	   * @param {Function=} valueFn The function used to select the values that will
	   *     be summed up.
	   * @returns {*} The sum.
	   *
	   * @examples
	   * Lazy([]).sum()                     // => 0
	   * Lazy([1, 2, 3, 4]).sum()           // => 10
	   * Lazy([1.2, 3.4]).sum(Math.floor)   // => 4
	   * Lazy(['foo', 'bar']).sum('length') // => 6
	   */
	  Sequence.prototype.sum = function sum(valueFn) {
	    if (typeof valueFn !== "undefined") {
	      return this.sumBy(valueFn);
	    }

	    return this.reduce(function(x, y) { return x + y; }, 0);
	  };

	  Sequence.prototype.sumBy = function sumBy(valueFn) {
	    valueFn = createCallback(valueFn);
	    return this.reduce(function(x, y) { return x + valueFn(y); }, 0);
	  };

	  /**
	   * Creates a string from joining together all of the elements in this sequence,
	   * separated by the given delimiter.
	   *
	   * @public
	   * @aka toString
	   * @param {string=} delimiter The separator to insert between every element from
	   *     this sequence in the resulting string (defaults to `","`).
	   * @returns {string} The delimited string.
	   *
	   * @examples
	   * Lazy([6, 29, 1984]).join("/")  // => "6/29/1984"
	   * Lazy(["a", "b", "c"]).join()   // => "a,b,c"
	   * Lazy(["a", "b", "c"]).join("") // => "abc"
	   * Lazy([1, 2, 3]).join()         // => "1,2,3"
	   * Lazy([1, 2, 3]).join("")       // => "123"
	   * Lazy(["", "", ""]).join(",")   // => ",,"
	   */
	  Sequence.prototype.join = function join(delimiter) {
	    delimiter = typeof delimiter === "string" ? delimiter : ",";

	    return this.reduce(function(str, e, i) {
	      if (i > 0) {
	        str += delimiter;
	      }
	      return str + e;
	    }, "");
	  };

	  Sequence.prototype.toString = function toString(delimiter) {
	    return this.join(delimiter);
	  };

	  /**
	   * Creates a sequence, with the same elements as this one, that will be iterated
	   * over asynchronously when calling `each`.
	   *
	   * @public
	   * @param {number=} interval The approximate period, in milliseconds, that
	   *     should elapse between each element in the resulting sequence. Omitting
	   *     this argument will result in the fastest possible asynchronous iteration.
	   * @returns {AsyncSequence} The new asynchronous sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).async(100).each(fn) // calls fn 3 times asynchronously
	   */
	  Sequence.prototype.async = function async(interval) {
	    return new AsyncSequence(this, interval);
	  };

	  /**
	   * @constructor
	   */
	  function SimpleIntersectionSequence(parent, array) {
	    this.parent = parent;
	    this.array  = array;
	    this.each   = getEachForIntersection(array);
	  }

	  SimpleIntersectionSequence.prototype = new Sequence();

	  SimpleIntersectionSequence.prototype.eachMemoizerCache = function eachMemoizerCache(fn) {
	    var iterator = new UniqueMemoizer(Lazy(this.array).getIterator()),
	        i = 0;

	    return this.parent.each(function(e) {
	      if (iterator.contains(e)) {
	        return fn(e, i++);
	      }
	    });
	  };

	  SimpleIntersectionSequence.prototype.eachArrayCache = function eachArrayCache(fn) {
	    var array = this.array,
	        find  = arrayContains,
	        i = 0;

	    return this.parent.each(function(e) {
	      if (find(array, e)) {
	        return fn(e, i++);
	      }
	    });
	  };

	  function getEachForIntersection(source) {
	    if (source.length < 40) {
	      return SimpleIntersectionSequence.prototype.eachArrayCache;
	    } else {
	      return SimpleIntersectionSequence.prototype.eachMemoizerCache;
	    }
	  }

	  /**
	   * An optimized version of {@link ZippedSequence}, when zipping a sequence with
	   * only one array.
	   *
	   * @param {Sequence} parent The underlying sequence.
	   * @param {Array} array The array with which to zip the sequence.
	   * @constructor
	   */
	  function SimpleZippedSequence(parent, array) {
	    this.parent = parent;
	    this.array  = array;
	  }

	  SimpleZippedSequence.prototype = new Sequence();

	  SimpleZippedSequence.prototype.each = function each(fn) {
	    var array = this.array;
	    return this.parent.each(function(e, i) {
	      return fn([e, array[i]], i);
	    });
	  };

	  /**
	   * An `ArrayLikeSequence` is a {@link Sequence} that provides random access to
	   * its elements. This extends the API for iterating with the additional methods
	   * {@link #get} and {@link #length}, allowing a sequence to act as a "view" into
	   * a collection or other indexed data source.
	   *
	   * The initial sequence created by wrapping an array with `Lazy(array)` is an
	   * `ArrayLikeSequence`.
	   *
	   * All methods of `ArrayLikeSequence` that conceptually should return
	   * something like a array (with indexed access) return another
	   * `ArrayLikeSequence`, for example:
	   *
	   * - {@link Sequence#map}
	   * - {@link ArrayLikeSequence#slice}
	   * - {@link Sequence#take} and {@link Sequence#drop}
	   * - {@link Sequence#reverse}
	   *
	   * The above is not an exhaustive list. There are also certain other cases
	   * where it might be possible to return an `ArrayLikeSequence` (e.g., calling
	   * {@link Sequence#concat} with a single array argument), but this is not
	   * guaranteed by the API.
	   *
	   * Note that in many cases, it is not possible to provide indexed access
	   * without first performing at least a partial iteration of the underlying
	   * sequence. In these cases an `ArrayLikeSequence` will not be returned:
	   *
	   * - {@link Sequence#filter}
	   * - {@link Sequence#uniq}
	   * - {@link Sequence#union}
	   * - {@link Sequence#intersect}
	   *
	   * etc. The above methods only return ordinary {@link Sequence} objects.
	   *
	   * Defining custom array-like sequences
	   * ------------------------------------
	   *
	   * Creating a custom `ArrayLikeSequence` is essentially the same as creating a
	   * custom {@link Sequence}. You just have a couple more methods you need to
	   * implement: `get` and (optionally) `length`.
	   *
	   * Here's an example. Let's define a sequence type called `OffsetSequence` that
	   * offsets each of its parent's elements by a set distance, and circles back to
	   * the beginning after reaching the end. **Remember**: the initialization
	   * function you pass to {@link #define} should always accept a `parent` as its
	   * first parameter.
	   *
	   *     ArrayLikeSequence.define("offset", {
	   *       init: function(parent, offset) {
	   *         this.offset = offset;
	   *       },
	   *
	   *       get: function(i) {
	   *         return this.parent.get((i + this.offset) % this.parent.length());
	   *       }
	   *     });
	   *
	   * It's worth noting a couple of things here.
	   *
	   * First, Lazy's default implementation of `length` simply returns the parent's
	   * length. In this case, since an `OffsetSequence` will always have the same
	   * number of elements as its parent, that implementation is fine; so we don't
	   * need to override it.
	   *
	   * Second, the default implementation of `each` uses `get` and `length` to
	   * essentially create a `for` loop, which is fine here. If you want to implement
	   * `each` your own way, you can do that; but in most cases (as here), you can
	   * probably just stick with the default.
	   *
	   * So we're already done, after only implementing `get`! Pretty easy, huh?
	   *
	   * Now the `offset` method will be chainable from any `ArrayLikeSequence`. So
	   * for example:
	   *
	   *     Lazy([1, 2, 3]).map(mapFn).offset(3);
	   *
	   * ...will work, but:
	   *
	   *     Lazy([1, 2, 3]).filter(mapFn).offset(3);
	   *
	   * ...will not (because `filter` does not return an `ArrayLikeSequence`).
	   *
	   * (Also, as with the example provided for defining custom {@link Sequence}
	   * types, this example really could have been implemented using a function
	   * already available as part of Lazy.js: in this case, {@link Sequence#map}.)
	   *
	   * @public
	   * @constructor
	   *
	   * @examples
	   * Lazy([1, 2, 3])                    // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).map(Lazy.identity) // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).take(2)            // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).drop(2)            // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).reverse()          // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).slice(1, 2)        // instanceof Lazy.ArrayLikeSequence
	   */
	  function ArrayLikeSequence() {}

	  ArrayLikeSequence.prototype = new Sequence();

	  /**
	   * Create a new constructor function for a type inheriting from
	   * `ArrayLikeSequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `ArrayLikeSequence` prototype so that it can be chained with any other
	   *     methods that return array-like sequences.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. **Must** include `get`. *May* include `init`,
	   *     `length`, `getIterator`, and `each`. For each function, `this` will be
	   *     the new sequence and `this.parent` will be the source sequence.
	   * @returns {Function} A constructor for a new type inheriting from
	   *     `ArrayLikeSequence`.
	   *
	   * @examples
	   * Lazy.ArrayLikeSequence.define("offset", {
	   *   init: function(offset) {
	   *     this.offset = offset;
	   *   },
	   *
	   *   get: function(i) {
	   *     return this.parent.get((i + this.offset) % this.parent.length());
	   *   }
	   * });
	   *
	   * Lazy([1, 2, 3]).offset(1) // sequence: [2, 3, 1]
	   */
	  ArrayLikeSequence.define = function define(methodName, overrides) {
	    if (!overrides || typeof overrides.get !== 'function') {
	      throw new Error("A custom array-like sequence must implement *at least* get!");
	    }

	    return defineSequenceType(ArrayLikeSequence, methodName, overrides);
	  };

	  /**
	   * Returns the element at the specified index.
	   *
	   * @public
	   * @param {number} i The index to access.
	   * @returns {*} The element.
	   *
	   * @examples
	   * function increment(x) { return x + 1; }
	   *
	   * Lazy([1, 2, 3]).get(1)                // => 2
	   * Lazy([1, 2, 3]).get(-1)               // => undefined
	   * Lazy([1, 2, 3]).map(increment).get(1) // => 3
	   */
	  ArrayLikeSequence.prototype.get = function get(i) {
	    return this.parent.get(i);
	  };

	  /**
	   * Returns the length of the sequence.
	   *
	   * @public
	   * @returns {number} The length.
	   *
	   * @examples
	   * function increment(x) { return x + 1; }
	   *
	   * Lazy([]).length()                       // => 0
	   * Lazy([1, 2, 3]).length()                // => 3
	   * Lazy([1, 2, 3]).map(increment).length() // => 3
	   */
	  ArrayLikeSequence.prototype.length = function length() {
	    return this.parent.length();
	  };

	  /**
	   * Returns the current sequence (since it is already indexed).
	   */
	  ArrayLikeSequence.prototype.getIndex = function getIndex() {
	    return this;
	  };

	  /**
	   * An optimized version of {@link Sequence#getIterator}.
	   */
	  ArrayLikeSequence.prototype.getIterator = function getIterator() {
	    return new IndexedIterator(this);
	  };

	  /**
	   * An optimized version of {@link Iterator} meant to work with already-indexed
	   * sequences.
	   *
	   * @param {ArrayLikeSequence} sequence The sequence to iterate over.
	   * @constructor
	   */
	  function IndexedIterator(sequence) {
	    this.sequence = sequence;
	    this.index    = -1;
	  }

	  IndexedIterator.prototype.current = function current() {
	    return this.sequence.get(this.index);
	  };

	  IndexedIterator.prototype.moveNext = function moveNext() {
	    if (this.index >= this.sequence.length() - 1) {
	      return false;
	    }

	    ++this.index;
	    return true;
	  };

	  /**
	   * An optimized version of {@link Sequence#each}.
	   */
	  ArrayLikeSequence.prototype.each = function each(fn) {
	    var length = this.length(),
	        i = -1;

	    while (++i < length) {
	      if (fn(this.get(i), i) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * Returns a new sequence with the same elements as this one, minus the last
	   * element.
	   *
	   * @public
	   * @returns {ArrayLikeSequence} The new array-like sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).pop() // sequence: [1, 2]
	   * Lazy([]).pop()        // sequence: []
	   */
	  ArrayLikeSequence.prototype.pop = function pop() {
	    return this.initial();
	  };

	  /**
	   * Returns a new sequence with the same elements as this one, minus the first
	   * element.
	   *
	   * @public
	   * @returns {ArrayLikeSequence} The new array-like sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).shift() // sequence: [2, 3]
	   * Lazy([]).shift()        // sequence: []
	   */
	  ArrayLikeSequence.prototype.shift = function shift() {
	    return this.drop();
	  };

	  /**
	   * Returns a new sequence comprising the portion of this sequence starting
	   * from the specified starting index and continuing until the specified ending
	   * index or to the end of the sequence.
	   *
	   * @public
	   * @param {number} begin The index at which the new sequence should start.
	   * @param {number=} end The index at which the new sequence should end.
	   * @returns {ArrayLikeSequence} The new array-like sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).slice(0)     // sequence: [1, 2, 3, 4, 5]
	   * Lazy([1, 2, 3, 4, 5]).slice(2)     // sequence: [3, 4, 5]
	   * Lazy([1, 2, 3, 4, 5]).slice(2, 4)  // sequence: [3, 4]
	   * Lazy([1, 2, 3, 4, 5]).slice(-1)    // sequence: [5]
	   * Lazy([1, 2, 3, 4, 5]).slice(1, -1) // sequence: [2, 3, 4]
	   * Lazy([1, 2, 3, 4, 5]).slice(0, 10) // sequence: [1, 2, 3, 4, 5]
	   */
	  ArrayLikeSequence.prototype.slice = function slice(begin, end) {
	    var length = this.length();

	    if (begin < 0) {
	      begin = length + begin;
	    }

	    var result = this.drop(begin);

	    if (typeof end === "number") {
	      if (end < 0) {
	        end = length + end;
	      }
	      result = result.take(end - begin);
	    }

	    return result;
	  };

	  /**
	   * An optimized version of {@link Sequence#map}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).map(Lazy.identity) // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.map = function map(mapFn) {
	    return new IndexedMappedSequence(this, createCallback(mapFn));
	  };

	  /**
	   * @constructor
	   */
	  function IndexedMappedSequence(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  IndexedMappedSequence.prototype = new ArrayLikeSequence();

	  IndexedMappedSequence.prototype.get = function get(i) {
	    if (i < 0 || i >= this.parent.length()) {
	      return undefined;
	    }

	    return this.mapFn(this.parent.get(i), i);
	  };

	  /**
	   * An optimized version of {@link Sequence#filter}.
	   */
	  ArrayLikeSequence.prototype.filter = function filter(filterFn) {
	    return new IndexedFilteredSequence(this, createCallback(filterFn));
	  };

	  /**
	   * @constructor
	   */
	  function IndexedFilteredSequence(parent, filterFn) {
	    this.parent   = parent;
	    this.filterFn = filterFn;
	  }

	  IndexedFilteredSequence.prototype = new FilteredSequence();

	  IndexedFilteredSequence.prototype.each = function each(fn) {
	    var parent = this.parent,
	        filterFn = this.filterFn,
	        length = this.parent.length(),
	        i = -1,
	        j = 0,
	        e;

	    while (++i < length) {
	      e = parent.get(i);
	      if (filterFn(e, i) && fn(e, j++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * An optimized version of {@link Sequence#reverse}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).reverse() // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.reverse = function reverse() {
	    return new IndexedReversedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedReversedSequence(parent) {
	    this.parent = parent;
	  }

	  IndexedReversedSequence.prototype = new ArrayLikeSequence();

	  IndexedReversedSequence.prototype.get = function get(i) {
	    return this.parent.get(this.length() - i - 1);
	  };

	  /**
	   * An optimized version of {@link Sequence#first}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).first(2) // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.first = function first(count) {
	    if (typeof count === "undefined") {
	      return this.get(0);
	    }

	    return new IndexedTakeSequence(this, count);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedTakeSequence(parent, count) {
	    this.parent = parent;
	    this.count  = count;
	  }

	  IndexedTakeSequence.prototype = new ArrayLikeSequence();

	  IndexedTakeSequence.prototype.length = function length() {
	    var parentLength = this.parent.length();
	    return this.count <= parentLength ? this.count : parentLength;
	  };

	  /**
	   * An optimized version of {@link Sequence#rest}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).rest() // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.rest = function rest(count) {
	    return new IndexedDropSequence(this, count);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedDropSequence(parent, count) {
	    this.parent = parent;
	    this.count  = typeof count === "number" ? count : 1;
	  }

	  IndexedDropSequence.prototype = new ArrayLikeSequence();

	  IndexedDropSequence.prototype.get = function get(i) {
	    return this.parent.get(this.count + i);
	  };

	  IndexedDropSequence.prototype.length = function length() {
	    var parentLength = this.parent.length();
	    return this.count <= parentLength ? parentLength - this.count : 0;
	  };

	  /**
	   * An optimized version of {@link Sequence#concat} that returns another
	   * {@link ArrayLikeSequence} *if* the argument is an array.
	   *
	   * @public
	   * @param {...*} var_args
	   *
	   * @examples
	   * Lazy([1, 2]).concat([3, 4]) // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2]).concat([3, 4]) // sequence: [1, 2, 3, 4]
	   */
	  ArrayLikeSequence.prototype.concat = function concat(var_args) {
	    if (arguments.length === 1 && arguments[0] instanceof Array) {
	      return new IndexedConcatenatedSequence(this, (/** @type {Array} */ var_args));
	    } else {
	      return Sequence.prototype.concat.apply(this, arguments);
	    }
	  };

	  /**
	   * @constructor
	   */
	  function IndexedConcatenatedSequence(parent, other) {
	    this.parent = parent;
	    this.other  = other;
	  }

	  IndexedConcatenatedSequence.prototype = new ArrayLikeSequence();

	  IndexedConcatenatedSequence.prototype.get = function get(i) {
	    var parentLength = this.parent.length();
	    if (i < parentLength) {
	      return this.parent.get(i);
	    } else {
	      return this.other[i - parentLength];
	    }
	  };

	  IndexedConcatenatedSequence.prototype.length = function length() {
	    return this.parent.length() + this.other.length;
	  };

	  /**
	   * An optimized version of {@link Sequence#uniq}.
	   */
	  ArrayLikeSequence.prototype.uniq = function uniq(keyFn) {
	    return new IndexedUniqueSequence(this, createCallback(keyFn));
	  };

	  /**
	   * @param {ArrayLikeSequence} parent
	   * @constructor
	   */
	  function IndexedUniqueSequence(parent, keyFn) {
	    this.parent = parent;
	    this.each   = getEachForParent(parent);
	    this.keyFn  = keyFn;
	  }

	  IndexedUniqueSequence.prototype = new Sequence();

	  IndexedUniqueSequence.prototype.eachArrayCache = function eachArrayCache(fn) {
	    // Basically the same implementation as w/ the set, but using an array because
	    // it's cheaper for smaller sequences.
	    var parent = this.parent,
	        keyFn  = this.keyFn,
	        length = parent.length(),
	        cache  = [],
	        find   = arrayContains,
	        key, value,
	        i = -1,
	        j = 0;

	    while (++i < length) {
	      value = parent.get(i);
	      key = keyFn(value);
	      if (!find(cache, key)) {
	        cache.push(key);
	        if (fn(value, j++) === false) {
	          return false;
	        }
	      }
	    }
	  };

	  IndexedUniqueSequence.prototype.eachSetCache = UniqueSequence.prototype.each;

	  function getEachForParent(parent) {
	    if (parent.length() < 100) {
	      return IndexedUniqueSequence.prototype.eachArrayCache;
	    } else {
	      return UniqueSequence.prototype.each;
	    }
	  }

	  // Now that we've fully initialized the ArrayLikeSequence prototype, we can
	  // set the prototype for MemoizedSequence.

	  MemoizedSequence.prototype = new ArrayLikeSequence();

	  MemoizedSequence.prototype.cache = function cache() {
	    return this.cachedResult || (this.cachedResult = this.parent.toArray());
	  };

	  MemoizedSequence.prototype.get = function get(i) {
	    return this.cache()[i];
	  };

	  MemoizedSequence.prototype.length = function length() {
	    return this.cache().length;
	  };

	  MemoizedSequence.prototype.slice = function slice(begin, end) {
	    return this.cache().slice(begin, end);
	  };

	  MemoizedSequence.prototype.toArray = function toArray() {
	    return this.cache().slice(0);
	  };

	  /**
	   * ArrayWrapper is the most basic {@link Sequence}. It directly wraps an array
	   * and implements the same methods as {@link ArrayLikeSequence}, but more
	   * efficiently.
	   *
	   * @constructor
	   */
	  function ArrayWrapper(source) {
	    this.source = source;
	  }

	  ArrayWrapper.prototype = new ArrayLikeSequence();

	  ArrayWrapper.prototype.root = function root() {
	    return this;
	  };

	  ArrayWrapper.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  /**
	   * Returns the element at the specified index in the source array.
	   *
	   * @param {number} i The index to access.
	   * @returns {*} The element.
	   */
	  ArrayWrapper.prototype.get = function get(i) {
	    return this.source[i];
	  };

	  /**
	   * Returns the length of the source array.
	   *
	   * @returns {number} The length.
	   */
	  ArrayWrapper.prototype.length = function length() {
	    return this.source.length;
	  };

	  /**
	   * An optimized version of {@link Sequence#each}.
	   */
	  ArrayWrapper.prototype.each = function each(fn) {
	    return forEach(this.source, fn);
	  };

	  /**
	   * An optimized version of {@link Sequence#map}.
	   */
	  ArrayWrapper.prototype.map = function map(mapFn) {
	    return new MappedArrayWrapper(this, createCallback(mapFn));
	  };

	  /**
	   * An optimized version of {@link Sequence#filter}.
	   */
	  ArrayWrapper.prototype.filter = function filter(filterFn) {
	    return new FilteredArrayWrapper(this, createCallback(filterFn));
	  };

	  /**
	   * An optimized version of {@link Sequence#uniq}.
	   */
	  ArrayWrapper.prototype.uniq = function uniq(keyFn) {
	    return new UniqueArrayWrapper(this, keyFn);
	  };

	  /**
	   * An optimized version of {@link ArrayLikeSequence#concat}.
	   *
	   * @param {...*} var_args
	   */
	  ArrayWrapper.prototype.concat = function concat(var_args) {
	    if (arguments.length === 1 && arguments[0] instanceof Array) {
	      return new ConcatArrayWrapper(this, (/** @type {Array} */ var_args));
	    } else {
	      return ArrayLikeSequence.prototype.concat.apply(this, arguments);
	    }
	  };

	  /**
	   * An optimized version of {@link Sequence#toArray}.
	   */
	  ArrayWrapper.prototype.toArray = function toArray() {
	    return this.source.slice(0);
	  };

	  /**
	   * @constructor
	   */
	  function MappedArrayWrapper(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  MappedArrayWrapper.prototype = new ArrayLikeSequence();

	  MappedArrayWrapper.prototype.get = function get(i) {
	    var source = this.parent.source;

	    if (i < 0 || i >= source.length) {
	      return undefined;
	    }

	    return this.mapFn(source[i]);
	  };

	  MappedArrayWrapper.prototype.length = function length() {
	    return this.parent.source.length;
	  };

	  MappedArrayWrapper.prototype.each = function each(fn) {
	    var source = this.parent.source,
	        length = source.length,
	        mapFn  = this.mapFn,
	        i = -1;

	    while (++i < length) {
	      if (fn(mapFn(source[i], i), i) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * @constructor
	   */
	  function FilteredArrayWrapper(parent, filterFn) {
	    this.parent   = parent;
	    this.filterFn = filterFn;
	  }

	  FilteredArrayWrapper.prototype = new FilteredSequence();

	  FilteredArrayWrapper.prototype.each = function each(fn) {
	    var source = this.parent.source,
	        filterFn = this.filterFn,
	        length = source.length,
	        i = -1,
	        j = 0,
	        e;

	    while (++i < length) {
	      e = source[i];
	      if (filterFn(e, i) && fn(e, j++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * @constructor
	   */
	  function UniqueArrayWrapper(parent, keyFn) {
	    this.parent = parent;
	    this.each   = getEachForSource(parent.source);
	    this.keyFn  = keyFn;
	  }

	  UniqueArrayWrapper.prototype = new Sequence();

	  UniqueArrayWrapper.prototype.eachNoCache = function eachNoCache(fn) {
	    var source = this.parent.source,
	        keyFn  = this.keyFn,
	        length = source.length,
	        find   = arrayContainsBefore,
	        value,

	        // Yes, this is hideous.
	        // Trying to get performance first, will refactor next!
	        i = -1,
	        k = 0;

	    while (++i < length) {
	      value = source[i];
	      if (!find(source, value, i, keyFn) && fn(value, k++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  UniqueArrayWrapper.prototype.eachArrayCache = function eachArrayCache(fn) {
	    // Basically the same implementation as w/ the set, but using an array because
	    // it's cheaper for smaller sequences.
	    var source = this.parent.source,
	        keyFn  = this.keyFn,
	        length = source.length,
	        cache  = [],
	        find   = arrayContains,
	        key, value,
	        i = -1,
	        j = 0;

	    if (keyFn) {
	      keyFn = createCallback(keyFn);
	      while (++i < length) {
	        value = source[i];
	        key = keyFn(value);
	        if (!find(cache, key)) {
	          cache.push(key);
	          if (fn(value, j++) === false) {
	            return false;
	          }
	        }
	      }

	    } else {
	      while (++i < length) {
	        value = source[i];
	        if (!find(cache, value)) {
	          cache.push(value);
	          if (fn(value, j++) === false) {
	            return false;
	          }
	        }
	      }
	    }

	    return true;
	  };

	  UniqueArrayWrapper.prototype.eachSetCache = UniqueSequence.prototype.each;

	  /**
	   * My latest findings here...
	   *
	   * So I hadn't really given the set-based approach enough credit. The main issue
	   * was that my Set implementation was totally not optimized at all. After pretty
	   * heavily optimizing it (just take a look; it's a monstrosity now!), it now
	   * becomes the fastest option for much smaller values of N.
	   */
	  function getEachForSource(source) {
	    if (source.length < 40) {
	      return UniqueArrayWrapper.prototype.eachNoCache;
	    } else if (source.length < 100) {
	      return UniqueArrayWrapper.prototype.eachArrayCache;
	    } else {
	      return UniqueArrayWrapper.prototype.eachSetCache;
	    }
	  }

	  /**
	   * @constructor
	   */
	  function ConcatArrayWrapper(parent, other) {
	    this.parent = parent;
	    this.other  = other;
	  }

	  ConcatArrayWrapper.prototype = new ArrayLikeSequence();

	  ConcatArrayWrapper.prototype.get = function get(i) {
	    var source = this.parent.source,
	        sourceLength = source.length;

	    if (i < sourceLength) {
	      return source[i];
	    } else {
	      return this.other[i - sourceLength];
	    }
	  };

	  ConcatArrayWrapper.prototype.length = function length() {
	    return this.parent.source.length + this.other.length;
	  };

	  ConcatArrayWrapper.prototype.each = function each(fn) {
	    var source = this.parent.source,
	        sourceLength = source.length,
	        other = this.other,
	        otherLength = other.length,
	        i = 0,
	        j = -1;

	    while (++j < sourceLength) {
	      if (fn(source[j], i++) === false) {
	        return false;
	      }
	    }

	    j = -1;
	    while (++j < otherLength) {
	      if (fn(other[j], i++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * An `ObjectLikeSequence` object represents a sequence of key/value pairs.
	   *
	   * The initial sequence you get by wrapping an object with `Lazy(object)` is
	   * an `ObjectLikeSequence`.
	   *
	   * All methods of `ObjectLikeSequence` that conceptually should return
	   * something like an object return another `ObjectLikeSequence`.
	   *
	   * @public
	   * @constructor
	   *
	   * @examples
	   * var obj = { foo: 'bar' };
	   *
	   * Lazy(obj).assign({ bar: 'baz' })   // instanceof Lazy.ObjectLikeSequence
	   * Lazy(obj).defaults({ bar: 'baz' }) // instanceof Lazy.ObjectLikeSequence
	   * Lazy(obj).invert()                 // instanceof Lazy.ObjectLikeSequence
	   */
	  function ObjectLikeSequence() {}

	  ObjectLikeSequence.prototype = new Sequence();

	  /**
	   * Create a new constructor function for a type inheriting from
	   * `ObjectLikeSequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `ObjectLikeSequence` prototype so that it can be chained with any other
	   *     methods that return object-like sequences.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. **Must** include `each`. *May* include `init` and
	   *     `get` (for looking up an element by key).
	   * @returns {Function} A constructor for a new type inheriting from
	   *     `ObjectLikeSequence`.
	   *
	   * @examples
	   * function downcaseKey(value, key) {
	   *   return [key.toLowerCase(), value];
	   * }
	   *
	   * Lazy.ObjectLikeSequence.define("caseInsensitive", {
	   *   init: function() {
	   *     var downcased = this.parent
	   *       .map(downcaseKey)
	   *       .toObject();
	   *     this.downcased = Lazy(downcased);
	   *   },
	   *
	   *   get: function(key) {
	   *     return this.downcased.get(key.toLowerCase());
	   *   },
	   *
	   *   each: function(fn) {
	   *     return this.downcased.each(fn);
	   *   }
	   * });
	   *
	   * Lazy({ Foo: 'bar' }).caseInsensitive()            // sequence: { foo: 'bar' }
	   * Lazy({ FOO: 'bar' }).caseInsensitive().get('foo') // => 'bar'
	   * Lazy({ FOO: 'bar' }).caseInsensitive().get('FOO') // => 'bar'
	   */
	  ObjectLikeSequence.define = function define(methodName, overrides) {
	    if (!overrides || typeof overrides.each !== 'function') {
	      throw new Error("A custom object-like sequence must implement *at least* each!");
	    }

	    return defineSequenceType(ObjectLikeSequence, methodName, overrides);
	  };

	  ObjectLikeSequence.prototype.value = function value() {
	    return this.toObject();
	  };

	  /**
	   * Gets the element at the specified key in this sequence.
	   *
	   * @public
	   * @param {string} key The key.
	   * @returns {*} The element.
	   *
	   * @examples
	   * Lazy({ foo: "bar" }).get("foo")                          // => "bar"
	   * Lazy({ foo: "bar" }).extend({ foo: "baz" }).get("foo")   // => "baz"
	   * Lazy({ foo: "bar" }).defaults({ bar: "baz" }).get("bar") // => "baz"
	   * Lazy({ foo: "bar" }).invert().get("bar")                 // => "foo"
	   * Lazy({ foo: 1, bar: 2 }).pick(["foo"]).get("foo")        // => 1
	   * Lazy({ foo: 1, bar: 2 }).pick(["foo"]).get("bar")        // => undefined
	   * Lazy({ foo: 1, bar: 2 }).omit(["foo"]).get("bar")        // => 2
	   * Lazy({ foo: 1, bar: 2 }).omit(["foo"]).get("foo")        // => undefined
	   */
	  ObjectLikeSequence.prototype.get = function get(key) {
	    var pair = this.pairs().find(function(pair) {
	      return pair[0] === key;
	    });

	    return pair ? pair[1] : undefined;
	  };

	  /**
	   * Returns a {@link Sequence} whose elements are the keys of this object-like
	   * sequence.
	   *
	   * @public
	   * @returns {Sequence} The sequence based on this sequence's keys.
	   *
	   * @examples
	   * Lazy({ hello: "hola", goodbye: "hasta luego" }).keys() // sequence: ["hello", "goodbye"]
	   */
	  ObjectLikeSequence.prototype.keys = function keys() {
	    return this.map(function(v, k) { return k; });
	  };

	  /**
	   * Returns a {@link Sequence} whose elements are the values of this object-like
	   * sequence.
	   *
	   * @public
	   * @returns {Sequence} The sequence based on this sequence's values.
	   *
	   * @examples
	   * Lazy({ hello: "hola", goodbye: "hasta luego" }).values() // sequence: ["hola", "hasta luego"]
	   */
	  ObjectLikeSequence.prototype.values = function values() {
	    return this.map(function(v, k) { return v; });
	  };

	  /**
	   * Throws an exception. Asynchronous iteration over object-like sequences is
	   * not supported.
	   *
	   * @public
	   * @examples
	   * Lazy({ foo: 'bar' }).async() // throws
	   */
	  ObjectLikeSequence.prototype.async = function async() {
	    throw new Error('An ObjectLikeSequence does not support asynchronous iteration.');
	  };

	  ObjectLikeSequence.prototype.filter = function filter(filterFn) {
	    return new FilteredObjectLikeSequence(this, createCallback(filterFn));
	  };

	  function FilteredObjectLikeSequence(parent, filterFn) {
	    this.parent = parent;
	    this.filterFn = filterFn;
	  }

	  FilteredObjectLikeSequence.prototype = new ObjectLikeSequence();

	  FilteredObjectLikeSequence.prototype.each = function each(fn) {
	    var filterFn = this.filterFn;

	    return this.parent.each(function(v, k) {
	      if (filterFn(v, k)) {
	        return fn(v, k);
	      }
	    });
	  };

	  /**
	   * Returns this same sequence. (Reversing an object-like sequence doesn't make
	   * any sense.)
	   */
	  ObjectLikeSequence.prototype.reverse = function reverse() {
	    return this;
	  };

	  /**
	   * Returns an {@link ObjectLikeSequence} whose elements are the combination of
	   * this sequence and another object. In the case of a key appearing in both this
	   * sequence and the given object, the other object's value will override the
	   * one in this sequence.
	   *
	   * @public
	   * @aka extend
	   * @param {Object} other The other object to assign to this sequence.
	   * @returns {ObjectLikeSequence} A new sequence comprising elements from this
	   *     sequence plus the contents of `other`.
	   *
	   * @examples
	   * Lazy({ "uno": 1, "dos": 2 }).assign({ "tres": 3 }) // sequence: { uno: 1, dos: 2, tres: 3 }
	   * Lazy({ foo: "bar" }).assign({ foo: "baz" });       // sequence: { foo: "baz" }
	   */
	  ObjectLikeSequence.prototype.assign = function assign(other) {
	    return new AssignSequence(this, other);
	  };

	  ObjectLikeSequence.prototype.extend = function extend(other) {
	    return this.assign(other);
	  };

	  /**
	   * @constructor
	   */
	  function AssignSequence(parent, other) {
	    this.parent = parent;
	    this.other  = other;
	  }

	  AssignSequence.prototype = new ObjectLikeSequence();

	  AssignSequence.prototype.get = function get(key) {
	    return this.other[key] || this.parent.get(key);
	  };

	  AssignSequence.prototype.each = function each(fn) {
	    var merged = new Set(),
	        done   = false;

	    Lazy(this.other).each(function(value, key) {
	      if (fn(value, key) === false) {
	        done = true;
	        return false;
	      }

	      merged.add(key);
	    });

	    if (!done) {
	      return this.parent.each(function(value, key) {
	        if (!merged.contains(key) && fn(value, key) === false) {
	          return false;
	        }
	      });
	    }
	  };

	  /**
	   * Returns an {@link ObjectLikeSequence} whose elements are the combination of
	   * this sequence and a 'default' object. In the case of a key appearing in both
	   * this sequence and the given object, this sequence's value will override the
	   * default object's.
	   *
	   * @public
	   * @param {Object} defaults The 'default' object to use for missing keys in this
	   *     sequence.
	   * @returns {ObjectLikeSequence} A new sequence comprising elements from this
	   *     sequence supplemented by the contents of `defaults`.
	   *
	   * @examples
	   * Lazy({ name: "Dan" }).defaults({ name: "User", password: "passw0rd" }) // sequence: { name: "Dan", password: "passw0rd" }
	   */
	  ObjectLikeSequence.prototype.defaults = function defaults(defaults) {
	    return new DefaultsSequence(this, defaults);
	  };

	  /**
	   * @constructor
	   */
	  function DefaultsSequence(parent, defaults) {
	    this.parent   = parent;
	    this.defaults = defaults;
	  }

	  DefaultsSequence.prototype = new ObjectLikeSequence();

	  DefaultsSequence.prototype.get = function get(key) {
	    return this.parent.get(key) || this.defaults[key];
	  };

	  DefaultsSequence.prototype.each = function each(fn) {
	    var merged = new Set(),
	        done   = false;

	    this.parent.each(function(value, key) {
	      if (fn(value, key) === false) {
	        done = true;
	        return false;
	      }

	      if (typeof value !== "undefined") {
	        merged.add(key);
	      }
	    });

	    if (!done) {
	      Lazy(this.defaults).each(function(value, key) {
	        if (!merged.contains(key) && fn(value, key) === false) {
	          return false;
	        }
	      });
	    }
	  };

	  /**
	   * Returns an {@link ObjectLikeSequence} whose values are this sequence's keys,
	   * and whose keys are this sequence's values.
	   *
	   * @public
	   * @returns {ObjectLikeSequence} A new sequence comprising the inverted keys and
	   *     values from this sequence.
	   *
	   * @examples
	   * Lazy({ first: "Dan", last: "Tao" }).invert() // sequence: { Dan: "first", Tao: "last" }
	   */
	  ObjectLikeSequence.prototype.invert = function invert() {
	    return new InvertedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function InvertedSequence(parent) {
	    this.parent = parent;
	  }

	  InvertedSequence.prototype = new ObjectLikeSequence();

	  InvertedSequence.prototype.each = function each(fn) {
	    this.parent.each(function(value, key) {
	      return fn(key, value);
	    });
	  };

	  /**
	   * Produces an {@link ObjectLikeSequence} consisting of all the recursively
	   * merged values from this and the given object(s) or sequence(s).
	   *
	   * Note that by default this method only merges "vanilla" objects (bags of
	   * key/value pairs), not arrays or any other custom object types. To customize
	   * how merging works, you can provide the mergeFn argument, e.g. to handling
	   * merging arrays, strings, or other types of objects.
	   *
	   * @public
	   * @param {...Object|ObjectLikeSequence} others The other object(s) or
	   *     sequence(s) whose values will be merged into this one.
	   * @param {Function=} mergeFn An optional function used to customize merging
	   *     behavior. The function should take two values as parameters and return
	   *     whatever the "merged" form of those values is. If the function returns
	   *     undefined then the new value will simply replace the old one in the
	   *     final result.
	   * @returns {ObjectLikeSequence} The new sequence consisting of merged values.
	   *
	   * @examples
	   * // These examples are completely stolen from Lo-Dash's documentation:
	   * // lodash.com/docs#merge
	   *
	   * var names = {
	   *   'characters': [
	   *     { 'name': 'barney' },
	   *     { 'name': 'fred' }
	   *   ]
	   * };
	   *
	   * var ages = {
	   *   'characters': [
	   *     { 'age': 36 },
	   *     { 'age': 40 }
	   *   ]
	   * };
	   *
	   * var food = {
	   *   'fruits': ['apple'],
	   *   'vegetables': ['beet']
	   * };
	   *
	   * var otherFood = {
	   *   'fruits': ['banana'],
	   *   'vegetables': ['carrot']
	   * };
	   *
	   * function mergeArrays(a, b) {
	   *   return Array.isArray(a) ? a.concat(b) : undefined;
	   * }
	   *
	   * Lazy(names).merge(ages); // => sequence: { 'characters': [{ 'name': 'barney', 'age': 36 }, { 'name': 'fred', 'age': 40 }] }
	   * Lazy(food).merge(otherFood, mergeArrays); // => sequence: { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] }
	   *
	   * // ----- Now for my own tests: -----
	   *
	   * // merges objects
	   * Lazy({ foo: 1 }).merge({ foo: 2 }); // => sequence: { foo: 2 }
	   * Lazy({ foo: 1 }).merge({ bar: 2 }); // => sequence: { foo: 1, bar: 2 }
	   *
	   * // goes deep
	   * Lazy({ foo: { bar: 1 } }).merge({ foo: { bar: 2 } }); // => sequence: { foo: { bar: 2 } }
	   * Lazy({ foo: { bar: 1 } }).merge({ foo: { baz: 2 } }); // => sequence: { foo: { bar: 1, baz: 2 } }
	   * Lazy({ foo: { bar: 1 } }).merge({ foo: { baz: 2 } }); // => sequence: { foo: { bar: 1, baz: 2 } }
	   *
	   * // gives precedence to later sources
	   * Lazy({ foo: 1 }).merge({ bar: 2 }, { bar: 3 }); // => sequence: { foo: 1, bar: 3 }
	   *
	   * // undefined gets passed over
	   * Lazy({ foo: 1 }).merge({ foo: undefined }); // => sequence: { foo: 1 }
	   *
	   * // null doesn't get passed over
	   * Lazy({ foo: 1 }).merge({ foo: null }); // => sequence: { foo: null }
	   *
	   * // array contents get merged as well
	   * Lazy({ foo: [{ bar: 1 }] }).merge({ foo: [{ baz: 2 }] }); // => sequence: { foo: [{ bar: 1, baz: 2}] }
	   */
	  ObjectLikeSequence.prototype.merge = function merge(var_args) {
	    var mergeFn = arguments.length > 1 && typeof arguments[arguments.length - 1] === "function" ?
	      arrayPop.call(arguments) : null;
	    return new MergedSequence(this, arraySlice.call(arguments, 0), mergeFn);
	  };

	  /**
	   * @constructor
	   */
	  function MergedSequence(parent, others, mergeFn) {
	    this.parent  = parent;
	    this.others  = others;
	    this.mergeFn = mergeFn;
	  }

	  MergedSequence.prototype = new ObjectLikeSequence();

	  MergedSequence.prototype.each = function each(fn) {
	    var others  = this.others,
	        mergeFn = this.mergeFn || mergeObjects,
	        keys    = {};

	    var iteratedFullSource = this.parent.each(function(value, key) {
	      var merged = value;

	      forEach(others, function(other) {
	        if (key in other) {
	          merged = mergeFn(merged, other[key]);
	        }
	      });

	      keys[key] = true;

	      return fn(merged, key);
	    });

	    if (iteratedFullSource === false) {
	      return false;
	    }

	    var remaining = {};

	    forEach(others, function(other) {
	      for (var k in other) {
	        if (!keys[k]) {
	          remaining[k] = mergeFn(remaining[k], other[k]);
	        }
	      }
	    });

	    return Lazy(remaining).each(fn);
	  };

	  /**
	   * @private
	   * @examples
	   * mergeObjects({ foo: 1 }, { bar: 2 }); // => { foo: 1, bar: 2 }
	   * mergeObjects({ foo: { bar: 1 } }, { foo: { baz: 2 } }); // => { foo: { bar: 1, baz: 2 } }
	   * mergeObjects({ foo: { bar: 1 } }, { foo: undefined }); // => { foo: { bar: 1 } }
	   * mergeObjects({ foo: { bar: 1 } }, { foo: null }); // => { foo: null }
	   * mergeObjects({ array: [0, 1, 2] }, { array: [3, 4, 5] }).array; // instanceof Array
	   * mergeObjects({ date: new Date() }, { date: new Date() }).date; // instanceof Date
	   * mergeObjects([{ foo: 1 }], [{ bar: 2 }]); // => [{ foo: 1, bar: 2 }]
	   */
	  function mergeObjects(a, b) {
	    var merged, prop;

	    if (typeof b === 'undefined') {
	      return a;
	    }

	    // Check that we're dealing with two objects or two arrays.
	    if (isVanillaObject(a) && isVanillaObject(b)) {
	      merged = {};
	    } else if (a instanceof Array && b instanceof Array) {
	      merged = [];
	    } else {
	      // Otherwise there's no merging to do -- just replace a w/ b.
	      return b;
	    }

	    for (prop in a) {
	      merged[prop] = mergeObjects(a[prop], b[prop]);
	    }
	    for (prop in b) {
	      if (!merged[prop]) {
	        merged[prop] = b[prop];
	      }
	    }
	    return merged;
	  }

	  /**
	   * Checks whether an object is a "vanilla" object, i.e. {'foo': 'bar'} as
	   * opposed to an array, date, etc.
	   *
	   * @private
	   * @examples
	   * isVanillaObject({foo: 'bar'}); // => true
	   * isVanillaObject(new Date());   // => false
	   * isVanillaObject([1, 2, 3]);    // => false
	   */
	  function isVanillaObject(object) {
	    return object && object.constructor === Object;
	  }

	  /**
	   * Creates a {@link Sequence} consisting of the keys from this sequence whose
	   *     values are functions.
	   *
	   * @public
	   * @aka methods
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var dog = {
	   *   name: "Fido",
	   *   breed: "Golden Retriever",
	   *   bark: function() { console.log("Woof!"); },
	   *   wagTail: function() { console.log("TODO: implement robotic dog interface"); }
	   * };
	   *
	   * Lazy(dog).functions() // sequence: ["bark", "wagTail"]
	   */
	  ObjectLikeSequence.prototype.functions = function functions() {
	    return this
	      .filter(function(v, k) { return typeof(v) === "function"; })
	      .map(function(v, k) { return k; });
	  };

	  ObjectLikeSequence.prototype.methods = function methods() {
	    return this.functions();
	  };

	  /**
	   * Creates an {@link ObjectLikeSequence} consisting of the key/value pairs from
	   * this sequence whose keys are included in the given array of property names.
	   *
	   * @public
	   * @param {Array} properties An array of the properties to "pick" from this
	   *     sequence.
	   * @returns {ObjectLikeSequence} The new sequence.
	   *
	   * @examples
	   * var players = {
	   *   "who": "first",
	   *   "what": "second",
	   *   "i don't know": "third"
	   * };
	   *
	   * Lazy(players).pick(["who", "what"]) // sequence: { who: "first", what: "second" }
	   */
	  ObjectLikeSequence.prototype.pick = function pick(properties) {
	    return new PickSequence(this, properties);
	  };

	  /**
	   * @constructor
	   */
	  function PickSequence(parent, properties) {
	    this.parent     = parent;
	    this.properties = properties;
	  }

	  PickSequence.prototype = new ObjectLikeSequence();

	  PickSequence.prototype.get = function get(key) {
	    return arrayContains(this.properties, key) ? this.parent.get(key) : undefined;
	  };

	  PickSequence.prototype.each = function each(fn) {
	    var inArray    = arrayContains,
	        properties = this.properties;

	    return this.parent.each(function(value, key) {
	      if (inArray(properties, key)) {
	        return fn(value, key);
	      }
	    });
	  };

	  /**
	   * Creates an {@link ObjectLikeSequence} consisting of the key/value pairs from
	   * this sequence excluding those with the specified keys.
	   *
	   * @public
	   * @param {Array} properties An array of the properties to *omit* from this
	   *     sequence.
	   * @returns {ObjectLikeSequence} The new sequence.
	   *
	   * @examples
	   * var players = {
	   *   "who": "first",
	   *   "what": "second",
	   *   "i don't know": "third"
	   * };
	   *
	   * Lazy(players).omit(["who", "what"]) // sequence: { "i don't know": "third" }
	   */
	  ObjectLikeSequence.prototype.omit = function omit(properties) {
	    return new OmitSequence(this, properties);
	  };

	  /**
	   * @constructor
	   */
	  function OmitSequence(parent, properties) {
	    this.parent     = parent;
	    this.properties = properties;
	  }

	  OmitSequence.prototype = new ObjectLikeSequence();

	  OmitSequence.prototype.get = function get(key) {
	    return arrayContains(this.properties, key) ? undefined : this.parent.get(key);
	  };

	  OmitSequence.prototype.each = function each(fn) {
	    var inArray    = arrayContains,
	        properties = this.properties;

	    return this.parent.each(function(value, key) {
	      if (!inArray(properties, key)) {
	        return fn(value, key);
	      }
	    });
	  };

	  /**
	   * Maps the key/value pairs in this sequence to arrays.
	   *
	   * @public
	   * @aka toArray
	   * @returns {Sequence} An sequence of `[key, value]` pairs.
	   *
	   * @examples
	   * var colorCodes = {
	   *   red: "#f00",
	   *   green: "#0f0",
	   *   blue: "#00f"
	   * };
	   *
	   * Lazy(colorCodes).pairs() // sequence: [["red", "#f00"], ["green", "#0f0"], ["blue", "#00f"]]
	   */
	  ObjectLikeSequence.prototype.pairs = function pairs() {
	    return this.map(function(v, k) { return [k, v]; });
	  };

	  /**
	   * Creates an array from the key/value pairs in this sequence.
	   *
	   * @public
	   * @returns {Array} An array of `[key, value]` elements.
	   *
	   * @examples
	   * var colorCodes = {
	   *   red: "#f00",
	   *   green: "#0f0",
	   *   blue: "#00f"
	   * };
	   *
	   * Lazy(colorCodes).toArray() // => [["red", "#f00"], ["green", "#0f0"], ["blue", "#00f"]]
	   */
	  ObjectLikeSequence.prototype.toArray = function toArray() {
	    return this.pairs().toArray();
	  };

	  /**
	   * Creates an object with the key/value pairs from this sequence.
	   *
	   * @public
	   * @returns {Object} An object with the same key/value pairs as this sequence.
	   *
	   * @examples
	   * var colorCodes = {
	   *   red: "#f00",
	   *   green: "#0f0",
	   *   blue: "#00f"
	   * };
	   *
	   * Lazy(colorCodes).toObject() // => { red: "#f00", green: "#0f0", blue: "#00f" }
	   */
	  ObjectLikeSequence.prototype.toObject = function toObject() {
	    return this.reduce(function(object, value, key) {
	      object[key] = value;
	      return object;
	    }, {});
	  };

	  // Now that we've fully initialized the ObjectLikeSequence prototype, we can
	  // actually set the prototypes for GroupedSequence, IndexedSequence, and
	  // CountedSequence.

	  GroupedSequence.prototype = new ObjectLikeSequence();

	  GroupedSequence.prototype.each = function each(fn) {
	    var keyFn   = createCallback(this.keyFn),
	        valFn   = createCallback(this.valFn),
	        result;

	    result = this.parent.reduce(function(grouped,e) {
	      var key = keyFn(e),
	          val = valFn(e);
	      if (!(grouped[key] instanceof Array)) {
	        grouped[key] = [val];
	      } else {
	        grouped[key].push(val);
	      }
	      return grouped;
	    },{});

	    return transform(function(grouped) {
	      for (var key in grouped) {
	        if (fn(grouped[key], key) === false) {
	          return false;
	        }
	      }
	    }, result);
	  };

	  IndexedSequence.prototype = new ObjectLikeSequence();

	  IndexedSequence.prototype.each = function each(fn) {
	    var keyFn   = createCallback(this.keyFn),
	        valFn   = createCallback(this.valFn),
	        indexed = {};

	    return this.parent.each(function(e) {
	      var key = keyFn(e),
	          val = valFn(e);

	      if (!indexed[key]) {
	        indexed[key] = val;
	        return fn(val, key);
	      }
	    });
	  };

	  CountedSequence.prototype = new ObjectLikeSequence();

	  CountedSequence.prototype.each = function each(fn) {
	    var keyFn   = createCallback(this.keyFn),
	        counted = {};

	    this.parent.each(function(e) {
	      var key = keyFn(e);
	      if (!counted[key]) {
	        counted[key] = 1;
	      } else {
	        counted[key] += 1;
	      }
	    });

	    for (var key in counted) {
	      if (fn(counted[key], key) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * Watches for all changes to a specified property (or properties) of an
	   * object and produces a sequence whose elements have the properties
	   * `{ property, value }` indicating which property changed and what it was
	   * changed to.
	   *
	   * Note that this method **only works on directly wrapped objects**; it will
	   * *not* work on any arbitrary {@link ObjectLikeSequence}.
	   *
	   * @public
	   * @param {(string|Array)=} propertyNames A property name or array of property
	   *     names to watch. If this parameter is `undefined`, all of the object's
	   *     current (enumerable) properties will be watched.
	   * @returns {Sequence} A sequence comprising `{ property, value }` objects
	   *     describing each change to the specified property/properties.
	   *
	   * @examples
	   * var obj = {},
	   *     changes = [];
	   *
	   * Lazy(obj).watch('foo').each(function(change) {
	   *   changes.push(change);
	   * });
	   *
	   * obj.foo = 1;
	   * obj.bar = 2;
	   * obj.foo = 3;
	   *
	   * obj.foo; // => 3
	   * changes; // => [{ property: 'foo', value: 1 }, { property: 'foo', value: 3 }]
	   */
	  ObjectLikeSequence.prototype.watch = function watch(propertyNames) {
	    throw new Error('You can only call #watch on a directly wrapped object.');
	  };

	  /**
	   * @constructor
	   */
	  function ObjectWrapper(source) {
	    this.source = source;
	  }

	  ObjectWrapper.prototype = new ObjectLikeSequence();

	  ObjectWrapper.prototype.root = function root() {
	    return this;
	  };

	  ObjectWrapper.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  ObjectWrapper.prototype.get = function get(key) {
	    return this.source[key];
	  };

	  ObjectWrapper.prototype.each = function each(fn) {
	    var source = this.source,
	        key;

	    for (key in source) {
	      if (fn(source[key], key) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * A `StringLikeSequence` represents a sequence of characters.
	   *
	   * The initial sequence you get by wrapping a string with `Lazy(string)` is a
	   * `StringLikeSequence`.
	   *
	   * All methods of `StringLikeSequence` that conceptually should return
	   * something like a string return another `StringLikeSequence`.
	   *
	   * @public
	   * @constructor
	   *
	   * @examples
	   * function upcase(str) { return str.toUpperCase(); }
	   *
	   * Lazy('foo')               // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').toUpperCase() // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').reverse()     // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').take(2)       // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').drop(1)       // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').substring(1)  // instanceof Lazy.StringLikeSequence
	   *
	   * // Note that `map` does not create a `StringLikeSequence` because there's
	   * // no guarantee the mapping function will return characters. In the event
	   * // you do want to map a string onto a string-like sequence, use
	   * // `mapString`:
	   * Lazy('foo').map(Lazy.identity)       // instanceof Lazy.ArrayLikeSequence
	   * Lazy('foo').mapString(Lazy.identity) // instanceof Lazy.StringLikeSequence
	   */
	  function StringLikeSequence() {}

	  StringLikeSequence.prototype = new ArrayLikeSequence();

	  /**
	   * Create a new constructor function for a type inheriting from
	   * `StringLikeSequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `StringLikeSequence` prototype so that it can be chained with any other
	   *     methods that return string-like sequences.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. Has the same requirements as
	   *     {@link ArrayLikeSequence.define}.
	   * @returns {Function} A constructor for a new type inheriting from
	   *     `StringLikeSequence`.
	   *
	   * @examples
	   * Lazy.StringLikeSequence.define("zomg", {
	   *   length: function() {
	   *     return this.parent.length() + "!!ZOMG!!!1".length;
	   *   },
	   *
	   *   get: function(i) {
	   *     if (i < this.parent.length()) {
	   *       return this.parent.get(i);
	   *     }
	   *     return "!!ZOMG!!!1".charAt(i - this.parent.length());
	   *   }
	   * });
	   *
	   * Lazy('foo').zomg() // sequence: "foo!!ZOMG!!!1"
	   */
	  StringLikeSequence.define = function define(methodName, overrides) {
	    if (!overrides || typeof overrides.get !== 'function') {
	      throw new Error("A custom string-like sequence must implement *at least* get!");
	    }

	    return defineSequenceType(StringLikeSequence, methodName, overrides);
	  };

	  StringLikeSequence.prototype.value = function value() {
	    return this.toString();
	  };

	  /**
	   * Returns an {@link IndexedIterator} that will step over each character in this
	   * sequence one by one.
	   *
	   * @returns {IndexedIterator} The iterator.
	   */
	  StringLikeSequence.prototype.getIterator = function getIterator() {
	    return new CharIterator(this);
	  };

	  /**
	   * @constructor
	   */
	  function CharIterator(source) {
	    this.source = Lazy(source);
	    this.index = -1;
	  }

	  CharIterator.prototype.current = function current() {
	    return this.source.charAt(this.index);
	  };

	  CharIterator.prototype.moveNext = function moveNext() {
	    return (++this.index < this.source.length());
	  };

	  /**
	   * Returns the character at the given index of this sequence, or the empty
	   * string if the specified index lies outside the bounds of the sequence.
	   *
	   * @public
	   * @param {number} i The index of this sequence.
	   * @returns {string} The character at the specified index.
	   *
	   * @examples
	   * Lazy("foo").charAt(0)  // => "f"
	   * Lazy("foo").charAt(-1) // => ""
	   * Lazy("foo").charAt(10) // => ""
	   */
	  StringLikeSequence.prototype.charAt = function charAt(i) {
	    return this.get(i);
	  };

	  /**
	   * Returns the character code at the given index of this sequence, or `NaN` if
	   * the index lies outside the bounds of the sequence.
	   *
	   * @public
	   * @param {number} i The index of the character whose character code you want.
	   * @returns {number} The character code.
	   *
	   * @examples
	   * Lazy("abc").charCodeAt(0)  // => 97
	   * Lazy("abc").charCodeAt(-1) // => NaN
	   * Lazy("abc").charCodeAt(10) // => NaN
	   */
	  StringLikeSequence.prototype.charCodeAt = function charCodeAt(i) {
	    var char = this.charAt(i);
	    if (!char) { return NaN; }

	    return char.charCodeAt(0);
	  };

	  /**
	   * Returns a {@link StringLikeSequence} comprising the characters from *this*
	   * sequence starting at `start` and ending at `stop` (exclusive), or---if
	   * `stop` is `undefined`, including the rest of the sequence.
	   *
	   * @public
	   * @param {number} start The index where this sequence should begin.
	   * @param {number=} stop The index (exclusive) where this sequence should end.
	   * @returns {StringLikeSequence} The new sequence.
	   *
	   * @examples
	   * Lazy("foo").substring(1)      // sequence: "oo"
	   * Lazy("foo").substring(-1)     // sequence: "foo"
	   * Lazy("hello").substring(1, 3) // sequence: "el"
	   * Lazy("hello").substring(1, 9) // sequence: "ello"
	   */
	  StringLikeSequence.prototype.substring = function substring(start, stop) {
	    return new StringSegment(this, start, stop);
	  };

	  /**
	   * @constructor
	   */
	  function StringSegment(parent, start, stop) {
	    this.parent = parent;
	    this.start  = Math.max(0, start);
	    this.stop   = stop;
	  }

	  StringSegment.prototype = new StringLikeSequence();

	  StringSegment.prototype.get = function get(i) {
	    return this.parent.get(i + this.start);
	  };

	  StringSegment.prototype.length = function length() {
	    return (typeof this.stop === "number" ? this.stop : this.parent.length()) - this.start;
	  };

	  /**
	   * An optimized version of {@link Sequence#first} that returns another
	   * {@link StringLikeSequence} (or just the first character, if `count` is
	   * undefined).
	   *
	   * @public
	   * @examples
	   * Lazy('foo').first()                // => 'f'
	   * Lazy('fo').first(2)                // sequence: 'fo'
	   * Lazy('foo').first(10)              // sequence: 'foo'
	   * Lazy('foo').toUpperCase().first()  // => 'F'
	   * Lazy('foo').toUpperCase().first(2) // sequence: 'FO'
	   */
	  StringLikeSequence.prototype.first = function first(count) {
	    if (typeof count === "undefined") {
	      return this.charAt(0);
	    }

	    return this.substring(0, count);
	  };

	  /**
	   * An optimized version of {@link Sequence#last} that returns another
	   * {@link StringLikeSequence} (or just the last character, if `count` is
	   * undefined).
	   *
	   * @public
	   * @examples
	   * Lazy('foo').last()                // => 'o'
	   * Lazy('foo').last(2)               // sequence: 'oo'
	   * Lazy('foo').last(10)              // sequence: 'foo'
	   * Lazy('foo').toUpperCase().last()  // => 'O'
	   * Lazy('foo').toUpperCase().last(2) // sequence: 'OO'
	   */
	  StringLikeSequence.prototype.last = function last(count) {
	    if (typeof count === "undefined") {
	      return this.charAt(this.length() - 1);
	    }

	    return this.substring(this.length() - count);
	  };

	  StringLikeSequence.prototype.drop = function drop(count) {
	    return this.substring(count);
	  };

	  /**
	   * Finds the index of the first occurrence of the given substring within this
	   * sequence, starting from the specified index (or the beginning of the
	   * sequence).
	   *
	   * @public
	   * @param {string} substring The substring to search for.
	   * @param {number=} startIndex The index from which to start the search.
	   * @returns {number} The first index where the given substring is found, or
	   *     -1 if it isn't in the sequence.
	   *
	   * @examples
	   * Lazy('canal').indexOf('a')    // => 1
	   * Lazy('canal').indexOf('a', 2) // => 3
	   * Lazy('canal').indexOf('ana')  // => 1
	   * Lazy('canal').indexOf('andy') // => -1
	   * Lazy('canal').indexOf('x')    // => -1
	   */
	  StringLikeSequence.prototype.indexOf = function indexOf(substring, startIndex) {
	    return this.toString().indexOf(substring, startIndex);
	  };

	  /**
	   * Finds the index of the last occurrence of the given substring within this
	   * sequence, starting from the specified index (or the end of the sequence)
	   * and working backwards.
	   *
	   * @public
	   * @param {string} substring The substring to search for.
	   * @param {number=} startIndex The index from which to start the search.
	   * @returns {number} The last index where the given substring is found, or
	   *     -1 if it isn't in the sequence.
	   *
	   * @examples
	   * Lazy('canal').lastIndexOf('a')    // => 3
	   * Lazy('canal').lastIndexOf('a', 2) // => 1
	   * Lazy('canal').lastIndexOf('ana')  // => 1
	   * Lazy('canal').lastIndexOf('andy') // => -1
	   * Lazy('canal').lastIndexOf('x')    // => -1
	   */
	  StringLikeSequence.prototype.lastIndexOf = function lastIndexOf(substring, startIndex) {
	    return this.toString().lastIndexOf(substring, startIndex);
	  };

	  /**
	   * Checks if this sequence contains a given substring.
	   *
	   * @public
	   * @param {string} substring The substring to check for.
	   * @returns {boolean} Whether or not this sequence contains `substring`.
	   *
	   * @examples
	   * Lazy('hello').contains('ell') // => true
	   * Lazy('hello').contains('')    // => true
	   * Lazy('hello').contains('abc') // => false
	   */
	  StringLikeSequence.prototype.contains = function contains(substring) {
	    return this.indexOf(substring) !== -1;
	  };

	  /**
	   * Checks if this sequence ends with a given suffix.
	   *
	   * @public
	   * @param {string} suffix The suffix to check for.
	   * @returns {boolean} Whether or not this sequence ends with `suffix`.
	   *
	   * @examples
	   * Lazy('foo').endsWith('oo')  // => true
	   * Lazy('foo').endsWith('')    // => true
	   * Lazy('foo').endsWith('abc') // => false
	   */
	  StringLikeSequence.prototype.endsWith = function endsWith(suffix) {
	    return this.substring(this.length() - suffix.length).toString() === suffix;
	  };

	  /**
	   * Checks if this sequence starts with a given prefix.
	   *
	   * @public
	   * @param {string} prefix The prefix to check for.
	   * @returns {boolean} Whether or not this sequence starts with `prefix`.
	   *
	   * @examples
	   * Lazy('foo').startsWith('fo')  // => true
	   * Lazy('foo').startsWith('')    // => true
	   * Lazy('foo').startsWith('abc') // => false
	   */
	  StringLikeSequence.prototype.startsWith = function startsWith(prefix) {
	    return this.substring(0, prefix.length).toString() === prefix;
	  };

	  /**
	   * Converts all of the characters in this string to uppercase.
	   *
	   * @public
	   * @returns {StringLikeSequence} A new sequence with the same characters as
	   *     this sequence, all uppercase.
	   *
	   * @examples
	   * function nextLetter(a) {
	   *   return String.fromCharCode(a.charCodeAt(0) + 1);
	   * }
	   *
	   * Lazy('foo').toUpperCase()                       // sequence: 'FOO'
	   * Lazy('foo').substring(1).toUpperCase()          // sequence: 'OO'
	   * Lazy('abc').mapString(nextLetter).toUpperCase() // sequence: 'BCD'
	   */
	  StringLikeSequence.prototype.toUpperCase = function toUpperCase() {
	    return this.mapString(function(char) { return char.toUpperCase(); });
	  };

	  /**
	   * Converts all of the characters in this string to lowercase.
	   *
	   * @public
	   * @returns {StringLikeSequence} A new sequence with the same characters as
	   *     this sequence, all lowercase.
	   *
	   * @examples
	   * function nextLetter(a) {
	   *   return String.fromCharCode(a.charCodeAt(0) + 1);
	   * }
	   *
	   * Lazy('FOO').toLowerCase()                       // sequence: 'foo'
	   * Lazy('FOO').substring(1).toLowerCase()          // sequence: 'oo'
	   * Lazy('ABC').mapString(nextLetter).toLowerCase() // sequence: 'bcd'
	   */
	  StringLikeSequence.prototype.toLowerCase = function toLowerCase() {
	    return this.mapString(function(char) { return char.toLowerCase(); });
	  };

	  /**
	   * Maps the characters of this sequence onto a new {@link StringLikeSequence}.
	   *
	   * @public
	   * @param {Function} mapFn The function used to map characters from this
	   *     sequence onto the new sequence.
	   * @returns {StringLikeSequence} The new sequence.
	   *
	   * @examples
	   * function upcase(char) { return char.toUpperCase(); }
	   *
	   * Lazy("foo").mapString(upcase)               // sequence: "FOO"
	   * Lazy("foo").mapString(upcase).charAt(0)     // => "F"
	   * Lazy("foo").mapString(upcase).charCodeAt(0) // => 70
	   * Lazy("foo").mapString(upcase).substring(1)  // sequence: "OO"
	   */
	  StringLikeSequence.prototype.mapString = function mapString(mapFn) {
	    return new MappedStringLikeSequence(this, mapFn);
	  };

	  /**
	   * @constructor
	   */
	  function MappedStringLikeSequence(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  MappedStringLikeSequence.prototype = new StringLikeSequence();
	  MappedStringLikeSequence.prototype.get = IndexedMappedSequence.prototype.get;
	  MappedStringLikeSequence.prototype.length = IndexedMappedSequence.prototype.length;

	  /**
	   * Returns a copy of this sequence that reads back to front.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy("abcdefg").reverse() // sequence: "gfedcba"
	   */
	  StringLikeSequence.prototype.reverse = function reverse() {
	    return new ReversedStringLikeSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function ReversedStringLikeSequence(parent) {
	    this.parent = parent;
	  }

	  ReversedStringLikeSequence.prototype = new StringLikeSequence();
	  ReversedStringLikeSequence.prototype.get = IndexedReversedSequence.prototype.get;
	  ReversedStringLikeSequence.prototype.length = IndexedReversedSequence.prototype.length;

	  StringLikeSequence.prototype.toString = function toString() {
	    return this.join("");
	  };

	  /**
	   * Creates a {@link Sequence} comprising all of the matches for the specified
	   * pattern in the underlying string.
	   *
	   * @public
	   * @param {RegExp} pattern The pattern to match.
	   * @returns {Sequence} A sequence of all the matches.
	   *
	   * @examples
	   * Lazy("abracadabra").match(/a[bcd]/) // sequence: ["ab", "ac", "ad", "ab"]
	   * Lazy("fee fi fo fum").match(/\w+/)  // sequence: ["fee", "fi", "fo", "fum"]
	   * Lazy("hello").match(/xyz/)          // sequence: []
	   */
	  StringLikeSequence.prototype.match = function match(pattern) {
	    return new StringMatchSequence(this, pattern);
	  };

	  /**
	   * @constructor
	   */
	  function StringMatchSequence(parent, pattern) {
	    this.parent = parent;
	    this.pattern = pattern;
	  }

	  StringMatchSequence.prototype = new Sequence();

	  StringMatchSequence.prototype.getIterator = function getIterator() {
	    return new StringMatchIterator(this.parent.toString(), this.pattern);
	  };

	  /**
	   * @constructor
	   */
	  function StringMatchIterator(source, pattern) {
	    this.source  = source;
	    this.pattern = cloneRegex(pattern);
	  }

	  StringMatchIterator.prototype.current = function current() {
	    return this.match[0];
	  };

	  StringMatchIterator.prototype.moveNext = function moveNext() {
	    return !!(this.match = this.pattern.exec(this.source));
	  };

	  /**
	   * Creates a {@link Sequence} comprising all of the substrings of this string
	   * separated by the given delimiter, which can be either a string or a regular
	   * expression.
	   *
	   * @public
	   * @param {string|RegExp} delimiter The delimiter to use for recognizing
	   *     substrings.
	   * @returns {Sequence} A sequence of all the substrings separated by the given
	   *     delimiter.
	   *
	   * @examples
	   * Lazy("foo").split("")                      // sequence: ["f", "o", "o"]
	   * Lazy("yo dawg").split(" ")                 // sequence: ["yo", "dawg"]
	   * Lazy("bah bah\tblack  sheep").split(/\s+/) // sequence: ["bah", "bah", "black", "sheep"]
	   */
	  StringLikeSequence.prototype.split = function split(delimiter) {
	    return new SplitStringSequence(this, delimiter);
	  };

	  /**
	   * @constructor
	   */
	  function SplitStringSequence(parent, pattern) {
	    this.parent = parent;
	    this.pattern = pattern;
	  }

	  SplitStringSequence.prototype = new Sequence();

	  SplitStringSequence.prototype.getIterator = function getIterator() {
	    var source = this.parent.toString();

	    if (this.pattern instanceof RegExp) {
	      if (this.pattern.source === "" || this.pattern.source === "(?:)") {
	        return new CharIterator(source);
	      } else {
	        return new SplitWithRegExpIterator(source, this.pattern);
	      }
	    } else if (this.pattern === "") {
	      return new CharIterator(source);
	    } else {
	      return new SplitWithStringIterator(source, this.pattern);
	    }
	  };

	  /**
	   * @constructor
	   */
	  function SplitWithRegExpIterator(source, pattern) {
	    this.source  = source;
	    this.pattern = cloneRegex(pattern);
	  }

	  SplitWithRegExpIterator.prototype.current = function current() {
	    return this.source.substring(this.start, this.end);
	  };

	  SplitWithRegExpIterator.prototype.moveNext = function moveNext() {
	    if (!this.pattern) {
	      return false;
	    }

	    var match = this.pattern.exec(this.source);

	    if (match) {
	      this.start = this.nextStart ? this.nextStart : 0;
	      this.end = match.index;
	      this.nextStart = match.index + match[0].length;
	      return true;

	    } else if (this.pattern) {
	      this.start = this.nextStart;
	      this.end = undefined;
	      this.nextStart = undefined;
	      this.pattern = undefined;
	      return true;
	    }

	    return false;
	  };

	  /**
	   * @constructor
	   */
	  function SplitWithStringIterator(source, delimiter) {
	    this.source = source;
	    this.delimiter = delimiter;
	  }

	  SplitWithStringIterator.prototype.current = function current() {
	    return this.source.substring(this.leftIndex, this.rightIndex);
	  };

	  SplitWithStringIterator.prototype.moveNext = function moveNext() {
	    if (!this.finished) {
	      this.leftIndex = typeof this.leftIndex !== "undefined" ?
	        this.rightIndex + this.delimiter.length :
	        0;
	      this.rightIndex = this.source.indexOf(this.delimiter, this.leftIndex);
	    }

	    if (this.rightIndex === -1) {
	      this.finished = true;
	      this.rightIndex = undefined;
	      return true;
	    }

	    return !this.finished;
	  };

	  /**
	   * Wraps a string exposing {@link #match} and {@link #split} methods that return
	   * {@link Sequence} objects instead of arrays, improving on the efficiency of
	   * JavaScript's built-in `String#split` and `String.match` methods and
	   * supporting asynchronous iteration.
	   *
	   * @param {string} source The string to wrap.
	   * @constructor
	   */
	  function StringWrapper(source) {
	    this.source = source;
	  }

	  StringWrapper.prototype = new StringLikeSequence();

	  StringWrapper.prototype.root = function root() {
	    return this;
	  };

	  StringWrapper.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  StringWrapper.prototype.get = function get(i) {
	    return this.source.charAt(i);
	  };

	  StringWrapper.prototype.length = function length() {
	    return this.source.length;
	  };

	  StringWrapper.prototype.toString = function toString() {
	    return this.source;
	  };

	  /**
	   * A `GeneratedSequence` does not wrap an in-memory colllection but rather
	   * determines its elements on-the-fly during iteration according to a generator
	   * function.
	   *
	   * You create a `GeneratedSequence` by calling {@link Lazy.generate}.
	   *
	   * @public
	   * @constructor
	   * @param {function(number):*} generatorFn A function which accepts an index
	   *     and returns a value for the element at that position in the sequence.
	   * @param {number=} length The length of the sequence. If this argument is
	   *     omitted, the sequence will go on forever.
	   */
	  function GeneratedSequence(generatorFn, length) {
	    this.get = generatorFn;
	    this.fixedLength = length;
	  }

	  GeneratedSequence.prototype = new Sequence();

	  GeneratedSequence.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  /**
	   * Returns the length of this sequence.
	   *
	   * @public
	   * @returns {number} The length, or `undefined` if this is an indefinite
	   *     sequence.
	   */
	  GeneratedSequence.prototype.length = function length() {
	    return this.fixedLength;
	  };

	  /**
	   * Iterates over the sequence produced by invoking this sequence's generator
	   * function up to its specified length, or, if length is `undefined`,
	   * indefinitely (in which case the sequence will go on forever--you would need
	   * to call, e.g., {@link Sequence#take} to limit iteration).
	   *
	   * @public
	   * @param {Function} fn The function to call on each output from the generator
	   *     function.
	   */
	  GeneratedSequence.prototype.each = function each(fn) {
	    var generatorFn = this.get,
	        length = this.fixedLength,
	        i = 0;

	    while (typeof length === "undefined" || i < length) {
	      if (fn(generatorFn(i), i++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  GeneratedSequence.prototype.getIterator = function getIterator() {
	    return new GeneratedIterator(this);
	  };

	  /**
	   * Iterates over a generated sequence. (This allows generated sequences to be
	   * iterated asynchronously.)
	   *
	   * @param {GeneratedSequence} sequence The generated sequence to iterate over.
	   * @constructor
	   */
	  function GeneratedIterator(sequence) {
	    this.sequence     = sequence;
	    this.index        = 0;
	    this.currentValue = null;
	  }

	  GeneratedIterator.prototype.current = function current() {
	    return this.currentValue;
	  };

	  GeneratedIterator.prototype.moveNext = function moveNext() {
	    var sequence = this.sequence;

	    if (typeof sequence.fixedLength === "number" && this.index >= sequence.fixedLength) {
	      return false;
	    }

	    this.currentValue = sequence.get(this.index++);
	    return true;
	  };

	  /**
	   * An `AsyncSequence` iterates over its elements asynchronously when
	   * {@link #each} is called.
	   *
	   * You get an `AsyncSequence` by calling {@link Sequence#async} on any
	   * sequence. Note that some sequence types may not support asynchronous
	   * iteration.
	   *
	   * Returning values
	   * ----------------
	   *
	   * Because of its asynchronous nature, an `AsyncSequence` cannot be used in the
	   * same way as other sequences for functions that return values directly (e.g.,
	   * `reduce`, `max`, `any`, even `toArray`).
	   *
	   * Instead, these methods return an `AsyncHandle` whose `onComplete` method
	   * accepts a callback that will be called with the final result once iteration
	   * has finished.
	   *
	   * Defining custom asynchronous sequences
	   * --------------------------------------
	   *
	   * There are plenty of ways to define an asynchronous sequence. Here's one.
	   *
	   * 1. First, implement an {@link Iterator}. This is an object whose prototype
	   *    has the methods {@link Iterator#moveNext} (which returns a `boolean`) and
	   *    {@link current} (which returns the current value).
	   * 2. Next, create a simple wrapper that inherits from `AsyncSequence`, whose
	   *    `getIterator` function returns an instance of the iterator type you just
	   *    defined.
	   *
	   * The default implementation for {@link #each} on an `AsyncSequence` is to
	   * create an iterator and then asynchronously call {@link Iterator#moveNext}
	   * (using `setImmediate`, if available, otherwise `setTimeout`) until the iterator
	   * can't move ahead any more.
	   *
	   * @public
	   * @constructor
	   * @param {Sequence} parent A {@link Sequence} to wrap, to expose asynchronous
	   *     iteration.
	   * @param {number=} interval How many milliseconds should elapse between each
	   *     element when iterating over this sequence. If this argument is omitted,
	   *     asynchronous iteration will be executed as fast as possible.
	   */
	  function AsyncSequence(parent, interval) {
	    if (parent instanceof AsyncSequence) {
	      throw new Error("Sequence is already asynchronous!");
	    }

	    this.parent         = parent;
	    this.interval       = interval;
	    this.onNextCallback = getOnNextCallback(interval);
	    this.cancelCallback = getCancelCallback(interval);
	  }

	  AsyncSequence.prototype = new Sequence();

	  AsyncSequence.prototype.isAsync = function isAsync() {
	    return true;
	  };

	  /**
	   * Throws an exception. You cannot manually iterate over an asynchronous
	   * sequence.
	   *
	   * @public
	   * @example
	   * Lazy([1, 2, 3]).async().getIterator() // throws
	   */
	  AsyncSequence.prototype.getIterator = function getIterator() {
	    throw new Error('An AsyncSequence does not support synchronous iteration.');
	  };

	  /**
	   * An asynchronous version of {@link Sequence#each}.
	   *
	   * @public
	   * @param {Function} fn The function to invoke asynchronously on each element in
	   *     the sequence one by one.
	   * @returns {AsyncHandle} An {@link AsyncHandle} providing the ability to
	   *     cancel the asynchronous iteration (by calling `cancel()`) as well as
	   *     supply callback(s) for when an error is encountered (`onError`) or when
	   *     iteration is complete (`onComplete`).
	   */
	  AsyncSequence.prototype.each = function each(fn) {
	    var iterator = this.parent.getIterator(),
	        onNextCallback = this.onNextCallback,
	        cancelCallback = this.cancelCallback,
	        i = 0;

	    var handle = new AsyncHandle(function cancel() {
	      if (cancellationId) {
	        cancelCallback(cancellationId);
	      }
	    });

	    var cancellationId = onNextCallback(function iterate() {
	      cancellationId = null;

	      try {
	        if (iterator.moveNext() && fn(iterator.current(), i++) !== false) {
	          cancellationId = onNextCallback(iterate);

	        } else {
	          handle._resolve();
	        }

	      } catch (e) {
	        handle._reject(e);
	      }
	    });

	    return handle;
	  };

	  /**
	   * An `AsyncHandle` provides a [Promises/A+](http://promises-aplus.github.io/promises-spec/)
	   * compliant interface for an {@link AsyncSequence} that is currently (or was)
	   * iterating over its elements.
	   *
	   * In addition to behaving as a promise, an `AsyncHandle` provides the ability
	   * to {@link AsyncHandle#cancel} iteration (if `cancelFn` is provided)
	   * and also offers convenient {@link AsyncHandle#onComplete} and
	   * {@link AsyncHandle#onError} methods to attach listeners for when iteration
	   * is complete or an error is thrown during iteration.
	   *
	   * @public
	   * @param {Function} cancelFn A function to cancel asynchronous iteration.
	   *     This is passed in to support different cancellation mechanisms for
	   *     different forms of asynchronous sequences (e.g., timeout-based
	   *     sequences, sequences based on I/O, etc.).
	   * @constructor
	   *
	   * @example
	   * // Create a sequence of 100,000 random numbers, in chunks of 100.
	   * var sequence = Lazy.generate(Math.random)
	   *   .chunk(100)
	   *   .async()
	   *   .take(1000);
	   *
	   * // Reduce-style operations -- i.e., operations that return a *value* (as
	   * // opposed to a *sequence*) -- return an AsyncHandle for async sequences.
	   * var handle = sequence.toArray();
	   *
	   * handle.onComplete(function(array) {
	   *   // Do something w/ 1,000-element array.
	   * });
	   *
	   * // Since an AsyncHandle is a promise, you can also use it to create
	   * // subsequent promises using `then` (see the Promises/A+ spec for more
	   * // info).
	   * var flattened = handle.then(function(array) {
	   *   return Lazy(array).flatten();
	   * });
	   */
	  function AsyncHandle(cancelFn) {
	    this.resolveListeners = [];
	    this.rejectListeners = [];
	    this.state = PENDING;
	    this.cancelFn = cancelFn;
	  }

	  // Async handle states
	  var PENDING  = 1,
	      RESOLVED = 2,
	      REJECTED = 3;

	  AsyncHandle.prototype.then = function then(onFulfilled, onRejected) {
	    var promise = new AsyncHandle(this.cancelFn);

	    this.resolveListeners.push(function(value) {
	      try {
	        if (typeof onFulfilled !== 'function') {
	          resolve(promise, value);
	          return;
	        }

	        resolve(promise, onFulfilled(value));

	      } catch (e) {
	        promise._reject(e);
	      }
	    });

	    this.rejectListeners.push(function(reason) {
	      try {
	        if (typeof onRejected !== 'function') {
	          promise._reject(reason);
	          return;
	        }

	        resolve(promise, onRejected(reason));

	      } catch (e) {
	        promise._reject(e);
	      }
	    });

	    if (this.state === RESOLVED) {
	      this._resolve(this.value);
	    }

	    if (this.state === REJECTED) {
	      this._reject(this.reason);
	    }

	    return promise;
	  };

	  AsyncHandle.prototype._resolve = function _resolve(value) {
	    if (this.state === REJECTED) {
	      return;
	    }

	    if (this.state === PENDING) {
	      this.state = RESOLVED;
	      this.value = value;
	    }

	    consumeListeners(this.resolveListeners, this.value);
	  };

	  AsyncHandle.prototype._reject = function _reject(reason) {
	    if (this.state === RESOLVED) {
	      return;
	    }

	    if (this.state === PENDING) {
	      this.state = REJECTED;
	      this.reason = reason;
	    }

	    consumeListeners(this.rejectListeners, this.reason);
	  };

	  /**
	   * Cancels asynchronous iteration.
	   *
	   * @public
	   */
	  AsyncHandle.prototype.cancel = function cancel() {
	    if (this.cancelFn) {
	      this.cancelFn();
	      this.cancelFn = null;
	      this._resolve(false);
	    }
	  };

	  /**
	   * Updates the handle with a callback to execute when iteration is completed.
	   *
	   * @public
	   * @param {Function} callback The function to call when the asynchronous
	   *     iteration is completed.
	   * @return {AsyncHandle} A reference to the handle (for chaining).
	   */
	  AsyncHandle.prototype.onComplete = function onComplete(callback) {
	    this.resolveListeners.push(callback);
	    return this;
	  };

	  /**
	   * Updates the handle with a callback to execute if/when any error is
	   * encountered during asynchronous iteration.
	   *
	   * @public
	   * @param {Function} callback The function to call, with any associated error
	   *     object, when an error occurs.
	   * @return {AsyncHandle} A reference to the handle (for chaining).
	   */
	  AsyncHandle.prototype.onError = function onError(callback) {
	    this.rejectListeners.push(callback);
	    return this;
	  };

	  /**
	   * Promise resolution procedure:
	   * http://promises-aplus.github.io/promises-spec/#the_promise_resolution_procedure
	   */
	  function resolve(promise, x) {
	    if (promise === x) {
	      promise._reject(new TypeError('Cannot resolve a promise to itself'));
	      return;
	    }

	    if (x instanceof AsyncHandle) {
	      x.then(
	        function(value) { resolve(promise, value); },
	        function(reason) { promise._reject(reason); }
	      );
	      return;
	    }

	    var then;
	    try {
	      then = (/function|object/).test(typeof x) && x != null && x.then;
	    } catch (e) {
	      promise._reject(e);
	      return;
	    }

	    var thenableState = PENDING;
	    if (typeof then === 'function') {
	      try {
	        then.call(
	          x,
	          function resolvePromise(value) {
	            if (thenableState !== PENDING) {
	              return;
	            }
	            thenableState = RESOLVED;
	            resolve(promise, value);
	          },
	          function rejectPromise(reason) {
	            if (thenableState !== PENDING) {
	              return;
	            }
	            thenableState = REJECTED;
	            promise._reject(reason);
	          }
	        );
	      } catch (e) {
	        if (thenableState !== PENDING) {
	          return;
	        }

	        promise._reject(e);
	      }

	      return;
	    }

	    promise._resolve(x);
	  }

	  function consumeListeners(listeners, value, callback) {
	    callback || (callback = getOnNextCallback());

	    callback(function() {
	      if (listeners.length > 0) {
	        listeners.shift()(value);
	        consumeListeners(listeners, value, callback);
	      }
	    });
	  }

	  function getOnNextCallback(interval) {
	    if (typeof interval === "undefined") {
	      if (typeof setImmediate === "function") {
	        return setImmediate;
	      }
	    }

	    interval = interval || 0;
	    return function(fn) {
	      return setTimeout(fn, interval);
	    };
	  }

	  function getCancelCallback(interval) {
	    if (typeof interval === "undefined") {
	      if (typeof clearImmediate === "function") {
	        return clearImmediate;
	      }
	    }

	    return clearTimeout;
	  }

	  /**
	   * Transform a value, whether the value is retrieved asynchronously or directly.
	   *
	   * @private
	   * @param {Function} fn The function that transforms the value.
	   * @param {*} value The value to be transformed. This can be an {@link AsyncHandle} when the value
	   *     is retrieved asynchronously, otherwise it can be anything.
	   * @returns {*} An {@link AsyncHandle} when `value` is also an {@link AsyncHandle}, otherwise
	   *     whatever `fn` resulted in.
	   */
	  function transform(fn, value) {
	    if (value instanceof AsyncHandle) {
	      return value.then(function() { fn(value); });
	    }
	    return fn(value);
	  }

	  /**
	   * An async version of {@link Sequence#reverse}.
	   */
	  AsyncSequence.prototype.reverse = function reverse() {
	    return this.parent.reverse().async();
	  };

	  /**
	   * A version of {@link Sequence#find} which returns an {@link AsyncHandle}.
	   *
	   * @public
	   * @param {Function} predicate A function to call on (potentially) every element
	   *     in the sequence.
	   * @returns {AsyncHandle} An {@link AsyncHandle} (promise) which resolves to
	   *     the found element, once it is detected, or else `undefined`.
	   */
	  AsyncSequence.prototype.find = function find(predicate) {
	    var found;

	    var handle = this.each(function(e, i) {
	      if (predicate(e, i)) {
	        found = e;
	        return false;
	      }
	    });

	    return handle.then(function() { return found; });
	  };

	  /**
	   * A version of {@link Sequence#indexOf} which returns an {@link AsyncHandle}.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {AsyncHandle} An {@link AsyncHandle} (promise) which resolves to
	   *     the found index, once it is detected, or -1.
	   */
	  AsyncSequence.prototype.indexOf = function indexOf(value) {
	    var foundIndex = -1;

	    var handle = this.each(function(e, i) {
	      if (e === value) {
	        foundIndex = i;
	        return false;
	      }
	    });

	    return handle.then(function() {
	      return foundIndex;
	    });
	  };

	  /**
	   * A version of {@link Sequence#contains} which returns an {@link AsyncHandle}.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {AsyncHandle} An {@link AsyncHandle} (promise) which resolves to
	   *     either `true` or `false` to indicate whether the element was found.
	   */
	  AsyncSequence.prototype.contains = function contains(value) {
	    var found = false;

	    var handle = this.each(function(e) {
	      if (e === value) {
	        found = true;
	        return false;
	      }
	    });

	    return handle.then(function() {
	      return found;
	    });
	  };

	  /**
	   * Just return the same sequence for `AsyncSequence#async` (I see no harm in this).
	   */
	  AsyncSequence.prototype.async = function async() {
	    return this;
	  };

	  /**
	   * See {@link ObjectLikeSequence#watch} for docs.
	   */
	  ObjectWrapper.prototype.watch = function watch(propertyNames) {
	    return new WatchedPropertySequence(this.source, propertyNames);
	  };

	  function WatchedPropertySequence(object, propertyNames) {
	    this.listeners = [];

	    if (!propertyNames) {
	      propertyNames = Lazy(object).keys().toArray();
	    } else if (!(propertyNames instanceof Array)) {
	      propertyNames = [propertyNames];
	    }

	    var listeners = this.listeners,
	        index     = 0;

	    Lazy(propertyNames).each(function(propertyName) {
	      var propertyValue = object[propertyName];

	      Object.defineProperty(object, propertyName, {
	        get: function() {
	          return propertyValue;
	        },

	        set: function(value) {
	          for (var i = listeners.length - 1; i >= 0; --i) {
	            if (listeners[i]({ property: propertyName, value: value }, index) === false) {
	              listeners.splice(i, 1);
	            }
	          }
	          propertyValue = value;
	          ++index;
	        }
	      });
	    });
	  }

	  WatchedPropertySequence.prototype = new AsyncSequence();

	  WatchedPropertySequence.prototype.each = function each(fn) {
	    this.listeners.push(fn);
	  };

	  /**
	   * A StreamLikeSequence comprises a sequence of 'chunks' of data, which are
	   * typically multiline strings.
	   *
	   * @constructor
	   */
	  function StreamLikeSequence() {}

	  StreamLikeSequence.prototype = new AsyncSequence();

	  StreamLikeSequence.prototype.isAsync = function isAsync() {
	    return true;
	  };

	  StreamLikeSequence.prototype.split = function split(delimiter) {
	    return new SplitStreamSequence(this, delimiter);
	  };

	  /**
	   * @constructor
	   */
	  function SplitStreamSequence(parent, delimiter) {
	    this.parent    = parent;
	    this.delimiter = delimiter;
	    this.each      = this.getEachForDelimiter(delimiter);
	  }

	  SplitStreamSequence.prototype = new Sequence();

	  SplitStreamSequence.prototype.getEachForDelimiter = function getEachForDelimiter(delimiter) {
	    if (delimiter instanceof RegExp) {
	      return this.regexEach;
	    }

	    return this.stringEach;
	  };

	  SplitStreamSequence.prototype.regexEach = function each(fn) {
	    var delimiter = cloneRegex(this.delimiter),
	        buffer = '',
	        start = 0, end,
	        index = 0;

	    var handle = this.parent.each(function(chunk) {
	      buffer += chunk;

	      var match;
	      while (match = delimiter.exec(buffer)) {
	        end = match.index;
	        if (fn(buffer.substring(start, end), index++) === false) {
	          return false;
	        }
	        start = end + match[0].length;
	      }

	      buffer = buffer.substring(start);
	      start = 0;
	    });

	    handle.onComplete(function() {
	      if (buffer.length > 0) {
	        fn(buffer, index++);
	      }
	    });

	    return handle;
	  };

	  SplitStreamSequence.prototype.stringEach = function each(fn) {
	    var delimiter  = this.delimiter,
	        pieceIndex = 0,
	        buffer = '',
	        bufferIndex = 0;

	    var handle = this.parent.each(function(chunk) {
	      buffer += chunk;
	      var delimiterIndex;
	      while ((delimiterIndex = buffer.indexOf(delimiter)) >= 0) {
	        var piece = buffer.substr(0,delimiterIndex);
	        buffer = buffer.substr(delimiterIndex+delimiter.length);
	        if (fn(piece,pieceIndex++) === false) {
	          return false;
	        }
	      }
	      return true;
	    });

	    handle.onComplete(function() {
	      fn(buffer, pieceIndex++);
	    });

	    return handle;
	  };

	  StreamLikeSequence.prototype.lines = function lines() {
	    return this.split("\n");
	  };

	  StreamLikeSequence.prototype.match = function match(pattern) {
	    return new MatchedStreamSequence(this, pattern);
	  };

	  /**
	   * @constructor
	   */
	  function MatchedStreamSequence(parent, pattern) {
	    this.parent  = parent;
	    this.pattern = cloneRegex(pattern);
	  }

	  MatchedStreamSequence.prototype = new AsyncSequence();

	  MatchedStreamSequence.prototype.each = function each(fn) {
	    var pattern = this.pattern,
	        done      = false,
	        i         = 0;

	    return this.parent.each(function(chunk) {
	      Lazy(chunk).match(pattern).each(function(match) {
	        if (fn(match, i++) === false) {
	          done = true;
	          return false;
	        }
	      });

	      return !done;
	    });
	  };

	  /**
	   * Defines a wrapper for custom {@link StreamLikeSequence}s. This is useful
	   * if you want a way to handle a stream of events as a sequence, but you can't
	   * use Lazy's existing interface (i.e., you're wrapping an object from a
	   * library with its own custom events).
	   *
	   * This method defines a *factory*: that is, it produces a function that can
	   * be used to wrap objects and return a {@link Sequence}. Hopefully the
	   * example will make this clear.
	   *
	   * @public
	   * @param {Function} initializer An initialization function called on objects
	   *     created by this factory. `this` will be bound to the created object,
	   *     which is an instance of {@link StreamLikeSequence}. Use `emit` to
	   *     generate data for the sequence.
	   * @returns {Function} A function that creates a new {@link StreamLikeSequence},
	   *     initializes it using the specified function, and returns it.
	   *
	   * @example
	   * var factory = Lazy.createWrapper(function(eventSource) {
	   *   var sequence = this;
	   *
	   *   eventSource.handleEvent(function(data) {
	   *     sequence.emit(data);
	   *   });
	   * });
	   *
	   * var eventEmitter = {
	   *   triggerEvent: function(data) {
	   *     eventEmitter.eventHandler(data);
	   *   },
	   *   handleEvent: function(handler) {
	   *     eventEmitter.eventHandler = handler;
	   *   },
	   *   eventHandler: function() {}
	   * };
	   *
	   * var events = [];
	   *
	   * factory(eventEmitter).each(function(e) {
	   *   events.push(e);
	   * });
	   *
	   * eventEmitter.triggerEvent('foo');
	   * eventEmitter.triggerEvent('bar');
	   *
	   * events // => ['foo', 'bar']
	   */
	  Lazy.createWrapper = function createWrapper(initializer) {
	    var ctor = function() {
	      this.listeners = [];
	    };

	    ctor.prototype = new StreamLikeSequence();

	    ctor.prototype.each = function(listener) {
	      this.listeners.push(listener);
	    };

	    ctor.prototype.emit = function(data) {
	      var listeners = this.listeners;

	      for (var len = listeners.length, i = len - 1; i >= 0; --i) {
	        if (listeners[i](data) === false) {
	          listeners.splice(i, 1);
	        }
	      }
	    };

	    return function() {
	      var sequence = new ctor();
	      initializer.apply(sequence, arguments);
	      return sequence;
	    };
	  };

	  /**
	   * Creates a {@link GeneratedSequence} using the specified generator function
	   * and (optionally) length.
	   *
	   * @public
	   * @param {function(number):*} generatorFn The function used to generate the
	   *     sequence. This function accepts an index as a parameter and should return
	   *     a value for that index in the resulting sequence.
	   * @param {number=} length The length of the sequence, for sequences with a
	   *     definite length.
	   * @returns {GeneratedSequence} The generated sequence.
	   *
	   * @examples
	   * var randomNumbers = Lazy.generate(Math.random);
	   * var countingNumbers = Lazy.generate(function(i) { return i + 1; }, 5);
	   *
	   * randomNumbers          // instanceof Lazy.GeneratedSequence
	   * randomNumbers.length() // => undefined
	   * countingNumbers          // sequence: [1, 2, 3, 4, 5]
	   * countingNumbers.length() // => 5
	   */
	  Lazy.generate = function generate(generatorFn, length) {
	    return new GeneratedSequence(generatorFn, length);
	  };

	  /**
	   * Creates a sequence from a given starting value, up to a specified stopping
	   * value, incrementing by a given step. Invalid values for any of these
	   * arguments (e.g., a step of 0) result in an empty sequence.
	   *
	   * @public
	   * @returns {GeneratedSequence} The sequence defined by the given ranges.
	   *
	   * @examples
	   * Lazy.range(3)         // sequence: [0, 1, 2]
	   * Lazy.range(1, 4)      // sequence: [1, 2, 3]
	   * Lazy.range(2, 10, 2)  // sequence: [2, 4, 6, 8]
	   * Lazy.range(5, 1, 2)   // sequence: []
	   * Lazy.range(5, 15, -2) // sequence: []
	   * Lazy.range(3, 10, 3)  // sequence: [3, 6, 9]
	   * Lazy.range(5, 2)      // sequence: [5, 4, 3]
	   * Lazy.range(7, 2, -2)  // sequence: [7, 5, 3]
	   * Lazy.range(3, 5, 0)   // sequence: []
	   */
	  Lazy.range = function range() {
	    var start = arguments.length > 1 ? arguments[0] : 0,
	        stop  = arguments.length > 1 ? arguments[1] : arguments[0],
	        step  = arguments.length > 2 && arguments[2];

	    if (step === false) {
	      step = stop > start ? 1 : -1;
	    }

	    if (step === 0) {
	      return Lazy([]);
	    }

	    return Lazy.generate(function(i) { return start + (step * i); })
	      .take(Math.ceil((stop - start) / step));
	  };

	  /**
	   * Creates a sequence consisting of the given value repeated a specified number
	   * of times.
	   *
	   * @public
	   * @param {*} value The value to repeat.
	   * @param {number=} count The number of times the value should be repeated in
	   *     the sequence. If this argument is omitted, the value will repeat forever.
	   * @returns {GeneratedSequence} The sequence containing the repeated value.
	   *
	   * @examples
	   * Lazy.repeat("hi", 3)          // sequence: ["hi", "hi", "hi"]
	   * Lazy.repeat("young")          // instanceof Lazy.GeneratedSequence
	   * Lazy.repeat("young").length() // => undefined
	   * Lazy.repeat("young").take(3)  // sequence: ["young", "young", "young"]
	   */
	  Lazy.repeat = function repeat(value, count) {
	    return Lazy.generate(function() { return value; }, count);
	  };

	  Lazy.Sequence           = Sequence;
	  Lazy.ArrayLikeSequence  = ArrayLikeSequence;
	  Lazy.ObjectLikeSequence = ObjectLikeSequence;
	  Lazy.StringLikeSequence = StringLikeSequence;
	  Lazy.StreamLikeSequence = StreamLikeSequence;
	  Lazy.GeneratedSequence  = GeneratedSequence;
	  Lazy.AsyncSequence      = AsyncSequence;
	  Lazy.AsyncHandle        = AsyncHandle;

	  /*** Useful utility methods ***/

	  /**
	   * Creates a shallow copy of an array or object.
	   *
	   * @examples
	   * var array  = [1, 2, 3], clonedArray,
	   *     object = { foo: 1, bar: 2 }, clonedObject;
	   *
	   * clonedArray = Lazy.clone(array); // => [1, 2, 3]
	   * clonedArray.push(4); // clonedArray == [1, 2, 3, 4]
	   * array; // => [1, 2, 3]
	   *
	   * clonedObject = Lazy.clone(object); // => { foo: 1, bar: 2 }
	   * clonedObject.baz = 3; // clonedObject == { foo: 1, bar: 2, baz: 3 }
	   * object; // => { foo: 1, bar: 2 }
	   */
	  Lazy.clone = function clone(target) {
	    return Lazy(target).value();
	  };

	  /**
	   * Marks a method as deprecated, so calling it will issue a console warning.
	   */
	  Lazy.deprecate = function deprecate(message, fn) {
	    return function() {
	      console.warn(message);
	      return fn.apply(this, arguments);
	    };
	  };

	  var arrayPop   = Array.prototype.pop,
	      arraySlice = Array.prototype.slice;

	  /**
	   * Creates a callback... you know, Lo-Dash style.
	   *
	   * - for functions, just returns the function
	   * - for strings, returns a pluck-style callback
	   * - for objects, returns a where-style callback
	   *
	   * @private
	   * @param {Function|string|Object} callback A function, string, or object to
	   *     convert to a callback.
	   * @param {*} defaultReturn If the callback is undefined, a default return
	   *     value to use for the function.
	   * @returns {Function} The callback function.
	   *
	   * @examples
	   * createCallback(function() {})                  // instanceof Function
	   * createCallback('foo')                          // instanceof Function
	   * createCallback('foo')({ foo: 'bar'})           // => 'bar'
	   * createCallback({ foo: 'bar' })({ foo: 'bar' }) // => true
	   * createCallback({ foo: 'bar' })({ foo: 'baz' }) // => false
	   */
	  function createCallback(callback, defaultValue) {
	    switch (typeof callback) {
	      case "function":
	        return callback;

	      case "string":
	        return function(e) {
	          return e[callback];
	        };

	      case "object":
	        return function(e) {
	          return Lazy(callback).all(function(value, key) {
	            return e[key] === value;
	          });
	        };

	      case "undefined":
	        return defaultValue ?
	          function() { return defaultValue; } :
	          Lazy.identity;

	      default:
	        throw new Error("Don't know how to make a callback from a " + typeof callback + "!");
	    }
	  }

	  /**
	   * Takes a function that returns a value for one argument and produces a
	   * function that compares two arguments.
	   *
	   * @private
	   * @param {Function|string|Object} callback A function, string, or object to
	   *     convert to a callback using `createCallback`.
	   * @returns {Function} A function that accepts two values and returns 1 if
	   *     the first is greater, -1 if the second is greater, or 0 if they are
	   *     equivalent.
	   *
	   * @examples
	   * createComparator('a')({ a: 1 }, { a: 2 });       // => -1
	   * createComparator('a')({ a: 6 }, { a: 2 });       // => 1
	   * createComparator('a')({ a: 1 }, { a: 1 });       // => 0
	   * createComparator()(3, 5);                        // => -1
	   * createComparator()(7, 5);                        // => 1
	   * createComparator()(3, 3);                        // => 0
	   */
	  function createComparator(callback, descending) {
	    if (!callback) { return compare; }

	    callback = createCallback(callback);

	    return function(x, y) {
	      return compare(callback(x), callback(y));
	    };
	  }

	  /**
	   * Takes a function and returns a function with the same logic but the
	   * arguments reversed. Only applies to functions w/ arity=2 as this is private
	   * and I can do what I want.
	   *
	   * @private
	   * @param {Function} fn The function to "reverse"
	   * @returns {Function} The "reversed" function
	   *
	   * @examples
	   * reverseArguments(function(x, y) { return x + y; })('a', 'b'); // => 'ba'
	   */
	  function reverseArguments(fn) {
	    return function(x, y) { return fn(y, x); };
	  }

	  /**
	   * Creates a Set containing the specified values.
	   *
	   * @param {...Array} values One or more array(s) of values used to populate the
	   *     set.
	   * @returns {Set} A new set containing the values passed in.
	   */
	  function createSet(values) {
	    var set = new Set();
	    Lazy(values || []).flatten().each(function(e) {
	      set.add(e);
	    });
	    return set;
	  }

	  /**
	   * Compares two elements for sorting purposes.
	   *
	   * @private
	   * @param {*} x The left element to compare.
	   * @param {*} y The right element to compare.
	   * @returns {number} 1 if x > y, -1 if x < y, or 0 if x and y are equal.
	   *
	   * @examples
	   * compare(1, 2)     // => -1
	   * compare(1, 1)     // => 0
	   * compare(2, 1)     // => 1
	   * compare('a', 'b') // => -1
	   */
	  function compare(x, y) {
	    if (x === y) {
	      return 0;
	    }

	    return x > y ? 1 : -1;
	  }

	  /**
	   * Iterates over every element in an array.
	   *
	   * @param {Array} array The array.
	   * @param {Function} fn The function to call on every element, which can return
	   *     false to stop the iteration early.
	   * @returns {boolean} True if every element in the entire sequence was iterated,
	   *     otherwise false.
	   */
	  function forEach(array, fn) {
	    var i = -1,
	        len = array.length;

	    while (++i < len) {
	      if (fn(array[i], i) === false) {
	        return false;
	      }
	    }

	    return true;
	  }

	  function getFirst(sequence) {
	    var result;
	    sequence.each(function(e) {
	      result = e;
	      return false;
	    });
	    return result;
	  }

	  /**
	   * Checks if an element exists in an array.
	   *
	   * @private
	   * @param {Array} array
	   * @param {*} element
	   * @returns {boolean} Whether or not the element exists in the array.
	   *
	   * @examples
	   * arrayContains([1, 2], 2)              // => true
	   * arrayContains([1, 2], 3)              // => false
	   * arrayContains([undefined], undefined) // => true
	   * arrayContains([NaN], NaN)             // => true
	   */
	  function arrayContains(array, element) {
	    var i = -1,
	        length = array.length;

	    // Special handling for NaN
	    if (element !== element) {
	      while (++i < length) {
	        if (array[i] !== array[i]) {
	          return true;
	        }
	      }
	      return false;
	    }

	    while (++i < length) {
	      if (array[i] === element) {
	        return true;
	      }
	    }
	    return false;
	  }

	  /**
	   * Checks if an element exists in an array before a given index.
	   *
	   * @private
	   * @param {Array} array
	   * @param {*} element
	   * @param {number} index
	   * @param {Function} keyFn
	   * @returns {boolean}
	   *
	   * @examples
	   * arrayContainsBefore([1, 2, 3], 3, 2) // => false
	   * arrayContainsBefore([1, 2, 3], 3, 3) // => true
	   */
	  function arrayContainsBefore(array, element, index, keyFn) {
	    var i = -1;

	    if (keyFn) {
	      keyFn = createCallback(keyFn);
	      while (++i < index) {
	        if (keyFn(array[i]) === keyFn(element)) {
	          return true;
	        }
	      }

	    } else {
	      while (++i < index) {
	        if (array[i] === element) {
	          return true;
	        }
	      }
	    }

	    return false;
	  }

	  /**
	   * Swaps the elements at two specified positions of an array.
	   *
	   * @private
	   * @param {Array} array
	   * @param {number} i
	   * @param {number} j
	   *
	   * @examples
	   * var array = [1, 2, 3, 4, 5];
	   *
	   * swap(array, 2, 3) // array == [1, 2, 4, 3, 5]
	   */
	  function swap(array, i, j) {
	    var temp = array[i];
	    array[i] = array[j];
	    array[j] = temp;
	  }

	  /**
	   * "Clones" a regular expression (but makes it always global).
	   *
	   * @private
	   * @param {RegExp|string} pattern
	   * @returns {RegExp}
	   */
	  function cloneRegex(pattern) {
	    return eval("" + pattern + (!pattern.global ? "g" : ""));
	  };

	  /**
	   * A collection of unique elements.
	   *
	   * @private
	   * @constructor
	   *
	   * @examples
	   * var set  = new Set(),
	   *     obj1 = {},
	   *     obj2 = {},
	   *     fn1 = function fn1() {},
	   *     fn2 = function fn2() {};
	   *
	   * set.add('foo')            // => true
	   * set.add('foo')            // => false
	   * set.add(1)                // => true
	   * set.add(1)                // => false
	   * set.add('1')              // => true
	   * set.add('1')              // => false
	   * set.add(obj1)             // => true
	   * set.add(obj1)             // => false
	   * set.add(obj2)             // => true
	   * set.add(fn1)              // => true
	   * set.add(fn2)              // => true
	   * set.add(fn2)              // => false
	   * set.contains('__proto__') // => false
	   * set.add('__proto__')      // => true
	   * set.add('__proto__')      // => false
	   * set.contains('add')       // => false
	   * set.add('add')            // => true
	   * set.add('add')            // => false
	   * set.contains(undefined)   // => false
	   * set.add(undefined)        // => true
	   * set.contains(undefined)   // => true
	   * set.contains('undefined') // => false
	   * set.add('undefined')      // => true
	   * set.contains('undefined') // => true
	   * set.contains(NaN)         // => false
	   * set.add(NaN)              // => true
	   * set.contains(NaN)         // => true
	   * set.contains('NaN')       // => false
	   * set.add('NaN')            // => true
	   * set.contains('NaN')       // => true
	   * set.contains('@foo')      // => false
	   * set.add('@foo')           // => true
	   * set.contains('@foo')      // => true
	   */
	  function Set() {
	    this.table   = {};
	    this.objects = [];
	  }

	  /**
	   * Attempts to add a unique value to the set.
	   *
	   * @param {*} value The value to add.
	   * @returns {boolean} True if the value was added to the set (meaning an equal
	   *     value was not already present), or else false.
	   */
	  Set.prototype.add = function add(value) {
	    var table = this.table,
	        type  = typeof value,

	        // only applies for strings
	        firstChar,

	        // only applies for objects
	        objects;

	    switch (type) {
	      case "number":
	      case "boolean":
	      case "undefined":
	        if (!table[value]) {
	          table[value] = true;
	          return true;
	        }
	        return false;

	      case "string":
	        // Essentially, escape the first character if it could possibly collide
	        // with a number, boolean, or undefined (or a string that happens to start
	        // with the escape character!), OR if it could override a special property
	        // such as '__proto__' or 'constructor'.
	        switch (value.charAt(0)) {
	          case "_": // e.g., __proto__
	          case "f": // for 'false'
	          case "t": // for 'true'
	          case "c": // for 'constructor'
	          case "u": // for 'undefined'
	          case "@": // escaped
	          case "0":
	          case "1":
	          case "2":
	          case "3":
	          case "4":
	          case "5":
	          case "6":
	          case "7":
	          case "8":
	          case "9":
	          case "N": // for NaN
	            value = "@" + value;
	        }
	        if (!table[value]) {
	          table[value] = true;
	          return true;
	        }
	        return false;

	      default:
	        // For objects and functions, we can't really do anything other than store
	        // them in an array and do a linear search for reference equality.
	        objects = this.objects;
	        if (!arrayContains(objects, value)) {
	          objects.push(value);
	          return true;
	        }
	        return false;
	    }
	  };

	  /**
	   * Checks whether the set contains a value.
	   *
	   * @param {*} value The value to check for.
	   * @returns {boolean} True if the set contains the value, or else false.
	   */
	  Set.prototype.contains = function contains(value) {
	    var type = typeof value,

	        // only applies for strings
	        firstChar;

	    switch (type) {
	      case "number":
	      case "boolean":
	      case "undefined":
	        return !!this.table[value];

	      case "string":
	        // Essentially, escape the first character if it could possibly collide
	        // with a number, boolean, or undefined (or a string that happens to start
	        // with the escape character!), OR if it could override a special property
	        // such as '__proto__' or 'constructor'.
	        switch (value.charAt(0)) {
	          case "_": // e.g., __proto__
	          case "f": // for 'false'
	          case "t": // for 'true'
	          case "c": // for 'constructor'
	          case "u": // for 'undefined'
	          case "@": // escaped
	          case "0":
	          case "1":
	          case "2":
	          case "3":
	          case "4":
	          case "5":
	          case "6":
	          case "7":
	          case "8":
	          case "9":
	          case "N": // for NaN
	            value = "@" + value;
	        }
	        return !!this.table[value];

	      default:
	        // For objects and functions, we can't really do anything other than store
	        // them in an array and do a linear search for reference equality.
	        return arrayContains(this.objects, value);
	    }
	  };

	  /**
	   * A "rolling" queue, with a fixed capacity. As items are added to the head,
	   * excess items are dropped from the tail.
	   *
	   * @private
	   * @constructor
	   *
	   * @examples
	   * var queue = new Queue(3);
	   *
	   * queue.add(1).toArray()        // => [1]
	   * queue.add(2).toArray()        // => [1, 2]
	   * queue.add(3).toArray()        // => [1, 2, 3]
	   * queue.add(4).toArray()        // => [2, 3, 4]
	   * queue.add(5).add(6).toArray() // => [4, 5, 6]
	   * queue.add(7).add(8).toArray() // => [6, 7, 8]
	   *
	   * // also want to check corner cases
	   * new Queue(1).add('foo').add('bar').toArray() // => ['bar']
	   * new Queue(0).add('foo').toArray()            // => []
	   * new Queue(-1)                                // throws
	   *
	   * @benchmarks
	   * function populateQueue(count, capacity) {
	   *   var q = new Queue(capacity);
	   *   for (var i = 0; i < count; ++i) {
	   *     q.add(i);
	   *   }
	   * }
	   *
	   * function populateArray(count, capacity) {
	   *   var arr = [];
	   *   for (var i = 0; i < count; ++i) {
	   *     if (arr.length === capacity) { arr.shift(); }
	   *     arr.push(i);
	   *   }
	   * }
	   *
	   * populateQueue(100, 10); // populating a Queue
	   * populateArray(100, 10); // populating an Array
	   */
	  function Queue(capacity) {
	    this.contents = new Array(capacity);
	    this.start    = 0;
	    this.count    = 0;
	  }

	  /**
	   * Adds an item to the queue, and returns the queue.
	   */
	  Queue.prototype.add = function add(element) {
	    var contents = this.contents,
	        capacity = contents.length,
	        start    = this.start;

	    if (this.count === capacity) {
	      contents[start] = element;
	      this.start = (start + 1) % capacity;

	    } else {
	      contents[this.count++] = element;
	    }

	    return this;
	  };

	  /**
	   * Returns an array containing snapshot of the queue's contents.
	   */
	  Queue.prototype.toArray = function toArray() {
	    var contents = this.contents,
	        start    = this.start,
	        count    = this.count;

	    var snapshot = contents.slice(start, start + count);
	    if (snapshot.length < count) {
	      snapshot = snapshot.concat(contents.slice(0, count - snapshot.length));
	    }

	    return snapshot;
	  };

	  /**
	   * Shared base method for defining new sequence types.
	   */
	  function defineSequenceType(base, name, overrides) {
	    /** @constructor */
	    var ctor = function ctor() {};

	    // Make this type inherit from the specified base.
	    ctor.prototype = new base();

	    // Attach overrides to the new sequence type's prototype.
	    for (var override in overrides) {
	      ctor.prototype[override] = overrides[override];
	    }

	    // Define a factory method that sets the new sequence's parent to the caller
	    // and (optionally) applies any additional initialization logic.
	    // Expose this as a chainable method so that we can do:
	    // Lazy(...).map(...).filter(...).blah(...);
	    var factory = function factory() {
	      var sequence = new ctor();

	      // Every sequence needs a reference to its parent in order to work.
	      sequence.parent = this;

	      // If a custom init function was supplied, call it now.
	      if (sequence.init) {
	        sequence.init.apply(sequence, arguments);
	      }

	      return sequence;
	    };

	    var methodNames = typeof name === 'string' ? [name] : name;
	    for (var i = 0; i < methodNames.length; ++i) {
	      base.prototype[methodNames[i]] = factory;
	    }

	    return ctor;
	  }

	  return Lazy;
	});

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(7).setImmediate, __webpack_require__(7).clearImmediate))

/***/ },
/* 73 */
/***/ function(module, exports) {

	"use strict";
	'use strict';

	module.exports = {
	  createWriteStream: function(filename, options) {
	    return;
	  },
	  writeFileSync: function() {
	    return;
	  },
	  openSync: function() {
	    return;
	  },
	  writeSync: function() {
	    return;
	  }
	}


/***/ },
/* 74 */
/***/ function(module, exports) {

	"use strict";
	'use strict';

	class EventIndex {
	  constructor() {
	    this._index = {};
	  }

	  get() {
	    return Object.keys(this._index).map((f) => this._index[f]);
	  }

	  updateIndex(oplog, added) {
	    added.reduce((handled, item) => {
	      if(handled.indexOf(item.hash) === -1) {
	        handled.push(item.hash);
	        if(item.payload.op === 'ADD')
	          this._index[item.hash] = item
	      }
	      return handled;
	    }, []);
	  }
	}

	module.exports = EventIndex;


/***/ },
/* 75 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const Lazy       = __webpack_require__(72);
	const Store      = __webpack_require__(38);
	const EventIndex = __webpack_require__(74);

	class EventStore extends Store {
	  constructor(ipfs, id, dbname, options) {
	    if(!options) options = {};
	    if(!options.Index) Object.assign(options, { Index: EventIndex });
	    super(ipfs, id, dbname, options)
	  }

	  add(data) {
	    return this._addOperation({
	      op: 'ADD',
	      key: null,
	      value: data,
	      meta: {
	        ts: new Date().getTime()
	      }
	    });
	  }

	  iterator(options) {
	    const messages = this._query(this.dbname, options);
	    let currentIndex = 0;
	    let iterator = {
	      [Symbol.iterator]() {
	        return this;
	      },
	      next() {
	        let item = { value: null, done: true };
	        if(currentIndex < messages.length) {
	          item = { value: messages[currentIndex], done: false };
	          currentIndex ++;
	        }
	        return item;
	      },
	      collect: () => messages
	    }

	    return iterator;
	  }

	  _query(dbname, opts) {
	    if(!opts) opts = {};

	    const amount = opts.limit ? (opts.limit > -1 ? opts.limit : this._index.get().length) : 1; // Return 1 if no limit is provided
	    const events = this._index.get();
	    let result = [];

	    if(opts.gt || opts.gte) {
	      // Greater than case
	      result = this._read(events, opts.gt ? opts.gt : opts.gte, amount, opts.gte ? true : false)
	    } else {
	      // Lower than and lastN case, search latest first by reversing the sequence
	      result = this._read(events.reverse(), opts.lt ? opts.lt : opts.lte, amount, opts.lte || !opts.lt).reverse()
	    }

	    if(opts.reverse) result.reverse();

	    return result.toArray();
	  }

	  _read(ops, hash, amount, inclusive) {
	    return Lazy(ops)
	      .skipWhile((f) => hash && f.hash !== hash)
	      .drop(inclusive ? 0 : 1)
	      .take(amount);
	  }
	}

	module.exports = EventStore;


/***/ },
/* 76 */
/***/ function(module, exports) {

	/**
	 * Parses an URI
	 *
	 * @author Steven Levithan <stevenlevithan.com> (MIT license)
	 * @api private
	 */

	var re = /^(?:(?![^:@]+:[^:@\/]*@)(http|https|ws|wss):\/\/)?((?:(([^:@]*)(?::([^:@]*))?)?@)?((?:[a-f0-9]{0,4}:){2,7}[a-f0-9]{0,4}|[^:\/?#]*)(?::(\d*))?)(((\/(?:[^?#](?![^?#\/]*\.[^?#\/.]+(?:[?#]|$)))*\/?)?([^?#\/]*))(?:\?([^#]*))?(?:#(.*))?)/;

	var parts = [
	    'source', 'protocol', 'authority', 'userInfo', 'user', 'password', 'host', 'port', 'relative', 'path', 'directory', 'file', 'query', 'anchor'
	];

	module.exports = function parseuri(str) {
	    var src = str,
	        b = str.indexOf('['),
	        e = str.indexOf(']');

	    if (b != -1 && e != -1) {
	        str = str.substring(0, b) + str.substring(b, e).replace(/:/g, ';') + str.substring(e, str.length);
	    }

	    var m = re.exec(str || ''),
	        uri = {},
	        i = 14;

	    while (i--) {
	        uri[parts[i]] = m[i] || '';
	    }

	    if (b != -1 && e != -1) {
	        uri.source = src;
	        uri.host = uri.host.substring(1, uri.host.length - 1).replace(/;/g, ':');
	        uri.authority = uri.authority.replace('[', '').replace(']', '').replace(/;/g, ':');
	        uri.ipv6uri = true;
	    }

	    return uri;
	};


/***/ },
/* 77 */
/***/ 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.

	// resolves . and .. elements in a path array with directory names there
	// must be no slashes, empty elements, or device names (c:\) in the array
	// (so also no leading and trailing slashes - it does not distinguish
	// relative and absolute paths)
	function normalizeArray(parts, allowAboveRoot) {
	  // if the path tries to go above the root, `up` ends up > 0
	  var up = 0;
	  for (var i = parts.length - 1; i >= 0; i--) {
	    var last = parts[i];
	    if (last === '.') {
	      parts.splice(i, 1);
	    } else if (last === '..') {
	      parts.splice(i, 1);
	      up++;
	    } else if (up) {
	      parts.splice(i, 1);
	      up--;
	    }
	  }

	  // if the path is allowed to go above the root, restore leading ..s
	  if (allowAboveRoot) {
	    for (; up--; up) {
	      parts.unshift('..');
	    }
	  }

	  return parts;
	}

	// Split a filename into [root, dir, basename, ext], unix version
	// 'root' is just a slash, or nothing.
	var splitPathRe =
	    /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
	var splitPath = function(filename) {
	  return splitPathRe.exec(filename).slice(1);
	};

	// path.resolve([from ...], to)
	// posix version
	exports.resolve = function() {
	  var resolvedPath = '',
	      resolvedAbsolute = false;

	  for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
	    var path = (i >= 0) ? arguments[i] : process.cwd();

	    // Skip empty and invalid entries
	    if (typeof path !== 'string') {
	      throw new TypeError('Arguments to path.resolve must be strings');
	    } else if (!path) {
	      continue;
	    }

	    resolvedPath = path + '/' + resolvedPath;
	    resolvedAbsolute = path.charAt(0) === '/';
	  }

	  // At this point the path should be resolved to a full absolute path, but
	  // handle relative paths to be safe (might happen when process.cwd() fails)

	  // Normalize the path
	  resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {
	    return !!p;
	  }), !resolvedAbsolute).join('/');

	  return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
	};

	// path.normalize(path)
	// posix version
	exports.normalize = function(path) {
	  var isAbsolute = exports.isAbsolute(path),
	      trailingSlash = substr(path, -1) === '/';

	  // Normalize the path
	  path = normalizeArray(filter(path.split('/'), function(p) {
	    return !!p;
	  }), !isAbsolute).join('/');

	  if (!path && !isAbsolute) {
	    path = '.';
	  }
	  if (path && trailingSlash) {
	    path += '/';
	  }

	  return (isAbsolute ? '/' : '') + path;
	};

	// posix version
	exports.isAbsolute = function(path) {
	  return path.charAt(0) === '/';
	};

	// posix version
	exports.join = function() {
	  var paths = Array.prototype.slice.call(arguments, 0);
	  return exports.normalize(filter(paths, function(p, index) {
	    if (typeof p !== 'string') {
	      throw new TypeError('Arguments to path.join must be strings');
	    }
	    return p;
	  }).join('/'));
	};


	// path.relative(from, to)
	// posix version
	exports.relative = function(from, to) {
	  from = exports.resolve(from).substr(1);
	  to = exports.resolve(to).substr(1);

	  function trim(arr) {
	    var start = 0;
	    for (; start < arr.length; start++) {
	      if (arr[start] !== '') break;
	    }

	    var end = arr.length - 1;
	    for (; end >= 0; end--) {
	      if (arr[end] !== '') break;
	    }

	    if (start > end) return [];
	    return arr.slice(start, end - start + 1);
	  }

	  var fromParts = trim(from.split('/'));
	  var toParts = trim(to.split('/'));

	  var length = Math.min(fromParts.length, toParts.length);
	  var samePartsLength = length;
	  for (var i = 0; i < length; i++) {
	    if (fromParts[i] !== toParts[i]) {
	      samePartsLength = i;
	      break;
	    }
	  }

	  var outputParts = [];
	  for (var i = samePartsLength; i < fromParts.length; i++) {
	    outputParts.push('..');
	  }

	  outputParts = outputParts.concat(toParts.slice(samePartsLength));

	  return outputParts.join('/');
	};

	exports.sep = '/';
	exports.delimiter = ':';

	exports.dirname = function(path) {
	  var result = splitPath(path),
	      root = result[0],
	      dir = result[1];

	  if (!root && !dir) {
	    // No dirname whatsoever
	    return '.';
	  }

	  if (dir) {
	    // It has a dirname, strip trailing slash
	    dir = dir.substr(0, dir.length - 1);
	  }

	  return root + dir;
	};


	exports.basename = function(path, ext) {
	  var f = splitPath(path)[2];
	  // TODO: make this comparison case-insensitive on windows?
	  if (ext && f.substr(-1 * ext.length) === ext) {
	    f = f.substr(0, f.length - ext.length);
	  }
	  return f;
	};


	exports.extname = function(path) {
	  return splitPath(path)[3];
	};

	function filter (xs, f) {
	    if (xs.filter) return xs.filter(f);
	    var res = [];
	    for (var i = 0; i < xs.length; i++) {
	        if (f(xs[i], i, xs)) res.push(xs[i]);
	    }
	    return res;
	}

	// String.prototype.substr - negative index don't work in IE8
	var substr = 'ab'.substr(-1) === 'b'
	    ? function (str, start, len) { return str.substr(start, len) }
	    : function (str, start, len) {
	        if (start < 0) start = str.length + start;
	        return str.substr(start, len);
	    }
	;

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(20)))

/***/ },
/* 78 */
/***/ function(module, exports, __webpack_require__) {

	
	/**
	 * Module dependencies.
	 */

	var eio = __webpack_require__(170);
	var Socket = __webpack_require__(80);
	var Emitter = __webpack_require__(56);
	var parser = __webpack_require__(40);
	var on = __webpack_require__(79);
	var bind = __webpack_require__(55);
	var debug = __webpack_require__(3)('socket.io-client:manager');
	var indexOf = __webpack_require__(71);
	var Backoff = __webpack_require__(126);

	/**
	 * IE6+ hasOwnProperty
	 */

	var has = Object.prototype.hasOwnProperty;

	/**
	 * Module exports
	 */

	module.exports = Manager;

	/**
	 * `Manager` constructor.
	 *
	 * @param {String} engine instance or engine uri/opts
	 * @param {Object} options
	 * @api public
	 */

	function Manager(uri, opts){
	  if (!(this instanceof Manager)) return new Manager(uri, opts);
	  if (uri && ('object' == typeof uri)) {
	    opts = uri;
	    uri = undefined;
	  }
	  opts = opts || {};

	  opts.path = opts.path || '/socket.io';
	  this.nsps = {};
	  this.subs = [];
	  this.opts = opts;
	  this.reconnection(opts.reconnection !== false);
	  this.reconnectionAttempts(opts.reconnectionAttempts || Infinity);
	  this.reconnectionDelay(opts.reconnectionDelay || 1000);
	  this.reconnectionDelayMax(opts.reconnectionDelayMax || 5000);
	  this.randomizationFactor(opts.randomizationFactor || 0.5);
	  this.backoff = new Backoff({
	    min: this.reconnectionDelay(),
	    max: this.reconnectionDelayMax(),
	    jitter: this.randomizationFactor()
	  });
	  this.timeout(null == opts.timeout ? 20000 : opts.timeout);
	  this.readyState = 'closed';
	  this.uri = uri;
	  this.connecting = [];
	  this.lastPing = null;
	  this.encoding = false;
	  this.packetBuffer = [];
	  this.encoder = new parser.Encoder();
	  this.decoder = new parser.Decoder();
	  this.autoConnect = opts.autoConnect !== false;
	  if (this.autoConnect) this.open();
	}

	/**
	 * Propagate given event to sockets and emit on `this`
	 *
	 * @api private
	 */

	Manager.prototype.emitAll = function() {
	  this.emit.apply(this, arguments);
	  for (var nsp in this.nsps) {
	    if (has.call(this.nsps, nsp)) {
	      this.nsps[nsp].emit.apply(this.nsps[nsp], arguments);
	    }
	  }
	};

	/**
	 * Update `socket.id` of all sockets
	 *
	 * @api private
	 */

	Manager.prototype.updateSocketIds = function(){
	  for (var nsp in this.nsps) {
	    if (has.call(this.nsps, nsp)) {
	      this.nsps[nsp].id = this.engine.id;
	    }
	  }
	};

	/**
	 * Mix in `Emitter`.
	 */

	Emitter(Manager.prototype);

	/**
	 * Sets the `reconnection` config.
	 *
	 * @param {Boolean} true/false if it should automatically reconnect
	 * @return {Manager} self or value
	 * @api public
	 */

	Manager.prototype.reconnection = function(v){
	  if (!arguments.length) return this._reconnection;
	  this._reconnection = !!v;
	  return this;
	};

	/**
	 * Sets the reconnection attempts config.
	 *
	 * @param {Number} max reconnection attempts before giving up
	 * @return {Manager} self or value
	 * @api public
	 */

	Manager.prototype.reconnectionAttempts = function(v){
	  if (!arguments.length) return this._reconnectionAttempts;
	  this._reconnectionAttempts = v;
	  return this;
	};

	/**
	 * Sets the delay between reconnections.
	 *
	 * @param {Number} delay
	 * @return {Manager} self or value
	 * @api public
	 */

	Manager.prototype.reconnectionDelay = function(v){
	  if (!arguments.length) return this._reconnectionDelay;
	  this._reconnectionDelay = v;
	  this.backoff && this.backoff.setMin(v);
	  return this;
	};

	Manager.prototype.randomizationFactor = function(v){
	  if (!arguments.length) return this._randomizationFactor;
	  this._randomizationFactor = v;
	  this.backoff && this.backoff.setJitter(v);
	  return this;
	};

	/**
	 * Sets the maximum delay between reconnections.
	 *
	 * @param {Number} delay
	 * @return {Manager} self or value
	 * @api public
	 */

	Manager.prototype.reconnectionDelayMax = function(v){
	  if (!arguments.length) return this._reconnectionDelayMax;
	  this._reconnectionDelayMax = v;
	  this.backoff && this.backoff.setMax(v);
	  return this;
	};

	/**
	 * Sets the connection timeout. `false` to disable
	 *
	 * @return {Manager} self or value
	 * @api public
	 */

	Manager.prototype.timeout = function(v){
	  if (!arguments.length) return this._timeout;
	  this._timeout = v;
	  return this;
	};

	/**
	 * Starts trying to reconnect if reconnection is enabled and we have not
	 * started reconnecting yet
	 *
	 * @api private
	 */

	Manager.prototype.maybeReconnectOnOpen = function() {
	  // Only try to reconnect if it's the first time we're connecting
	  if (!this.reconnecting && this._reconnection && this.backoff.attempts === 0) {
	    // keeps reconnection from firing twice for the same reconnection loop
	    this.reconnect();
	  }
	};


	/**
	 * Sets the current transport `socket`.
	 *
	 * @param {Function} optional, callback
	 * @return {Manager} self
	 * @api public
	 */

	Manager.prototype.open =
	Manager.prototype.connect = function(fn){
	  debug('readyState %s', this.readyState);
	  if (~this.readyState.indexOf('open')) return this;

	  debug('opening %s', this.uri);
	  this.engine = eio(this.uri, this.opts);
	  var socket = this.engine;
	  var self = this;
	  this.readyState = 'opening';
	  this.skipReconnect = false;

	  // emit `open`
	  var openSub = on(socket, 'open', function() {
	    self.onopen();
	    fn && fn();
	  });

	  // emit `connect_error`
	  var errorSub = on(socket, 'error', function(data){
	    debug('connect_error');
	    self.cleanup();
	    self.readyState = 'closed';
	    self.emitAll('connect_error', data);
	    if (fn) {
	      var err = new Error('Connection error');
	      err.data = data;
	      fn(err);
	    } else {
	      // Only do this if there is no fn to handle the error
	      self.maybeReconnectOnOpen();
	    }
	  });

	  // emit `connect_timeout`
	  if (false !== this._timeout) {
	    var timeout = this._timeout;
	    debug('connect attempt will timeout after %d', timeout);

	    // set timer
	    var timer = setTimeout(function(){
	      debug('connect attempt timed out after %d', timeout);
	      openSub.destroy();
	      socket.close();
	      socket.emit('error', 'timeout');
	      self.emitAll('connect_timeout', timeout);
	    }, timeout);

	    this.subs.push({
	      destroy: function(){
	        clearTimeout(timer);
	      }
	    });
	  }

	  this.subs.push(openSub);
	  this.subs.push(errorSub);

	  return this;
	};

	/**
	 * Called upon transport open.
	 *
	 * @api private
	 */

	Manager.prototype.onopen = function(){
	  debug('open');

	  // clear old subs
	  this.cleanup();

	  // mark as open
	  this.readyState = 'open';
	  this.emit('open');

	  // add new subs
	  var socket = this.engine;
	  this.subs.push(on(socket, 'data', bind(this, 'ondata')));
	  this.subs.push(on(socket, 'ping', bind(this, 'onping')));
	  this.subs.push(on(socket, 'pong', bind(this, 'onpong')));
	  this.subs.push(on(socket, 'error', bind(this, 'onerror')));
	  this.subs.push(on(socket, 'close', bind(this, 'onclose')));
	  this.subs.push(on(this.decoder, 'decoded', bind(this, 'ondecoded')));
	};

	/**
	 * Called upon a ping.
	 *
	 * @api private
	 */

	Manager.prototype.onping = function(){
	  this.lastPing = new Date;
	  this.emitAll('ping');
	};

	/**
	 * Called upon a packet.
	 *
	 * @api private
	 */

	Manager.prototype.onpong = function(){
	  this.emitAll('pong', new Date - this.lastPing);
	};

	/**
	 * Called with data.
	 *
	 * @api private
	 */

	Manager.prototype.ondata = function(data){
	  this.decoder.add(data);
	};

	/**
	 * Called when parser fully decodes a packet.
	 *
	 * @api private
	 */

	Manager.prototype.ondecoded = function(packet) {
	  this.emit('packet', packet);
	};

	/**
	 * Called upon socket error.
	 *
	 * @api private
	 */

	Manager.prototype.onerror = function(err){
	  debug('error', err);
	  this.emitAll('error', err);
	};

	/**
	 * Creates a new socket for the given `nsp`.
	 *
	 * @return {Socket}
	 * @api public
	 */

	Manager.prototype.socket = function(nsp){
	  var socket = this.nsps[nsp];
	  if (!socket) {
	    socket = new Socket(this, nsp);
	    this.nsps[nsp] = socket;
	    var self = this;
	    socket.on('connecting', onConnecting);
	    socket.on('connect', function(){
	      socket.id = self.engine.id;
	    });

	    if (this.autoConnect) {
	      // manually call here since connecting evnet is fired before listening
	      onConnecting();
	    }
	  }

	  function onConnecting() {
	    if (!~indexOf(self.connecting, socket)) {
	      self.connecting.push(socket);
	    }
	  }

	  return socket;
	};

	/**
	 * Called upon a socket close.
	 *
	 * @param {Socket} socket
	 */

	Manager.prototype.destroy = function(socket){
	  var index = indexOf(this.connecting, socket);
	  if (~index) this.connecting.splice(index, 1);
	  if (this.connecting.length) return;

	  this.close();
	};

	/**
	 * Writes a packet.
	 *
	 * @param {Object} packet
	 * @api private
	 */

	Manager.prototype.packet = function(packet){
	  debug('writing packet %j', packet);
	  var self = this;

	  if (!self.encoding) {
	    // encode, then write to engine with result
	    self.encoding = true;
	    this.encoder.encode(packet, function(encodedPackets) {
	      for (var i = 0; i < encodedPackets.length; i++) {
	        self.engine.write(encodedPackets[i], packet.options);
	      }
	      self.encoding = false;
	      self.processPacketQueue();
	    });
	  } else { // add packet to the queue
	    self.packetBuffer.push(packet);
	  }
	};

	/**
	 * If packet buffer is non-empty, begins encoding the
	 * next packet in line.
	 *
	 * @api private
	 */

	Manager.prototype.processPacketQueue = function() {
	  if (this.packetBuffer.length > 0 && !this.encoding) {
	    var pack = this.packetBuffer.shift();
	    this.packet(pack);
	  }
	};

	/**
	 * Clean up transport subscriptions and packet buffer.
	 *
	 * @api private
	 */

	Manager.prototype.cleanup = function(){
	  debug('cleanup');

	  var sub;
	  while (sub = this.subs.shift()) sub.destroy();

	  this.packetBuffer = [];
	  this.encoding = false;
	  this.lastPing = null;

	  this.decoder.destroy();
	};

	/**
	 * Close the current socket.
	 *
	 * @api private
	 */

	Manager.prototype.close =
	Manager.prototype.disconnect = function(){
	  debug('disconnect');
	  this.skipReconnect = true;
	  this.reconnecting = false;
	  if ('opening' == this.readyState) {
	    // `onclose` will not fire because
	    // an open event never happened
	    this.cleanup();
	  }
	  this.backoff.reset();
	  this.readyState = 'closed';
	  if (this.engine) this.engine.close();
	};

	/**
	 * Called upon engine close.
	 *
	 * @api private
	 */

	Manager.prototype.onclose = function(reason){
	  debug('onclose');

	  this.cleanup();
	  this.backoff.reset();
	  this.readyState = 'closed';
	  this.emit('close', reason);

	  if (this._reconnection && !this.skipReconnect) {
	    this.reconnect();
	  }
	};

	/**
	 * Attempt a reconnection.
	 *
	 * @api private
	 */

	Manager.prototype.reconnect = function(){
	  if (this.reconnecting || this.skipReconnect) return this;

	  var self = this;

	  if (this.backoff.attempts >= this._reconnectionAttempts) {
	    debug('reconnect failed');
	    this.backoff.reset();
	    this.emitAll('reconnect_failed');
	    this.reconnecting = false;
	  } else {
	    var delay = this.backoff.duration();
	    debug('will wait %dms before reconnect attempt', delay);

	    this.reconnecting = true;
	    var timer = setTimeout(function(){
	      if (self.skipReconnect) return;

	      debug('attempting reconnect');
	      self.emitAll('reconnect_attempt', self.backoff.attempts);
	      self.emitAll('reconnecting', self.backoff.attempts);

	      // check again for the case socket closed in above events
	      if (self.skipReconnect) return;

	      self.open(function(err){
	        if (err) {
	          debug('reconnect attempt error');
	          self.reconnecting = false;
	          self.reconnect();
	          self.emitAll('reconnect_error', err.data);
	        } else {
	          debug('reconnect success');
	          self.onreconnect();
	        }
	      });
	    }, delay);

	    this.subs.push({
	      destroy: function(){
	        clearTimeout(timer);
	      }
	    });
	  }
	};

	/**
	 * Called upon successful reconnect.
	 *
	 * @api private
	 */

	Manager.prototype.onreconnect = function(){
	  var attempt = this.backoff.attempts;
	  this.reconnecting = false;
	  this.backoff.reset();
	  this.updateSocketIds();
	  this.emitAll('reconnect', attempt);
	};


/***/ },
/* 79 */
/***/ function(module, exports) {

	
	/**
	 * Module exports.
	 */

	module.exports = on;

	/**
	 * Helper for subscriptions.
	 *
	 * @param {Object|EventEmitter} obj with `Emitter` mixin or `EventEmitter`
	 * @param {String} event name
	 * @param {Function} callback
	 * @api public
	 */

	function on(obj, ev, fn) {
	  obj.on(ev, fn);
	  return {
	    destroy: function(){
	      obj.removeListener(ev, fn);
	    }
	  };
	}


/***/ },
/* 80 */
/***/ function(module, exports, __webpack_require__) {

	
	/**
	 * Module dependencies.
	 */

	var parser = __webpack_require__(40);
	var Emitter = __webpack_require__(56);
	var toArray = __webpack_require__(201);
	var on = __webpack_require__(79);
	var bind = __webpack_require__(55);
	var debug = __webpack_require__(3)('socket.io-client:socket');
	var hasBin = __webpack_require__(179);

	/**
	 * Module exports.
	 */

	module.exports = exports = Socket;

	/**
	 * Internal events (blacklisted).
	 * These events can't be emitted by the user.
	 *
	 * @api private
	 */

	var events = {
	  connect: 1,
	  connect_error: 1,
	  connect_timeout: 1,
	  connecting: 1,
	  disconnect: 1,
	  error: 1,
	  reconnect: 1,
	  reconnect_attempt: 1,
	  reconnect_failed: 1,
	  reconnect_error: 1,
	  reconnecting: 1,
	  ping: 1,
	  pong: 1
	};

	/**
	 * Shortcut to `Emitter#emit`.
	 */

	var emit = Emitter.prototype.emit;

	/**
	 * `Socket` constructor.
	 *
	 * @api public
	 */

	function Socket(io, nsp){
	  this.io = io;
	  this.nsp = nsp;
	  this.json = this; // compat
	  this.ids = 0;
	  this.acks = {};
	  this.receiveBuffer = [];
	  this.sendBuffer = [];
	  this.connected = false;
	  this.disconnected = true;
	  if (this.io.autoConnect) this.open();
	}

	/**
	 * Mix in `Emitter`.
	 */

	Emitter(Socket.prototype);

	/**
	 * Subscribe to open, close and packet events
	 *
	 * @api private
	 */

	Socket.prototype.subEvents = function() {
	  if (this.subs) return;

	  var io = this.io;
	  this.subs = [
	    on(io, 'open', bind(this, 'onopen')),
	    on(io, 'packet', bind(this, 'onpacket')),
	    on(io, 'close', bind(this, 'onclose'))
	  ];
	};

	/**
	 * "Opens" the socket.
	 *
	 * @api public
	 */

	Socket.prototype.open =
	Socket.prototype.connect = function(){
	  if (this.connected) return this;

	  this.subEvents();
	  this.io.open(); // ensure open
	  if ('open' == this.io.readyState) this.onopen();
	  this.emit('connecting');
	  return this;
	};

	/**
	 * Sends a `message` event.
	 *
	 * @return {Socket} self
	 * @api public
	 */

	Socket.prototype.send = function(){
	  var args = toArray(arguments);
	  args.unshift('message');
	  this.emit.apply(this, args);
	  return this;
	};

	/**
	 * Override `emit`.
	 * If the event is in `events`, it's emitted normally.
	 *
	 * @param {String} event name
	 * @return {Socket} self
	 * @api public
	 */

	Socket.prototype.emit = function(ev){
	  if (events.hasOwnProperty(ev)) {
	    emit.apply(this, arguments);
	    return this;
	  }

	  var args = toArray(arguments);
	  var parserType = parser.EVENT; // default
	  if (hasBin(args)) { parserType = parser.BINARY_EVENT; } // binary
	  var packet = { type: parserType, data: args };

	  packet.options = {};
	  packet.options.compress = !this.flags || false !== this.flags.compress;

	  // event ack callback
	  if ('function' == typeof args[args.length - 1]) {
	    debug('emitting packet with ack id %d', this.ids);
	    this.acks[this.ids] = args.pop();
	    packet.id = this.ids++;
	  }

	  if (this.connected) {
	    this.packet(packet);
	  } else {
	    this.sendBuffer.push(packet);
	  }

	  delete this.flags;

	  return this;
	};

	/**
	 * Sends a packet.
	 *
	 * @param {Object} packet
	 * @api private
	 */

	Socket.prototype.packet = function(packet){
	  packet.nsp = this.nsp;
	  this.io.packet(packet);
	};

	/**
	 * Called upon engine `open`.
	 *
	 * @api private
	 */

	Socket.prototype.onopen = function(){
	  debug('transport is open - connecting');

	  // write connect packet if necessary
	  if ('/' != this.nsp) {
	    this.packet({ type: parser.CONNECT });
	  }
	};

	/**
	 * Called upon engine `close`.
	 *
	 * @param {String} reason
	 * @api private
	 */

	Socket.prototype.onclose = function(reason){
	  debug('close (%s)', reason);
	  this.connected = false;
	  this.disconnected = true;
	  delete this.id;
	  this.emit('disconnect', reason);
	};

	/**
	 * Called with socket packet.
	 *
	 * @param {Object} packet
	 * @api private
	 */

	Socket.prototype.onpacket = function(packet){
	  if (packet.nsp != this.nsp) return;

	  switch (packet.type) {
	    case parser.CONNECT:
	      this.onconnect();
	      break;

	    case parser.EVENT:
	      this.onevent(packet);
	      break;

	    case parser.BINARY_EVENT:
	      this.onevent(packet);
	      break;

	    case parser.ACK:
	      this.onack(packet);
	      break;

	    case parser.BINARY_ACK:
	      this.onack(packet);
	      break;

	    case parser.DISCONNECT:
	      this.ondisconnect();
	      break;

	    case parser.ERROR:
	      this.emit('error', packet.data);
	      break;
	  }
	};

	/**
	 * Called upon a server event.
	 *
	 * @param {Object} packet
	 * @api private
	 */

	Socket.prototype.onevent = function(packet){
	  var args = packet.data || [];
	  debug('emitting event %j', args);

	  if (null != packet.id) {
	    debug('attaching ack callback to event');
	    args.push(this.ack(packet.id));
	  }

	  if (this.connected) {
	    emit.apply(this, args);
	  } else {
	    this.receiveBuffer.push(args);
	  }
	};

	/**
	 * Produces an ack callback to emit with an event.
	 *
	 * @api private
	 */

	Socket.prototype.ack = function(id){
	  var self = this;
	  var sent = false;
	  return function(){
	    // prevent double callbacks
	    if (sent) return;
	    sent = true;
	    var args = toArray(arguments);
	    debug('sending ack %j', args);

	    var type = hasBin(args) ? parser.BINARY_ACK : parser.ACK;
	    self.packet({
	      type: type,
	      id: id,
	      data: args
	    });
	  };
	};

	/**
	 * Called upon a server acknowlegement.
	 *
	 * @param {Object} packet
	 * @api private
	 */

	Socket.prototype.onack = function(packet){
	  var ack = this.acks[packet.id];
	  if ('function' == typeof ack) {
	    debug('calling ack %s with %j', packet.id, packet.data);
	    ack.apply(this, packet.data);
	    delete this.acks[packet.id];
	  } else {
	    debug('bad ack %s', packet.id);
	  }
	};

	/**
	 * Called upon server connect.
	 *
	 * @api private
	 */

	Socket.prototype.onconnect = function(){
	  this.connected = true;
	  this.disconnected = false;
	  this.emit('connect');
	  this.emitBuffered();
	};

	/**
	 * Emit buffered events (received and emitted).
	 *
	 * @api private
	 */

	Socket.prototype.emitBuffered = function(){
	  var i;
	  for (i = 0; i < this.receiveBuffer.length; i++) {
	    emit.apply(this, this.receiveBuffer[i]);
	  }
	  this.receiveBuffer = [];

	  for (i = 0; i < this.sendBuffer.length; i++) {
	    this.packet(this.sendBuffer[i]);
	  }
	  this.sendBuffer = [];
	};

	/**
	 * Called upon server disconnect.
	 *
	 * @api private
	 */

	Socket.prototype.ondisconnect = function(){
	  debug('server disconnect (%s)', this.nsp);
	  this.destroy();
	  this.onclose('io server disconnect');
	};

	/**
	 * Called upon forced client/server side disconnections,
	 * this method ensures the manager stops tracking us and
	 * that reconnections don't get triggered for this.
	 *
	 * @api private.
	 */

	Socket.prototype.destroy = function(){
	  if (this.subs) {
	    // clean subscriptions to avoid reconnections
	    for (var i = 0; i < this.subs.length; i++) {
	      this.subs[i].destroy();
	    }
	    this.subs = null;
	  }

	  this.io.destroy(this);
	};

	/**
	 * Disconnects the socket manually.
	 *
	 * @return {Socket} self
	 * @api public
	 */

	Socket.prototype.close =
	Socket.prototype.disconnect = function(){
	  if (this.connected) {
	    debug('performing disconnect (%s)', this.nsp);
	    this.packet({ type: parser.DISCONNECT });
	  }

	  // remove socket from pool
	  this.destroy();

	  if (this.connected) {
	    // fire events
	    this.onclose('io client disconnect');
	  }
	  return this;
	};

	/**
	 * Sets the compress flag.
	 *
	 * @param {Boolean} if `true`, compresses the sending data
	 * @return {Socket} self
	 * @api public
	 */

	Socket.prototype.compress = function(compress){
	  this.flags = this.flags || {};
	  this.flags.compress = compress;
	  return this;
	};


/***/ },
/* 81 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {
	module.exports = isBuf;

	/**
	 * Returns true if obj is a buffer or an arraybuffer.
	 *
	 * @api private
	 */

	function isBuf(obj) {
	  return (global.Buffer && global.Buffer.isBuffer(obj)) ||
	         (global.ArrayBuffer && obj instanceof ArrayBuffer);
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 82 */
/***/ function(module, exports) {

	module.exports = Array.isArray || function (arr) {
	  return Object.prototype.toString.call(arr) == '[object Array]';
	};


/***/ },
/* 83 */
/***/ function(module, exports) {

	"use strict";
	'use strict';

	var alphabet = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_'.split('')
	  , length = 64
	  , map = {}
	  , seed = 0
	  , i = 0
	  , prev;

	/**
	 * Return a string representing the specified number.
	 *
	 * @param {Number} num The number to convert.
	 * @returns {String} The string representation of the number.
	 * @api public
	 */
	function encode(num) {
	  var encoded = '';

	  do {
	    encoded = alphabet[num % length] + encoded;
	    num = Math.floor(num / length);
	  } while (num > 0);

	  return encoded;
	}

	/**
	 * Return the integer value specified by the given string.
	 *
	 * @param {String} str The string to convert.
	 * @returns {Number} The integer value represented by the string.
	 * @api public
	 */
	function decode(str) {
	  var decoded = 0;

	  for (i = 0; i < str.length; i++) {
	    decoded = decoded * length + map[str.charAt(i)];
	  }

	  return decoded;
	}

	/**
	 * Yeast: A tiny growing id generator.
	 *
	 * @returns {String} A unique id.
	 * @api public
	 */
	function yeast() {
	  var now = encode(+new Date());

	  if (now !== prev) return seed = 0, prev = now;
	  return now +'.'+ encode(seed++);
	}

	//
	// Map each character to its index.
	//
	for (; i < length; i++) map[alphabet[i]] = i;

	//
	// Expose the `yeast`, `encode` and `decode` functions.
	//
	yeast.encode = encode;
	yeast.decode = decode;
	module.exports = yeast;


/***/ },
/* 84 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	var _stringify = __webpack_require__(51);

	var _stringify2 = _interopRequireDefault(_stringify);

	var _promise = __webpack_require__(52);

	var _promise2 = _interopRequireDefault(_promise);

	var _classCallCheck2 = __webpack_require__(53);

	var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);

	var _createClass2 = __webpack_require__(54);

	var _createClass3 = _interopRequireDefault(_createClass2);

	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

	var EventEmitter = __webpack_require__(37).EventEmitter;
	var Logger = __webpack_require__(21);
	var logger = Logger.create("orbit-db", { color: Logger.Colors.Magenta });
	var EventStore = __webpack_require__(75);
	var FeedStore = __webpack_require__(190);
	var KeyValueStore = __webpack_require__(192);
	var CounterStore = __webpack_require__(188);
	var PubSub = __webpack_require__(124);

	var OrbitDB = function () {
	  function OrbitDB(ipfs) {
	    (0, _classCallCheck3.default)(this, OrbitDB);

	    this._ipfs = ipfs;
	    this._pubsub = null;
	    this.user = null;
	    this.network = null;
	    this.events = new EventEmitter();
	    this.stores = {};
	  }

	  /* Databases */


	  (0, _createClass3.default)(OrbitDB, [{
	    key: 'feed',
	    value: function feed(dbname, options) {
	      return this._createStore(FeedStore, dbname, options);
	    }
	  }, {
	    key: 'eventlog',
	    value: function eventlog(dbname, options) {
	      return this._createStore(EventStore, dbname, options);
	    }
	  }, {
	    key: 'kvstore',
	    value: function kvstore(dbname, options) {
	      return this._createStore(KeyValueStore, dbname, options);
	    }
	  }, {
	    key: 'counter',
	    value: function counter(dbname, options) {
	      return this._createStore(CounterStore, dbname, options);
	    }
	  }, {
	    key: 'disconnect',
	    value: function disconnect() {
	      this._pubsub.disconnect();
	      this.stores = {};
	      this.user = null;
	      this.network = null;
	    }
	  }, {
	    key: '_createStore',
	    value: function _createStore(Store, dbname, options) {
	      if (!options) options = {};
	      var replicate = options.subscribe ? options.subscribe : true;
	      var store = new Store(this._ipfs, this.user.username, dbname, options);
	      this.stores[dbname] = store;
	      return this._subscribe(store, dbname, replicate);
	    }
	  }, {
	    key: '_subscribe',
	    value: function _subscribe(store, dbname, subscribe, callback) {
	      if (subscribe === undefined) subscribe = true;

	      store.events.on('load', this._onLoad.bind(this));
	      store.events.on('ready', this._onReady.bind(this));
	      store.events.on('sync', this._onSync.bind(this));
	      store.events.on('updated', this._onSynced.bind(this));
	      store.events.on('data', this._onWrite.bind(this));
	      store.events.on('close', this._onClose.bind(this));

	      if (subscribe) this._pubsub.subscribe(dbname, '', this._onMessage.bind(this));

	      return store.use(this.user.username);
	    }
	  }, {
	    key: '_onMessage',
	    value: function _onMessage(dbname, message) {
	      // console.log(".MESSAGE", dbname, message);
	      var store = this.stores[dbname];
	      store.sync(message).catch(function (e) {
	        return logger.error(e.stack);
	      });
	    }
	  }, {
	    key: '_onWrite',
	    value: function _onWrite(dbname, hash) {
	      // console.log(".WRITE", dbname);
	      if (!hash) throw new Error("Hash can't be null!");
	      this._pubsub.publish(dbname, hash);
	      this.events.emit('data', dbname, hash);
	    }
	  }, {
	    key: '_onSync',
	    value: function _onSync(dbname) {
	      // console.log(".SYNC", dbname);
	      this.events.emit('sync', dbname);
	    }
	  }, {
	    key: '_onSynced',
	    value: function _onSynced(dbname, items) {
	      // console.log(".SYNCED", dbname);
	      this.events.emit('synced', dbname, items);
	    }
	  }, {
	    key: '_onLoad',
	    value: function _onLoad(dbname) {
	      // console.log(".LOAD", dbname);
	      this.events.emit('load', dbname);
	    }
	  }, {
	    key: '_onReady',
	    value: function _onReady(dbname) {
	      // console.log(".READY", dbname);
	      this.events.emit('ready', this.stores[dbname]);
	    }
	  }, {
	    key: '_onClose',
	    value: function _onClose(dbname) {
	      this._pubsub.unsubscribe(dbname);
	      delete this.stores[dbname];
	      this.events.emit('closed', dbname);
	    }
	  }, {
	    key: '_connect',
	    value: function _connect(hash, username, password, allowOffline) {
	      var _this = this;

	      if (allowOffline === undefined) allowOffline = false;

	      var readNetworkInfo = function readNetworkInfo(hash) {
	        return new _promise2.default(function (resolve, reject) {
	          // this._ipfs.cat(hash).then((res) => {
	          //   let buf = '';
	          //   res
	          //     .on('error', (err) => reject(err))
	          //     .on('data', (data) => buf += data)
	          //     .on('end', () => resolve(buf))
	          // }).catch((e) => reject(e));
	          resolve((0, _stringify2.default)({
	            name: 'localhost dev network',
	            publishers: ['localhost:3333']
	          }));
	        });
	      };

	      var host = void 0,
	          port = void 0,
	          name = void 0;
	      return readNetworkInfo(hash).then(function (object) {
	        _this.network = JSON.parse(object);
	        name = _this.network.name;
	        host = _this.network.publishers[0].split(":")[0];
	        port = _this.network.publishers[0].split(":")[1];
	      }).then(function () {
	        _this._pubsub = new PubSub();
	        logger.warn('Connecting to Pubsub at \'' + host + ':' + port + '\'');
	        return _this._pubsub.connect(host, port, username, password);
	      }).then(function () {
	        logger.debug('Connected to Pubsub at \'' + host + ':' + port + '\'');
	        _this.user = { username: username, id: username }; // TODO: user id from ipfs hash
	        return;
	      }).catch(function (e) {
	        logger.warn("Couldn't connect to Pubsub: " + e.message);
	        if (!allowOffline) {
	          logger.debug("'allowOffline' set to false, terminating");
	          if (_this._pubsub) _this._pubsub.disconnect();
	          throw e;
	        }
	        _this.user = { username: username, id: username }; // TODO: user id from ipfs hash
	        return;
	      });
	    }
	  }]);
	  return OrbitDB;
	}();

	var OrbitClientFactory = function () {
	  function OrbitClientFactory() {
	    (0, _classCallCheck3.default)(this, OrbitClientFactory);
	  }

	  (0, _createClass3.default)(OrbitClientFactory, null, [{
	    key: 'connect',
	    value: function connect(network, username, password, ipfs, options) {
	      if (!options) options = { allowOffline: false };

	      if (!ipfs) {
	        logger.error("IPFS instance not provided");
	        throw new Error("IPFS instance not provided");
	      }

	      var client = new OrbitDB(ipfs);
	      return client._connect(network, username, password, options.allowOffline).then(function () {
	        return client;
	      });
	    }
	  }]);
	  return OrbitClientFactory;
	}();

	module.exports = OrbitClientFactory;

/***/ },
/* 85 */
/***/ function(module, exports, __webpack_require__) {

	var require;var Ipfs =
	/******/ (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] = {
	/******/ 			i: moduleId,
	/******/ 			l: false,
	/******/ 			exports: {}
	/******/ 		};

	/******/ 		// Execute the module function
	/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);

	/******/ 		// Flag the module as loaded
	/******/ 		module.l = 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 = "/_karma_webpack_//";

	/******/ 	// Load entry module and return exports
	/******/ 	return __webpack_require__(__webpack_require__.s = 797);
	/******/ })
	/************************************************************************/
	/******/ ([
	/* 0 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(359)
		var ieee754 = __webpack_require__(644)
		var isArray = __webpack_require__(43)

		exports.Buffer = Buffer
		exports.SlowBuffer = SlowBuffer
		exports.INSPECT_MAX_BYTES = 50

		/**
		 * 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.
		 *
		 *   - 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()

		/*
		 * Export kMaxLength after typed array support is determined.
		 */
		exports.kMaxLength = kMaxLength()

		function typedArraySupport () {
		  try {
		    var arr = new Uint8Array(1)
		    arr.foo = function () { return 42 }
		    return arr.foo() === 42 && // typed array instances can be augmented
		        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
		}

		function createBuffer (that, length) {
		  if (kMaxLength() < length) {
		    throw new RangeError('Invalid typed array length')
		  }
		  if (Buffer.TYPED_ARRAY_SUPPORT) {
		    // Return an augmented `Uint8Array` instance, for best performance
		    that = new Uint8Array(length)
		    that.__proto__ = Buffer.prototype
		  } else {
		    // Fallback: Return an object instance of the Buffer class
		    if (that === null) {
		      that = new Buffer(length)
		    }
		    that.length = length
		  }

		  return that
		}

		/**
		 * The Buffer constructor returns instances of `Uint8Array` that have their
		 * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
		 * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
		 * and the `Uint8Array` methods. Square bracket notation works as expected -- it
		 * returns a single octet.
		 *
		 * The `Uint8Array` prototype remains unmodified.
		 */

		function Buffer (arg, encodingOrOffset, length) {
		  if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {
		    return new Buffer(arg, encodingOrOffset, length)
		  }

		  // Common case.
		  if (typeof arg === 'number') {
		    if (typeof encodingOrOffset === 'string') {
		      throw new Error(
		        'If encoding is specified then the first argument must be a string'
		      )
		    }
		    return allocUnsafe(this, arg)
		  }
		  return from(this, arg, encodingOrOffset, length)
		}

		Buffer.poolSize = 8192 // not used by this implementation

		// TODO: Legacy, not needed anymore. Remove in next major version.
		Buffer._augment = function (arr) {
		  arr.__proto__ = Buffer.prototype
		  return arr
		}

		function from (that, value, encodingOrOffset, length) {
		  if (typeof value === 'number') {
		    throw new TypeError('"value" argument must not be a number')
		  }

		  if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {
		    return fromArrayBuffer(that, value, encodingOrOffset, length)
		  }

		  if (typeof value === 'string') {
		    return fromString(that, value, encodingOrOffset)
		  }

		  return fromObject(that, value)
		}

		/**
		 * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
		 * if value is a number.
		 * Buffer.from(str[, encoding])
		 * Buffer.from(array)
		 * Buffer.from(buffer)
		 * Buffer.from(arrayBuffer[, byteOffset[, length]])
		 **/
		Buffer.from = function (value, encodingOrOffset, length) {
		  return from(null, value, encodingOrOffset, length)
		}

		if (Buffer.TYPED_ARRAY_SUPPORT) {
		  Buffer.prototype.__proto__ = Uint8Array.prototype
		  Buffer.__proto__ = Uint8Array
		  if (typeof Symbol !== 'undefined' && Symbol.species &&
		      Buffer[Symbol.species] === Buffer) {
		    // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97
		    Object.defineProperty(Buffer, Symbol.species, {
		      value: null,
		      configurable: true
		    })
		  }
		}

		function assertSize (size) {
		  if (typeof size !== 'number') {
		    throw new TypeError('"size" argument must be a number')
		  }
		}

		function alloc (that, size, fill, encoding) {
		  assertSize(size)
		  if (size <= 0) {
		    return createBuffer(that, size)
		  }
		  if (fill !== undefined) {
		    // Only pay attention to encoding if it's a string. This
		    // prevents accidentally sending in a number that would
		    // be interpretted as a start offset.
		    return typeof encoding === 'string'
		      ? createBuffer(that, size).fill(fill, encoding)
		      : createBuffer(that, size).fill(fill)
		  }
		  return createBuffer(that, size)
		}

		/**
		 * Creates a new filled Buffer instance.
		 * alloc(size[, fill[, encoding]])
		 **/
		Buffer.alloc = function (size, fill, encoding) {
		  return alloc(null, size, fill, encoding)
		}

		function allocUnsafe (that, size) {
		  assertSize(size)
		  that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)
		  if (!Buffer.TYPED_ARRAY_SUPPORT) {
		    for (var i = 0; i < size; i++) {
		      that[i] = 0
		    }
		  }
		  return that
		}

		/**
		 * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
		 * */
		Buffer.allocUnsafe = function (size) {
		  return allocUnsafe(null, size)
		}
		/**
		 * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
		 */
		Buffer.allocUnsafeSlow = function (size) {
		  return allocUnsafe(null, size)
		}

		function fromString (that, string, encoding) {
		  if (typeof encoding !== 'string' || encoding === '') {
		    encoding = 'utf8'
		  }

		  if (!Buffer.isEncoding(encoding)) {
		    throw new TypeError('"encoding" must be a valid string encoding')
		  }

		  var length = byteLength(string, encoding) | 0
		  that = createBuffer(that, length)

		  that.write(string, encoding)
		  return that
		}

		function fromArrayLike (that, array) {
		  var length = checked(array.length) | 0
		  that = createBuffer(that, length)
		  for (var i = 0; i < length; i += 1) {
		    that[i] = array[i] & 255
		  }
		  return that
		}

		function fromArrayBuffer (that, array, byteOffset, length) {
		  array.byteLength // this throws if `array` is not a valid ArrayBuffer

		  if (byteOffset < 0 || array.byteLength < byteOffset) {
		    throw new RangeError('\'offset\' is out of bounds')
		  }

		  if (array.byteLength < byteOffset + (length || 0)) {
		    throw new RangeError('\'length\' is out of bounds')
		  }

		  if (length === undefined) {
		    array = new Uint8Array(array, byteOffset)
		  } else {
		    array = new Uint8Array(array, byteOffset, length)
		  }

		  if (Buffer.TYPED_ARRAY_SUPPORT) {
		    // Return an augmented `Uint8Array` instance, for best performance
		    that = array
		    that.__proto__ = Buffer.prototype
		  } else {
		    // Fallback: Return an object instance of the Buffer class
		    that = fromArrayLike(that, array)
		  }
		  return that
		}

		function fromObject (that, obj) {
		  if (Buffer.isBuffer(obj)) {
		    var len = checked(obj.length) | 0
		    that = createBuffer(that, len)

		    if (that.length === 0) {
		      return that
		    }

		    obj.copy(that, 0, 0, len)
		    return that
		  }

		  if (obj) {
		    if ((typeof ArrayBuffer !== 'undefined' &&
		        obj.buffer instanceof ArrayBuffer) || 'length' in obj) {
		      if (typeof obj.length !== 'number' || isnan(obj.length)) {
		        return createBuffer(that, 0)
		      }
		      return fromArrayLike(that, obj)
		    }

		    if (obj.type === 'Buffer' && isArray(obj.data)) {
		      return fromArrayLike(that, obj.data)
		    }
		  }

		  throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')
		}

		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 (length) {
		  if (+length != length) { // eslint-disable-line eqeqeq
		    length = 0
		  }
		  return Buffer.alloc(+length)
		}

		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

		  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
		    if (a[i] !== b[i]) {
		      x = a[i]
		      y = b[i]
		      break
		    }
		  }

		  if (x < y) return -1
		  if (y < x) return 1
		  return 0
		}

		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 Buffer.alloc(0)
		  }

		  var i
		  if (length === undefined) {
		    length = 0
		    for (i = 0; i < list.length; i++) {
		      length += list[i].length
		    }
		  }

		  var buffer = Buffer.allocUnsafe(length)
		  var pos = 0
		  for (i = 0; i < list.length; i++) {
		    var buf = list[i]
		    if (!Buffer.isBuffer(buf)) {
		      throw new TypeError('"list" argument must be an Array of Buffers')
		    }
		    buf.copy(buffer, pos)
		    pos += buf.length
		  }
		  return buffer
		}

		function byteLength (string, encoding) {
		  if (Buffer.isBuffer(string)) {
		    return string.length
		  }
		  if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&
		      (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {
		    return string.byteLength
		  }
		  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':
		      case undefined:
		        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

		  // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
		  // property of a typed array.

		  // This behaves neither like String nor Uint8Array in that we set start/end
		  // to their upper/lower bounds if the value passed is out of range.
		  // undefined is handled specially as per ECMA-262 6th Edition,
		  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
		  if (start === undefined || start < 0) {
		    start = 0
		  }
		  // Return early if start > this.length. Done here to prevent potential uint32
		  // coercion fail below.
		  if (start > this.length) {
		    return ''
		  }

		  if (end === undefined || end > this.length) {
		    end = this.length
		  }

		  if (end <= 0) {
		    return ''
		  }

		  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.
		  end >>>= 0
		  start >>>= 0

		  if (end <= start) {
		    return ''
		  }

		  if (!encoding) encoding = 'utf8'

		  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
		    }
		  }
		}

		// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect
		// Buffer instances.
		Buffer.prototype._isBuffer = true

		function swap (b, n, m) {
		  var i = b[n]
		  b[n] = b[m]
		  b[m] = i
		}

		Buffer.prototype.swap16 = function swap16 () {
		  var len = this.length
		  if (len % 2 !== 0) {
		    throw new RangeError('Buffer size must be a multiple of 16-bits')
		  }
		  for (var i = 0; i < len; i += 2) {
		    swap(this, i, i + 1)
		  }
		  return this
		}

		Buffer.prototype.swap32 = function swap32 () {
		  var len = this.length
		  if (len % 4 !== 0) {
		    throw new RangeError('Buffer size must be a multiple of 32-bits')
		  }
		  for (var i = 0; i < len; i += 4) {
		    swap(this, i, i + 3)
		    swap(this, i + 1, i + 2)
		  }
		  return this
		}

		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 (target, start, end, thisStart, thisEnd) {
		  if (!Buffer.isBuffer(target)) {
		    throw new TypeError('Argument must be a Buffer')
		  }

		  if (start === undefined) {
		    start = 0
		  }
		  if (end === undefined) {
		    end = target ? target.length : 0
		  }
		  if (thisStart === undefined) {
		    thisStart = 0
		  }
		  if (thisEnd === undefined) {
		    thisEnd = this.length
		  }

		  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {
		    throw new RangeError('out of range index')
		  }

		  if (thisStart >= thisEnd && start >= end) {
		    return 0
		  }
		  if (thisStart >= thisEnd) {
		    return -1
		  }
		  if (start >= end) {
		    return 1
		  }

		  start >>>= 0
		  end >>>= 0
		  thisStart >>>= 0
		  thisEnd >>>= 0

		  if (this === target) return 0

		  var x = thisEnd - thisStart
		  var y = end - start
		  var len = Math.min(x, y)

		  var thisCopy = this.slice(thisStart, thisEnd)
		  var targetCopy = target.slice(start, end)

		  for (var i = 0; i < len; ++i) {
		    if (thisCopy[i] !== targetCopy[i]) {
		      x = thisCopy[i]
		      y = targetCopy[i]
		      break
		    }
		  }

		  if (x < y) return -1
		  if (y < x) return 1
		  return 0
		}

		function arrayIndexOf (arr, val, byteOffset, encoding) {
		  var indexSize = 1
		  var arrLength = arr.length
		  var valLength = val.length

		  if (encoding !== undefined) {
		    encoding = String(encoding).toLowerCase()
		    if (encoding === 'ucs2' || encoding === 'ucs-2' ||
		        encoding === 'utf16le' || encoding === 'utf-16le') {
		      if (arr.length < 2 || val.length < 2) {
		        return -1
		      }
		      indexSize = 2
		      arrLength /= 2
		      valLength /= 2
		      byteOffset /= 2
		    }
		  }

		  function read (buf, i) {
		    if (indexSize === 1) {
		      return buf[i]
		    } else {
		      return buf.readUInt16BE(i * indexSize)
		    }
		  }

		  var foundIndex = -1
		  for (var i = 0; byteOffset + i < arrLength; i++) {
		    if (read(arr, byteOffset + i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
		      if (foundIndex === -1) foundIndex = i
		      if (i - foundIndex + 1 === valLength) return (byteOffset + foundIndex) * indexSize
		    } else {
		      if (foundIndex !== -1) i -= i - foundIndex
		      foundIndex = -1
		    }
		  }
		  return -1
		}

		Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {
		  if (typeof byteOffset === 'string') {
		    encoding = byteOffset
		    byteOffset = 0
		  } else 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') {
		    val = Buffer.from(val, encoding)
		  }

		  if (Buffer.isBuffer(val)) {
		    // special case: looking for empty string/buffer always fails
		    if (val.length === 0) {
		      return -1
		    }
		    return arrayIndexOf(this, val, byteOffset, encoding)
		  }
		  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, encoding)
		  }

		  throw new TypeError('val must be string, number or Buffer')
		}

		Buffer.prototype.includes = function includes (val, byteOffset, encoding) {
		  return this.indexOf(val, byteOffset, encoding) !== -1
		}

		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)) return i
		    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 {
		    throw new Error(
		      'Buffer.write(string, encoding, offset[, length]) is no longer supported'
		    )
		  }

		  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 = this.subarray(start, end)
		    newBuf.__proto__ = Buffer.prototype
		  } else {
		    var sliceLen = end - start
		    newBuf = new Buffer(sliceLen, undefined)
		    for (var i = 0; i < sliceLen; i++) {
		      newBuf[i] = this[i + start]
		    }
		  }

		  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" argument must be a Buffer instance')
		  if (value > max || value < min) throw new RangeError('"value" argument 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) {
		    var maxBytes = Math.pow(2, 8 * byteLength) - 1
		    checkInt(this, value, offset, byteLength, maxBytes, 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) {
		    var maxBytes = Math.pow(2, 8 * byteLength) - 1
		    checkInt(this, value, offset, byteLength, maxBytes, 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 = 0
		  this[offset] = value & 0xFF
		  while (++i < byteLength && (mul *= 0x100)) {
		    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
		      sub = 1
		    }
		    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 = 0
		  this[offset + i] = value & 0xFF
		  while (--i >= 0 && (mul *= 0x100)) {
		    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
		      sub = 1
		    }
		    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 (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 {
		    Uint8Array.prototype.set.call(
		      target,
		      this.subarray(start, start + len),
		      targetStart
		    )
		  }

		  return len
		}

		// Usage:
		//    buffer.fill(number[, offset[, end]])
		//    buffer.fill(buffer[, offset[, end]])
		//    buffer.fill(string[, offset[, end]][, encoding])
		Buffer.prototype.fill = function fill (val, start, end, encoding) {
		  // Handle string cases:
		  if (typeof val === 'string') {
		    if (typeof start === 'string') {
		      encoding = start
		      start = 0
		      end = this.length
		    } else if (typeof end === 'string') {
		      encoding = end
		      end = this.length
		    }
		    if (val.length === 1) {
		      var code = val.charCodeAt(0)
		      if (code < 256) {
		        val = code
		      }
		    }
		    if (encoding !== undefined && typeof encoding !== 'string') {
		      throw new TypeError('encoding must be a string')
		    }
		    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {
		      throw new TypeError('Unknown encoding: ' + encoding)
		    }
		  } else if (typeof val === 'number') {
		    val = val & 255
		  }

		  // Invalid ranges are not set to a default, so can range check early.
		  if (start < 0 || this.length < start || this.length < end) {
		    throw new RangeError('Out of range index')
		  }

		  if (end <= start) {
		    return this
		  }

		  start = start >>> 0
		  end = end === undefined ? this.length : end >>> 0

		  if (!val) val = 0

		  var i
		  if (typeof val === 'number') {
		    for (i = start; i < end; i++) {
		      this[i] = val
		    }
		  } else {
		    var bytes = Buffer.isBuffer(val)
		      ? val
		      : utf8ToBytes(new Buffer(val, encoding).toString())
		    var len = bytes.length
		    for (i = 0; i < end - start; i++) {
		      this[i + start] = bytes[i % len]
		    }
		  }

		  return this
		}

		// HELPER FUNCTIONS
		// ================

		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
		}

		function isnan (val) {
		  return val !== val // eslint-disable-line no-self-compare
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer, __webpack_require__(18)))

	/***/ },
	/* 1 */
	/***/ function(module, exports, __webpack_require__) {

		var global    = __webpack_require__(8)
		  , core      = __webpack_require__(40)
		  , hide      = __webpack_require__(25)
		  , redefine  = __webpack_require__(28)
		  , ctx       = __webpack_require__(44)
		  , PROTOTYPE = 'prototype';

		var $export = function(type, name, source){
		  var IS_FORCED = type & $export.F
		    , IS_GLOBAL = type & $export.G
		    , IS_STATIC = type & $export.S
		    , IS_PROTO  = type & $export.P
		    , IS_BIND   = type & $export.B
		    , target    = IS_GLOBAL ? global : IS_STATIC ? global[name] || (global[name] = {}) : (global[name] || {})[PROTOTYPE]
		    , exports   = IS_GLOBAL ? core : core[name] || (core[name] = {})
		    , expProto  = exports[PROTOTYPE] || (exports[PROTOTYPE] = {})
		    , key, own, out, exp;
		  if(IS_GLOBAL)source = name;
		  for(key in source){
		    // contains in native
		    own = !IS_FORCED && target && target[key] !== undefined;
		    // export native or passed
		    out = (own ? target : source)[key];
		    // bind timers to global for call from export context
		    exp = IS_BIND && own ? ctx(out, global) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;
		    // extend global
		    if(target)redefine(target, key, out, type & $export.U);
		    // export
		    if(exports[key] != out)hide(exports, key, exp);
		    if(IS_PROTO && expProto[key] != out)expProto[key] = out;
		  }
		};
		global.core = core;
		// type bitmap
		$export.F = 1;   // forced
		$export.G = 2;   // global
		$export.S = 4;   // static
		$export.P = 8;   // proto
		$export.B = 16;  // bind
		$export.W = 32;  // wrap
		$export.U = 64;  // safe
		$export.R = 128; // real proto method for `library` 
		module.exports = $export;

	/***/ },
	/* 2 */
	/***/ 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
		  }
		}


	/***/ },
	/* 3 */
	/***/ 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() {
		    if (!draining || !currentQueue) {
		        return;
		    }
		    draining = false;
		    if (currentQueue.length) {
		        queue = currentQueue.concat(queue);
		    } else {
		        queueIndex = -1;
		    }
		    if (queue.length) {
		        drainQueue();
		    }
		}

		function drainQueue() {
		    if (draining) {
		        return;
		    }
		    var timeout = 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; };


	/***/ },
	/* 4 */
	/***/ 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__(0).Buffer))

	/***/ },
	/* 5 */
	/***/ 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__(7).EventEmitter;
		var inherits = __webpack_require__(2);

		inherits(Stream, EE);
		Stream.Readable = __webpack_require__(770);
		Stream.Writable = __webpack_require__(772);
		Stream.Duplex = __webpack_require__(768);
		Stream.Transform = __webpack_require__(771);
		Stream.PassThrough = __webpack_require__(769);

		// 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;
		};


	/***/ },
	/* 6 */
	/***/ function(module, exports, __webpack_require__) {

		var isObject = __webpack_require__(12);
		module.exports = function(it){
		  if(!isObject(it))throw TypeError(it + ' is not an object!');
		  return it;
		};

	/***/ },
	/* 7 */
	/***/ function(module, exports) {

		// Copyright Joyent, Inc. and other Node contributors.
		//
		// Permission is hereby granted, free of charge, to any person obtaining a
		// copy of this software and associated documentation files (the
		// "Software"), to deal in the Software without restriction, including
		// without limitation the rights to use, copy, modify, merge, publish,
		// distribute, sublicense, and/or sell copies of the Software, and to permit
		// persons to whom the Software is furnished to do so, subject to the
		// following conditions:
		//
		// The above copyright notice and this permission notice shall be included
		// in all copies or substantial portions of the Software.
		//
		// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
		// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
		// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
		// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
		// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
		// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
		// USE OR OTHER DEALINGS IN THE SOFTWARE.

		function EventEmitter() {
		  this._events = this._events || {};
		  this._maxListeners = this._maxListeners || undefined;
		}
		module.exports = EventEmitter;

		// Backwards-compat with node 0.10.x
		EventEmitter.EventEmitter = EventEmitter;

		EventEmitter.prototype._events = undefined;
		EventEmitter.prototype._maxListeners = undefined;

		// By default EventEmitters will print a warning if more than 10 listeners are
		// added to it. This is a useful default which helps finding memory leaks.
		EventEmitter.defaultMaxListeners = 10;

		// Obviously not all Emitters should be limited to 10. This function allows
		// that to be increased. Set to zero for unlimited.
		EventEmitter.prototype.setMaxListeners = function(n) {
		  if (!isNumber(n) || n < 0 || isNaN(n))
		    throw TypeError('n must be a positive number');
		  this._maxListeners = n;
		  return this;
		};

		EventEmitter.prototype.emit = function(type) {
		  var er, handler, len, args, i, listeners;

		  if (!this._events)
		    this._events = {};

		  // If there is no 'error' event listener then throw.
		  if (type === 'error') {
		    if (!this._events.error ||
		        (isObject(this._events.error) && !this._events.error.length)) {
		      er = arguments[1];
		      if (er instanceof Error) {
		        throw er; // Unhandled 'error' event
		      }
		      throw TypeError('Uncaught, unspecified "error" event.');
		    }
		  }

		  handler = this._events[type];

		  if (isUndefined(handler))
		    return false;

		  if (isFunction(handler)) {
		    switch (arguments.length) {
		      // fast cases
		      case 1:
		        handler.call(this);
		        break;
		      case 2:
		        handler.call(this, arguments[1]);
		        break;
		      case 3:
		        handler.call(this, arguments[1], arguments[2]);
		        break;
		      // slower
		      default:
		        args = Array.prototype.slice.call(arguments, 1);
		        handler.apply(this, args);
		    }
		  } else if (isObject(handler)) {
		    args = Array.prototype.slice.call(arguments, 1);
		    listeners = handler.slice();
		    len = listeners.length;
		    for (i = 0; i < len; i++)
		      listeners[i].apply(this, args);
		  }

		  return true;
		};

		EventEmitter.prototype.addListener = function(type, listener) {
		  var m;

		  if (!isFunction(listener))
		    throw TypeError('listener must be a function');

		  if (!this._events)
		    this._events = {};

		  // To avoid recursion in the case that type === "newListener"! Before
		  // adding it to the listeners, first emit "newListener".
		  if (this._events.newListener)
		    this.emit('newListener', type,
		              isFunction(listener.listener) ?
		              listener.listener : listener);

		  if (!this._events[type])
		    // Optimize the case of one listener. Don't need the extra array object.
		    this._events[type] = listener;
		  else if (isObject(this._events[type]))
		    // If we've already got an array, just append.
		    this._events[type].push(listener);
		  else
		    // Adding the second element, need to change to array.
		    this._events[type] = [this._events[type], listener];

		  // Check for listener leak
		  if (isObject(this._events[type]) && !this._events[type].warned) {
		    if (!isUndefined(this._maxListeners)) {
		      m = this._maxListeners;
		    } else {
		      m = EventEmitter.defaultMaxListeners;
		    }

		    if (m && m > 0 && this._events[type].length > m) {
		      this._events[type].warned = true;
		      console.error('(node) warning: possible EventEmitter memory ' +
		                    'leak detected. %d listeners added. ' +
		                    'Use emitter.setMaxListeners() to increase limit.',
		                    this._events[type].length);
		      if (typeof console.trace === 'function') {
		        // not supported in IE 10
		        console.trace();
		      }
		    }
		  }

		  return this;
		};

		EventEmitter.prototype.on = EventEmitter.prototype.addListener;

		EventEmitter.prototype.once = function(type, listener) {
		  if (!isFunction(listener))
		    throw TypeError('listener must be a function');

		  var fired = false;

		  function g() {
		    this.removeListener(type, g);

		    if (!fired) {
		      fired = true;
		      listener.apply(this, arguments);
		    }
		  }

		  g.listener = listener;
		  this.on(type, g);

		  return this;
		};

		// emits a 'removeListener' event iff the listener was removed
		EventEmitter.prototype.removeListener = function(type, listener) {
		  var list, position, length, i;

		  if (!isFunction(listener))
		    throw TypeError('listener must be a function');

		  if (!this._events || !this._events[type])
		    return this;

		  list = this._events[type];
		  length = list.length;
		  position = -1;

		  if (list === listener ||
		      (isFunction(list.listener) && list.listener === listener)) {
		    delete this._events[type];
		    if (this._events.removeListener)
		      this.emit('removeListener', type, listener);

		  } else if (isObject(list)) {
		    for (i = length; i-- > 0;) {
		      if (list[i] === listener ||
		          (list[i].listener && list[i].listener === listener)) {
		        position = i;
		        break;
		      }
		    }

		    if (position < 0)
		      return this;

		    if (list.length === 1) {
		      list.length = 0;
		      delete this._events[type];
		    } else {
		      list.splice(position, 1);
		    }

		    if (this._events.removeListener)
		      this.emit('removeListener', type, listener);
		  }

		  return this;
		};

		EventEmitter.prototype.removeAllListeners = function(type) {
		  var key, listeners;

		  if (!this._events)
		    return this;

		  // not listening for removeListener, no need to emit
		  if (!this._events.removeListener) {
		    if (arguments.length === 0)
		      this._events = {};
		    else if (this._events[type])
		      delete this._events[type];
		    return this;
		  }

		  // emit removeListener for all listeners on all events
		  if (arguments.length === 0) {
		    for (key in this._events) {
		      if (key === 'removeListener') continue;
		      this.removeAllListeners(key);
		    }
		    this.removeAllListeners('removeListener');
		    this._events = {};
		    return this;
		  }

		  listeners = this._events[type];

		  if (isFunction(listeners)) {
		    this.removeListener(type, listeners);
		  } else if (listeners) {
		    // LIFO order
		    while (listeners.length)
		      this.removeListener(type, listeners[listeners.length - 1]);
		  }
		  delete this._events[type];

		  return this;
		};

		EventEmitter.prototype.listeners = function(type) {
		  var ret;
		  if (!this._events || !this._events[type])
		    ret = [];
		  else if (isFunction(this._events[type]))
		    ret = [this._events[type]];
		  else
		    ret = this._events[type].slice();
		  return ret;
		};

		EventEmitter.prototype.listenerCount = function(type) {
		  if (this._events) {
		    var evlistener = this._events[type];

		    if (isFunction(evlistener))
		      return 1;
		    else if (evlistener)
		      return evlistener.length;
		  }
		  return 0;
		};

		EventEmitter.listenerCount = function(emitter, type) {
		  return emitter.listenerCount(type);
		};

		function isFunction(arg) {
		  return typeof arg === 'function';
		}

		function isNumber(arg) {
		  return typeof arg === 'number';
		}

		function isObject(arg) {
		  return typeof arg === 'object' && arg !== null;
		}

		function isUndefined(arg) {
		  return arg === void 0;
		}


	/***/ },
	/* 8 */
	/***/ function(module, exports) {

		// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028
		var global = module.exports = typeof window != 'undefined' && window.Math == Math
		  ? window : typeof self != 'undefined' && self.Math == Math ? self : Function('return this')();
		if(typeof __g == 'number')__g = global; // eslint-disable-line no-undef

	/***/ },
	/* 9 */
	/***/ function(module, exports) {

		module.exports = function(exec){
		  try {
		    return !!exec();
		  } catch(e){
		    return true;
		  }
		};

	/***/ },
	/* 10 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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, arg1, arg2, arg3) {
		  if (typeof fn !== 'function') {
		    throw new TypeError('"callback" argument must be a function');
		  }
		  var len = arguments.length;
		  var args, i;
		  switch (len) {
		  case 0:
		  case 1:
		    return process.nextTick(fn);
		  case 2:
		    return process.nextTick(function afterTickOne() {
		      fn.call(null, arg1);
		    });
		  case 3:
		    return process.nextTick(function afterTickTwo() {
		      fn.call(null, arg1, arg2);
		    });
		  case 4:
		    return process.nextTick(function afterTickThree() {
		      fn.call(null, arg1, arg2, arg3);
		    });
		  default:
		    args = new Array(len - 1);
		    i = 0;
		    while (i < args.length) {
		      args[i++] = arguments[i];
		    }
		    return process.nextTick(function afterTick() {
		      fn.apply(null, args);
		    });
		  }
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 11 */
	/***/ 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__(779);

		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__(2);

		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, __webpack_require__(18), __webpack_require__(3)))

	/***/ },
	/* 12 */
	/***/ function(module, exports) {

		module.exports = function(it){
		  return typeof it === 'object' ? it !== null : typeof it === 'function';
		};

	/***/ },
	/* 13 */
	/***/ function(module, exports, __webpack_require__) {

		var store      = __webpack_require__(113)('wks')
		  , uid        = __webpack_require__(61)
		  , Symbol     = __webpack_require__(8).Symbol
		  , USE_SYMBOL = typeof Symbol == 'function';

		var $exports = module.exports = function(name){
		  return store[name] || (store[name] =
		    USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));
		};

		$exports.store = store;

	/***/ },
	/* 14 */
	/***/ 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__(0).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;
		}


	/***/ },
	/* 15 */
	/***/ function(module, exports, __webpack_require__) {

		// Thank's IE8 for his funny defineProperty
		module.exports = !__webpack_require__(9)(function(){
		  return Object.defineProperty({}, 'a', {get: function(){ return 7; }}).a != 7;
		});

	/***/ },
	/* 16 */
	/***/ function(module, exports, __webpack_require__) {

		var anObject       = __webpack_require__(6)
		  , IE8_DOM_DEFINE = __webpack_require__(218)
		  , toPrimitive    = __webpack_require__(42)
		  , dP             = Object.defineProperty;

		exports.f = __webpack_require__(15) ? Object.defineProperty : function defineProperty(O, P, Attributes){
		  anObject(O);
		  P = toPrimitive(P, true);
		  anObject(Attributes);
		  if(IE8_DOM_DEFINE)try {
		    return dP(O, P, Attributes);
		  } catch(e){ /* empty */ }
		  if('get' in Attributes || 'set' in Attributes)throw TypeError('Accessors not supported!');
		  if('value' in Attributes)O[P] = Attributes.value;
		  return O;
		};

	/***/ },
	/* 17 */
	/***/ function(module, exports, __webpack_require__) {

		
		/**
		 * This is the web browser implementation of `debug()`.
		 *
		 * Expose `debug()` as the module.
		 */

		exports = module.exports = __webpack_require__(591);
		exports.log = log;
		exports.formatArgs = formatArgs;
		exports.save = save;
		exports.load = load;
		exports.useColors = useColors;
		exports.storage = 'undefined' != typeof chrome
		               && 'undefined' != typeof chrome.storage
		                  ? chrome.storage.local
		                  : localstorage();

		/**
		 * Colors.
		 */

		exports.colors = [
		  'lightseagreen',
		  'forestgreen',
		  'goldenrod',
		  'dodgerblue',
		  'darkorchid',
		  'crimson'
		];

		/**
		 * Currently only WebKit-based Web Inspectors, Firefox >= v31,
		 * and the Firebug extension (any Firefox version) are known
		 * to support "%c" CSS customizations.
		 *
		 * TODO: add a `localStorage` variable to explicitly enable/disable colors
		 */

		function useColors() {
		  // is webkit? http://stackoverflow.com/a/16459606/376773
		  return ('WebkitAppearance' in document.documentElement.style) ||
		    // is firebug? http://stackoverflow.com/a/398120/376773
		    (window.console && (console.firebug || (console.exception && console.table))) ||
		    // is firefox >= v31?
		    // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages
		    (navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/) && parseInt(RegExp.$1, 10) >= 31);
		}

		/**
		 * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.
		 */

		exports.formatters.j = function(v) {
		  return JSON.stringify(v);
		};


		/**
		 * Colorize log arguments if enabled.
		 *
		 * @api public
		 */

		function formatArgs() {
		  var args = arguments;
		  var useColors = this.useColors;

		  args[0] = (useColors ? '%c' : '')
		    + this.namespace
		    + (useColors ? ' %c' : ' ')
		    + args[0]
		    + (useColors ? '%c ' : ' ')
		    + '+' + exports.humanize(this.diff);

		  if (!useColors) return args;

		  var c = 'color: ' + this.color;
		  args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));

		  // the final "%c" is somewhat tricky, because there could be other
		  // arguments passed either before or after the %c, so we need to
		  // figure out the correct index to insert the CSS into
		  var index = 0;
		  var lastC = 0;
		  args[0].replace(/%[a-z%]/g, function(match) {
		    if ('%%' === match) return;
		    index++;
		    if ('%c' === match) {
		      // we only are interested in the *last* %c
		      // (the user may have provided their own)
		      lastC = index;
		    }
		  });

		  args.splice(lastC, 0, c);
		  return args;
		}

		/**
		 * Invokes `console.log()` when available.
		 * No-op when `console.log` is not a "function".
		 *
		 * @api public
		 */

		function log() {
		  // this hackery is required for IE8/9, where
		  // the `console.log` function doesn't have 'apply'
		  return 'object' === typeof console
		    && console.log
		    && Function.prototype.apply.call(console.log, console, arguments);
		}

		/**
		 * Save `namespaces`.
		 *
		 * @param {String} namespaces
		 * @api private
		 */

		function save(namespaces) {
		  try {
		    if (null == namespaces) {
		      exports.storage.removeItem('debug');
		    } else {
		      exports.storage.debug = namespaces;
		    }
		  } catch(e) {}
		}

		/**
		 * Load `namespaces`.
		 *
		 * @return {String} returns the previously persisted debug modes
		 * @api private
		 */

		function load() {
		  var r;
		  try {
		    r = exports.storage.debug;
		  } catch(e) {}
		  return r;
		}

		/**
		 * Enable namespaces listed in `localStorage.debug` initially.
		 */

		exports.enable(load());

		/**
		 * Localstorage attempts to return the localstorage.
		 *
		 * This is necessary because safari throws
		 * when a user disables cookies/localstorage
		 * and you attempt to access it.
		 *
		 * @return {LocalStorage}
		 * @api private
		 */

		function localstorage(){
		  try {
		    return window.localStorage;
		  } catch (e) {}
		}


	/***/ },
	/* 18 */
	/***/ function(module, exports) {

		var g;

		// This works in non-strict mode
		g = (function() { return this; })();

		try {
			// This works if eval is allowed (see CSP)
			g = g || Function("return this")() || (1,eval)("this");
		} catch(e) {
			// This works if the window reference is available
			if(typeof window === "object")
				g = window;
		}

		// g can still be undefined, but nothing to do about it...
		// We return undefined, instead of nothing here, so it's
		// easier to handle this case. if(!global) { ...}

		module.exports = g;


	/***/ },
	/* 19 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(module) {(function (module, exports) {
		  'use strict';

		  // Utils
		  function assert (val, msg) {
		    if (!val) throw new Error(msg || 'Assertion failed');
		  }

		  // Could use `inherits` module, but don't want to move from single file
		  // architecture yet.
		  function inherits (ctor, superCtor) {
		    ctor.super_ = superCtor;
		    var TempCtor = function () {};
		    TempCtor.prototype = superCtor.prototype;
		    ctor.prototype = new TempCtor();
		    ctor.prototype.constructor = ctor;
		  }

		  // BN

		  function BN (number, base, endian) {
		    if (BN.isBN(number)) {
		      return number;
		    }

		    this.negative = 0;
		    this.words = null;
		    this.length = 0;

		    // Reduction context
		    this.red = null;

		    if (number !== null) {
		      if (base === 'le' || base === 'be') {
		        endian = base;
		        base = 10;
		      }

		      this._init(number || 0, base || 10, endian || 'be');
		    }
		  }
		  if (typeof module === 'object') {
		    module.exports = BN;
		  } else {
		    exports.BN = BN;
		  }

		  BN.BN = BN;
		  BN.wordSize = 26;

		  var Buffer;
		  try {
		    Buffer = __webpack_require__(0).Buffer;
		  } catch (e) {
		  }

		  BN.isBN = function isBN (num) {
		    return num !== null && typeof num === 'object' &&
		      num.constructor.name === 'BN' && Array.isArray(num.words);
		  };

		  BN.max = function max (left, right) {
		    if (left.cmp(right) > 0) return left;
		    return right;
		  };

		  BN.min = function min (left, right) {
		    if (left.cmp(right) < 0) return left;
		    return right;
		  };

		  BN.prototype._init = function init (number, base, endian) {
		    if (typeof number === 'number') {
		      return this._initNumber(number, base, endian);
		    }

		    if (typeof number === 'object') {
		      return this._initArray(number, base, endian);
		    }

		    if (base === 'hex') {
		      base = 16;
		    }
		    assert(base === (base | 0) && base >= 2 && base <= 36);

		    number = number.toString().replace(/\s+/g, '');
		    var start = 0;
		    if (number[0] === '-') {
		      start++;
		    }

		    if (base === 16) {
		      this._parseHex(number, start);
		    } else {
		      this._parseBase(number, base, start);
		    }

		    if (number[0] === '-') {
		      this.negative = 1;
		    }

		    this.strip();

		    if (endian !== 'le') return;

		    this._initArray(this.toArray(), base, endian);
		  };

		  BN.prototype._initNumber = function _initNumber (number, base, endian) {
		    if (number < 0) {
		      this.negative = 1;
		      number = -number;
		    }
		    if (number < 0x4000000) {
		      this.words = [ number & 0x3ffffff ];
		      this.length = 1;
		    } else if (number < 0x10000000000000) {
		      this.words = [
		        number & 0x3ffffff,
		        (number / 0x4000000) & 0x3ffffff
		      ];
		      this.length = 2;
		    } else {
		      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)
		      this.words = [
		        number & 0x3ffffff,
		        (number / 0x4000000) & 0x3ffffff,
		        1
		      ];
		      this.length = 3;
		    }

		    if (endian !== 'le') return;

		    // Reverse the bytes
		    this._initArray(this.toArray(), base, endian);
		  };

		  BN.prototype._initArray = function _initArray (number, base, endian) {
		    // Perhaps a Uint8Array
		    assert(typeof number.length === 'number');
		    if (number.length <= 0) {
		      this.words = [ 0 ];
		      this.length = 1;
		      return this;
		    }

		    this.length = Math.ceil(number.length / 3);
		    this.words = new Array(this.length);
		    for (var i = 0; i < this.length; i++) {
		      this.words[i] = 0;
		    }

		    var j, w;
		    var off = 0;
		    if (endian === 'be') {
		      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {
		        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);
		        this.words[j] |= (w << off) & 0x3ffffff;
		        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
		        off += 24;
		        if (off >= 26) {
		          off -= 26;
		          j++;
		        }
		      }
		    } else if (endian === 'le') {
		      for (i = 0, j = 0; i < number.length; i += 3) {
		        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);
		        this.words[j] |= (w << off) & 0x3ffffff;
		        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
		        off += 24;
		        if (off >= 26) {
		          off -= 26;
		          j++;
		        }
		      }
		    }
		    return this.strip();
		  };

		  function parseHex (str, start, end) {
		    var r = 0;
		    var len = Math.min(str.length, end);
		    for (var i = start; i < len; i++) {
		      var c = str.charCodeAt(i) - 48;

		      r <<= 4;

		      // 'a' - 'f'
		      if (c >= 49 && c <= 54) {
		        r |= c - 49 + 0xa;

		      // 'A' - 'F'
		      } else if (c >= 17 && c <= 22) {
		        r |= c - 17 + 0xa;

		      // '0' - '9'
		      } else {
		        r |= c & 0xf;
		      }
		    }
		    return r;
		  }

		  BN.prototype._parseHex = function _parseHex (number, start) {
		    // Create possibly bigger array to ensure that it fits the number
		    this.length = Math.ceil((number.length - start) / 6);
		    this.words = new Array(this.length);
		    for (var i = 0; i < this.length; i++) {
		      this.words[i] = 0;
		    }

		    var j, w;
		    // Scan 24-bit chunks and add them to the number
		    var off = 0;
		    for (i = number.length - 6, j = 0; i >= start; i -= 6) {
		      w = parseHex(number, i, i + 6);
		      this.words[j] |= (w << off) & 0x3ffffff;
		      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb
		      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
		      off += 24;
		      if (off >= 26) {
		        off -= 26;
		        j++;
		      }
		    }
		    if (i + 6 !== start) {
		      w = parseHex(number, start, i + 6);
		      this.words[j] |= (w << off) & 0x3ffffff;
		      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
		    }
		    this.strip();
		  };

		  function parseBase (str, start, end, mul) {
		    var r = 0;
		    var len = Math.min(str.length, end);
		    for (var i = start; i < len; i++) {
		      var c = str.charCodeAt(i) - 48;

		      r *= mul;

		      // 'a'
		      if (c >= 49) {
		        r += c - 49 + 0xa;

		      // 'A'
		      } else if (c >= 17) {
		        r += c - 17 + 0xa;

		      // '0' - '9'
		      } else {
		        r += c;
		      }
		    }
		    return r;
		  }

		  BN.prototype._parseBase = function _parseBase (number, base, start) {
		    // Initialize as zero
		    this.words = [ 0 ];
		    this.length = 1;

		    // Find length of limb in base
		    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {
		      limbLen++;
		    }
		    limbLen--;
		    limbPow = (limbPow / base) | 0;

		    var total = number.length - start;
		    var mod = total % limbLen;
		    var end = Math.min(total, total - mod) + start;

		    var word = 0;
		    for (var i = start; i < end; i += limbLen) {
		      word = parseBase(number, i, i + limbLen, base);

		      this.imuln(limbPow);
		      if (this.words[0] + word < 0x4000000) {
		        this.words[0] += word;
		      } else {
		        this._iaddn(word);
		      }
		    }

		    if (mod !== 0) {
		      var pow = 1;
		      word = parseBase(number, i, number.length, base);

		      for (i = 0; i < mod; i++) {
		        pow *= base;
		      }

		      this.imuln(pow);
		      if (this.words[0] + word < 0x4000000) {
		        this.words[0] += word;
		      } else {
		        this._iaddn(word);
		      }
		    }
		  };

		  BN.prototype.copy = function copy (dest) {
		    dest.words = new Array(this.length);
		    for (var i = 0; i < this.length; i++) {
		      dest.words[i] = this.words[i];
		    }
		    dest.length = this.length;
		    dest.negative = this.negative;
		    dest.red = this.red;
		  };

		  BN.prototype.clone = function clone () {
		    var r = new BN(null);
		    this.copy(r);
		    return r;
		  };

		  BN.prototype._expand = function _expand (size) {
		    while (this.length < size) {
		      this.words[this.length++] = 0;
		    }
		    return this;
		  };

		  // Remove leading `0` from `this`
		  BN.prototype.strip = function strip () {
		    while (this.length > 1 && this.words[this.length - 1] === 0) {
		      this.length--;
		    }
		    return this._normSign();
		  };

		  BN.prototype._normSign = function _normSign () {
		    // -0 = 0
		    if (this.length === 1 && this.words[0] === 0) {
		      this.negative = 0;
		    }
		    return this;
		  };

		  BN.prototype.inspect = function inspect () {
		    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';
		  };

		  /*

		  var zeros = [];
		  var groupSizes = [];
		  var groupBases = [];

		  var s = '';
		  var i = -1;
		  while (++i < BN.wordSize) {
		    zeros[i] = s;
		    s += '0';
		  }
		  groupSizes[0] = 0;
		  groupSizes[1] = 0;
		  groupBases[0] = 0;
		  groupBases[1] = 0;
		  var base = 2 - 1;
		  while (++base < 36 + 1) {
		    var groupSize = 0;
		    var groupBase = 1;
		    while (groupBase < (1 << BN.wordSize) / base) {
		      groupBase *= base;
		      groupSize += 1;
		    }
		    groupSizes[base] = groupSize;
		    groupBases[base] = groupBase;
		  }

		  */

		  var zeros = [
		    '',
		    '0',
		    '00',
		    '000',
		    '0000',
		    '00000',
		    '000000',
		    '0000000',
		    '00000000',
		    '000000000',
		    '0000000000',
		    '00000000000',
		    '000000000000',
		    '0000000000000',
		    '00000000000000',
		    '000000000000000',
		    '0000000000000000',
		    '00000000000000000',
		    '000000000000000000',
		    '0000000000000000000',
		    '00000000000000000000',
		    '000000000000000000000',
		    '0000000000000000000000',
		    '00000000000000000000000',
		    '000000000000000000000000',
		    '0000000000000000000000000'
		  ];

		  var groupSizes = [
		    0, 0,
		    25, 16, 12, 11, 10, 9, 8,
		    8, 7, 7, 7, 7, 6, 6,
		    6, 6, 6, 6, 6, 5, 5,
		    5, 5, 5, 5, 5, 5, 5,
		    5, 5, 5, 5, 5, 5, 5
		  ];

		  var groupBases = [
		    0, 0,
		    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,
		    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,
		    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,
		    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,
		    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176
		  ];

		  BN.prototype.toString = function toString (base, padding) {
		    base = base || 10;
		    padding = padding | 0 || 1;

		    var out;
		    if (base === 16 || base === 'hex') {
		      out = '';
		      var off = 0;
		      var carry = 0;
		      for (var i = 0; i < this.length; i++) {
		        var w = this.words[i];
		        var word = (((w << off) | carry) & 0xffffff).toString(16);
		        carry = (w >>> (24 - off)) & 0xffffff;
		        if (carry !== 0 || i !== this.length - 1) {
		          out = zeros[6 - word.length] + word + out;
		        } else {
		          out = word + out;
		        }
		        off += 2;
		        if (off >= 26) {
		          off -= 26;
		          i--;
		        }
		      }
		      if (carry !== 0) {
		        out = carry.toString(16) + out;
		      }
		      while (out.length % padding !== 0) {
		        out = '0' + out;
		      }
		      if (this.negative !== 0) {
		        out = '-' + out;
		      }
		      return out;
		    }

		    if (base === (base | 0) && base >= 2 && base <= 36) {
		      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));
		      var groupSize = groupSizes[base];
		      // var groupBase = Math.pow(base, groupSize);
		      var groupBase = groupBases[base];
		      out = '';
		      var c = this.clone();
		      c.negative = 0;
		      while (!c.isZero()) {
		        var r = c.modn(groupBase).toString(base);
		        c = c.idivn(groupBase);

		        if (!c.isZero()) {
		          out = zeros[groupSize - r.length] + r + out;
		        } else {
		          out = r + out;
		        }
		      }
		      if (this.isZero()) {
		        out = '0' + out;
		      }
		      while (out.length % padding !== 0) {
		        out = '0' + out;
		      }
		      if (this.negative !== 0) {
		        out = '-' + out;
		      }
		      return out;
		    }

		    assert(false, 'Base should be between 2 and 36');
		  };

		  BN.prototype.toNumber = function toNumber () {
		    var ret = this.words[0];
		    if (this.length === 2) {
		      ret += this.words[1] * 0x4000000;
		    } else if (this.length === 3 && this.words[2] === 0x01) {
		      // NOTE: at this stage it is known that the top bit is set
		      ret += 0x10000000000000 + (this.words[1] * 0x4000000);
		    } else if (this.length > 2) {
		      assert(false, 'Number can only safely store up to 53 bits');
		    }
		    return (this.negative !== 0) ? -ret : ret;
		  };

		  BN.prototype.toJSON = function toJSON () {
		    return this.toString(16);
		  };

		  BN.prototype.toBuffer = function toBuffer (endian, length) {
		    assert(typeof Buffer !== 'undefined');
		    return this.toArrayLike(Buffer, endian, length);
		  };

		  BN.prototype.toArray = function toArray (endian, length) {
		    return this.toArrayLike(Array, endian, length);
		  };

		  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {
		    var byteLength = this.byteLength();
		    var reqLength = length || Math.max(1, byteLength);
		    assert(byteLength <= reqLength, 'byte array longer than desired length');
		    assert(reqLength > 0, 'Requested array length <= 0');

		    this.strip();
		    var littleEndian = endian === 'le';
		    var res = new ArrayType(reqLength);

		    var b, i;
		    var q = this.clone();
		    if (!littleEndian) {
		      // Assume big-endian
		      for (i = 0; i < reqLength - byteLength; i++) {
		        res[i] = 0;
		      }

		      for (i = 0; !q.isZero(); i++) {
		        b = q.andln(0xff);
		        q.iushrn(8);

		        res[reqLength - i - 1] = b;
		      }
		    } else {
		      for (i = 0; !q.isZero(); i++) {
		        b = q.andln(0xff);
		        q.iushrn(8);

		        res[i] = b;
		      }

		      for (; i < reqLength; i++) {
		        res[i] = 0;
		      }
		    }

		    return res;
		  };

		  if (Math.clz32) {
		    BN.prototype._countBits = function _countBits (w) {
		      return 32 - Math.clz32(w);
		    };
		  } else {
		    BN.prototype._countBits = function _countBits (w) {
		      var t = w;
		      var r = 0;
		      if (t >= 0x1000) {
		        r += 13;
		        t >>>= 13;
		      }
		      if (t >= 0x40) {
		        r += 7;
		        t >>>= 7;
		      }
		      if (t >= 0x8) {
		        r += 4;
		        t >>>= 4;
		      }
		      if (t >= 0x02) {
		        r += 2;
		        t >>>= 2;
		      }
		      return r + t;
		    };
		  }

		  BN.prototype._zeroBits = function _zeroBits (w) {
		    // Short-cut
		    if (w === 0) return 26;

		    var t = w;
		    var r = 0;
		    if ((t & 0x1fff) === 0) {
		      r += 13;
		      t >>>= 13;
		    }
		    if ((t & 0x7f) === 0) {
		      r += 7;
		      t >>>= 7;
		    }
		    if ((t & 0xf) === 0) {
		      r += 4;
		      t >>>= 4;
		    }
		    if ((t & 0x3) === 0) {
		      r += 2;
		      t >>>= 2;
		    }
		    if ((t & 0x1) === 0) {
		      r++;
		    }
		    return r;
		  };

		  // Return number of used bits in a BN
		  BN.prototype.bitLength = function bitLength () {
		    var w = this.words[this.length - 1];
		    var hi = this._countBits(w);
		    return (this.length - 1) * 26 + hi;
		  };

		  function toBitArray (num) {
		    var w = new Array(num.bitLength());

		    for (var bit = 0; bit < w.length; bit++) {
		      var off = (bit / 26) | 0;
		      var wbit = bit % 26;

		      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;
		    }

		    return w;
		  }

		  // Number of trailing zero bits
		  BN.prototype.zeroBits = function zeroBits () {
		    if (this.isZero()) return 0;

		    var r = 0;
		    for (var i = 0; i < this.length; i++) {
		      var b = this._zeroBits(this.words[i]);
		      r += b;
		      if (b !== 26) break;
		    }
		    return r;
		  };

		  BN.prototype.byteLength = function byteLength () {
		    return Math.ceil(this.bitLength() / 8);
		  };

		  BN.prototype.toTwos = function toTwos (width) {
		    if (this.negative !== 0) {
		      return this.abs().inotn(width).iaddn(1);
		    }
		    return this.clone();
		  };

		  BN.prototype.fromTwos = function fromTwos (width) {
		    if (this.testn(width - 1)) {
		      return this.notn(width).iaddn(1).ineg();
		    }
		    return this.clone();
		  };

		  BN.prototype.isNeg = function isNeg () {
		    return this.negative !== 0;
		  };

		  // Return negative clone of `this`
		  BN.prototype.neg = function neg () {
		    return this.clone().ineg();
		  };

		  BN.prototype.ineg = function ineg () {
		    if (!this.isZero()) {
		      this.negative ^= 1;
		    }

		    return this;
		  };

		  // Or `num` with `this` in-place
		  BN.prototype.iuor = function iuor (num) {
		    while (this.length < num.length) {
		      this.words[this.length++] = 0;
		    }

		    for (var i = 0; i < num.length; i++) {
		      this.words[i] = this.words[i] | num.words[i];
		    }

		    return this.strip();
		  };

		  BN.prototype.ior = function ior (num) {
		    assert((this.negative | num.negative) === 0);
		    return this.iuor(num);
		  };

		  // Or `num` with `this`
		  BN.prototype.or = function or (num) {
		    if (this.length > num.length) return this.clone().ior(num);
		    return num.clone().ior(this);
		  };

		  BN.prototype.uor = function uor (num) {
		    if (this.length > num.length) return this.clone().iuor(num);
		    return num.clone().iuor(this);
		  };

		  // And `num` with `this` in-place
		  BN.prototype.iuand = function iuand (num) {
		    // b = min-length(num, this)
		    var b;
		    if (this.length > num.length) {
		      b = num;
		    } else {
		      b = this;
		    }

		    for (var i = 0; i < b.length; i++) {
		      this.words[i] = this.words[i] & num.words[i];
		    }

		    this.length = b.length;

		    return this.strip();
		  };

		  BN.prototype.iand = function iand (num) {
		    assert((this.negative | num.negative) === 0);
		    return this.iuand(num);
		  };

		  // And `num` with `this`
		  BN.prototype.and = function and (num) {
		    if (this.length > num.length) return this.clone().iand(num);
		    return num.clone().iand(this);
		  };

		  BN.prototype.uand = function uand (num) {
		    if (this.length > num.length) return this.clone().iuand(num);
		    return num.clone().iuand(this);
		  };

		  // Xor `num` with `this` in-place
		  BN.prototype.iuxor = function iuxor (num) {
		    // a.length > b.length
		    var a;
		    var b;
		    if (this.length > num.length) {
		      a = this;
		      b = num;
		    } else {
		      a = num;
		      b = this;
		    }

		    for (var i = 0; i < b.length; i++) {
		      this.words[i] = a.words[i] ^ b.words[i];
		    }

		    if (this !== a) {
		      for (; i < a.length; i++) {
		        this.words[i] = a.words[i];
		      }
		    }

		    this.length = a.length;

		    return this.strip();
		  };

		  BN.prototype.ixor = function ixor (num) {
		    assert((this.negative | num.negative) === 0);
		    return this.iuxor(num);
		  };

		  // Xor `num` with `this`
		  BN.prototype.xor = function xor (num) {
		    if (this.length > num.length) return this.clone().ixor(num);
		    return num.clone().ixor(this);
		  };

		  BN.prototype.uxor = function uxor (num) {
		    if (this.length > num.length) return this.clone().iuxor(num);
		    return num.clone().iuxor(this);
		  };

		  // Not ``this`` with ``width`` bitwidth
		  BN.prototype.inotn = function inotn (width) {
		    assert(typeof width === 'number' && width >= 0);

		    var bytesNeeded = Math.ceil(width / 26) | 0;
		    var bitsLeft = width % 26;

		    // Extend the buffer with leading zeroes
		    this._expand(bytesNeeded);

		    if (bitsLeft > 0) {
		      bytesNeeded--;
		    }

		    // Handle complete words
		    for (var i = 0; i < bytesNeeded; i++) {
		      this.words[i] = ~this.words[i] & 0x3ffffff;
		    }

		    // Handle the residue
		    if (bitsLeft > 0) {
		      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));
		    }

		    // And remove leading zeroes
		    return this.strip();
		  };

		  BN.prototype.notn = function notn (width) {
		    return this.clone().inotn(width);
		  };

		  // Set `bit` of `this`
		  BN.prototype.setn = function setn (bit, val) {
		    assert(typeof bit === 'number' && bit >= 0);

		    var off = (bit / 26) | 0;
		    var wbit = bit % 26;

		    this._expand(off + 1);

		    if (val) {
		      this.words[off] = this.words[off] | (1 << wbit);
		    } else {
		      this.words[off] = this.words[off] & ~(1 << wbit);
		    }

		    return this.strip();
		  };

		  // Add `num` to `this` in-place
		  BN.prototype.iadd = function iadd (num) {
		    var r;

		    // negative + positive
		    if (this.negative !== 0 && num.negative === 0) {
		      this.negative = 0;
		      r = this.isub(num);
		      this.negative ^= 1;
		      return this._normSign();

		    // positive + negative
		    } else if (this.negative === 0 && num.negative !== 0) {
		      num.negative = 0;
		      r = this.isub(num);
		      num.negative = 1;
		      return r._normSign();
		    }

		    // a.length > b.length
		    var a, b;
		    if (this.length > num.length) {
		      a = this;
		      b = num;
		    } else {
		      a = num;
		      b = this;
		    }

		    var carry = 0;
		    for (var i = 0; i < b.length; i++) {
		      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;
		      this.words[i] = r & 0x3ffffff;
		      carry = r >>> 26;
		    }
		    for (; carry !== 0 && i < a.length; i++) {
		      r = (a.words[i] | 0) + carry;
		      this.words[i] = r & 0x3ffffff;
		      carry = r >>> 26;
		    }

		    this.length = a.length;
		    if (carry !== 0) {
		      this.words[this.length] = carry;
		      this.length++;
		    // Copy the rest of the words
		    } else if (a !== this) {
		      for (; i < a.length; i++) {
		        this.words[i] = a.words[i];
		      }
		    }

		    return this;
		  };

		  // Add `num` to `this`
		  BN.prototype.add = function add (num) {
		    var res;
		    if (num.negative !== 0 && this.negative === 0) {
		      num.negative = 0;
		      res = this.sub(num);
		      num.negative ^= 1;
		      return res;
		    } else if (num.negative === 0 && this.negative !== 0) {
		      this.negative = 0;
		      res = num.sub(this);
		      this.negative = 1;
		      return res;
		    }

		    if (this.length > num.length) return this.clone().iadd(num);

		    return num.clone().iadd(this);
		  };

		  // Subtract `num` from `this` in-place
		  BN.prototype.isub = function isub (num) {
		    // this - (-num) = this + num
		    if (num.negative !== 0) {
		      num.negative = 0;
		      var r = this.iadd(num);
		      num.negative = 1;
		      return r._normSign();

		    // -this - num = -(this + num)
		    } else if (this.negative !== 0) {
		      this.negative = 0;
		      this.iadd(num);
		      this.negative = 1;
		      return this._normSign();
		    }

		    // At this point both numbers are positive
		    var cmp = this.cmp(num);

		    // Optimization - zeroify
		    if (cmp === 0) {
		      this.negative = 0;
		      this.length = 1;
		      this.words[0] = 0;
		      return this;
		    }

		    // a > b
		    var a, b;
		    if (cmp > 0) {
		      a = this;
		      b = num;
		    } else {
		      a = num;
		      b = this;
		    }

		    var carry = 0;
		    for (var i = 0; i < b.length; i++) {
		      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;
		      carry = r >> 26;
		      this.words[i] = r & 0x3ffffff;
		    }
		    for (; carry !== 0 && i < a.length; i++) {
		      r = (a.words[i] | 0) + carry;
		      carry = r >> 26;
		      this.words[i] = r & 0x3ffffff;
		    }

		    // Copy rest of the words
		    if (carry === 0 && i < a.length && a !== this) {
		      for (; i < a.length; i++) {
		        this.words[i] = a.words[i];
		      }
		    }

		    this.length = Math.max(this.length, i);

		    if (a !== this) {
		      this.negative = 1;
		    }

		    return this.strip();
		  };

		  // Subtract `num` from `this`
		  BN.prototype.sub = function sub (num) {
		    return this.clone().isub(num);
		  };

		  function smallMulTo (self, num, out) {
		    out.negative = num.negative ^ self.negative;
		    var len = (self.length + num.length) | 0;
		    out.length = len;
		    len = (len - 1) | 0;

		    // Peel one iteration (compiler can't do it, because of code complexity)
		    var a = self.words[0] | 0;
		    var b = num.words[0] | 0;
		    var r = a * b;

		    var lo = r & 0x3ffffff;
		    var carry = (r / 0x4000000) | 0;
		    out.words[0] = lo;

		    for (var k = 1; k < len; k++) {
		      // Sum all words with the same `i + j = k` and accumulate `ncarry`,
		      // note that ncarry could be >= 0x3ffffff
		      var ncarry = carry >>> 26;
		      var rword = carry & 0x3ffffff;
		      var maxJ = Math.min(k, num.length - 1);
		      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
		        var i = (k - j) | 0;
		        a = self.words[i] | 0;
		        b = num.words[j] | 0;
		        r = a * b + rword;
		        ncarry += (r / 0x4000000) | 0;
		        rword = r & 0x3ffffff;
		      }
		      out.words[k] = rword | 0;
		      carry = ncarry | 0;
		    }
		    if (carry !== 0) {
		      out.words[k] = carry | 0;
		    } else {
		      out.length--;
		    }

		    return out.strip();
		  }

		  // TODO(indutny): it may be reasonable to omit it for users who don't need
		  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit
		  // multiplication (like elliptic secp256k1).
		  var comb10MulTo = function comb10MulTo (self, num, out) {
		    var a = self.words;
		    var b = num.words;
		    var o = out.words;
		    var c = 0;
		    var lo;
		    var mid;
		    var hi;
		    var a0 = a[0] | 0;
		    var al0 = a0 & 0x1fff;
		    var ah0 = a0 >>> 13;
		    var a1 = a[1] | 0;
		    var al1 = a1 & 0x1fff;
		    var ah1 = a1 >>> 13;
		    var a2 = a[2] | 0;
		    var al2 = a2 & 0x1fff;
		    var ah2 = a2 >>> 13;
		    var a3 = a[3] | 0;
		    var al3 = a3 & 0x1fff;
		    var ah3 = a3 >>> 13;
		    var a4 = a[4] | 0;
		    var al4 = a4 & 0x1fff;
		    var ah4 = a4 >>> 13;
		    var a5 = a[5] | 0;
		    var al5 = a5 & 0x1fff;
		    var ah5 = a5 >>> 13;
		    var a6 = a[6] | 0;
		    var al6 = a6 & 0x1fff;
		    var ah6 = a6 >>> 13;
		    var a7 = a[7] | 0;
		    var al7 = a7 & 0x1fff;
		    var ah7 = a7 >>> 13;
		    var a8 = a[8] | 0;
		    var al8 = a8 & 0x1fff;
		    var ah8 = a8 >>> 13;
		    var a9 = a[9] | 0;
		    var al9 = a9 & 0x1fff;
		    var ah9 = a9 >>> 13;
		    var b0 = b[0] | 0;
		    var bl0 = b0 & 0x1fff;
		    var bh0 = b0 >>> 13;
		    var b1 = b[1] | 0;
		    var bl1 = b1 & 0x1fff;
		    var bh1 = b1 >>> 13;
		    var b2 = b[2] | 0;
		    var bl2 = b2 & 0x1fff;
		    var bh2 = b2 >>> 13;
		    var b3 = b[3] | 0;
		    var bl3 = b3 & 0x1fff;
		    var bh3 = b3 >>> 13;
		    var b4 = b[4] | 0;
		    var bl4 = b4 & 0x1fff;
		    var bh4 = b4 >>> 13;
		    var b5 = b[5] | 0;
		    var bl5 = b5 & 0x1fff;
		    var bh5 = b5 >>> 13;
		    var b6 = b[6] | 0;
		    var bl6 = b6 & 0x1fff;
		    var bh6 = b6 >>> 13;
		    var b7 = b[7] | 0;
		    var bl7 = b7 & 0x1fff;
		    var bh7 = b7 >>> 13;
		    var b8 = b[8] | 0;
		    var bl8 = b8 & 0x1fff;
		    var bh8 = b8 >>> 13;
		    var b9 = b[9] | 0;
		    var bl9 = b9 & 0x1fff;
		    var bh9 = b9 >>> 13;

		    out.negative = self.negative ^ num.negative;
		    out.length = 19;
		    /* k = 0 */
		    lo = Math.imul(al0, bl0);
		    mid = Math.imul(al0, bh0);
		    mid += Math.imul(ah0, bl0);
		    hi = Math.imul(ah0, bh0);
		    var w0 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w0 >>> 26);
		    w0 &= 0x3ffffff;
		    /* k = 1 */
		    lo = Math.imul(al1, bl0);
		    mid = Math.imul(al1, bh0);
		    mid += Math.imul(ah1, bl0);
		    hi = Math.imul(ah1, bh0);
		    lo += Math.imul(al0, bl1);
		    mid += Math.imul(al0, bh1);
		    mid += Math.imul(ah0, bl1);
		    hi += Math.imul(ah0, bh1);
		    var w1 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w1 >>> 26);
		    w1 &= 0x3ffffff;
		    /* k = 2 */
		    lo = Math.imul(al2, bl0);
		    mid = Math.imul(al2, bh0);
		    mid += Math.imul(ah2, bl0);
		    hi = Math.imul(ah2, bh0);
		    lo += Math.imul(al1, bl1);
		    mid += Math.imul(al1, bh1);
		    mid += Math.imul(ah1, bl1);
		    hi += Math.imul(ah1, bh1);
		    lo += Math.imul(al0, bl2);
		    mid += Math.imul(al0, bh2);
		    mid += Math.imul(ah0, bl2);
		    hi += Math.imul(ah0, bh2);
		    var w2 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w2 >>> 26);
		    w2 &= 0x3ffffff;
		    /* k = 3 */
		    lo = Math.imul(al3, bl0);
		    mid = Math.imul(al3, bh0);
		    mid += Math.imul(ah3, bl0);
		    hi = Math.imul(ah3, bh0);
		    lo += Math.imul(al2, bl1);
		    mid += Math.imul(al2, bh1);
		    mid += Math.imul(ah2, bl1);
		    hi += Math.imul(ah2, bh1);
		    lo += Math.imul(al1, bl2);
		    mid += Math.imul(al1, bh2);
		    mid += Math.imul(ah1, bl2);
		    hi += Math.imul(ah1, bh2);
		    lo += Math.imul(al0, bl3);
		    mid += Math.imul(al0, bh3);
		    mid += Math.imul(ah0, bl3);
		    hi += Math.imul(ah0, bh3);
		    var w3 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w3 >>> 26);
		    w3 &= 0x3ffffff;
		    /* k = 4 */
		    lo = Math.imul(al4, bl0);
		    mid = Math.imul(al4, bh0);
		    mid += Math.imul(ah4, bl0);
		    hi = Math.imul(ah4, bh0);
		    lo += Math.imul(al3, bl1);
		    mid += Math.imul(al3, bh1);
		    mid += Math.imul(ah3, bl1);
		    hi += Math.imul(ah3, bh1);
		    lo += Math.imul(al2, bl2);
		    mid += Math.imul(al2, bh2);
		    mid += Math.imul(ah2, bl2);
		    hi += Math.imul(ah2, bh2);
		    lo += Math.imul(al1, bl3);
		    mid += Math.imul(al1, bh3);
		    mid += Math.imul(ah1, bl3);
		    hi += Math.imul(ah1, bh3);
		    lo += Math.imul(al0, bl4);
		    mid += Math.imul(al0, bh4);
		    mid += Math.imul(ah0, bl4);
		    hi += Math.imul(ah0, bh4);
		    var w4 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w4 >>> 26);
		    w4 &= 0x3ffffff;
		    /* k = 5 */
		    lo = Math.imul(al5, bl0);
		    mid = Math.imul(al5, bh0);
		    mid += Math.imul(ah5, bl0);
		    hi = Math.imul(ah5, bh0);
		    lo += Math.imul(al4, bl1);
		    mid += Math.imul(al4, bh1);
		    mid += Math.imul(ah4, bl1);
		    hi += Math.imul(ah4, bh1);
		    lo += Math.imul(al3, bl2);
		    mid += Math.imul(al3, bh2);
		    mid += Math.imul(ah3, bl2);
		    hi += Math.imul(ah3, bh2);
		    lo += Math.imul(al2, bl3);
		    mid += Math.imul(al2, bh3);
		    mid += Math.imul(ah2, bl3);
		    hi += Math.imul(ah2, bh3);
		    lo += Math.imul(al1, bl4);
		    mid += Math.imul(al1, bh4);
		    mid += Math.imul(ah1, bl4);
		    hi += Math.imul(ah1, bh4);
		    lo += Math.imul(al0, bl5);
		    mid += Math.imul(al0, bh5);
		    mid += Math.imul(ah0, bl5);
		    hi += Math.imul(ah0, bh5);
		    var w5 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w5 >>> 26);
		    w5 &= 0x3ffffff;
		    /* k = 6 */
		    lo = Math.imul(al6, bl0);
		    mid = Math.imul(al6, bh0);
		    mid += Math.imul(ah6, bl0);
		    hi = Math.imul(ah6, bh0);
		    lo += Math.imul(al5, bl1);
		    mid += Math.imul(al5, bh1);
		    mid += Math.imul(ah5, bl1);
		    hi += Math.imul(ah5, bh1);
		    lo += Math.imul(al4, bl2);
		    mid += Math.imul(al4, bh2);
		    mid += Math.imul(ah4, bl2);
		    hi += Math.imul(ah4, bh2);
		    lo += Math.imul(al3, bl3);
		    mid += Math.imul(al3, bh3);
		    mid += Math.imul(ah3, bl3);
		    hi += Math.imul(ah3, bh3);
		    lo += Math.imul(al2, bl4);
		    mid += Math.imul(al2, bh4);
		    mid += Math.imul(ah2, bl4);
		    hi += Math.imul(ah2, bh4);
		    lo += Math.imul(al1, bl5);
		    mid += Math.imul(al1, bh5);
		    mid += Math.imul(ah1, bl5);
		    hi += Math.imul(ah1, bh5);
		    lo += Math.imul(al0, bl6);
		    mid += Math.imul(al0, bh6);
		    mid += Math.imul(ah0, bl6);
		    hi += Math.imul(ah0, bh6);
		    var w6 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w6 >>> 26);
		    w6 &= 0x3ffffff;
		    /* k = 7 */
		    lo = Math.imul(al7, bl0);
		    mid = Math.imul(al7, bh0);
		    mid += Math.imul(ah7, bl0);
		    hi = Math.imul(ah7, bh0);
		    lo += Math.imul(al6, bl1);
		    mid += Math.imul(al6, bh1);
		    mid += Math.imul(ah6, bl1);
		    hi += Math.imul(ah6, bh1);
		    lo += Math.imul(al5, bl2);
		    mid += Math.imul(al5, bh2);
		    mid += Math.imul(ah5, bl2);
		    hi += Math.imul(ah5, bh2);
		    lo += Math.imul(al4, bl3);
		    mid += Math.imul(al4, bh3);
		    mid += Math.imul(ah4, bl3);
		    hi += Math.imul(ah4, bh3);
		    lo += Math.imul(al3, bl4);
		    mid += Math.imul(al3, bh4);
		    mid += Math.imul(ah3, bl4);
		    hi += Math.imul(ah3, bh4);
		    lo += Math.imul(al2, bl5);
		    mid += Math.imul(al2, bh5);
		    mid += Math.imul(ah2, bl5);
		    hi += Math.imul(ah2, bh5);
		    lo += Math.imul(al1, bl6);
		    mid += Math.imul(al1, bh6);
		    mid += Math.imul(ah1, bl6);
		    hi += Math.imul(ah1, bh6);
		    lo += Math.imul(al0, bl7);
		    mid += Math.imul(al0, bh7);
		    mid += Math.imul(ah0, bl7);
		    hi += Math.imul(ah0, bh7);
		    var w7 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w7 >>> 26);
		    w7 &= 0x3ffffff;
		    /* k = 8 */
		    lo = Math.imul(al8, bl0);
		    mid = Math.imul(al8, bh0);
		    mid += Math.imul(ah8, bl0);
		    hi = Math.imul(ah8, bh0);
		    lo += Math.imul(al7, bl1);
		    mid += Math.imul(al7, bh1);
		    mid += Math.imul(ah7, bl1);
		    hi += Math.imul(ah7, bh1);
		    lo += Math.imul(al6, bl2);
		    mid += Math.imul(al6, bh2);
		    mid += Math.imul(ah6, bl2);
		    hi += Math.imul(ah6, bh2);
		    lo += Math.imul(al5, bl3);
		    mid += Math.imul(al5, bh3);
		    mid += Math.imul(ah5, bl3);
		    hi += Math.imul(ah5, bh3);
		    lo += Math.imul(al4, bl4);
		    mid += Math.imul(al4, bh4);
		    mid += Math.imul(ah4, bl4);
		    hi += Math.imul(ah4, bh4);
		    lo += Math.imul(al3, bl5);
		    mid += Math.imul(al3, bh5);
		    mid += Math.imul(ah3, bl5);
		    hi += Math.imul(ah3, bh5);
		    lo += Math.imul(al2, bl6);
		    mid += Math.imul(al2, bh6);
		    mid += Math.imul(ah2, bl6);
		    hi += Math.imul(ah2, bh6);
		    lo += Math.imul(al1, bl7);
		    mid += Math.imul(al1, bh7);
		    mid += Math.imul(ah1, bl7);
		    hi += Math.imul(ah1, bh7);
		    lo += Math.imul(al0, bl8);
		    mid += Math.imul(al0, bh8);
		    mid += Math.imul(ah0, bl8);
		    hi += Math.imul(ah0, bh8);
		    var w8 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w8 >>> 26);
		    w8 &= 0x3ffffff;
		    /* k = 9 */
		    lo = Math.imul(al9, bl0);
		    mid = Math.imul(al9, bh0);
		    mid += Math.imul(ah9, bl0);
		    hi = Math.imul(ah9, bh0);
		    lo += Math.imul(al8, bl1);
		    mid += Math.imul(al8, bh1);
		    mid += Math.imul(ah8, bl1);
		    hi += Math.imul(ah8, bh1);
		    lo += Math.imul(al7, bl2);
		    mid += Math.imul(al7, bh2);
		    mid += Math.imul(ah7, bl2);
		    hi += Math.imul(ah7, bh2);
		    lo += Math.imul(al6, bl3);
		    mid += Math.imul(al6, bh3);
		    mid += Math.imul(ah6, bl3);
		    hi += Math.imul(ah6, bh3);
		    lo += Math.imul(al5, bl4);
		    mid += Math.imul(al5, bh4);
		    mid += Math.imul(ah5, bl4);
		    hi += Math.imul(ah5, bh4);
		    lo += Math.imul(al4, bl5);
		    mid += Math.imul(al4, bh5);
		    mid += Math.imul(ah4, bl5);
		    hi += Math.imul(ah4, bh5);
		    lo += Math.imul(al3, bl6);
		    mid += Math.imul(al3, bh6);
		    mid += Math.imul(ah3, bl6);
		    hi += Math.imul(ah3, bh6);
		    lo += Math.imul(al2, bl7);
		    mid += Math.imul(al2, bh7);
		    mid += Math.imul(ah2, bl7);
		    hi += Math.imul(ah2, bh7);
		    lo += Math.imul(al1, bl8);
		    mid += Math.imul(al1, bh8);
		    mid += Math.imul(ah1, bl8);
		    hi += Math.imul(ah1, bh8);
		    lo += Math.imul(al0, bl9);
		    mid += Math.imul(al0, bh9);
		    mid += Math.imul(ah0, bl9);
		    hi += Math.imul(ah0, bh9);
		    var w9 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w9 >>> 26);
		    w9 &= 0x3ffffff;
		    /* k = 10 */
		    lo = Math.imul(al9, bl1);
		    mid = Math.imul(al9, bh1);
		    mid += Math.imul(ah9, bl1);
		    hi = Math.imul(ah9, bh1);
		    lo += Math.imul(al8, bl2);
		    mid += Math.imul(al8, bh2);
		    mid += Math.imul(ah8, bl2);
		    hi += Math.imul(ah8, bh2);
		    lo += Math.imul(al7, bl3);
		    mid += Math.imul(al7, bh3);
		    mid += Math.imul(ah7, bl3);
		    hi += Math.imul(ah7, bh3);
		    lo += Math.imul(al6, bl4);
		    mid += Math.imul(al6, bh4);
		    mid += Math.imul(ah6, bl4);
		    hi += Math.imul(ah6, bh4);
		    lo += Math.imul(al5, bl5);
		    mid += Math.imul(al5, bh5);
		    mid += Math.imul(ah5, bl5);
		    hi += Math.imul(ah5, bh5);
		    lo += Math.imul(al4, bl6);
		    mid += Math.imul(al4, bh6);
		    mid += Math.imul(ah4, bl6);
		    hi += Math.imul(ah4, bh6);
		    lo += Math.imul(al3, bl7);
		    mid += Math.imul(al3, bh7);
		    mid += Math.imul(ah3, bl7);
		    hi += Math.imul(ah3, bh7);
		    lo += Math.imul(al2, bl8);
		    mid += Math.imul(al2, bh8);
		    mid += Math.imul(ah2, bl8);
		    hi += Math.imul(ah2, bh8);
		    lo += Math.imul(al1, bl9);
		    mid += Math.imul(al1, bh9);
		    mid += Math.imul(ah1, bl9);
		    hi += Math.imul(ah1, bh9);
		    var w10 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w10 >>> 26);
		    w10 &= 0x3ffffff;
		    /* k = 11 */
		    lo = Math.imul(al9, bl2);
		    mid = Math.imul(al9, bh2);
		    mid += Math.imul(ah9, bl2);
		    hi = Math.imul(ah9, bh2);
		    lo += Math.imul(al8, bl3);
		    mid += Math.imul(al8, bh3);
		    mid += Math.imul(ah8, bl3);
		    hi += Math.imul(ah8, bh3);
		    lo += Math.imul(al7, bl4);
		    mid += Math.imul(al7, bh4);
		    mid += Math.imul(ah7, bl4);
		    hi += Math.imul(ah7, bh4);
		    lo += Math.imul(al6, bl5);
		    mid += Math.imul(al6, bh5);
		    mid += Math.imul(ah6, bl5);
		    hi += Math.imul(ah6, bh5);
		    lo += Math.imul(al5, bl6);
		    mid += Math.imul(al5, bh6);
		    mid += Math.imul(ah5, bl6);
		    hi += Math.imul(ah5, bh6);
		    lo += Math.imul(al4, bl7);
		    mid += Math.imul(al4, bh7);
		    mid += Math.imul(ah4, bl7);
		    hi += Math.imul(ah4, bh7);
		    lo += Math.imul(al3, bl8);
		    mid += Math.imul(al3, bh8);
		    mid += Math.imul(ah3, bl8);
		    hi += Math.imul(ah3, bh8);
		    lo += Math.imul(al2, bl9);
		    mid += Math.imul(al2, bh9);
		    mid += Math.imul(ah2, bl9);
		    hi += Math.imul(ah2, bh9);
		    var w11 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w11 >>> 26);
		    w11 &= 0x3ffffff;
		    /* k = 12 */
		    lo = Math.imul(al9, bl3);
		    mid = Math.imul(al9, bh3);
		    mid += Math.imul(ah9, bl3);
		    hi = Math.imul(ah9, bh3);
		    lo += Math.imul(al8, bl4);
		    mid += Math.imul(al8, bh4);
		    mid += Math.imul(ah8, bl4);
		    hi += Math.imul(ah8, bh4);
		    lo += Math.imul(al7, bl5);
		    mid += Math.imul(al7, bh5);
		    mid += Math.imul(ah7, bl5);
		    hi += Math.imul(ah7, bh5);
		    lo += Math.imul(al6, bl6);
		    mid += Math.imul(al6, bh6);
		    mid += Math.imul(ah6, bl6);
		    hi += Math.imul(ah6, bh6);
		    lo += Math.imul(al5, bl7);
		    mid += Math.imul(al5, bh7);
		    mid += Math.imul(ah5, bl7);
		    hi += Math.imul(ah5, bh7);
		    lo += Math.imul(al4, bl8);
		    mid += Math.imul(al4, bh8);
		    mid += Math.imul(ah4, bl8);
		    hi += Math.imul(ah4, bh8);
		    lo += Math.imul(al3, bl9);
		    mid += Math.imul(al3, bh9);
		    mid += Math.imul(ah3, bl9);
		    hi += Math.imul(ah3, bh9);
		    var w12 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w12 >>> 26);
		    w12 &= 0x3ffffff;
		    /* k = 13 */
		    lo = Math.imul(al9, bl4);
		    mid = Math.imul(al9, bh4);
		    mid += Math.imul(ah9, bl4);
		    hi = Math.imul(ah9, bh4);
		    lo += Math.imul(al8, bl5);
		    mid += Math.imul(al8, bh5);
		    mid += Math.imul(ah8, bl5);
		    hi += Math.imul(ah8, bh5);
		    lo += Math.imul(al7, bl6);
		    mid += Math.imul(al7, bh6);
		    mid += Math.imul(ah7, bl6);
		    hi += Math.imul(ah7, bh6);
		    lo += Math.imul(al6, bl7);
		    mid += Math.imul(al6, bh7);
		    mid += Math.imul(ah6, bl7);
		    hi += Math.imul(ah6, bh7);
		    lo += Math.imul(al5, bl8);
		    mid += Math.imul(al5, bh8);
		    mid += Math.imul(ah5, bl8);
		    hi += Math.imul(ah5, bh8);
		    lo += Math.imul(al4, bl9);
		    mid += Math.imul(al4, bh9);
		    mid += Math.imul(ah4, bl9);
		    hi += Math.imul(ah4, bh9);
		    var w13 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w13 >>> 26);
		    w13 &= 0x3ffffff;
		    /* k = 14 */
		    lo = Math.imul(al9, bl5);
		    mid = Math.imul(al9, bh5);
		    mid += Math.imul(ah9, bl5);
		    hi = Math.imul(ah9, bh5);
		    lo += Math.imul(al8, bl6);
		    mid += Math.imul(al8, bh6);
		    mid += Math.imul(ah8, bl6);
		    hi += Math.imul(ah8, bh6);
		    lo += Math.imul(al7, bl7);
		    mid += Math.imul(al7, bh7);
		    mid += Math.imul(ah7, bl7);
		    hi += Math.imul(ah7, bh7);
		    lo += Math.imul(al6, bl8);
		    mid += Math.imul(al6, bh8);
		    mid += Math.imul(ah6, bl8);
		    hi += Math.imul(ah6, bh8);
		    lo += Math.imul(al5, bl9);
		    mid += Math.imul(al5, bh9);
		    mid += Math.imul(ah5, bl9);
		    hi += Math.imul(ah5, bh9);
		    var w14 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w14 >>> 26);
		    w14 &= 0x3ffffff;
		    /* k = 15 */
		    lo = Math.imul(al9, bl6);
		    mid = Math.imul(al9, bh6);
		    mid += Math.imul(ah9, bl6);
		    hi = Math.imul(ah9, bh6);
		    lo += Math.imul(al8, bl7);
		    mid += Math.imul(al8, bh7);
		    mid += Math.imul(ah8, bl7);
		    hi += Math.imul(ah8, bh7);
		    lo += Math.imul(al7, bl8);
		    mid += Math.imul(al7, bh8);
		    mid += Math.imul(ah7, bl8);
		    hi += Math.imul(ah7, bh8);
		    lo += Math.imul(al6, bl9);
		    mid += Math.imul(al6, bh9);
		    mid += Math.imul(ah6, bl9);
		    hi += Math.imul(ah6, bh9);
		    var w15 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w15 >>> 26);
		    w15 &= 0x3ffffff;
		    /* k = 16 */
		    lo = Math.imul(al9, bl7);
		    mid = Math.imul(al9, bh7);
		    mid += Math.imul(ah9, bl7);
		    hi = Math.imul(ah9, bh7);
		    lo += Math.imul(al8, bl8);
		    mid += Math.imul(al8, bh8);
		    mid += Math.imul(ah8, bl8);
		    hi += Math.imul(ah8, bh8);
		    lo += Math.imul(al7, bl9);
		    mid += Math.imul(al7, bh9);
		    mid += Math.imul(ah7, bl9);
		    hi += Math.imul(ah7, bh9);
		    var w16 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w16 >>> 26);
		    w16 &= 0x3ffffff;
		    /* k = 17 */
		    lo = Math.imul(al9, bl8);
		    mid = Math.imul(al9, bh8);
		    mid += Math.imul(ah9, bl8);
		    hi = Math.imul(ah9, bh8);
		    lo += Math.imul(al8, bl9);
		    mid += Math.imul(al8, bh9);
		    mid += Math.imul(ah8, bl9);
		    hi += Math.imul(ah8, bh9);
		    var w17 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w17 >>> 26);
		    w17 &= 0x3ffffff;
		    /* k = 18 */
		    lo = Math.imul(al9, bl9);
		    mid = Math.imul(al9, bh9);
		    mid += Math.imul(ah9, bl9);
		    hi = Math.imul(ah9, bh9);
		    var w18 = c + lo + ((mid & 0x1fff) << 13);
		    c = hi + (mid >>> 13) + (w18 >>> 26);
		    w18 &= 0x3ffffff;
		    o[0] = w0;
		    o[1] = w1;
		    o[2] = w2;
		    o[3] = w3;
		    o[4] = w4;
		    o[5] = w5;
		    o[6] = w6;
		    o[7] = w7;
		    o[8] = w8;
		    o[9] = w9;
		    o[10] = w10;
		    o[11] = w11;
		    o[12] = w12;
		    o[13] = w13;
		    o[14] = w14;
		    o[15] = w15;
		    o[16] = w16;
		    o[17] = w17;
		    o[18] = w18;
		    if (c !== 0) {
		      o[19] = c;
		      out.length++;
		    }
		    return out;
		  };

		  // Polyfill comb
		  if (!Math.imul) {
		    comb10MulTo = smallMulTo;
		  }

		  function bigMulTo (self, num, out) {
		    out.negative = num.negative ^ self.negative;
		    out.length = self.length + num.length;

		    var carry = 0;
		    var hncarry = 0;
		    for (var k = 0; k < out.length - 1; k++) {
		      // Sum all words with the same `i + j = k` and accumulate `ncarry`,
		      // note that ncarry could be >= 0x3ffffff
		      var ncarry = hncarry;
		      hncarry = 0;
		      var rword = carry & 0x3ffffff;
		      var maxJ = Math.min(k, num.length - 1);
		      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
		        var i = k - j;
		        var a = self.words[i] | 0;
		        var b = num.words[j] | 0;
		        var r = a * b;

		        var lo = r & 0x3ffffff;
		        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;
		        lo = (lo + rword) | 0;
		        rword = lo & 0x3ffffff;
		        ncarry = (ncarry + (lo >>> 26)) | 0;

		        hncarry += ncarry >>> 26;
		        ncarry &= 0x3ffffff;
		      }
		      out.words[k] = rword;
		      carry = ncarry;
		      ncarry = hncarry;
		    }
		    if (carry !== 0) {
		      out.words[k] = carry;
		    } else {
		      out.length--;
		    }

		    return out.strip();
		  }

		  function jumboMulTo (self, num, out) {
		    var fftm = new FFTM();
		    return fftm.mulp(self, num, out);
		  }

		  BN.prototype.mulTo = function mulTo (num, out) {
		    var res;
		    var len = this.length + num.length;
		    if (this.length === 10 && num.length === 10) {
		      res = comb10MulTo(this, num, out);
		    } else if (len < 63) {
		      res = smallMulTo(this, num, out);
		    } else if (len < 1024) {
		      res = bigMulTo(this, num, out);
		    } else {
		      res = jumboMulTo(this, num, out);
		    }

		    return res;
		  };

		  // Cooley-Tukey algorithm for FFT
		  // slightly revisited to rely on looping instead of recursion

		  function FFTM (x, y) {
		    this.x = x;
		    this.y = y;
		  }

		  FFTM.prototype.makeRBT = function makeRBT (N) {
		    var t = new Array(N);
		    var l = BN.prototype._countBits(N) - 1;
		    for (var i = 0; i < N; i++) {
		      t[i] = this.revBin(i, l, N);
		    }

		    return t;
		  };

		  // Returns binary-reversed representation of `x`
		  FFTM.prototype.revBin = function revBin (x, l, N) {
		    if (x === 0 || x === N - 1) return x;

		    var rb = 0;
		    for (var i = 0; i < l; i++) {
		      rb |= (x & 1) << (l - i - 1);
		      x >>= 1;
		    }

		    return rb;
		  };

		  // Performs "tweedling" phase, therefore 'emulating'
		  // behaviour of the recursive algorithm
		  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {
		    for (var i = 0; i < N; i++) {
		      rtws[i] = rws[rbt[i]];
		      itws[i] = iws[rbt[i]];
		    }
		  };

		  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {
		    this.permute(rbt, rws, iws, rtws, itws, N);

		    for (var s = 1; s < N; s <<= 1) {
		      var l = s << 1;

		      var rtwdf = Math.cos(2 * Math.PI / l);
		      var itwdf = Math.sin(2 * Math.PI / l);

		      for (var p = 0; p < N; p += l) {
		        var rtwdf_ = rtwdf;
		        var itwdf_ = itwdf;

		        for (var j = 0; j < s; j++) {
		          var re = rtws[p + j];
		          var ie = itws[p + j];

		          var ro = rtws[p + j + s];
		          var io = itws[p + j + s];

		          var rx = rtwdf_ * ro - itwdf_ * io;

		          io = rtwdf_ * io + itwdf_ * ro;
		          ro = rx;

		          rtws[p + j] = re + ro;
		          itws[p + j] = ie + io;

		          rtws[p + j + s] = re - ro;
		          itws[p + j + s] = ie - io;

		          /* jshint maxdepth : false */
		          if (j !== l) {
		            rx = rtwdf * rtwdf_ - itwdf * itwdf_;

		            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;
		            rtwdf_ = rx;
		          }
		        }
		      }
		    }
		  };

		  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {
		    var N = Math.max(m, n) | 1;
		    var odd = N & 1;
		    var i = 0;
		    for (N = N / 2 | 0; N; N = N >>> 1) {
		      i++;
		    }

		    return 1 << i + 1 + odd;
		  };

		  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {
		    if (N <= 1) return;

		    for (var i = 0; i < N / 2; i++) {
		      var t = rws[i];

		      rws[i] = rws[N - i - 1];
		      rws[N - i - 1] = t;

		      t = iws[i];

		      iws[i] = -iws[N - i - 1];
		      iws[N - i - 1] = -t;
		    }
		  };

		  FFTM.prototype.normalize13b = function normalize13b (ws, N) {
		    var carry = 0;
		    for (var i = 0; i < N / 2; i++) {
		      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +
		        Math.round(ws[2 * i] / N) +
		        carry;

		      ws[i] = w & 0x3ffffff;

		      if (w < 0x4000000) {
		        carry = 0;
		      } else {
		        carry = w / 0x4000000 | 0;
		      }
		    }

		    return ws;
		  };

		  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {
		    var carry = 0;
		    for (var i = 0; i < len; i++) {
		      carry = carry + (ws[i] | 0);

		      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;
		      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;
		    }

		    // Pad with zeroes
		    for (i = 2 * len; i < N; ++i) {
		      rws[i] = 0;
		    }

		    assert(carry === 0);
		    assert((carry & ~0x1fff) === 0);
		  };

		  FFTM.prototype.stub = function stub (N) {
		    var ph = new Array(N);
		    for (var i = 0; i < N; i++) {
		      ph[i] = 0;
		    }

		    return ph;
		  };

		  FFTM.prototype.mulp = function mulp (x, y, out) {
		    var N = 2 * this.guessLen13b(x.length, y.length);

		    var rbt = this.makeRBT(N);

		    var _ = this.stub(N);

		    var rws = new Array(N);
		    var rwst = new Array(N);
		    var iwst = new Array(N);

		    var nrws = new Array(N);
		    var nrwst = new Array(N);
		    var niwst = new Array(N);

		    var rmws = out.words;
		    rmws.length = N;

		    this.convert13b(x.words, x.length, rws, N);
		    this.convert13b(y.words, y.length, nrws, N);

		    this.transform(rws, _, rwst, iwst, N, rbt);
		    this.transform(nrws, _, nrwst, niwst, N, rbt);

		    for (var i = 0; i < N; i++) {
		      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];
		      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];
		      rwst[i] = rx;
		    }

		    this.conjugate(rwst, iwst, N);
		    this.transform(rwst, iwst, rmws, _, N, rbt);
		    this.conjugate(rmws, _, N);
		    this.normalize13b(rmws, N);

		    out.negative = x.negative ^ y.negative;
		    out.length = x.length + y.length;
		    return out.strip();
		  };

		  // Multiply `this` by `num`
		  BN.prototype.mul = function mul (num) {
		    var out = new BN(null);
		    out.words = new Array(this.length + num.length);
		    return this.mulTo(num, out);
		  };

		  // Multiply employing FFT
		  BN.prototype.mulf = function mulf (num) {
		    var out = new BN(null);
		    out.words = new Array(this.length + num.length);
		    return jumboMulTo(this, num, out);
		  };

		  // In-place Multiplication
		  BN.prototype.imul = function imul (num) {
		    return this.clone().mulTo(num, this);
		  };

		  BN.prototype.imuln = function imuln (num) {
		    assert(typeof num === 'number');
		    assert(num < 0x4000000);

		    // Carry
		    var carry = 0;
		    for (var i = 0; i < this.length; i++) {
		      var w = (this.words[i] | 0) * num;
		      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);
		      carry >>= 26;
		      carry += (w / 0x4000000) | 0;
		      // NOTE: lo is 27bit maximum
		      carry += lo >>> 26;
		      this.words[i] = lo & 0x3ffffff;
		    }

		    if (carry !== 0) {
		      this.words[i] = carry;
		      this.length++;
		    }

		    return this;
		  };

		  BN.prototype.muln = function muln (num) {
		    return this.clone().imuln(num);
		  };

		  // `this` * `this`
		  BN.prototype.sqr = function sqr () {
		    return this.mul(this);
		  };

		  // `this` * `this` in-place
		  BN.prototype.isqr = function isqr () {
		    return this.imul(this.clone());
		  };

		  // Math.pow(`this`, `num`)
		  BN.prototype.pow = function pow (num) {
		    var w = toBitArray(num);
		    if (w.length === 0) return new BN(1);

		    // Skip leading zeroes
		    var res = this;
		    for (var i = 0; i < w.length; i++, res = res.sqr()) {
		      if (w[i] !== 0) break;
		    }

		    if (++i < w.length) {
		      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
		        if (w[i] === 0) continue;

		        res = res.mul(q);
		      }
		    }

		    return res;
		  };

		  // Shift-left in-place
		  BN.prototype.iushln = function iushln (bits) {
		    assert(typeof bits === 'number' && bits >= 0);
		    var r = bits % 26;
		    var s = (bits - r) / 26;
		    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);
		    var i;

		    if (r !== 0) {
		      var carry = 0;

		      for (i = 0; i < this.length; i++) {
		        var newCarry = this.words[i] & carryMask;
		        var c = ((this.words[i] | 0) - newCarry) << r;
		        this.words[i] = c | carry;
		        carry = newCarry >>> (26 - r);
		      }

		      if (carry) {
		        this.words[i] = carry;
		        this.length++;
		      }
		    }

		    if (s !== 0) {
		      for (i = this.length - 1; i >= 0; i--) {
		        this.words[i + s] = this.words[i];
		      }

		      for (i = 0; i < s; i++) {
		        this.words[i] = 0;
		      }

		      this.length += s;
		    }

		    return this.strip();
		  };

		  BN.prototype.ishln = function ishln (bits) {
		    // TODO(indutny): implement me
		    assert(this.negative === 0);
		    return this.iushln(bits);
		  };

		  // Shift-right in-place
		  // NOTE: `hint` is a lowest bit before trailing zeroes
		  // NOTE: if `extended` is present - it will be filled with destroyed bits
		  BN.prototype.iushrn = function iushrn (bits, hint, extended) {
		    assert(typeof bits === 'number' && bits >= 0);
		    var h;
		    if (hint) {
		      h = (hint - (hint % 26)) / 26;
		    } else {
		      h = 0;
		    }

		    var r = bits % 26;
		    var s = Math.min((bits - r) / 26, this.length);
		    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
		    var maskedWords = extended;

		    h -= s;
		    h = Math.max(0, h);

		    // Extended mode, copy masked part
		    if (maskedWords) {
		      for (var i = 0; i < s; i++) {
		        maskedWords.words[i] = this.words[i];
		      }
		      maskedWords.length = s;
		    }

		    if (s === 0) {
		      // No-op, we should not move anything at all
		    } else if (this.length > s) {
		      this.length -= s;
		      for (i = 0; i < this.length; i++) {
		        this.words[i] = this.words[i + s];
		      }
		    } else {
		      this.words[0] = 0;
		      this.length = 1;
		    }

		    var carry = 0;
		    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {
		      var word = this.words[i] | 0;
		      this.words[i] = (carry << (26 - r)) | (word >>> r);
		      carry = word & mask;
		    }

		    // Push carried bits as a mask
		    if (maskedWords && carry !== 0) {
		      maskedWords.words[maskedWords.length++] = carry;
		    }

		    if (this.length === 0) {
		      this.words[0] = 0;
		      this.length = 1;
		    }

		    return this.strip();
		  };

		  BN.prototype.ishrn = function ishrn (bits, hint, extended) {
		    // TODO(indutny): implement me
		    assert(this.negative === 0);
		    return this.iushrn(bits, hint, extended);
		  };

		  // Shift-left
		  BN.prototype.shln = function shln (bits) {
		    return this.clone().ishln(bits);
		  };

		  BN.prototype.ushln = function ushln (bits) {
		    return this.clone().iushln(bits);
		  };

		  // Shift-right
		  BN.prototype.shrn = function shrn (bits) {
		    return this.clone().ishrn(bits);
		  };

		  BN.prototype.ushrn = function ushrn (bits) {
		    return this.clone().iushrn(bits);
		  };

		  // Test if n bit is set
		  BN.prototype.testn = function testn (bit) {
		    assert(typeof bit === 'number' && bit >= 0);
		    var r = bit % 26;
		    var s = (bit - r) / 26;
		    var q = 1 << r;

		    // Fast case: bit is much higher than all existing words
		    if (this.length <= s) return false;

		    // Check bit and return
		    var w = this.words[s];

		    return !!(w & q);
		  };

		  // Return only lowers bits of number (in-place)
		  BN.prototype.imaskn = function imaskn (bits) {
		    assert(typeof bits === 'number' && bits >= 0);
		    var r = bits % 26;
		    var s = (bits - r) / 26;

		    assert(this.negative === 0, 'imaskn works only with positive numbers');

		    if (r !== 0) {
		      s++;
		    }
		    this.length = Math.min(s, this.length);

		    if (r !== 0) {
		      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
		      this.words[this.length - 1] &= mask;
		    }

		    return this.strip();
		  };

		  // Return only lowers bits of number
		  BN.prototype.maskn = function maskn (bits) {
		    return this.clone().imaskn(bits);
		  };

		  // Add plain number `num` to `this`
		  BN.prototype.iaddn = function iaddn (num) {
		    assert(typeof num === 'number');
		    assert(num < 0x4000000);
		    if (num < 0) return this.isubn(-num);

		    // Possible sign change
		    if (this.negative !== 0) {
		      if (this.length === 1 && (this.words[0] | 0) < num) {
		        this.words[0] = num - (this.words[0] | 0);
		        this.negative = 0;
		        return this;
		      }

		      this.negative = 0;
		      this.isubn(num);
		      this.negative = 1;
		      return this;
		    }

		    // Add without checks
		    return this._iaddn(num);
		  };

		  BN.prototype._iaddn = function _iaddn (num) {
		    this.words[0] += num;

		    // Carry
		    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {
		      this.words[i] -= 0x4000000;
		      if (i === this.length - 1) {
		        this.words[i + 1] = 1;
		      } else {
		        this.words[i + 1]++;
		      }
		    }
		    this.length = Math.max(this.length, i + 1);

		    return this;
		  };

		  // Subtract plain number `num` from `this`
		  BN.prototype.isubn = function isubn (num) {
		    assert(typeof num === 'number');
		    assert(num < 0x4000000);
		    if (num < 0) return this.iaddn(-num);

		    if (this.negative !== 0) {
		      this.negative = 0;
		      this.iaddn(num);
		      this.negative = 1;
		      return this;
		    }

		    this.words[0] -= num;

		    if (this.length === 1 && this.words[0] < 0) {
		      this.words[0] = -this.words[0];
		      this.negative = 1;
		    } else {
		      // Carry
		      for (var i = 0; i < this.length && this.words[i] < 0; i++) {
		        this.words[i] += 0x4000000;
		        this.words[i + 1] -= 1;
		      }
		    }

		    return this.strip();
		  };

		  BN.prototype.addn = function addn (num) {
		    return this.clone().iaddn(num);
		  };

		  BN.prototype.subn = function subn (num) {
		    return this.clone().isubn(num);
		  };

		  BN.prototype.iabs = function iabs () {
		    this.negative = 0;

		    return this;
		  };

		  BN.prototype.abs = function abs () {
		    return this.clone().iabs();
		  };

		  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {
		    var len = num.length + shift;
		    var i;

		    this._expand(len);

		    var w;
		    var carry = 0;
		    for (i = 0; i < num.length; i++) {
		      w = (this.words[i + shift] | 0) + carry;
		      var right = (num.words[i] | 0) * mul;
		      w -= right & 0x3ffffff;
		      carry = (w >> 26) - ((right / 0x4000000) | 0);
		      this.words[i + shift] = w & 0x3ffffff;
		    }
		    for (; i < this.length - shift; i++) {
		      w = (this.words[i + shift] | 0) + carry;
		      carry = w >> 26;
		      this.words[i + shift] = w & 0x3ffffff;
		    }

		    if (carry === 0) return this.strip();

		    // Subtraction overflow
		    assert(carry === -1);
		    carry = 0;
		    for (i = 0; i < this.length; i++) {
		      w = -(this.words[i] | 0) + carry;
		      carry = w >> 26;
		      this.words[i] = w & 0x3ffffff;
		    }
		    this.negative = 1;

		    return this.strip();
		  };

		  BN.prototype._wordDiv = function _wordDiv (num, mode) {
		    var shift = this.length - num.length;

		    var a = this.clone();
		    var b = num;

		    // Normalize
		    var bhi = b.words[b.length - 1] | 0;
		    var bhiBits = this._countBits(bhi);
		    shift = 26 - bhiBits;
		    if (shift !== 0) {
		      b = b.ushln(shift);
		      a.iushln(shift);
		      bhi = b.words[b.length - 1] | 0;
		    }

		    // Initialize quotient
		    var m = a.length - b.length;
		    var q;

		    if (mode !== 'mod') {
		      q = new BN(null);
		      q.length = m + 1;
		      q.words = new Array(q.length);
		      for (var i = 0; i < q.length; i++) {
		        q.words[i] = 0;
		      }
		    }

		    var diff = a.clone()._ishlnsubmul(b, 1, m);
		    if (diff.negative === 0) {
		      a = diff;
		      if (q) {
		        q.words[m] = 1;
		      }
		    }

		    for (var j = m - 1; j >= 0; j--) {
		      var qj = (a.words[b.length + j] | 0) * 0x4000000 +
		        (a.words[b.length + j - 1] | 0);

		      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max
		      // (0x7ffffff)
		      qj = Math.min((qj / bhi) | 0, 0x3ffffff);

		      a._ishlnsubmul(b, qj, j);
		      while (a.negative !== 0) {
		        qj--;
		        a.negative = 0;
		        a._ishlnsubmul(b, 1, j);
		        if (!a.isZero()) {
		          a.negative ^= 1;
		        }
		      }
		      if (q) {
		        q.words[j] = qj;
		      }
		    }
		    if (q) {
		      q.strip();
		    }
		    a.strip();

		    // Denormalize
		    if (mode !== 'div' && shift !== 0) {
		      a.iushrn(shift);
		    }

		    return {
		      div: q || null,
		      mod: a
		    };
		  };

		  // NOTE: 1) `mode` can be set to `mod` to request mod only,
		  //       to `div` to request div only, or be absent to
		  //       request both div & mod
		  //       2) `positive` is true if unsigned mod is requested
		  BN.prototype.divmod = function divmod (num, mode, positive) {
		    assert(!num.isZero());

		    if (this.isZero()) {
		      return {
		        div: new BN(0),
		        mod: new BN(0)
		      };
		    }

		    var div, mod, res;
		    if (this.negative !== 0 && num.negative === 0) {
		      res = this.neg().divmod(num, mode);

		      if (mode !== 'mod') {
		        div = res.div.neg();
		      }

		      if (mode !== 'div') {
		        mod = res.mod.neg();
		        if (positive && mod.negative !== 0) {
		          mod.iadd(num);
		        }
		      }

		      return {
		        div: div,
		        mod: mod
		      };
		    }

		    if (this.negative === 0 && num.negative !== 0) {
		      res = this.divmod(num.neg(), mode);

		      if (mode !== 'mod') {
		        div = res.div.neg();
		      }

		      return {
		        div: div,
		        mod: res.mod
		      };
		    }

		    if ((this.negative & num.negative) !== 0) {
		      res = this.neg().divmod(num.neg(), mode);

		      if (mode !== 'div') {
		        mod = res.mod.neg();
		        if (positive && mod.negative !== 0) {
		          mod.isub(num);
		        }
		      }

		      return {
		        div: res.div,
		        mod: mod
		      };
		    }

		    // Both numbers are positive at this point

		    // Strip both numbers to approximate shift value
		    if (num.length > this.length || this.cmp(num) < 0) {
		      return {
		        div: new BN(0),
		        mod: this
		      };
		    }

		    // Very short reduction
		    if (num.length === 1) {
		      if (mode === 'div') {
		        return {
		          div: this.divn(num.words[0]),
		          mod: null
		        };
		      }

		      if (mode === 'mod') {
		        return {
		          div: null,
		          mod: new BN(this.modn(num.words[0]))
		        };
		      }

		      return {
		        div: this.divn(num.words[0]),
		        mod: new BN(this.modn(num.words[0]))
		      };
		    }

		    return this._wordDiv(num, mode);
		  };

		  // Find `this` / `num`
		  BN.prototype.div = function div (num) {
		    return this.divmod(num, 'div', false).div;
		  };

		  // Find `this` % `num`
		  BN.prototype.mod = function mod (num) {
		    return this.divmod(num, 'mod', false).mod;
		  };

		  BN.prototype.umod = function umod (num) {
		    return this.divmod(num, 'mod', true).mod;
		  };

		  // Find Round(`this` / `num`)
		  BN.prototype.divRound = function divRound (num) {
		    var dm = this.divmod(num);

		    // Fast case - exact division
		    if (dm.mod.isZero()) return dm.div;

		    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;

		    var half = num.ushrn(1);
		    var r2 = num.andln(1);
		    var cmp = mod.cmp(half);

		    // Round down
		    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;

		    // Round up
		    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);
		  };

		  BN.prototype.modn = function modn (num) {
		    assert(num <= 0x3ffffff);
		    var p = (1 << 26) % num;

		    var acc = 0;
		    for (var i = this.length - 1; i >= 0; i--) {
		      acc = (p * acc + (this.words[i] | 0)) % num;
		    }

		    return acc;
		  };

		  // In-place division by number
		  BN.prototype.idivn = function idivn (num) {
		    assert(num <= 0x3ffffff);

		    var carry = 0;
		    for (var i = this.length - 1; i >= 0; i--) {
		      var w = (this.words[i] | 0) + carry * 0x4000000;
		      this.words[i] = (w / num) | 0;
		      carry = w % num;
		    }

		    return this.strip();
		  };

		  BN.prototype.divn = function divn (num) {
		    return this.clone().idivn(num);
		  };

		  BN.prototype.egcd = function egcd (p) {
		    assert(p.negative === 0);
		    assert(!p.isZero());

		    var x = this;
		    var y = p.clone();

		    if (x.negative !== 0) {
		      x = x.umod(p);
		    } else {
		      x = x.clone();
		    }

		    // A * x + B * y = x
		    var A = new BN(1);
		    var B = new BN(0);

		    // C * x + D * y = y
		    var C = new BN(0);
		    var D = new BN(1);

		    var g = 0;

		    while (x.isEven() && y.isEven()) {
		      x.iushrn(1);
		      y.iushrn(1);
		      ++g;
		    }

		    var yp = y.clone();
		    var xp = x.clone();

		    while (!x.isZero()) {
		      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);
		      if (i > 0) {
		        x.iushrn(i);
		        while (i-- > 0) {
		          if (A.isOdd() || B.isOdd()) {
		            A.iadd(yp);
		            B.isub(xp);
		          }

		          A.iushrn(1);
		          B.iushrn(1);
		        }
		      }

		      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);
		      if (j > 0) {
		        y.iushrn(j);
		        while (j-- > 0) {
		          if (C.isOdd() || D.isOdd()) {
		            C.iadd(yp);
		            D.isub(xp);
		          }

		          C.iushrn(1);
		          D.iushrn(1);
		        }
		      }

		      if (x.cmp(y) >= 0) {
		        x.isub(y);
		        A.isub(C);
		        B.isub(D);
		      } else {
		        y.isub(x);
		        C.isub(A);
		        D.isub(B);
		      }
		    }

		    return {
		      a: C,
		      b: D,
		      gcd: y.iushln(g)
		    };
		  };

		  // This is reduced incarnation of the binary EEA
		  // above, designated to invert members of the
		  // _prime_ fields F(p) at a maximal speed
		  BN.prototype._invmp = function _invmp (p) {
		    assert(p.negative === 0);
		    assert(!p.isZero());

		    var a = this;
		    var b = p.clone();

		    if (a.negative !== 0) {
		      a = a.umod(p);
		    } else {
		      a = a.clone();
		    }

		    var x1 = new BN(1);
		    var x2 = new BN(0);

		    var delta = b.clone();

		    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {
		      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);
		      if (i > 0) {
		        a.iushrn(i);
		        while (i-- > 0) {
		          if (x1.isOdd()) {
		            x1.iadd(delta);
		          }

		          x1.iushrn(1);
		        }
		      }

		      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);
		      if (j > 0) {
		        b.iushrn(j);
		        while (j-- > 0) {
		          if (x2.isOdd()) {
		            x2.iadd(delta);
		          }

		          x2.iushrn(1);
		        }
		      }

		      if (a.cmp(b) >= 0) {
		        a.isub(b);
		        x1.isub(x2);
		      } else {
		        b.isub(a);
		        x2.isub(x1);
		      }
		    }

		    var res;
		    if (a.cmpn(1) === 0) {
		      res = x1;
		    } else {
		      res = x2;
		    }

		    if (res.cmpn(0) < 0) {
		      res.iadd(p);
		    }

		    return res;
		  };

		  BN.prototype.gcd = function gcd (num) {
		    if (this.isZero()) return num.abs();
		    if (num.isZero()) return this.abs();

		    var a = this.clone();
		    var b = num.clone();
		    a.negative = 0;
		    b.negative = 0;

		    // Remove common factor of two
		    for (var shift = 0; a.isEven() && b.isEven(); shift++) {
		      a.iushrn(1);
		      b.iushrn(1);
		    }

		    do {
		      while (a.isEven()) {
		        a.iushrn(1);
		      }
		      while (b.isEven()) {
		        b.iushrn(1);
		      }

		      var r = a.cmp(b);
		      if (r < 0) {
		        // Swap `a` and `b` to make `a` always bigger than `b`
		        var t = a;
		        a = b;
		        b = t;
		      } else if (r === 0 || b.cmpn(1) === 0) {
		        break;
		      }

		      a.isub(b);
		    } while (true);

		    return b.iushln(shift);
		  };

		  // Invert number in the field F(num)
		  BN.prototype.invm = function invm (num) {
		    return this.egcd(num).a.umod(num);
		  };

		  BN.prototype.isEven = function isEven () {
		    return (this.words[0] & 1) === 0;
		  };

		  BN.prototype.isOdd = function isOdd () {
		    return (this.words[0] & 1) === 1;
		  };

		  // And first word and num
		  BN.prototype.andln = function andln (num) {
		    return this.words[0] & num;
		  };

		  // Increment at the bit position in-line
		  BN.prototype.bincn = function bincn (bit) {
		    assert(typeof bit === 'number');
		    var r = bit % 26;
		    var s = (bit - r) / 26;
		    var q = 1 << r;

		    // Fast case: bit is much higher than all existing words
		    if (this.length <= s) {
		      this._expand(s + 1);
		      this.words[s] |= q;
		      return this;
		    }

		    // Add bit and propagate, if needed
		    var carry = q;
		    for (var i = s; carry !== 0 && i < this.length; i++) {
		      var w = this.words[i] | 0;
		      w += carry;
		      carry = w >>> 26;
		      w &= 0x3ffffff;
		      this.words[i] = w;
		    }
		    if (carry !== 0) {
		      this.words[i] = carry;
		      this.length++;
		    }
		    return this;
		  };

		  BN.prototype.isZero = function isZero () {
		    return this.length === 1 && this.words[0] === 0;
		  };

		  BN.prototype.cmpn = function cmpn (num) {
		    var negative = num < 0;

		    if (this.negative !== 0 && !negative) return -1;
		    if (this.negative === 0 && negative) return 1;

		    this.strip();

		    var res;
		    if (this.length > 1) {
		      res = 1;
		    } else {
		      if (negative) {
		        num = -num;
		      }

		      assert(num <= 0x3ffffff, 'Number is too big');

		      var w = this.words[0] | 0;
		      res = w === num ? 0 : w < num ? -1 : 1;
		    }
		    if (this.negative !== 0) return -res | 0;
		    return res;
		  };

		  // Compare two numbers and return:
		  // 1 - if `this` > `num`
		  // 0 - if `this` == `num`
		  // -1 - if `this` < `num`
		  BN.prototype.cmp = function cmp (num) {
		    if (this.negative !== 0 && num.negative === 0) return -1;
		    if (this.negative === 0 && num.negative !== 0) return 1;

		    var res = this.ucmp(num);
		    if (this.negative !== 0) return -res | 0;
		    return res;
		  };

		  // Unsigned comparison
		  BN.prototype.ucmp = function ucmp (num) {
		    // At this point both numbers have the same sign
		    if (this.length > num.length) return 1;
		    if (this.length < num.length) return -1;

		    var res = 0;
		    for (var i = this.length - 1; i >= 0; i--) {
		      var a = this.words[i] | 0;
		      var b = num.words[i] | 0;

		      if (a === b) continue;
		      if (a < b) {
		        res = -1;
		      } else if (a > b) {
		        res = 1;
		      }
		      break;
		    }
		    return res;
		  };

		  BN.prototype.gtn = function gtn (num) {
		    return this.cmpn(num) === 1;
		  };

		  BN.prototype.gt = function gt (num) {
		    return this.cmp(num) === 1;
		  };

		  BN.prototype.gten = function gten (num) {
		    return this.cmpn(num) >= 0;
		  };

		  BN.prototype.gte = function gte (num) {
		    return this.cmp(num) >= 0;
		  };

		  BN.prototype.ltn = function ltn (num) {
		    return this.cmpn(num) === -1;
		  };

		  BN.prototype.lt = function lt (num) {
		    return this.cmp(num) === -1;
		  };

		  BN.prototype.lten = function lten (num) {
		    return this.cmpn(num) <= 0;
		  };

		  BN.prototype.lte = function lte (num) {
		    return this.cmp(num) <= 0;
		  };

		  BN.prototype.eqn = function eqn (num) {
		    return this.cmpn(num) === 0;
		  };

		  BN.prototype.eq = function eq (num) {
		    return this.cmp(num) === 0;
		  };

		  //
		  // A reduce context, could be using montgomery or something better, depending
		  // on the `m` itself.
		  //
		  BN.red = function red (num) {
		    return new Red(num);
		  };

		  BN.prototype.toRed = function toRed (ctx) {
		    assert(!this.red, 'Already a number in reduction context');
		    assert(this.negative === 0, 'red works only with positives');
		    return ctx.convertTo(this)._forceRed(ctx);
		  };

		  BN.prototype.fromRed = function fromRed () {
		    assert(this.red, 'fromRed works only with numbers in reduction context');
		    return this.red.convertFrom(this);
		  };

		  BN.prototype._forceRed = function _forceRed (ctx) {
		    this.red = ctx;
		    return this;
		  };

		  BN.prototype.forceRed = function forceRed (ctx) {
		    assert(!this.red, 'Already a number in reduction context');
		    return this._forceRed(ctx);
		  };

		  BN.prototype.redAdd = function redAdd (num) {
		    assert(this.red, 'redAdd works only with red numbers');
		    return this.red.add(this, num);
		  };

		  BN.prototype.redIAdd = function redIAdd (num) {
		    assert(this.red, 'redIAdd works only with red numbers');
		    return this.red.iadd(this, num);
		  };

		  BN.prototype.redSub = function redSub (num) {
		    assert(this.red, 'redSub works only with red numbers');
		    return this.red.sub(this, num);
		  };

		  BN.prototype.redISub = function redISub (num) {
		    assert(this.red, 'redISub works only with red numbers');
		    return this.red.isub(this, num);
		  };

		  BN.prototype.redShl = function redShl (num) {
		    assert(this.red, 'redShl works only with red numbers');
		    return this.red.shl(this, num);
		  };

		  BN.prototype.redMul = function redMul (num) {
		    assert(this.red, 'redMul works only with red numbers');
		    this.red._verify2(this, num);
		    return this.red.mul(this, num);
		  };

		  BN.prototype.redIMul = function redIMul (num) {
		    assert(this.red, 'redMul works only with red numbers');
		    this.red._verify2(this, num);
		    return this.red.imul(this, num);
		  };

		  BN.prototype.redSqr = function redSqr () {
		    assert(this.red, 'redSqr works only with red numbers');
		    this.red._verify1(this);
		    return this.red.sqr(this);
		  };

		  BN.prototype.redISqr = function redISqr () {
		    assert(this.red, 'redISqr works only with red numbers');
		    this.red._verify1(this);
		    return this.red.isqr(this);
		  };

		  // Square root over p
		  BN.prototype.redSqrt = function redSqrt () {
		    assert(this.red, 'redSqrt works only with red numbers');
		    this.red._verify1(this);
		    return this.red.sqrt(this);
		  };

		  BN.prototype.redInvm = function redInvm () {
		    assert(this.red, 'redInvm works only with red numbers');
		    this.red._verify1(this);
		    return this.red.invm(this);
		  };

		  // Return negative clone of `this` % `red modulo`
		  BN.prototype.redNeg = function redNeg () {
		    assert(this.red, 'redNeg works only with red numbers');
		    this.red._verify1(this);
		    return this.red.neg(this);
		  };

		  BN.prototype.redPow = function redPow (num) {
		    assert(this.red && !num.red, 'redPow(normalNum)');
		    this.red._verify1(this);
		    return this.red.pow(this, num);
		  };

		  // Prime numbers with efficient reduction
		  var primes = {
		    k256: null,
		    p224: null,
		    p192: null,
		    p25519: null
		  };

		  // Pseudo-Mersenne prime
		  function MPrime (name, p) {
		    // P = 2 ^ N - K
		    this.name = name;
		    this.p = new BN(p, 16);
		    this.n = this.p.bitLength();
		    this.k = new BN(1).iushln(this.n).isub(this.p);

		    this.tmp = this._tmp();
		  }

		  MPrime.prototype._tmp = function _tmp () {
		    var tmp = new BN(null);
		    tmp.words = new Array(Math.ceil(this.n / 13));
		    return tmp;
		  };

		  MPrime.prototype.ireduce = function ireduce (num) {
		    // Assumes that `num` is less than `P^2`
		    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)
		    var r = num;
		    var rlen;

		    do {
		      this.split(r, this.tmp);
		      r = this.imulK(r);
		      r = r.iadd(this.tmp);
		      rlen = r.bitLength();
		    } while (rlen > this.n);

		    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
		    if (cmp === 0) {
		      r.words[0] = 0;
		      r.length = 1;
		    } else if (cmp > 0) {
		      r.isub(this.p);
		    } else {
		      r.strip();
		    }

		    return r;
		  };

		  MPrime.prototype.split = function split (input, out) {
		    input.iushrn(this.n, 0, out);
		  };

		  MPrime.prototype.imulK = function imulK (num) {
		    return num.imul(this.k);
		  };

		  function K256 () {
		    MPrime.call(
		      this,
		      'k256',
		      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');
		  }
		  inherits(K256, MPrime);

		  K256.prototype.split = function split (input, output) {
		    // 256 = 9 * 26 + 22
		    var mask = 0x3fffff;

		    var outLen = Math.min(input.length, 9);
		    for (var i = 0; i < outLen; i++) {
		      output.words[i] = input.words[i];
		    }
		    output.length = outLen;

		    if (input.length <= 9) {
		      input.words[0] = 0;
		      input.length = 1;
		      return;
		    }

		    // Shift by 9 limbs
		    var prev = input.words[9];
		    output.words[output.length++] = prev & mask;

		    for (i = 10; i < input.length; i++) {
		      var next = input.words[i] | 0;
		      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);
		      prev = next;
		    }
		    prev >>>= 22;
		    input.words[i - 10] = prev;
		    if (prev === 0 && input.length > 10) {
		      input.length -= 10;
		    } else {
		      input.length -= 9;
		    }
		  };

		  K256.prototype.imulK = function imulK (num) {
		    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]
		    num.words[num.length] = 0;
		    num.words[num.length + 1] = 0;
		    num.length += 2;

		    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390
		    var lo = 0;
		    for (var i = 0; i < num.length; i++) {
		      var w = num.words[i] | 0;
		      lo += w * 0x3d1;
		      num.words[i] = lo & 0x3ffffff;
		      lo = w * 0x40 + ((lo / 0x4000000) | 0);
		    }

		    // Fast length reduction
		    if (num.words[num.length - 1] === 0) {
		      num.length--;
		      if (num.words[num.length - 1] === 0) {
		        num.length--;
		      }
		    }
		    return num;
		  };

		  function P224 () {
		    MPrime.call(
		      this,
		      'p224',
		      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');
		  }
		  inherits(P224, MPrime);

		  function P192 () {
		    MPrime.call(
		      this,
		      'p192',
		      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');
		  }
		  inherits(P192, MPrime);

		  function P25519 () {
		    // 2 ^ 255 - 19
		    MPrime.call(
		      this,
		      '25519',
		      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');
		  }
		  inherits(P25519, MPrime);

		  P25519.prototype.imulK = function imulK (num) {
		    // K = 0x13
		    var carry = 0;
		    for (var i = 0; i < num.length; i++) {
		      var hi = (num.words[i] | 0) * 0x13 + carry;
		      var lo = hi & 0x3ffffff;
		      hi >>>= 26;

		      num.words[i] = lo;
		      carry = hi;
		    }
		    if (carry !== 0) {
		      num.words[num.length++] = carry;
		    }
		    return num;
		  };

		  // Exported mostly for testing purposes, use plain name instead
		  BN._prime = function prime (name) {
		    // Cached version of prime
		    if (primes[name]) return primes[name];

		    var prime;
		    if (name === 'k256') {
		      prime = new K256();
		    } else if (name === 'p224') {
		      prime = new P224();
		    } else if (name === 'p192') {
		      prime = new P192();
		    } else if (name === 'p25519') {
		      prime = new P25519();
		    } else {
		      throw new Error('Unknown prime ' + name);
		    }
		    primes[name] = prime;

		    return prime;
		  };

		  //
		  // Base reduction engine
		  //
		  function Red (m) {
		    if (typeof m === 'string') {
		      var prime = BN._prime(m);
		      this.m = prime.p;
		      this.prime = prime;
		    } else {
		      assert(m.gtn(1), 'modulus must be greater than 1');
		      this.m = m;
		      this.prime = null;
		    }
		  }

		  Red.prototype._verify1 = function _verify1 (a) {
		    assert(a.negative === 0, 'red works only with positives');
		    assert(a.red, 'red works only with red numbers');
		  };

		  Red.prototype._verify2 = function _verify2 (a, b) {
		    assert((a.negative | b.negative) === 0, 'red works only with positives');
		    assert(a.red && a.red === b.red,
		      'red works only with red numbers');
		  };

		  Red.prototype.imod = function imod (a) {
		    if (this.prime) return this.prime.ireduce(a)._forceRed(this);
		    return a.umod(this.m)._forceRed(this);
		  };

		  Red.prototype.neg = function neg (a) {
		    if (a.isZero()) {
		      return a.clone();
		    }

		    return this.m.sub(a)._forceRed(this);
		  };

		  Red.prototype.add = function add (a, b) {
		    this._verify2(a, b);

		    var res = a.add(b);
		    if (res.cmp(this.m) >= 0) {
		      res.isub(this.m);
		    }
		    return res._forceRed(this);
		  };

		  Red.prototype.iadd = function iadd (a, b) {
		    this._verify2(a, b);

		    var res = a.iadd(b);
		    if (res.cmp(this.m) >= 0) {
		      res.isub(this.m);
		    }
		    return res;
		  };

		  Red.prototype.sub = function sub (a, b) {
		    this._verify2(a, b);

		    var res = a.sub(b);
		    if (res.cmpn(0) < 0) {
		      res.iadd(this.m);
		    }
		    return res._forceRed(this);
		  };

		  Red.prototype.isub = function isub (a, b) {
		    this._verify2(a, b);

		    var res = a.isub(b);
		    if (res.cmpn(0) < 0) {
		      res.iadd(this.m);
		    }
		    return res;
		  };

		  Red.prototype.shl = function shl (a, num) {
		    this._verify1(a);
		    return this.imod(a.ushln(num));
		  };

		  Red.prototype.imul = function imul (a, b) {
		    this._verify2(a, b);
		    return this.imod(a.imul(b));
		  };

		  Red.prototype.mul = function mul (a, b) {
		    this._verify2(a, b);
		    return this.imod(a.mul(b));
		  };

		  Red.prototype.isqr = function isqr (a) {
		    return this.imul(a, a.clone());
		  };

		  Red.prototype.sqr = function sqr (a) {
		    return this.mul(a, a);
		  };

		  Red.prototype.sqrt = function sqrt (a) {
		    if (a.isZero()) return a.clone();

		    var mod3 = this.m.andln(3);
		    assert(mod3 % 2 === 1);

		    // Fast case
		    if (mod3 === 3) {
		      var pow = this.m.add(new BN(1)).iushrn(2);
		      return this.pow(a, pow);
		    }

		    // Tonelli-Shanks algorithm (Totally unoptimized and slow)
		    //
		    // Find Q and S, that Q * 2 ^ S = (P - 1)
		    var q = this.m.subn(1);
		    var s = 0;
		    while (!q.isZero() && q.andln(1) === 0) {
		      s++;
		      q.iushrn(1);
		    }
		    assert(!q.isZero());

		    var one = new BN(1).toRed(this);
		    var nOne = one.redNeg();

		    // Find quadratic non-residue
		    // NOTE: Max is such because of generalized Riemann hypothesis.
		    var lpow = this.m.subn(1).iushrn(1);
		    var z = this.m.bitLength();
		    z = new BN(2 * z * z).toRed(this);

		    while (this.pow(z, lpow).cmp(nOne) !== 0) {
		      z.redIAdd(nOne);
		    }

		    var c = this.pow(z, q);
		    var r = this.pow(a, q.addn(1).iushrn(1));
		    var t = this.pow(a, q);
		    var m = s;
		    while (t.cmp(one) !== 0) {
		      var tmp = t;
		      for (var i = 0; tmp.cmp(one) !== 0; i++) {
		        tmp = tmp.redSqr();
		      }
		      assert(i < m);
		      var b = this.pow(c, new BN(1).iushln(m - i - 1));

		      r = r.redMul(b);
		      c = b.redSqr();
		      t = t.redMul(c);
		      m = i;
		    }

		    return r;
		  };

		  Red.prototype.invm = function invm (a) {
		    var inv = a._invmp(this.m);
		    if (inv.negative !== 0) {
		      inv.negative = 0;
		      return this.imod(inv).redNeg();
		    } else {
		      return this.imod(inv);
		    }
		  };

		  Red.prototype.pow = function pow (a, num) {
		    if (num.isZero()) return new BN(1);
		    if (num.cmpn(1) === 0) return a.clone();

		    var windowSize = 4;
		    var wnd = new Array(1 << windowSize);
		    wnd[0] = new BN(1).toRed(this);
		    wnd[1] = a;
		    for (var i = 2; i < wnd.length; i++) {
		      wnd[i] = this.mul(wnd[i - 1], a);
		    }

		    var res = wnd[0];
		    var current = 0;
		    var currentLen = 0;
		    var start = num.bitLength() % 26;
		    if (start === 0) {
		      start = 26;
		    }

		    for (i = num.length - 1; i >= 0; i--) {
		      var word = num.words[i];
		      for (var j = start - 1; j >= 0; j--) {
		        var bit = (word >> j) & 1;
		        if (res !== wnd[0]) {
		          res = this.sqr(res);
		        }

		        if (bit === 0 && current === 0) {
		          currentLen = 0;
		          continue;
		        }

		        current <<= 1;
		        current |= bit;
		        currentLen++;
		        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;

		        res = this.mul(res, wnd[current]);
		        currentLen = 0;
		        current = 0;
		      }
		      start = 26;
		    }

		    return res;
		  };

		  Red.prototype.convertTo = function convertTo (num) {
		    var r = num.umod(this.m);

		    return r === num ? r.clone() : r;
		  };

		  Red.prototype.convertFrom = function convertFrom (num) {
		    var res = num.clone();
		    res.red = null;
		    return res;
		  };

		  //
		  // Montgomery method engine
		  //

		  BN.mont = function mont (num) {
		    return new Mont(num);
		  };

		  function Mont (m) {
		    Red.call(this, m);

		    this.shift = this.m.bitLength();
		    if (this.shift % 26 !== 0) {
		      this.shift += 26 - (this.shift % 26);
		    }

		    this.r = new BN(1).iushln(this.shift);
		    this.r2 = this.imod(this.r.sqr());
		    this.rinv = this.r._invmp(this.m);

		    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);
		    this.minv = this.minv.umod(this.r);
		    this.minv = this.r.sub(this.minv);
		  }
		  inherits(Mont, Red);

		  Mont.prototype.convertTo = function convertTo (num) {
		    return this.imod(num.ushln(this.shift));
		  };

		  Mont.prototype.convertFrom = function convertFrom (num) {
		    var r = this.imod(num.mul(this.rinv));
		    r.red = null;
		    return r;
		  };

		  Mont.prototype.imul = function imul (a, b) {
		    if (a.isZero() || b.isZero()) {
		      a.words[0] = 0;
		      a.length = 1;
		      return a;
		    }

		    var t = a.imul(b);
		    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
		    var u = t.isub(c).iushrn(this.shift);
		    var res = u;

		    if (u.cmp(this.m) >= 0) {
		      res = u.isub(this.m);
		    } else if (u.cmpn(0) < 0) {
		      res = u.iadd(this.m);
		    }

		    return res._forceRed(this);
		  };

		  Mont.prototype.mul = function mul (a, b) {
		    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);

		    var t = a.mul(b);
		    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
		    var u = t.isub(c).iushrn(this.shift);
		    var res = u;
		    if (u.cmp(this.m) >= 0) {
		      res = u.isub(this.m);
		    } else if (u.cmpn(0) < 0) {
		      res = u.iadd(this.m);
		    }

		    return res._forceRed(this);
		  };

		  Mont.prototype.invm = function invm (a) {
		    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R
		    var res = this.imod(a._invmp(this.m).mul(this.r2));
		    return res._forceRed(this);
		  };
		})(typeof module === 'undefined' || module, this);

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(48)(module)))

	/***/ },
	/* 20 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.1.15 ToLength
		var toInteger = __webpack_require__(52)
		  , min       = Math.min;
		module.exports = function(it){
		  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991
		};

	/***/ },
	/* 21 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(setImmediate, clearImmediate) {var nextTick = __webpack_require__(3).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__(21).setImmediate, __webpack_require__(21).clearImmediate))

	/***/ },
	/* 22 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.1.13 ToObject(argument)
		var defined = __webpack_require__(37);
		module.exports = function(it){
		  return Object(defined(it));
		};

	/***/ },
	/* 23 */
	/***/ function(module, exports) {

		var hasOwnProperty = {}.hasOwnProperty;
		module.exports = function(it, key){
		  return hasOwnProperty.call(it, key);
		};

	/***/ },
	/* 24 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var transport = exports;

		// Exports utils
		transport.utils = __webpack_require__(765);

		// Export parser&framer
		transport.protocol = {};
		transport.protocol.base = __webpack_require__(177);
		transport.protocol.spdy = __webpack_require__(283);
		transport.protocol.http2 = __webpack_require__(129);

		// Window
		transport.Window = __webpack_require__(766);

		// Priority Tree
		transport.Priority = __webpack_require__(750);

		// Export Connection and Stream
		transport.Stream = __webpack_require__(764).Stream;
		transport.Connection = __webpack_require__(749).Connection;

		// Just for `transport.connection.create()`
		transport.connection = transport.Connection;


	/***/ },
	/* 25 */
	/***/ function(module, exports, __webpack_require__) {

		var dP         = __webpack_require__(16)
		  , createDesc = __webpack_require__(51);
		module.exports = __webpack_require__(15) ? function(object, key, value){
		  return dP.f(object, key, createDesc(1, value));
		} : function(object, key, value){
		  object[key] = value;
		  return object;
		};

	/***/ },
	/* 26 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var elliptic = exports;

		elliptic.version = __webpack_require__(296).version;
		elliptic.utils = __webpack_require__(618);
		elliptic.rand = __webpack_require__(196);
		elliptic.hmacDRBG = __webpack_require__(616);
		elliptic.curve = __webpack_require__(115);
		elliptic.curves = __webpack_require__(609);

		// Protocols
		elliptic.ec = __webpack_require__(610);
		elliptic.eddsa = __webpack_require__(613);


	/***/ },
	/* 27 */
	/***/ function(module, exports) {

		module.exports = function(it){
		  if(typeof it != 'function')throw TypeError(it + ' is not a function!');
		  return it;
		};

	/***/ },
	/* 28 */
	/***/ function(module, exports, __webpack_require__) {

		var global    = __webpack_require__(8)
		  , hide      = __webpack_require__(25)
		  , has       = __webpack_require__(23)
		  , SRC       = __webpack_require__(61)('src')
		  , TO_STRING = 'toString'
		  , $toString = Function[TO_STRING]
		  , TPL       = ('' + $toString).split(TO_STRING);

		__webpack_require__(40).inspectSource = function(it){
		  return $toString.call(it);
		};

		(module.exports = function(O, key, val, safe){
		  var isFunction = typeof val == 'function';
		  if(isFunction)has(val, 'name') || hide(val, 'name', key);
		  if(O[key] === val)return;
		  if(isFunction)has(val, SRC) || hide(val, SRC, O[key] ? '' + O[key] : TPL.join(String(key)));
		  if(O === global){
		    O[key] = val;
		  } else {
		    if(!safe){
		      delete O[key];
		      hide(O, key, val);
		    } else {
		      if(O[key])O[key] = val;
		      else hide(O, key, val);
		    }
		  }
		// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative
		})(Function.prototype, TO_STRING, function toString(){
		  return typeof this == 'function' && this[SRC] || $toString.call(this);
		});

	/***/ },
	/* 29 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1)
		  , fails   = __webpack_require__(9)
		  , defined = __webpack_require__(37)
		  , quot    = /"/g;
		// B.2.3.2.1 CreateHTML(string, tag, attribute, value)
		var createHTML = function(string, tag, attribute, value) {
		  var S  = String(defined(string))
		    , p1 = '<' + tag;
		  if(attribute !== '')p1 += ' ' + attribute + '="' + String(value).replace(quot, '&quot;') + '"';
		  return p1 + '>' + S + '</' + tag + '>';
		};
		module.exports = function(NAME, exec){
		  var O = {};
		  O[NAME] = exec(createHTML);
		  $export($export.P + $export.F * fails(function(){
		    var test = ''[NAME]('"');
		    return test !== test.toLowerCase() || test.split('"').length > 3;
		  }), 'String', O);
		};

	/***/ },
	/* 30 */
	/***/ function(module, exports, __webpack_require__) {

		// to indexed object, toObject with fallback for non-array-like ES3 strings
		var IObject = __webpack_require__(86)
		  , defined = __webpack_require__(37);
		module.exports = function(it){
		  return IObject(defined(it));
		};

	/***/ },
	/* 31 */
	/***/ 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.

		// resolves . and .. elements in a path array with directory names there
		// must be no slashes, empty elements, or device names (c:\) in the array
		// (so also no leading and trailing slashes - it does not distinguish
		// relative and absolute paths)
		function normalizeArray(parts, allowAboveRoot) {
		  // if the path tries to go above the root, `up` ends up > 0
		  var up = 0;
		  for (var i = parts.length - 1; i >= 0; i--) {
		    var last = parts[i];
		    if (last === '.') {
		      parts.splice(i, 1);
		    } else if (last === '..') {
		      parts.splice(i, 1);
		      up++;
		    } else if (up) {
		      parts.splice(i, 1);
		      up--;
		    }
		  }

		  // if the path is allowed to go above the root, restore leading ..s
		  if (allowAboveRoot) {
		    for (; up--; up) {
		      parts.unshift('..');
		    }
		  }

		  return parts;
		}

		// Split a filename into [root, dir, basename, ext], unix version
		// 'root' is just a slash, or nothing.
		var splitPathRe =
		    /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
		var splitPath = function(filename) {
		  return splitPathRe.exec(filename).slice(1);
		};

		// path.resolve([from ...], to)
		// posix version
		exports.resolve = function() {
		  var resolvedPath = '',
		      resolvedAbsolute = false;

		  for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
		    var path = (i >= 0) ? arguments[i] : process.cwd();

		    // Skip empty and invalid entries
		    if (typeof path !== 'string') {
		      throw new TypeError('Arguments to path.resolve must be strings');
		    } else if (!path) {
		      continue;
		    }

		    resolvedPath = path + '/' + resolvedPath;
		    resolvedAbsolute = path.charAt(0) === '/';
		  }

		  // At this point the path should be resolved to a full absolute path, but
		  // handle relative paths to be safe (might happen when process.cwd() fails)

		  // Normalize the path
		  resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {
		    return !!p;
		  }), !resolvedAbsolute).join('/');

		  return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
		};

		// path.normalize(path)
		// posix version
		exports.normalize = function(path) {
		  var isAbsolute = exports.isAbsolute(path),
		      trailingSlash = substr(path, -1) === '/';

		  // Normalize the path
		  path = normalizeArray(filter(path.split('/'), function(p) {
		    return !!p;
		  }), !isAbsolute).join('/');

		  if (!path && !isAbsolute) {
		    path = '.';
		  }
		  if (path && trailingSlash) {
		    path += '/';
		  }

		  return (isAbsolute ? '/' : '') + path;
		};

		// posix version
		exports.isAbsolute = function(path) {
		  return path.charAt(0) === '/';
		};

		// posix version
		exports.join = function() {
		  var paths = Array.prototype.slice.call(arguments, 0);
		  return exports.normalize(filter(paths, function(p, index) {
		    if (typeof p !== 'string') {
		      throw new TypeError('Arguments to path.join must be strings');
		    }
		    return p;
		  }).join('/'));
		};


		// path.relative(from, to)
		// posix version
		exports.relative = function(from, to) {
		  from = exports.resolve(from).substr(1);
		  to = exports.resolve(to).substr(1);

		  function trim(arr) {
		    var start = 0;
		    for (; start < arr.length; start++) {
		      if (arr[start] !== '') break;
		    }

		    var end = arr.length - 1;
		    for (; end >= 0; end--) {
		      if (arr[end] !== '') break;
		    }

		    if (start > end) return [];
		    return arr.slice(start, end - start + 1);
		  }

		  var fromParts = trim(from.split('/'));
		  var toParts = trim(to.split('/'));

		  var length = Math.min(fromParts.length, toParts.length);
		  var samePartsLength = length;
		  for (var i = 0; i < length; i++) {
		    if (fromParts[i] !== toParts[i]) {
		      samePartsLength = i;
		      break;
		    }
		  }

		  var outputParts = [];
		  for (var i = samePartsLength; i < fromParts.length; i++) {
		    outputParts.push('..');
		  }

		  outputParts = outputParts.concat(toParts.slice(samePartsLength));

		  return outputParts.join('/');
		};

		exports.sep = '/';
		exports.delimiter = ':';

		exports.dirname = function(path) {
		  var result = splitPath(path),
		      root = result[0],
		      dir = result[1];

		  if (!root && !dir) {
		    // No dirname whatsoever
		    return '.';
		  }

		  if (dir) {
		    // It has a dirname, strip trailing slash
		    dir = dir.substr(0, dir.length - 1);
		  }

		  return root + dir;
		};


		exports.basename = function(path, ext) {
		  var f = splitPath(path)[2];
		  // TODO: make this comparison case-insensitive on windows?
		  if (ext && f.substr(-1 * ext.length) === ext) {
		    f = f.substr(0, f.length - ext.length);
		  }
		  return f;
		};


		exports.extname = function(path) {
		  return splitPath(path)[3];
		};

		function filter (xs, f) {
		    if (xs.filter) return xs.filter(f);
		    var res = [];
		    for (var i = 0; i < xs.length; i++) {
		        if (f(xs[i], i, xs)) res.push(xs[i]);
		    }
		    return res;
		}

		// String.prototype.substr - negative index don't work in IE8
		var substr = 'ab'.substr(-1) === 'b'
		    ? function (str, start, len) { return str.substr(start, len) }
		    : function (str, start, len) {
		        if (start < 0) start = str.length + start;
		        return str.substr(start, len);
		    }
		;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 32 */
	/***/ function(module, exports, __webpack_require__) {

		var pIE            = __webpack_require__(87)
		  , createDesc     = __webpack_require__(51)
		  , toIObject      = __webpack_require__(30)
		  , toPrimitive    = __webpack_require__(42)
		  , has            = __webpack_require__(23)
		  , IE8_DOM_DEFINE = __webpack_require__(218)
		  , gOPD           = Object.getOwnPropertyDescriptor;

		exports.f = __webpack_require__(15) ? gOPD : function getOwnPropertyDescriptor(O, P){
		  O = toIObject(O);
		  P = toPrimitive(P, true);
		  if(IE8_DOM_DEFINE)try {
		    return gOPD(O, P);
		  } catch(e){ /* empty */ }
		  if(has(O, P))return createDesc(!pIE.f.call(O, P), O[P]);
		};

	/***/ },
	/* 33 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)
		var has         = __webpack_require__(23)
		  , toObject    = __webpack_require__(22)
		  , IE_PROTO    = __webpack_require__(155)('IE_PROTO')
		  , ObjectProto = Object.prototype;

		module.exports = Object.getPrototypeOf || function(O){
		  O = toObject(O);
		  if(has(O, IE_PROTO))return O[IE_PROTO];
		  if(typeof O.constructor == 'function' && O instanceof O.constructor){
		    return O.constructor.prototype;
		  } return O instanceof Object ? ObjectProto : null;
		};

	/***/ },
	/* 34 */
	/***/ function(module, exports, __webpack_require__) {

		// http://wiki.commonjs.org/wiki/Unit_Testing/1.0
		//
		// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!
		//
		// Originally from narwhal.js (http://narwhaljs.org)
		// Copyright (c) 2009 Thomas Robinson <280north.com>
		//
		// Permission is hereby granted, free of charge, to any person obtaining a copy
		// of this software and associated documentation files (the 'Software'), to
		// deal in the Software without restriction, including without limitation the
		// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
		// sell copies of the Software, and to permit persons to whom the Software is
		// furnished to do so, subject to the following conditions:
		//
		// The above copyright notice and this permission notice shall be included in
		// all copies or substantial portions of the Software.
		//
		// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
		// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
		// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
		// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
		// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
		// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

		// when used in node, this will actually load the util module we depend on
		// versus loading the builtin util module as happens otherwise
		// this is a bug in node module loading as far as I am concerned
		var util = __webpack_require__(11);

		var pSlice = Array.prototype.slice;
		var hasOwn = Object.prototype.hasOwnProperty;

		// 1. The assert module provides functions that throw
		// AssertionError's when particular conditions are not met. The
		// assert module must conform to the following interface.

		var assert = module.exports = ok;

		// 2. The AssertionError is defined in assert.
		// new assert.AssertionError({ message: message,
		//                             actual: actual,
		//                             expected: expected })

		assert.AssertionError = function AssertionError(options) {
		  this.name = 'AssertionError';
		  this.actual = options.actual;
		  this.expected = options.expected;
		  this.operator = options.operator;
		  if (options.message) {
		    this.message = options.message;
		    this.generatedMessage = false;
		  } else {
		    this.message = getMessage(this);
		    this.generatedMessage = true;
		  }
		  var stackStartFunction = options.stackStartFunction || fail;

		  if (Error.captureStackTrace) {
		    Error.captureStackTrace(this, stackStartFunction);
		  }
		  else {
		    // non v8 browsers so we can have a stacktrace
		    var err = new Error();
		    if (err.stack) {
		      var out = err.stack;

		      // try to strip useless frames
		      var fn_name = stackStartFunction.name;
		      var idx = out.indexOf('\n' + fn_name);
		      if (idx >= 0) {
		        // once we have located the function frame
		        // we need to strip out everything before it (and its line)
		        var next_line = out.indexOf('\n', idx + 1);
		        out = out.substring(next_line + 1);
		      }

		      this.stack = out;
		    }
		  }
		};

		// assert.AssertionError instanceof Error
		util.inherits(assert.AssertionError, Error);

		function replacer(key, value) {
		  if (util.isUndefined(value)) {
		    return '' + value;
		  }
		  if (util.isNumber(value) && !isFinite(value)) {
		    return value.toString();
		  }
		  if (util.isFunction(value) || util.isRegExp(value)) {
		    return value.toString();
		  }
		  return value;
		}

		function truncate(s, n) {
		  if (util.isString(s)) {
		    return s.length < n ? s : s.slice(0, n);
		  } else {
		    return s;
		  }
		}

		function getMessage(self) {
		  return truncate(JSON.stringify(self.actual, replacer), 128) + ' ' +
		         self.operator + ' ' +
		         truncate(JSON.stringify(self.expected, replacer), 128);
		}

		// At present only the three keys mentioned above are used and
		// understood by the spec. Implementations or sub modules can pass
		// other keys to the AssertionError's constructor - they will be
		// ignored.

		// 3. All of the following functions must throw an AssertionError
		// when a corresponding condition is not met, with a message that
		// may be undefined if not provided.  All assertion methods provide
		// both the actual and expected values to the assertion error for
		// display purposes.

		function fail(actual, expected, message, operator, stackStartFunction) {
		  throw new assert.AssertionError({
		    message: message,
		    actual: actual,
		    expected: expected,
		    operator: operator,
		    stackStartFunction: stackStartFunction
		  });
		}

		// EXTENSION! allows for well behaved errors defined elsewhere.
		assert.fail = fail;

		// 4. Pure assertion tests whether a value is truthy, as determined
		// by !!guard.
		// assert.ok(guard, message_opt);
		// This statement is equivalent to assert.equal(true, !!guard,
		// message_opt);. To test strictly for the value true, use
		// assert.strictEqual(true, guard, message_opt);.

		function ok(value, message) {
		  if (!value) fail(value, true, message, '==', assert.ok);
		}
		assert.ok = ok;

		// 5. The equality assertion tests shallow, coercive equality with
		// ==.
		// assert.equal(actual, expected, message_opt);

		assert.equal = function equal(actual, expected, message) {
		  if (actual != expected) fail(actual, expected, message, '==', assert.equal);
		};

		// 6. The non-equality assertion tests for whether two objects are not equal
		// with != assert.notEqual(actual, expected, message_opt);

		assert.notEqual = function notEqual(actual, expected, message) {
		  if (actual == expected) {
		    fail(actual, expected, message, '!=', assert.notEqual);
		  }
		};

		// 7. The equivalence assertion tests a deep equality relation.
		// assert.deepEqual(actual, expected, message_opt);

		assert.deepEqual = function deepEqual(actual, expected, message) {
		  if (!_deepEqual(actual, expected)) {
		    fail(actual, expected, message, 'deepEqual', assert.deepEqual);
		  }
		};

		function _deepEqual(actual, expected) {
		  // 7.1. All identical values are equivalent, as determined by ===.
		  if (actual === expected) {
		    return true;

		  } else if (util.isBuffer(actual) && util.isBuffer(expected)) {
		    if (actual.length != expected.length) return false;

		    for (var i = 0; i < actual.length; i++) {
		      if (actual[i] !== expected[i]) return false;
		    }

		    return true;

		  // 7.2. If the expected value is a Date object, the actual value is
		  // equivalent if it is also a Date object that refers to the same time.
		  } else if (util.isDate(actual) && util.isDate(expected)) {
		    return actual.getTime() === expected.getTime();

		  // 7.3 If the expected value is a RegExp object, the actual value is
		  // equivalent if it is also a RegExp object with the same source and
		  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
		  } else if (util.isRegExp(actual) && util.isRegExp(expected)) {
		    return actual.source === expected.source &&
		           actual.global === expected.global &&
		           actual.multiline === expected.multiline &&
		           actual.lastIndex === expected.lastIndex &&
		           actual.ignoreCase === expected.ignoreCase;

		  // 7.4. Other pairs that do not both pass typeof value == 'object',
		  // equivalence is determined by ==.
		  } else if (!util.isObject(actual) && !util.isObject(expected)) {
		    return actual == expected;

		  // 7.5 For all other Object pairs, including Array objects, equivalence is
		  // determined by having the same number of owned properties (as verified
		  // with Object.prototype.hasOwnProperty.call), the same set of keys
		  // (although not necessarily the same order), equivalent values for every
		  // corresponding key, and an identical 'prototype' property. Note: this
		  // accounts for both named and indexed properties on Arrays.
		  } else {
		    return objEquiv(actual, expected);
		  }
		}

		function isArguments(object) {
		  return Object.prototype.toString.call(object) == '[object Arguments]';
		}

		function objEquiv(a, b) {
		  if (util.isNullOrUndefined(a) || util.isNullOrUndefined(b))
		    return false;
		  // an identical 'prototype' property.
		  if (a.prototype !== b.prototype) return false;
		  // if one is a primitive, the other must be same
		  if (util.isPrimitive(a) || util.isPrimitive(b)) {
		    return a === b;
		  }
		  var aIsArgs = isArguments(a),
		      bIsArgs = isArguments(b);
		  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
		    return false;
		  if (aIsArgs) {
		    a = pSlice.call(a);
		    b = pSlice.call(b);
		    return _deepEqual(a, b);
		  }
		  var ka = objectKeys(a),
		      kb = objectKeys(b),
		      key, i;
		  // having the same number of owned properties (keys incorporates
		  // hasOwnProperty)
		  if (ka.length != kb.length)
		    return false;
		  //the same set of keys (although not necessarily the same order),
		  ka.sort();
		  kb.sort();
		  //~~~cheap key test
		  for (i = ka.length - 1; i >= 0; i--) {
		    if (ka[i] != kb[i])
		      return false;
		  }
		  //equivalent values for every corresponding key, and
		  //~~~possibly expensive deep test
		  for (i = ka.length - 1; i >= 0; i--) {
		    key = ka[i];
		    if (!_deepEqual(a[key], b[key])) return false;
		  }
		  return true;
		}

		// 8. The non-equivalence assertion tests for any deep inequality.
		// assert.notDeepEqual(actual, expected, message_opt);

		assert.notDeepEqual = function notDeepEqual(actual, expected, message) {
		  if (_deepEqual(actual, expected)) {
		    fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);
		  }
		};

		// 9. The strict equality assertion tests strict equality, as determined by ===.
		// assert.strictEqual(actual, expected, message_opt);

		assert.strictEqual = function strictEqual(actual, expected, message) {
		  if (actual !== expected) {
		    fail(actual, expected, message, '===', assert.strictEqual);
		  }
		};

		// 10. The strict non-equality assertion tests for strict inequality, as
		// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);

		assert.notStrictEqual = function notStrictEqual(actual, expected, message) {
		  if (actual === expected) {
		    fail(actual, expected, message, '!==', assert.notStrictEqual);
		  }
		};

		function expectedException(actual, expected) {
		  if (!actual || !expected) {
		    return false;
		  }

		  if (Object.prototype.toString.call(expected) == '[object RegExp]') {
		    return expected.test(actual);
		  } else if (actual instanceof expected) {
		    return true;
		  } else if (expected.call({}, actual) === true) {
		    return true;
		  }

		  return false;
		}

		function _throws(shouldThrow, block, expected, message) {
		  var actual;

		  if (util.isString(expected)) {
		    message = expected;
		    expected = null;
		  }

		  try {
		    block();
		  } catch (e) {
		    actual = e;
		  }

		  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +
		            (message ? ' ' + message : '.');

		  if (shouldThrow && !actual) {
		    fail(actual, expected, 'Missing expected exception' + message);
		  }

		  if (!shouldThrow && expectedException(actual, expected)) {
		    fail(actual, expected, 'Got unwanted exception' + message);
		  }

		  if ((shouldThrow && actual && expected &&
		      !expectedException(actual, expected)) || (!shouldThrow && actual)) {
		    throw actual;
		  }
		}

		// 11. Expected to throw an error:
		// assert.throws(block, Error_opt, message_opt);

		assert.throws = function(block, /*optional*/error, /*optional*/message) {
		  _throws.apply(this, [true].concat(pSlice.call(arguments)));
		};

		// EXTENSION! This is annoying to write outside this module.
		assert.doesNotThrow = function(block, /*optional*/message) {
		  _throws.apply(this, [false].concat(pSlice.call(arguments)));
		};

		assert.ifError = function(err) { if (err) {throw err;}};

		var objectKeys = Object.keys || function (obj) {
		  var keys = [];
		  for (var key in obj) {
		    if (hasOwn.call(obj, key)) keys.push(key);
		  }
		  return keys;
		};


	/***/ },
	/* 35 */
	/***/ function(module, exports, __webpack_require__) {

		var basex = __webpack_require__(358)
		var ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'
		var base58 = basex(ALPHABET)

		module.exports = {
		  encode: base58.encode,
		  decode: base58.decode
		}


	/***/ },
	/* 36 */
	/***/ function(module, exports) {

		var toString = {}.toString;

		module.exports = function(it){
		  return toString.call(it).slice(8, -1);
		};

	/***/ },
	/* 37 */
	/***/ function(module, exports) {

		// 7.2.1 RequireObjectCoercible(argument)
		module.exports = function(it){
		  if(it == undefined)throw TypeError("Can't call method on  " + it);
		  return it;
		};

	/***/ },
	/* 38 */
	/***/ function(module, exports, __webpack_require__) {

		var fails = __webpack_require__(9);

		module.exports = function(method, arg){
		  return !!method && fails(function(){
		    arg ? method.call(null, function(){}, 1) : method.call(null);
		  });
		};

	/***/ },
	/* 39 */
	/***/ function(module, exports, __webpack_require__) {

		// 0 -> Array#forEach
		// 1 -> Array#map
		// 2 -> Array#filter
		// 3 -> Array#some
		// 4 -> Array#every
		// 5 -> Array#find
		// 6 -> Array#findIndex
		var ctx      = __webpack_require__(44)
		  , IObject  = __webpack_require__(86)
		  , toObject = __webpack_require__(22)
		  , toLength = __webpack_require__(20)
		  , asc      = __webpack_require__(408);
		module.exports = function(TYPE, $create){
		  var IS_MAP        = TYPE == 1
		    , IS_FILTER     = TYPE == 2
		    , IS_SOME       = TYPE == 3
		    , IS_EVERY      = TYPE == 4
		    , IS_FIND_INDEX = TYPE == 6
		    , NO_HOLES      = TYPE == 5 || IS_FIND_INDEX
		    , create        = $create || asc;
		  return function($this, callbackfn, that){
		    var O      = toObject($this)
		      , self   = IObject(O)
		      , f      = ctx(callbackfn, that, 3)
		      , length = toLength(self.length)
		      , index  = 0
		      , result = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined
		      , val, res;
		    for(;length > index; index++)if(NO_HOLES || index in self){
		      val = self[index];
		      res = f(val, index, O);
		      if(TYPE){
		        if(IS_MAP)result[index] = res;            // map
		        else if(res)switch(TYPE){
		          case 3: return true;                    // some
		          case 5: return val;                     // find
		          case 6: return index;                   // findIndex
		          case 2: result.push(val);               // filter
		        } else if(IS_EVERY)return false;          // every
		      }
		    }
		    return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : result;
		  };
		};

	/***/ },
	/* 40 */
	/***/ function(module, exports) {

		var core = module.exports = {version: '2.4.0'};
		if(typeof __e == 'number')__e = core; // eslint-disable-line no-undef

	/***/ },
	/* 41 */
	/***/ function(module, exports, __webpack_require__) {

		// most Object methods by ES6 should accept primitives
		var $export = __webpack_require__(1)
		  , core    = __webpack_require__(40)
		  , fails   = __webpack_require__(9);
		module.exports = function(KEY, exec){
		  var fn  = (core.Object || {})[KEY] || Object[KEY]
		    , exp = {};
		  exp[KEY] = exec(fn);
		  $export($export.S + $export.F * fails(function(){ fn(1); }), 'Object', exp);
		};

	/***/ },
	/* 42 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.1.1 ToPrimitive(input [, PreferredType])
		var isObject = __webpack_require__(12);
		// instead of the ES6 spec version, we didn't implement @@toPrimitive case
		// and the second argument - flag - preferred type is a string
		module.exports = function(it, S){
		  if(!isObject(it))return it;
		  var fn, val;
		  if(S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
		  if(typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it)))return val;
		  if(!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
		  throw TypeError("Can't convert object to primitive value");
		};

	/***/ },
	/* 43 */
	/***/ function(module, exports) {

		var toString = {}.toString;

		module.exports = Array.isArray || function (arr) {
		  return toString.call(arr) == '[object Array]';
		};


	/***/ },
	/* 44 */
	/***/ function(module, exports, __webpack_require__) {

		// optional / simple context binding
		var aFunction = __webpack_require__(27);
		module.exports = function(fn, that, length){
		  aFunction(fn);
		  if(that === undefined)return fn;
		  switch(length){
		    case 1: return function(a){
		      return fn.call(that, a);
		    };
		    case 2: return function(a, b){
		      return fn.call(that, a, b);
		    };
		    case 3: return function(a, b, c){
		      return fn.call(that, a, b, c);
		    };
		  }
		  return function(/* ...args */){
		    return fn.apply(that, arguments);
		  };
		};

	/***/ },
	/* 45 */
	/***/ function(module, exports, __webpack_require__) {

		var Map     = __webpack_require__(233)
		  , $export = __webpack_require__(1)
		  , shared  = __webpack_require__(113)('metadata')
		  , store   = shared.store || (shared.store = new (__webpack_require__(236)));

		var getOrCreateMetadataMap = function(target, targetKey, create){
		  var targetMetadata = store.get(target);
		  if(!targetMetadata){
		    if(!create)return undefined;
		    store.set(target, targetMetadata = new Map);
		  }
		  var keyMetadata = targetMetadata.get(targetKey);
		  if(!keyMetadata){
		    if(!create)return undefined;
		    targetMetadata.set(targetKey, keyMetadata = new Map);
		  } return keyMetadata;
		};
		var ordinaryHasOwnMetadata = function(MetadataKey, O, P){
		  var metadataMap = getOrCreateMetadataMap(O, P, false);
		  return metadataMap === undefined ? false : metadataMap.has(MetadataKey);
		};
		var ordinaryGetOwnMetadata = function(MetadataKey, O, P){
		  var metadataMap = getOrCreateMetadataMap(O, P, false);
		  return metadataMap === undefined ? undefined : metadataMap.get(MetadataKey);
		};
		var ordinaryDefineOwnMetadata = function(MetadataKey, MetadataValue, O, P){
		  getOrCreateMetadataMap(O, P, true).set(MetadataKey, MetadataValue);
		};
		var ordinaryOwnMetadataKeys = function(target, targetKey){
		  var metadataMap = getOrCreateMetadataMap(target, targetKey, false)
		    , keys        = [];
		  if(metadataMap)metadataMap.forEach(function(_, key){ keys.push(key); });
		  return keys;
		};
		var toMetaKey = function(it){
		  return it === undefined || typeof it == 'symbol' ? it : String(it);
		};
		var exp = function(O){
		  $export($export.S, 'Reflect', O);
		};

		module.exports = {
		  store: store,
		  map: getOrCreateMetadataMap,
		  has: ordinaryHasOwnMetadata,
		  get: ordinaryGetOwnMetadata,
		  set: ordinaryDefineOwnMetadata,
		  keys: ordinaryOwnMetadataKeys,
		  key: toMetaKey,
		  exp: exp
		};

	/***/ },
	/* 46 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		if(__webpack_require__(15)){
		  var LIBRARY             = __webpack_require__(54)
		    , global              = __webpack_require__(8)
		    , fails               = __webpack_require__(9)
		    , $export             = __webpack_require__(1)
		    , $typed              = __webpack_require__(114)
		    , $buffer             = __webpack_require__(162)
		    , ctx                 = __webpack_require__(44)
		    , anInstance          = __webpack_require__(49)
		    , propertyDesc        = __webpack_require__(51)
		    , hide                = __webpack_require__(25)
		    , redefineAll         = __webpack_require__(58)
		    , isInteger           = __webpack_require__(149)
		    , toInteger           = __webpack_require__(52)
		    , toLength            = __webpack_require__(20)
		    , toIndex             = __webpack_require__(60)
		    , toPrimitive         = __webpack_require__(42)
		    , has                 = __webpack_require__(23)
		    , same                = __webpack_require__(230)
		    , classof             = __webpack_require__(68)
		    , isObject            = __webpack_require__(12)
		    , toObject            = __webpack_require__(22)
		    , isArrayIter         = __webpack_require__(147)
		    , create              = __webpack_require__(55)
		    , getPrototypeOf      = __webpack_require__(33)
		    , gOPN                = __webpack_require__(56).f
		    , isIterable          = __webpack_require__(415)
		    , getIterFn           = __webpack_require__(164)
		    , uid                 = __webpack_require__(61)
		    , wks                 = __webpack_require__(13)
		    , createArrayMethod   = __webpack_require__(39)
		    , createArrayIncludes = __webpack_require__(103)
		    , speciesConstructor  = __webpack_require__(156)
		    , ArrayIterators      = __webpack_require__(165)
		    , Iterators           = __webpack_require__(53)
		    , $iterDetect         = __webpack_require__(109)
		    , setSpecies          = __webpack_require__(59)
		    , arrayFill           = __webpack_require__(140)
		    , arrayCopyWithin     = __webpack_require__(211)
		    , $DP                 = __webpack_require__(16)
		    , $GOPD               = __webpack_require__(32)
		    , dP                  = $DP.f
		    , gOPD                = $GOPD.f
		    , RangeError          = global.RangeError
		    , TypeError           = global.TypeError
		    , Uint8Array          = global.Uint8Array
		    , ARRAY_BUFFER        = 'ArrayBuffer'
		    , SHARED_BUFFER       = 'Shared' + ARRAY_BUFFER
		    , BYTES_PER_ELEMENT   = 'BYTES_PER_ELEMENT'
		    , PROTOTYPE           = 'prototype'
		    , ArrayProto          = Array[PROTOTYPE]
		    , $ArrayBuffer        = $buffer.ArrayBuffer
		    , $DataView           = $buffer.DataView
		    , arrayForEach        = createArrayMethod(0)
		    , arrayFilter         = createArrayMethod(2)
		    , arraySome           = createArrayMethod(3)
		    , arrayEvery          = createArrayMethod(4)
		    , arrayFind           = createArrayMethod(5)
		    , arrayFindIndex      = createArrayMethod(6)
		    , arrayIncludes       = createArrayIncludes(true)
		    , arrayIndexOf        = createArrayIncludes(false)
		    , arrayValues         = ArrayIterators.values
		    , arrayKeys           = ArrayIterators.keys
		    , arrayEntries        = ArrayIterators.entries
		    , arrayLastIndexOf    = ArrayProto.lastIndexOf
		    , arrayReduce         = ArrayProto.reduce
		    , arrayReduceRight    = ArrayProto.reduceRight
		    , arrayJoin           = ArrayProto.join
		    , arraySort           = ArrayProto.sort
		    , arraySlice          = ArrayProto.slice
		    , arrayToString       = ArrayProto.toString
		    , arrayToLocaleString = ArrayProto.toLocaleString
		    , ITERATOR            = wks('iterator')
		    , TAG                 = wks('toStringTag')
		    , TYPED_CONSTRUCTOR   = uid('typed_constructor')
		    , DEF_CONSTRUCTOR     = uid('def_constructor')
		    , ALL_CONSTRUCTORS    = $typed.CONSTR
		    , TYPED_ARRAY         = $typed.TYPED
		    , VIEW                = $typed.VIEW
		    , WRONG_LENGTH        = 'Wrong length!';

		  var $map = createArrayMethod(1, function(O, length){
		    return allocate(speciesConstructor(O, O[DEF_CONSTRUCTOR]), length);
		  });

		  var LITTLE_ENDIAN = fails(function(){
		    return new Uint8Array(new Uint16Array([1]).buffer)[0] === 1;
		  });

		  var FORCED_SET = !!Uint8Array && !!Uint8Array[PROTOTYPE].set && fails(function(){
		    new Uint8Array(1).set({});
		  });

		  var strictToLength = function(it, SAME){
		    if(it === undefined)throw TypeError(WRONG_LENGTH);
		    var number = +it
		      , length = toLength(it);
		    if(SAME && !same(number, length))throw RangeError(WRONG_LENGTH);
		    return length;
		  };

		  var toOffset = function(it, BYTES){
		    var offset = toInteger(it);
		    if(offset < 0 || offset % BYTES)throw RangeError('Wrong offset!');
		    return offset;
		  };

		  var validate = function(it){
		    if(isObject(it) && TYPED_ARRAY in it)return it;
		    throw TypeError(it + ' is not a typed array!');
		  };

		  var allocate = function(C, length){
		    if(!(isObject(C) && TYPED_CONSTRUCTOR in C)){
		      throw TypeError('It is not a typed array constructor!');
		    } return new C(length);
		  };

		  var speciesFromList = function(O, list){
		    return fromList(speciesConstructor(O, O[DEF_CONSTRUCTOR]), list);
		  };

		  var fromList = function(C, list){
		    var index  = 0
		      , length = list.length
		      , result = allocate(C, length);
		    while(length > index)result[index] = list[index++];
		    return result;
		  };

		  var addGetter = function(it, key, internal){
		    dP(it, key, {get: function(){ return this._d[internal]; }});
		  };

		  var $from = function from(source /*, mapfn, thisArg */){
		    var O       = toObject(source)
		      , aLen    = arguments.length
		      , mapfn   = aLen > 1 ? arguments[1] : undefined
		      , mapping = mapfn !== undefined
		      , iterFn  = getIterFn(O)
		      , i, length, values, result, step, iterator;
		    if(iterFn != undefined && !isArrayIter(iterFn)){
		      for(iterator = iterFn.call(O), values = [], i = 0; !(step = iterator.next()).done; i++){
		        values.push(step.value);
		      } O = values;
		    }
		    if(mapping && aLen > 2)mapfn = ctx(mapfn, arguments[2], 2);
		    for(i = 0, length = toLength(O.length), result = allocate(this, length); length > i; i++){
		      result[i] = mapping ? mapfn(O[i], i) : O[i];
		    }
		    return result;
		  };

		  var $of = function of(/*...items*/){
		    var index  = 0
		      , length = arguments.length
		      , result = allocate(this, length);
		    while(length > index)result[index] = arguments[index++];
		    return result;
		  };

		  // iOS Safari 6.x fails here
		  var TO_LOCALE_BUG = !!Uint8Array && fails(function(){ arrayToLocaleString.call(new Uint8Array(1)); });

		  var $toLocaleString = function toLocaleString(){
		    return arrayToLocaleString.apply(TO_LOCALE_BUG ? arraySlice.call(validate(this)) : validate(this), arguments);
		  };

		  var proto = {
		    copyWithin: function copyWithin(target, start /*, end */){
		      return arrayCopyWithin.call(validate(this), target, start, arguments.length > 2 ? arguments[2] : undefined);
		    },
		    every: function every(callbackfn /*, thisArg */){
		      return arrayEvery(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    fill: function fill(value /*, start, end */){ // eslint-disable-line no-unused-vars
		      return arrayFill.apply(validate(this), arguments);
		    },
		    filter: function filter(callbackfn /*, thisArg */){
		      return speciesFromList(this, arrayFilter(validate(this), callbackfn,
		        arguments.length > 1 ? arguments[1] : undefined));
		    },
		    find: function find(predicate /*, thisArg */){
		      return arrayFind(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    findIndex: function findIndex(predicate /*, thisArg */){
		      return arrayFindIndex(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    forEach: function forEach(callbackfn /*, thisArg */){
		      arrayForEach(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    indexOf: function indexOf(searchElement /*, fromIndex */){
		      return arrayIndexOf(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    includes: function includes(searchElement /*, fromIndex */){
		      return arrayIncludes(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    join: function join(separator){ // eslint-disable-line no-unused-vars
		      return arrayJoin.apply(validate(this), arguments);
		    },
		    lastIndexOf: function lastIndexOf(searchElement /*, fromIndex */){ // eslint-disable-line no-unused-vars
		      return arrayLastIndexOf.apply(validate(this), arguments);
		    },
		    map: function map(mapfn /*, thisArg */){
		      return $map(validate(this), mapfn, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    reduce: function reduce(callbackfn /*, initialValue */){ // eslint-disable-line no-unused-vars
		      return arrayReduce.apply(validate(this), arguments);
		    },
		    reduceRight: function reduceRight(callbackfn /*, initialValue */){ // eslint-disable-line no-unused-vars
		      return arrayReduceRight.apply(validate(this), arguments);
		    },
		    reverse: function reverse(){
		      var that   = this
		        , length = validate(that).length
		        , middle = Math.floor(length / 2)
		        , index  = 0
		        , value;
		      while(index < middle){
		        value         = that[index];
		        that[index++] = that[--length];
		        that[length]  = value;
		      } return that;
		    },
		    some: function some(callbackfn /*, thisArg */){
		      return arraySome(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);
		    },
		    sort: function sort(comparefn){
		      return arraySort.call(validate(this), comparefn);
		    },
		    subarray: function subarray(begin, end){
		      var O      = validate(this)
		        , length = O.length
		        , $begin = toIndex(begin, length);
		      return new (speciesConstructor(O, O[DEF_CONSTRUCTOR]))(
		        O.buffer,
		        O.byteOffset + $begin * O.BYTES_PER_ELEMENT,
		        toLength((end === undefined ? length : toIndex(end, length)) - $begin)
		      );
		    }
		  };

		  var $slice = function slice(start, end){
		    return speciesFromList(this, arraySlice.call(validate(this), start, end));
		  };

		  var $set = function set(arrayLike /*, offset */){
		    validate(this);
		    var offset = toOffset(arguments[1], 1)
		      , length = this.length
		      , src    = toObject(arrayLike)
		      , len    = toLength(src.length)
		      , index  = 0;
		    if(len + offset > length)throw RangeError(WRONG_LENGTH);
		    while(index < len)this[offset + index] = src[index++];
		  };

		  var $iterators = {
		    entries: function entries(){
		      return arrayEntries.call(validate(this));
		    },
		    keys: function keys(){
		      return arrayKeys.call(validate(this));
		    },
		    values: function values(){
		      return arrayValues.call(validate(this));
		    }
		  };

		  var isTAIndex = function(target, key){
		    return isObject(target)
		      && target[TYPED_ARRAY]
		      && typeof key != 'symbol'
		      && key in target
		      && String(+key) == String(key);
		  };
		  var $getDesc = function getOwnPropertyDescriptor(target, key){
		    return isTAIndex(target, key = toPrimitive(key, true))
		      ? propertyDesc(2, target[key])
		      : gOPD(target, key);
		  };
		  var $setDesc = function defineProperty(target, key, desc){
		    if(isTAIndex(target, key = toPrimitive(key, true))
		      && isObject(desc)
		      && has(desc, 'value')
		      && !has(desc, 'get')
		      && !has(desc, 'set')
		      // TODO: add validation descriptor w/o calling accessors
		      && !desc.configurable
		      && (!has(desc, 'writable') || desc.writable)
		      && (!has(desc, 'enumerable') || desc.enumerable)
		    ){
		      target[key] = desc.value;
		      return target;
		    } else return dP(target, key, desc);
		  };

		  if(!ALL_CONSTRUCTORS){
		    $GOPD.f = $getDesc;
		    $DP.f   = $setDesc;
		  }

		  $export($export.S + $export.F * !ALL_CONSTRUCTORS, 'Object', {
		    getOwnPropertyDescriptor: $getDesc,
		    defineProperty:           $setDesc
		  });

		  if(fails(function(){ arrayToString.call({}); })){
		    arrayToString = arrayToLocaleString = function toString(){
		      return arrayJoin.call(this);
		    }
		  }

		  var $TypedArrayPrototype$ = redefineAll({}, proto);
		  redefineAll($TypedArrayPrototype$, $iterators);
		  hide($TypedArrayPrototype$, ITERATOR, $iterators.values);
		  redefineAll($TypedArrayPrototype$, {
		    slice:          $slice,
		    set:            $set,
		    constructor:    function(){ /* noop */ },
		    toString:       arrayToString,
		    toLocaleString: $toLocaleString
		  });
		  addGetter($TypedArrayPrototype$, 'buffer', 'b');
		  addGetter($TypedArrayPrototype$, 'byteOffset', 'o');
		  addGetter($TypedArrayPrototype$, 'byteLength', 'l');
		  addGetter($TypedArrayPrototype$, 'length', 'e');
		  dP($TypedArrayPrototype$, TAG, {
		    get: function(){ return this[TYPED_ARRAY]; }
		  });

		  module.exports = function(KEY, BYTES, wrapper, CLAMPED){
		    CLAMPED = !!CLAMPED;
		    var NAME       = KEY + (CLAMPED ? 'Clamped' : '') + 'Array'
		      , ISNT_UINT8 = NAME != 'Uint8Array'
		      , GETTER     = 'get' + KEY
		      , SETTER     = 'set' + KEY
		      , TypedArray = global[NAME]
		      , Base       = TypedArray || {}
		      , TAC        = TypedArray && getPrototypeOf(TypedArray)
		      , FORCED     = !TypedArray || !$typed.ABV
		      , O          = {}
		      , TypedArrayPrototype = TypedArray && TypedArray[PROTOTYPE];
		    var getter = function(that, index){
		      var data = that._d;
		      return data.v[GETTER](index * BYTES + data.o, LITTLE_ENDIAN);
		    };
		    var setter = function(that, index, value){
		      var data = that._d;
		      if(CLAMPED)value = (value = Math.round(value)) < 0 ? 0 : value > 0xff ? 0xff : value & 0xff;
		      data.v[SETTER](index * BYTES + data.o, value, LITTLE_ENDIAN);
		    };
		    var addElement = function(that, index){
		      dP(that, index, {
		        get: function(){
		          return getter(this, index);
		        },
		        set: function(value){
		          return setter(this, index, value);
		        },
		        enumerable: true
		      });
		    };
		    if(FORCED){
		      TypedArray = wrapper(function(that, data, $offset, $length){
		        anInstance(that, TypedArray, NAME, '_d');
		        var index  = 0
		          , offset = 0
		          , buffer, byteLength, length, klass;
		        if(!isObject(data)){
		          length     = strictToLength(data, true)
		          byteLength = length * BYTES;
		          buffer     = new $ArrayBuffer(byteLength);
		        } else if(data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER){
		          buffer = data;
		          offset = toOffset($offset, BYTES);
		          var $len = data.byteLength;
		          if($length === undefined){
		            if($len % BYTES)throw RangeError(WRONG_LENGTH);
		            byteLength = $len - offset;
		            if(byteLength < 0)throw RangeError(WRONG_LENGTH);
		          } else {
		            byteLength = toLength($length) * BYTES;
		            if(byteLength + offset > $len)throw RangeError(WRONG_LENGTH);
		          }
		          length = byteLength / BYTES;
		        } else if(TYPED_ARRAY in data){
		          return fromList(TypedArray, data);
		        } else {
		          return $from.call(TypedArray, data);
		        }
		        hide(that, '_d', {
		          b: buffer,
		          o: offset,
		          l: byteLength,
		          e: length,
		          v: new $DataView(buffer)
		        });
		        while(index < length)addElement(that, index++);
		      });
		      TypedArrayPrototype = TypedArray[PROTOTYPE] = create($TypedArrayPrototype$);
		      hide(TypedArrayPrototype, 'constructor', TypedArray);
		    } else if(!$iterDetect(function(iter){
		      // V8 works with iterators, but fails in many other cases
		      // https://code.google.com/p/v8/issues/detail?id=4552
		      new TypedArray(null); // eslint-disable-line no-new
		      new TypedArray(iter); // eslint-disable-line no-new
		    }, true)){
		      TypedArray = wrapper(function(that, data, $offset, $length){
		        anInstance(that, TypedArray, NAME);
		        var klass;
		        // `ws` module bug, temporarily remove validation length for Uint8Array
		        // https://github.com/websockets/ws/pull/645
		        if(!isObject(data))return new Base(strictToLength(data, ISNT_UINT8));
		        if(data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER){
		          return $length !== undefined
		            ? new Base(data, toOffset($offset, BYTES), $length)
		            : $offset !== undefined
		              ? new Base(data, toOffset($offset, BYTES))
		              : new Base(data);
		        }
		        if(TYPED_ARRAY in data)return fromList(TypedArray, data);
		        return $from.call(TypedArray, data);
		      });
		      arrayForEach(TAC !== Function.prototype ? gOPN(Base).concat(gOPN(TAC)) : gOPN(Base), function(key){
		        if(!(key in TypedArray))hide(TypedArray, key, Base[key]);
		      });
		      TypedArray[PROTOTYPE] = TypedArrayPrototype;
		      if(!LIBRARY)TypedArrayPrototype.constructor = TypedArray;
		    }
		    var $nativeIterator   = TypedArrayPrototype[ITERATOR]
		      , CORRECT_ITER_NAME = !!$nativeIterator && ($nativeIterator.name == 'values' || $nativeIterator.name == undefined)
		      , $iterator         = $iterators.values;
		    hide(TypedArray, TYPED_CONSTRUCTOR, true);
		    hide(TypedArrayPrototype, TYPED_ARRAY, NAME);
		    hide(TypedArrayPrototype, VIEW, true);
		    hide(TypedArrayPrototype, DEF_CONSTRUCTOR, TypedArray);

		    if(CLAMPED ? new TypedArray(1)[TAG] != NAME : !(TAG in TypedArrayPrototype)){
		      dP(TypedArrayPrototype, TAG, {
		        get: function(){ return NAME; }
		      });
		    }

		    O[NAME] = TypedArray;

		    $export($export.G + $export.W + $export.F * (TypedArray != Base), O);

		    $export($export.S, NAME, {
		      BYTES_PER_ELEMENT: BYTES,
		      from: $from,
		      of: $of
		    });

		    if(!(BYTES_PER_ELEMENT in TypedArrayPrototype))hide(TypedArrayPrototype, BYTES_PER_ELEMENT, BYTES);

		    $export($export.P, NAME, proto);

		    setSpecies(NAME);

		    $export($export.P + $export.F * FORCED_SET, NAME, {set: $set});

		    $export($export.P + $export.F * !CORRECT_ITER_NAME, NAME, $iterators);

		    $export($export.P + $export.F * (TypedArrayPrototype.toString != arrayToString), NAME, {toString: arrayToString});

		    $export($export.P + $export.F * fails(function(){
		      new TypedArray(1).slice();
		    }), NAME, {slice: $slice});

		    $export($export.P + $export.F * (fails(function(){
		      return [1, 2].toLocaleString() != new TypedArray([1, 2]).toLocaleString()
		    }) || !fails(function(){
		      TypedArrayPrototype.toLocaleString.call([1, 2]);
		    })), NAME, {toLocaleString: $toLocaleString});

		    Iterators[NAME] = CORRECT_ITER_NAME ? $nativeIterator : $iterator;
		    if(!LIBRARY && !CORRECT_ITER_NAME)hide(TypedArrayPrototype, ITERATOR, $iterator);
		  };
		} else module.exports = function(){ /* empty */ };

	/***/ },
	/* 47 */
	/***/ function(module, exports, __webpack_require__) {

		/* 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, __webpack_require__(18)))

	/***/ },
	/* 48 */
	/***/ function(module, exports) {

		module.exports = function(module) {
			if(!module.webpackPolyfill) {
				module.deprecate = function() {};
				module.paths = [];
				// module.parent = undefined by default
				module.children = [];
				Object.defineProperty(module, "loaded", {
					enumerable: true,
					configurable: false,
					get: function() { return module.l; }
				});
				Object.defineProperty(module, "id", {
					enumerable: true,
					configurable: false,
					get: function() { return module.i; }
				});
				module.webpackPolyfill = 1;
			}
			return module;
		}


	/***/ },
	/* 49 */
	/***/ function(module, exports) {

		module.exports = function(it, Constructor, name, forbiddenField){
		  if(!(it instanceof Constructor) || (forbiddenField !== undefined && forbiddenField in it)){
		    throw TypeError(name + ': incorrect invocation!');
		  } return it;
		};

	/***/ },
	/* 50 */
	/***/ function(module, exports, __webpack_require__) {

		var META     = __webpack_require__(61)('meta')
		  , isObject = __webpack_require__(12)
		  , has      = __webpack_require__(23)
		  , setDesc  = __webpack_require__(16).f
		  , id       = 0;
		var isExtensible = Object.isExtensible || function(){
		  return true;
		};
		var FREEZE = !__webpack_require__(9)(function(){
		  return isExtensible(Object.preventExtensions({}));
		});
		var setMeta = function(it){
		  setDesc(it, META, {value: {
		    i: 'O' + ++id, // object ID
		    w: {}          // weak collections IDs
		  }});
		};
		var fastKey = function(it, create){
		  // return primitive with prefix
		  if(!isObject(it))return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;
		  if(!has(it, META)){
		    // can't set metadata to uncaught frozen object
		    if(!isExtensible(it))return 'F';
		    // not necessary to add metadata
		    if(!create)return 'E';
		    // add missing metadata
		    setMeta(it);
		  // return object ID
		  } return it[META].i;
		};
		var getWeak = function(it, create){
		  if(!has(it, META)){
		    // can't set metadata to uncaught frozen object
		    if(!isExtensible(it))return true;
		    // not necessary to add metadata
		    if(!create)return false;
		    // add missing metadata
		    setMeta(it);
		  // return hash weak collections IDs
		  } return it[META].w;
		};
		// add metadata on freeze-family methods calling
		var onFreeze = function(it){
		  if(FREEZE && meta.NEED && isExtensible(it) && !has(it, META))setMeta(it);
		  return it;
		};
		var meta = module.exports = {
		  KEY:      META,
		  NEED:     false,
		  fastKey:  fastKey,
		  getWeak:  getWeak,
		  onFreeze: onFreeze
		};

	/***/ },
	/* 51 */
	/***/ function(module, exports) {

		module.exports = function(bitmap, value){
		  return {
		    enumerable  : !(bitmap & 1),
		    configurable: !(bitmap & 2),
		    writable    : !(bitmap & 4),
		    value       : value
		  };
		};

	/***/ },
	/* 52 */
	/***/ function(module, exports) {

		// 7.1.4 ToInteger
		var ceil  = Math.ceil
		  , floor = Math.floor;
		module.exports = function(it){
		  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);
		};

	/***/ },
	/* 53 */
	/***/ function(module, exports) {

		module.exports = {};

	/***/ },
	/* 54 */
	/***/ function(module, exports) {

		module.exports = false;

	/***/ },
	/* 55 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])
		var anObject    = __webpack_require__(6)
		  , dPs         = __webpack_require__(223)
		  , enumBugKeys = __webpack_require__(143)
		  , IE_PROTO    = __webpack_require__(155)('IE_PROTO')
		  , Empty       = function(){ /* empty */ }
		  , PROTOTYPE   = 'prototype';

		// Create object with fake `null` prototype: use iframe Object with cleared prototype
		var createDict = function(){
		  // Thrash, waste and sodomy: IE GC bug
		  var iframe = __webpack_require__(142)('iframe')
		    , i      = enumBugKeys.length
		    , gt     = '>'
		    , iframeDocument;
		  iframe.style.display = 'none';
		  __webpack_require__(145).appendChild(iframe);
		  iframe.src = 'javascript:'; // eslint-disable-line no-script-url
		  // createDict = iframe.contentWindow.Object;
		  // html.removeChild(iframe);
		  iframeDocument = iframe.contentWindow.document;
		  iframeDocument.open();
		  iframeDocument.write('<script>document.F=Object</script' + gt);
		  iframeDocument.close();
		  createDict = iframeDocument.F;
		  while(i--)delete createDict[PROTOTYPE][enumBugKeys[i]];
		  return createDict();
		};

		module.exports = Object.create || function create(O, Properties){
		  var result;
		  if(O !== null){
		    Empty[PROTOTYPE] = anObject(O);
		    result = new Empty;
		    Empty[PROTOTYPE] = null;
		    // add "__proto__" for Object.getPrototypeOf polyfill
		    result[IE_PROTO] = O;
		  } else result = createDict();
		  return Properties === undefined ? result : dPs(result, Properties);
		};

	/***/ },
	/* 56 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)
		var $keys      = __webpack_require__(225)
		  , hiddenKeys = __webpack_require__(143).concat('length', 'prototype');

		exports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O){
		  return $keys(O, hiddenKeys);
		};

	/***/ },
	/* 57 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.14 / 15.2.3.14 Object.keys(O)
		var $keys       = __webpack_require__(225)
		  , enumBugKeys = __webpack_require__(143);

		module.exports = Object.keys || function keys(O){
		  return $keys(O, enumBugKeys);
		};

	/***/ },
	/* 58 */
	/***/ function(module, exports, __webpack_require__) {

		var redefine = __webpack_require__(28);
		module.exports = function(target, src, safe){
		  for(var key in src)redefine(target, key, src[key], safe);
		  return target;
		};

	/***/ },
	/* 59 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var global      = __webpack_require__(8)
		  , dP          = __webpack_require__(16)
		  , DESCRIPTORS = __webpack_require__(15)
		  , SPECIES     = __webpack_require__(13)('species');

		module.exports = function(KEY){
		  var C = global[KEY];
		  if(DESCRIPTORS && C && !C[SPECIES])dP.f(C, SPECIES, {
		    configurable: true,
		    get: function(){ return this; }
		  });
		};

	/***/ },
	/* 60 */
	/***/ function(module, exports, __webpack_require__) {

		var toInteger = __webpack_require__(52)
		  , max       = Math.max
		  , min       = Math.min;
		module.exports = function(index, length){
		  index = toInteger(index);
		  return index < 0 ? max(index + length, 0) : min(index, length);
		};

	/***/ },
	/* 61 */
	/***/ function(module, exports) {

		var id = 0
		  , px = Math.random();
		module.exports = function(key){
		  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));
		};

	/***/ },
	/* 62 */
	/***/ function(module, exports, __webpack_require__) {

		var hash = exports;

		hash.utils = __webpack_require__(629);
		hash.common = __webpack_require__(625);
		hash.sha = __webpack_require__(628);
		hash.ripemd = __webpack_require__(627);
		hash.hmac = __webpack_require__(626);

		// Proxy hash functions to the main object
		hash.sha1 = hash.sha.sha1;
		hash.sha256 = hash.sha.sha256;
		hash.sha224 = hash.sha.sha224;
		hash.sha384 = hash.sha.sha384;
		hash.sha512 = hash.sha.sha512;
		hash.ripemd160 = hash.ripemd.ripemd160;


	/***/ },
	/* 63 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(289);
		var Writable = __webpack_require__(180);

		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);
		  }
		}

	/***/ },
	/* 64 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var util = __webpack_require__(318);

		// Immutable block of data
		function Block(data, type) {
		  if (!data) {
		    throw new Error('Block must be constructed with data');
		  }

		  if (!(this instanceof Block)) {
		    return new Block(data);
		  }

		  if (data instanceof Buffer) {
		    this.data = data;
		  } else {
		    this.data = new Buffer(data);
		  }

		  this.key = util.hash(this.data);
		  this.type = type || 'protobuf';
		}

		Object.defineProperty(Block.prototype, 'extension', {
		  get: function get() {
		    switch (this.type) {
		      case 'protobuf':
		        return 'data';
		      case 'ipld':
		        return 'ipld';
		      default:
		        return this.type;
		    }
		  }
		});

		module.exports = Block;
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 65 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(193);
		var Writable = __webpack_require__(195);

		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);
		  }
		}

	/***/ },
	/* 66 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var Transform = __webpack_require__(5).Transform
		var inherits = __webpack_require__(2)
		var StringDecoder = __webpack_require__(14).StringDecoder
		module.exports = CipherBase
		inherits(CipherBase, Transform)
		function CipherBase (hashMode) {
		  Transform.call(this)
		  this.hashMode = typeof hashMode === 'string'
		  if (this.hashMode) {
		    this[hashMode] = this._finalOrDigest
		  } else {
		    this.final = this._finalOrDigest
		  }
		  this._decoder = null
		  this._encoding = null
		}
		CipherBase.prototype.update = function (data, inputEnc, outputEnc) {
		  if (typeof data === 'string') {
		    data = new Buffer(data, inputEnc)
		  }
		  var outData = this._update(data)
		  if (this.hashMode) {
		    return this
		  }
		  if (outputEnc) {
		    outData = this._toString(outData, outputEnc)
		  }
		  return outData
		}

		CipherBase.prototype.setAutoPadding = function () {}

		CipherBase.prototype.getAuthTag = function () {
		  throw new Error('trying to get auth tag in unsupported state')
		}

		CipherBase.prototype.setAuthTag = function () {
		  throw new Error('trying to set auth tag in unsupported state')
		}

		CipherBase.prototype.setAAD = function () {
		  throw new Error('trying to set aad in unsupported state')
		}

		CipherBase.prototype._transform = function (data, _, next) {
		  var err
		  try {
		    if (this.hashMode) {
		      this._update(data)
		    } else {
		      this.push(this._update(data))
		    }
		  } catch (e) {
		    err = e
		  } finally {
		    next(err)
		  }
		}
		CipherBase.prototype._flush = function (done) {
		  var err
		  try {
		    this.push(this._final())
		  } catch (e) {
		    err = e
		  } finally {
		    done(err)
		  }
		}
		CipherBase.prototype._finalOrDigest = function (outputEnc) {
		  var outData = this._final() || new Buffer('')
		  if (outputEnc) {
		    outData = this._toString(outData, outputEnc, true)
		  }
		  return outData
		}

		CipherBase.prototype._toString = function (value, enc, final) {
		  if (!this._decoder) {
		    this._decoder = new StringDecoder(enc)
		    this._encoding = enc
		  }
		  if (this._encoding !== enc) {
		    throw new Error('can\'t switch encodings')
		  }
		  var out = this._decoder.write(value)
		  if (final) {
		    out += this._decoder.end()
		  }
		  return out
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 67 */
	/***/ function(module, exports, __webpack_require__) {

		// 22.1.3.31 Array.prototype[@@unscopables]
		var UNSCOPABLES = __webpack_require__(13)('unscopables')
		  , ArrayProto  = Array.prototype;
		if(ArrayProto[UNSCOPABLES] == undefined)__webpack_require__(25)(ArrayProto, UNSCOPABLES, {});
		module.exports = function(key){
		  ArrayProto[UNSCOPABLES][key] = true;
		};

	/***/ },
	/* 68 */
	/***/ function(module, exports, __webpack_require__) {

		// getting tag from 19.1.3.6 Object.prototype.toString()
		var cof = __webpack_require__(36)
		  , TAG = __webpack_require__(13)('toStringTag')
		  // ES3 wrong here
		  , ARG = cof(function(){ return arguments; }()) == 'Arguments';

		// fallback for IE11 Script Access Denied error
		var tryGet = function(it, key){
		  try {
		    return it[key];
		  } catch(e){ /* empty */ }
		};

		module.exports = function(it){
		  var O, T, B;
		  return it === undefined ? 'Undefined' : it === null ? 'Null'
		    // @@toStringTag case
		    : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T
		    // builtinTag case
		    : ARG ? cof(O)
		    // ES3 arguments fallback
		    : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;
		};

	/***/ },
	/* 69 */
	/***/ function(module, exports, __webpack_require__) {

		var ctx         = __webpack_require__(44)
		  , call        = __webpack_require__(219)
		  , isArrayIter = __webpack_require__(147)
		  , anObject    = __webpack_require__(6)
		  , toLength    = __webpack_require__(20)
		  , getIterFn   = __webpack_require__(164)
		  , BREAK       = {}
		  , RETURN      = {};
		var exports = module.exports = function(iterable, entries, fn, that, ITERATOR){
		  var iterFn = ITERATOR ? function(){ return iterable; } : getIterFn(iterable)
		    , f      = ctx(fn, that, entries ? 2 : 1)
		    , index  = 0
		    , length, step, iterator, result;
		  if(typeof iterFn != 'function')throw TypeError(iterable + ' is not iterable!');
		  // fast case for arrays with default iterator
		  if(isArrayIter(iterFn))for(length = toLength(iterable.length); length > index; index++){
		    result = entries ? f(anObject(step = iterable[index])[0], step[1]) : f(iterable[index]);
		    if(result === BREAK || result === RETURN)return result;
		  } else for(iterator = iterFn.call(iterable); !(step = iterator.next()).done; ){
		    result = call(iterator, f, step.value, entries);
		    if(result === BREAK || result === RETURN)return result;
		  }
		};
		exports.BREAK  = BREAK;
		exports.RETURN = RETURN;

	/***/ },
	/* 70 */
	/***/ function(module, exports, __webpack_require__) {

		var def = __webpack_require__(16).f
		  , has = __webpack_require__(23)
		  , TAG = __webpack_require__(13)('toStringTag');

		module.exports = function(it, tag, stat){
		  if(it && !has(it = stat ? it : it.prototype, TAG))def(it, TAG, {configurable: true, value: tag});
		};

	/***/ },
	/* 71 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1)
		  , defined = __webpack_require__(37)
		  , fails   = __webpack_require__(9)
		  , spaces  = __webpack_require__(160)
		  , space   = '[' + spaces + ']'
		  , non     = '\u200b\u0085'
		  , ltrim   = RegExp('^' + space + space + '*')
		  , rtrim   = RegExp(space + space + '*$');

		var exporter = function(KEY, exec, ALIAS){
		  var exp   = {};
		  var FORCE = fails(function(){
		    return !!spaces[KEY]() || non[KEY]() != non;
		  });
		  var fn = exp[KEY] = FORCE ? exec(trim) : spaces[KEY];
		  if(ALIAS)exp[ALIAS] = fn;
		  $export($export.P + $export.F * FORCE, 'String', exp);
		};

		// 1 -> String#trimLeft
		// 2 -> String#trimRight
		// 3 -> String#trim
		var trim = exporter.trim = function(string, TYPE){
		  string = String(defined(string));
		  if(TYPE & 1)string = string.replace(ltrim, '');
		  if(TYPE & 2)string = string.replace(rtrim, '');
		  return string;
		};

		module.exports = exporter;

	/***/ },
	/* 72 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';
		var inherits = __webpack_require__(2)
		var md5 = __webpack_require__(237)
		var rmd160 = __webpack_require__(734)
		var sha = __webpack_require__(738)

		var Base = __webpack_require__(66)

		function HashNoConstructor(hash) {
		  Base.call(this, 'digest')

		  this._hash = hash
		  this.buffers = []
		}

		inherits(HashNoConstructor, Base)

		HashNoConstructor.prototype._update = function (data) {
		  this.buffers.push(data)
		}

		HashNoConstructor.prototype._final = function () {
		  var buf = Buffer.concat(this.buffers)
		  var r = this._hash(buf)
		  this.buffers = null

		  return r
		}

		function Hash(hash) {
		  Base.call(this, 'digest')

		  this._hash = hash
		}

		inherits(Hash, Base)

		Hash.prototype._update = function (data) {
		  this._hash.update(data)
		}

		Hash.prototype._final = function () {
		  return this._hash.digest()
		}

		module.exports = function createHash (alg) {
		  alg = alg.toLowerCase()
		  if ('md5' === alg) return new HashNoConstructor(md5)
		  if ('rmd160' === alg || 'ripemd160' === alg) return new HashNoConstructor(rmd160)

		  return new Hash(sha(alg))
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 73 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(241);
		var Writable = __webpack_require__(243);

		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);
		  }
		}

	/***/ },
	/* 74 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(244);
		var Writable = __webpack_require__(246);

		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);
		  }
		}

	/***/ },
	/* 75 */
	/***/ function(module, exports, __webpack_require__) {

		var hpack = exports;

		hpack.utils = __webpack_require__(641);
		hpack.huffman = __webpack_require__(638);
		hpack['static-table'] = __webpack_require__(639);
		hpack.table = __webpack_require__(640);

		hpack.decoder = __webpack_require__(635);
		hpack.decompressor = __webpack_require__(636);

		hpack.encoder = __webpack_require__(637);
		hpack.compressor = __webpack_require__(634);


	/***/ },
	/* 76 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(252);
		var Writable = __webpack_require__(254);

		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);
		  }
		}

	/***/ },
	/* 77 */
	/***/ function(module, exports) {

		module.exports = assert;

		function assert(val, msg) {
		  if (!val)
		    throw new Error(msg || 'Assertion failed');
		}

		assert.equal = function assertEqual(l, r, msg) {
		  if (l != r)
		    throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));
		};


	/***/ },
	/* 78 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(269);
		var Writable = __webpack_require__(271);

		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);
		  }
		}

	/***/ },
	/* 79 */
	/***/ 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__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(275);
		var Writable = __webpack_require__(277);

		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__(3)))

	/***/ },
	/* 80 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {// prototype class for hash functions
		function Hash (blockSize, finalSize) {
		  this._block = new Buffer(blockSize)
		  this._finalSize = finalSize
		  this._blockSize = blockSize
		  this._len = 0
		  this._s = 0
		}

		Hash.prototype.update = function (data, enc) {
		  if (typeof data === 'string') {
		    enc = enc || 'utf8'
		    data = new Buffer(data, enc)
		  }

		  var l = this._len += data.length
		  var 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')
		}

		module.exports = Hash

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 81 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(284);
		var Writable = __webpack_require__(286);

		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);
		  }
		}

	/***/ },
	/* 82 */
	/***/ function(module, exports, __webpack_require__) {

		var base = exports;

		base.Reporter = __webpack_require__(300).Reporter;
		base.DecoderBuffer = __webpack_require__(182).DecoderBuffer;
		base.EncoderBuffer = __webpack_require__(182).EncoderBuffer;
		base.Node = __webpack_require__(299);


	/***/ },
	/* 83 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		exports.ifRepoExists = function (repo, cb) {
		  repo.exists(function (err, exists) {
		    if (err) {
		      return cb(err);
		    }

		    if (exists === false) {
		      return cb(new Error('no ipfs repo found'));
		    }

		    cb();
		  });
		};

		exports.OFFLINE_ERROR = new Error('This command must be run in online mode. Try running \'ipfs daemon\' first.');

	/***/ },
	/* 84 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(361);
		var Writable = __webpack_require__(362);

		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);
		  }
		}

	/***/ },
	/* 85 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {module.exports = function xor (a, b) {
		  var length = Math.min(a.length, b.length)
		  var buffer = new Buffer(length)

		  for (var i = 0; i < length; ++i) {
		    buffer[i] = a[i] ^ b[i]
		  }

		  return buffer
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 86 */
	/***/ function(module, exports, __webpack_require__) {

		// fallback for non-array-like ES3 and non-enumerable old V8 strings
		var cof = __webpack_require__(36);
		module.exports = Object('z').propertyIsEnumerable(0) ? Object : function(it){
		  return cof(it) == 'String' ? it.split('') : Object(it);
		};

	/***/ },
	/* 87 */
	/***/ function(module, exports) {

		exports.f = {}.propertyIsEnumerable;

	/***/ },
	/* 88 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/** Used for native method references */
		var objectProto = Object.prototype;

		/** Used to resolve the internal [[Class]] of values */
		var toString = objectProto.toString;

		/** Used to detect if a method is native */
		var reNative = RegExp('^' +
		  String(toString)
		    .replace(/[.*+?^${}()|[\]\\]/g, '\\$&')
		    .replace(/toString| for [^\]]+/g, '.*?') + '$'
		);

		/**
		 * Checks if `value` is a native function.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if the `value` is a native function, else `false`.
		 */
		function isNative(value) {
		  return typeof value == 'function' && reNative.test(value);
		}

		module.exports = isNative;


	/***/ },
	/* 89 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {/*
		 * Id is an object representation of a peer Id. a peer Id is a multihash
		 */
		'use strict';


		var multihashing = __webpack_require__(122);
		var base58 = __webpack_require__(35);
		var forge = __webpack_require__(705);
		var protobuf = __webpack_require__(90);
		var path = __webpack_require__(31);

		// protobuf read from file
		var messages = protobuf(Buffer("ZW51bSBLZXlUeXBlIHsKCVJTQSA9IDA7Cn0KCm1lc3NhZ2UgUHVibGljS2V5IHsKCXJlcXVpcmVkIEtleVR5cGUgVHlwZSA9IDE7CglyZXF1aXJlZCBieXRlcyBEYXRhID0gMjsKfQoKbWVzc2FnZSBQcml2YXRlS2V5IHsKCXJlcXVpcmVkIEtleVR5cGUgVHlwZSA9IDE7CglyZXF1aXJlZCBieXRlcyBEYXRhID0gMjsKfQ==","base64"));

		exports = module.exports = Id;

		exports.Buffer = Buffer;

		function Id(id, privKey, pubKey) {
		  var self = this;

		  if (!(self instanceof Id)) {
		    throw new Error('Id must be called with new');
		  }

		  self.privKey = privKey;
		  self.pubKey = pubKey;
		  self.id = id; // multihash - sha256 - buffer

		  // pretty print
		  self.toPrint = function () {
		    return {
		      id: self.toB58String(),
		      privKey: privKey.toString('hex'),
		      pubKey: pubKey.toString('hex')
		    };
		  };

		  // encode/decode functions
		  self.toHexString = function () {
		    return self.id.toString('hex');
		  };

		  self.toBytes = function () {
		    return self.id;
		  };

		  self.toB58String = function () {
		    return base58.encode(self.id);
		  };
		}

		// unwrap the private key protobuf
		function unmarshal(key) {
		  return messages.PrivateKey.decode(key);
		}

		// create a public key protobuf to be base64 string stored in config
		function marshal(data, type) {
		  var epb;
		  if (type === 'Public') {
		    epb = messages.PublicKey.encode({
		      Type: 0,
		      Data: data
		    });
		  }

		  if (type === 'Private') {
		    epb = messages.PrivateKey.encode({
		      Type: 0,
		      Data: data
		    });
		  }

		  return epb;
		}

		// this returns a base64 encoded protobuf of the public key
		function formatKey(key, type) {
		  // create der buffer of public key asn.1 object
		  var der = forge.asn1.toDer(key);

		  // create forge buffer of der public key buffer
		  var fDerBuf = forge.util.createBuffer(der.data, 'binary');

		  // convert forge buffer to node buffer public key
		  var nDerBuf = new Buffer(fDerBuf.getBytes(), 'binary');

		  // protobuf the new DER bytes to the PublicKey Data: field
		  var marshalKey = marshal(nDerBuf, type);

		  // encode the protobuf public key to base64 string
		  var b64 = marshalKey.toString('base64');
		  return b64;
		}

		// generation
		exports.create = function (opts) {
		  opts = opts || {};
		  opts.bits = opts.bits || 2048;

		  // generate keys
		  var pair = forge.rsa.generateKeyPair({
		    bits: opts.bits,
		    e: 0x10001
		  });

		  // return the RSA public/private key to asn1 object
		  var asnPub = forge.pki.publicKeyToAsn1(pair.publicKey);
		  var asnPriv = forge.pki.privateKeyToAsn1(pair.privateKey);

		  // format the keys to protobuf base64 encoded string
		  var protoPublic64 = formatKey(asnPub, 'Public');
		  var protoPrivate64 = formatKey(asnPriv, 'Private');

		  // store the keys as a buffer
		  var bufProtoPub64 = new Buffer(protoPublic64, 'base64');
		  var bufProtoPriv64 = new Buffer(protoPrivate64, 'base64');

		  var mhId = multihashing(new Buffer(protoPublic64, 'base64'), 'sha2-256');

		  return new Id(mhId, bufProtoPriv64, bufProtoPub64);
		};

		exports.createFromHexString = function (str) {
		  return new Id(new Buffer(str, 'hex'));
		};

		exports.createFromBytes = function (buf) {
		  return new Id(buf);
		};

		exports.createFromB58String = function (str) {
		  return new Id(new Buffer(base58.decode(str)));
		};

		// Public Key input will be a buffer
		exports.createFromPubKey = function (pubKey) {
		  var buf = new Buffer(pubKey, 'base64');
		  var mhId = multihashing(buf, 'sha2-256');
		  return new Id(mhId, null, pubKey);
		};

		// Private key input will be a string
		exports.createFromPrivKey = function (privKey) {
		  // create a buffer from the base64 encoded string
		  var buf = new Buffer(privKey, 'base64');

		  // get the private key data from the protobuf
		  var mpk = unmarshal(buf);

		  // create a forge buffer
		  var fbuf = forge.util.createBuffer(mpk.Data.toString('binary'));

		  // create an asn1 object from the private key bytes saved in the protobuf Data: field
		  var asnPriv = forge.asn1.fromDer(fbuf);

		  // get the RSA privatekey data from the asn1 object
		  var privateKey = forge.pki.privateKeyFromAsn1(asnPriv);

		  // set the RSA public key to the modulus and exponent of the private key
		  var publicKey = forge.pki.rsa.setPublicKey(privateKey.n, privateKey.e);

		  // return the RSA public key to asn1 object
		  var asnPub = forge.pki.publicKeyToAsn1(publicKey);

		  // format the public key
		  var protoPublic64 = formatKey(asnPub, 'Public');

		  // buffer the public key for consistency before storing
		  var bufProtoPub64 = new Buffer(protoPublic64, 'base64');
		  var mhId = multihashing(new Buffer(protoPublic64, 'base64'), 'sha2-256');
		  return new Id(mhId, privKey, bufProtoPub64);
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 90 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var schema = __webpack_require__(710)
		var compile = __webpack_require__(727)

		module.exports = function (proto, opts) {
		  if (!opts) opts = {}
		  if (!proto) throw new Error('Pass in a .proto string or a protobuf-schema parsed object')

		  var sch = (typeof proto === 'object' && !Buffer.isBuffer(proto)) ? proto : schema.parse(proto)

		  // to not make toString,toJSON enumarable we make a fire-and-forget prototype
		  var Messages = function () {
		    var self = this

		    compile(sch, opts.encodings || {}).forEach(function (m) {
		      self[m.name] = m.values || m
		    })
		  }

		  Messages.prototype.toString = function () {
		    return schema.stringify(sch)
		  }

		  Messages.prototype.toJSON = function () {
		    return sch
		  }

		  return new Messages()
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 91 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(global, Buffer, process) {'use strict'

		function oldBrowser () {
		  throw new Error('secure random number generation not supported by this browser\nuse chrome, FireFox or Internet Explorer 11')
		}

		var crypto = global.crypto || global.msCrypto

		if (crypto && crypto.getRandomValues) {
		  module.exports = randomBytes
		} else {
		  module.exports = oldBrowser
		}

		function randomBytes (size, cb) {
		  // phantomjs needs to throw
		  if (size > 65536) throw new Error('requested too many random bytes')
		  // in case browserify  isn't using the Uint8Array version
		  var rawBytes = new global.Uint8Array(size)

		  // This will not work in older browsers.
		  // See https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues
		  if (size > 0) {  // getRandomValues fails on IE if size == 0
		    crypto.getRandomValues(rawBytes)
		  }
		  // phantomjs doesn't like a buffer being passed here
		  var bytes = new Buffer(rawBytes.buffer)

		  if (typeof cb === 'function') {
		    return process.nextTick(function () {
		      cb(null, bytes)
		    })
		  }

		  return bytes
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18), __webpack_require__(0).Buffer, __webpack_require__(3)))

	/***/ },
	/* 92 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(10);
		/*</replacement>*/

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Readable = __webpack_require__(773);
		var Writable = __webpack_require__(775);

		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);
		  }
		}

	/***/ },
	/* 93 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = {
		    encode: __webpack_require__(781)
		  , decode: __webpack_require__(780)
		  , encodingLength: __webpack_require__(782)
		}


	/***/ },
	/* 94 */
	/***/ function(module, exports, __webpack_require__) {

		var asn1 = exports;

		asn1.bignum = __webpack_require__(19);

		asn1.define = __webpack_require__(298).define;
		asn1.base = __webpack_require__(82);
		asn1.constants = __webpack_require__(183);
		asn1.decoders = __webpack_require__(302);
		asn1.encoders = __webpack_require__(304);


	/***/ },
	/* 95 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(module, global, setImmediate, process) {(function (global, factory) {
		     true ? factory(exports) :
		    typeof define === 'function' && define.amd ? define(['exports'], factory) :
		    (factory((global.async = global.async || {})));
		}(this, function (exports) { 'use strict';

		    /**
		     * A faster alternative to `Function#apply`, this function invokes `func`
		     * with the `this` binding of `thisArg` and the arguments of `args`.
		     *
		     * @private
		     * @param {Function} func The function to invoke.
		     * @param {*} thisArg The `this` binding of `func`.
		     * @param {...*} args The arguments to invoke `func` with.
		     * @returns {*} Returns the result of `func`.
		     */
		    function apply(func, thisArg, args) {
		      var length = args.length;
		      switch (length) {
		        case 0: return func.call(thisArg);
		        case 1: return func.call(thisArg, args[0]);
		        case 2: return func.call(thisArg, args[0], args[1]);
		        case 3: return func.call(thisArg, args[0], args[1], args[2]);
		      }
		      return func.apply(thisArg, args);
		    }

		    /**
		     * 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 _
		     * @since 0.1.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		     * @example
		     *
		     * _.isObject({});
		     * // => true
		     *
		     * _.isObject([1, 2, 3]);
		     * // => true
		     *
		     * _.isObject(_.noop);
		     * // => true
		     *
		     * _.isObject(null);
		     * // => false
		     */
		    function isObject(value) {
		      var type = typeof value;
		      return !!value && (type == 'object' || type == 'function');
		    }

		    var funcTag = '[object Function]';
		    var genTag = '[object GeneratorFunction]';
		    /** Used for built-in method references. */
		    var objectProto = Object.prototype;

		    /**
		     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		     * of values.
		     */
		    var objectToString = objectProto.toString;

		    /**
		     * Checks if `value` is classified as a `Function` object.
		     *
		     * @static
		     * @memberOf _
		     * @since 0.1.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is 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 Safari 8 which returns 'object' for typed array and weak map constructors,
		      // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		      var tag = isObject(value) ? objectToString.call(value) : '';
		      return tag == funcTag || tag == genTag;
		    }

		    /**
		     * Checks if `value` is object-like. A value is object-like if it's not `null`
		     * and has a `typeof` result of "object".
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
		     * @example
		     *
		     * _.isObjectLike({});
		     * // => true
		     *
		     * _.isObjectLike([1, 2, 3]);
		     * // => true
		     *
		     * _.isObjectLike(_.noop);
		     * // => false
		     *
		     * _.isObjectLike(null);
		     * // => false
		     */
		    function isObjectLike(value) {
		      return !!value && typeof value == 'object';
		    }

		    /** `Object#toString` result references. */
		    var symbolTag = '[object Symbol]';

		    /** Used for built-in method references. */
		    var objectProto$1 = Object.prototype;

		    /**
		     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		     * of values.
		     */
		    var objectToString$1 = objectProto$1.toString;

		    /**
		     * Checks if `value` is classified as a `Symbol` primitive or object.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is correctly classified,
		     *  else `false`.
		     * @example
		     *
		     * _.isSymbol(Symbol.iterator);
		     * // => true
		     *
		     * _.isSymbol('abc');
		     * // => false
		     */
		    function isSymbol(value) {
		      return typeof value == 'symbol' ||
		        (isObjectLike(value) && objectToString$1.call(value) == symbolTag);
		    }

		    /** Used as references for various `Number` constants. */
		    var NAN = 0 / 0;

		    /** Used to match leading and trailing whitespace. */
		    var reTrim = /^\s+|\s+$/g;

		    /** Used to detect bad signed hexadecimal string values. */
		    var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;

		    /** Used to detect binary string values. */
		    var reIsBinary = /^0b[01]+$/i;

		    /** Used to detect octal string values. */
		    var reIsOctal = /^0o[0-7]+$/i;

		    /** Built-in method references without a dependency on `root`. */
		    var freeParseInt = parseInt;

		    /**
		     * Converts `value` to a number.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to process.
		     * @returns {number} Returns the number.
		     * @example
		     *
		     * _.toNumber(3);
		     * // => 3
		     *
		     * _.toNumber(Number.MIN_VALUE);
		     * // => 5e-324
		     *
		     * _.toNumber(Infinity);
		     * // => Infinity
		     *
		     * _.toNumber('3');
		     * // => 3
		     */
		    function toNumber(value) {
		      if (typeof value == 'number') {
		        return value;
		      }
		      if (isSymbol(value)) {
		        return NAN;
		      }
		      if (isObject(value)) {
		        var other = isFunction(value.valueOf) ? value.valueOf() : value;
		        value = isObject(other) ? (other + '') : other;
		      }
		      if (typeof value != 'string') {
		        return value === 0 ?  value : +value;
		      }
		      value = value.replace(reTrim, '');
		      var isBinary = reIsBinary.test(value);
		      return (isBinary || reIsOctal.test(value))
		        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
		        : (reIsBadHex.test(value) ? NAN : +value);
		    }

		    var INFINITY = 1 / 0;
		    var MAX_INTEGER = 1.7976931348623157e+308;
		    /**
		     * Converts `value` to an integer.
		     *
		     * **Note:** This function is loosely based on
		     * [`ToInteger`](http://www.ecma-international.org/ecma-262/6.0/#sec-tointeger).
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to convert.
		     * @returns {number} Returns the converted integer.
		     * @example
		     *
		     * _.toInteger(3);
		     * // => 3
		     *
		     * _.toInteger(Number.MIN_VALUE);
		     * // => 0
		     *
		     * _.toInteger(Infinity);
		     * // => 1.7976931348623157e+308
		     *
		     * _.toInteger('3');
		     * // => 3
		     */
		    function toInteger(value) {
		      if (!value) {
		        return value === 0 ? value : 0;
		      }
		      value = toNumber(value);
		      if (value === INFINITY || value === -INFINITY) {
		        var sign = (value < 0 ? -1 : 1);
		        return sign * MAX_INTEGER;
		      }
		      var remainder = value % 1;
		      return value === value ? (remainder ? value - remainder : value) : 0;
		    }

		    /** Used as the `TypeError` message for "Functions" methods. */
		    var FUNC_ERROR_TEXT = 'Expected a function';

		    /* Built-in method references for those with the same name as other `lodash` methods. */
		    var nativeMax = Math.max;

		    /**
		     * Creates a function that invokes `func` with the `this` binding of the
		     * created function and arguments from `start` and beyond provided as
		     * an array.
		     *
		     * **Note:** This method is based on the
		     * [rest parameter](https://mdn.io/rest_parameters).
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Function
		     * @param {Function} func The function to apply a rest parameter to.
		     * @param {number} [start=func.length-1] The start position of the rest parameter.
		     * @returns {Function} Returns the new function.
		     * @example
		     *
		     * var say = _.rest(function(what, names) {
		     *   return what + ' ' + _.initial(names).join(', ') +
		     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
		     * });
		     *
		     * say('hello', 'fred', 'barney', 'pebbles');
		     * // => 'hello fred, barney, & pebbles'
		     */
		    function rest(func, start) {
		      if (typeof func != 'function') {
		        throw new TypeError(FUNC_ERROR_TEXT);
		      }
		      start = nativeMax(start === undefined ? (func.length - 1) : toInteger(start), 0);
		      return function() {
		        var args = arguments,
		            index = -1,
		            length = nativeMax(args.length - start, 0),
		            array = Array(length);

		        while (++index < length) {
		          array[index] = args[start + index];
		        }
		        switch (start) {
		          case 0: return func.call(this, array);
		          case 1: return func.call(this, args[0], array);
		          case 2: return func.call(this, args[0], args[1], array);
		        }
		        var otherArgs = Array(start + 1);
		        index = -1;
		        while (++index < start) {
		          otherArgs[index] = args[index];
		        }
		        otherArgs[start] = array;
		        return apply(func, this, otherArgs);
		      };
		    }

		    function initialParams (fn) {
		        return rest(function (args /*..., callback*/) {
		            var callback = args.pop();
		            fn.call(this, args, callback);
		        });
		    }

		    function applyEach$1(eachfn) {
		        return rest(function (fns, args) {
		            var go = initialParams(function (args, callback) {
		                var that = this;
		                return eachfn(fns, function (fn, cb) {
		                    fn.apply(that, args.concat([cb]));
		                }, callback);
		            });
		            if (args.length) {
		                return go.apply(this, args);
		            } else {
		                return go;
		            }
		        });
		    }

		    /**
		     * A no-operation function that returns `undefined` regardless of the
		     * arguments it receives.
		     *
		     * @static
		     * @memberOf _
		     * @since 2.3.0
		     * @category Util
		     * @example
		     *
		     * var object = { 'user': 'fred' };
		     *
		     * _.noop(object) === undefined;
		     * // => true
		     */
		    function noop() {
		      // No operation performed.
		    }

		    function once(fn) {
		        return function () {
		            if (fn === null) return;
		            var callFn = fn;
		            fn = null;
		            callFn.apply(this, arguments);
		        };
		    }

		    /**
		     * 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];
		      };
		    }

		    /**
		     * 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');

		    /** Used as references for various `Number` constants. */
		    var MAX_SAFE_INTEGER = 9007199254740991;

		    /**
		     * Checks if `value` is a valid array-like length.
		     *
		     * **Note:** This function is loosely based on
		     * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is a valid length,
		     *  else `false`.
		     * @example
		     *
		     * _.isLength(3);
		     * // => true
		     *
		     * _.isLength(Number.MIN_VALUE);
		     * // => false
		     *
		     * _.isLength(Infinity);
		     * // => false
		     *
		     * _.isLength('3');
		     * // => false
		     */
		    function isLength(value) {
		      return typeof value == 'number' &&
		        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
		    }

		    /**
		     * Checks if `value` is array-like. A value is considered array-like if it's
		     * not a function and has a `value.length` that's an integer greater than or
		     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
		     * @example
		     *
		     * _.isArrayLike([1, 2, 3]);
		     * // => true
		     *
		     * _.isArrayLike(document.body.children);
		     * // => true
		     *
		     * _.isArrayLike('abc');
		     * // => true
		     *
		     * _.isArrayLike(_.noop);
		     * // => false
		     */
		    function isArrayLike(value) {
		      return value != null && isLength(getLength(value)) && !isFunction(value);
		    }

		    var iteratorSymbol = typeof Symbol === 'function' && Symbol.iterator;

		    function getIterator (coll) {
		        return iteratorSymbol && coll[iteratorSymbol] && coll[iteratorSymbol]();
		    }

		    /* Built-in method references for those with the same name as other `lodash` methods. */
		    var nativeGetPrototype = Object.getPrototypeOf;

		    /**
		     * Gets the `[[Prototype]]` of `value`.
		     *
		     * @private
		     * @param {*} value The value to query.
		     * @returns {null|Object} Returns the `[[Prototype]]`.
		     */
		    function getPrototype(value) {
		      return nativeGetPrototype(Object(value));
		    }

		    /** Used for built-in method references. */
		    var objectProto$2 = Object.prototype;

		    /** Used to check objects for own properties. */
		    var hasOwnProperty = objectProto$2.hasOwnProperty;

		    /**
		     * The base implementation of `_.has` without support for deep paths.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @param {Array|string} key The key to check.
		     * @returns {boolean} Returns `true` if `key` exists, else `false`.
		     */
		    function baseHas(object, key) {
		      // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`,
		      // that are composed entirely of index properties, return `false` for
		      // `hasOwnProperty` checks of them.
		      return hasOwnProperty.call(object, key) ||
		        (typeof object == 'object' && key in object && getPrototype(object) === null);
		    }

		    /* Built-in method references for those with the same name as other `lodash` methods. */
		    var nativeKeys = Object.keys;

		    /**
		     * The base implementation of `_.keys` which doesn't skip the constructor
		     * property of prototypes or treat sparse arrays as dense.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @returns {Array} Returns the array of property names.
		     */
		    function baseKeys(object) {
		      return nativeKeys(Object(object));
		    }

		    /**
		     * The base implementation of `_.times` without support for iteratee shorthands
		     * or max array length checks.
		     *
		     * @private
		     * @param {number} n The number of times to invoke `iteratee`.
		     * @param {Function} iteratee The function invoked per iteration.
		     * @returns {Array} Returns the array of results.
		     */
		    function baseTimes(n, iteratee) {
		      var index = -1,
		          result = Array(n);

		      while (++index < n) {
		        result[index] = iteratee(index);
		      }
		      return result;
		    }

		    /**
		     * This method is like `_.isArrayLike` except that it also checks if `value`
		     * is an object.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is an array-like object,
		     *  else `false`.
		     * @example
		     *
		     * _.isArrayLikeObject([1, 2, 3]);
		     * // => true
		     *
		     * _.isArrayLikeObject(document.body.children);
		     * // => true
		     *
		     * _.isArrayLikeObject('abc');
		     * // => false
		     *
		     * _.isArrayLikeObject(_.noop);
		     * // => false
		     */
		    function isArrayLikeObject(value) {
		      return isObjectLike(value) && isArrayLike(value);
		    }

		    /** `Object#toString` result references. */
		    var argsTag = '[object Arguments]';

		    /** Used for built-in method references. */
		    var objectProto$3 = Object.prototype;

		    /** Used to check objects for own properties. */
		    var hasOwnProperty$1 = objectProto$3.hasOwnProperty;

		    /**
		     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		     * of values.
		     */
		    var objectToString$2 = objectProto$3.toString;

		    /** Built-in value references. */
		    var propertyIsEnumerable = objectProto$3.propertyIsEnumerable;

		    /**
		     * Checks if `value` is likely an `arguments` object.
		     *
		     * @static
		     * @memberOf _
		     * @since 0.1.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is correctly classified,
		     *  else `false`.
		     * @example
		     *
		     * _.isArguments(function() { return arguments; }());
		     * // => true
		     *
		     * _.isArguments([1, 2, 3]);
		     * // => false
		     */
		    function isArguments(value) {
		      // Safari 8.1 incorrectly makes `arguments.callee` enumerable in strict mode.
		      return isArrayLikeObject(value) && hasOwnProperty$1.call(value, 'callee') &&
		        (!propertyIsEnumerable.call(value, 'callee') || objectToString$2.call(value) == argsTag);
		    }

		    /**
		     * Checks if `value` is classified as an `Array` object.
		     *
		     * @static
		     * @memberOf _
		     * @since 0.1.0
		     * @type {Function}
		     * @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(document.body.children);
		     * // => false
		     *
		     * _.isArray('abc');
		     * // => false
		     *
		     * _.isArray(_.noop);
		     * // => false
		     */
		    var isArray = Array.isArray;

		    /** `Object#toString` result references. */
		    var stringTag = '[object String]';

		    /** Used for built-in method references. */
		    var objectProto$4 = Object.prototype;

		    /**
		     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		     * of values.
		     */
		    var objectToString$3 = objectProto$4.toString;

		    /**
		     * Checks if `value` is classified as a `String` primitive or object.
		     *
		     * @static
		     * @since 0.1.0
		     * @memberOf _
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is correctly classified,
		     *  else `false`.
		     * @example
		     *
		     * _.isString('abc');
		     * // => true
		     *
		     * _.isString(1);
		     * // => false
		     */
		    function isString(value) {
		      return typeof value == 'string' ||
		        (!isArray(value) && isObjectLike(value) && objectToString$3.call(value) == stringTag);
		    }

		    /**
		     * Creates an array of index keys for `object` values of arrays,
		     * `arguments` objects, and strings, otherwise `null` is returned.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @returns {Array|null} Returns index keys, else `null`.
		     */
		    function indexKeys(object) {
		      var length = object ? object.length : undefined;
		      if (isLength(length) &&
		          (isArray(object) || isString(object) || isArguments(object))) {
		        return baseTimes(length, String);
		      }
		      return null;
		    }

		    /** Used as references for various `Number` constants. */
		    var MAX_SAFE_INTEGER$1 = 9007199254740991;

		    /** Used to detect unsigned integer values. */
		    var reIsUint = /^(?:0|[1-9]\d*)$/;

		    /**
		     * Checks if `value` is a valid array-like index.
		     *
		     * @private
		     * @param {*} value The value to check.
		     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
		     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
		     */
		    function isIndex(value, length) {
		      value = (typeof value == 'number' || reIsUint.test(value)) ? +value : -1;
		      length = length == null ? MAX_SAFE_INTEGER$1 : length;
		      return value > -1 && value % 1 == 0 && value < length;
		    }

		    /** Used for built-in method references. */
		    var objectProto$5 = Object.prototype;

		    /**
		     * Checks if `value` is likely a prototype object.
		     *
		     * @private
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
		     */
		    function isPrototype(value) {
		      var Ctor = value && value.constructor,
		          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto$5;

		      return value === proto;
		    }

		    /**
		     * 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
		     * @since 0.1.0
		     * @memberOf _
		     * @category Object
		     * @param {Object} object The object to query.
		     * @returns {Array} Returns the array of property names.
		     * @example
		     *
		     * function Foo() {
		     *   this.a = 1;
		     *   this.b = 2;
		     * }
		     *
		     * Foo.prototype.c = 3;
		     *
		     * _.keys(new Foo);
		     * // => ['a', 'b'] (iteration order is not guaranteed)
		     *
		     * _.keys('hi');
		     * // => ['0', '1']
		     */
		    function keys(object) {
		      var isProto = isPrototype(object);
		      if (!(isProto || isArrayLike(object))) {
		        return baseKeys(object);
		      }
		      var indexes = indexKeys(object),
		          skipIndexes = !!indexes,
		          result = indexes || [],
		          length = result.length;

		      for (var key in object) {
		        if (baseHas(object, key) &&
		            !(skipIndexes && (key == 'length' || isIndex(key, length))) &&
		            !(isProto && key == 'constructor')) {
		          result.push(key);
		        }
		      }
		      return result;
		    }

		    function iterator(coll) {
		        var i = -1;
		        var len;
		        if (isArrayLike(coll)) {
		            len = coll.length;
		            return function next() {
		                i++;
		                return i < len ? { value: coll[i], key: i } : null;
		            };
		        }

		        var iterate = getIterator(coll);
		        if (iterate) {
		            return function next() {
		                var item = iterate.next();
		                if (item.done) return null;
		                i++;
		                return { value: item.value, key: i };
		            };
		        }

		        var okeys = keys(coll);
		        len = okeys.length;
		        return function next() {
		            i++;
		            var key = okeys[i];
		            return i < len ? { value: coll[key], key: key } : null;
		        };
		    }

		    function onlyOnce(fn) {
		        return function () {
		            if (fn === null) throw new Error("Callback was already called.");
		            var callFn = fn;
		            fn = null;
		            callFn.apply(this, arguments);
		        };
		    }

		    function _eachOfLimit(limit) {
		        return function (obj, iteratee, callback) {
		            callback = once(callback || noop);
		            obj = obj || [];
		            var nextElem = iterator(obj);
		            if (limit <= 0) {
		                return callback(null);
		            }
		            var done = false;
		            var running = 0;
		            var errored = false;

		            (function replenish() {
		                if (done && running <= 0) {
		                    return callback(null);
		                }

		                while (running < limit && !errored) {
		                    var elem = nextElem();
		                    if (elem === null) {
		                        done = true;
		                        if (running <= 0) {
		                            callback(null);
		                        }
		                        return;
		                    }
		                    running += 1;
		                    iteratee(elem.value, elem.key, onlyOnce(function (err) {
		                        running -= 1;
		                        if (err) {
		                            callback(err);
		                            errored = true;
		                        } else {
		                            replenish();
		                        }
		                    }));
		                }
		            })();
		        };
		    }

		    function doParallelLimit(fn) {
		        return function (obj, limit, iteratee, callback) {
		            return fn(_eachOfLimit(limit), obj, iteratee, callback);
		        };
		    }

		    function _asyncMap(eachfn, arr, iteratee, callback) {
		        callback = once(callback || noop);
		        arr = arr || [];
		        var results = isArrayLike(arr) || getIterator(arr) ? [] : {};
		        eachfn(arr, function (value, index, callback) {
		            iteratee(value, function (err, v) {
		                results[index] = v;
		                callback(err);
		            });
		        }, function (err) {
		            callback(err, results);
		        });
		    }

		    /**
		     * The same as `map` but runs a maximum of `limit` async operations at a time.
		     *
		     * @name mapLimit
		     * @static
		     * @memberOf async
		     * @see async.map
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A function to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, transformed)` which must be called
		     * once it has completed with an error (which can be `null`) and a transformed
		     * item. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called when all `iteratee`
		     * functions have finished, or an error occurs. Results is an array of the
		     * transformed items from the `coll`. Invoked with (err, results).
		     */
		    var mapLimit = doParallelLimit(_asyncMap);

		    function doLimit(fn, limit) {
		        return function (iterable, iteratee, callback) {
		            return fn(iterable, limit, iteratee, callback);
		        };
		    }

		    /**
		     * Produces a new collection of values by mapping each value in `coll` through
		     * the `iteratee` function. The `iteratee` is called with an item from `coll`
		     * and a callback for when it has finished processing. Each of these callback
		     * takes 2 arguments: an `error`, and the transformed item from `coll`. If
		     * `iteratee` passes an error to its callback, the main `callback` (for the
		     * `map` function) is immediately called with the error.
		     *
		     * Note, that since this function applies the `iteratee` to each item in
		     * parallel, there is no guarantee that the `iteratee` functions will complete
		     * in order. However, the results array will be in the same order as the
		     * original `coll`.
		     *
		     * @name map
		     * @static
		     * @memberOf async
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, transformed)` which must be called
		     * once it has completed with an error (which can be `null`) and a
		     * transformed item. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called when all `iteratee`
		     * functions have finished, or an error occurs. Results is an array of the
		     * transformed items from the `coll`. Invoked with (err, results).
		     * @example
		     *
		     * async.map(['file1','file2','file3'], fs.stat, function(err, results) {
		     *     // results is now an array of stats for each file
		     * });
		     */
		    var map = doLimit(mapLimit, Infinity);

		    /**
		     * Applies the provided arguments to each function in the array, calling
		     * `callback` after all functions have completed. If you only provide the first
		     * argument, then it will return a function which lets you pass in the
		     * arguments as if it were a single function call.
		     *
		     * @name applyEach
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Array|Object} fns - A collection of asynchronous functions to all
		     * call with the same arguments
		     * @param {...*} [args] - any number of separate arguments to pass to the
		     * function.
		     * @param {Function} [callback] - the final argument should be the callback,
		     * called when all functions have completed processing.
		     * @returns {Function} - If only the first argument is provided, it will return
		     * a function which lets you pass in the arguments as if it were a single
		     * function call.
		     * @example
		     *
		     * async.applyEach([enableSearch, updateSchema], 'bucket', callback);
		     *
		     * // partial application example:
		     * async.each(
		     *     buckets,
		     *     async.applyEach([enableSearch, updateSchema]),
		     *     callback
		     * );
		     */
		    var applyEach = applyEach$1(map);

		    /**
		     * The same as `map` but runs only a single async operation at a time.
		     *
		     * @name mapSeries
		     * @static
		     * @memberOf async
		     * @see async.map
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, transformed)` which must be called
		     * once it has completed with an error (which can be `null`) and a
		     * transformed item. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called when all `iteratee`
		     * functions have finished, or an error occurs. Results is an array of the
		     * transformed items from the `coll`. Invoked with (err, results).
		     */
		    var mapSeries = doLimit(mapLimit, 1);

		    /**
		     * The same as `applyEach` but runs only a single async operation at a time.
		     *
		     * @name applyEachSeries
		     * @static
		     * @memberOf async
		     * @see async.applyEach
		     * @category Control Flow
		     * @param {Array|Object} fns - A collection of asynchronous functions to all
		     * call with the same arguments
		     * @param {...*} [args] - any number of separate arguments to pass to the
		     * function.
		     * @param {Function} [callback] - the final argument should be the callback,
		     * called when all functions have completed processing.
		     * @returns {Function} - If only the first argument is provided, it will return
		     * a function which lets you pass in the arguments as if it were a single
		     * function call.
		     */
		    var applyEachSeries = applyEach$1(mapSeries);

		    /**
		     * Creates a continuation function with some arguments already applied.
		     *
		     * Useful as a shorthand when combined with other control flow functions. Any
		     * arguments passed to the returned function are added to the arguments
		     * originally passed to apply.
		     *
		     * @name apply
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} function - The function you want to eventually apply all
		     * arguments to. Invokes with (arguments...).
		     * @param {...*} arguments... - Any number of arguments to automatically apply
		     * when the continuation is called.
		     * @example
		     *
		     * // using apply
		     * async.parallel([
		     *     async.apply(fs.writeFile, 'testfile1', 'test1'),
		     *     async.apply(fs.writeFile, 'testfile2', 'test2')
		     * ]);
		     *
		     *
		     * // the same process without using apply
		     * async.parallel([
		     *     function(callback) {
		     *         fs.writeFile('testfile1', 'test1', callback);
		     *     },
		     *     function(callback) {
		     *         fs.writeFile('testfile2', 'test2', callback);
		     *     }
		     * ]);
		     *
		     * // It's possible to pass any number of additional arguments when calling the
		     * // continuation:
		     *
		     * node> var fn = async.apply(sys.puts, 'one');
		     * node> fn('two', 'three');
		     * one
		     * two
		     * three
		     */
		    var apply$1 = rest(function (fn, args) {
		        return rest(function (callArgs) {
		            return fn.apply(null, args.concat(callArgs));
		        });
		    });

		    /**
		     * Take a sync function and make it async, passing its return value to a
		     * callback. This is useful for plugging sync functions into a waterfall,
		     * series, or other async functions. Any arguments passed to the generated
		     * function will be passed to the wrapped function (except for the final
		     * callback argument). Errors thrown will be passed to the callback.
		     *
		     * If the function passed to `asyncify` returns a Promise, that promises's
		     * resolved/rejected state will be used to call the callback, rather than simply
		     * the synchronous return value.
		     *
		     * This also means you can asyncify ES2016 `async` functions.
		     *
		     * @name asyncify
		     * @static
		     * @memberOf async
		     * @alias wrapSync
		     * @category Util
		     * @param {Function} func - The synchronous function to convert to an
		     * asynchronous function.
		     * @returns {Function} An asynchronous wrapper of the `func`. To be invoked with
		     * (callback).
		     * @example
		     *
		     * // passing a regular synchronous function
		     * async.waterfall([
		     *     async.apply(fs.readFile, filename, "utf8"),
		     *     async.asyncify(JSON.parse),
		     *     function (data, next) {
		     *         // data is the result of parsing the text.
		     *         // If there was a parsing error, it would have been caught.
		     *     }
		     * ], callback);
		     *
		     * // passing a function returning a promise
		     * async.waterfall([
		     *     async.apply(fs.readFile, filename, "utf8"),
		     *     async.asyncify(function (contents) {
		     *         return db.model.create(contents);
		     *     }),
		     *     function (model, next) {
		     *         // `model` is the instantiated model object.
		     *         // If there was an error, this function would be skipped.
		     *     }
		     * ], callback);
		     *
		     * // es6 example
		     * var q = async.queue(async.asyncify(async function(file) {
		     *     var intermediateStep = await processFile(file);
		     *     return await somePromise(intermediateStep)
		     * }));
		     *
		     * q.push(files);
		     */
		    function asyncify(func) {
		        return initialParams(function (args, callback) {
		            var result;
		            try {
		                result = func.apply(this, args);
		            } catch (e) {
		                return callback(e);
		            }
		            // if result is Promise object
		            if (isObject(result) && typeof result.then === 'function') {
		                result.then(function (value) {
		                    callback(null, value);
		                })['catch'](function (err) {
		                    callback(err.message ? err : new Error(err));
		                });
		            } else {
		                callback(null, result);
		            }
		        });
		    }

		    /**
		     * A specialized version of `_.forEach` for arrays without support for
		     * iteratee shorthands.
		     *
		     * @private
		     * @param {Array} array The array to iterate over.
		     * @param {Function} iteratee The function invoked per iteration.
		     * @returns {Array} Returns `array`.
		     */
		    function arrayEach(array, iteratee) {
		      var index = -1,
		          length = array.length;

		      while (++index < length) {
		        if (iteratee(array[index], index, array) === false) {
		          break;
		        }
		      }
		      return array;
		    }

		    /**
		     * Creates a base function for methods like `_.forIn` and `_.forOwn`.
		     *
		     * @private
		     * @param {boolean} [fromRight] Specify iterating from right to left.
		     * @returns {Function} Returns the new base function.
		     */
		    function createBaseFor(fromRight) {
		      return function(object, iteratee, keysFunc) {
		        var index = -1,
		            iterable = Object(object),
		            props = keysFunc(object),
		            length = props.length;

		        while (length--) {
		          var key = props[fromRight ? length : ++index];
		          if (iteratee(iterable[key], key, iterable) === false) {
		            break;
		          }
		        }
		        return object;
		      };
		    }

		    /**
		     * The base implementation of `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();

		    /**
		     * The base implementation of `_.forOwn` without support for iteratee shorthands.
		     *
		     * @private
		     * @param {Object} object The object to iterate over.
		     * @param {Function} iteratee The function invoked per iteration.
		     * @returns {Object} Returns `object`.
		     */
		    function baseForOwn(object, iteratee) {
		      return object && baseFor(object, iteratee, keys);
		    }

		    /**
		     * Removes all key-value entries from the stack.
		     *
		     * @private
		     * @name clear
		     * @memberOf Stack
		     */
		    function stackClear() {
		      this.__data__ = { 'array': [], 'map': null };
		    }

		    /**
		     * Performs a
		     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
		     * comparison between two values to determine if they are equivalent.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to compare.
		     * @param {*} other The other value to compare.
		     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		     * @example
		     *
		     * var object = { 'user': 'fred' };
		     * var other = { 'user': 'fred' };
		     *
		     * _.eq(object, object);
		     * // => true
		     *
		     * _.eq(object, other);
		     * // => false
		     *
		     * _.eq('a', 'a');
		     * // => true
		     *
		     * _.eq('a', Object('a'));
		     * // => false
		     *
		     * _.eq(NaN, NaN);
		     * // => true
		     */
		    function eq(value, other) {
		      return value === other || (value !== value && other !== other);
		    }

		    /**
		     * Gets the index at which the `key` is found in `array` of key-value pairs.
		     *
		     * @private
		     * @param {Array} array The array to search.
		     * @param {*} key The key to search for.
		     * @returns {number} Returns the index of the matched value, else `-1`.
		     */
		    function assocIndexOf(array, key) {
		      var length = array.length;
		      while (length--) {
		        if (eq(array[length][0], key)) {
		          return length;
		        }
		      }
		      return -1;
		    }

		    /** Used for built-in method references. */
		    var arrayProto = Array.prototype;

		    /** Built-in value references. */
		    var splice = arrayProto.splice;

		    /**
		     * Removes `key` and its value from the associative array.
		     *
		     * @private
		     * @param {Array} array The array to modify.
		     * @param {string} key The key of the value to remove.
		     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		     */
		    function assocDelete(array, key) {
		      var index = assocIndexOf(array, key);
		      if (index < 0) {
		        return false;
		      }
		      var lastIndex = array.length - 1;
		      if (index == lastIndex) {
		        array.pop();
		      } else {
		        splice.call(array, index, 1);
		      }
		      return true;
		    }

		    /**
		     * Removes `key` and its value from the stack.
		     *
		     * @private
		     * @name delete
		     * @memberOf Stack
		     * @param {string} key The key of the value to remove.
		     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		     */
		    function stackDelete(key) {
		      var data = this.__data__,
		          array = data.array;

		      return array ? assocDelete(array, key) : data.map['delete'](key);
		    }

		    /**
		     * Gets the associative array value for `key`.
		     *
		     * @private
		     * @param {Array} array The array to query.
		     * @param {string} key The key of the value to get.
		     * @returns {*} Returns the entry value.
		     */
		    function assocGet(array, key) {
		      var index = assocIndexOf(array, key);
		      return index < 0 ? undefined : array[index][1];
		    }

		    /**
		     * Gets the stack value for `key`.
		     *
		     * @private
		     * @name get
		     * @memberOf Stack
		     * @param {string} key The key of the value to get.
		     * @returns {*} Returns the entry value.
		     */
		    function stackGet(key) {
		      var data = this.__data__,
		          array = data.array;

		      return array ? assocGet(array, key) : data.map.get(key);
		    }

		    /**
		     * Checks if an associative array value for `key` exists.
		     *
		     * @private
		     * @param {Array} array The array to query.
		     * @param {string} key The key of the entry to check.
		     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		     */
		    function assocHas(array, key) {
		      return assocIndexOf(array, key) > -1;
		    }

		    /**
		     * Checks if a stack value for `key` exists.
		     *
		     * @private
		     * @name has
		     * @memberOf Stack
		     * @param {string} key The key of the entry to check.
		     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		     */
		    function stackHas(key) {
		      var data = this.__data__,
		          array = data.array;

		      return array ? assocHas(array, key) : data.map.has(key);
		    }

		    /**
		     * Checks if `value` is a host object in IE < 9.
		     *
		     * @private
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
		     */
		    function isHostObject(value) {
		      // Many host objects are `Object` objects that can coerce to strings
		      // despite having improperly defined `toString` methods.
		      var result = false;
		      if (value != null && typeof value.toString != 'function') {
		        try {
		          result = !!(value + '');
		        } catch (e) {}
		      }
		      return result;
		    }

		    /** Used to match `RegExp` [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns). */
		    var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;

		    /** Used to detect host constructors (Safari). */
		    var reIsHostCtor = /^\[object .+?Constructor\]$/;

		    /** Used for built-in method references. */
		    var objectProto$7 = Object.prototype;

		    /** Used to resolve the decompiled source of functions. */
		    var funcToString = Function.prototype.toString;

		    /** Used to check objects for own properties. */
		    var hasOwnProperty$2 = objectProto$7.hasOwnProperty;

		    /** Used to detect if a method is native. */
		    var reIsNative = RegExp('^' +
		      funcToString.call(hasOwnProperty$2).replace(reRegExpChar, '\\$&')
		      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
		    );

		    /**
		     * Checks if `value` is a native function.
		     *
		     * @static
		     * @memberOf _
		     * @since 3.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is a native function,
		     *  else `false`.
		     * @example
		     *
		     * _.isNative(Array.prototype.push);
		     * // => true
		     *
		     * _.isNative(_);
		     * // => false
		     */
		    function isNative(value) {
		      if (value == null) {
		        return false;
		      }
		      if (isFunction(value)) {
		        return reIsNative.test(funcToString.call(value));
		      }
		      return isObjectLike(value) &&
		        (isHostObject(value) ? reIsNative : reIsHostCtor).test(value);
		    }

		    /**
		     * 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[key];
		      return isNative(value) ? value : undefined;
		    }

		    /* Built-in method references that are verified to be native. */
		    var nativeCreate = getNative(Object, 'create');

		    /** Used for built-in method references. */
		    var objectProto$6 = Object.prototype;

		    /**
		     * Creates an hash object.
		     *
		     * @private
		     * @constructor
		     * @returns {Object} Returns the new hash object.
		     */
		    function Hash() {}

		    // Avoid inheriting from `Object.prototype` when possible.
		    Hash.prototype = nativeCreate ? nativeCreate(null) : objectProto$6;

		    /**
		     * Checks if `value` is a global object.
		     *
		     * @private
		     * @param {*} value The value to check.
		     * @returns {null|Object} Returns `value` if it's a global object, else `null`.
		     */
		    function checkGlobal(value) {
		      return (value && value.Object === Object) ? value : null;
		    }

		    /** Used to determine if values are of the language type `Object`. */
		    var objectTypes = {
		      'function': true,
		      'object': true
		    };

		    /** Detect free variable `exports`. */
		    var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
		      ? exports
		      : undefined;

		    /** Detect free variable `module`. */
		    var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
		      ? module
		      : undefined;

		    /** Detect free variable `global` from Node.js. */
		    var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);

		    /** Detect free variable `self`. */
		    var freeSelf = checkGlobal(objectTypes[typeof self] && self);

		    /** Detect free variable `window`. */
		    var freeWindow = checkGlobal(objectTypes[typeof window] && window);

		    /** Detect `this` as the global object. */
		    var thisGlobal = checkGlobal(objectTypes[typeof this] && this);

		    /**
		     * 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 !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
		        freeSelf || thisGlobal || Function('return this')();

		    /* Built-in method references that are verified to be native. */
		    var Map = getNative(root, 'Map');

		    /**
		     * Removes all key-value entries from the map.
		     *
		     * @private
		     * @name clear
		     * @memberOf MapCache
		     */
		    function mapClear() {
		      this.__data__ = {
		        'hash': new Hash,
		        'map': Map ? new Map : [],
		        'string': new Hash
		      };
		    }

		    /** Used for built-in method references. */
		    var objectProto$8 = Object.prototype;

		    /** Used to check objects for own properties. */
		    var hasOwnProperty$3 = objectProto$8.hasOwnProperty;

		    /**
		     * Checks if a hash value for `key` exists.
		     *
		     * @private
		     * @param {Object} hash The hash to query.
		     * @param {string} key The key of the entry to check.
		     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		     */
		    function hashHas(hash, key) {
		      return nativeCreate ? hash[key] !== undefined : hasOwnProperty$3.call(hash, key);
		    }

		    /**
		     * Removes `key` and its value from the hash.
		     *
		     * @private
		     * @param {Object} hash The hash to modify.
		     * @param {string} key The key of the value to remove.
		     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		     */
		    function hashDelete(hash, key) {
		      return hashHas(hash, key) && delete hash[key];
		    }

		    /**
		     * Checks if `value` is suitable for use as unique object key.
		     *
		     * @private
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
		     */
		    function isKeyable(value) {
		      var type = typeof value;
		      return type == 'number' || type == 'boolean' ||
		        (type == 'string' && value != '__proto__') || value == null;
		    }

		    /**
		     * Removes `key` and its value from the map.
		     *
		     * @private
		     * @name delete
		     * @memberOf MapCache
		     * @param {string} key The key of the value to remove.
		     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		     */
		    function mapDelete(key) {
		      var data = this.__data__;
		      if (isKeyable(key)) {
		        return hashDelete(typeof key == 'string' ? data.string : data.hash, key);
		      }
		      return Map ? data.map['delete'](key) : assocDelete(data.map, key);
		    }

		    /** Used to stand-in for `undefined` hash values. */
		    var HASH_UNDEFINED = '__lodash_hash_undefined__';

		    /** Used for built-in method references. */
		    var objectProto$9 = Object.prototype;

		    /** Used to check objects for own properties. */
		    var hasOwnProperty$4 = objectProto$9.hasOwnProperty;

		    /**
		     * Gets the hash value for `key`.
		     *
		     * @private
		     * @param {Object} hash The hash to query.
		     * @param {string} key The key of the value to get.
		     * @returns {*} Returns the entry value.
		     */
		    function hashGet(hash, key) {
		      if (nativeCreate) {
		        var result = hash[key];
		        return result === HASH_UNDEFINED ? undefined : result;
		      }
		      return hasOwnProperty$4.call(hash, key) ? hash[key] : undefined;
		    }

		    /**
		     * Gets the map value for `key`.
		     *
		     * @private
		     * @name get
		     * @memberOf MapCache
		     * @param {string} key The key of the value to get.
		     * @returns {*} Returns the entry value.
		     */
		    function mapGet(key) {
		      var data = this.__data__;
		      if (isKeyable(key)) {
		        return hashGet(typeof key == 'string' ? data.string : data.hash, key);
		      }
		      return Map ? data.map.get(key) : assocGet(data.map, key);
		    }

		    /**
		     * Checks if a map value for `key` exists.
		     *
		     * @private
		     * @name has
		     * @memberOf MapCache
		     * @param {string} key The key of the entry to check.
		     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		     */
		    function mapHas(key) {
		      var data = this.__data__;
		      if (isKeyable(key)) {
		        return hashHas(typeof key == 'string' ? data.string : data.hash, key);
		      }
		      return Map ? data.map.has(key) : assocHas(data.map, key);
		    }

		    /**
		     * Sets the associative array `key` to `value`.
		     *
		     * @private
		     * @param {Array} array The array to modify.
		     * @param {string} key The key of the value to set.
		     * @param {*} value The value to set.
		     */
		    function assocSet(array, key, value) {
		      var index = assocIndexOf(array, key);
		      if (index < 0) {
		        array.push([key, value]);
		      } else {
		        array[index][1] = value;
		      }
		    }

		    /** Used to stand-in for `undefined` hash values. */
		    var HASH_UNDEFINED$1 = '__lodash_hash_undefined__';

		    /**
		     * Sets the hash `key` to `value`.
		     *
		     * @private
		     * @param {Object} hash The hash to modify.
		     * @param {string} key The key of the value to set.
		     * @param {*} value The value to set.
		     */
		    function hashSet(hash, key, value) {
		      hash[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED$1 : value;
		    }

		    /**
		     * Sets the map `key` to `value`.
		     *
		     * @private
		     * @name set
		     * @memberOf MapCache
		     * @param {string} key The key of the value to set.
		     * @param {*} value The value to set.
		     * @returns {Object} Returns the map cache instance.
		     */
		    function mapSet(key, value) {
		      var data = this.__data__;
		      if (isKeyable(key)) {
		        hashSet(typeof key == 'string' ? data.string : data.hash, key, value);
		      } else if (Map) {
		        data.map.set(key, value);
		      } else {
		        assocSet(data.map, key, value);
		      }
		      return this;
		    }

		    /**
		     * Creates a map cache object to store key-value pairs.
		     *
		     * @private
		     * @constructor
		     * @param {Array} [values] The values to cache.
		     */
		    function MapCache(values) {
		      var index = -1,
		          length = values ? values.length : 0;

		      this.clear();
		      while (++index < length) {
		        var entry = values[index];
		        this.set(entry[0], entry[1]);
		      }
		    }

		    // Add methods to `MapCache`.
		    MapCache.prototype.clear = mapClear;
		    MapCache.prototype['delete'] = mapDelete;
		    MapCache.prototype.get = mapGet;
		    MapCache.prototype.has = mapHas;
		    MapCache.prototype.set = mapSet;

		    /** Used as the size to enable large array optimizations. */
		    var LARGE_ARRAY_SIZE = 200;

		    /**
		     * Sets the stack `key` to `value`.
		     *
		     * @private
		     * @name set
		     * @memberOf Stack
		     * @param {string} key The key of the value to set.
		     * @param {*} value The value to set.
		     * @returns {Object} Returns the stack cache instance.
		     */
		    function stackSet(key, value) {
		      var data = this.__data__,
		          array = data.array;

		      if (array) {
		        if (array.length < (LARGE_ARRAY_SIZE - 1)) {
		          assocSet(array, key, value);
		        } else {
		          data.array = null;
		          data.map = new MapCache(array);
		        }
		      }
		      var map = data.map;
		      if (map) {
		        map.set(key, value);
		      }
		      return this;
		    }

		    /**
		     * Creates a stack cache object to store key-value pairs.
		     *
		     * @private
		     * @constructor
		     * @param {Array} [values] The values to cache.
		     */
		    function Stack(values) {
		      var index = -1,
		          length = values ? values.length : 0;

		      this.clear();
		      while (++index < length) {
		        var entry = values[index];
		        this.set(entry[0], entry[1]);
		      }
		    }

		    // Add methods to `Stack`.
		    Stack.prototype.clear = stackClear;
		    Stack.prototype['delete'] = stackDelete;
		    Stack.prototype.get = stackGet;
		    Stack.prototype.has = stackHas;
		    Stack.prototype.set = stackSet;

		    /**
		     * A specialized version of `_.some` for arrays without support for iteratee
		     * shorthands.
		     *
		     * @private
		     * @param {Array} array The array to iterate over.
		     * @param {Function} predicate The function invoked per iteration.
		     * @returns {boolean} Returns `true` if any element passes the predicate check,
		     *  else `false`.
		     */
		    function arraySome(array, predicate) {
		      var index = -1,
		          length = array.length;

		      while (++index < length) {
		        if (predicate(array[index], index, array)) {
		          return true;
		        }
		      }
		      return false;
		    }

		    var UNORDERED_COMPARE_FLAG$1 = 1;
		    var PARTIAL_COMPARE_FLAG$2 = 2;
		    /**
		     * A specialized version of `baseIsEqualDeep` for arrays with support for
		     * partial deep comparisons.
		     *
		     * @private
		     * @param {Array} array The array to compare.
		     * @param {Array} other The other array to compare.
		     * @param {Function} equalFunc The function to determine equivalents of values.
		     * @param {Function} customizer The function to customize comparisons.
		     * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		     *  for more details.
		     * @param {Object} stack Tracks traversed `array` and `other` objects.
		     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
		     */
		    function equalArrays(array, other, equalFunc, customizer, bitmask, stack) {
		      var index = -1,
		          isPartial = bitmask & PARTIAL_COMPARE_FLAG$2,
		          isUnordered = bitmask & UNORDERED_COMPARE_FLAG$1,
		          arrLength = array.length,
		          othLength = other.length;

		      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
		        return false;
		      }
		      // Assume cyclic values are equal.
		      var stacked = stack.get(array);
		      if (stacked) {
		        return stacked == other;
		      }
		      var result = true;
		      stack.set(array, other);

		      // Ignore non-index properties.
		      while (++index < arrLength) {
		        var arrValue = array[index],
		            othValue = other[index];

		        if (customizer) {
		          var compared = isPartial
		            ? customizer(othValue, arrValue, index, other, array, stack)
		            : customizer(arrValue, othValue, index, array, other, stack);
		        }
		        if (compared !== undefined) {
		          if (compared) {
		            continue;
		          }
		          result = false;
		          break;
		        }
		        // Recursively compare arrays (susceptible to call stack limits).
		        if (isUnordered) {
		          if (!arraySome(other, function(othValue) {
		                return arrValue === othValue ||
		                  equalFunc(arrValue, othValue, customizer, bitmask, stack);
		              })) {
		            result = false;
		            break;
		          }
		        } else if (!(
		              arrValue === othValue ||
		                equalFunc(arrValue, othValue, customizer, bitmask, stack)
		            )) {
		          result = false;
		          break;
		        }
		      }
		      stack['delete'](array);
		      return result;
		    }

		    /** Built-in value references. */
		    var Symbol$1 = root.Symbol;

		    /** Built-in value references. */
		    var Uint8Array = root.Uint8Array;

		    /**
		     * Converts `map` to an array.
		     *
		     * @private
		     * @param {Object} map The map to convert.
		     * @returns {Array} Returns the converted array.
		     */
		    function mapToArray(map) {
		      var index = -1,
		          result = Array(map.size);

		      map.forEach(function(value, key) {
		        result[++index] = [key, value];
		      });
		      return result;
		    }

		    /**
		     * Converts `set` to an array.
		     *
		     * @private
		     * @param {Object} set The set to convert.
		     * @returns {Array} Returns the converted array.
		     */
		    function setToArray(set) {
		      var index = -1,
		          result = Array(set.size);

		      set.forEach(function(value) {
		        result[++index] = value;
		      });
		      return result;
		    }

		    var UNORDERED_COMPARE_FLAG$2 = 1;
		    var PARTIAL_COMPARE_FLAG$3 = 2;
		    var boolTag = '[object Boolean]';
		    var dateTag = '[object Date]';
		    var errorTag = '[object Error]';
		    var mapTag = '[object Map]';
		    var numberTag = '[object Number]';
		    var regexpTag = '[object RegExp]';
		    var setTag = '[object Set]';
		    var stringTag$1 = '[object String]';
		    var symbolTag$1 = '[object Symbol]';
		    var arrayBufferTag = '[object ArrayBuffer]';
		    var dataViewTag = '[object DataView]';
		    var symbolProto = Symbol$1 ? Symbol$1.prototype : undefined;
		    var symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
		    /**
		     * A specialized version of `baseIsEqualDeep` for comparing objects of
		     * the same `toStringTag`.
		     *
		     * **Note:** This function only supports comparing values with tags of
		     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
		     *
		     * @private
		     * @param {Object} object The object to compare.
		     * @param {Object} other The other object to compare.
		     * @param {string} tag The `toStringTag` of the objects to compare.
		     * @param {Function} equalFunc The function to determine equivalents of values.
		     * @param {Function} customizer The function to customize comparisons.
		     * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		     *  for more details.
		     * @param {Object} stack Tracks traversed `object` and `other` objects.
		     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		     */
		    function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) {
		      switch (tag) {
		        case dataViewTag:
		          if ((object.byteLength != other.byteLength) ||
		              (object.byteOffset != other.byteOffset)) {
		            return false;
		          }
		          object = object.buffer;
		          other = other.buffer;

		        case arrayBufferTag:
		          if ((object.byteLength != other.byteLength) ||
		              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
		            return false;
		          }
		          return true;

		        case boolTag:
		        case dateTag:
		          // 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$1:
		          // Coerce regexes to strings and treat strings, primitives and objects,
		          // as equal. See https://es5.github.io/#x15.10.6.4 for more details.
		          return object == (other + '');

		        case mapTag:
		          var convert = mapToArray;

		        case setTag:
		          var isPartial = bitmask & PARTIAL_COMPARE_FLAG$3;
		          convert || (convert = setToArray);

		          if (object.size != other.size && !isPartial) {
		            return false;
		          }
		          // Assume cyclic values are equal.
		          var stacked = stack.get(object);
		          if (stacked) {
		            return stacked == other;
		          }
		          bitmask |= UNORDERED_COMPARE_FLAG$2;
		          stack.set(object, other);

		          // Recursively compare objects (susceptible to call stack limits).
		          return equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack);

		        case symbolTag$1:
		          if (symbolValueOf) {
		            return symbolValueOf.call(object) == symbolValueOf.call(other);
		          }
		      }
		      return false;
		    }

		    /** Used to compose bitmasks for comparison styles. */
		    var PARTIAL_COMPARE_FLAG$4 = 2;

		    /**
		     * A specialized version of `baseIsEqualDeep` for objects with support for
		     * partial deep comparisons.
		     *
		     * @private
		     * @param {Object} object The object to compare.
		     * @param {Object} other The other object to compare.
		     * @param {Function} equalFunc The function to determine equivalents of values.
		     * @param {Function} customizer The function to customize comparisons.
		     * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		     *  for more details.
		     * @param {Object} stack Tracks traversed `object` and `other` objects.
		     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		     */
		    function equalObjects(object, other, equalFunc, customizer, bitmask, stack) {
		      var isPartial = bitmask & PARTIAL_COMPARE_FLAG$4,
		          objProps = keys(object),
		          objLength = objProps.length,
		          othProps = keys(other),
		          othLength = othProps.length;

		      if (objLength != othLength && !isPartial) {
		        return false;
		      }
		      var index = objLength;
		      while (index--) {
		        var key = objProps[index];
		        if (!(isPartial ? key in other : baseHas(other, key))) {
		          return false;
		        }
		      }
		      // Assume cyclic values are equal.
		      var stacked = stack.get(object);
		      if (stacked) {
		        return stacked == other;
		      }
		      var result = true;
		      stack.set(object, other);

		      var skipCtor = isPartial;
		      while (++index < objLength) {
		        key = objProps[index];
		        var objValue = object[key],
		            othValue = other[key];

		        if (customizer) {
		          var compared = isPartial
		            ? customizer(othValue, objValue, key, other, object, stack)
		            : customizer(objValue, othValue, key, object, other, stack);
		        }
		        // Recursively compare objects (susceptible to call stack limits).
		        if (!(compared === undefined
		              ? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack))
		              : compared
		            )) {
		          result = false;
		          break;
		        }
		        skipCtor || (skipCtor = key == 'constructor');
		      }
		      if (result && !skipCtor) {
		        var objCtor = object.constructor,
		            othCtor = other.constructor;

		        // Non `Object` object instances with different constructors are not equal.
		        if (objCtor != othCtor &&
		            ('constructor' in object && 'constructor' in other) &&
		            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
		              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
		          result = false;
		        }
		      }
		      stack['delete'](object);
		      return result;
		    }

		    /* Built-in method references that are verified to be native. */
		    var DataView = getNative(root, 'DataView');

		    /* Built-in method references that are verified to be native. */
		    var Promise = getNative(root, 'Promise');

		    /* Built-in method references that are verified to be native. */
		    var Set = getNative(root, 'Set');

		    /* Built-in method references that are verified to be native. */
		    var WeakMap = getNative(root, 'WeakMap');

		    var mapTag$1 = '[object Map]';
		    var objectTag$1 = '[object Object]';
		    var promiseTag = '[object Promise]';
		    var setTag$1 = '[object Set]';
		    var weakMapTag = '[object WeakMap]';
		    var dataViewTag$1 = '[object DataView]';

		    /** Used for built-in method references. */
		    var objectProto$11 = Object.prototype;

		    /** Used to resolve the decompiled source of functions. */
		    var funcToString$1 = Function.prototype.toString;

		    /**
		     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		     * of values.
		     */
		    var objectToString$4 = objectProto$11.toString;

		    /** Used to detect maps, sets, and weakmaps. */
		    var dataViewCtorString = DataView ? (DataView + '') : '';
		    var mapCtorString = Map ? funcToString$1.call(Map) : '';
		    var promiseCtorString = Promise ? funcToString$1.call(Promise) : '';
		    var setCtorString = Set ? funcToString$1.call(Set) : '';
		    var weakMapCtorString = WeakMap ? funcToString$1.call(WeakMap) : '';
		    /**
		     * Gets the `toStringTag` of `value`.
		     *
		     * @private
		     * @param {*} value The value to query.
		     * @returns {string} Returns the `toStringTag`.
		     */
		    function getTag(value) {
		      return objectToString$4.call(value);
		    }

		    // Fallback for data views, maps, sets, and weak maps in IE 11,
		    // for data views in Edge, and promises in Node.js.
		    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag$1) ||
		        (Map && getTag(new Map) != mapTag$1) ||
		        (Promise && getTag(Promise.resolve()) != promiseTag) ||
		        (Set && getTag(new Set) != setTag$1) ||
		        (WeakMap && getTag(new WeakMap) != weakMapTag)) {
		      getTag = function(value) {
		        var result = objectToString$4.call(value),
		            Ctor = result == objectTag$1 ? value.constructor : null,
		            ctorString = typeof Ctor == 'function' ? funcToString$1.call(Ctor) : '';

		        if (ctorString) {
		          switch (ctorString) {
		            case dataViewCtorString: return dataViewTag$1;
		            case mapCtorString: return mapTag$1;
		            case promiseCtorString: return promiseTag;
		            case setCtorString: return setTag$1;
		            case weakMapCtorString: return weakMapTag;
		          }
		        }
		        return result;
		      };
		    }

		    var getTag$1 = getTag;

		    var argsTag$2 = '[object Arguments]';
		    var arrayTag$1 = '[object Array]';
		    var boolTag$1 = '[object Boolean]';
		    var dateTag$1 = '[object Date]';
		    var errorTag$1 = '[object Error]';
		    var funcTag$1 = '[object Function]';
		    var mapTag$2 = '[object Map]';
		    var numberTag$1 = '[object Number]';
		    var objectTag$2 = '[object Object]';
		    var regexpTag$1 = '[object RegExp]';
		    var setTag$2 = '[object Set]';
		    var stringTag$2 = '[object String]';
		    var weakMapTag$1 = '[object WeakMap]';
		    var arrayBufferTag$1 = '[object ArrayBuffer]';
		    var dataViewTag$2 = '[object DataView]';
		    var float32Tag = '[object Float32Array]';
		    var float64Tag = '[object Float64Array]';
		    var int8Tag = '[object Int8Array]';
		    var int16Tag = '[object Int16Array]';
		    var int32Tag = '[object Int32Array]';
		    var uint8Tag = '[object Uint8Array]';
		    var uint8ClampedTag = '[object Uint8ClampedArray]';
		    var uint16Tag = '[object Uint16Array]';
		    var uint32Tag = '[object Uint32Array]';
		    /** 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$2] = typedArrayTags[arrayTag$1] =
		    typedArrayTags[arrayBufferTag$1] = typedArrayTags[boolTag$1] =
		    typedArrayTags[dataViewTag$2] = typedArrayTags[dateTag$1] =
		    typedArrayTags[errorTag$1] = typedArrayTags[funcTag$1] =
		    typedArrayTags[mapTag$2] = typedArrayTags[numberTag$1] =
		    typedArrayTags[objectTag$2] = typedArrayTags[regexpTag$1] =
		    typedArrayTags[setTag$2] = typedArrayTags[stringTag$2] =
		    typedArrayTags[weakMapTag$1] = false;

		    /** Used for built-in method references. */
		    var objectProto$12 = Object.prototype;

		    /**
		     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		     * of values.
		     */
		    var objectToString$5 = objectProto$12.toString;

		    /**
		     * Checks if `value` is classified as a typed array.
		     *
		     * @static
		     * @memberOf _
		     * @since 3.0.0
		     * @category Lang
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` is correctly classified,
		     *  else `false`.
		     * @example
		     *
		     * _.isTypedArray(new Uint8Array);
		     * // => true
		     *
		     * _.isTypedArray([]);
		     * // => false
		     */
		    function isTypedArray(value) {
		      return isObjectLike(value) &&
		        isLength(value.length) && !!typedArrayTags[objectToString$5.call(value)];
		    }

		    /** Used to compose bitmasks for comparison styles. */
		    var PARTIAL_COMPARE_FLAG$1 = 2;

		    /** `Object#toString` result references. */
		    var argsTag$1 = '[object Arguments]';
		    var arrayTag = '[object Array]';
		    var objectTag = '[object Object]';
		    /** Used for built-in method references. */
		    var objectProto$10 = Object.prototype;

		    /** Used to check objects for own properties. */
		    var hasOwnProperty$5 = objectProto$10.hasOwnProperty;

		    /**
		     * A specialized version of `baseIsEqual` for arrays and objects which performs
		     * deep comparisons and tracks traversed objects enabling objects with circular
		     * references to be compared.
		     *
		     * @private
		     * @param {Object} object The object to compare.
		     * @param {Object} other The other object to compare.
		     * @param {Function} equalFunc The function to determine equivalents of values.
		     * @param {Function} [customizer] The function to customize comparisons.
		     * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual`
		     *  for more details.
		     * @param {Object} [stack] Tracks traversed `object` and `other` objects.
		     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		     */
		    function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) {
		      var objIsArr = isArray(object),
		          othIsArr = isArray(other),
		          objTag = arrayTag,
		          othTag = arrayTag;

		      if (!objIsArr) {
		        objTag = getTag$1(object);
		        objTag = objTag == argsTag$1 ? objectTag : objTag;
		      }
		      if (!othIsArr) {
		        othTag = getTag$1(other);
		        othTag = othTag == argsTag$1 ? objectTag : othTag;
		      }
		      var objIsObj = objTag == objectTag && !isHostObject(object),
		          othIsObj = othTag == objectTag && !isHostObject(other),
		          isSameTag = objTag == othTag;

		      if (isSameTag && !objIsObj) {
		        stack || (stack = new Stack);
		        return (objIsArr || isTypedArray(object))
		          ? equalArrays(object, other, equalFunc, customizer, bitmask, stack)
		          : equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack);
		      }
		      if (!(bitmask & PARTIAL_COMPARE_FLAG$1)) {
		        var objIsWrapped = objIsObj && hasOwnProperty$5.call(object, '__wrapped__'),
		            othIsWrapped = othIsObj && hasOwnProperty$5.call(other, '__wrapped__');

		        if (objIsWrapped || othIsWrapped) {
		          var objUnwrapped = objIsWrapped ? object.value() : object,
		              othUnwrapped = othIsWrapped ? other.value() : other;

		          stack || (stack = new Stack);
		          return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack);
		        }
		      }
		      if (!isSameTag) {
		        return false;
		      }
		      stack || (stack = new Stack);
		      return equalObjects(object, other, equalFunc, customizer, bitmask, stack);
		    }

		    /**
		     * The base implementation of `_.isEqual` which supports partial comparisons
		     * and tracks traversed objects.
		     *
		     * @private
		     * @param {*} value The value to compare.
		     * @param {*} other The other value to compare.
		     * @param {Function} [customizer] The function to customize comparisons.
		     * @param {boolean} [bitmask] The bitmask of comparison flags.
		     *  The bitmask may be composed of the following flags:
		     *     1 - Unordered comparison
		     *     2 - Partial comparison
		     * @param {Object} [stack] Tracks traversed `value` and `other` objects.
		     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		     */
		    function baseIsEqual(value, other, customizer, bitmask, stack) {
		      if (value === other) {
		        return true;
		      }
		      if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
		        return value !== value && other !== other;
		      }
		      return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack);
		    }

		    var UNORDERED_COMPARE_FLAG = 1;
		    var PARTIAL_COMPARE_FLAG = 2;
		    /**
		     * The base implementation of `_.isMatch` without support for iteratee shorthands.
		     *
		     * @private
		     * @param {Object} object The object to inspect.
		     * @param {Object} source The object of property values to match.
		     * @param {Array} matchData The property names, values, and compare flags to match.
		     * @param {Function} [customizer] The function to customize comparisons.
		     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
		     */
		    function baseIsMatch(object, source, matchData, customizer) {
		      var index = matchData.length,
		          length = index,
		          noCustomizer = !customizer;

		      if (object == null) {
		        return !length;
		      }
		      object = Object(object);
		      while (index--) {
		        var data = matchData[index];
		        if ((noCustomizer && data[2])
		              ? data[1] !== object[data[0]]
		              : !(data[0] in object)
		            ) {
		          return false;
		        }
		      }
		      while (++index < length) {
		        data = matchData[index];
		        var key = data[0],
		            objValue = object[key],
		            srcValue = data[1];

		        if (noCustomizer && data[2]) {
		          if (objValue === undefined && !(key in object)) {
		            return false;
		          }
		        } else {
		          var stack = new Stack;
		          if (customizer) {
		            var result = customizer(objValue, srcValue, key, object, source, stack);
		          }
		          if (!(result === undefined
		                ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack)
		                : result
		              )) {
		            return false;
		          }
		        }
		      }
		      return true;
		    }

		    /**
		     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
		     *
		     * @private
		     * @param {*} value The value to check.
		     * @returns {boolean} Returns `true` if `value` if suitable for strict
		     *  equality comparisons, else `false`.
		     */
		    function isStrictComparable(value) {
		      return value === value && !isObject(value);
		    }

		    /**
		     * A specialized version of `_.map` for arrays without support for iteratee
		     * shorthands.
		     *
		     * @private
		     * @param {Array} array The array to iterate over.
		     * @param {Function} iteratee The function invoked per iteration.
		     * @returns {Array} Returns the new mapped array.
		     */
		    function arrayMap(array, iteratee) {
		      var index = -1,
		          length = array.length,
		          result = Array(length);

		      while (++index < length) {
		        result[index] = iteratee(array[index], index, array);
		      }
		      return result;
		    }

		    /**
		     * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
		     * of key-value pairs for `object` corresponding to the property names of `props`.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @param {Array} props The property names to get values for.
		     * @returns {Object} Returns the new array of key-value pairs.
		     */
		    function baseToPairs(object, props) {
		      return arrayMap(props, function(key) {
		        return [key, object[key]];
		      });
		    }

		    /**
		     * Creates an array of own enumerable string keyed-value pairs for `object`
		     * which can be consumed by `_.fromPairs`.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @alias entries
		     * @category Object
		     * @param {Object} object The object to query.
		     * @returns {Array} Returns the new array of key-value pairs.
		     * @example
		     *
		     * function Foo() {
		     *   this.a = 1;
		     *   this.b = 2;
		     * }
		     *
		     * Foo.prototype.c = 3;
		     *
		     * _.toPairs(new Foo);
		     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
		     */
		    function toPairs(object) {
		      return baseToPairs(object, keys(object));
		    }

		    /**
		     * Gets the property names, values, and compare flags of `object`.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @returns {Array} Returns the match data of `object`.
		     */
		    function getMatchData(object) {
		      var result = toPairs(object),
		          length = result.length;

		      while (length--) {
		        result[length][2] = isStrictComparable(result[length][1]);
		      }
		      return result;
		    }

		    /**
		     * The base implementation of `_.matches` which doesn't clone `source`.
		     *
		     * @private
		     * @param {Object} source The object of property values to match.
		     * @returns {Function} Returns the new 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 Object(object)));
		        };
		      }
		      return function(object) {
		        return object === source || baseIsMatch(object, source, matchData);
		      };
		    }

		    /** Used as the `TypeError` message for "Functions" methods. */
		    var FUNC_ERROR_TEXT$1 = 'Expected a function';

		    /**
		     * Creates a function that memoizes the result of `func`. If `resolver` is
		     * provided it determines the cache key for storing the result based on the
		     * arguments provided to the memoized function. By default, the first argument
		     * provided to the memoized function is used as the map cache key. The `func`
		     * is invoked with the `this` binding of the memoized function.
		     *
		     * **Note:** The cache is exposed as the `cache` property on the memoized
		     * function. Its creation may be customized by replacing the `_.memoize.Cache`
		     * constructor with one whose instances implement the
		     * [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object)
		     * method interface of `delete`, `get`, `has`, and `set`.
		     *
		     * @static
		     * @memberOf _
		     * @since 0.1.0
		     * @category Function
		     * @param {Function} func The function to have its output memoized.
		     * @param {Function} [resolver] The function to resolve the cache key.
		     * @returns {Function} Returns the new memoizing function.
		     * @example
		     *
		     * var object = { 'a': 1, 'b': 2 };
		     * var other = { 'c': 3, 'd': 4 };
		     *
		     * var values = _.memoize(_.values);
		     * values(object);
		     * // => [1, 2]
		     *
		     * values(other);
		     * // => [3, 4]
		     *
		     * object.a = 2;
		     * values(object);
		     * // => [1, 2]
		     *
		     * // Modify the result cache.
		     * values.cache.set(object, ['a', 'b']);
		     * values(object);
		     * // => ['a', 'b']
		     *
		     * // Replace `_.memoize.Cache`.
		     * _.memoize.Cache = WeakMap;
		     */
		    function memoize(func, resolver) {
		      if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
		        throw new TypeError(FUNC_ERROR_TEXT$1);
		      }
		      var memoized = function() {
		        var args = arguments,
		            key = resolver ? resolver.apply(this, args) : args[0],
		            cache = memoized.cache;

		        if (cache.has(key)) {
		          return cache.get(key);
		        }
		        var result = func.apply(this, args);
		        memoized.cache = cache.set(key, result);
		        return result;
		      };
		      memoized.cache = new (memoize.Cache || MapCache);
		      return memoized;
		    }

		    // Assign cache to `_.memoize`.
		    memoize.Cache = MapCache;

		    /** Used as references for various `Number` constants. */
		    var INFINITY$1 = 1 / 0;

		    /** Used to convert symbols to primitives and strings. */
		    var symbolProto$1 = Symbol$1 ? Symbol$1.prototype : undefined;
		    var symbolToString = symbolProto$1 ? symbolProto$1.toString : undefined;
		    /**
		     * Converts `value` to a string if it's not one. An empty string is returned
		     * for `null` and `undefined` values. The sign of `-0` is preserved.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Lang
		     * @param {*} value The value to process.
		     * @returns {string} Returns the string.
		     * @example
		     *
		     * _.toString(null);
		     * // => ''
		     *
		     * _.toString(-0);
		     * // => '-0'
		     *
		     * _.toString([1, 2, 3]);
		     * // => '1,2,3'
		     */
		    function toString(value) {
		      // Exit early for strings to avoid a performance hit in some environments.
		      if (typeof value == 'string') {
		        return value;
		      }
		      if (value == null) {
		        return '';
		      }
		      if (isSymbol(value)) {
		        return symbolToString ? symbolToString.call(value) : '';
		      }
		      var result = (value + '');
		      return (result == '0' && (1 / value) == -INFINITY$1) ? '-0' : result;
		    }

		    /** Used to match property names within property paths. */
		    var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]/g;

		    /** Used to match backslashes in property paths. */
		    var reEscapeChar = /\\(\\)?/g;

		    /**
		     * Converts `string` to a property path array.
		     *
		     * @private
		     * @param {string} string The string to convert.
		     * @returns {Array} Returns the property path array.
		     */
		    var stringToPath = memoize(function(string) {
		      var result = [];
		      toString(string).replace(rePropName, function(match, number, quote, string) {
		        result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
		      });
		      return result;
		    });

		    /**
		     * Casts `value` to a path array if it's not one.
		     *
		     * @private
		     * @param {*} value The value to inspect.
		     * @returns {Array} Returns the cast property path array.
		     */
		    function baseCastPath(value) {
		      return isArray(value) ? value : stringToPath(value);
		    }

		    var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/;
		    var reIsPlainProp = /^\w*$/;
		    /**
		     * 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 == 'number' || type == 'symbol') {
		        return true;
		      }
		      return !isArray(value) &&
		        (isSymbol(value) || reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
		          (object != null && value in Object(object)));
		    }

		    /**
		     * The base implementation of `_.get` without support for default values.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @param {Array|string} path The path of the property to get.
		     * @returns {*} Returns the resolved value.
		     */
		    function baseGet(object, path) {
		      path = isKey(path, object) ? [path] : baseCastPath(path);

		      var index = 0,
		          length = path.length;

		      while (object != null && index < length) {
		        object = object[path[index++]];
		      }
		      return (index && index == length) ? object : undefined;
		    }

		    /**
		     * Gets the value at `path` of `object`. If the resolved value is
		     * `undefined` the `defaultValue` is used in its place.
		     *
		     * @static
		     * @memberOf _
		     * @since 3.7.0
		     * @category Object
		     * @param {Object} object The object to query.
		     * @param {Array|string} path The path of the property to get.
		     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
		     * @returns {*} Returns the resolved value.
		     * @example
		     *
		     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
		     *
		     * _.get(object, 'a[0].b.c');
		     * // => 3
		     *
		     * _.get(object, ['a', '0', 'b', 'c']);
		     * // => 3
		     *
		     * _.get(object, 'a.b.c', 'default');
		     * // => 'default'
		     */
		    function get(object, path, defaultValue) {
		      var result = object == null ? undefined : baseGet(object, path);
		      return result === undefined ? defaultValue : result;
		    }

		    /**
		     * The base implementation of `_.hasIn` without support for deep paths.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @param {Array|string} key The key to check.
		     * @returns {boolean} Returns `true` if `key` exists, else `false`.
		     */
		    function baseHasIn(object, key) {
		      return key in Object(object);
		    }

		    /**
		     * Checks if `path` exists on `object`.
		     *
		     * @private
		     * @param {Object} object The object to query.
		     * @param {Array|string} path The path to check.
		     * @param {Function} hasFunc The function to check properties.
		     * @returns {boolean} Returns `true` if `path` exists, else `false`.
		     */
		    function hasPath(object, path, hasFunc) {
		      if (object == null) {
		        return false;
		      }
		      var result = hasFunc(object, path);
		      if (!result && !isKey(path)) {
		        path = baseCastPath(path);

		        var index = -1,
		            length = path.length;

		        while (object != null && ++index < length) {
		          var key = path[index];
		          if (!(result = hasFunc(object, key))) {
		            break;
		          }
		          object = object[key];
		        }
		      }
		      var length = object ? object.length : undefined;
		      return result || (
		        !!length && isLength(length) && isIndex(path, length) &&
		        (isArray(object) || isString(object) || isArguments(object))
		      );
		    }

		    /**
		     * Checks if `path` is a direct or inherited property of `object`.
		     *
		     * @static
		     * @memberOf _
		     * @since 4.0.0
		     * @category Object
		     * @param {Object} object The object to query.
		     * @param {Array|string} path The path to check.
		     * @returns {boolean} Returns `true` if `path` exists, else `false`.
		     * @example
		     *
		     * var object = _.create({ 'a': _.create({ 'b': _.create({ 'c': 3 }) }) });
		     *
		     * _.hasIn(object, 'a');
		     * // => true
		     *
		     * _.hasIn(object, 'a.b.c');
		     * // => true
		     *
		     * _.hasIn(object, ['a', 'b', 'c']);
		     * // => true
		     *
		     * _.hasIn(object, 'b');
		     * // => false
		     */
		    function hasIn(object, path) {
		      return hasPath(object, path, baseHasIn);
		    }

		    var UNORDERED_COMPARE_FLAG$3 = 1;
		    var PARTIAL_COMPARE_FLAG$5 = 2;
		    /**
		     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
		     *
		     * @private
		     * @param {string} path The path of the property to get.
		     * @param {*} srcValue The value to match.
		     * @returns {Function} Returns the new function.
		     */
		    function baseMatchesProperty(path, srcValue) {
		      return function(object) {
		        var objValue = get(object, path);
		        return (objValue === undefined && objValue === srcValue)
		          ? hasIn(object, path)
		          : baseIsEqual(srcValue, objValue, undefined, UNORDERED_COMPARE_FLAG$3 | PARTIAL_COMPARE_FLAG$5);
		      };
		    }

		    /**
		     * This method returns the first argument given to it.
		     *
		     * @static
		     * @since 0.1.0
		     * @memberOf _
		     * @category Util
		     * @param {*} value Any value.
		     * @returns {*} Returns `value`.
		     * @example
		     *
		     * var object = { 'user': 'fred' };
		     *
		     * _.identity(object) === object;
		     * // => true
		     */
		    function identity(value) {
		      return value;
		    }

		    /**
		     * 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) {
		      return function(object) {
		        return baseGet(object, path);
		      };
		    }

		    /**
		     * Creates a function that returns the value at `path` of a given object.
		     *
		     * @static
		     * @memberOf _
		     * @since 2.4.0
		     * @category Util
		     * @param {Array|string} path The path of the property to get.
		     * @returns {Function} Returns the new function.
		     * @example
		     *
		     * var objects = [
		     *   { 'a': { 'b': { 'c': 2 } } },
		     *   { 'a': { 'b': { 'c': 1 } } }
		     * ];
		     *
		     * _.map(objects, _.property('a.b.c'));
		     * // => [2, 1]
		     *
		     * _.map(_.sortBy(objects, _.property(['a', 'b', 'c'])), 'a.b.c');
		     * // => [1, 2]
		     */
		    function property(path) {
		      return isKey(path) ? baseProperty(path) : basePropertyDeep(path);
		    }

		    /**
		     * The base implementation of `_.iteratee`.
		     *
		     * @private
		     * @param {*} [value=_.identity] The value to convert to an iteratee.
		     * @returns {Function} Returns the iteratee.
		     */
		    function baseIteratee(value) {
		      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
		      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
		      if (typeof value == 'function') {
		        return value;
		      }
		      if (value == null) {
		        return identity;
		      }
		      if (typeof value == 'object') {
		        return isArray(value)
		          ? baseMatchesProperty(value[0], value[1])
		          : baseMatches(value);
		      }
		      return property(value);
		    }

		    /**
		     * Iterates over own enumerable string keyed properties of an object invoking
		     * `iteratee` for each property. The iteratee is invoked with three arguments:
		     * (value, key, object). Iteratee functions may exit iteration early by
		     * explicitly returning `false`.
		     *
		     * @static
		     * @memberOf _
		     * @since 0.3.0
		     * @category Object
		     * @param {Object} object The object to iterate over.
		     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
		     * @returns {Object} Returns `object`.
		     * @example
		     *
		     * function Foo() {
		     *   this.a = 1;
		     *   this.b = 2;
		     * }
		     *
		     * Foo.prototype.c = 3;
		     *
		     * _.forOwn(new Foo, function(value, key) {
		     *   console.log(key);
		     * });
		     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
		     */
		    function forOwn(object, iteratee) {
		      return object && baseForOwn(object, baseIteratee(iteratee));
		    }

		    /**
		     * 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;
		    }

		    /**
		     * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
		     *
		     * @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;
		    }

		    /**
		     * Determines the best order for running the functions in `tasks`, based on
		     * their requirements. Each function can optionally depend on other functions
		     * being completed first, and each function is run as soon as its requirements
		     * are satisfied.
		     *
		     * If any of the functions pass an error to their callback, the `auto` sequence
		     * will stop. Further tasks will not execute (so any other functions depending
		     * on it will not run), and the main `callback` is immediately called with the
		     * error.
		     *
		     * Functions also receive an object containing the results of functions which
		     * have completed so far as the first argument, if they have dependencies. If a
		     * task function has no dependencies, it will only be passed a callback.
		     *
		     * @name auto
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Object} tasks - An object. Each of its properties is either a
		     * function or an array of requirements, with the function itself the last item
		     * in the array. The object's key of a property serves as the name of the task
		     * defined by that property, i.e. can be used when specifying requirements for
		     * other tasks. The function receives one or two arguments:
		     * * a `results` object, containing the results of the previously executed
		     *   functions, only passed if the task has any dependencies,
		     * * a `callback(err, result)` function, which must be called when finished,
		     *   passing an `error` (which can be `null`) and the result of the function's
		     *   execution.
		     * @param {number} [concurrency=Infinity] - An optional `integer` for
		     * determining the maximum number of tasks that can be run in parallel. By
		     * default, as many as possible.
		     * @param {Function} [callback] - An optional callback which is called when all
		     * the tasks have been completed. It receives the `err` argument if any `tasks`
		     * pass an error to their callback. Results are always returned; however, if an
		     * error occurs, no further `tasks` will be performed, and the results object
		     * will only contain partial results. Invoked with (err, results).
		     * @example
		     *
		     * async.auto({
		     *     // this function will just be passed a callback
		     *     readData: async.apply(fs.readFile, 'data.txt', 'utf-8'),
		     *     showData: ['readData', function(results, cb) {
		     *         // results.readData is the file's contents
		     *         // ...
		     *     }]
		     * }, callback);
		     *
		     * async.auto({
		     *     get_data: function(callback) {
		     *         console.log('in get_data');
		     *         // async code to get some data
		     *         callback(null, 'data', 'converted to array');
		     *     },
		     *     make_folder: function(callback) {
		     *         console.log('in make_folder');
		     *         // async code to create a directory to store a file in
		     *         // this is run at the same time as getting the data
		     *         callback(null, 'folder');
		     *     },
		     *     write_file: ['get_data', 'make_folder', function(results, callback) {
		     *         console.log('in write_file', JSON.stringify(results));
		     *         // once there is some data and the directory exists,
		     *         // write the data to a file in the directory
		     *         callback(null, 'filename');
		     *     }],
		     *     email_link: ['write_file', function(results, callback) {
		     *         console.log('in email_link', JSON.stringify(results));
		     *         // once the file is written let's email a link to it...
		     *         // results.write_file contains the filename returned by write_file.
		     *         callback(null, {'file':results.write_file, 'email':'user@example.com'});
		     *     }]
		     * }, function(err, results) {
		     *     console.log('err = ', err);
		     *     console.log('results = ', results);
		     * });
		     */
		    function auto (tasks, concurrency, callback) {
		        if (typeof concurrency === 'function') {
		            // concurrency is optional, shift the args.
		            callback = concurrency;
		            concurrency = null;
		        }
		        callback = once(callback || noop);
		        var keys$$ = keys(tasks);
		        var numTasks = keys$$.length;
		        if (!numTasks) {
		            return callback(null);
		        }
		        if (!concurrency) {
		            concurrency = numTasks;
		        }

		        var results = {};
		        var runningTasks = 0;
		        var hasError = false;

		        var listeners = {};

		        var readyTasks = [];

		        // for cycle detection:
		        var readyToCheck = []; // tasks that have been identified as reachable
		        // without the possibility of returning to an ancestor task
		        var uncheckedDependencies = {};

		        forOwn(tasks, function (task, key) {
		            if (!isArray(task)) {
		                // no dependencies
		                enqueueTask(key, [task]);
		                readyToCheck.push(key);
		                return;
		            }

		            var dependencies = task.slice(0, task.length - 1);
		            var remainingDependencies = dependencies.length;
		            if (!remainingDependencies) {
		                enqueueTask(key, [task]);
		                readyToCheck.push(key);
		            }
		            uncheckedDependencies[key] = remainingDependencies;

		            arrayEach(dependencies, function (dependencyName) {
		                if (!tasks[dependencyName]) {
		                    throw new Error('async.auto task `' + key + '` has a non-existent dependency in ' + dependencies.join(', '));
		                }
		                addListener(dependencyName, function () {
		                    remainingDependencies--;
		                    if (remainingDependencies === 0) {
		                        enqueueTask(key, task);
		                    }
		                });
		            });
		        });

		        checkForDeadlocks();
		        processQueue();

		        function enqueueTask(key, task) {
		            readyTasks.push(function () {
		                runTask(key, task);
		            });
		        }

		        function processQueue() {
		            if (readyTasks.length === 0 && runningTasks === 0) {
		                return callback(null, results);
		            }
		            while (readyTasks.length && runningTasks < concurrency) {
		                var run = readyTasks.shift();
		                run();
		            }
		        }

		        function addListener(taskName, fn) {
		            var taskListeners = listeners[taskName];
		            if (!taskListeners) {
		                taskListeners = listeners[taskName] = [];
		            }

		            taskListeners.push(fn);
		        }

		        function taskComplete(taskName) {
		            var taskListeners = listeners[taskName] || [];
		            arrayEach(taskListeners, function (fn) {
		                fn();
		            });
		            processQueue();
		        }

		        function runTask(key, task) {
		            if (hasError) return;

		            var taskCallback = onlyOnce(rest(function (err, args) {
		                runningTasks--;
		                if (args.length <= 1) {
		                    args = args[0];
		                }
		                if (err) {
		                    var safeResults = {};
		                    forOwn(results, function (val, rkey) {
		                        safeResults[rkey] = val;
		                    });
		                    safeResults[key] = args;
		                    hasError = true;
		                    listeners = [];

		                    callback(err, safeResults);
		                } else {
		                    results[key] = args;
		                    taskComplete(key);
		                }
		            }));

		            runningTasks++;
		            var taskFn = task[task.length - 1];
		            if (task.length > 1) {
		                taskFn(results, taskCallback);
		            } else {
		                taskFn(taskCallback);
		            }
		        }

		        function checkForDeadlocks() {
		            // Kahn's algorithm
		            // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm
		            // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html
		            var currentTask;
		            var counter = 0;
		            while (readyToCheck.length) {
		                currentTask = readyToCheck.pop();
		                counter++;
		                arrayEach(getDependents(currentTask), function (dependent) {
		                    if (! --uncheckedDependencies[dependent]) {
		                        readyToCheck.push(dependent);
		                    }
		                });
		            }

		            if (counter !== numTasks) {
		                throw new Error('async.auto cannot execute tasks due to a recursive dependency');
		            }
		        }

		        function getDependents(taskName) {
		            var result = [];
		            forOwn(tasks, function (task, key) {
		                if (isArray(task) && baseIndexOf(task, taskName, 0) >= 0) {
		                    result.push(key);
		                }
		            });
		            return result;
		        }
		    }

		    /**
		     * Copies the values of `source` to `array`.
		     *
		     * @private
		     * @param {Array} source The array to copy values from.
		     * @param {Array} [array=[]] The array to copy values to.
		     * @returns {Array} Returns `array`.
		     */
		    function copyArray(source, array) {
		      var index = -1,
		          length = source.length;

		      array || (array = Array(length));
		      while (++index < length) {
		        array[index] = source[index];
		      }
		      return array;
		    }

		    var argsRegex = /^function\s*[^\(]*\(\s*([^\)]*)\)/m;

		    function parseParams(func) {
		        return func.toString().match(argsRegex)[1].split(/\s*\,\s*/);
		    }

		    /**
		     * A dependency-injected version of the {@link async.auto} function. Dependent
		     * tasks are specified as parameters to the function, after the usual callback
		     * parameter, with the parameter names matching the names of the tasks it
		     * depends on. This can provide even more readable task graphs which can be
		     * easier to maintain.
		     *
		     * If a final callback is specified, the task results are similarly injected,
		     * specified as named parameters after the initial error parameter.
		     *
		     * The autoInject function is purely syntactic sugar and its semantics are
		     * otherwise equivalent to {@link async.auto}.
		     *
		     * @name autoInject
		     * @static
		     * @memberOf async
		     * @see async.auto
		     * @category Control Flow
		     * @param {Object} tasks - An object, each of whose properties is a function of
		     * the form 'func([dependencies...], callback). The object's key of a property
		     * serves as the name of the task defined by that property, i.e. can be used
		     * when specifying requirements for other tasks.
		     * * The `callback` parameter is a `callback(err, result)` which must be called
		     *   when finished, passing an `error` (which can be `null`) and the result of
		     *   the function's execution. The remaining parameters name other tasks on
		     *   which the task is dependent, and the results from those tasks are the
		     *   arguments of those parameters.
		     * @param {Function} [callback] - An optional callback which is called when all
		     * the tasks have been completed. It receives the `err` argument if any `tasks`
		     * pass an error to their callback. The remaining parameters are task names
		     * whose results you are interested in. This callback will only be called when
		     * all tasks have finished or an error has occurred, and so do not specify
		     * dependencies in the same way as `tasks` do. If an error occurs, no further
		     * `tasks` will be performed, and `results` will only be valid for those tasks
		     * which managed to complete. Invoked with (err, [results...]).
		     * @example
		     *
		     * //  The example from `auto` can be rewritten as follows:
		     * async.autoInject({
		     *     get_data: function(callback) {
		     *         // async code to get some data
		     *         callback(null, 'data', 'converted to array');
		     *     },
		     *     make_folder: function(callback) {
		     *         // async code to create a directory to store a file in
		     *         // this is run at the same time as getting the data
		     *         callback(null, 'folder');
		     *     },
		     *     write_file: function(get_data, make_folder, callback) {
		     *         // once there is some data and the directory exists,
		     *         // write the data to a file in the directory
		     *         callback(null, 'filename');
		     *     },
		     *     email_link: function(write_file, callback) {
		     *         // once the file is written let's email a link to it...
		     *         // write_file contains the filename returned by write_file.
		     *         callback(null, {'file':write_file, 'email':'user@example.com'});
		     *     }
		     * }, function(err, email_link) {
		     *     console.log('err = ', err);
		     *     console.log('email_link = ', email_link);
		     * });
		     *
		     * // If you are using a JS minifier that mangles parameter names, `autoInject`
		     * // will not work with plain functions, since the parameter names will be
		     * // collapsed to a single letter identifier.  To work around this, you can
		     * // explicitly specify the names of the parameters your task function needs
		     * // in an array, similar to Angular.js dependency injection.  The final
		     * // results callback can be provided as an array in the same way.
		     *
		     * // This still has an advantage over plain `auto`, since the results a task
		     * // depends on are still spread into arguments.
		     * async.autoInject({
		     *     //...
		     *     write_file: ['get_data', 'make_folder', function(get_data, make_folder, callback) {
		     *         callback(null, 'filename');
		     *     }],
		     *     email_link: ['write_file', function(write_file, callback) {
		     *         callback(null, {'file':write_file, 'email':'user@example.com'});
		     *     }]
		     *     //...
		     * }, ['email_link', function(err, email_link) {
		     *     console.log('err = ', err);
		     *     console.log('email_link = ', email_link);
		     * }]);
		     */
		    function autoInject(tasks, callback) {
		        var newTasks = {};

		        forOwn(tasks, function (taskFn, key) {
		            var params;

		            if (isArray(taskFn)) {
		                params = copyArray(taskFn);
		                taskFn = params.pop();

		                newTasks[key] = params.concat(newTask);
		            } else if (taskFn.length === 0) {
		                throw new Error("autoInject task functions require explicit parameters.");
		            } else if (taskFn.length === 1) {
		                // no dependencies, use the function as-is
		                newTasks[key] = taskFn;
		            } else {
		                params = parseParams(taskFn);
		                params.pop();

		                newTasks[key] = params.concat(newTask);
		            }

		            function newTask(results, taskCb) {
		                var newArgs = arrayMap(params, function (name) {
		                    return results[name];
		                });
		                newArgs.push(taskCb);
		                taskFn.apply(null, newArgs);
		            }
		        });

		        auto(newTasks, callback);
		    }

		    var _setImmediate = typeof setImmediate === 'function' && setImmediate;

		    var _defer;
		    if (_setImmediate) {
		        _defer = _setImmediate;
		    } else if (typeof process === 'object' && typeof process.nextTick === 'function') {
		        _defer = process.nextTick;
		    } else {
		        _defer = function (fn) {
		            setTimeout(fn, 0);
		        };
		    }

		    var setImmediate$1 = rest(function (fn, args) {
		        _defer(function () {
		            fn.apply(null, args);
		        });
		    });

		    function queue(worker, concurrency, payload) {
		        if (concurrency == null) {
		            concurrency = 1;
		        } else if (concurrency === 0) {
		            throw new Error('Concurrency must not be zero');
		        }
		        function _insert(q, data, pos, callback) {
		            if (callback != null && typeof callback !== 'function') {
		                throw new Error('task callback must be a function');
		            }
		            q.started = true;
		            if (!isArray(data)) {
		                data = [data];
		            }
		            if (data.length === 0 && q.idle()) {
		                // call drain immediately if there are no tasks
		                return setImmediate$1(function () {
		                    q.drain();
		                });
		            }
		            arrayEach(data, function (task) {
		                var item = {
		                    data: task,
		                    callback: callback || noop
		                };

		                if (pos) {
		                    q.tasks.unshift(item);
		                } else {
		                    q.tasks.push(item);
		                }
		            });
		            setImmediate$1(q.process);
		        }
		        function _next(q, tasks) {
		            return function () {
		                workers -= 1;

		                var removed = false;
		                var args = arguments;
		                arrayEach(tasks, function (task) {
		                    arrayEach(workersList, function (worker, index) {
		                        if (worker === task && !removed) {
		                            workersList.splice(index, 1);
		                            removed = true;
		                        }
		                    });

		                    task.callback.apply(task, args);
		                });

		                if (workers <= q.concurrency - q.buffer) {
		                    q.unsaturated();
		                }

		                if (q.tasks.length + workers === 0) {
		                    q.drain();
		                }
		                q.process();
		            };
		        }

		        var workers = 0;
		        var workersList = [];
		        var q = {
		            tasks: [],
		            concurrency: concurrency,
		            payload: payload,
		            saturated: noop,
		            unsaturated: noop,
		            buffer: concurrency / 4,
		            empty: noop,
		            drain: noop,
		            started: false,
		            paused: false,
		            push: function (data, callback) {
		                _insert(q, data, false, callback);
		            },
		            kill: function () {
		                q.drain = noop;
		                q.tasks = [];
		            },
		            unshift: function (data, callback) {
		                _insert(q, data, true, callback);
		            },
		            process: function () {
		                while (!q.paused && workers < q.concurrency && q.tasks.length) {

		                    var tasks = q.payload ? q.tasks.splice(0, q.payload) : q.tasks.splice(0, q.tasks.length);

		                    var data = arrayMap(tasks, baseProperty('data'));

		                    if (q.tasks.length === 0) {
		                        q.empty();
		                    }
		                    workers += 1;
		                    workersList.push(tasks[0]);

		                    if (workers === q.concurrency) {
		                        q.saturated();
		                    }

		                    var cb = onlyOnce(_next(q, tasks));
		                    worker(data, cb);
		                }
		            },
		            length: function () {
		                return q.tasks.length;
		            },
		            running: function () {
		                return workers;
		            },
		            workersList: function () {
		                return workersList;
		            },
		            idle: function () {
		                return q.tasks.length + workers === 0;
		            },
		            pause: function () {
		                q.paused = true;
		            },
		            resume: function () {
		                if (q.paused === false) {
		                    return;
		                }
		                q.paused = false;
		                var resumeCount = Math.min(q.concurrency, q.tasks.length);
		                // Need to call q.process once per concurrent
		                // worker to preserve full concurrency after pause
		                for (var w = 1; w <= resumeCount; w++) {
		                    setImmediate$1(q.process);
		                }
		            }
		        };
		        return q;
		    }

		    /**
		     * A cargo of tasks for the worker function to complete. Cargo inherits all of
		     * the same methods and event callbacks as {@link async.queue}.
		     * @typedef {Object} cargo
		     * @property {Function} length - A function returning the number of items
		     * waiting to be processed. Invoke with ().
		     * @property {number} payload - An `integer` for determining how many tasks
		     * should be process per round. This property can be changed after a `cargo` is
		     * created to alter the payload on-the-fly.
		     * @property {Function} push - Adds `task` to the `queue`. The callback is
		     * called once the `worker` has finished processing the task. Instead of a
		     * single task, an array of `tasks` can be submitted. The respective callback is
		     * used for every task in the list. Invoke with (task, [callback]).
		     * @property {Function} saturated - A callback that is called when the
		     * `queue.length()` hits the concurrency and further tasks will be queued.
		     * @property {Function} empty - A callback that is called when the last item
		     * from the `queue` is given to a `worker`.
		     * @property {Function} drain - A callback that is called when the last item
		     * from the `queue` has returned from the `worker`.
		     * @property {Function} idle - a function returning false if there are items
		     * waiting or being processed, or true if not. Invoke with ().
		     * @property {Function} pause - a function that pauses the processing of tasks
		     * until `resume()` is called. Invoke with ().
		     * @property {Function} resume - a function that resumes the processing of
		     * queued tasks when the queue is paused. Invoke with ().
		     * @property {Function} kill - a function that removes the `drain` callback and
		     * empties remaining tasks from the queue forcing it to go idle. Invoke with ().
		     */

		    /**
		     * Creates a `cargo` object with the specified payload. Tasks added to the
		     * cargo will be processed altogether (up to the `payload` limit). If the
		     * `worker` is in progress, the task is queued until it becomes available. Once
		     * the `worker` has completed some tasks, each callback of those tasks is
		     * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)
		     * for how `cargo` and `queue` work.
		     *
		     * While [queue](#queue) passes only one task to one of a group of workers
		     * at a time, cargo passes an array of tasks to a single worker, repeating
		     * when the worker is finished.
		     *
		     * @name cargo
		     * @static
		     * @memberOf async
		     * @see async.queue
		     * @category Control Flow
		     * @param {Function} worker - An asynchronous function for processing an array
		     * of queued tasks, which must call its `callback(err)` argument when finished,
		     * with an optional `err` argument. Invoked with (tasks, callback).
		     * @param {number} [payload=Infinity] - An optional `integer` for determining
		     * how many tasks should be processed per round; if omitted, the default is
		     * unlimited.
		     * @returns {cargo} A cargo object to manage the tasks. Callbacks can
		     * attached as certain properties to listen for specific events during the
		     * lifecycle of the cargo and inner queue.
		     * @example
		     *
		     * // create a cargo object with payload 2
		     * var cargo = async.cargo(function(tasks, callback) {
		     *     for (var i=0; i<tasks.length; i++) {
		     *         console.log('hello ' + tasks[i].name);
		     *     }
		     *     callback();
		     * }, 2);
		     *
		     * // add some items
		     * cargo.push({name: 'foo'}, function(err) {
		     *     console.log('finished processing foo');
		     * });
		     * cargo.push({name: 'bar'}, function(err) {
		     *     console.log('finished processing bar');
		     * });
		     * cargo.push({name: 'baz'}, function(err) {
		     *     console.log('finished processing baz');
		     * });
		     */
		    function cargo(worker, payload) {
		      return queue(worker, 1, payload);
		    }

		    /**
		     * The same as `eachOf` but runs a maximum of `limit` async operations at a
		     * time.
		     *
		     * @name eachOfLimit
		     * @static
		     * @memberOf async
		     * @see async.eachOf
		     * @alias forEachOfLimit
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A function to apply to each
		     * item in `coll`. The `key` is the item's key, or index in the case of an
		     * array. The iteratee is passed a `callback(err)` which must be called once it
		     * has completed. If no error has occurred, the callback should be run without
		     * arguments or with an explicit `null` argument. Invoked with
		     * (item, key, callback).
		     * @param {Function} [callback] - A callback which is called when all
		     * `iteratee` functions have finished, or an error occurs. Invoked with (err).
		     */
		    function eachOfLimit(obj, limit, iteratee, cb) {
		      _eachOfLimit(limit)(obj, iteratee, cb);
		    }

		    /**
		     * The same as `eachOf` but runs only a single async operation at a time.
		     *
		     * @name eachOfSeries
		     * @static
		     * @memberOf async
		     * @see async.eachOf
		     * @alias forEachOfSeries
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item in `coll`. The
		     * `key` is the item's key, or index in the case of an array. The iteratee is
		     * passed a `callback(err)` which must be called once it has completed. If no
		     * error has occurred, the callback should be run without arguments or with an
		     * explicit `null` argument. Invoked with (item, key, callback).
		     * @param {Function} [callback] - A callback which is called when all `iteratee`
		     * functions have finished, or an error occurs. Invoked with (err).
		     */
		    var eachOfSeries = doLimit(eachOfLimit, 1);

		    /**
		     * Reduces `coll` into a single value using an async `iteratee` to return each
		     * successive step. `memo` is the initial state of the reduction. This function
		     * only operates in series.
		     *
		     * For performance reasons, it may make sense to split a call to this function
		     * into a parallel map, and then use the normal `Array.prototype.reduce` on the
		     * results. This function is for situations where each step in the reduction
		     * needs to be async; if you can get the data before reducing it, then it's
		     * probably a good idea to do so.
		     *
		     * @name reduce
		     * @static
		     * @memberOf async
		     * @alias inject, foldl
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {*} memo - The initial state of the reduction.
		     * @param {Function} iteratee - A function applied to each item in the
		     * array to produce the next step in the reduction. The `iteratee` is passed a
		     * `callback(err, reduction)` which accepts an optional error as its first
		     * argument, and the state of the reduction as the second. If an error is
		     * passed to the callback, the reduction is stopped and the main `callback` is
		     * immediately called with the error. Invoked with (memo, item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Result is the reduced value. Invoked with
		     * (err, result).
		     * @example
		     *
		     * async.reduce([1,2,3], 0, function(memo, item, callback) {
		     *     // pointless async:
		     *     process.nextTick(function() {
		     *         callback(null, memo + item)
		     *     });
		     * }, function(err, result) {
		     *     // result is now equal to the last value of memo, which is 6
		     * });
		     */
		    function reduce(arr, memo, iteratee, cb) {
		        eachOfSeries(arr, function (x, i, cb) {
		            iteratee(memo, x, function (err, v) {
		                memo = v;
		                cb(err);
		            });
		        }, function (err) {
		            cb(err, memo);
		        });
		    }

		    /**
		     * Version of the compose function that is more natural to read. Each function
		     * consumes the return value of the previous function. It is the equivalent of
		     * {@link async.compose} with the arguments reversed.
		     *
		     * Each function is executed with the `this` binding of the composed function.
		     *
		     * @name seq
		     * @static
		     * @memberOf async
		     * @see async.compose
		     * @category Control Flow
		     * @param {...Function} functions - the asynchronous functions to compose
		     * @example
		     *
		     * // Requires lodash (or underscore), express3 and dresende's orm2.
		     * // Part of an app, that fetches cats of the logged user.
		     * // This example uses `seq` function to avoid overnesting and error
		     * // handling clutter.
		     * app.get('/cats', function(request, response) {
		     *     var User = request.models.User;
		     *     async.seq(
		     *         _.bind(User.get, User),  // 'User.get' has signature (id, callback(err, data))
		     *         function(user, fn) {
		     *             user.getCats(fn);      // 'getCats' has signature (callback(err, data))
		     *         }
		     *     )(req.session.user_id, function (err, cats) {
		     *         if (err) {
		     *             console.error(err);
		     *             response.json({ status: 'error', message: err.message });
		     *         } else {
		     *             response.json({ status: 'ok', message: 'Cats found', data: cats });
		     *         }
		     *     });
		     * });
		     */
		    function seq() /* functions... */{
		        var fns = arguments;
		        return rest(function (args) {
		            var that = this;

		            var cb = args[args.length - 1];
		            if (typeof cb == 'function') {
		                args.pop();
		            } else {
		                cb = noop;
		            }

		            reduce(fns, args, function (newargs, fn, cb) {
		                fn.apply(that, newargs.concat([rest(function (err, nextargs) {
		                    cb(err, nextargs);
		                })]));
		            }, function (err, results) {
		                cb.apply(that, [err].concat(results));
		            });
		        });
		    }

		    var reverse = Array.prototype.reverse;

		    /**
		     * Creates a function which is a composition of the passed asynchronous
		     * functions. Each function consumes the return value of the function that
		     * follows. Composing functions `f()`, `g()`, and `h()` would produce the result
		     * of `f(g(h()))`, only this version uses callbacks to obtain the return values.
		     *
		     * Each function is executed with the `this` binding of the composed function.
		     *
		     * @name compose
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {...Function} functions - the asynchronous functions to compose
		     * @example
		     *
		     * function add1(n, callback) {
		     *     setTimeout(function () {
		     *         callback(null, n + 1);
		     *     }, 10);
		     * }
		     *
		     * function mul3(n, callback) {
		     *     setTimeout(function () {
		     *         callback(null, n * 3);
		     *     }, 10);
		     * }
		     *
		     * var add1mul3 = async.compose(mul3, add1);
		     * add1mul3(4, function (err, result) {
		     *     // result now equals 15
		     * });
		     */
		    function compose() /* functions... */{
		      return seq.apply(null, reverse.call(arguments));
		    }

		    function concat$1(eachfn, arr, fn, callback) {
		        var result = [];
		        eachfn(arr, function (x, index, cb) {
		            fn(x, function (err, y) {
		                result = result.concat(y || []);
		                cb(err);
		            });
		        }, function (err) {
		            callback(err, result);
		        });
		    }

		    /**
		     * Like `each`, except that it passes the key (or index) as the second argument
		     * to the iteratee.
		     *
		     * @name eachOf
		     * @static
		     * @memberOf async
		     * @alias forEachOf
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each
		     * item in `coll`. The `key` is the item's key, or index in the case of an
		     * array. The iteratee is passed a `callback(err)` which must be called once it
		     * has completed. If no error has occurred, the callback should be run without
		     * arguments or with an explicit `null` argument. Invoked with
		     * (item, key, callback).
		     * @param {Function} [callback] - A callback which is called when all
		     * `iteratee` functions have finished, or an error occurs. Invoked with (err).
		     * @example
		     *
		     * var obj = {dev: "/dev.json", test: "/test.json", prod: "/prod.json"};
		     * var configs = {};
		     *
		     * async.forEachOf(obj, function (value, key, callback) {
		     *     fs.readFile(__dirname + value, "utf8", function (err, data) {
		     *         if (err) return callback(err);
		     *         try {
		     *             configs[key] = JSON.parse(data);
		     *         } catch (e) {
		     *             return callback(e);
		     *         }
		     *         callback();
		     *     });
		     * }, function (err) {
		     *     if (err) console.error(err.message);
		     *     // configs is now a map of JSON data
		     *     doSomethingWith(configs);
		     * });
		     */
		    var eachOf = doLimit(eachOfLimit, Infinity);

		    function doParallel(fn) {
		        return function (obj, iteratee, callback) {
		            return fn(eachOf, obj, iteratee, callback);
		        };
		    }

		    /**
		     * Applies `iteratee` to each item in `coll`, concatenating the results. Returns
		     * the concatenated list. The `iteratee`s are called in parallel, and the
		     * results are concatenated as they return. There is no guarantee that the
		     * results array will be returned in the original order of `coll` passed to the
		     * `iteratee` function.
		     *
		     * @name concat
		     * @static
		     * @memberOf async
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, results)` which must be called once
		     * it has completed with an error (which can be `null`) and an array of results.
		     * Invoked with (item, callback).
		     * @param {Function} [callback(err)] - A callback which is called after all the
		     * `iteratee` functions have finished, or an error occurs. Results is an array
		     * containing the concatenated results of the `iteratee` function. Invoked with
		     * (err, results).
		     * @example
		     *
		     * async.concat(['dir1','dir2','dir3'], fs.readdir, function(err, files) {
		     *     // files is now a list of filenames that exist in the 3 directories
		     * });
		     */
		    var concat = doParallel(concat$1);

		    function doSeries(fn) {
		        return function (obj, iteratee, callback) {
		            return fn(eachOfSeries, obj, iteratee, callback);
		        };
		    }

		    /**
		     * The same as `concat` but runs only a single async operation at a time.
		     *
		     * @name concatSeries
		     * @static
		     * @memberOf async
		     * @see async.concat
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, results)` which must be called once
		     * it has completed with an error (which can be `null`) and an array of results.
		     * Invoked with (item, callback).
		     * @param {Function} [callback(err)] - A callback which is called after all the
		     * `iteratee` functions have finished, or an error occurs. Results is an array
		     * containing the concatenated results of the `iteratee` function. Invoked with
		     * (err, results).
		     */
		    var concatSeries = doSeries(concat$1);

		    /**
		     * Returns a function that when called, calls-back with the values provided.
		     * Useful as the first function in a `waterfall`, or for plugging values in to
		     * `auto`.
		     *
		     * @name constant
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {...*} arguments... - Any number of arguments to automatically invoke
		     * callback with.
		     * @returns {Function} Returns a function that when invoked, automatically
		     * invokes the callback with the previous given arguments.
		     * @example
		     *
		     * async.waterfall([
		     *     async.constant(42),
		     *     function (value, next) {
		     *         // value === 42
		     *     },
		     *     //...
		     * ], callback);
		     *
		     * async.waterfall([
		     *     async.constant(filename, "utf8"),
		     *     fs.readFile,
		     *     function (fileData, next) {
		     *         //...
		     *     }
		     *     //...
		     * ], callback);
		     *
		     * async.auto({
		     *     hostname: async.constant("https://server.net/"),
		     *     port: findFreePort,
		     *     launchServer: ["hostname", "port", function (options, cb) {
		     *         startServer(options, cb);
		     *     }],
		     *     //...
		     * }, callback);
		     */
		    var constant = rest(function (values) {
		        var args = [null].concat(values);
		        return initialParams(function (ignoredArgs, callback) {
		            return callback.apply(this, args);
		        });
		    });

		    function _createTester(eachfn, check, getResult) {
		        return function (arr, limit, iteratee, cb) {
		            function done(err) {
		                if (cb) {
		                    if (err) {
		                        cb(err);
		                    } else {
		                        cb(null, getResult(false));
		                    }
		                }
		            }
		            function wrappedIteratee(x, _, callback) {
		                if (!cb) return callback();
		                iteratee(x, function (err, v) {
		                    if (cb) {
		                        if (err) {
		                            cb(err);
		                            cb = iteratee = false;
		                        } else if (check(v)) {
		                            cb(null, getResult(true, x));
		                            cb = iteratee = false;
		                        }
		                    }
		                    callback();
		                });
		            }
		            if (arguments.length > 3) {
		                cb = cb || noop;
		                eachfn(arr, limit, wrappedIteratee, done);
		            } else {
		                cb = iteratee;
		                cb = cb || noop;
		                iteratee = limit;
		                eachfn(arr, wrappedIteratee, done);
		            }
		        };
		    }

		    function _findGetResult(v, x) {
		        return x;
		    }

		    /**
		     * Returns the first value in `coll` that passes an async truth test. The
		     * `iteratee` is applied in parallel, meaning the first iteratee to return
		     * `true` will fire the detect `callback` with that result. That means the
		     * result might not be the first item in the original `coll` (in terms of order)
		     * that passes the test.

		     * If order within the original `coll` is important, then look at
		     * `detectSeries`.
		     *
		     * @name detect
		     * @static
		     * @memberOf async
		     * @alias find
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, truthValue)` which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called as soon as any
		     * iteratee returns `true`, or after all the `iteratee` functions have finished.
		     * Result will be the first item in the array that passes the truth test
		     * (iteratee) or the value `undefined` if none passed. Invoked with
		     * (err, result).
		     * @example
		     *
		     * async.detect(['file1','file2','file3'], function(filePath, callback) {
		     *     fs.access(filePath, function(err) {
		     *         callback(null, !err)
		     *     });
		     * }, function(err, result) {
		     *     // result now equals the first file in the list that exists
		     * });
		     */
		    var detect = _createTester(eachOf, identity, _findGetResult);

		    /**
		     * The same as `detect` but runs a maximum of `limit` async operations at a
		     * time.
		     *
		     * @name detectLimit
		     * @static
		     * @memberOf async
		     * @see async.detect
		     * @alias findLimit
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, truthValue)` which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called as soon as any
		     * iteratee returns `true`, or after all the `iteratee` functions have finished.
		     * Result will be the first item in the array that passes the truth test
		     * (iteratee) or the value `undefined` if none passed. Invoked with
		     * (err, result).
		     */
		    var detectLimit = _createTester(eachOfLimit, identity, _findGetResult);

		    /**
		     * The same as `detect` but runs only a single async operation at a time.
		     *
		     * @name detectSeries
		     * @static
		     * @memberOf async
		     * @see async.detect
		     * @alias findSeries
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, truthValue)` which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called as soon as any
		     * iteratee returns `true`, or after all the `iteratee` functions have finished.
		     * Result will be the first item in the array that passes the truth test
		     * (iteratee) or the value `undefined` if none passed. Invoked with
		     * (err, result).
		     */
		    var detectSeries = _createTester(eachOfSeries, identity, _findGetResult);

		    function consoleFunc(name) {
		        return rest(function (fn, args) {
		            fn.apply(null, args.concat([rest(function (err, args) {
		                if (typeof console === 'object') {
		                    if (err) {
		                        if (console.error) {
		                            console.error(err);
		                        }
		                    } else if (console[name]) {
		                        arrayEach(args, function (x) {
		                            console[name](x);
		                        });
		                    }
		                }
		            })]));
		        });
		    }

		    /**
		     * Logs the result of an `async` function to the `console` using `console.dir`
		     * to display the properties of the resulting object. Only works in Node.js or
		     * in browsers that support `console.dir` and `console.error` (such as FF and
		     * Chrome). If multiple arguments are returned from the async function,
		     * `console.dir` is called on each argument in order.
		     *
		     * @name log
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} function - The function you want to eventually apply all
		     * arguments to.
		     * @param {...*} arguments... - Any number of arguments to apply to the function.
		     * @example
		     *
		     * // in a module
		     * var hello = function(name, callback) {
		     *     setTimeout(function() {
		     *         callback(null, {hello: name});
		     *     }, 1000);
		     * };
		     *
		     * // in the node repl
		     * node> async.dir(hello, 'world');
		     * {hello: 'world'}
		     */
		    var dir = consoleFunc('dir');

		    /**
		     * Like {@link async.whilst}, except the `test` is an asynchronous function that
		     * is passed a callback in the form of `function (err, truth)`. If error is
		     * passed to `test` or `fn`, the main callback is immediately called with the
		     * value of the error.
		     *
		     * @name during
		     * @static
		     * @memberOf async
		     * @see async.whilst
		     * @category Control Flow
		     * @param {Function} test - asynchronous truth test to perform before each
		     * execution of `fn`. Invoked with (callback).
		     * @param {Function} fn - A function which is called each time `test` passes.
		     * The function is passed a `callback(err)`, which must be called once it has
		     * completed with an optional `err` argument. Invoked with (callback).
		     * @param {Function} [callback] - A callback which is called after the test
		     * function has failed and repeated execution of `fn` has stopped. `callback`
		     * will be passed an error and any arguments passed to the final `fn`'s
		     * callback. Invoked with (err, [results]);
		     * @example
		     *
		     * var count = 0;
		     *
		     * async.during(
		     *     function (callback) {
		     *         return callback(null, count < 5);
		     *     },
		     *     function (callback) {
		     *         count++;
		     *         setTimeout(callback, 1000);
		     *     },
		     *     function (err) {
		     *         // 5 seconds have passed
		     *     }
		     * );
		     */
		    function during(test, iteratee, cb) {
		        cb = cb || noop;

		        var next = rest(function (err, args) {
		            if (err) {
		                cb(err);
		            } else {
		                args.push(check);
		                test.apply(this, args);
		            }
		        });

		        var check = function (err, truth) {
		            if (err) return cb(err);
		            if (!truth) return cb(null);
		            iteratee(next);
		        };

		        test(check);
		    }

		    /**
		     * The post-check version of {@link async.during}. To reflect the difference in
		     * the order of operations, the arguments `test` and `fn` are switched.
		     *
		     * Also a version of {@link async.doWhilst} with asynchronous `test` function.
		     * @name doDuring
		     * @static
		     * @memberOf async
		     * @see async.during
		     * @category Control Flow
		     * @param {Function} fn - A function which is called each time `test` passes.
		     * The function is passed a `callback(err)`, which must be called once it has
		     * completed with an optional `err` argument. Invoked with (callback).
		     * @param {Function} test - asynchronous truth test to perform before each
		     * execution of `fn`. Invoked with (callback).
		     * @param {Function} [callback] - A callback which is called after the test
		     * function has failed and repeated execution of `fn` has stopped. `callback`
		     * will be passed an error and any arguments passed to the final `fn`'s
		     * callback. Invoked with (err, [results]);
		     */
		    function doDuring(iteratee, test, cb) {
		        var calls = 0;

		        during(function (next) {
		            if (calls++ < 1) return next(null, true);
		            test.apply(this, arguments);
		        }, iteratee, cb);
		    }

		    /**
		     * Repeatedly call `fn`, while `test` returns `true`. Calls `callback` when
		     * stopped, or an error occurs.
		     *
		     * @name whilst
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Function} test - synchronous truth test to perform before each
		     * execution of `fn`. Invoked with ().
		     * @param {Function} fn - A function which is called each time `test` passes.
		     * The function is passed a `callback(err)`, which must be called once it has
		     * completed with an optional `err` argument. Invoked with (callback).
		     * @param {Function} [callback] - A callback which is called after the test
		     * function has failed and repeated execution of `fn` has stopped. `callback`
		     * will be passed an error and any arguments passed to the final `fn`'s
		     * callback. Invoked with (err, [results]);
		     * @example
		     *
		     * var count = 0;
		     * async.whilst(
		     *     function() { return count < 5; },
		     *     function(callback) {
		     *         count++;
		     *         setTimeout(function() {
		     *             callback(null, count);
		     *         }, 1000);
		     *     },
		     *     function (err, n) {
		     *         // 5 seconds have passed, n = 5
		     *     }
		     * );
		     */
		    function whilst(test, iteratee, cb) {
		        cb = cb || noop;
		        if (!test()) return cb(null);
		        var next = rest(function (err, args) {
		            if (err) return cb(err);
		            if (test.apply(this, args)) return iteratee(next);
		            cb.apply(null, [null].concat(args));
		        });
		        iteratee(next);
		    }

		    /**
		     * The post-check version of {@link async.whilst}. To reflect the difference in
		     * the order of operations, the arguments `test` and `fn` are switched.
		     *
		     * `doWhilst` is to `whilst` as `do while` is to `while` in plain JavaScript.
		     *
		     * @name doWhilst
		     * @static
		     * @memberOf async
		     * @see async.whilst
		     * @category Control Flow
		     * @param {Function} fn - A function which is called each time `test` passes.
		     * The function is passed a `callback(err)`, which must be called once it has
		     * completed with an optional `err` argument. Invoked with (callback).
		     * @param {Function} test - synchronous truth test to perform before each
		     * execution of `fn`. Invoked with ().
		     * @param {Function} [callback] - A callback which is called after the test
		     * function has failed and repeated execution of `fn` has stopped. `callback`
		     * will be passed an error and any arguments passed to the final `fn`'s
		     * callback. Invoked with (err, [results]);
		     */
		    function doWhilst(iteratee, test, cb) {
		        var calls = 0;
		        return whilst(function () {
		            return ++calls <= 1 || test.apply(this, arguments);
		        }, iteratee, cb);
		    }

		    /**
		     * Like {@link async.doWhilst}, except the `test` is inverted. Note the
		     * argument ordering differs from `until`.
		     *
		     * @name doUntil
		     * @static
		     * @memberOf async
		     * @see async.doWhilst
		     * @category Control Flow
		     * @param {Function} fn - A function which is called each time `test` fails.
		     * The function is passed a `callback(err)`, which must be called once it has
		     * completed with an optional `err` argument. Invoked with (callback).
		     * @param {Function} test - synchronous truth test to perform before each
		     * execution of `fn`. Invoked with ().
		     * @param {Function} [callback] - A callback which is called after the test
		     * function has passed and repeated execution of `fn` has stopped. `callback`
		     * will be passed an error and any arguments passed to the final `fn`'s
		     * callback. Invoked with (err, [results]);
		     */
		    function doUntil(iteratee, test, cb) {
		        return doWhilst(iteratee, function () {
		            return !test.apply(this, arguments);
		        }, cb);
		    }

		    function _withoutIndex(iteratee) {
		        return function (value, index, callback) {
		            return iteratee(value, callback);
		        };
		    }

		    /**
		     * The same as `each` but runs a maximum of `limit` async operations at a time.
		     *
		     * @name eachLimit
		     * @static
		     * @memberOf async
		     * @see async.each
		     * @alias forEachLimit
		     * @category Collection
		     * @param {Array|Object} coll - A colleciton to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A function to apply to each item in `coll`. The
		     * iteratee is passed a `callback(err)` which must be called once it has
		     * completed. If no error has occurred, the `callback` should be run without
		     * arguments or with an explicit `null` argument. The array index is not passed
		     * to the iteratee. Invoked with (item, callback). If you need the index, use
		     * `eachOfLimit`.
		     * @param {Function} [callback] - A callback which is called when all
		     * `iteratee` functions have finished, or an error occurs. Invoked with (err).
		     */
		    function eachLimit(arr, limit, iteratee, cb) {
		      return _eachOfLimit(limit)(arr, _withoutIndex(iteratee), cb);
		    }

		    /**
		     * Applies the function `iteratee` to each item in `coll`, in parallel.
		     * The `iteratee` is called with an item from the list, and a callback for when
		     * it has finished. If the `iteratee` passes an error to its `callback`, the
		     * main `callback` (for the `each` function) is immediately called with the
		     * error.
		     *
		     * Note, that since this function applies `iteratee` to each item in parallel,
		     * there is no guarantee that the iteratee functions will complete in order.
		     *
		     * @name each
		     * @static
		     * @memberOf async
		     * @alias forEach
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item
		     * in `coll`. The iteratee is passed a `callback(err)` which must be called once
		     * it has completed. If no error has occurred, the `callback` should be run
		     * without arguments or with an explicit `null` argument. The array index is not
		     * passed to the iteratee. Invoked with (item, callback). If you need the index,
		     * use `eachOf`.
		     * @param {Function} [callback] - A callback which is called when all
		     * `iteratee` functions have finished, or an error occurs. Invoked with (err).
		     * @example
		     *
		     * // assuming openFiles is an array of file names and saveFile is a function
		     * // to save the modified contents of that file:
		     *
		     * async.each(openFiles, saveFile, function(err){
		     *   // if any of the saves produced an error, err would equal that error
		     * });
		     *
		     * // assuming openFiles is an array of file names
		     * async.each(openFiles, function(file, callback) {
		     *
		     *     // Perform operation on file here.
		     *     console.log('Processing file ' + file);
		     *
		     *     if( file.length > 32 ) {
		     *       console.log('This file name is too long');
		     *       callback('File name too long');
		     *     } else {
		     *       // Do work to process file here
		     *       console.log('File processed');
		     *       callback();
		     *     }
		     * }, function(err) {
		     *     // if any of the file processing produced an error, err would equal that error
		     *     if( err ) {
		     *       // One of the iterations produced an error.
		     *       // All processing will now stop.
		     *       console.log('A file failed to process');
		     *     } else {
		     *       console.log('All files have been processed successfully');
		     *     }
		     * });
		     */
		    var each = doLimit(eachLimit, Infinity);

		    /**
		     * The same as `each` but runs only a single async operation at a time.
		     *
		     * @name eachSeries
		     * @static
		     * @memberOf async
		     * @see async.each
		     * @alias forEachSeries
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each
		     * item in `coll`. The iteratee is passed a `callback(err)` which must be called
		     * once it has completed. If no error has occurred, the `callback` should be run
		     * without arguments or with an explicit `null` argument. The array index is
		     * not passed to the iteratee. Invoked with (item, callback). If you need the
		     * index, use `eachOfSeries`.
		     * @param {Function} [callback] - A callback which is called when all
		     * `iteratee` functions have finished, or an error occurs. Invoked with (err).
		     */
		    var eachSeries = doLimit(eachLimit, 1);

		    /**
		     * Wrap an async function and ensure it calls its callback on a later tick of
		     * the event loop.  If the function already calls its callback on a next tick,
		     * no extra deferral is added. This is useful for preventing stack overflows
		     * (`RangeError: Maximum call stack size exceeded`) and generally keeping
		     * [Zalgo](http://blog.izs.me/post/59142742143/designing-apis-for-asynchrony)
		     * contained.
		     *
		     * @name ensureAsync
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} fn - an async function, one that expects a node-style
		     * callback as its last argument.
		     * @returns {Function} Returns a wrapped function with the exact same call
		     * signature as the function passed in.
		     * @example
		     *
		     * function sometimesAsync(arg, callback) {
		     *     if (cache[arg]) {
		     *         return callback(null, cache[arg]); // this would be synchronous!!
		     *     } else {
		     *         doSomeIO(arg, callback); // this IO would be asynchronous
		     *     }
		     * }
		     *
		     * // this has a risk of stack overflows if many results are cached in a row
		     * async.mapSeries(args, sometimesAsync, done);
		     *
		     * // this will defer sometimesAsync's callback if necessary,
		     * // preventing stack overflows
		     * async.mapSeries(args, async.ensureAsync(sometimesAsync), done);
		     */
		    function ensureAsync(fn) {
		        return initialParams(function (args, callback) {
		            var sync = true;
		            args.push(function () {
		                var innerArgs = arguments;
		                if (sync) {
		                    setImmediate$1(function () {
		                        callback.apply(null, innerArgs);
		                    });
		                } else {
		                    callback.apply(null, innerArgs);
		                }
		            });
		            fn.apply(this, args);
		            sync = false;
		        });
		    }

		    function notId(v) {
		        return !v;
		    }

		    /**
		     * The same as `every` but runs a maximum of `limit` async operations at a time.
		     *
		     * @name everyLimit
		     * @static
		     * @memberOf async
		     * @see async.every
		     * @alias allLimit
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A truth test to apply to each item in the
		     * collection in parallel. The iteratee is passed a `callback(err, truthValue)`
		     * which must be called with a  boolean argument once it has completed. Invoked
		     * with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Result will be either `true` or `false`
		     * depending on the values of the async tests. Invoked with (err, result).
		     */
		    var everyLimit = _createTester(eachOfLimit, notId, notId);

		    /**
		     * Returns `true` if every element in `coll` satisfies an async test. If any
		     * iteratee call returns `false`, the main `callback` is immediately called.
		     *
		     * @name every
		     * @static
		     * @memberOf async
		     * @alias all
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in the
		     * collection in parallel. The iteratee is passed a `callback(err, truthValue)`
		     * which must be called with a  boolean argument once it has completed. Invoked
		     * with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Result will be either `true` or `false`
		     * depending on the values of the async tests. Invoked with (err, result).
		     * @example
		     *
		     * async.every(['file1','file2','file3'], function(filePath, callback) {
		     *     fs.access(filePath, function(err) {
		     *         callback(null, !err)
		     *     });
		     * }, function(err, result) {
		     *     // if result is true then every file exists
		     * });
		     */
		    var every = doLimit(everyLimit, Infinity);

		    /**
		     * The same as `every` but runs only a single async operation at a time.
		     *
		     * @name everySeries
		     * @static
		     * @memberOf async
		     * @see async.every
		     * @alias allSeries
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in the
		     * collection in parallel. The iteratee is passed a `callback(err, truthValue)`
		     * which must be called with a  boolean argument once it has completed. Invoked
		     * with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Result will be either `true` or `false`
		     * depending on the values of the async tests. Invoked with (err, result).
		     */
		    var everySeries = doLimit(everyLimit, 1);

		    function _filter(eachfn, arr, iteratee, callback) {
		        var results = [];
		        eachfn(arr, function (x, index, callback) {
		            iteratee(x, function (err, v) {
		                if (err) {
		                    callback(err);
		                } else {
		                    if (v) {
		                        results.push({ index: index, value: x });
		                    }
		                    callback();
		                }
		            });
		        }, function (err) {
		            if (err) {
		                callback(err);
		            } else {
		                callback(null, arrayMap(results.sort(function (a, b) {
		                    return a.index - b.index;
		                }), baseProperty('value')));
		            }
		        });
		    }

		    /**
		     * The same as `filter` but runs a maximum of `limit` async operations at a
		     * time.
		     *
		     * @name filterLimit
		     * @static
		     * @memberOf async
		     * @see async.filter
		     * @alias selectLimit
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Invoked with (err, results).
		     */
		    var filterLimit = doParallelLimit(_filter);

		    /**
		     * Returns a new array of all the values in `coll` which pass an async truth
		     * test. This operation is performed in parallel, but the results array will be
		     * in the same order as the original.
		     *
		     * @name filter
		     * @static
		     * @memberOf async
		     * @alias select
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Invoked with (err, results).
		     * @example
		     *
		     * async.filter(['file1','file2','file3'], function(filePath, callback) {
		     *     fs.access(filePath, function(err) {
		     *         callback(null, !err)
		     *     });
		     * }, function(err, results) {
		     *     // results now equals an array of the existing files
		     * });
		     */
		    var filter = doLimit(filterLimit, Infinity);

		    /**
		     * The same as `filter` but runs only a single async operation at a time.
		     *
		     * @name filterSeries
		     * @static
		     * @memberOf async
		     * @see async.filter
		     * @alias selectSeries
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Invoked with (err, results)
		     */
		    var filterSeries = doLimit(filterLimit, 1);

		    /**
		     * Calls the asynchronous function `fn` with a callback parameter that allows it
		     * to call itself again, in series, indefinitely.

		     * If an error is passed to the
		     * callback then `errback` is called with the error, and execution stops,
		     * otherwise it will never be called.
		     *
		     * @name forever
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Function} fn - a function to call repeatedly. Invoked with (next).
		     * @param {Function} [errback] - when `fn` passes an error to it's callback,
		     * this function will be called, and execution stops. Invoked with (err).
		     * @example
		     *
		     * async.forever(
		     *     function(next) {
		     *         // next is suitable for passing to things that need a callback(err [, whatever]);
		     *         // it will result in this function being called again.
		     *     },
		     *     function(err) {
		     *         // if next is called with a value in its first parameter, it will appear
		     *         // in here as 'err', and execution will stop.
		     *     }
		     * );
		     */
		    function forever(fn, cb) {
		        var done = onlyOnce(cb || noop);
		        var task = ensureAsync(fn);

		        function next(err) {
		            if (err) return done(err);
		            task(next);
		        }
		        next();
		    }

		    /**
		     * Creates an iterator function which calls the next function in the `tasks`
		     * array, returning a continuation to call the next one after that. It's also
		     * possible to “peek” at the next iterator with `iterator.next()`.
		     *
		     * This function is used internally by the `async` module, but can be useful
		     * when you want to manually control the flow of functions in series.
		     *
		     * @name iterator
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Array} tasks - An array of functions to run.
		     * @returns The next function to run in the series.
		     * @example
		     *
		     * var iterator = async.iterator([
		     *     function() { sys.p('one'); },
		     *     function() { sys.p('two'); },
		     *     function() { sys.p('three'); }
		     * ]);
		     *
		     * node> var iterator2 = iterator();
		     * 'one'
		     * node> var iterator3 = iterator2();
		     * 'two'
		     * node> iterator3();
		     * 'three'
		     * node> var nextfn = iterator2.next();
		     * node> nextfn();
		     * 'three'
		     */

		    function iterator$1 (tasks) {
		        function makeCallback(index) {
		            function fn() {
		                if (tasks.length) {
		                    tasks[index].apply(null, arguments);
		                }
		                return fn.next();
		            }
		            fn.next = function () {
		                return index < tasks.length - 1 ? makeCallback(index + 1) : null;
		            };
		            return fn;
		        }
		        return makeCallback(0);
		    }

		    /**
		     * Logs the result of an `async` function to the `console`. Only works in
		     * Node.js or in browsers that support `console.log` and `console.error` (such
		     * as FF and Chrome). If multiple arguments are returned from the async
		     * function, `console.log` is called on each argument in order.
		     *
		     * @name log
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} function - The function you want to eventually apply all
		     * arguments to.
		     * @param {...*} arguments... - Any number of arguments to apply to the function.
		     * @example
		     *
		     * // in a module
		     * var hello = function(name, callback) {
		     *     setTimeout(function() {
		     *         callback(null, 'hello ' + name);
		     *     }, 1000);
		     * };
		     *
		     * // in the node repl
		     * node> async.log(hello, 'world');
		     * 'hello world'
		     */
		    var log = consoleFunc('log');

		    function has(obj, key) {
		        return key in obj;
		    }

		    /**
		     * Caches the results of an `async` function. When creating a hash to store
		     * function results against, the callback is omitted from the hash and an
		     * optional hash function can be used.
		     *
		     * If no hash function is specified, the first argument is used as a hash key,
		     * which may work reasonably if it is a string or a data type that converts to a
		     * distinct string. Note that objects and arrays will not behave reasonably.
		     * Neither will cases where the other arguments are significant. In such cases,
		     * specify your own hash function.
		     *
		     * The cache of results is exposed as the `memo` property of the function
		     * returned by `memoize`.
		     *
		     * @name memoize
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} fn - The function to proxy and cache results from.
		     * @param {Function} hasher - An optional function for generating a custom hash
		     * for storing results. It has all the arguments applied to it apart from the
		     * callback, and must be synchronous.
		     * @example
		     *
		     * var slow_fn = function(name, callback) {
		     *     // do something
		     *     callback(null, result);
		     * };
		     * var fn = async.memoize(slow_fn);
		     *
		     * // fn can now be used as if it were slow_fn
		     * fn('some name', function() {
		     *     // callback
		     * });
		     */
		    function memoize$1(fn, hasher) {
		        var memo = Object.create(null);
		        var queues = Object.create(null);
		        hasher = hasher || identity;
		        var memoized = initialParams(function memoized(args, callback) {
		            var key = hasher.apply(null, args);
		            if (has(memo, key)) {
		                setImmediate$1(function () {
		                    callback.apply(null, memo[key]);
		                });
		            } else if (has(queues, key)) {
		                queues[key].push(callback);
		            } else {
		                queues[key] = [callback];
		                fn.apply(null, args.concat([rest(function (args) {
		                    memo[key] = args;
		                    var q = queues[key];
		                    delete queues[key];
		                    for (var i = 0, l = q.length; i < l; i++) {
		                        q[i].apply(null, args);
		                    }
		                })]));
		            }
		        });
		        memoized.memo = memo;
		        memoized.unmemoized = fn;
		        return memoized;
		    }

		    function _parallel(eachfn, tasks, callback) {
		        callback = callback || noop;
		        var results = isArrayLike(tasks) ? [] : {};

		        eachfn(tasks, function (task, key, callback) {
		            task(rest(function (err, args) {
		                if (args.length <= 1) {
		                    args = args[0];
		                }
		                results[key] = args;
		                callback(err);
		            }));
		        }, function (err) {
		            callback(err, results);
		        });
		    }

		    /**
		     * The same as `parallel` but runs a maximum of `limit` async operations at a
		     * time.
		     *
		     * @name parallel
		     * @static
		     * @memberOf async
		     * @see async.parallel
		     * @category Control Flow
		     * @param {Array|Collection} tasks - A collection containing functions to run.
		     * Each function is passed a `callback(err, result)` which it must call on
		     * completion with an error `err` (which can be `null`) and an optional `result`
		     * value.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} [callback] - An optional callback to run once all the
		     * functions have completed successfully. This function gets a results array
		     * (or object) containing all the result arguments passed to the task callbacks.
		     * Invoked with (err, results).
		     */
		    function parallelLimit(tasks, limit, cb) {
		      return _parallel(_eachOfLimit(limit), tasks, cb);
		    }

		    /**
		     * Run the `tasks` collection of functions in parallel, without waiting until
		     * the previous function has completed. If any of the functions pass an error to
		     * its callback, the main `callback` is immediately called with the value of the
		     * error. Once the `tasks` have completed, the results are passed to the final
		     * `callback` as an array.
		     *
		     * **Note:** `parallel` is about kicking-off I/O tasks in parallel, not about
		     * parallel execution of code.  If your tasks do not use any timers or perform
		     * any I/O, they will actually be executed in series.  Any synchronous setup
		     * sections for each task will happen one after the other.  JavaScript remains
		     * single-threaded.
		     *
		     * It is also possible to use an object instead of an array. Each property will
		     * be run as a function and the results will be passed to the final `callback`
		     * as an object instead of an array. This can be a more readable way of handling
		     * results from {@link async.parallel}.
		     *
		     * @name parallel
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Array|Object} tasks - A collection containing functions to run.
		     * Each function is passed a `callback(err, result)` which it must call on
		     * completion with an error `err` (which can be `null`) and an optional `result`
		     * value.
		     * @param {Function} [callback] - An optional callback to run once all the
		     * functions have completed successfully. This function gets a results array
		     * (or object) containing all the result arguments passed to the task callbacks.
		     * Invoked with (err, results).
		     * @example
		     * async.parallel([
		     *     function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 'one');
		     *         }, 200);
		     *     },
		     *     function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 'two');
		     *         }, 100);
		     *     }
		     * ],
		     * // optional callback
		     * function(err, results) {
		     *     // the results array will equal ['one','two'] even though
		     *     // the second function had a shorter timeout.
		     * });
		     *
		     * // an example using an object instead of an array
		     * async.parallel({
		     *     one: function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 1);
		     *         }, 200);
		     *     },
		     *     two: function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 2);
		     *         }, 100);
		     *     }
		     * }, function(err, results) {
		     *     // results is now equals to: {one: 1, two: 2}
		     * });
		     */
		    var parallel = doLimit(parallelLimit, Infinity);

		    /**
		     * A queue of tasks for the worker function to complete.
		     * @typedef {Object} queue
		     * @property {Function} length - a function returning the number of items
		     * waiting to be processed. Invoke with ().
		     * @property {Function} started - a function returning whether or not any
		     * items have been pushed and processed by the queue. Invoke with ().
		     * @property {Function} running - a function returning the number of items
		     * currently being processed. Invoke with ().
		     * @property {Function} workersList - a function returning the array of items
		     * currently being processed. Invoke with ().
		     * @property {Function} idle - a function returning false if there are items
		     * waiting or being processed, or true if not. Invoke with ().
		     * @property {number} concurrency - an integer for determining how many `worker`
		     * functions should be run in parallel. This property can be changed after a
		     * `queue` is created to alter the concurrency on-the-fly.
		     * @property {Function} push - add a new task to the `queue`. Calls `callback`
		     * once the `worker` has finished processing the task. Instead of a single task,
		     * a `tasks` array can be submitted. The respective callback is used for every
		     * task in the list. Invoke with (task, [callback]),
		     * @property {Function} unshift - add a new task to the front of the `queue`.
		     * Invoke with (task, [callback]).
		     * @property {Function} saturated - a callback that is called when the number of
		     * running workers hits the `concurrency` limit, and further tasks will be
		     * queued.
		     * @property {Function} unsaturated - a callback that is called when the number
		     * of running workers is less than the `concurrency` & `buffer` limits, and
		     * further tasks will not be queued.
		     * @property {number} buffer - A minimum threshold buffer in order to say that
		     * the `queue` is `unsaturated`.
		     * @property {Function} empty - a callback that is called when the last item
		     * from the `queue` is given to a `worker`.
		     * @property {Function} drain - a callback that is called when the last item
		     * from the `queue` has returned from the `worker`.
		     * @property {boolean} paused - a boolean for determining whether the queue is
		     * in a paused state.
		     * @property {Function} pause - a function that pauses the processing of tasks
		     * until `resume()` is called. Invoke with ().
		     * @property {Function} resume - a function that resumes the processing of
		     * queued tasks when the queue is paused. Invoke with ().
		     * @property {Function} kill - a function that removes the `drain` callback and
		     * empties remaining tasks from the queue forcing it to go idle. Invoke with ().
		     */

		    /**
		     * Creates a `queue` object with the specified `concurrency`. Tasks added to the
		     * `queue` are processed in parallel (up to the `concurrency` limit). If all
		     * `worker`s are in progress, the task is queued until one becomes available.
		     * Once a `worker` completes a `task`, that `task`'s callback is called.
		     *
		     * @name queue
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Function} worker - An asynchronous function for processing a queued
		     * task, which must call its `callback(err)` argument when finished, with an
		     * optional `error` as an argument.  If you want to handle errors from an
		     * individual task, pass a callback to `q.push()`. Invoked with
		     * (task, callback).
		     * @param {number} [concurrency=1] - An `integer` for determining how many
		     * `worker` functions should be run in parallel.  If omitted, the concurrency
		     * defaults to `1`.  If the concurrency is `0`, an error is thrown.
		     * @returns {queue} A queue object to manage the tasks. Callbacks can
		     * attached as certain properties to listen for specific events during the
		     * lifecycle of the queue.
		     * @example
		     *
		     * // create a queue object with concurrency 2
		     * var q = async.queue(function(task, callback) {
		     *     console.log('hello ' + task.name);
		     *     callback();
		     * }, 2);
		     *
		     * // assign a callback
		     * q.drain = function() {
		     *     console.log('all items have been processed');
		     * };
		     *
		     * // add some items to the queue
		     * q.push({name: 'foo'}, function(err) {
		     *     console.log('finished processing foo');
		     * });
		     * q.push({name: 'bar'}, function (err) {
		     *     console.log('finished processing bar');
		     * });
		     *
		     * // add some items to the queue (batch-wise)
		     * q.push([{name: 'baz'},{name: 'bay'},{name: 'bax'}], function(err) {
		     *     console.log('finished processing item');
		     * });
		     *
		     * // add some items to the front of the queue
		     * q.unshift({name: 'bar'}, function (err) {
		     *     console.log('finished processing bar');
		     * });
		     */
		    function queue$1 (worker, concurrency) {
		      return queue(function (items, cb) {
		        worker(items[0], cb);
		      }, concurrency, 1);
		    }

		    /**
		     * The same as {@link async.queue} only tasks are assigned a priority and
		     * completed in ascending priority order.
		     *
		     * @name priorityQueue
		     * @static
		     * @memberOf async
		     * @see async.queue
		     * @category Control Flow
		     * @param {Function} worker - An asynchronous function for processing a queued
		     * task, which must call its `callback(err)` argument when finished, with an
		     * optional `error` as an argument.  If you want to handle errors from an
		     * individual task, pass a callback to `q.push()`. Invoked with
		     * (task, callback).
		     * @param {number} concurrency - An `integer` for determining how many `worker`
		     * functions should be run in parallel.  If omitted, the concurrency defaults to
		     * `1`.  If the concurrency is `0`, an error is thrown.
		     * @returns {queue} A priorityQueue object to manage the tasks. There are two
		     * differences between `queue` and `priorityQueue` objects:
		     * * `push(task, priority, [callback])` - `priority` should be a number. If an
		     *   array of `tasks` is given, all tasks will be assigned the same priority.
		     * * The `unshift` method was removed.
		     */
		    function priorityQueue (worker, concurrency) {
		        function _compareTasks(a, b) {
		            return a.priority - b.priority;
		        }

		        function _binarySearch(sequence, item, compare) {
		            var beg = -1,
		                end = sequence.length - 1;
		            while (beg < end) {
		                var mid = beg + (end - beg + 1 >>> 1);
		                if (compare(item, sequence[mid]) >= 0) {
		                    beg = mid;
		                } else {
		                    end = mid - 1;
		                }
		            }
		            return beg;
		        }

		        function _insert(q, data, priority, callback) {
		            if (callback != null && typeof callback !== 'function') {
		                throw new Error('task callback must be a function');
		            }
		            q.started = true;
		            if (!isArray(data)) {
		                data = [data];
		            }
		            if (data.length === 0) {
		                // call drain immediately if there are no tasks
		                return setImmediate$1(function () {
		                    q.drain();
		                });
		            }
		            arrayEach(data, function (task) {
		                var item = {
		                    data: task,
		                    priority: priority,
		                    callback: typeof callback === 'function' ? callback : noop
		                };

		                q.tasks.splice(_binarySearch(q.tasks, item, _compareTasks) + 1, 0, item);

		                setImmediate$1(q.process);
		            });
		        }

		        // Start with a normal queue
		        var q = queue$1(worker, concurrency);

		        // Override push to accept second parameter representing priority
		        q.push = function (data, priority, callback) {
		            _insert(q, data, priority, callback);
		        };

		        // Remove unshift function
		        delete q.unshift;

		        return q;
		    }

		    /**
		     * Creates a `baseEach` or `baseEachRight` function.
		     *
		     * @private
		     * @param {Function} eachFunc The function to iterate over a collection.
		     * @param {boolean} [fromRight] Specify iterating from right to left.
		     * @returns {Function} Returns the new base function.
		     */
		    function createBaseEach(eachFunc, fromRight) {
		      return function(collection, iteratee) {
		        if (collection == null) {
		          return collection;
		        }
		        if (!isArrayLike(collection)) {
		          return eachFunc(collection, iteratee);
		        }
		        var length = collection.length,
		            index = fromRight ? length : -1,
		            iterable = Object(collection);

		        while ((fromRight ? index-- : ++index < length)) {
		          if (iteratee(iterable[index], index, iterable) === false) {
		            break;
		          }
		        }
		        return collection;
		      };
		    }

		    /**
		     * The base implementation of `_.forEach` without support for iteratee shorthands.
		     *
		     * @private
		     * @param {Array|Object} collection The collection to iterate over.
		     * @param {Function} iteratee The function invoked per iteration.
		     * @returns {Array|Object} Returns `collection`.
		     */
		    var baseEach = createBaseEach(baseForOwn);

		    /**
		     * Iterates over elements of `collection` invoking `iteratee` for each element.
		     * The iteratee is invoked with three arguments: (value, index|key, collection).
		     * Iteratee functions may exit iteration early by explicitly returning `false`.
		     *
		     * **Note:** As with other "Collections" methods, objects with a "length"
		     * property are iterated like arrays. To avoid this behavior use `_.forIn`
		     * or `_.forOwn` for object iteration.
		     *
		     * @static
		     * @memberOf _
		     * @since 0.1.0
		     * @alias each
		     * @category Collection
		     * @param {Array|Object} collection The collection to iterate over.
		     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
		     * @returns {Array|Object} Returns `collection`.
		     * @example
		     *
		     * _([1, 2]).forEach(function(value) {
		     *   console.log(value);
		     * });
		     * // => Logs `1` then `2`.
		     *
		     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {
		     *   console.log(key);
		     * });
		     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
		     */
		    function forEach(collection, iteratee) {
		      return (typeof iteratee == 'function' && isArray(collection))
		        ? arrayEach(collection, iteratee)
		        : baseEach(collection, baseIteratee(iteratee));
		    }

		    /**
		     * Runs the `tasks` array of functions in parallel, without waiting until the
		     * previous function has completed. Once any the `tasks` completed or pass an
		     * error to its callback, the main `callback` is immediately called. It's
		     * equivalent to `Promise.race()`.
		     *
		     * @name race
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Array} tasks - An array containing functions to run. Each function
		     * is passed a `callback(err, result)` which it must call on completion with an
		     * error `err` (which can be `null`) and an optional `result` value.
		     * @param {Function} callback - A callback to run once any of the functions have
		     * completed. This function gets an error or result from the first function that
		     * completed. Invoked with (err, result).
		     * @example
		     *
		     * async.race([
		     *     function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 'one');
		     *         }, 200);
		     *     },
		     *     function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 'two');
		     *         }, 100);
		     *     }
		     * ],
		     * // main callback
		     * function(err, result) {
		     *     // the result will be equal to 'two' as it finishes earlier
		     * });
		     */
		    function race(tasks, cb) {
		        cb = once(cb || noop);
		        if (!isArray(tasks)) return cb(new TypeError('First argument to race must be an array of functions'));
		        if (!tasks.length) return cb();
		        forEach(tasks, function (task) {
		            task(cb);
		        });
		    }

		    var slice = Array.prototype.slice;

		    /**
		     * Same as `reduce`, only operates on `coll` in reverse order.
		     *
		     * @name reduceRight
		     * @static
		     * @memberOf async
		     * @see async.reduce
		     * @alias foldr
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {*} memo - The initial state of the reduction.
		     * @param {Function} iteratee - A function applied to each item in the
		     * array to produce the next step in the reduction. The `iteratee` is passed a
		     * `callback(err, reduction)` which accepts an optional error as its first
		     * argument, and the state of the reduction as the second. If an error is
		     * passed to the callback, the reduction is stopped and the main `callback` is
		     * immediately called with the error. Invoked with (memo, item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Result is the reduced value. Invoked with
		     * (err, result).
		     */
		    function reduceRight(arr, memo, iteratee, cb) {
		      var reversed = slice.call(arr).reverse();
		      reduce(reversed, memo, iteratee, cb);
		    }

		    /**
		     * Wraps the function in another function that always returns data even when it
		     * errors.
		     *
		     * The object returned has either the property `error` or `value`.
		     *
		     * @name reflect
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} function - The function you want to wrap
		     * @returns {Function} - A function that always passes null to it's callback as
		     * the error. The second argument to the callback will be an `object` with
		     * either an `error` or a `value` property.
		     * @example
		     *
		     * async.parallel([
		     *     async.reflect(function(callback) {
		     *         // do some stuff ...
		     *         callback(null, 'one');
		     *     }),
		     *     async.reflect(function(callback) {
		     *         // do some more stuff but error ...
		     *         callback('bad stuff happened');
		     *     }),
		     *     async.reflect(function(callback) {
		     *         // do some more stuff ...
		     *         callback(null, 'two');
		     *     })
		     * ],
		     * // optional callback
		     * function(err, results) {
		     *     // values
		     *     // results[0].value = 'one'
		     *     // results[1].error = 'bad stuff happened'
		     *     // results[2].value = 'two'
		     * });
		     */
		    function reflect(fn) {
		        return initialParams(function reflectOn(args, reflectCallback) {
		            args.push(rest(function callback(err, cbArgs) {
		                if (err) {
		                    reflectCallback(null, {
		                        error: err
		                    });
		                } else {
		                    var value = null;
		                    if (cbArgs.length === 1) {
		                        value = cbArgs[0];
		                    } else if (cbArgs.length > 1) {
		                        value = cbArgs;
		                    }
		                    reflectCallback(null, {
		                        value: value
		                    });
		                }
		            }));

		            return fn.apply(this, args);
		        });
		    }

		    function reject$1(eachfn, arr, iteratee, callback) {
		        _filter(eachfn, arr, function (value, cb) {
		            iteratee(value, function (err, v) {
		                if (err) {
		                    cb(err);
		                } else {
		                    cb(null, !v);
		                }
		            });
		        }, callback);
		    }

		    /**
		     * The same as `reject` but runs a maximum of `limit` async operations at a
		     * time.
		     *
		     * @name rejectLimit
		     * @static
		     * @memberOf async
		     * @see async.reject
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Invoked with (err, results).
		     */
		    var rejectLimit = doParallelLimit(reject$1);

		    /**
		     * The opposite of `filter`. Removes values that pass an `async` truth test.
		     *
		     * @name reject
		     * @static
		     * @memberOf async
		     * @see async.filter
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Invoked with (err, results).
		     * @example
		     *
		     * async.reject(['file1','file2','file3'], function(filePath, callback) {
		     *     fs.access(filePath, function(err) {
		     *         callback(null, !err)
		     *     });
		     * }, function(err, results) {
		     *     // results now equals an array of missing files
		     *     createFiles(results);
		     * });
		     */
		    var reject = doLimit(rejectLimit, Infinity);

		    /**
		     * A helper function that wraps an array of functions with reflect.
		     *
		     * @name reflectAll
		     * @static
		     * @memberOf async
		     * @see async.reflect
		     * @category Util
		     * @param {Array} tasks - The array of functions to wrap in `async.reflect`.
		     * @returns {Array} Returns an array of functions, each function wrapped in
		     * `async.reflect`
		     * @example
		     *
		     * let tasks = [
		     *     function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 'one');
		     *         }, 200);
		     *     },
		     *     function(callback) {
		     *         // do some more stuff but error ...
		     *         callback(new Error('bad stuff happened'));
		     *     },
		     *     function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 'two');
		     *         }, 100);
		     *     }
		     * ];
		     *
		     * async.parallel(async.reflectAll(tasks),
		     * // optional callback
		     * function(err, results) {
		     *     // values
		     *     // results[0].value = 'one'
		     *     // results[1].error = Error('bad stuff happened')
		     *     // results[2].value = 'two'
		     * });
		     */
		    function reflectAll(tasks) {
		      return tasks.map(reflect);
		    }

		    /**
		     * The same as `reject` but runs only a single async operation at a time.
		     *
		     * @name rejectSeries
		     * @static
		     * @memberOf async
		     * @see async.reject
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in `coll`.
		     * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
		     * with a boolean argument once it has completed. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Invoked with (err, results).
		     */
		    var rejectSeries = doLimit(rejectLimit, 1);

		    /**
		     * Run the functions in the `tasks` collection in series, each one running once
		     * the previous function has completed. If any functions in the series pass an
		     * error to its callback, no more functions are run, and `callback` is
		     * immediately called with the value of the error. Otherwise, `callback`
		     * receives an array of results when `tasks` have completed.
		     *
		     * It is also possible to use an object instead of an array. Each property will
		     * be run as a function, and the results will be passed to the final `callback`
		     * as an object instead of an array. This can be a more readable way of handling
		     *  results from {@link async.series}.
		     *
		     * **Note** that while many implementations preserve the order of object
		     * properties, the [ECMAScript Language Specification](http://www.ecma-international.org/ecma-262/5.1/#sec-8.6)
		     * explicitly states that
		     *
		     * > The mechanics and order of enumerating the properties is not specified.
		     *
		     * So if you rely on the order in which your series of functions are executed,
		     * and want this to work on all platforms, consider using an array.
		     *
		     * @name series
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Array|Object} tasks - A collection containing functions to run, each
		     * function is passed a `callback(err, result)` it must call on completion with
		     * an error `err` (which can be `null`) and an optional `result` value.
		     * @param {Function} [callback] - An optional callback to run once all the
		     * functions have completed. This function gets a results array (or object)
		     * containing all the result arguments passed to the `task` callbacks. Invoked
		     * with (err, result).
		     * @example
		     * async.series([
		     *     function(callback) {
		     *         // do some stuff ...
		     *         callback(null, 'one');
		     *     },
		     *     function(callback) {
		     *         // do some more stuff ...
		     *         callback(null, 'two');
		     *     }
		     * ],
		     * // optional callback
		     * function(err, results) {
		     *     // results is now equal to ['one', 'two']
		     * });
		     *
		     * async.series({
		     *     one: function(callback) {
		     *         setTimeout(function() {
		     *             callback(null, 1);
		     *         }, 200);
		     *     },
		     *     two: function(callback){
		     *         setTimeout(function() {
		     *             callback(null, 2);
		     *         }, 100);
		     *     }
		     * }, function(err, results) {
		     *     // results is now equal to: {one: 1, two: 2}
		     * });
		     */
		    function series(tasks, cb) {
		      return _parallel(eachOfSeries, tasks, cb);
		    }

		    /**
		     * Attempts to get a successful response from `task` no more than `times` times
		     * before returning an error. If the task is successful, the `callback` will be
		     * passed the result of the successful task. If all attempts fail, the callback
		     * will be passed the error and result (if any) of the final attempt.
		     *
		     * @name retry
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - Can be either an
		     * object with `times` and `interval` or a number.
		     * * `times` - The number of attempts to make before giving up.  The default
		     *   is `5`.
		     * * `interval` - The time to wait between retries, in milliseconds.  The
		     *   default is `0`.
		     * * If `opts` is a number, the number specifies the number of times to retry,
		     *   with the default interval of `0`.
		     * @param {Function} task - A function which receives two arguments: (1) a
		     * `callback(err, result)` which must be called when finished, passing `err`
		     * (which can be `null`) and the `result` of the function's execution, and (2)
		     * a `results` object, containing the results of the previously executed
		     * functions (if nested inside another control flow). Invoked with
		     * (callback, results).
		     * @param {Function} [callback] - An optional callback which is called when the
		     * task has succeeded, or after the final failed attempt. It receives the `err`
		     * and `result` arguments of the last attempt at completing the `task`. Invoked
		     * with (err, results).
		     * @example
		     *
		     * // The `retry` function can be used as a stand-alone control flow by passing
		     * // a callback, as shown below:
		     *
		     * // try calling apiMethod 3 times
		     * async.retry(3, apiMethod, function(err, result) {
		     *     // do something with the result
		     * });
		     *
		     * // try calling apiMethod 3 times, waiting 200 ms between each retry
		     * async.retry({times: 3, interval: 200}, apiMethod, function(err, result) {
		     *     // do something with the result
		     * });
		     *
		     *  // try calling apiMethod the default 5 times no delay between each retry
		     * async.retry(apiMethod, function(err, result) {
		     *     // do something with the result
		     * });
		     *
		     * // It can also be embedded within other control flow functions to retry
		     * // individual methods that are not as reliable, like this:
		     * async.auto({
		     *     users: api.getUsers.bind(api),
		     *     payments: async.retry(3, api.getPayments.bind(api))
		     * }, function(err, results) {
		     *     // do something with the results
		     * });
		     */
		    function retry(times, task, callback) {
		        var DEFAULT_TIMES = 5;
		        var DEFAULT_INTERVAL = 0;

		        var opts = {
		            times: DEFAULT_TIMES,
		            interval: DEFAULT_INTERVAL
		        };

		        function parseTimes(acc, t) {
		            if (typeof t === 'object') {
		                acc.times = +t.times || DEFAULT_TIMES;
		                acc.interval = +t.interval || DEFAULT_INTERVAL;
		            } else if (typeof t === 'number' || typeof t === 'string') {
		                acc.times = +t || DEFAULT_TIMES;
		            } else {
		                throw new Error("Invalid arguments for async.retry");
		            }
		        }

		        if (arguments.length < 3 && typeof times === 'function') {
		            callback = task || noop;
		            task = times;
		        } else {
		            parseTimes(opts, times);
		            callback = callback || noop;
		        }

		        if (typeof task !== 'function') {
		            throw new Error("Invalid arguments for async.retry");
		        }

		        var attempts = [];
		        while (opts.times) {
		            var isFinalAttempt = !(opts.times -= 1);
		            attempts.push(retryAttempt(isFinalAttempt));
		            if (!isFinalAttempt && opts.interval > 0) {
		                attempts.push(retryInterval(opts.interval));
		            }
		        }

		        series(attempts, function (done, data) {
		            data = data[data.length - 1];
		            callback(data.err, data.result);
		        });

		        function retryAttempt(isFinalAttempt) {
		            return function (seriesCallback) {
		                task(function (err, result) {
		                    seriesCallback(!err || isFinalAttempt, {
		                        err: err,
		                        result: result
		                    });
		                });
		            };
		        }

		        function retryInterval(interval) {
		            return function (seriesCallback) {
		                setTimeout(function () {
		                    seriesCallback(null);
		                }, interval);
		            };
		        }
		    }

		    /**
		     * A close relative of `retry`.  This method wraps a task and makes it
		     * retryable, rather than immediately calling it with retries.
		     *
		     * @name retryable
		     * @static
		     * @memberOf async
		     * @see async.retry
		     * @category Control Flow
		     * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - optional
		     * options, exactly the same as from `retry`
		     * @param {Function} task - the asynchronous function to wrap
		     * @returns {Functions} The wrapped function, which when invoked, will retry on
		     * an error, based on the parameters specified in `opts`.
		     * @example
		     *
		     * async.auto({
		     *     dep1: async.retryable(3, getFromFlakyService),
		     *     process: ["dep1", async.retryable(3, function (results, cb) {
		     *         maybeProcessData(results.dep1, cb);
		     *     })]
		     * }, callback);
		     */
		    function retryable (opts, task) {
		        if (!task) {
		            task = opts;
		            opts = null;
		        }
		        return initialParams(function (args, callback) {
		            function taskFn(cb) {
		                task.apply(null, args.concat([cb]));
		            }

		            if (opts) retry(opts, taskFn, callback);else retry(taskFn, callback);
		        });
		    }

		    /**
		     * The same as `some` but runs a maximum of `limit` async operations at a time.
		     *
		     * @name someLimit
		     * @static
		     * @memberOf async
		     * @see async.some
		     * @alias anyLimit
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - A truth test to apply to each item in the array
		     * in parallel. The iteratee is passed a `callback(err, truthValue)` which must
		     * be called with a boolean argument once it has completed. Invoked with
		     * (item, callback).
		     * @param {Function} [callback] - A callback which is called as soon as any
		     * iteratee returns `true`, or after all the iteratee functions have finished.
		     * Result will be either `true` or `false` depending on the values of the async
		     * tests. Invoked with (err, result).
		     */
		    var someLimit = _createTester(eachOfLimit, Boolean, identity);

		    /**
		     * Returns `true` if at least one element in the `coll` satisfies an async test.
		     * If any iteratee call returns `true`, the main `callback` is immediately
		     * called.
		     *
		     * @name some
		     * @static
		     * @memberOf async
		     * @alias any
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in the array
		     * in parallel. The iteratee is passed a `callback(err, truthValue)` which must
		     * be called with a boolean argument once it has completed. Invoked with
		     * (item, callback).
		     * @param {Function} [callback] - A callback which is called as soon as any
		     * iteratee returns `true`, or after all the iteratee functions have finished.
		     * Result will be either `true` or `false` depending on the values of the async
		     * tests. Invoked with (err, result).
		     * @example
		     *
		     * async.some(['file1','file2','file3'], function(filePath, callback) {
		     *     fs.access(filePath, function(err) {
		     *         callback(null, !err)
		     *     });
		     * }, function(err, result) {
		     *     // if result is true then at least one of the files exists
		     * });
		     */
		    var some = doLimit(someLimit, Infinity);

		    /**
		     * The same as `some` but runs only a single async operation at a time.
		     *
		     * @name someSeries
		     * @static
		     * @memberOf async
		     * @see async.some
		     * @alias anySeries
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A truth test to apply to each item in the array
		     * in parallel. The iteratee is passed a `callback(err, truthValue)` which must
		     * be called with a boolean argument once it has completed. Invoked with
		     * (item, callback).
		     * @param {Function} [callback] - A callback which is called as soon as any
		     * iteratee returns `true`, or after all the iteratee functions have finished.
		     * Result will be either `true` or `false` depending on the values of the async
		     * tests. Invoked with (err, result).
		     */
		    var someSeries = doLimit(someLimit, 1);

		    /**
		     * Sorts a list by the results of running each `coll` value through an async
		     * `iteratee`.
		     *
		     * @name sortBy
		     * @static
		     * @memberOf async
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {Function} iteratee - A function to apply to each item in `coll`.
		     * The iteratee is passed a `callback(err, sortValue)` which must be called once
		     * it has completed with an error (which can be `null`) and a value to use as
		     * the sort criteria. Invoked with (item, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished, or an error occurs. Results is the items
		     * from the original `coll` sorted by the values returned by the `iteratee`
		     * calls. Invoked with (err, results).
		     * @example
		     *
		     * async.sortBy(['file1','file2','file3'], function(file, callback) {
		     *     fs.stat(file, function(err, stats) {
		     *         callback(err, stats.mtime);
		     *     });
		     * }, function(err, results) {
		     *     // results is now the original array of files sorted by
		     *     // modified date
		     * });
		     *
		     * // By modifying the callback parameter the
		     * // sorting order can be influenced:
		     *
		     * // ascending order
		     * async.sortBy([1,9,3,5], function(x, callback) {
		     *     callback(null, x);
		     * }, function(err,result) {
		     *     // result callback
		     * });
		     *
		     * // descending order
		     * async.sortBy([1,9,3,5], function(x, callback) {
		     *     callback(null, x*-1);    //<- x*-1 instead of x, turns the order around
		     * }, function(err,result) {
		     *     // result callback
		     * });
		     */
		    function sortBy(arr, iteratee, cb) {
		        map(arr, function (x, cb) {
		            iteratee(x, function (err, criteria) {
		                if (err) return cb(err);
		                cb(null, { value: x, criteria: criteria });
		            });
		        }, function (err, results) {
		            if (err) return cb(err);
		            cb(null, arrayMap(results.sort(comparator), baseProperty('value')));
		        });

		        function comparator(left, right) {
		            var a = left.criteria,
		                b = right.criteria;
		            return a < b ? -1 : a > b ? 1 : 0;
		        }
		    }

		    /**
		     * Sets a time limit on an asynchronous function. If the function does not call
		     * its callback within the specified miliseconds, it will be called with a
		     * timeout error. The code property for the error object will be `'ETIMEDOUT'`.
		     *
		     * @name timeout
		     * @static
		     * @memberOf async
		     * @category Util
		     * @param {Function} function - The asynchronous function you want to set the
		     * time limit.
		     * @param {number} miliseconds - The specified time limit.
		     * @param {*} [info] - Any variable you want attached (`string`, `object`, etc)
		     * to timeout Error for more information..
		     * @returns {Function} Returns a wrapped function that can be used with any of
		     * the control flow functions.
		     * @example
		     *
		     * async.timeout(function(callback) {
		     *     doAsyncTask(callback);
		     * }, 1000);
		     */
		    function timeout(asyncFn, miliseconds, info) {
		        var originalCallback, timer;
		        var timedOut = false;

		        function injectedCallback() {
		            if (!timedOut) {
		                originalCallback.apply(null, arguments);
		                clearTimeout(timer);
		            }
		        }

		        function timeoutCallback() {
		            var name = asyncFn.name || 'anonymous';
		            var error = new Error('Callback function "' + name + '" timed out.');
		            error.code = 'ETIMEDOUT';
		            if (info) {
		                error.info = info;
		            }
		            timedOut = true;
		            originalCallback(error);
		        }

		        return initialParams(function (args, origCallback) {
		            originalCallback = origCallback;
		            // setup timer and call original function
		            timer = setTimeout(timeoutCallback, miliseconds);
		            asyncFn.apply(null, args.concat(injectedCallback));
		        });
		    }

		    /* Built-in method references for those with the same name as other `lodash` methods. */
		    var nativeCeil = Math.ceil;
		    var nativeMax$1 = Math.max;
		    /**
		     * The base implementation of `_.range` and `_.rangeRight` which doesn't
		     * coerce arguments to numbers.
		     *
		     * @private
		     * @param {number} start The start of the range.
		     * @param {number} end The end of the range.
		     * @param {number} step The value to increment or decrement by.
		     * @param {boolean} [fromRight] Specify iterating from right to left.
		     * @returns {Array} Returns the new array of numbers.
		     */
		    function baseRange(start, end, step, fromRight) {
		      var index = -1,
		          length = nativeMax$1(nativeCeil((end - start) / (step || 1)), 0),
		          result = Array(length);

		      while (length--) {
		        result[fromRight ? length : ++index] = start;
		        start += step;
		      }
		      return result;
		    }

		    /**
		    * The same as {@link times} but runs a maximum of `limit` async operations at a
		    * time.
		     *
		     * @name timesLimit
		     * @static
		     * @memberOf async
		     * @see async.times
		     * @category Control Flow
		     * @param {number} n - The number of times to run the function.
		     * @param {number} limit - The maximum number of async operations at a time.
		     * @param {Function} iteratee - The function to call `n` times. Invoked with the
		     * iteration index and a callback (n, next).
		     * @param {Function} callback - see {@link async.map}.
		     */
		    function timeLimit(count, limit, iteratee, cb) {
		      return mapLimit(baseRange(0, count, 1), limit, iteratee, cb);
		    }

		    /**
		     * Calls the `iteratee` function `n` times, and accumulates results in the same
		     * manner you would use with {@link async.map}.
		     *
		     * @name times
		     * @static
		     * @memberOf async
		     * @see async.map
		     * @category Control Flow
		     * @param {number} n - The number of times to run the function.
		     * @param {Function} iteratee - The function to call `n` times. Invoked with the
		     * iteration index and a callback (n, next).
		     * @param {Function} callback - see {@link async.map}.
		     * @example
		     *
		     * // Pretend this is some complicated async factory
		     * var createUser = function(id, callback) {
		     *     callback(null, {
		     *         id: 'user' + id
		     *     });
		     * };
		     *
		     * // generate 5 users
		     * async.times(5, function(n, next) {
		     *     createUser(n, function(err, user) {
		     *         next(err, user);
		     *     });
		     * }, function(err, users) {
		     *     // we should now have 5 users
		     * });
		     */
		    var times = doLimit(timeLimit, Infinity);

		    /**
		     * The same as {@link async.times} but runs only a single async operation at a time.
		     *
		     * @name timesSeries
		     * @static
		     * @memberOf async
		     * @see async.times
		     * @category Control Flow
		     * @param {number} n - The number of times to run the function.
		     * @param {Function} iteratee - The function to call `n` times. Invoked with the
		     * iteration index and a callback (n, next).
		     * @param {Function} callback - see {@link async.map}.
		     */
		    var timesSeries = doLimit(timeLimit, 1);

		    /**
		     * A relative of `reduce`.  Takes an Object or Array, and iterates over each
		     * element in series, each step potentially mutating an `accumulator` value.
		     * The type of the accumulator defaults to the type of collection passed in.
		     *
		     * @name transform
		     * @static
		     * @memberOf async
		     * @category Collection
		     * @param {Array|Object} coll - A collection to iterate over.
		     * @param {*} [accumulator] - The initial state of the transform.  If omitted,
		     * it will default to an empty Object or Array, depending on the type of `coll`
		     * @param {Function} iteratee - A function applied to each item in the
		     * collection that potentially modifies the accumulator. The `iteratee` is
		     * passed a `callback(err)` which accepts an optional error as its first
		     * argument. If an error is passed to the callback, the transform is stopped
		     * and the main `callback` is immediately called with the error.
		     * Invoked with (accumulator, item, key, callback).
		     * @param {Function} [callback] - A callback which is called after all the
		     * `iteratee` functions have finished. Result is the transformed accumulator.
		     * Invoked with (err, result).
		     * @example
		     *
		     * async.transform([1,2,3], function(acc, item, index, callback) {
		     *     // pointless async:
		     *     process.nextTick(function() {
		     *         acc.push(item * 2)
		     *         callback(null)
		     *     });
		     * }, function(err, result) {
		     *     // result is now equal to [2, 4, 6]
		     * });
		     *
		     * @example
		     *
		     * async.transform({a: 1, b: 2, c: 3}, function (obj, val, key, callback) {
		     *     setImmediate(function () {
		     *         obj[key] = val * 2;
		     *         callback();
		     *     })
		     * }, function (err, result) {
		     *     // result is equal to {a: 2, b: 4, c: 6}
		     * })
		     */
		    function transform(arr, acc, iteratee, callback) {
		        if (arguments.length === 3) {
		            callback = iteratee;
		            iteratee = acc;
		            acc = isArray(arr) ? [] : {};
		        }

		        eachOf(arr, function (v, k, cb) {
		            iteratee(acc, v, k, cb);
		        }, function (err) {
		            callback(err, acc);
		        });
		    }

		    /**
		     * Undoes a {@link async.memoize}d function, reverting it to the original,
		     * unmemoized form. Handy for testing.
		     *
		     * @name unmemoize
		     * @static
		     * @memberOf async
		     * @see async.memoize
		     * @category Util
		     * @param {Function} fn - the memoized function
		     */

		    function unmemoize(fn) {
		        return function () {
		            return (fn.unmemoized || fn).apply(null, arguments);
		        };
		    }

		    /**
		     * Repeatedly call `fn` until `test` returns `true`. Calls `callback` when
		     * stopped, or an error occurs. `callback` will be passed an error and any
		     * arguments passed to the final `fn`'s callback.
		     *
		     * The inverse of {@link async.whilst}.
		     *
		     * @name until
		     * @static
		     * @memberOf async
		     * @see async.whilst
		     * @category Control Flow
		     * @param {Function} test - synchronous truth test to perform before each
		     * execution of `fn`. Invoked with ().
		     * @param {Function} fn - A function which is called each time `test` fails.
		     * The function is passed a `callback(err)`, which must be called once it has
		     * completed with an optional `err` argument. Invoked with (callback).
		     * @param {Function} [callback] - A callback which is called after the test
		     * function has passed and repeated execution of `fn` has stopped. `callback`
		     * will be passed an error and any arguments passed to the final `fn`'s
		     * callback. Invoked with (err, [results]);
		     */
		    function until(test, iteratee, cb) {
		        return whilst(function () {
		            return !test.apply(this, arguments);
		        }, iteratee, cb);
		    }

		    /**
		     * Runs the `tasks` array of functions in series, each passing their results to
		     * the next in the array. However, if any of the `tasks` pass an error to their
		     * own callback, the next function is not executed, and the main `callback` is
		     * immediately called with the error.
		     *
		     * @name waterfall
		     * @static
		     * @memberOf async
		     * @category Control Flow
		     * @param {Array} tasks - An array of functions to run, each function is passed
		     * a `callback(err, result1, result2, ...)` it must call on completion. The
		     * first argument is an error (which can be `null`) and any further arguments
		     * will be passed as arguments in order to the next task.
		     * @param {Function} [callback] - An optional callback to run once all the
		     * functions have completed. This will be passed the results of the last task's
		     * callback. Invoked with (err, [results]).
		     * @example
		     *
		     * async.waterfall([
		     *     function(callback) {
		     *         callback(null, 'one', 'two');
		     *     },
		     *     function(arg1, arg2, callback) {
		     *         // arg1 now equals 'one' and arg2 now equals 'two'
		     *         callback(null, 'three');
		     *     },
		     *     function(arg1, callback) {
		     *         // arg1 now equals 'three'
		     *         callback(null, 'done');
		     *     }
		     * ], function (err, result) {
		     *     // result now equals 'done'
		     * });
		     *
		     * // Or, with named functions:
		     * async.waterfall([
		     *     myFirstFunction,
		     *     mySecondFunction,
		     *     myLastFunction,
		     * ], function (err, result) {
		     *     // result now equals 'done'
		     * });
		     * function myFirstFunction(callback) {
		     *     callback(null, 'one', 'two');
		     * }
		     * function mySecondFunction(arg1, arg2, callback) {
		     *     // arg1 now equals 'one' and arg2 now equals 'two'
		     *     callback(null, 'three');
		     * }
		     * function myLastFunction(arg1, callback) {
		     *     // arg1 now equals 'three'
		     *     callback(null, 'done');
		     * }
		     */
		    function waterfall (tasks, cb) {
		        cb = once(cb || noop);
		        if (!isArray(tasks)) return cb(new Error('First argument to waterfall must be an array of functions'));
		        if (!tasks.length) return cb();
		        var taskIndex = 0;

		        function nextTask(args) {
		            if (taskIndex === tasks.length) {
		                return cb.apply(null, [null].concat(args));
		            }

		            var taskCallback = onlyOnce(rest(function (err, args) {
		                if (err) {
		                    return cb.apply(null, [err].concat(args));
		                }
		                nextTask(args);
		            }));

		            args.push(taskCallback);

		            var task = tasks[taskIndex++];
		            task.apply(null, args);
		        }

		        nextTask([]);
		    }

		    var index = {
		        applyEach: applyEach,
		        applyEachSeries: applyEachSeries,
		        apply: apply$1,
		        asyncify: asyncify,
		        auto: auto,
		        autoInject: autoInject,
		        cargo: cargo,
		        compose: compose,
		        concat: concat,
		        concatSeries: concatSeries,
		        constant: constant,
		        detect: detect,
		        detectLimit: detectLimit,
		        detectSeries: detectSeries,
		        dir: dir,
		        doDuring: doDuring,
		        doUntil: doUntil,
		        doWhilst: doWhilst,
		        during: during,
		        each: each,
		        eachLimit: eachLimit,
		        eachOf: eachOf,
		        eachOfLimit: eachOfLimit,
		        eachOfSeries: eachOfSeries,
		        eachSeries: eachSeries,
		        ensureAsync: ensureAsync,
		        every: every,
		        everyLimit: everyLimit,
		        everySeries: everySeries,
		        filter: filter,
		        filterLimit: filterLimit,
		        filterSeries: filterSeries,
		        forever: forever,
		        iterator: iterator$1,
		        log: log,
		        map: map,
		        mapLimit: mapLimit,
		        mapSeries: mapSeries,
		        memoize: memoize$1,
		        nextTick: setImmediate$1,
		        parallel: parallel,
		        parallelLimit: parallelLimit,
		        priorityQueue: priorityQueue,
		        queue: queue$1,
		        race: race,
		        reduce: reduce,
		        reduceRight: reduceRight,
		        reflect: reflect,
		        reflectAll: reflectAll,
		        reject: reject,
		        rejectLimit: rejectLimit,
		        rejectSeries: rejectSeries,
		        retry: retry,
		        retryable: retryable,
		        seq: seq,
		        series: series,
		        setImmediate: setImmediate$1,
		        some: some,
		        someLimit: someLimit,
		        someSeries: someSeries,
		        sortBy: sortBy,
		        timeout: timeout,
		        times: times,
		        timesLimit: timeLimit,
		        timesSeries: timesSeries,
		        transform: transform,
		        unmemoize: unmemoize,
		        until: until,
		        waterfall: waterfall,
		        whilst: whilst,

		        // aliases
		        all: every,
		        any: some,
		        forEach: each,
		        forEachSeries: eachSeries,
		        forEachLimit: eachLimit,
		        forEachOf: eachOf,
		        forEachOfSeries: eachOfSeries,
		        forEachOfLimit: eachOfLimit,
		        inject: reduce,
		        foldl: reduce,
		        foldr: reduceRight,
		        select: filter,
		        selectLimit: filterLimit,
		        selectSeries: filterSeries,
		        wrapSync: asyncify
		    };

		    exports['default'] = index;
		    exports.applyEach = applyEach;
		    exports.applyEachSeries = applyEachSeries;
		    exports.apply = apply$1;
		    exports.asyncify = asyncify;
		    exports.auto = auto;
		    exports.autoInject = autoInject;
		    exports.cargo = cargo;
		    exports.compose = compose;
		    exports.concat = concat;
		    exports.concatSeries = concatSeries;
		    exports.constant = constant;
		    exports.detect = detect;
		    exports.detectLimit = detectLimit;
		    exports.detectSeries = detectSeries;
		    exports.dir = dir;
		    exports.doDuring = doDuring;
		    exports.doUntil = doUntil;
		    exports.doWhilst = doWhilst;
		    exports.during = during;
		    exports.each = each;
		    exports.eachLimit = eachLimit;
		    exports.eachOf = eachOf;
		    exports.eachOfLimit = eachOfLimit;
		    exports.eachOfSeries = eachOfSeries;
		    exports.eachSeries = eachSeries;
		    exports.ensureAsync = ensureAsync;
		    exports.every = every;
		    exports.everyLimit = everyLimit;
		    exports.everySeries = everySeries;
		    exports.filter = filter;
		    exports.filterLimit = filterLimit;
		    exports.filterSeries = filterSeries;
		    exports.forever = forever;
		    exports.iterator = iterator$1;
		    exports.log = log;
		    exports.map = map;
		    exports.mapLimit = mapLimit;
		    exports.mapSeries = mapSeries;
		    exports.memoize = memoize$1;
		    exports.nextTick = setImmediate$1;
		    exports.parallel = parallel;
		    exports.parallelLimit = parallelLimit;
		    exports.priorityQueue = priorityQueue;
		    exports.queue = queue$1;
		    exports.race = race;
		    exports.reduce = reduce;
		    exports.reduceRight = reduceRight;
		    exports.reflect = reflect;
		    exports.reflectAll = reflectAll;
		    exports.reject = reject;
		    exports.rejectLimit = rejectLimit;
		    exports.rejectSeries = rejectSeries;
		    exports.retry = retry;
		    exports.retryable = retryable;
		    exports.seq = seq;
		    exports.series = series;
		    exports.setImmediate = setImmediate$1;
		    exports.some = some;
		    exports.someLimit = someLimit;
		    exports.someSeries = someSeries;
		    exports.sortBy = sortBy;
		    exports.timeout = timeout;
		    exports.times = times;
		    exports.timesLimit = timeLimit;
		    exports.timesSeries = timesSeries;
		    exports.transform = transform;
		    exports.unmemoize = unmemoize;
		    exports.until = until;
		    exports.waterfall = waterfall;
		    exports.whilst = whilst;
		    exports.all = every;
		    exports.allLimit = everyLimit;
		    exports.allSeries = everySeries;
		    exports.any = some;
		    exports.anyLimit = someLimit;
		    exports.anySeries = someSeries;
		    exports.find = detect;
		    exports.findLimit = detectLimit;
		    exports.findSeries = detectSeries;
		    exports.forEach = each;
		    exports.forEachSeries = eachSeries;
		    exports.forEachLimit = eachLimit;
		    exports.forEachOf = eachOf;
		    exports.forEachOfSeries = eachOfSeries;
		    exports.forEachOfLimit = eachOfLimit;
		    exports.inject = reduce;
		    exports.foldl = reduce;
		    exports.foldr = reduceRight;
		    exports.select = filter;
		    exports.selectLimit = filterLimit;
		    exports.selectSeries = filterSeries;
		    exports.wrapSync = asyncify;

		}));
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(48)(module), __webpack_require__(18), __webpack_require__(21).setImmediate, __webpack_require__(3)))

	/***/ },
	/* 96 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var protobuf = __webpack_require__(90);

		var Block = __webpack_require__(64);
		var path = __webpack_require__(31);
		var isEqual = __webpack_require__(679);

		var pbm = protobuf(Buffer("cGFja2FnZSBiaXRzd2FwLm1lc3NhZ2UucGI7CgptZXNzYWdlIE1lc3NhZ2UgewoKICBtZXNzYWdlIFdhbnRsaXN0IHsKCiAgICBtZXNzYWdlIEVudHJ5IHsKICAgICAgb3B0aW9uYWwgc3RyaW5nIGJsb2NrID0gMTsgLy8gdGhlIGJsb2NrIGtleQogICAgICBvcHRpb25hbCBpbnQzMiBwcmlvcml0eSA9IDI7IC8vIHRoZSBwcmlvcml0eSAobm9ybWFsaXplZCkuIGRlZmF1bHQgdG8gMQogICAgICBvcHRpb25hbCBib29sIGNhbmNlbCA9IDM7ICAvLyB3aGV0aGVyIHRoaXMgcmV2b2tlcyBhbiBlbnRyeQogICAgfQoKICAgIHJlcGVhdGVkIEVudHJ5IGVudHJpZXMgPSAxOyAvLyBhIGxpc3Qgb2Ygd2FudGxpc3QgZW50cmllcwogICAgb3B0aW9uYWwgYm9vbCBmdWxsID0gMjsgICAgIC8vIHdoZXRoZXIgdGhpcyBpcyB0aGUgZnVsbCB3YW50bGlzdC4gZGVmYXVsdCB0byBmYWxzZQogIH0KCiAgb3B0aW9uYWwgV2FudGxpc3Qgd2FudGxpc3QgPSAxOwogIHJlcGVhdGVkIGJ5dGVzIGJsb2NrcyA9IDI7Cn0=","base64"));
		var Entry = __webpack_require__(312);

		var BitswapMessage = function () {
		  function BitswapMessage(full) {
		    _classCallCheck(this, BitswapMessage);

		    this.full = full;
		    this.wantlist = new Map();
		    this.blocks = new Map();
		  }

		  _createClass(BitswapMessage, [{
		    key: 'addEntry',
		    value: function addEntry(key, priority, cancel) {
		      var e = this.wantlist.get(key.toString('hex'));

		      if (e) {
		        e.priority = priority;
		        e.cancel = Boolean(cancel);
		      } else {
		        this.wantlist.set(key.toString('hex'), new Entry(key, priority, cancel));
		      }
		    }
		  }, {
		    key: 'addBlock',
		    value: function addBlock(block) {
		      this.blocks.set(block.key.toString('hex'), block);
		    }
		  }, {
		    key: 'cancel',
		    value: function cancel(key) {
		      this.wantlist.delete(key.toString('hex'));
		      this.addEntry(key.toString('hex'), 0, true);
		    }
		  }, {
		    key: 'toProto',
		    value: function toProto() {
		      return pbm.Message.encode({
		        wantlist: {
		          entries: Array.from(this.wantlist.values()).map(function (e) {
		            return {
		              block: e.key.toString('hex'),
		              priority: Number(e.priority),
		              cancel: Boolean(e.cancel)
		            };
		          }),
		          full: this.full
		        },
		        blocks: Array.from(this.blocks.values()).map(function (b) {
		          return b.data;
		        })
		      });
		    }
		  }, {
		    key: 'equals',
		    value: function equals(other) {
		      if (this.full !== other.full || !isEqual(this.wantlist, other.wantlist) || !isEqual(this.blocks, other.blocks)) {
		        return false;
		      }

		      return true;
		    }
		  }, {
		    key: 'empty',
		    get: function get() {
		      return this.blocks.size === 0 && this.wantlist.size === 0;
		    }
		  }]);

		  return BitswapMessage;
		}();

		BitswapMessage.fromProto = function (raw) {
		  var dec = pbm.Message.decode(raw);
		  var m = new BitswapMessage(dec.wantlist.full);

		  dec.wantlist.entries.forEach(function (e) {
		    m.addEntry(new Buffer(e.block, 'hex'), e.priority, e.cancel);
		  });
		  dec.blocks.forEach(function (b) {
		    return m.addBlock(new Block(b));
		  });

		  return m;
		};

		BitswapMessage.Entry = Entry;
		module.exports = BitswapMessage;
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 97 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var Entry = __webpack_require__(314);

		var Wantlist = function () {
		  function Wantlist() {
		    _classCallCheck(this, Wantlist);

		    this.set = new Map();
		  }

		  _createClass(Wantlist, [{
		    key: 'add',
		    value: function add(key, priority) {
		      var e = this.set.get(key.toString('hex'));

		      if (e) {
		        e.inc();
		        e.priority = priority;
		      } else {
		        this.set.set(key.toString('hex'), new Entry(key, priority));
		      }
		    }
		  }, {
		    key: 'remove',
		    value: function remove(key) {
		      var e = this.set.get(key.toString('hex'));

		      if (!e) return;

		      e.dec();

		      // only delete when no refs are held
		      if (e.hasRefs()) return;

		      this.set.delete(key.toString('hex'));
		    }
		  }, {
		    key: 'removeForce',
		    value: function removeForce(key) {
		      if (this.set.has(key)) {
		        this.set.delete(key);
		      }
		    }
		  }, {
		    key: 'entries',
		    value: function entries() {
		      return this.set.entries();
		    }
		  }, {
		    key: 'sortedEntries',
		    value: function sortedEntries() {
		      return new Map(Array.from(this.set.entries()).sort());
		    }
		  }, {
		    key: 'contains',
		    value: function contains(key) {
		      return this.set.get(key.toString('hex'));
		    }
		  }, {
		    key: 'length',
		    get: function get() {
		      return this.set.size;
		    }
		  }]);

		  return Wantlist;
		}();

		Wantlist.Entry = Entry;
		module.exports = Wantlist;

	/***/ },
	/* 98 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var DuplexStream = __webpack_require__(360)
		  , util         = __webpack_require__(11)


		function BufferList (callback) {
		  if (!(this instanceof BufferList))
		    return new BufferList(callback)

		  this._bufs  = []
		  this.length = 0

		  if (typeof callback == 'function') {
		    this._callback = callback

		    var piper = function piper (err) {
		      if (this._callback) {
		        this._callback(err)
		        this._callback = null
		      }
		    }.bind(this)

		    this.on('pipe', function onPipe (src) {
		      src.on('error', piper)
		    })
		    this.on('unpipe', function onUnpipe (src) {
		      src.removeListener('error', piper)
		    })
		  } else {
		    this.append(callback)
		  }

		  DuplexStream.call(this)
		}


		util.inherits(BufferList, DuplexStream)


		BufferList.prototype._offset = function _offset (offset) {
		  var tot = 0, i = 0, _t
		  for (; i < this._bufs.length; i++) {
		    _t = tot + this._bufs[i].length
		    if (offset < _t)
		      return [ i, offset - tot ]
		    tot = _t
		  }
		}


		BufferList.prototype.append = function append (buf) {
		  var i = 0
		    , newBuf

		  if (Array.isArray(buf)) {
		    for (; i < buf.length; i++)
		      this.append(buf[i])
		  } else if (buf instanceof BufferList) {
		    // unwrap argument into individual BufferLists
		    for (; i < buf._bufs.length; i++)
		      this.append(buf._bufs[i])
		  } else if (buf != null) {
		    // coerce number arguments to strings, since Buffer(number) does
		    // uninitialized memory allocation
		    if (typeof buf == 'number')
		      buf = buf.toString()

		    newBuf = Buffer.isBuffer(buf) ? buf : new Buffer(buf)
		    this._bufs.push(newBuf)
		    this.length += newBuf.length
		  }

		  return this
		}


		BufferList.prototype._write = function _write (buf, encoding, callback) {
		  this.append(buf)

		  if (typeof callback == 'function')
		    callback()
		}


		BufferList.prototype._read = function _read (size) {
		  if (!this.length)
		    return this.push(null)

		  size = Math.min(size, this.length)
		  this.push(this.slice(0, size))
		  this.consume(size)
		}


		BufferList.prototype.end = function end (chunk) {
		  DuplexStream.prototype.end.call(this, chunk)

		  if (this._callback) {
		    this._callback(null, this.slice())
		    this._callback = null
		  }
		}


		BufferList.prototype.get = function get (index) {
		  return this.slice(index, index + 1)[0]
		}


		BufferList.prototype.slice = function slice (start, end) {
		  return this.copy(null, 0, start, end)
		}


		BufferList.prototype.copy = function copy (dst, dstStart, srcStart, srcEnd) {
		  if (typeof srcStart != 'number' || srcStart < 0)
		    srcStart = 0
		  if (typeof srcEnd != 'number' || srcEnd > this.length)
		    srcEnd = this.length
		  if (srcStart >= this.length)
		    return dst || new Buffer(0)
		  if (srcEnd <= 0)
		    return dst || new Buffer(0)

		  var copy   = !!dst
		    , off    = this._offset(srcStart)
		    , len    = srcEnd - srcStart
		    , bytes  = len
		    , bufoff = (copy && dstStart) || 0
		    , start  = off[1]
		    , l
		    , i

		  // copy/slice everything
		  if (srcStart === 0 && srcEnd == this.length) {
		    if (!copy) // slice, just return a full concat
		      return Buffer.concat(this._bufs)

		    // copy, need to copy individual buffers
		    for (i = 0; i < this._bufs.length; i++) {
		      this._bufs[i].copy(dst, bufoff)
		      bufoff += this._bufs[i].length
		    }

		    return dst
		  }

		  // easy, cheap case where it's a subset of one of the buffers
		  if (bytes <= this._bufs[off[0]].length - start) {
		    return copy
		      ? this._bufs[off[0]].copy(dst, dstStart, start, start + bytes)
		      : this._bufs[off[0]].slice(start, start + bytes)
		  }

		  if (!copy) // a slice, we need something to copy in to
		    dst = new Buffer(len)

		  for (i = off[0]; i < this._bufs.length; i++) {
		    l = this._bufs[i].length - start

		    if (bytes > l) {
		      this._bufs[i].copy(dst, bufoff, start)
		    } else {
		      this._bufs[i].copy(dst, bufoff, start, start + bytes)
		      break
		    }

		    bufoff += l
		    bytes -= l

		    if (start)
		      start = 0
		  }

		  return dst
		}

		BufferList.prototype.toString = function toString (encoding, start, end) {
		  return this.slice(start, end).toString(encoding)
		}

		BufferList.prototype.consume = function consume (bytes) {
		  while (this._bufs.length) {
		    if (bytes >= this._bufs[0].length) {
		      bytes -= this._bufs[0].length
		      this.length -= this._bufs[0].length
		      this._bufs.shift()
		    } else {
		      this._bufs[0] = this._bufs[0].slice(bytes)
		      this.length -= bytes
		      break
		    }
		  }
		  return this
		}


		BufferList.prototype.duplicate = function duplicate () {
		  var i = 0
		    , copy = new BufferList()

		  for (; i < this._bufs.length; i++)
		    copy.append(this._bufs[i])

		  return copy
		}


		BufferList.prototype.destroy = function destroy () {
		  this._bufs.length = 0
		  this.length = 0
		  this.push(null)
		}


		;(function () {
		  var methods = {
		      'readDoubleBE' : 8
		    , 'readDoubleLE' : 8
		    , 'readFloatBE'  : 4
		    , 'readFloatLE'  : 4
		    , 'readInt32BE'  : 4
		    , 'readInt32LE'  : 4
		    , 'readUInt32BE' : 4
		    , 'readUInt32LE' : 4
		    , 'readInt16BE'  : 2
		    , 'readInt16LE'  : 2
		    , 'readUInt16BE' : 2
		    , 'readUInt16LE' : 2
		    , 'readInt8'     : 1
		    , 'readUInt8'    : 1
		  }

		  for (var m in methods) {
		    (function (m) {
		      BufferList.prototype[m] = function (offset) {
		        return this.slice(offset, offset + methods[m])[m](0)
		      }
		    }(m))
		  }
		}())


		module.exports = BufferList

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 99 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {// based on the aes implimentation in triple sec
		// https://github.com/keybase/triplesec

		// which is in turn based on the one from crypto-js
		// https://code.google.com/p/crypto-js/

		var uint_max = Math.pow(2, 32)
		function fixup_uint32 (x) {
		  var ret, x_pos
		  ret = x > uint_max || x < 0 ? (x_pos = Math.abs(x) % uint_max, x < 0 ? uint_max - x_pos : x_pos) : x
		  return ret
		}
		function scrub_vec (v) {
		  for (var i = 0; i < v.length; v++) {
		    v[i] = 0
		  }
		  return false
		}

		function Global () {
		  this.SBOX = []
		  this.INV_SBOX = []
		  this.SUB_MIX = [[], [], [], []]
		  this.INV_SUB_MIX = [[], [], [], []]
		  this.init()
		  this.RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]
		}

		Global.prototype.init = function () {
		  var d, i, sx, t, x, x2, x4, x8, xi, _i
		  d = (function () {
		    var _i, _results
		    _results = []
		    for (i = _i = 0; _i < 256; i = ++_i) {
		      if (i < 128) {
		        _results.push(i << 1)
		      } else {
		        _results.push((i << 1) ^ 0x11b)
		      }
		    }
		    return _results
		  })()
		  x = 0
		  xi = 0
		  for (i = _i = 0; _i < 256; i = ++_i) {
		    sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4)
		    sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63
		    this.SBOX[x] = sx
		    this.INV_SBOX[sx] = x
		    x2 = d[x]
		    x4 = d[x2]
		    x8 = d[x4]
		    t = (d[sx] * 0x101) ^ (sx * 0x1010100)
		    this.SUB_MIX[0][x] = (t << 24) | (t >>> 8)
		    this.SUB_MIX[1][x] = (t << 16) | (t >>> 16)
		    this.SUB_MIX[2][x] = (t << 8) | (t >>> 24)
		    this.SUB_MIX[3][x] = t
		    t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100)
		    this.INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)
		    this.INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)
		    this.INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)
		    this.INV_SUB_MIX[3][sx] = t
		    if (x === 0) {
		      x = xi = 1
		    } else {
		      x = x2 ^ d[d[d[x8 ^ x2]]]
		      xi ^= d[d[xi]]
		    }
		  }
		  return true
		}

		var G = new Global()

		AES.blockSize = 4 * 4

		AES.prototype.blockSize = AES.blockSize

		AES.keySize = 256 / 8

		AES.prototype.keySize = AES.keySize

		function bufferToArray (buf) {
		  var len = buf.length / 4
		  var out = new Array(len)
		  var i = -1
		  while (++i < len) {
		    out[i] = buf.readUInt32BE(i * 4)
		  }
		  return out
		}
		function AES (key) {
		  this._key = bufferToArray(key)
		  this._doReset()
		}

		AES.prototype._doReset = function () {
		  var invKsRow, keySize, keyWords, ksRow, ksRows, t
		  keyWords = this._key
		  keySize = keyWords.length
		  this._nRounds = keySize + 6
		  ksRows = (this._nRounds + 1) * 4
		  this._keySchedule = []
		  for (ksRow = 0; ksRow < ksRows; ksRow++) {
		    this._keySchedule[ksRow] = ksRow < keySize ? keyWords[ksRow] : (t = this._keySchedule[ksRow - 1], (ksRow % keySize) === 0 ? (t = (t << 8) | (t >>> 24), t = (G.SBOX[t >>> 24] << 24) | (G.SBOX[(t >>> 16) & 0xff] << 16) | (G.SBOX[(t >>> 8) & 0xff] << 8) | G.SBOX[t & 0xff], t ^= G.RCON[(ksRow / keySize) | 0] << 24) : keySize > 6 && ksRow % keySize === 4 ? t = (G.SBOX[t >>> 24] << 24) | (G.SBOX[(t >>> 16) & 0xff] << 16) | (G.SBOX[(t >>> 8) & 0xff] << 8) | G.SBOX[t & 0xff] : void 0, this._keySchedule[ksRow - keySize] ^ t)
		  }
		  this._invKeySchedule = []
		  for (invKsRow = 0; invKsRow < ksRows; invKsRow++) {
		    ksRow = ksRows - invKsRow
		    t = this._keySchedule[ksRow - (invKsRow % 4 ? 0 : 4)]
		    this._invKeySchedule[invKsRow] = invKsRow < 4 || ksRow <= 4 ? t : G.INV_SUB_MIX[0][G.SBOX[t >>> 24]] ^ G.INV_SUB_MIX[1][G.SBOX[(t >>> 16) & 0xff]] ^ G.INV_SUB_MIX[2][G.SBOX[(t >>> 8) & 0xff]] ^ G.INV_SUB_MIX[3][G.SBOX[t & 0xff]]
		  }
		  return true
		}

		AES.prototype.encryptBlock = function (M) {
		  M = bufferToArray(new Buffer(M))
		  var out = this._doCryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX)
		  var buf = new Buffer(16)
		  buf.writeUInt32BE(out[0], 0)
		  buf.writeUInt32BE(out[1], 4)
		  buf.writeUInt32BE(out[2], 8)
		  buf.writeUInt32BE(out[3], 12)
		  return buf
		}

		AES.prototype.decryptBlock = function (M) {
		  M = bufferToArray(new Buffer(M))
		  var temp = [M[3], M[1]]
		  M[1] = temp[0]
		  M[3] = temp[1]
		  var out = this._doCryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX)
		  var buf = new Buffer(16)
		  buf.writeUInt32BE(out[0], 0)
		  buf.writeUInt32BE(out[3], 4)
		  buf.writeUInt32BE(out[2], 8)
		  buf.writeUInt32BE(out[1], 12)
		  return buf
		}

		AES.prototype.scrub = function () {
		  scrub_vec(this._keySchedule)
		  scrub_vec(this._invKeySchedule)
		  scrub_vec(this._key)
		}

		AES.prototype._doCryptBlock = function (M, keySchedule, SUB_MIX, SBOX) {
		  var ksRow, s0, s1, s2, s3, t0, t1, t2, t3

		  s0 = M[0] ^ keySchedule[0]
		  s1 = M[1] ^ keySchedule[1]
		  s2 = M[2] ^ keySchedule[2]
		  s3 = M[3] ^ keySchedule[3]
		  ksRow = 4
		  for (var round = 1; round < this._nRounds; round++) {
		    t0 = SUB_MIX[0][s0 >>> 24] ^ SUB_MIX[1][(s1 >>> 16) & 0xff] ^ SUB_MIX[2][(s2 >>> 8) & 0xff] ^ SUB_MIX[3][s3 & 0xff] ^ keySchedule[ksRow++]
		    t1 = SUB_MIX[0][s1 >>> 24] ^ SUB_MIX[1][(s2 >>> 16) & 0xff] ^ SUB_MIX[2][(s3 >>> 8) & 0xff] ^ SUB_MIX[3][s0 & 0xff] ^ keySchedule[ksRow++]
		    t2 = SUB_MIX[0][s2 >>> 24] ^ SUB_MIX[1][(s3 >>> 16) & 0xff] ^ SUB_MIX[2][(s0 >>> 8) & 0xff] ^ SUB_MIX[3][s1 & 0xff] ^ keySchedule[ksRow++]
		    t3 = SUB_MIX[0][s3 >>> 24] ^ SUB_MIX[1][(s0 >>> 16) & 0xff] ^ SUB_MIX[2][(s1 >>> 8) & 0xff] ^ SUB_MIX[3][s2 & 0xff] ^ keySchedule[ksRow++]
		    s0 = t0
		    s1 = t1
		    s2 = t2
		    s3 = t3
		  }
		  t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]
		  t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]
		  t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]
		  t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]
		  return [
		    fixup_uint32(t0),
		    fixup_uint32(t1),
		    fixup_uint32(t2),
		    fixup_uint32(t3)
		  ]
		}

		exports.AES = AES

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 100 */
	/***/ function(module, exports) {

		exports['aes-128-ecb'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 0,
		  mode: 'ECB',
		  type: 'block'
		}
		exports['aes-192-ecb'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 0,
		  mode: 'ECB',
		  type: 'block'
		}
		exports['aes-256-ecb'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 0,
		  mode: 'ECB',
		  type: 'block'
		}
		exports['aes-128-cbc'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 16,
		  mode: 'CBC',
		  type: 'block'
		}
		exports['aes-192-cbc'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 16,
		  mode: 'CBC',
		  type: 'block'
		}
		exports['aes-256-cbc'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 16,
		  mode: 'CBC',
		  type: 'block'
		}
		exports['aes128'] = exports['aes-128-cbc']
		exports['aes192'] = exports['aes-192-cbc']
		exports['aes256'] = exports['aes-256-cbc']
		exports['aes-128-cfb'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 16,
		  mode: 'CFB',
		  type: 'stream'
		}
		exports['aes-192-cfb'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 16,
		  mode: 'CFB',
		  type: 'stream'
		}
		exports['aes-256-cfb'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 16,
		  mode: 'CFB',
		  type: 'stream'
		}
		exports['aes-128-cfb8'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 16,
		  mode: 'CFB8',
		  type: 'stream'
		}
		exports['aes-192-cfb8'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 16,
		  mode: 'CFB8',
		  type: 'stream'
		}
		exports['aes-256-cfb8'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 16,
		  mode: 'CFB8',
		  type: 'stream'
		}
		exports['aes-128-cfb1'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 16,
		  mode: 'CFB1',
		  type: 'stream'
		}
		exports['aes-192-cfb1'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 16,
		  mode: 'CFB1',
		  type: 'stream'
		}
		exports['aes-256-cfb1'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 16,
		  mode: 'CFB1',
		  type: 'stream'
		}
		exports['aes-128-ofb'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 16,
		  mode: 'OFB',
		  type: 'stream'
		}
		exports['aes-192-ofb'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 16,
		  mode: 'OFB',
		  type: 'stream'
		}
		exports['aes-256-ofb'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 16,
		  mode: 'OFB',
		  type: 'stream'
		}
		exports['aes-128-ctr'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 16,
		  mode: 'CTR',
		  type: 'stream'
		}
		exports['aes-192-ctr'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 16,
		  mode: 'CTR',
		  type: 'stream'
		}
		exports['aes-256-ctr'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 16,
		  mode: 'CTR',
		  type: 'stream'
		}
		exports['aes-128-gcm'] = {
		  cipher: 'AES',
		  key: 128,
		  iv: 12,
		  mode: 'GCM',
		  type: 'auth'
		}
		exports['aes-192-gcm'] = {
		  cipher: 'AES',
		  key: 192,
		  iv: 12,
		  mode: 'GCM',
		  type: 'auth'
		}
		exports['aes-256-gcm'] = {
		  cipher: 'AES',
		  key: 256,
		  iv: 12,
		  mode: 'GCM',
		  type: 'auth'
		}


	/***/ },
	/* 101 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var xor = __webpack_require__(85)

		function incr32 (iv) {
		  var len = iv.length
		  var item
		  while (len--) {
		    item = iv.readUInt8(len)
		    if (item === 255) {
		      iv.writeUInt8(0, len)
		    } else {
		      item++
		      iv.writeUInt8(item, len)
		      break
		    }
		  }
		}

		function getBlock (self) {
		  var out = self._cipher.encryptBlock(self._prev)
		  incr32(self._prev)
		  return out
		}

		exports.encrypt = function (self, chunk) {
		  while (self._cache.length < chunk.length) {
		    self._cache = Buffer.concat([self._cache, getBlock(self)])
		  }
		  var pad = self._cache.slice(0, chunk.length)
		  self._cache = self._cache.slice(chunk.length)
		  return xor(chunk, pad)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 102 */
	/***/ function(module, exports) {

		var core = module.exports = {version: '2.4.0'};
		if(typeof __e == 'number')__e = core; // eslint-disable-line no-undef

	/***/ },
	/* 103 */
	/***/ function(module, exports, __webpack_require__) {

		// false -> Array#indexOf
		// true  -> Array#includes
		var toIObject = __webpack_require__(30)
		  , toLength  = __webpack_require__(20)
		  , toIndex   = __webpack_require__(60);
		module.exports = function(IS_INCLUDES){
		  return function($this, el, fromIndex){
		    var O      = toIObject($this)
		      , length = toLength(O.length)
		      , index  = toIndex(fromIndex, length)
		      , value;
		    // Array#includes uses SameValueZero equality algorithm
		    if(IS_INCLUDES && el != el)while(length > index){
		      value = O[index++];
		      if(value != value)return true;
		    // Array#toIndex ignores holes, Array#includes - not
		    } else for(;length > index; index++)if(IS_INCLUDES || index in O){
		      if(O[index] === el)return IS_INCLUDES || index || 0;
		    } return !IS_INCLUDES && -1;
		  };
		};

	/***/ },
	/* 104 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var global            = __webpack_require__(8)
		  , $export           = __webpack_require__(1)
		  , redefine          = __webpack_require__(28)
		  , redefineAll       = __webpack_require__(58)
		  , meta              = __webpack_require__(50)
		  , forOf             = __webpack_require__(69)
		  , anInstance        = __webpack_require__(49)
		  , isObject          = __webpack_require__(12)
		  , fails             = __webpack_require__(9)
		  , $iterDetect       = __webpack_require__(109)
		  , setToStringTag    = __webpack_require__(70)
		  , inheritIfRequired = __webpack_require__(146);

		module.exports = function(NAME, wrapper, methods, common, IS_MAP, IS_WEAK){
		  var Base  = global[NAME]
		    , C     = Base
		    , ADDER = IS_MAP ? 'set' : 'add'
		    , proto = C && C.prototype
		    , O     = {};
		  var fixMethod = function(KEY){
		    var fn = proto[KEY];
		    redefine(proto, KEY,
		      KEY == 'delete' ? function(a){
		        return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);
		      } : KEY == 'has' ? function has(a){
		        return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);
		      } : KEY == 'get' ? function get(a){
		        return IS_WEAK && !isObject(a) ? undefined : fn.call(this, a === 0 ? 0 : a);
		      } : KEY == 'add' ? function add(a){ fn.call(this, a === 0 ? 0 : a); return this; }
		        : function set(a, b){ fn.call(this, a === 0 ? 0 : a, b); return this; }
		    );
		  };
		  if(typeof C != 'function' || !(IS_WEAK || proto.forEach && !fails(function(){
		    new C().entries().next();
		  }))){
		    // create collection constructor
		    C = common.getConstructor(wrapper, NAME, IS_MAP, ADDER);
		    redefineAll(C.prototype, methods);
		    meta.NEED = true;
		  } else {
		    var instance             = new C
		      // early implementations not supports chaining
		      , HASNT_CHAINING       = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance
		      // V8 ~  Chromium 40- weak-collections throws on primitives, but should return false
		      , THROWS_ON_PRIMITIVES = fails(function(){ instance.has(1); })
		      // most early implementations doesn't supports iterables, most modern - not close it correctly
		      , ACCEPT_ITERABLES     = $iterDetect(function(iter){ new C(iter); }) // eslint-disable-line no-new
		      // for early implementations -0 and +0 not the same
		      , BUGGY_ZERO = !IS_WEAK && fails(function(){
		        // V8 ~ Chromium 42- fails only with 5+ elements
		        var $instance = new C()
		          , index     = 5;
		        while(index--)$instance[ADDER](index, index);
		        return !$instance.has(-0);
		      });
		    if(!ACCEPT_ITERABLES){ 
		      C = wrapper(function(target, iterable){
		        anInstance(target, C, NAME);
		        var that = inheritIfRequired(new Base, target, C);
		        if(iterable != undefined)forOf(iterable, IS_MAP, that[ADDER], that);
		        return that;
		      });
		      C.prototype = proto;
		      proto.constructor = C;
		    }
		    if(THROWS_ON_PRIMITIVES || BUGGY_ZERO){
		      fixMethod('delete');
		      fixMethod('has');
		      IS_MAP && fixMethod('get');
		    }
		    if(BUGGY_ZERO || HASNT_CHAINING)fixMethod(ADDER);
		    // weak collections should not contains .clear method
		    if(IS_WEAK && proto.clear)delete proto.clear;
		  }

		  setToStringTag(C, NAME);

		  O[NAME] = C;
		  $export($export.G + $export.W + $export.F * (C != Base), O);

		  if(!IS_WEAK)common.setStrong(C, NAME, IS_MAP);

		  return C;
		};

	/***/ },
	/* 105 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var hide     = __webpack_require__(25)
		  , redefine = __webpack_require__(28)
		  , fails    = __webpack_require__(9)
		  , defined  = __webpack_require__(37)
		  , wks      = __webpack_require__(13);

		module.exports = function(KEY, length, exec){
		  var SYMBOL   = wks(KEY)
		    , fns      = exec(defined, SYMBOL, ''[KEY])
		    , strfn    = fns[0]
		    , rxfn     = fns[1];
		  if(fails(function(){
		    var O = {};
		    O[SYMBOL] = function(){ return 7; };
		    return ''[KEY](O) != 7;
		  })){
		    redefine(String.prototype, KEY, strfn);
		    hide(RegExp.prototype, SYMBOL, length == 2
		      // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue)
		      // 21.2.5.11 RegExp.prototype[@@split](string, limit)
		      ? function(string, arg){ return rxfn.call(string, this, arg); }
		      // 21.2.5.6 RegExp.prototype[@@match](string)
		      // 21.2.5.9 RegExp.prototype[@@search](string)
		      : function(string){ return rxfn.call(string, this); }
		    );
		  }
		};

	/***/ },
	/* 106 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 21.2.5.3 get RegExp.prototype.flags
		var anObject = __webpack_require__(6);
		module.exports = function(){
		  var that   = anObject(this)
		    , result = '';
		  if(that.global)     result += 'g';
		  if(that.ignoreCase) result += 'i';
		  if(that.multiline)  result += 'm';
		  if(that.unicode)    result += 'u';
		  if(that.sticky)     result += 'y';
		  return result;
		};

	/***/ },
	/* 107 */
	/***/ function(module, exports) {

		// fast apply, http://jsperf.lnkit.com/fast-apply/5
		module.exports = function(fn, args, that){
		  var un = that === undefined;
		  switch(args.length){
		    case 0: return un ? fn()
		                      : fn.call(that);
		    case 1: return un ? fn(args[0])
		                      : fn.call(that, args[0]);
		    case 2: return un ? fn(args[0], args[1])
		                      : fn.call(that, args[0], args[1]);
		    case 3: return un ? fn(args[0], args[1], args[2])
		                      : fn.call(that, args[0], args[1], args[2]);
		    case 4: return un ? fn(args[0], args[1], args[2], args[3])
		                      : fn.call(that, args[0], args[1], args[2], args[3]);
		  } return              fn.apply(that, args);
		};

	/***/ },
	/* 108 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.2.8 IsRegExp(argument)
		var isObject = __webpack_require__(12)
		  , cof      = __webpack_require__(36)
		  , MATCH    = __webpack_require__(13)('match');
		module.exports = function(it){
		  var isRegExp;
		  return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : cof(it) == 'RegExp');
		};

	/***/ },
	/* 109 */
	/***/ function(module, exports, __webpack_require__) {

		var ITERATOR     = __webpack_require__(13)('iterator')
		  , SAFE_CLOSING = false;

		try {
		  var riter = [7][ITERATOR]();
		  riter['return'] = function(){ SAFE_CLOSING = true; };
		  Array.from(riter, function(){ throw 2; });
		} catch(e){ /* empty */ }

		module.exports = function(exec, skipClosing){
		  if(!skipClosing && !SAFE_CLOSING)return false;
		  var safe = false;
		  try {
		    var arr  = [7]
		      , iter = arr[ITERATOR]();
		    iter.next = function(){ return {done: safe = true}; };
		    arr[ITERATOR] = function(){ return iter; };
		    exec(arr);
		  } catch(e){ /* empty */ }
		  return safe;
		};

	/***/ },
	/* 110 */
	/***/ function(module, exports, __webpack_require__) {

		// Forced replacement prototype accessors methods
		module.exports = __webpack_require__(54)|| !__webpack_require__(9)(function(){
		  var K = Math.random();
		  // In FF throws only define methods
		  __defineSetter__.call(null, K, function(){ /* empty */});
		  delete __webpack_require__(8)[K];
		});

	/***/ },
	/* 111 */
	/***/ function(module, exports) {

		exports.f = Object.getOwnPropertySymbols;

	/***/ },
	/* 112 */
	/***/ function(module, exports, __webpack_require__) {

		// Works with __proto__ only. Old v8 can't work with null proto objects.
		/* eslint-disable no-proto */
		var isObject = __webpack_require__(12)
		  , anObject = __webpack_require__(6);
		var check = function(O, proto){
		  anObject(O);
		  if(!isObject(proto) && proto !== null)throw TypeError(proto + ": can't set as prototype!");
		};
		module.exports = {
		  set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line
		    function(test, buggy, set){
		      try {
		        set = __webpack_require__(44)(Function.call, __webpack_require__(32).f(Object.prototype, '__proto__').set, 2);
		        set(test, []);
		        buggy = !(test instanceof Array);
		      } catch(e){ buggy = true; }
		      return function setPrototypeOf(O, proto){
		        check(O, proto);
		        if(buggy)O.__proto__ = proto;
		        else set(O, proto);
		        return O;
		      };
		    }({}, false) : undefined),
		  check: check
		};

	/***/ },
	/* 113 */
	/***/ function(module, exports, __webpack_require__) {

		var global = __webpack_require__(8)
		  , SHARED = '__core-js_shared__'
		  , store  = global[SHARED] || (global[SHARED] = {});
		module.exports = function(key){
		  return store[key] || (store[key] = {});
		};

	/***/ },
	/* 114 */
	/***/ function(module, exports, __webpack_require__) {

		var global = __webpack_require__(8)
		  , hide   = __webpack_require__(25)
		  , uid    = __webpack_require__(61)
		  , TYPED  = uid('typed_array')
		  , VIEW   = uid('view')
		  , ABV    = !!(global.ArrayBuffer && global.DataView)
		  , CONSTR = ABV
		  , i = 0, l = 9, Typed;

		var TypedArrayConstructors = (
		  'Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array'
		).split(',');

		while(i < l){
		  if(Typed = global[TypedArrayConstructors[i++]]){
		    hide(Typed.prototype, TYPED, true);
		    hide(Typed.prototype, VIEW, true);
		  } else CONSTR = false;
		}

		module.exports = {
		  ABV:    ABV,
		  CONSTR: CONSTR,
		  TYPED:  TYPED,
		  VIEW:   VIEW
		};

	/***/ },
	/* 115 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var curve = exports;

		curve.base = __webpack_require__(605);
		curve.short = __webpack_require__(608);
		curve.mont = __webpack_require__(607);
		curve.edwards = __webpack_require__(606);


	/***/ },
	/* 116 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var md5 = __webpack_require__(237)
		module.exports = EVP_BytesToKey
		function EVP_BytesToKey (password, salt, keyLen, ivLen) {
		  if (!Buffer.isBuffer(password)) {
		    password = new Buffer(password, 'binary')
		  }
		  if (salt && !Buffer.isBuffer(salt)) {
		    salt = new Buffer(salt, 'binary')
		  }
		  keyLen = keyLen / 8
		  ivLen = ivLen || 0
		  var ki = 0
		  var ii = 0
		  var key = new Buffer(keyLen)
		  var iv = new Buffer(ivLen)
		  var addmd = 0
		  var md_buf
		  var i
		  var bufs = []
		  while (true) {
		    if (addmd++ > 0) {
		      bufs.push(md_buf)
		    }
		    bufs.push(password)
		    if (salt) {
		      bufs.push(salt)
		    }
		    md_buf = md5(Buffer.concat(bufs))
		    bufs = []
		    i = 0
		    if (keyLen > 0) {
		      while (true) {
		        if (keyLen === 0) {
		          break
		        }
		        if (i === md_buf.length) {
		          break
		        }
		        key[ki++] = md_buf[i]
		        keyLen--
		        i++
		      }
		    }
		    if (ivLen > 0 && i !== md_buf.length) {
		      while (true) {
		        if (ivLen === 0) {
		          break
		        }
		        if (i === md_buf.length) {
		          break
		        }
		        iv[ii++] = md_buf[i]
		        ivLen--
		        i++
		      }
		    }
		    if (keyLen === 0 && ivLen === 0) {
		      break
		    }
		  }
		  for (i = 0; i < md_buf.length; i++) {
		    md_buf[i] = 0
		  }
		  return {
		    key: key,
		    iv: iv
		  }
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 117 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var varint = __webpack_require__(652);

		var POOL_SIZE = 100000;
		var MINIMUM_POOL_LENGTH = 100;
		var pool = new Buffer(POOL_SIZE);

		exports.read = function(stream, cb) {
		  var msglen = 0;
		  var prev = null;
		  var lock = false;

		  var unlock = function() {
		    lock = false
		  };

		  var readable = function() {
		    if (lock) return;
		    lock = true;

		    if (!msglen) {
		      var buf = stream.read();
		      if (!buf) return unlock();
		      if (prev) {
		        buf = Buffer.concat([prev, buf]);
		        prev = null;
		      }

		      for (var i = 0; i < buf.length; i++) {
		        if (!(buf[i] & 0x80)) {
		          msglen = varint.decode(buf);
		          break;
		        }
		      }
		      if (!msglen) {
		        prev = buf;
		        return unlock();
		      }
		      buf = buf.slice(varint.decode.bytes);
		      stream.unshift(buf);
		    }

		    var chunk = stream.read(msglen);
		    if (!chunk) return unlock();

		    stream.removeListener('readable', readable);
		    cb(chunk)
		  };

		  stream.on('readable', readable);
		  readable();
		};

		exports.write = function(stream, msg) {
		  if (typeof msg === 'string') msg = new Buffer(msg);
		  varint.encode(msg.length, pool);
		  var lenBuf = pool.slice(0, varint.encode.bytes);
		  pool = pool.slice(varint.encode.bytes);
		  if (pool.length < MINIMUM_POOL_LENGTH) pool = new Buffer(POOL_SIZE);

		  stream.write(lenBuf);
		  stream.write(msg);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 118 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/**
		 * Slices the `collection` from the `start` index up to, but not including,
		 * the `end` index.
		 *
		 * Note: This function is used instead of `Array#slice` to support node lists
		 * in IE < 9 and to ensure dense arrays are returned.
		 *
		 * @private
		 * @param {Array|Object|string} collection The collection to slice.
		 * @param {number} start The start index.
		 * @param {number} end The end index.
		 * @returns {Array} Returns the new array.
		 */
		function slice(array, start, end) {
		  start || (start = 0);
		  if (typeof end == 'undefined') {
		    end = array ? array.length : 0;
		  }
		  var index = -1,
		      length = end - start || 0,
		      result = Array(length < 0 ? 0 : length);

		  while (++index < length) {
		    result[index] = array[start + index];
		  }
		  return result;
		}

		module.exports = slice;


	/***/ },
	/* 119 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var objectTypes = __webpack_require__(169);

		/**
		 * Checks if `value` is the language type of Object.
		 * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @category Objects
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if the `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(1);
		 * // => false
		 */
		function isObject(value) {
		  // check if the value is the ECMAScript language type of Object
		  // http://es5.github.io/#x8
		  // and avoid a V8 bug
		  // http://code.google.com/p/v8/issues/detail?id=2291
		  return !!(value && objectTypes[typeof value]);
		}

		module.exports = isObject;


	/***/ },
	/* 120 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var map = __webpack_require__(171);
		var extend = __webpack_require__(291);
		var codec = __webpack_require__(687);
		var protocols = __webpack_require__(173);
		var NotImplemented = new Error('Sorry, Not Implemented Yet.');
		var varint = __webpack_require__(93);

		exports = module.exports = Multiaddr;

		function Multiaddr(addr) {
		  if (!(this instanceof Multiaddr)) {
		    return new Multiaddr(addr);
		  }

		  // defaults
		  if (!addr) {
		    addr = '';
		  }

		  if (addr instanceof Buffer) {
		    this.buffer = codec.fromBuffer(addr);
		  } else if (typeof addr === 'string' || addr instanceof String) {
		    this.buffer = codec.fromString(addr);
		  } else if (addr.buffer && addr.protos && addr.protoCodes) {
		    // Multiaddr
		    this.buffer = codec.fromBuffer(addr.buffer); // validate + copy buffer
		  } else {
		      throw new Error('addr must be a string, Buffer, or another Multiaddr');
		    }
		}

		// get the multiaddr protocols
		Multiaddr.prototype.toString = function toString() {
		  return codec.bufferToString(this.buffer);
		};

		// get the multiaddr as a convinent options object to be dropped in net.createConnection
		Multiaddr.prototype.toOptions = function toOptions() {
		  var opts = {};
		  var parsed = this.toString().split('/');
		  opts.family = parsed[1] === 'ip4' ? 'ipv4' : 'ipv6';
		  opts.host = parsed[2];
		  opts.port = parsed[4];
		  return opts;
		};

		// get the multiaddr protocols
		Multiaddr.prototype.inspect = function inspect() {
		  return '<Multiaddr ' + this.buffer.toString('hex') + ' - ' + codec.bufferToString(this.buffer) + '>';
		};

		// get the multiaddr protocols
		Multiaddr.prototype.protos = function protos() {
		  return map(this.protoCodes(), function (code) {
		    return extend(protocols(code));
		    // copy to prevent users from modifying the internal objs.
		  });
		};

		// get the multiaddr protocol codes
		Multiaddr.prototype.protoCodes = function protoCodes() {
		  var codes = [];
		  var buf = this.buffer;
		  var i = 0;
		  while (i < buf.length) {
		    var code = varint.decode(buf, i);
		    var n = varint.decode.bytes;

		    var p = protocols(code);
		    var size = codec.sizeForAddr(p, buf.slice(i + n));

		    i += size + n;
		    codes.push(code);
		  }

		  return codes;
		};

		// get the multiaddr protocol string names
		Multiaddr.prototype.protoNames = function protoNames() {
		  return map(this.protos(), function (proto) {
		    return proto.name;
		  });
		};

		// Returns a tuple of parts:
		Multiaddr.prototype.tuples = function tuples() {
		  return codec.bufferToTuples(this.buffer);
		};

		// Returns a tuple of string parts:
		Multiaddr.prototype.stringTuples = function stringTuples() {
		  var t = codec.bufferToTuples(this.buffer);
		  return codec.tuplesToStringTuples(t);
		};

		Multiaddr.prototype.encapsulate = function encapsulate(addr) {
		  addr = Multiaddr(addr);
		  return Multiaddr(this.toString() + addr.toString());
		};

		Multiaddr.prototype.decapsulate = function decapsulate(addr) {
		  addr = addr.toString();
		  var s = this.toString();
		  var i = s.lastIndexOf(addr);
		  if (i < 0) {
		    throw new Error('Address ' + this + ' does not contain subaddress: ' + addr);
		  }
		  return Multiaddr(s.slice(0, i));
		};

		Multiaddr.prototype.equals = function equals(addr) {
		  return this.buffer.equals(addr.buffer);
		};

		// get a node friendly address object
		Multiaddr.prototype.nodeAddress = function nodeAddress() {
		  if (!this.isThinWaistAddress()) {
		    throw new Error('Multiaddr must be "thin waist" address for nodeAddress.');
		  }

		  var codes = this.protoCodes();
		  var parts = this.toString().split('/').slice(1);
		  return {
		    family: codes[0] === 41 ? 'IPv6' : 'IPv4',
		    address: parts[1], // ip addr
		    port: parts[3] // tcp or udp port
		  };
		};

		// from a node friendly address object
		Multiaddr.fromNodeAddress = function fromNodeAddress(addr, transport) {
		  if (!addr) throw new Error('requires node address object');
		  if (!transport) throw new Error('requires transport protocol');
		  var ip = addr.family === 'IPv6' ? 'ip6' : 'ip4';
		  return Multiaddr('/' + [ip, addr.address, transport, addr.port].join('/'));
		};

		// returns whether this address is a standard combination:
		// /{IPv4, IPv6}/{TCP, UDP}
		Multiaddr.prototype.isThinWaistAddress = function isThinWaistAddress(addr) {
		  var protos = (addr || this).protos();

		  if (protos.length !== 2) {
		    return false;
		  }

		  if (protos[0].code !== 4 && protos[0].code !== 41) {
		    return false;
		  }
		  if (protos[1].code !== 6 && protos[1].code !== 17) {
		    return false;
		  }
		  return true;
		};

		// parses the "stupid string" format:
		// <proto><IPv>://<IP Addr>[:<proto port>]
		// udp4://1.2.3.4:5678
		Multiaddr.prototype.fromStupidString = function fromStupidString(str) {
		  throw NotImplemented;
		};

		// patch this in
		Multiaddr.protocols = protocols;
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 121 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var bs58 = __webpack_require__(35);

		var cs = __webpack_require__(689);

		exports.toHexString = function toHexString(m) {
		  if (!Buffer.isBuffer(m)) {
		    throw new Error('must be passed a buffer');
		  }

		  return m.toString('hex');
		};

		exports.fromHexString = function fromHexString(s) {
		  return new Buffer(s, 'hex');
		};

		exports.toB58String = function toB58String(m) {
		  if (!Buffer.isBuffer(m)) {
		    throw new Error('must be passed a buffer');
		  }

		  return bs58.encode(m);
		};

		exports.fromB58String = function fromB58String(s) {
		  var encoded = s;
		  if (Buffer.isBuffer(s)) {
		    encoded = s.toString();
		  }

		  return new Buffer(bs58.decode(encoded));
		};

		// Decode a hash from the given Multihash.
		exports.decode = function decode(buf) {
		  exports.validate(buf);

		  var code = buf[0];

		  return {
		    code: code,
		    name: cs.codes[code],
		    length: buf[1],
		    digest: buf.slice(2)
		  };
		};

		// Encode a hash digest along with the specified function code.
		// Note: the length is derived from the length of the digest itself.
		exports.encode = function encode(digest, code, length) {
		  if (!digest || !code) {
		    throw new Error('multihash encode requires at least two args: digest, code');
		  }

		  // ensure it's a hashfunction code.
		  var hashfn = exports.coerceCode(code);

		  if (!Buffer.isBuffer(digest)) {
		    throw new Error('digest should be a Buffer');
		  }

		  if (length == null) {
		    length = digest.length;
		  }

		  if (length && digest.length !== length) {
		    throw new Error('digest length should be equal to specified length.');
		  }

		  if (length > 127) {
		    throw new Error('multihash does not yet support digest lengths greater than 127 bytes.');
		  }

		  return Buffer.concat([new Buffer([hashfn, length]), digest]);
		};

		// Converts a hashfn name into the matching code
		exports.coerceCode = function coerceCode(name) {
		  var code = name;

		  if (typeof name === 'string') {
		    if (!cs.names[name]) {
		      throw new Error('Unrecognized hash function named: ' + name);
		    }
		    code = cs.names[name];
		  }

		  if (typeof code !== 'number') {
		    throw new Error('Hash function code should be a number. Got: ' + code);
		  }

		  if (!cs.codes[code] && !exports.isAppCode(code)) {
		    throw new Error('Unrecognized function code: ' + code);
		  }

		  return code;
		};

		// Checks wether a code is part of the app range
		exports.isAppCode = function appCode(code) {
		  return code > 0 && code < 0x10;
		};

		// Checks whether a multihash code is valid.
		exports.isValidCode = function validCode(code) {
		  if (exports.isAppCode(code)) {
		    return true;
		  }

		  if (cs.codes[code]) {
		    return true;
		  }

		  return false;
		};

		exports.validate = function validate(multihash) {
		  if (!Buffer.isBuffer(multihash)) {
		    throw new Error('multihash must be a Buffer');
		  }

		  if (multihash.length < 3) {
		    throw new Error('multihash too short. must be > 3 bytes.');
		  }

		  if (multihash.length > 129) {
		    throw new Error('multihash too long. must be < 129 bytes.');
		  }

		  var code = multihash[0];

		  if (!exports.isValidCode(code)) {
		    throw new Error('multihash unknown function code: 0x' + code.toString(16));
		  }

		  if (multihash.slice(2).length !== multihash[1]) {
		    throw new Error('multihash length inconsistent: 0x' + multihash.toString('hex'));
		  }
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 122 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var multihash = __webpack_require__(121);
		var crypto = __webpack_require__(784);

		var mh = module.exports = Multihashing;

		mh.Buffer = Buffer; // for browser things

		function Multihashing(buf, func, length) {
		  return multihash.encode(mh.digest(buf, func, length), func, length);
		}

		// expose multihash itself, to avoid silly double requires.
		mh.multihash = multihash;

		mh.digest = function (buf, func, length) {
		  var digest = mh.createHash(func).update(buf).digest();

		  if (length) {
		    digest = digest.slice(0, length);
		  }

		  return digest;
		};

		mh.createHash = function (func, length) {
		  func = multihash.coerceCode(func);
		  if (!mh.functions[func]) {
		    throw new Error('multihash function ' + func + ' not yet supported');
		  }

		  return mh.functions[func]();
		};

		mh.functions = {
		  0x11: gsha1,
		  0x12: gsha2_256,
		  0x13: gsha2_512
		  // 0x14: gsha3 // not implemented yet
		  // 0x40: blake2b, // not implemented yet
		  // 0x41: blake2s, // not implemented yet
		};

		function gsha1() {
		  return crypto.createHash('sha1');
		}

		function gsha2_256() {
		  return crypto.createHash('sha256');
		}

		function gsha2_512() {
		  return crypto.createHash('sha512');
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 123 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = '/multistream/1.0.0';

	/***/ },
	/* 124 */
	/***/ function(module, exports, __webpack_require__) {

		var Buffer = __webpack_require__(0).Buffer;

		function OffsetBuffer() {
		  this.offset = 0;
		  this.size = 0;
		  this.buffers = [];
		}
		module.exports = OffsetBuffer;

		OffsetBuffer.prototype.isEmpty = function isEmpty() {
		  return this.size === 0;
		};

		OffsetBuffer.prototype.clone = function clone(size) {
		  var r = new OffsetBuffer();
		  r.offset = this.offset;
		  r.size = size;
		  r.buffers = this.buffers.slice();
		  return r;
		};

		OffsetBuffer.prototype.toChunks = function toChunks() {
		  if (this.size === 0)
		    return [];

		  // We are going to slice it anyway
		  if (this.offset !== 0) {
		    this.buffers[0] = this.buffers[0].slice(this.offset);
		    this.offset = 0;
		  }

		  var chunks = [ ];
		  var off = 0;
		  for (var i = 0; off <= this.size && i < this.buffers.length; i++) {
		    var buf = this.buffers[i];
		    off += buf.length;

		    // Slice off last buffer
		    if (off > this.size) {
		      buf = buf.slice(0, buf.length - (off - this.size));
		      this.buffers[i] = buf;
		    }

		    chunks.push(buf);
		  }

		  // If some buffers were skipped - trim length
		  if (i < this.buffers.length)
		    this.buffers.length = i;

		  return chunks;
		};

		OffsetBuffer.prototype.toString = function toString(enc) {
		  return this.toChunks().map(function(c) {
		    return c.toString(enc);
		  }).join('');
		};

		OffsetBuffer.prototype.use = function use(buf, off, n) {
		  this.buffers = [ buf ];
		  this.offset = off;
		  this.size = n;
		};

		OffsetBuffer.prototype.push = function push(data) {
		  // Ignore empty writes
		  if (data.length === 0)
		    return;

		  this.size += data.length;
		  this.buffers.push(data);
		};

		OffsetBuffer.prototype.has = function has(n) {
		  return this.size >= n;
		};

		OffsetBuffer.prototype.skip = function skip(n) {
		  if (this.size === 0)
		    return;

		  this.size -= n;

		  // Fast case, skip bytes in a first buffer
		  if (this.offset + n < this.buffers[0].length) {
		    this.offset += n;
		    return;
		  }

		  var left = n - (this.buffers[0].length - this.offset);
		  this.offset = 0;

		  for (var shift = 1; left > 0 && shift < this.buffers.length; shift++) {
		    var buf = this.buffers[shift];
		    if (buf.length > left) {
		      this.offset = left;
		      break;
		    }
		    left -= buf.length;
		  }
		  this.buffers = this.buffers.slice(shift);
		};

		OffsetBuffer.prototype.copy = function copy(target, targetOff, off, n) {
		  if (this.size === 0)
		    return;
		  if (off !== 0)
		    throw new Error('Unsupported offset in .copy()');

		  var toff = targetOff;
		  var first = this.buffers[0];
		  var toCopy = Math.min(n, first.length - this.offset);
		  first.copy(target, toff, this.offset, this.offset + toCopy);

		  toff += toCopy;
		  var left = n - toCopy;
		  for (var i = 1; left > 0 && i < this.buffers.length; i++) {
		    var buf = this.buffers[i];
		    var toCopy = Math.min(left, buf.length);

		    buf.copy(target, toff, 0, toCopy);

		    toff += toCopy;
		    left -= toCopy;
		  }
		};

		OffsetBuffer.prototype.take = function take(n) {
		  if (n === 0)
		    return new Buffer(0);

		  this.size -= n;

		  // Fast cases
		  var first = this.buffers[0].length - this.offset;
		  if (first === n) {
		    var r = this.buffers.shift();
		    if (this.offset !== 0) {
		      r = r.slice(this.offset);
		      this.offset = 0;
		    }
		    return r;
		  } else if (first > n) {
		    var r = this.buffers[0].slice(this.offset, this.offset + n);
		    this.offset += n;
		    return r;
		  }

		  // Allocate and fill buffer
		  var out = new Buffer(n);
		  var toOff = 0;
		  var startOff = this.offset;
		  for (var i = 0; toOff !== n && i < this.buffers.length; i++) {
		    var buf = this.buffers[i];
		    var toCopy = Math.min(buf.length - startOff, n - toOff);

		    buf.copy(out, toOff, startOff, startOff + toCopy);
		    if (startOff + toCopy < buf.length) {
		      this.offset = startOff + toCopy;
		      break;
		    } else {
		      toOff += toCopy;
		      startOff = 0;
		    }
		  }

		  this.buffers = this.buffers.slice(i);
		  if (this.buffers.length === 0)
		    this.offset = 0;

		  return out;
		};

		OffsetBuffer.prototype.peekUInt8 = function peekUInt8() {
		  return this.buffers[0][this.offset];
		};

		OffsetBuffer.prototype.readUInt8 = function readUInt8() {
		  this.size -= 1;
		  var first = this.buffers[0];
		  var r = first[this.offset];
		  if (++this.offset === first.length) {
		    this.offset = 0;
		    this.buffers.shift();
		  }

		  return r;
		};

		OffsetBuffer.prototype.readUInt16LE = function readUInt16LE() {
		  var first = this.buffers[0];
		  this.size -= 2;

		  var r;
		  var shift;

		  // Fast case - first buffer has all bytes
		  if (first.length - this.offset >= 2) {
		    r = first.readUInt16LE(this.offset, true);
		    shift = 0;
		    this.offset += 2;

		  // One byte here - one byte there
		  } else {
		    r = first[this.offset] | (this.buffers[1][0] << 8);
		    shift = 1;
		    this.offset = 1;
		  }

		  if (this.offset === this.buffers[shift].length) {
		    this.offset = 0;
		    shift++;
		  }
		  if (shift !== 0)
		    this.buffers = this.buffers.slice(shift);

		  return r;
		};

		OffsetBuffer.prototype.readUInt24LE = function readUInt24LE() {
		  var first = this.buffers[0];

		  var r;
		  var shift;
		  var firstHas = first.length - this.offset;

		  // Fast case - first buffer has all bytes
		  if (firstHas >= 3) {
		    r = first.readUInt16LE(this.offset, true) | (first[this.offset + 2] << 16);
		    shift = 0;
		    this.offset += 3;

		  // First buffer has 2 of 3 bytes
		  } else if (firstHas >= 2) {
		    r = first.readUInt16LE(this.offset, true) | (this.buffers[1][0] << 16);
		    shift = 1;
		    this.offset = 1;

		  // Slow case: First buffer has 1 of 3 bytes
		  } else {
		    r = first[this.offset];
		    this.offset = 0;
		    this.buffers.shift();
		    this.size -= 1;

		    r |= this.readUInt16LE() << 8;
		    return r;
		  }

		  this.size -= 3;
		  if (this.offset === this.buffers[shift].length) {
		    this.offset = 0;
		    shift++;
		  }
		  if (shift !== 0)
		    this.buffers = this.buffers.slice(shift);

		  return r;
		};

		OffsetBuffer.prototype.readUInt32LE = function readUInt32LE() {
		  var first = this.buffers[0];

		  var r;
		  var shift;
		  var firstHas = first.length - this.offset;

		  // Fast case - first buffer has all bytes
		  if (firstHas >= 4) {
		    r = first.readUInt32LE(this.offset, true);
		    shift = 0;
		    this.offset += 4;

		  // First buffer has 3 of 4 bytes
		  } else if (firstHas >= 3) {
		    r = (first.readUInt16LE(this.offset, true) |
		         (first[this.offset + 2] << 16)) +
		        (this.buffers[1][0] * 0x1000000);
		    shift = 1;
		    this.offset = 1;

		  // Slow case: First buffer has 2 of 4 bytes
		  } else if (firstHas >= 2) {
		    r = first.readUInt16LE(this.offset, true);
		    this.offset = 0;
		    this.buffers.shift();
		    this.size -= 2;

		    r += this.readUInt16LE() * 0x10000;
		    return r;

		  // Slow case: First buffer has 1 of 4 bytes
		  } else {
		    r = first[this.offset];
		    this.offset = 0;
		    this.buffers.shift();
		    this.size -= 1;

		    r += this.readUInt24LE() * 0x100;
		    return r;
		  }

		  this.size -= 4;
		  if (this.offset === this.buffers[shift].length) {
		    this.offset = 0;
		    shift++;
		  }
		  if (shift !== 0)
		    this.buffers = this.buffers.slice(shift);

		  return r;
		};

		OffsetBuffer.prototype.readUInt16BE = function readUInt16BE() {
		  var r = this.readUInt16LE();

		  return ((r & 0xff) << 8) | (r >> 8);
		};

		OffsetBuffer.prototype.readUInt24BE = function readUInt24BE() {
		  var r = this.readUInt24LE();

		  return ((r & 0xff) << 16) | (((r >> 8) & 0xff) << 8) | (r >> 16);
		};

		OffsetBuffer.prototype.readUInt32BE = function readUInt32BE() {
		  var r = this.readUInt32LE();

		  return (((r & 0xff) << 24) |
		          (((r >>> 8) & 0xff) << 16) |
		          (((r >>> 16) & 0xff) << 8) |
		          (r >>> 24)) >>> 0;
		};

		// Signed number APIs

		function signedInt8(num) {
		  if (num >= 0x80)
		    return -(0xff ^ num) - 1;
		  else
		    return num;
		}

		OffsetBuffer.prototype.peekInt8 = function peekInt8() {
		  return signedInt8(this.peekUInt8());
		};

		OffsetBuffer.prototype.readInt8 = function readInt8() {
		  return signedInt8(this.readUInt8());
		};

		function signedInt16(num) {
		  if (num >= 0x8000)
		    return -(0xffff ^ num) - 1;
		  else
		    return num;
		}

		OffsetBuffer.prototype.readInt16BE = function readInt16BE() {
		  return signedInt16(this.readUInt16BE());
		};

		OffsetBuffer.prototype.readInt16LE = function readInt16LE() {
		  return signedInt16(this.readUInt16LE());
		};

		function signedInt24(num) {
		  if (num >= 0x800000)
		    return -(0xffffff ^ num) - 1;
		  else
		    return num;
		}

		OffsetBuffer.prototype.readInt24BE = function readInt24BE() {
		  return signedInt24(this.readUInt24BE());
		};

		OffsetBuffer.prototype.readInt24LE = function readInt24LE() {
		  return signedInt24(this.readUInt24LE());
		};

		function signedInt32(num) {
		  if (num >= 0x80000000)
		    return -(0xffffffff ^ num) - 1;
		  else
		    return num;
		}

		OffsetBuffer.prototype.readInt32BE = function readInt32BE() {
		  return signedInt32(this.readUInt32BE());
		};

		OffsetBuffer.prototype.readInt32LE = function readInt32LE() {
		  return signedInt32(this.readUInt32LE());
		};


	/***/ },
	/* 125 */
	/***/ function(module, exports, __webpack_require__) {

		var wrappy = __webpack_require__(290)
		module.exports = wrappy(once)

		once.proto = once(function () {
		  Object.defineProperty(Function.prototype, 'once', {
		    value: function () {
		      return once(this)
		    },
		    configurable: true
		  })
		})

		function once (fn) {
		  var f = function () {
		    if (f.called) return f.value
		    f.called = true
		    return f.value = fn.apply(this, arguments)
		  }
		  f.called = false
		  return f
		}


	/***/ },
	/* 126 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';


		var TYPED_OK =  (typeof Uint8Array !== 'undefined') &&
		                (typeof Uint16Array !== 'undefined') &&
		                (typeof Int32Array !== 'undefined');


		exports.assign = function (obj /*from1, from2, from3, ...*/) {
		  var sources = Array.prototype.slice.call(arguments, 1);
		  while (sources.length) {
		    var source = sources.shift();
		    if (!source) { continue; }

		    if (typeof source !== 'object') {
		      throw new TypeError(source + 'must be non-object');
		    }

		    for (var p in source) {
		      if (source.hasOwnProperty(p)) {
		        obj[p] = source[p];
		      }
		    }
		  }

		  return obj;
		};


		// reduce buffer size, avoiding mem copy
		exports.shrinkBuf = function (buf, size) {
		  if (buf.length === size) { return buf; }
		  if (buf.subarray) { return buf.subarray(0, size); }
		  buf.length = size;
		  return buf;
		};


		var fnTyped = {
		  arraySet: function (dest, src, src_offs, len, dest_offs) {
		    if (src.subarray && dest.subarray) {
		      dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
		      return;
		    }
		    // Fallback to ordinary array
		    for (var i = 0; i < len; i++) {
		      dest[dest_offs + i] = src[src_offs + i];
		    }
		  },
		  // Join array of chunks to single array.
		  flattenChunks: function (chunks) {
		    var i, l, len, pos, chunk, result;

		    // calculate data length
		    len = 0;
		    for (i = 0, l = chunks.length; i < l; i++) {
		      len += chunks[i].length;
		    }

		    // join chunks
		    result = new Uint8Array(len);
		    pos = 0;
		    for (i = 0, l = chunks.length; i < l; i++) {
		      chunk = chunks[i];
		      result.set(chunk, pos);
		      pos += chunk.length;
		    }

		    return result;
		  }
		};

		var fnUntyped = {
		  arraySet: function (dest, src, src_offs, len, dest_offs) {
		    for (var i = 0; i < len; i++) {
		      dest[dest_offs + i] = src[src_offs + i];
		    }
		  },
		  // Join array of chunks to single array.
		  flattenChunks: function (chunks) {
		    return [].concat.apply([], chunks);
		  }
		};


		// Enable/Disable typed arrays use, for testing
		//
		exports.setTyped = function (on) {
		  if (on) {
		    exports.Buf8  = Uint8Array;
		    exports.Buf16 = Uint16Array;
		    exports.Buf32 = Int32Array;
		    exports.assign(exports, fnTyped);
		  } else {
		    exports.Buf8  = Array;
		    exports.Buf16 = Array;
		    exports.Buf32 = Array;
		    exports.assign(exports, fnUntyped);
		  }
		};

		exports.setTyped(TYPED_OK);


	/***/ },
	/* 127 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var asn1 = __webpack_require__(702)
		var aesid = __webpack_require__(297)
		var fixProc = __webpack_require__(703)
		var ciphers = __webpack_require__(134)
		var compat = __webpack_require__(267)
		module.exports = parseKeys

		function parseKeys (buffer) {
		  var password
		  if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) {
		    password = buffer.passphrase
		    buffer = buffer.key
		  }
		  if (typeof buffer === 'string') {
		    buffer = new Buffer(buffer)
		  }

		  var stripped = fixProc(buffer, password)

		  var type = stripped.tag
		  var data = stripped.data
		  var subtype, ndata
		  switch (type) {
		    case 'PUBLIC KEY':
		      ndata = asn1.PublicKey.decode(data, 'der')
		      subtype = ndata.algorithm.algorithm.join('.')
		      switch (subtype) {
		        case '1.2.840.113549.1.1.1':
		          return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der')
		        case '1.2.840.10045.2.1':
		          ndata.subjectPrivateKey = ndata.subjectPublicKey
		          return {
		            type: 'ec',
		            data: ndata
		          }
		        case '1.2.840.10040.4.1':
		          ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der')
		          return {
		            type: 'dsa',
		            data: ndata.algorithm.params
		          }
		        default: throw new Error('unknown key id ' + subtype)
		      }
		      throw new Error('unknown key type ' + type)
		    case 'ENCRYPTED PRIVATE KEY':
		      data = asn1.EncryptedPrivateKey.decode(data, 'der')
		      data = decrypt(data, password)
		      // falls through
		    case 'PRIVATE KEY':
		      ndata = asn1.PrivateKey.decode(data, 'der')
		      subtype = ndata.algorithm.algorithm.join('.')
		      switch (subtype) {
		        case '1.2.840.113549.1.1.1':
		          return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der')
		        case '1.2.840.10045.2.1':
		          return {
		            curve: ndata.algorithm.curve,
		            privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey
		          }
		        case '1.2.840.10040.4.1':
		          ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der')
		          return {
		            type: 'dsa',
		            params: ndata.algorithm.params
		          }
		        default: throw new Error('unknown key id ' + subtype)
		      }
		      throw new Error('unknown key type ' + type)
		    case 'RSA PUBLIC KEY':
		      return asn1.RSAPublicKey.decode(data, 'der')
		    case 'RSA PRIVATE KEY':
		      return asn1.RSAPrivateKey.decode(data, 'der')
		    case 'DSA PRIVATE KEY':
		      return {
		        type: 'dsa',
		        params: asn1.DSAPrivateKey.decode(data, 'der')
		      }
		    case 'EC PRIVATE KEY':
		      data = asn1.ECPrivateKey.decode(data, 'der')
		      return {
		        curve: data.parameters.value,
		        privateKey: data.privateKey
		      }
		    default: throw new Error('unknown key type ' + type)
		  }
		}
		parseKeys.signature = asn1.signature
		function decrypt (data, password) {
		  var salt = data.algorithm.decrypt.kde.kdeparams.salt
		  var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10)
		  var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]
		  var iv = data.algorithm.decrypt.cipher.iv
		  var cipherText = data.subjectPrivateKey
		  var keylen = parseInt(algo.split('-')[1], 10) / 8
		  var key = compat.pbkdf2Sync(password, salt, iters, keylen)
		  var cipher = ciphers.createDecipheriv(algo, key, iv)
		  var out = []
		  out.push(cipher.update(cipherText))
		  out.push(cipher.final())
		  return Buffer.concat(out)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 128 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Id = __webpack_require__(89);

		exports = module.exports = Peer;

		// Peer represents a peer on the IPFS network
		function Peer(peerId) {
		  var _this = this;

		  if (!(this instanceof Peer)) {
		    return new Peer(peerId);
		  }

		  if (!peerId) {
		    this.id = Id.create();
		  } else {
		    this.id = peerId;
		  }

		  this.multiaddrs = [];
		  var observedMultiaddrs = [];

		  this.multiaddr = {};

		  this.multiaddr.add = function (multiaddr) {
		    var exists = false;
		    _this.multiaddrs.some(function (m, i) {
		      if (m.toString() === multiaddr.toString()) {
		        exists = true;
		        return true;
		      }
		    });
		    if (!exists) {
		      _this.multiaddrs.push(multiaddr);
		    }
		  };

		  // to prevent multiaddr explosion
		  this.multiaddr.addSafe = function (multiaddr) {
		    var check = false;
		    observedMultiaddrs.some(function (m, i) {
		      if (m.toString() === multiaddr.toString()) {
		        _this.multiaddr.add(multiaddr);
		        observedMultiaddrs.splice(i, 1);
		        check = true;
		      }
		    });
		    if (!check) {
		      observedMultiaddrs.push(multiaddr);
		    }
		  };

		  this.multiaddr.rm = function (multiaddr) {
		    _this.multiaddrs.some(function (m, i) {
		      if (m.toString() === multiaddr.toString()) {
		        _this.multiaddrs.splice(i, 1);
		        return true;
		      }
		    });
		  };

		  this.multiaddr.replace = function (existing, fresh) {
		    if (!Array.isArray(existing)) {
		      existing = [existing];
		    }
		    if (!Array.isArray(fresh)) {
		      fresh = [fresh];
		    }
		    existing.forEach(function (m) {
		      _this.multiaddr.rm(m);
		    });
		    fresh.forEach(function (m) {
		      _this.multiaddr.add(m);
		    });
		  };

		  // TODO: add features to fetch multiaddr using filters
		  // look at https://github.com/whyrusleeping/js-mafmt/blob/master/src/index.js
		}

	/***/ },
	/* 129 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.name = 'h2';

		exports.constants = __webpack_require__(756);
		exports.parser = __webpack_require__(759);
		exports.framer = __webpack_require__(757);
		exports.compressionPool = __webpack_require__(758);


	/***/ },
	/* 130 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.DAGNode = __webpack_require__(189);
		exports.DAGLink = __webpack_require__(188);
		exports.DAGService = __webpack_require__(320);
		exports.Batch = __webpack_require__(319);
		exports.util = __webpack_require__(190);

	/***/ },
	/* 131 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.importer = exports.Importer = __webpack_require__(329);
		exports.exporter = exports.Exporter = __webpack_require__(328);

	/***/ },
	/* 132 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var util = __webpack_require__(192);
		var protobuf = __webpack_require__(90);
		var stable = __webpack_require__(287);
		var bs58 = __webpack_require__(35);

		var schema = 'message PBLink {optional bytes Hash = 1; optional string Name = 2;optional uint64 Tsize = 3;} message PBNode {repeated PBLink Links = 2; optional bytes Data = 1;}';

		var mdagpb = protobuf(schema);

		exports = module.exports = {
		  DAGLink: DAGLink,
		  DAGNode: DAGNode
		};

		function DAGNode(data, links) {
		  var _this = this;

		  var cached;
		  var encoded;

		  this.data = data;
		  this.links = links || [];

		  function linkSort(a, b) {
		    return new Buffer(a.name, 'ascii').compare(new Buffer(b.name, 'ascii'));
		  }

		  // copy - returns a clone of the DAGNode
		  this.copy = function () {
		    var clone = new DAGNode();
		    if (_this.data && _this.data.length > 0) {
		      var buf = new Buffer(_this.data.length);
		      _this.data.copy(buf);
		      clone.data = buf;
		    }

		    if (_this.links.length > 0) {
		      clone.links = links.slice();
		    }

		    return clone;
		  };

		  // addNodeLink - adds a DAGLink to this node that points to node by a name
		  this.addNodeLink = function (name, node) {
		    if (typeof name !== 'string') {
		      return;
		    }
		    var link = _this.makeLink(node);

		    link.name = name;
		    _this.addRawLink(link);
		  };

		  // addRawLink adds a Link to this node from a DAGLink
		  this.addRawLink = function (link) {
		    encoded = null;
		    _this.links.push(new DAGLink(link.name, link.size, link.hash));
		    stable.inplace(_this.links, linkSort);
		  };

		  // UpdateNodeLink return a copy of the node with the link name set to point to
		  // that. If a link of the same name existed, it is replaced.
		  // TODO this would make more sense as an utility
		  this.updateNodeLink = function (name, node) {
		    var newnode = _this.copy();
		    newnode.removeNodeLink(name);
		    newnode.addNodeLink(name, node);
		    return newnode;
		  };

		  // removeNodeLink removes a Link from this node based on name
		  this.removeNodeLink = function (name) {
		    encoded = null; // uncache
		    _this.links = _this.links.filter(function (link) {
		      if (link.name === name) {
		        return false;
		      } else {
		        return true;
		      }
		    });
		  };
		  // removeNodeLink removes a Link from this node based on a multihash
		  this.removeNodeLinkByHash = function (multihash) {
		    encoded = null; // uncache
		    _this.links = _this.links.filter(function (link) {
		      if (link.hash.equals(multihash)) {
		        return false;
		      } else {
		        return true;
		      }
		    });
		  };

		  // removeNodeLink removes a Link from this node based on name
		  this.removeNodeLink = function (name) {
		    encoded = null; // uncache
		    _this.links = _this.links.filter(function (link) {
		      if (link.name === name) {
		        return false;
		      } else {
		        return true;
		      }
		    });
		  };

		  // makeLink returns a DAGLink node from a DAGNode
		  // TODO: this would make more sense as an utility
		  this.makeLink = function (node) {
		    var size = node.size();
		    var mh = node.multihash();
		    return new DAGLink(null, size, mh);
		  };

		  // multihash - returns the multihash value of this DAGNode
		  this.multihash = function () {
		    _this.encoded();
		    return cached;
		  };

		  // Size returns the total size of the data addressed by node,
		  // including the total sizes of references.
		  this.size = function () {
		    var buf = _this.encoded();
		    if (!buf) {
		      return 0;
		    }
		    var size = buf.length;
		    for (var i = 0; i < _this.links.length; i++) {
		      size += _this.links[i].size;
		    }
		    return size;
		  };

		  // Encoded returns the encoded raw data version of a Node instance.
		  // It may use a cached encoded version, unless the force flag is given.
		  this.encoded = function (force) {
		    if (force || !encoded) {
		      encoded = _this.marshal();

		      if (encoded) {
		        cached = util.hash(encoded);
		      }
		    }
		    return encoded;
		  };

		  // marshal - encodes the DAGNode into a probuf
		  this.marshal = function () {
		    var pbn = toProtoBuf(_this);
		    var data = mdagpb.PBNode.encode(pbn);
		    return data;
		  };

		  // unMarshal - decodes a protobuf into a DAGNode
		  // TODO: this would make more sense as an utility
		  this.unMarshal = function (data) {
		    var pbn = mdagpb.PBNode.decode(data);
		    this.links = [];
		    for (var i = 0; i < pbn.Links.length; i++) {
		      var link = pbn.Links[i];
		      var lnk = new DAGLink(link.Name, link.Tsize, link.Hash);
		      this.links.push(lnk);
		    }
		    stable.inplace(this.links, linkSort);
		    this.data = pbn.Data || new Buffer(0);
		    return this;
		  };

		  // Helper method to get a protobuf object equivalent
		  function toProtoBuf(node) {
		    var pbn = {};

		    if (node.data && node.data.length > 0) {
		      pbn.Data = node.data;
		    } else {
		      pbn.Data = null; // new Buffer(0)
		    }

		    if (node.links.length > 0) {
		      pbn.Links = [];

		      for (var i = 0; i < node.links.length; i++) {
		        var link = node.links[i];
		        pbn.Links.push({
		          Hash: link.hash,
		          Name: link.name,
		          Tsize: link.size
		        });
		      }
		    } else {
		      pbn.Links = null;
		    }

		    return pbn;
		  }

		  this.toJSON = function () {
		    return {
		      Data: _this.data,
		      Links: _this.links.map(function (l) {
		        return l.toJSON();
		      }),
		      Hash: bs58.encode(_this.multihash()).toString(),
		      Size: _this.size()
		    };
		  };
		}

		// Link represents an IPFS Merkle DAG Link between Nodes.
		function DAGLink(name, size, hash) {
		  var _this2 = this;

		  this.name = name;
		  this.size = size;
		  this.hash = hash;

		  this.toJSON = function () {
		    return {
		      Name: _this2.name,
		      Size: _this2.size,
		      Hash: bs58.encode(_this2.hash).toString()
		    };
		  };
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 133 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';


		var path = __webpack_require__(31);
		var protobuf = __webpack_require__(90);
		var schema = Buffer("bWVzc2FnZSBEYXRhIHsKCWVudW0gRGF0YVR5cGUgewoJCVJhdyA9IDA7CgkJRGlyZWN0b3J5ID0gMTsKCQlGaWxlID0gMjsKCQlNZXRhZGF0YSA9IDM7CgkJU3ltbGluayA9IDQ7Cgl9CgoJcmVxdWlyZWQgRGF0YVR5cGUgVHlwZSA9IDE7CglvcHRpb25hbCBieXRlcyBEYXRhID0gMjsKCW9wdGlvbmFsIHVpbnQ2NCBmaWxlc2l6ZSA9IDM7CglyZXBlYXRlZCB1aW50NjQgYmxvY2tzaXplcyA9IDQ7Cn0KCm1lc3NhZ2UgTWV0YWRhdGEgewoJcmVxdWlyZWQgc3RyaW5nIE1pbWVUeXBlID0gMTsKfQo=","base64");
		var pb = protobuf(schema);
		// encode/decode
		var unixfsData = pb.Data;
		// const unixfsMetadata = pb.MetaData // encode/decode

		var types = ['raw', 'directory', 'file', 'metadata', 'symlink'];

		function Data(type, data) {
		  var _this = this;

		  if (!(this instanceof Data)) {
		    return new Data(type, data);
		  }
		  if (types.indexOf(type) === -1) {
		    throw new Error('Type: ' + type + ' is not valid');
		  }

		  this.type = type;
		  this.data = data;
		  this.blockSizes = [];

		  this.addBlockSize = function (size) {
		    _this.blockSizes.push(size);
		  };

		  this.removeBlockSize = function (index) {
		    _this.blockSizes.splice(index, 1);
		  };

		  // data.length + blockSizes
		  this.fileSize = function () {
		    var sum = 0;
		    _this.blockSizes.forEach(function (size) {
		      sum += size;
		    });
		    if (data) {
		      sum += data.length;
		    }
		    return sum;
		  };

		  // encode to protobuf
		  this.marshal = function () {
		    var type = void 0;

		    switch (_this.type) {
		      case 'raw':
		        type = unixfsData.DataType.Raw;break;
		      case 'directory':
		        type = unixfsData.DataType.Directory;break;
		      case 'file':
		        type = unixfsData.DataType.File;break;
		      case 'metadata':
		        type = unixfsData.DataType.Metadata;break;
		      case 'symlink':
		        type = unixfsData.DataType.Symlink;break;
		      default:
		        throw new Error('Unkown type: "' + _this.type + '"');
		    }
		    var fileSize = _this.fileSize();

		    if (fileSize === 0) {
		      fileSize = undefined;
		    }

		    return unixfsData.encode({
		      Type: type,
		      Data: _this.data,
		      filesize: fileSize,
		      blocksizes: _this.blockSizes.length > 0 ? _this.blockSizes : undefined
		    });
		  };
		}

		// decode from protobuf https://github.com/ipfs/go-ipfs/blob/master/unixfs/format.go#L24
		Data.unmarshal = function (marsheled) {
		  var decoded = unixfsData.decode(marsheled);
		  if (!decoded.Data) {
		    decoded.Data = undefined;
		  }
		  var obj = new Data(types[decoded.Type], decoded.Data);
		  obj.blockSizes = decoded.blocksizes;
		  return obj;
		};

		exports = module.exports = Data;
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 134 */
	/***/ function(module, exports, __webpack_require__) {

		var ciphers = __webpack_require__(368)
		exports.createCipher = exports.Cipher = ciphers.createCipher
		exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv
		var deciphers = __webpack_require__(367)
		exports.createDecipher = exports.Decipher = deciphers.createDecipher
		exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv
		var modes = __webpack_require__(100)
		function getCiphers () {
		  return Object.keys(modes)
		}
		exports.listCiphers = exports.getCiphers = getCiphers


	/***/ },
	/* 135 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var bn = __webpack_require__(19);
		var randomBytes = __webpack_require__(91);
		module.exports = crt;
		function blind(priv) {
		  var r = getr(priv);
		  var blinder = r.toRed(bn.mont(priv.modulus))
		  .redPow(new bn(priv.publicExponent)).fromRed();
		  return {
		    blinder: blinder,
		    unblinder:r.invm(priv.modulus)
		  };
		}
		function crt(msg, priv) {
		  var blinds = blind(priv);
		  var len = priv.modulus.byteLength();
		  var mod = bn.mont(priv.modulus);
		  var blinded = new bn(msg).mul(blinds.blinder).umod(priv.modulus);
		  var c1 = blinded.toRed(bn.mont(priv.prime1));
		  var c2 = blinded.toRed(bn.mont(priv.prime2));
		  var qinv = priv.coefficient;
		  var p = priv.prime1;
		  var q = priv.prime2;
		  var m1 = c1.redPow(priv.exponent1);
		  var m2 = c2.redPow(priv.exponent2);
		  m1 = m1.fromRed();
		  m2 = m2.fromRed();
		  var h = m1.isub(m2).imul(qinv).umod(p);
		  h.imul(q);
		  m2.iadd(h);
		  return new Buffer(m2.imul(blinds.unblinder).umod(priv.modulus).toArray(false, len));
		}
		crt.getr = getr;
		function getr(priv) {
		  var len = priv.modulus.byteLength();
		  var r = new bn(randomBytes(len));
		  while (r.cmp(priv.modulus) >=  0 || !r.umod(priv.prime1) || !r.umod(priv.prime2)) {
		    r = new bn(randomBytes(len));
		  }
		  return r;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 136 */
	/***/ function(module, exports, __webpack_require__) {

		// Thank's IE8 for his funny defineProperty
		module.exports = !__webpack_require__(137)(function(){
		  return Object.defineProperty({}, 'a', {get: function(){ return 7; }}).a != 7;
		});

	/***/ },
	/* 137 */
	/***/ function(module, exports) {

		module.exports = function(exec){
		  try {
		    return !!exec();
		  } catch(e){
		    return true;
		  }
		};

	/***/ },
	/* 138 */
	/***/ function(module, exports) {

		// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028
		var global = module.exports = typeof window != 'undefined' && window.Math == Math
		  ? window : typeof self != 'undefined' && self.Math == Math ? self : Function('return this')();
		if(typeof __g == 'number')__g = global; // eslint-disable-line no-undef

	/***/ },
	/* 139 */
	/***/ function(module, exports) {

		module.exports = function(it){
		  return typeof it === 'object' ? it !== null : typeof it === 'function';
		};

	/***/ },
	/* 140 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)
		'use strict';
		var toObject = __webpack_require__(22)
		  , toIndex  = __webpack_require__(60)
		  , toLength = __webpack_require__(20);
		module.exports = function fill(value /*, start = 0, end = @length */){
		  var O      = toObject(this)
		    , length = toLength(O.length)
		    , aLen   = arguments.length
		    , index  = toIndex(aLen > 1 ? arguments[1] : undefined, length)
		    , end    = aLen > 2 ? arguments[2] : undefined
		    , endPos = end === undefined ? length : toIndex(end, length);
		  while(endPos > index)O[index++] = value;
		  return O;
		};

	/***/ },
	/* 141 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $defineProperty = __webpack_require__(16)
		  , createDesc      = __webpack_require__(51);

		module.exports = function(object, index, value){
		  if(index in object)$defineProperty.f(object, index, createDesc(0, value));
		  else object[index] = value;
		};

	/***/ },
	/* 142 */
	/***/ function(module, exports, __webpack_require__) {

		var isObject = __webpack_require__(12)
		  , document = __webpack_require__(8).document
		  // in old IE typeof document.createElement is 'object'
		  , is = isObject(document) && isObject(document.createElement);
		module.exports = function(it){
		  return is ? document.createElement(it) : {};
		};

	/***/ },
	/* 143 */
	/***/ function(module, exports) {

		// IE 8- don't enum bug keys
		module.exports = (
		  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'
		).split(',');

	/***/ },
	/* 144 */
	/***/ function(module, exports, __webpack_require__) {

		var MATCH = __webpack_require__(13)('match');
		module.exports = function(KEY){
		  var re = /./;
		  try {
		    '/./'[KEY](re);
		  } catch(e){
		    try {
		      re[MATCH] = false;
		      return !'/./'[KEY](re);
		    } catch(f){ /* empty */ }
		  } return true;
		};

	/***/ },
	/* 145 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(8).document && document.documentElement;

	/***/ },
	/* 146 */
	/***/ function(module, exports, __webpack_require__) {

		var isObject       = __webpack_require__(12)
		  , setPrototypeOf = __webpack_require__(112).set;
		module.exports = function(that, target, C){
		  var P, S = target.constructor;
		  if(S !== C && typeof S == 'function' && (P = S.prototype) !== C.prototype && isObject(P) && setPrototypeOf){
		    setPrototypeOf(that, P);
		  } return that;
		};

	/***/ },
	/* 147 */
	/***/ function(module, exports, __webpack_require__) {

		// check on default Array iterator
		var Iterators  = __webpack_require__(53)
		  , ITERATOR   = __webpack_require__(13)('iterator')
		  , ArrayProto = Array.prototype;

		module.exports = function(it){
		  return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);
		};

	/***/ },
	/* 148 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.2.2 IsArray(argument)
		var cof = __webpack_require__(36);
		module.exports = Array.isArray || function isArray(arg){
		  return cof(arg) == 'Array';
		};

	/***/ },
	/* 149 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.3 Number.isInteger(number)
		var isObject = __webpack_require__(12)
		  , floor    = Math.floor;
		module.exports = function isInteger(it){
		  return !isObject(it) && isFinite(it) && floor(it) === it;
		};

	/***/ },
	/* 150 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var create         = __webpack_require__(55)
		  , descriptor     = __webpack_require__(51)
		  , setToStringTag = __webpack_require__(70)
		  , IteratorPrototype = {};

		// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()
		__webpack_require__(25)(IteratorPrototype, __webpack_require__(13)('iterator'), function(){ return this; });

		module.exports = function(Constructor, NAME, next){
		  Constructor.prototype = create(IteratorPrototype, {next: descriptor(1, next)});
		  setToStringTag(Constructor, NAME + ' Iterator');
		};

	/***/ },
	/* 151 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var LIBRARY        = __webpack_require__(54)
		  , $export        = __webpack_require__(1)
		  , redefine       = __webpack_require__(28)
		  , hide           = __webpack_require__(25)
		  , has            = __webpack_require__(23)
		  , Iterators      = __webpack_require__(53)
		  , $iterCreate    = __webpack_require__(150)
		  , setToStringTag = __webpack_require__(70)
		  , getPrototypeOf = __webpack_require__(33)
		  , ITERATOR       = __webpack_require__(13)('iterator')
		  , BUGGY          = !([].keys && 'next' in [].keys()) // Safari has buggy iterators w/o `next`
		  , FF_ITERATOR    = '@@iterator'
		  , KEYS           = 'keys'
		  , VALUES         = 'values';

		var returnThis = function(){ return this; };

		module.exports = function(Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED){
		  $iterCreate(Constructor, NAME, next);
		  var getMethod = function(kind){
		    if(!BUGGY && kind in proto)return proto[kind];
		    switch(kind){
		      case KEYS: return function keys(){ return new Constructor(this, kind); };
		      case VALUES: return function values(){ return new Constructor(this, kind); };
		    } return function entries(){ return new Constructor(this, kind); };
		  };
		  var TAG        = NAME + ' Iterator'
		    , DEF_VALUES = DEFAULT == VALUES
		    , VALUES_BUG = false
		    , proto      = Base.prototype
		    , $native    = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT]
		    , $default   = $native || getMethod(DEFAULT)
		    , $entries   = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined
		    , $anyNative = NAME == 'Array' ? proto.entries || $native : $native
		    , methods, key, IteratorPrototype;
		  // Fix native
		  if($anyNative){
		    IteratorPrototype = getPrototypeOf($anyNative.call(new Base));
		    if(IteratorPrototype !== Object.prototype){
		      // Set @@toStringTag to native iterators
		      setToStringTag(IteratorPrototype, TAG, true);
		      // fix for some old engines
		      if(!LIBRARY && !has(IteratorPrototype, ITERATOR))hide(IteratorPrototype, ITERATOR, returnThis);
		    }
		  }
		  // fix Array#{values, @@iterator}.name in V8 / FF
		  if(DEF_VALUES && $native && $native.name !== VALUES){
		    VALUES_BUG = true;
		    $default = function values(){ return $native.call(this); };
		  }
		  // Define iterator
		  if((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])){
		    hide(proto, ITERATOR, $default);
		  }
		  // Plug for library
		  Iterators[NAME] = $default;
		  Iterators[TAG]  = returnThis;
		  if(DEFAULT){
		    methods = {
		      values:  DEF_VALUES ? $default : getMethod(VALUES),
		      keys:    IS_SET     ? $default : getMethod(KEYS),
		      entries: $entries
		    };
		    if(FORCED)for(key in methods){
		      if(!(key in proto))redefine(proto, key, methods[key]);
		    } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);
		  }
		  return methods;
		};

	/***/ },
	/* 152 */
	/***/ function(module, exports) {

		// 20.2.2.14 Math.expm1(x)
		var $expm1 = Math.expm1;
		module.exports = (!$expm1
		  // Old FF bug
		  || $expm1(10) > 22025.465794806719 || $expm1(10) < 22025.4657948067165168
		  // Tor Browser bug
		  || $expm1(-2e-17) != -2e-17
		) ? function expm1(x){
		  return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : Math.exp(x) - 1;
		} : $expm1;

	/***/ },
	/* 153 */
	/***/ function(module, exports) {

		// 20.2.2.28 Math.sign(x)
		module.exports = Math.sign || function sign(x){
		  return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1;
		};

	/***/ },
	/* 154 */
	/***/ function(module, exports, __webpack_require__) {

		var global    = __webpack_require__(8)
		  , macrotask = __webpack_require__(161).set
		  , Observer  = global.MutationObserver || global.WebKitMutationObserver
		  , process   = global.process
		  , Promise   = global.Promise
		  , isNode    = __webpack_require__(36)(process) == 'process';

		module.exports = function(){
		  var head, last, notify;

		  var flush = function(){
		    var parent, fn;
		    if(isNode && (parent = process.domain))parent.exit();
		    while(head){
		      fn   = head.fn;
		      head = head.next;
		      try {
		        fn();
		      } catch(e){
		        if(head)notify();
		        else last = undefined;
		        throw e;
		      }
		    } last = undefined;
		    if(parent)parent.enter();
		  };

		  // Node.js
		  if(isNode){
		    notify = function(){
		      process.nextTick(flush);
		    };
		  // browsers with MutationObserver
		  } else if(Observer){
		    var toggle = true
		      , node   = document.createTextNode('');
		    new Observer(flush).observe(node, {characterData: true}); // eslint-disable-line no-new
		    notify = function(){
		      node.data = toggle = !toggle;
		    };
		  // environments with maybe non-completely correct, but existent Promise
		  } else if(Promise && Promise.resolve){
		    var promise = Promise.resolve();
		    notify = function(){
		      promise.then(flush);
		    };
		  // for other environments - macrotask based on:
		  // - setImmediate
		  // - MessageChannel
		  // - window.postMessag
		  // - onreadystatechange
		  // - setTimeout
		  } else {
		    notify = function(){
		      // strange IE + webpack dev server bug - use .call(global)
		      macrotask.call(global, flush);
		    };
		  }

		  return function(fn){
		    var task = {fn: fn, next: undefined};
		    if(last)last.next = task;
		    if(!head){
		      head = task;
		      notify();
		    } last = task;
		  };
		};

	/***/ },
	/* 155 */
	/***/ function(module, exports, __webpack_require__) {

		var shared = __webpack_require__(113)('keys')
		  , uid    = __webpack_require__(61);
		module.exports = function(key){
		  return shared[key] || (shared[key] = uid(key));
		};

	/***/ },
	/* 156 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.3.20 SpeciesConstructor(O, defaultConstructor)
		var anObject  = __webpack_require__(6)
		  , aFunction = __webpack_require__(27)
		  , SPECIES   = __webpack_require__(13)('species');
		module.exports = function(O, D){
		  var C = anObject(O).constructor, S;
		  return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? D : aFunction(S);
		};

	/***/ },
	/* 157 */
	/***/ function(module, exports, __webpack_require__) {

		var toInteger = __webpack_require__(52)
		  , defined   = __webpack_require__(37);
		// true  -> String#at
		// false -> String#codePointAt
		module.exports = function(TO_STRING){
		  return function(that, pos){
		    var s = String(defined(that))
		      , i = toInteger(pos)
		      , l = s.length
		      , a, b;
		    if(i < 0 || i >= l)return TO_STRING ? '' : undefined;
		    a = s.charCodeAt(i);
		    return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff
		      ? TO_STRING ? s.charAt(i) : a
		      : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;
		  };
		};

	/***/ },
	/* 158 */
	/***/ function(module, exports, __webpack_require__) {

		// helper for String#{startsWith, endsWith, includes}
		var isRegExp = __webpack_require__(108)
		  , defined  = __webpack_require__(37);

		module.exports = function(that, searchString, NAME){
		  if(isRegExp(searchString))throw TypeError('String#' + NAME + " doesn't accept regex!");
		  return String(defined(that));
		};

	/***/ },
	/* 159 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var toInteger = __webpack_require__(52)
		  , defined   = __webpack_require__(37);

		module.exports = function repeat(count){
		  var str = String(defined(this))
		    , res = ''
		    , n   = toInteger(count);
		  if(n < 0 || n == Infinity)throw RangeError("Count can't be negative");
		  for(;n > 0; (n >>>= 1) && (str += str))if(n & 1)res += str;
		  return res;
		};

	/***/ },
	/* 160 */
	/***/ function(module, exports) {

		module.exports = '\x09\x0A\x0B\x0C\x0D\x20\xA0\u1680\u180E\u2000\u2001\u2002\u2003' +
		  '\u2004\u2005\u2006\u2007\u2008\u2009\u200A\u202F\u205F\u3000\u2028\u2029\uFEFF';

	/***/ },
	/* 161 */
	/***/ function(module, exports, __webpack_require__) {

		var ctx                = __webpack_require__(44)
		  , invoke             = __webpack_require__(107)
		  , html               = __webpack_require__(145)
		  , cel                = __webpack_require__(142)
		  , global             = __webpack_require__(8)
		  , process            = global.process
		  , setTask            = global.setImmediate
		  , clearTask          = global.clearImmediate
		  , MessageChannel     = global.MessageChannel
		  , counter            = 0
		  , queue              = {}
		  , ONREADYSTATECHANGE = 'onreadystatechange'
		  , defer, channel, port;
		var run = function(){
		  var id = +this;
		  if(queue.hasOwnProperty(id)){
		    var fn = queue[id];
		    delete queue[id];
		    fn();
		  }
		};
		var listener = function(event){
		  run.call(event.data);
		};
		// Node.js 0.9+ & IE10+ has setImmediate, otherwise:
		if(!setTask || !clearTask){
		  setTask = function setImmediate(fn){
		    var args = [], i = 1;
		    while(arguments.length > i)args.push(arguments[i++]);
		    queue[++counter] = function(){
		      invoke(typeof fn == 'function' ? fn : Function(fn), args);
		    };
		    defer(counter);
		    return counter;
		  };
		  clearTask = function clearImmediate(id){
		    delete queue[id];
		  };
		  // Node.js 0.8-
		  if(__webpack_require__(36)(process) == 'process'){
		    defer = function(id){
		      process.nextTick(ctx(run, id, 1));
		    };
		  // Browsers with MessageChannel, includes WebWorkers
		  } else if(MessageChannel){
		    channel = new MessageChannel;
		    port    = channel.port2;
		    channel.port1.onmessage = listener;
		    defer = ctx(port.postMessage, port, 1);
		  // Browsers with postMessage, skip WebWorkers
		  // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'
		  } else if(global.addEventListener && typeof postMessage == 'function' && !global.importScripts){
		    defer = function(id){
		      global.postMessage(id + '', '*');
		    };
		    global.addEventListener('message', listener, false);
		  // IE8-
		  } else if(ONREADYSTATECHANGE in cel('script')){
		    defer = function(id){
		      html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function(){
		        html.removeChild(this);
		        run.call(id);
		      };
		    };
		  // Rest old browsers
		  } else {
		    defer = function(id){
		      setTimeout(ctx(run, id, 1), 0);
		    };
		  }
		}
		module.exports = {
		  set:   setTask,
		  clear: clearTask
		};

	/***/ },
	/* 162 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var global         = __webpack_require__(8)
		  , DESCRIPTORS    = __webpack_require__(15)
		  , LIBRARY        = __webpack_require__(54)
		  , $typed         = __webpack_require__(114)
		  , hide           = __webpack_require__(25)
		  , redefineAll    = __webpack_require__(58)
		  , fails          = __webpack_require__(9)
		  , anInstance     = __webpack_require__(49)
		  , toInteger      = __webpack_require__(52)
		  , toLength       = __webpack_require__(20)
		  , gOPN           = __webpack_require__(56).f
		  , dP             = __webpack_require__(16).f
		  , arrayFill      = __webpack_require__(140)
		  , setToStringTag = __webpack_require__(70)
		  , ARRAY_BUFFER   = 'ArrayBuffer'
		  , DATA_VIEW      = 'DataView'
		  , PROTOTYPE      = 'prototype'
		  , WRONG_LENGTH   = 'Wrong length!'
		  , WRONG_INDEX    = 'Wrong index!'
		  , $ArrayBuffer   = global[ARRAY_BUFFER]
		  , $DataView      = global[DATA_VIEW]
		  , Math           = global.Math
		  , parseInt       = global.parseInt
		  , RangeError     = global.RangeError
		  , Infinity       = global.Infinity
		  , BaseBuffer     = $ArrayBuffer
		  , abs            = Math.abs
		  , pow            = Math.pow
		  , min            = Math.min
		  , floor          = Math.floor
		  , log            = Math.log
		  , LN2            = Math.LN2
		  , BUFFER         = 'buffer'
		  , BYTE_LENGTH    = 'byteLength'
		  , BYTE_OFFSET    = 'byteOffset'
		  , $BUFFER        = DESCRIPTORS ? '_b' : BUFFER
		  , $LENGTH        = DESCRIPTORS ? '_l' : BYTE_LENGTH
		  , $OFFSET        = DESCRIPTORS ? '_o' : BYTE_OFFSET;

		// IEEE754 conversions based on https://github.com/feross/ieee754
		var packIEEE754 = function(value, mLen, nBytes){
		  var buffer = Array(nBytes)
		    , eLen   = nBytes * 8 - mLen - 1
		    , eMax   = (1 << eLen) - 1
		    , eBias  = eMax >> 1
		    , rt     = mLen === 23 ? pow(2, -24) - pow(2, -77) : 0
		    , i      = 0
		    , s      = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0
		    , e, m, c;
		  value = abs(value)
		  if(value != value || value === Infinity){
		    m = value != value ? 1 : 0;
		    e = eMax;
		  } else {
		    e = floor(log(value) / LN2);
		    if(value * (c = pow(2, -e)) < 1){
		      e--;
		      c *= 2;
		    }
		    if(e + eBias >= 1){
		      value += rt / c;
		    } else {
		      value += rt * 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) * pow(2, mLen);
		      e = e + eBias;
		    } else {
		      m = value * pow(2, eBias - 1) * pow(2, mLen);
		      e = 0;
		    }
		  }
		  for(; mLen >= 8; buffer[i++] = m & 255, m /= 256, mLen -= 8);
		  e = e << mLen | m;
		  eLen += mLen;
		  for(; eLen > 0; buffer[i++] = e & 255, e /= 256, eLen -= 8);
		  buffer[--i] |= s * 128;
		  return buffer;
		};
		var unpackIEEE754 = function(buffer, mLen, nBytes){
		  var eLen  = nBytes * 8 - mLen - 1
		    , eMax  = (1 << eLen) - 1
		    , eBias = eMax >> 1
		    , nBits = eLen - 7
		    , i     = nBytes - 1
		    , s     = buffer[i--]
		    , e     = s & 127
		    , m;
		  s >>= 7;
		  for(; nBits > 0; e = e * 256 + buffer[i], i--, nBits -= 8);
		  m = e & (1 << -nBits) - 1;
		  e >>= -nBits;
		  nBits += mLen;
		  for(; nBits > 0; m = m * 256 + buffer[i], i--, nBits -= 8);
		  if(e === 0){
		    e = 1 - eBias;
		  } else if(e === eMax){
		    return m ? NaN : s ? -Infinity : Infinity;
		  } else {
		    m = m + pow(2, mLen);
		    e = e - eBias;
		  } return (s ? -1 : 1) * m * pow(2, e - mLen);
		};

		var unpackI32 = function(bytes){
		  return bytes[3] << 24 | bytes[2] << 16 | bytes[1] << 8 | bytes[0];
		};
		var packI8 = function(it){
		  return [it & 0xff];
		};
		var packI16 = function(it){
		  return [it & 0xff, it >> 8 & 0xff];
		};
		var packI32 = function(it){
		  return [it & 0xff, it >> 8 & 0xff, it >> 16 & 0xff, it >> 24 & 0xff];
		};
		var packF64 = function(it){
		  return packIEEE754(it, 52, 8);
		};
		var packF32 = function(it){
		  return packIEEE754(it, 23, 4);
		};

		var addGetter = function(C, key, internal){
		  dP(C[PROTOTYPE], key, {get: function(){ return this[internal]; }});
		};

		var get = function(view, bytes, index, isLittleEndian){
		  var numIndex = +index
		    , intIndex = toInteger(numIndex);
		  if(numIndex != intIndex || intIndex < 0 || intIndex + bytes > view[$LENGTH])throw RangeError(WRONG_INDEX);
		  var store = view[$BUFFER]._b
		    , start = intIndex + view[$OFFSET]
		    , pack  = store.slice(start, start + bytes);
		  return isLittleEndian ? pack : pack.reverse();
		};
		var set = function(view, bytes, index, conversion, value, isLittleEndian){
		  var numIndex = +index
		    , intIndex = toInteger(numIndex);
		  if(numIndex != intIndex || intIndex < 0 || intIndex + bytes > view[$LENGTH])throw RangeError(WRONG_INDEX);
		  var store = view[$BUFFER]._b
		    , start = intIndex + view[$OFFSET]
		    , pack  = conversion(+value);
		  for(var i = 0; i < bytes; i++)store[start + i] = pack[isLittleEndian ? i : bytes - i - 1];
		};

		var validateArrayBufferArguments = function(that, length){
		  anInstance(that, $ArrayBuffer, ARRAY_BUFFER);
		  var numberLength = +length
		    , byteLength   = toLength(numberLength);
		  if(numberLength != byteLength)throw RangeError(WRONG_LENGTH);
		  return byteLength;
		};

		if(!$typed.ABV){
		  $ArrayBuffer = function ArrayBuffer(length){
		    var byteLength = validateArrayBufferArguments(this, length);
		    this._b       = arrayFill.call(Array(byteLength), 0);
		    this[$LENGTH] = byteLength;
		  };

		  $DataView = function DataView(buffer, byteOffset, byteLength){
		    anInstance(this, $DataView, DATA_VIEW);
		    anInstance(buffer, $ArrayBuffer, DATA_VIEW);
		    var bufferLength = buffer[$LENGTH]
		      , offset       = toInteger(byteOffset);
		    if(offset < 0 || offset > bufferLength)throw RangeError('Wrong offset!');
		    byteLength = byteLength === undefined ? bufferLength - offset : toLength(byteLength);
		    if(offset + byteLength > bufferLength)throw RangeError(WRONG_LENGTH);
		    this[$BUFFER] = buffer;
		    this[$OFFSET] = offset;
		    this[$LENGTH] = byteLength;
		  };

		  if(DESCRIPTORS){
		    addGetter($ArrayBuffer, BYTE_LENGTH, '_l');
		    addGetter($DataView, BUFFER, '_b');
		    addGetter($DataView, BYTE_LENGTH, '_l');
		    addGetter($DataView, BYTE_OFFSET, '_o');
		  }

		  redefineAll($DataView[PROTOTYPE], {
		    getInt8: function getInt8(byteOffset){
		      return get(this, 1, byteOffset)[0] << 24 >> 24;
		    },
		    getUint8: function getUint8(byteOffset){
		      return get(this, 1, byteOffset)[0];
		    },
		    getInt16: function getInt16(byteOffset /*, littleEndian */){
		      var bytes = get(this, 2, byteOffset, arguments[1]);
		      return (bytes[1] << 8 | bytes[0]) << 16 >> 16;
		    },
		    getUint16: function getUint16(byteOffset /*, littleEndian */){
		      var bytes = get(this, 2, byteOffset, arguments[1]);
		      return bytes[1] << 8 | bytes[0];
		    },
		    getInt32: function getInt32(byteOffset /*, littleEndian */){
		      return unpackI32(get(this, 4, byteOffset, arguments[1]));
		    },
		    getUint32: function getUint32(byteOffset /*, littleEndian */){
		      return unpackI32(get(this, 4, byteOffset, arguments[1])) >>> 0;
		    },
		    getFloat32: function getFloat32(byteOffset /*, littleEndian */){
		      return unpackIEEE754(get(this, 4, byteOffset, arguments[1]), 23, 4);
		    },
		    getFloat64: function getFloat64(byteOffset /*, littleEndian */){
		      return unpackIEEE754(get(this, 8, byteOffset, arguments[1]), 52, 8);
		    },
		    setInt8: function setInt8(byteOffset, value){
		      set(this, 1, byteOffset, packI8, value);
		    },
		    setUint8: function setUint8(byteOffset, value){
		      set(this, 1, byteOffset, packI8, value);
		    },
		    setInt16: function setInt16(byteOffset, value /*, littleEndian */){
		      set(this, 2, byteOffset, packI16, value, arguments[2]);
		    },
		    setUint16: function setUint16(byteOffset, value /*, littleEndian */){
		      set(this, 2, byteOffset, packI16, value, arguments[2]);
		    },
		    setInt32: function setInt32(byteOffset, value /*, littleEndian */){
		      set(this, 4, byteOffset, packI32, value, arguments[2]);
		    },
		    setUint32: function setUint32(byteOffset, value /*, littleEndian */){
		      set(this, 4, byteOffset, packI32, value, arguments[2]);
		    },
		    setFloat32: function setFloat32(byteOffset, value /*, littleEndian */){
		      set(this, 4, byteOffset, packF32, value, arguments[2]);
		    },
		    setFloat64: function setFloat64(byteOffset, value /*, littleEndian */){
		      set(this, 8, byteOffset, packF64, value, arguments[2]);
		    }
		  });
		} else {
		  if(!fails(function(){
		    new $ArrayBuffer;     // eslint-disable-line no-new
		  }) || !fails(function(){
		    new $ArrayBuffer(.5); // eslint-disable-line no-new
		  })){
		    $ArrayBuffer = function ArrayBuffer(length){
		      return new BaseBuffer(validateArrayBufferArguments(this, length));
		    };
		    var ArrayBufferProto = $ArrayBuffer[PROTOTYPE] = BaseBuffer[PROTOTYPE];
		    for(var keys = gOPN(BaseBuffer), j = 0, key; keys.length > j; ){
		      if(!((key = keys[j++]) in $ArrayBuffer))hide($ArrayBuffer, key, BaseBuffer[key]);
		    };
		    if(!LIBRARY)ArrayBufferProto.constructor = $ArrayBuffer;
		  }
		  // iOS Safari 7.x bug
		  var view = new $DataView(new $ArrayBuffer(2))
		    , $setInt8 = $DataView[PROTOTYPE].setInt8;
		  view.setInt8(0, 2147483648);
		  view.setInt8(1, 2147483649);
		  if(view.getInt8(0) || !view.getInt8(1))redefineAll($DataView[PROTOTYPE], {
		    setInt8: function setInt8(byteOffset, value){
		      $setInt8.call(this, byteOffset, value << 24 >> 24);
		    },
		    setUint8: function setUint8(byteOffset, value){
		      $setInt8.call(this, byteOffset, value << 24 >> 24);
		    }
		  }, true);
		}
		setToStringTag($ArrayBuffer, ARRAY_BUFFER);
		setToStringTag($DataView, DATA_VIEW);
		hide($DataView[PROTOTYPE], $typed.VIEW, true);
		exports[ARRAY_BUFFER] = $ArrayBuffer;
		exports[DATA_VIEW] = $DataView;

	/***/ },
	/* 163 */
	/***/ function(module, exports, __webpack_require__) {

		var global         = __webpack_require__(8)
		  , core           = __webpack_require__(40)
		  , LIBRARY        = __webpack_require__(54)
		  , wksExt         = __webpack_require__(232)
		  , defineProperty = __webpack_require__(16).f;
		module.exports = function(name){
		  var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {});
		  if(name.charAt(0) != '_' && !(name in $Symbol))defineProperty($Symbol, name, {value: wksExt.f(name)});
		};

	/***/ },
	/* 164 */
	/***/ function(module, exports, __webpack_require__) {

		var classof   = __webpack_require__(68)
		  , ITERATOR  = __webpack_require__(13)('iterator')
		  , Iterators = __webpack_require__(53);
		module.exports = __webpack_require__(40).getIteratorMethod = function(it){
		  if(it != undefined)return it[ITERATOR]
		    || it['@@iterator']
		    || Iterators[classof(it)];
		};

	/***/ },
	/* 165 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var addToUnscopables = __webpack_require__(67)
		  , step             = __webpack_require__(220)
		  , Iterators        = __webpack_require__(53)
		  , toIObject        = __webpack_require__(30);

		// 22.1.3.4 Array.prototype.entries()
		// 22.1.3.13 Array.prototype.keys()
		// 22.1.3.29 Array.prototype.values()
		// 22.1.3.30 Array.prototype[@@iterator]()
		module.exports = __webpack_require__(151)(Array, 'Array', function(iterated, kind){
		  this._t = toIObject(iterated); // target
		  this._i = 0;                   // next index
		  this._k = kind;                // kind
		// 22.1.5.2.1 %ArrayIteratorPrototype%.next()
		}, function(){
		  var O     = this._t
		    , kind  = this._k
		    , index = this._i++;
		  if(!O || index >= O.length){
		    this._t = undefined;
		    return step(1);
		  }
		  if(kind == 'keys'  )return step(0, index);
		  if(kind == 'values')return step(0, O[index]);
		  return step(0, [index, O[index]]);
		}, 'values');

		// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)
		Iterators.Arguments = Iterators.Array;

		addToUnscopables('keys');
		addToUnscopables('values');
		addToUnscopables('entries');

	/***/ },
	/* 166 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';
		var createHash = __webpack_require__(72);
		var inherits = __webpack_require__(2)

		var Transform = __webpack_require__(5).Transform

		var ZEROS = new Buffer(128)
		ZEROS.fill(0)

		function Hmac(alg, key) {
		  Transform.call(this)
		  alg = alg.toLowerCase()
		  if (typeof key === 'string') {
		    key = new Buffer(key)
		  }

		  var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64

		  this._alg = alg
		  this._key = key

		  if (key.length > blocksize) {
		    key = createHash(alg).update(key).digest()

		  } else if (key.length < blocksize) {
		    key = Buffer.concat([key, ZEROS], 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)
		}

		inherits(Hmac, Transform)

		Hmac.prototype.update = function (data, enc) {
		  this._hash.update(data, enc)

		  return this
		}

		Hmac.prototype._transform = function (data, _, next) {
		  this._hash.update(data)

		  next()
		}

		Hmac.prototype._flush = function (next) {
		  this.push(this.digest())

		  next()
		}

		Hmac.prototype.digest = function (enc) {
		  var h = this._hash.digest()

		  return createHash(this._alg).update(this._opad).update(h).digest(enc)
		}

		module.exports = function createHmac(alg, key) {
		  return new Hmac(alg, key)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 167 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.utils = __webpack_require__(597);
		exports.Cipher = __webpack_require__(594);
		exports.DES = __webpack_require__(595);
		exports.CBC = __webpack_require__(593);
		exports.EDE = __webpack_require__(596);


	/***/ },
	/* 168 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var multistream = __webpack_require__(174);

		// incomming connection handler
		module.exports = function connHandler(protocols, conn) {
		  var msS = new multistream.Select();

		  Object.keys(protocols).forEach(function (protocol) {
		    if (!protocol) {
		      return;
		    }

		    msS.addHandler(protocol, protocols[protocol]);
		  });

		  msS.handle(conn);
		};

	/***/ },
	/* 169 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/** Used to determine if values are of the language type Object */
		var objectTypes = {
		  'boolean': false,
		  'function': true,
		  'object': true,
		  'number': false,
		  'string': false,
		  'undefined': false
		};

		module.exports = objectTypes;


	/***/ },
	/* 170 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var isNative = __webpack_require__(88),
		    noop = __webpack_require__(262);

		/** Used as the property descriptor for `__bindData__` */
		var descriptor = {
		  'configurable': false,
		  'enumerable': false,
		  'value': null,
		  'writable': false
		};

		/** Used to set meta data on functions */
		var defineProperty = (function() {
		  // IE 8 only accepts DOM elements
		  try {
		    var o = {},
		        func = isNative(func = Object.defineProperty) && func,
		        result = func(o, o, o) && func;
		  } catch(e) { }
		  return result;
		}());

		/**
		 * Sets `this` binding data on a given function.
		 *
		 * @private
		 * @param {Function} func The function to set data on.
		 * @param {Array} value The data array to set.
		 */
		var setBindData = !defineProperty ? noop : function(func, value) {
		  descriptor.value = value;
		  defineProperty(func, '__bindData__', descriptor);
		};

		module.exports = setBindData;


	/***/ },
	/* 171 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */
		var baseEach = __webpack_require__(258),
		    baseIteratee = __webpack_require__(259);

		/** Used as references for various `Number` constants. */
		var MAX_SAFE_INTEGER = 9007199254740991;

		/** `Object#toString` result references. */
		var funcTag = '[object Function]',
		    genTag = '[object GeneratorFunction]';

		/**
		 * A specialized version of `_.map` for arrays without support for iteratee
		 * shorthands.
		 *
		 * @private
		 * @param {Array} array The array to iterate over.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array} Returns the new mapped array.
		 */
		function arrayMap(array, iteratee) {
		  var index = -1,
		      length = array.length,
		      result = Array(length);

		  while (++index < length) {
		    result[index] = iteratee(array[index], index, array);
		  }
		  return result;
		}

		/** Used for built-in method references. */
		var objectProto = Object.prototype;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/**
		 * The base implementation of `_.map` without support for iteratee shorthands.
		 *
		 * @private
		 * @param {Array|Object} collection The collection to iterate over.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array} Returns the new mapped array.
		 */
		function baseMap(collection, iteratee) {
		  var index = -1,
		      result = isArrayLike(collection) ? Array(collection.length) : [];

		  baseEach(collection, function(value, key, collection) {
		    result[++index] = iteratee(value, key, collection);
		  });
		  return result;
		}

		/**
		 * The base implementation of `_.property` without support for deep paths.
		 *
		 * @private
		 * @param {string} key The key of the property to get.
		 * @returns {Function} Returns the new accessor function.
		 */
		function baseProperty(key) {
		  return function(object) {
		    return object == null ? undefined : object[key];
		  };
		}

		/**
		 * 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');

		/**
		 * Creates an array of values by running each element in `collection` thru
		 * `iteratee`. The iteratee is invoked with three arguments:
		 * (value, index|key, collection).
		 *
		 * Many lodash methods are guarded to work as iteratees for methods like
		 * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
		 *
		 * The guarded methods are:
		 * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,
		 * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,
		 * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,
		 * `template`, `trim`, `trimEnd`, `trimStart`, and `words`
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Collection
		 * @param {Array|Object} collection The collection to iterate over.
		 * @param {Array|Function|Object|string} [iteratee=_.identity]
		 *  The function invoked per iteration.
		 * @returns {Array} Returns the new mapped array.
		 * @example
		 *
		 * function square(n) {
		 *   return n * n;
		 * }
		 *
		 * _.map([4, 8], square);
		 * // => [16, 64]
		 *
		 * _.map({ 'a': 4, 'b': 8 }, square);
		 * // => [16, 64] (iteration order is not guaranteed)
		 *
		 * var users = [
		 *   { 'user': 'barney' },
		 *   { 'user': 'fred' }
		 * ];
		 *
		 * // The `_.property` iteratee shorthand.
		 * _.map(users, 'user');
		 * // => ['barney', 'fred']
		 */
		function map(collection, iteratee) {
		  var func = isArray(collection) ? arrayMap : baseMap;
		  return func(collection, baseIteratee(iteratee, 3));
		}

		/**
		 * Checks if `value` is classified as an `Array` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @type {Function}
		 * @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(document.body.children);
		 * // => false
		 *
		 * _.isArray('abc');
		 * // => false
		 *
		 * _.isArray(_.noop);
		 * // => false
		 */
		var isArray = Array.isArray;

		/**
		 * Checks if `value` is array-like. A value is considered array-like if it's
		 * not a function and has a `value.length` that's an integer greater than or
		 * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
		 * @example
		 *
		 * _.isArrayLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLike(document.body.children);
		 * // => true
		 *
		 * _.isArrayLike('abc');
		 * // => true
		 *
		 * _.isArrayLike(_.noop);
		 * // => false
		 */
		function isArrayLike(value) {
		  return value != null && isLength(getLength(value)) && !isFunction(value);
		}

		/**
		 * Checks if `value` is classified as a `Function` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is 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 Safari 8 which returns 'object' for typed array and weak map constructors,
		  // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		  var tag = isObject(value) ? objectToString.call(value) : '';
		  return tag == funcTag || tag == genTag;
		}

		/**
		 * Checks if `value` is a valid array-like length.
		 *
		 * **Note:** This function is loosely based on
		 * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a valid length,
		 *  else `false`.
		 * @example
		 *
		 * _.isLength(3);
		 * // => true
		 *
		 * _.isLength(Number.MIN_VALUE);
		 * // => false
		 *
		 * _.isLength(Infinity);
		 * // => false
		 *
		 * _.isLength('3');
		 * // => false
		 */
		function isLength(value) {
		  return typeof value == 'number' &&
		    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
		}

		/**
		 * Checks if `value` is the
		 * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
		 * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(_.noop);
		 * // => true
		 *
		 * _.isObject(null);
		 * // => false
		 */
		function isObject(value) {
		  var type = typeof value;
		  return !!value && (type == 'object' || type == 'function');
		}

		module.exports = map;


	/***/ },
	/* 172 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = minimatch
		minimatch.Minimatch = Minimatch

		var path = { sep: '/' }
		try {
		  path = __webpack_require__(31)
		} catch (er) {}

		var GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {}
		var expand = __webpack_require__(366)

		// any single thing other than /
		// don't need to escape / when using new RegExp()
		var qmark = '[^/]'

		// * => any number of characters
		var star = qmark + '*?'

		// ** when dots are allowed.  Anything goes, except .. and .
		// not (^ or / followed by one or two dots followed by $ or /),
		// followed by anything, any number of times.
		var twoStarDot = '(?:(?!(?:\\\/|^)(?:\\.{1,2})($|\\\/)).)*?'

		// not a ^ or / followed by a dot,
		// followed by anything, any number of times.
		var twoStarNoDot = '(?:(?!(?:\\\/|^)\\.).)*?'

		// characters that need to be escaped in RegExp.
		var reSpecials = charSet('().*{}+?[]^$\\!')

		// "abc" -> { a:true, b:true, c:true }
		function charSet (s) {
		  return s.split('').reduce(function (set, c) {
		    set[c] = true
		    return set
		  }, {})
		}

		// normalizes slashes.
		var slashSplit = /\/+/

		minimatch.filter = filter
		function filter (pattern, options) {
		  options = options || {}
		  return function (p, i, list) {
		    return minimatch(p, pattern, options)
		  }
		}

		function ext (a, b) {
		  a = a || {}
		  b = b || {}
		  var t = {}
		  Object.keys(b).forEach(function (k) {
		    t[k] = b[k]
		  })
		  Object.keys(a).forEach(function (k) {
		    t[k] = a[k]
		  })
		  return t
		}

		minimatch.defaults = function (def) {
		  if (!def || !Object.keys(def).length) return minimatch

		  var orig = minimatch

		  var m = function minimatch (p, pattern, options) {
		    return orig.minimatch(p, pattern, ext(def, options))
		  }

		  m.Minimatch = function Minimatch (pattern, options) {
		    return new orig.Minimatch(pattern, ext(def, options))
		  }

		  return m
		}

		Minimatch.defaults = function (def) {
		  if (!def || !Object.keys(def).length) return Minimatch
		  return minimatch.defaults(def).Minimatch
		}

		function minimatch (p, pattern, options) {
		  if (typeof pattern !== 'string') {
		    throw new TypeError('glob pattern string required')
		  }

		  if (!options) options = {}

		  // shortcut: comments match nothing.
		  if (!options.nocomment && pattern.charAt(0) === '#') {
		    return false
		  }

		  // "" only matches ""
		  if (pattern.trim() === '') return p === ''

		  return new Minimatch(pattern, options).match(p)
		}

		function Minimatch (pattern, options) {
		  if (!(this instanceof Minimatch)) {
		    return new Minimatch(pattern, options)
		  }

		  if (typeof pattern !== 'string') {
		    throw new TypeError('glob pattern string required')
		  }

		  if (!options) options = {}
		  pattern = pattern.trim()

		  // windows support: need to use /, not \
		  if (path.sep !== '/') {
		    pattern = pattern.split(path.sep).join('/')
		  }

		  this.options = options
		  this.set = []
		  this.pattern = pattern
		  this.regexp = null
		  this.negate = false
		  this.comment = false
		  this.empty = false

		  // make the set of regexps etc.
		  this.make()
		}

		Minimatch.prototype.debug = function () {}

		Minimatch.prototype.make = make
		function make () {
		  // don't do it more than once.
		  if (this._made) return

		  var pattern = this.pattern
		  var options = this.options

		  // empty patterns and comments match nothing.
		  if (!options.nocomment && pattern.charAt(0) === '#') {
		    this.comment = true
		    return
		  }
		  if (!pattern) {
		    this.empty = true
		    return
		  }

		  // step 1: figure out negation, etc.
		  this.parseNegate()

		  // step 2: expand braces
		  var set = this.globSet = this.braceExpand()

		  if (options.debug) this.debug = console.error

		  this.debug(this.pattern, set)

		  // step 3: now we have a set, so turn each one into a series of path-portion
		  // matching patterns.
		  // These will be regexps, except in the case of "**", which is
		  // set to the GLOBSTAR object for globstar behavior,
		  // and will not contain any / characters
		  set = this.globParts = set.map(function (s) {
		    return s.split(slashSplit)
		  })

		  this.debug(this.pattern, set)

		  // glob --> regexps
		  set = set.map(function (s, si, set) {
		    return s.map(this.parse, this)
		  }, this)

		  this.debug(this.pattern, set)

		  // filter out everything that didn't compile properly.
		  set = set.filter(function (s) {
		    return s.indexOf(false) === -1
		  })

		  this.debug(this.pattern, set)

		  this.set = set
		}

		Minimatch.prototype.parseNegate = parseNegate
		function parseNegate () {
		  var pattern = this.pattern
		  var negate = false
		  var options = this.options
		  var negateOffset = 0

		  if (options.nonegate) return

		  for (var i = 0, l = pattern.length
		    ; i < l && pattern.charAt(i) === '!'
		    ; i++) {
		    negate = !negate
		    negateOffset++
		  }

		  if (negateOffset) this.pattern = pattern.substr(negateOffset)
		  this.negate = negate
		}

		// Brace expansion:
		// a{b,c}d -> abd acd
		// a{b,}c -> abc ac
		// a{0..3}d -> a0d a1d a2d a3d
		// a{b,c{d,e}f}g -> abg acdfg acefg
		// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg
		//
		// Invalid sets are not expanded.
		// a{2..}b -> a{2..}b
		// a{b}c -> a{b}c
		minimatch.braceExpand = function (pattern, options) {
		  return braceExpand(pattern, options)
		}

		Minimatch.prototype.braceExpand = braceExpand

		function braceExpand (pattern, options) {
		  if (!options) {
		    if (this instanceof Minimatch) {
		      options = this.options
		    } else {
		      options = {}
		    }
		  }

		  pattern = typeof pattern === 'undefined'
		    ? this.pattern : pattern

		  if (typeof pattern === 'undefined') {
		    throw new Error('undefined pattern')
		  }

		  if (options.nobrace ||
		    !pattern.match(/\{.*\}/)) {
		    // shortcut. no need to expand.
		    return [pattern]
		  }

		  return expand(pattern)
		}

		// parse a component of the expanded set.
		// At this point, no pattern may contain "/" in it
		// so we're going to return a 2d array, where each entry is the full
		// pattern, split on '/', and then turned into a regular expression.
		// A regexp is made at the end which joins each array with an
		// escaped /, and another full one which joins each regexp with |.
		//
		// Following the lead of Bash 4.1, note that "**" only has special meaning
		// when it is the *only* thing in a path portion.  Otherwise, any series
		// of * is equivalent to a single *.  Globstar behavior is enabled by
		// default, and can be disabled by setting options.noglobstar.
		Minimatch.prototype.parse = parse
		var SUBPARSE = {}
		function parse (pattern, isSub) {
		  var options = this.options

		  // shortcuts
		  if (!options.noglobstar && pattern === '**') return GLOBSTAR
		  if (pattern === '') return ''

		  var re = ''
		  var hasMagic = !!options.nocase
		  var escaping = false
		  // ? => one single character
		  var patternListStack = []
		  var negativeLists = []
		  var plType
		  var stateChar
		  var inClass = false
		  var reClassStart = -1
		  var classStart = -1
		  // . and .. never match anything that doesn't start with .,
		  // even when options.dot is set.
		  var patternStart = pattern.charAt(0) === '.' ? '' // anything
		  // not (start or / followed by . or .. followed by / or end)
		  : options.dot ? '(?!(?:^|\\\/)\\.{1,2}(?:$|\\\/))'
		  : '(?!\\.)'
		  var self = this

		  function clearStateChar () {
		    if (stateChar) {
		      // we had some state-tracking character
		      // that wasn't consumed by this pass.
		      switch (stateChar) {
		        case '*':
		          re += star
		          hasMagic = true
		        break
		        case '?':
		          re += qmark
		          hasMagic = true
		        break
		        default:
		          re += '\\' + stateChar
		        break
		      }
		      self.debug('clearStateChar %j %j', stateChar, re)
		      stateChar = false
		    }
		  }

		  for (var i = 0, len = pattern.length, c
		    ; (i < len) && (c = pattern.charAt(i))
		    ; i++) {
		    this.debug('%s\t%s %s %j', pattern, i, re, c)

		    // skip over any that are escaped.
		    if (escaping && reSpecials[c]) {
		      re += '\\' + c
		      escaping = false
		      continue
		    }

		    switch (c) {
		      case '/':
		        // completely not allowed, even escaped.
		        // Should already be path-split by now.
		        return false

		      case '\\':
		        clearStateChar()
		        escaping = true
		      continue

		      // the various stateChar values
		      // for the "extglob" stuff.
		      case '?':
		      case '*':
		      case '+':
		      case '@':
		      case '!':
		        this.debug('%s\t%s %s %j <-- stateChar', pattern, i, re, c)

		        // all of those are literals inside a class, except that
		        // the glob [!a] means [^a] in regexp
		        if (inClass) {
		          this.debug('  in class')
		          if (c === '!' && i === classStart + 1) c = '^'
		          re += c
		          continue
		        }

		        // if we already have a stateChar, then it means
		        // that there was something like ** or +? in there.
		        // Handle the stateChar, then proceed with this one.
		        self.debug('call clearStateChar %j', stateChar)
		        clearStateChar()
		        stateChar = c
		        // if extglob is disabled, then +(asdf|foo) isn't a thing.
		        // just clear the statechar *now*, rather than even diving into
		        // the patternList stuff.
		        if (options.noext) clearStateChar()
		      continue

		      case '(':
		        if (inClass) {
		          re += '('
		          continue
		        }

		        if (!stateChar) {
		          re += '\\('
		          continue
		        }

		        plType = stateChar
		        patternListStack.push({
		          type: plType,
		          start: i - 1,
		          reStart: re.length
		        })
		        // negation is (?:(?!js)[^/]*)
		        re += stateChar === '!' ? '(?:(?!(?:' : '(?:'
		        this.debug('plType %j %j', stateChar, re)
		        stateChar = false
		      continue

		      case ')':
		        if (inClass || !patternListStack.length) {
		          re += '\\)'
		          continue
		        }

		        clearStateChar()
		        hasMagic = true
		        re += ')'
		        var pl = patternListStack.pop()
		        plType = pl.type
		        // negation is (?:(?!js)[^/]*)
		        // The others are (?:<pattern>)<type>
		        switch (plType) {
		          case '!':
		            negativeLists.push(pl)
		            re += ')[^/]*?)'
		            pl.reEnd = re.length
		            break
		          case '?':
		          case '+':
		          case '*':
		            re += plType
		            break
		          case '@': break // the default anyway
		        }
		      continue

		      case '|':
		        if (inClass || !patternListStack.length || escaping) {
		          re += '\\|'
		          escaping = false
		          continue
		        }

		        clearStateChar()
		        re += '|'
		      continue

		      // these are mostly the same in regexp and glob
		      case '[':
		        // swallow any state-tracking char before the [
		        clearStateChar()

		        if (inClass) {
		          re += '\\' + c
		          continue
		        }

		        inClass = true
		        classStart = i
		        reClassStart = re.length
		        re += c
		      continue

		      case ']':
		        //  a right bracket shall lose its special
		        //  meaning and represent itself in
		        //  a bracket expression if it occurs
		        //  first in the list.  -- POSIX.2 2.8.3.2
		        if (i === classStart + 1 || !inClass) {
		          re += '\\' + c
		          escaping = false
		          continue
		        }

		        // handle the case where we left a class open.
		        // "[z-a]" is valid, equivalent to "\[z-a\]"
		        if (inClass) {
		          // split where the last [ was, make sure we don't have
		          // an invalid re. if so, re-walk the contents of the
		          // would-be class to re-translate any characters that
		          // were passed through as-is
		          // TODO: It would probably be faster to determine this
		          // without a try/catch and a new RegExp, but it's tricky
		          // to do safely.  For now, this is safe and works.
		          var cs = pattern.substring(classStart + 1, i)
		          try {
		            RegExp('[' + cs + ']')
		          } catch (er) {
		            // not a valid class!
		            var sp = this.parse(cs, SUBPARSE)
		            re = re.substr(0, reClassStart) + '\\[' + sp[0] + '\\]'
		            hasMagic = hasMagic || sp[1]
		            inClass = false
		            continue
		          }
		        }

		        // finish up the class.
		        hasMagic = true
		        inClass = false
		        re += c
		      continue

		      default:
		        // swallow any state char that wasn't consumed
		        clearStateChar()

		        if (escaping) {
		          // no need
		          escaping = false
		        } else if (reSpecials[c]
		          && !(c === '^' && inClass)) {
		          re += '\\'
		        }

		        re += c

		    } // switch
		  } // for

		  // handle the case where we left a class open.
		  // "[abc" is valid, equivalent to "\[abc"
		  if (inClass) {
		    // split where the last [ was, and escape it
		    // this is a huge pita.  We now have to re-walk
		    // the contents of the would-be class to re-translate
		    // any characters that were passed through as-is
		    cs = pattern.substr(classStart + 1)
		    sp = this.parse(cs, SUBPARSE)
		    re = re.substr(0, reClassStart) + '\\[' + sp[0]
		    hasMagic = hasMagic || sp[1]
		  }

		  // handle the case where we had a +( thing at the *end*
		  // of the pattern.
		  // each pattern list stack adds 3 chars, and we need to go through
		  // and escape any | chars that were passed through as-is for the regexp.
		  // Go through and escape them, taking care not to double-escape any
		  // | chars that were already escaped.
		  for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) {
		    var tail = re.slice(pl.reStart + 3)
		    // maybe some even number of \, then maybe 1 \, followed by a |
		    tail = tail.replace(/((?:\\{2})*)(\\?)\|/g, function (_, $1, $2) {
		      if (!$2) {
		        // the | isn't already escaped, so escape it.
		        $2 = '\\'
		      }

		      // need to escape all those slashes *again*, without escaping the
		      // one that we need for escaping the | character.  As it works out,
		      // escaping an even number of slashes can be done by simply repeating
		      // it exactly after itself.  That's why this trick works.
		      //
		      // I am sorry that you have to see this.
		      return $1 + $1 + $2 + '|'
		    })

		    this.debug('tail=%j\n   %s', tail, tail)
		    var t = pl.type === '*' ? star
		      : pl.type === '?' ? qmark
		      : '\\' + pl.type

		    hasMagic = true
		    re = re.slice(0, pl.reStart) + t + '\\(' + tail
		  }

		  // handle trailing things that only matter at the very end.
		  clearStateChar()
		  if (escaping) {
		    // trailing \\
		    re += '\\\\'
		  }

		  // only need to apply the nodot start if the re starts with
		  // something that could conceivably capture a dot
		  var addPatternStart = false
		  switch (re.charAt(0)) {
		    case '.':
		    case '[':
		    case '(': addPatternStart = true
		  }

		  // Hack to work around lack of negative lookbehind in JS
		  // A pattern like: *.!(x).!(y|z) needs to ensure that a name
		  // like 'a.xyz.yz' doesn't match.  So, the first negative
		  // lookahead, has to look ALL the way ahead, to the end of
		  // the pattern.
		  for (var n = negativeLists.length - 1; n > -1; n--) {
		    var nl = negativeLists[n]

		    var nlBefore = re.slice(0, nl.reStart)
		    var nlFirst = re.slice(nl.reStart, nl.reEnd - 8)
		    var nlLast = re.slice(nl.reEnd - 8, nl.reEnd)
		    var nlAfter = re.slice(nl.reEnd)

		    nlLast += nlAfter

		    // Handle nested stuff like *(*.js|!(*.json)), where open parens
		    // mean that we should *not* include the ) in the bit that is considered
		    // "after" the negated section.
		    var openParensBefore = nlBefore.split('(').length - 1
		    var cleanAfter = nlAfter
		    for (i = 0; i < openParensBefore; i++) {
		      cleanAfter = cleanAfter.replace(/\)[+*?]?/, '')
		    }
		    nlAfter = cleanAfter

		    var dollar = ''
		    if (nlAfter === '' && isSub !== SUBPARSE) {
		      dollar = '$'
		    }
		    var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast
		    re = newRe
		  }

		  // if the re is not "" at this point, then we need to make sure
		  // it doesn't match against an empty path part.
		  // Otherwise a/* will match a/, which it should not.
		  if (re !== '' && hasMagic) {
		    re = '(?=.)' + re
		  }

		  if (addPatternStart) {
		    re = patternStart + re
		  }

		  // parsing just a piece of a larger pattern.
		  if (isSub === SUBPARSE) {
		    return [re, hasMagic]
		  }

		  // skip the regexp for non-magical patterns
		  // unescape anything in it, though, so that it'll be
		  // an exact match against a file etc.
		  if (!hasMagic) {
		    return globUnescape(pattern)
		  }

		  var flags = options.nocase ? 'i' : ''
		  var regExp = new RegExp('^' + re + '$', flags)

		  regExp._glob = pattern
		  regExp._src = re

		  return regExp
		}

		minimatch.makeRe = function (pattern, options) {
		  return new Minimatch(pattern, options || {}).makeRe()
		}

		Minimatch.prototype.makeRe = makeRe
		function makeRe () {
		  if (this.regexp || this.regexp === false) return this.regexp

		  // at this point, this.set is a 2d array of partial
		  // pattern strings, or "**".
		  //
		  // It's better to use .match().  This function shouldn't
		  // be used, really, but it's pretty convenient sometimes,
		  // when you just want to work with a regex.
		  var set = this.set

		  if (!set.length) {
		    this.regexp = false
		    return this.regexp
		  }
		  var options = this.options

		  var twoStar = options.noglobstar ? star
		    : options.dot ? twoStarDot
		    : twoStarNoDot
		  var flags = options.nocase ? 'i' : ''

		  var re = set.map(function (pattern) {
		    return pattern.map(function (p) {
		      return (p === GLOBSTAR) ? twoStar
		      : (typeof p === 'string') ? regExpEscape(p)
		      : p._src
		    }).join('\\\/')
		  }).join('|')

		  // must match entire pattern
		  // ending in a * or ** will make it less strict.
		  re = '^(?:' + re + ')$'

		  // can match anything, as long as it's not this.
		  if (this.negate) re = '^(?!' + re + ').*$'

		  try {
		    this.regexp = new RegExp(re, flags)
		  } catch (ex) {
		    this.regexp = false
		  }
		  return this.regexp
		}

		minimatch.match = function (list, pattern, options) {
		  options = options || {}
		  var mm = new Minimatch(pattern, options)
		  list = list.filter(function (f) {
		    return mm.match(f)
		  })
		  if (mm.options.nonull && !list.length) {
		    list.push(pattern)
		  }
		  return list
		}

		Minimatch.prototype.match = match
		function match (f, partial) {
		  this.debug('match', f, this.pattern)
		  // short-circuit in the case of busted things.
		  // comments, etc.
		  if (this.comment) return false
		  if (this.empty) return f === ''

		  if (f === '/' && partial) return true

		  var options = this.options

		  // windows: need to use /, not \
		  if (path.sep !== '/') {
		    f = f.split(path.sep).join('/')
		  }

		  // treat the test path as a set of pathparts.
		  f = f.split(slashSplit)
		  this.debug(this.pattern, 'split', f)

		  // just ONE of the pattern sets in this.set needs to match
		  // in order for it to be valid.  If negating, then just one
		  // match means that we have failed.
		  // Either way, return on the first hit.

		  var set = this.set
		  this.debug(this.pattern, 'set', set)

		  // Find the basename of the path by looking for the last non-empty segment
		  var filename
		  var i
		  for (i = f.length - 1; i >= 0; i--) {
		    filename = f[i]
		    if (filename) break
		  }

		  for (i = 0; i < set.length; i++) {
		    var pattern = set[i]
		    var file = f
		    if (options.matchBase && pattern.length === 1) {
		      file = [filename]
		    }
		    var hit = this.matchOne(file, pattern, partial)
		    if (hit) {
		      if (options.flipNegate) return true
		      return !this.negate
		    }
		  }

		  // didn't get any hits.  this is success if it's a negative
		  // pattern, failure otherwise.
		  if (options.flipNegate) return false
		  return this.negate
		}

		// set partial to true to test if, for example,
		// "/a/b" matches the start of "/*/b/*/d"
		// Partial means, if you run out of file before you run
		// out of pattern, then that's fine, as long as all
		// the parts match.
		Minimatch.prototype.matchOne = function (file, pattern, partial) {
		  var options = this.options

		  this.debug('matchOne',
		    { 'this': this, file: file, pattern: pattern })

		  this.debug('matchOne', file.length, pattern.length)

		  for (var fi = 0,
		      pi = 0,
		      fl = file.length,
		      pl = pattern.length
		      ; (fi < fl) && (pi < pl)
		      ; fi++, pi++) {
		    this.debug('matchOne loop')
		    var p = pattern[pi]
		    var f = file[fi]

		    this.debug(pattern, p, f)

		    // should be impossible.
		    // some invalid regexp stuff in the set.
		    if (p === false) return false

		    if (p === GLOBSTAR) {
		      this.debug('GLOBSTAR', [pattern, p, f])

		      // "**"
		      // a/**/b/**/c would match the following:
		      // a/b/x/y/z/c
		      // a/x/y/z/b/c
		      // a/b/x/b/x/c
		      // a/b/c
		      // To do this, take the rest of the pattern after
		      // the **, and see if it would match the file remainder.
		      // If so, return success.
		      // If not, the ** "swallows" a segment, and try again.
		      // This is recursively awful.
		      //
		      // a/**/b/**/c matching a/b/x/y/z/c
		      // - a matches a
		      // - doublestar
		      //   - matchOne(b/x/y/z/c, b/**/c)
		      //     - b matches b
		      //     - doublestar
		      //       - matchOne(x/y/z/c, c) -> no
		      //       - matchOne(y/z/c, c) -> no
		      //       - matchOne(z/c, c) -> no
		      //       - matchOne(c, c) yes, hit
		      var fr = fi
		      var pr = pi + 1
		      if (pr === pl) {
		        this.debug('** at the end')
		        // a ** at the end will just swallow the rest.
		        // We have found a match.
		        // however, it will not swallow /.x, unless
		        // options.dot is set.
		        // . and .. are *never* matched by **, for explosively
		        // exponential reasons.
		        for (; fi < fl; fi++) {
		          if (file[fi] === '.' || file[fi] === '..' ||
		            (!options.dot && file[fi].charAt(0) === '.')) return false
		        }
		        return true
		      }

		      // ok, let's see if we can swallow whatever we can.
		      while (fr < fl) {
		        var swallowee = file[fr]

		        this.debug('\nglobstar while', file, fr, pattern, pr, swallowee)

		        // XXX remove this slice.  Just pass the start index.
		        if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {
		          this.debug('globstar found match!', fr, fl, swallowee)
		          // found a match.
		          return true
		        } else {
		          // can't swallow "." or ".." ever.
		          // can only swallow ".foo" when explicitly asked.
		          if (swallowee === '.' || swallowee === '..' ||
		            (!options.dot && swallowee.charAt(0) === '.')) {
		            this.debug('dot detected!', file, fr, pattern, pr)
		            break
		          }

		          // ** swallows a segment, and continue.
		          this.debug('globstar swallow a segment, and continue')
		          fr++
		        }
		      }

		      // no match was found.
		      // However, in partial mode, we can't say this is necessarily over.
		      // If there's more *pattern* left, then
		      if (partial) {
		        // ran out of file
		        this.debug('\n>>> no match, partial?', file, fr, pattern, pr)
		        if (fr === fl) return true
		      }
		      return false
		    }

		    // something other than **
		    // non-magic patterns just have to match exactly
		    // patterns with magic have been turned into regexps.
		    var hit
		    if (typeof p === 'string') {
		      if (options.nocase) {
		        hit = f.toLowerCase() === p.toLowerCase()
		      } else {
		        hit = f === p
		      }
		      this.debug('string match', p, f, hit)
		    } else {
		      hit = f.match(p)
		      this.debug('pattern match', p, f, hit)
		    }

		    if (!hit) return false
		  }

		  // Note: ending in / means that we'll get a final ""
		  // at the end of the pattern.  This can only match a
		  // corresponding "" at the end of the file.
		  // If the file ends in /, then it can only match a
		  // a pattern that ends in /, unless the pattern just
		  // doesn't have any more for it. But, a/b/ should *not*
		  // match "a/b/*", even though "" matches against the
		  // [^/]*? pattern, except in partial mode, where it might
		  // simply not be reached yet.
		  // However, a/b/ should still satisfy a/*

		  // now either we fell off the end of the pattern, or we're done.
		  if (fi === fl && pi === pl) {
		    // ran out of pattern and filename at the same time.
		    // an exact hit!
		    return true
		  } else if (fi === fl) {
		    // ran out of file, but still had pattern left.
		    // this is ok if we're doing the match as part of
		    // a glob fs traversal.
		    return partial
		  } else if (pi === pl) {
		    // ran out of pattern, still have file left.
		    // this is only acceptable if we're on the very last
		    // empty segment of a file with a trailing slash.
		    // a/* should match a/b/
		    var emptyFileEnd = (fi === fl - 1) && (file[fi] === '')
		    return emptyFileEnd
		  }

		  // should be unreachable.
		  throw new Error('wtf?')
		}

		// replace stuff like \* with *
		function globUnescape (s) {
		  return s.replace(/\\(.)/g, '$1')
		}

		function regExpEscape (s) {
		  return s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, '\\$&')
		}


	/***/ },
	/* 173 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var map = __webpack_require__(171);

		module.exports = Protocols;

		function Protocols(proto) {
		  if (typeof proto === 'number') {
		    if (Protocols.codes[proto]) {
		      return Protocols.codes[proto];
		    }

		    throw new Error('no protocol with code: ' + proto);
		  } else if (typeof proto === 'string' || proto instanceof String) {
		    if (Protocols.names[proto]) {
		      return Protocols.names[proto];
		    }

		    throw new Error('no protocol with name: ' + proto);
		  }

		  throw new Error('invalid protocol id type: ' + proto);
		}

		Protocols.lengthPrefixedVarSize = -1;

		// replicating table here to:
		// 1. avoid parsing the csv
		// 2. ensuring errors in the csv don't screw up code.
		// 3. changing a number has to happen in two places.

		Protocols.table = [[4, 32, 'ip4'], [6, 16, 'tcp'], [17, 16, 'udp'], [33, 16, 'dccp'], [41, 128, 'ip6'], [132, 16, 'sctp'],
		// these require varint for the protocol code
		[302, 0, 'utp'], [421, Protocols.lengthPrefixedVarSize, 'ipfs'], [480, 0, 'http'], [443, 0, 'https'], [477, 0, 'websockets']];

		Protocols.names = {};
		Protocols.codes = {};

		// populate tables
		map(Protocols.table, function (e) {
		  var proto = p.apply(this, e);
		  Protocols.codes[proto.code] = proto;
		  Protocols.names[proto.name] = proto;
		});

		Protocols.object = p;

		function p(code, size, name) {
		  return { code: code, size: size, name: name };
		}

	/***/ },
	/* 174 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.Interactive = __webpack_require__(691);
		exports.Select = __webpack_require__(692);

		exports.Silent = __webpack_require__(693);
		exports.Broadcast = __webpack_require__(690);

	/***/ },
	/* 175 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		function posix(path) {
			return path.charAt(0) === '/';
		};

		function win32(path) {
			// https://github.com/joyent/node/blob/b3fcc245fb25539909ef1d5eaa01dbf92e168633/lib/path.js#L56
			var splitDeviceRe = /^([a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/]+[^\\\/]+)?([\\\/])?([\s\S]*?)$/;
			var result = splitDeviceRe.exec(path);
			var device = result[1] || '';
			var isUnc = !!device && device.charAt(1) !== ':';

			// UNC paths are always absolute
			return !!result[2] || isUnc;
		};

		module.exports = process.platform === 'win32' ? win32 : posix;
		module.exports.posix = posix;
		module.exports.win32 = win32;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 176 */
	/***/ function(module, exports, __webpack_require__) {

		exports = module.exports = __webpack_require__(275);
		exports.Stream = __webpack_require__(5);
		exports.Readable = exports;
		exports.Writable = __webpack_require__(277);
		exports.Duplex = __webpack_require__(79);
		exports.Transform = __webpack_require__(276);
		exports.PassThrough = __webpack_require__(732);


	/***/ },
	/* 177 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.utils = __webpack_require__(755);
		exports.constants = __webpack_require__(751);
		exports.Scheduler = __webpack_require__(754);
		exports.Parser = __webpack_require__(753);
		exports.Framer = __webpack_require__(752);


	/***/ },
	/* 178 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(284);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(286);
		exports.Duplex = __webpack_require__(81);
		exports.Transform = __webpack_require__(285);
		exports.PassThrough = __webpack_require__(767);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 179 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(63);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 180 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(63);

		  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__(63);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 181 */
	/***/ function(module, exports, __webpack_require__) {

		var assert = __webpack_require__(77);
		var Buffer = __webpack_require__(0).Buffer;

		function WBuf() {
		  this.buffers = [];
		  this.toReserve = 0;
		  this.size = 0;
		  this.maxSize = 0;
		  this.avail = 0;

		  this.last = null;
		  this.offset = 0;

		  // Used in slicing
		  this.sliceQueue = null;

		  this.forceReserve = false;

		  // Mostly a constant
		  this.reserveRate = 64;
		}
		module.exports = WBuf;

		WBuf.prototype.reserve = function reserve(n) {
		  this.toReserve += n;

		  // Force reservation of extra bytes
		  if (this.forceReserve)
		    this.toReserve = Math.max(this.toReserve, this.reserveRate);
		};

		WBuf.prototype._ensure = function _ensure(n) {
		  if (this.avail >= n)
		    return;

		  if (this.toReserve === 0)
		    this.toReserve = this.reserveRate;

		  this.toReserve = Math.max(n - this.avail, this.toReserve);

		  if (this.avail === 0)
		    this._next();
		};

		WBuf.prototype._next = function _next() {
		  var buf;
		  if (this.sliceQueue === null) {
		    // Most common case
		    buf = new Buffer(this.toReserve);
		  } else {
		    // Only for `.slice()` results
		    buf = this.sliceQueue.shift();
		    if (this.sliceQueue.length === 0)
		      this.sliceQueue = null;
		  }

		  this.toReserve = 0;

		  this.buffers.push(buf);
		  this.avail = buf.length;
		  this.offset = 0;
		  this.last = buf;
		};

		WBuf.prototype._rangeCheck = function _rangeCheck() {
		  if (this.maxSize !== 0 && this.size > this.maxSize)
		    throw new RangeError('WBuf overflow');
		};

		WBuf.prototype._move = function _move(n) {
		  this.size += n;
		  if (this.avail === 0)
		    this.last = null;

		  this._rangeCheck();
		};

		WBuf.prototype.slice = function slice(start, end) {
		  assert(0 <= start && start <= this.size);
		  assert(0 <= end && end <= this.size);

		  if (this.last === null)
		    this._next();

		  var res = new WBuf();

		  // Only last chunk is requested
		  if (start >= this.size - this.offset) {
		    res.buffers.push(this.last);
		    res.last = this.last;
		    res.offset = start - this.size + this.offset;
		    res.maxSize = end - start;
		    res.avail = res.maxSize;

		    return res;
		  }

		  var startIndex = -1;
		  var startOffset = 0;
		  var endIndex = -1;

		  // Find buffer indices
		  var offset = 0;
		  for (var i = 0; i < this.buffers.length; i++) {
		    var buf = this.buffers[i];
		    var next = offset + buf.length;

		    // Found the start
		    if (start >= offset && start <= next) {
		      startIndex = i;
		      startOffset = start - offset;
		      if (endIndex !== -1)
		        break;
		    }
		    if (end >= offset && end <= next) {
		      endIndex = i;
		      if (startIndex !== -1)
		        break;
		    }

		    offset = next;
		  }

		  res.last = this.buffers[startIndex];
		  res.offset = startOffset;
		  res.maxSize = end - start;

		  // Multi-buffer slice
		  if (startIndex < endIndex) {
		    res.sliceQueue = this.buffers.slice(startIndex + 1, endIndex + 1);

		    res.last = res.last.slice(res.offset);
		    res.offset = 0;
		  }

		  res.avail = res.last.length - res.offset;
		  res.buffers.push(res.last);

		  return res;
		};

		WBuf.prototype.skip = function skip(n) {
		  if (n === 0)
		    return this.slice(this.size, this.size);

		  this._ensure(n);

		  var left = n;
		  while (left > 0) {
		    var toSkip = Math.min(left, this.avail);
		    left -= toSkip;
		    this.size += toSkip;
		    if (toSkip === this.avail) {
		      if (left !== 0) {
		        this._next();
		      } else {
		        this.avail -= toSkip;
		        this.offset += toSkip;
		      }
		    } else {
		      this.offset += toSkip;
		      this.avail -= toSkip;
		    }
		  }

		  this._rangeCheck();

		  return this.slice(this.size - n, this.size);
		};

		WBuf.prototype.write = function write(str) {
		  var len = 0;
		  for (var i = 0; i < str.length; i++) {
		    var c = str.charCodeAt(i);
		    if (c > 255)
		      len += 2;
		    else
		      len += 1;
		  }
		  this.reserve(len);
		  for (var i = 0; i < str.length; i++) {
		    var c = str.charCodeAt(i);
		    var hi = c >>> 8;
		    var lo = c & 0xff;

		    if (hi)
		      this.writeUInt8(hi);
		    this.writeUInt8(lo);
		  }
		};

		WBuf.prototype.copyFrom = function copyFrom(buf, start, end) {
		  var off = start === undefined ? 0 : start;
		  var len = end === undefined ? buf.length : end;
		  if (off === len)
		    return;

		  this._ensure(len - off);
		  while (off < len) {
		    var toCopy = Math.min(len - off, this.avail);
		    buf.copy(this.last, this.offset, off, off + toCopy);
		    off += toCopy;
		    this.size += toCopy;
		    if (toCopy === this.avail) {
		      if (off !== len) {
		        this._next();
		      } else {
		        this.avail = 0;
		        this.offset += toCopy;
		      }
		    } else {
		      this.offset += toCopy;
		      this.avail -= toCopy;
		    }
		  }

		  this._rangeCheck();
		};

		WBuf.prototype.writeUInt8 = function writeUInt8(v) {
		  this._ensure(1);

		  this.last[this.offset++] = v;
		  this.avail--;
		  this._move(1);
		};

		WBuf.prototype.writeUInt16BE = function writeUInt16BE(v) {
		  this._ensure(2);

		  // Fast case - everything fits into the last buffer
		  if (this.avail >= 2) {
		    this.last.writeUInt16BE(v, this.offset, true);
		    this.offset += 2;
		    this.avail -= 2;

		  // One byte here, one byte there
		  } else {
		    this.last[this.offset] = (v >>> 8);
		    this._next();
		    this.last[this.offset++] = v & 0xff;
		    this.avail--;
		  }

		  this._move(2);
		};

		WBuf.prototype.writeUInt24BE = function writeUInt24BE(v) {
		  this._ensure(3);

		  // Fast case - everything fits into the last buffer
		  if (this.avail >= 3) {
		    this.last.writeUInt16BE(v >>> 8, this.offset, true);
		    this.last[this.offset + 2] = v & 0xff;
		    this.offset += 3;
		    this.avail -= 3;
		    this._move(3);

		  // Two bytes here
		  } else if (this.avail >= 2) {
		    this.last.writeUInt16BE(v >>> 8, this.offset, true);
		    this._next();
		    this.last[this.offset++] = v & 0xff;
		    this.avail--;
		    this._move(3);

		  // Just one byte here
		  } else {
		    this.last[this.offset] = v >>> 16;
		    this._move(1);
		    this._next();
		    this.writeUInt16BE(v & 0xffff);
		  }
		};

		WBuf.prototype.writeUInt32BE = function writeUInt32BE(v) {
		  this._ensure(4);

		  // Fast case - everything fits into the last buffer
		  if (this.avail >= 4) {
		    this.last.writeUInt32BE(v, this.offset, true);
		    this.offset += 4;
		    this.avail -= 4;
		    this._move(4);

		  // Three bytes here
		  } else if (this.avail >= 3) {
		    this.writeUInt24BE(v >>> 8);
		    this._next();
		    this.last[this.offset++] = v & 0xff;
		    this.avail--;
		    this._move(1);

		  // Slow case, who cares
		  } else {
		    this.writeUInt16BE(v >>> 16);
		    this.writeUInt16BE(v & 0xffff);
		  }
		};

		WBuf.prototype.writeUInt16LE = function writeUInt16LE(num) {
		  var r = ((num & 0xff) << 8) | (num >>> 8);
		  this.writeUInt16BE(r);
		};

		WBuf.prototype.writeUInt24LE = function writeUInt24LE(num) {
		  var r = ((num & 0xff) << 16) | (((num >>> 8) & 0xff) << 8) | (num >>> 16);
		  this.writeUInt24BE(r);
		};

		WBuf.prototype.writeUInt32LE = function writeUInt32LE(num) {
		  var r = ((num & 0xff) << 24) |
		          (((num >>> 8) & 0xff) << 16) |
		          (((num >>> 16) & 0xff) << 8) |
		          (num >>> 24);
		  this.writeUInt32BE(r);
		};

		WBuf.prototype.render = function render() {
		  var left = this.size;
		  var out = [];

		  for (var i = 0; i < this.buffers.length && left >= 0; i++) {
		    var buf = this.buffers[i];
		    left -= buf.length;
		    if (left >= 0) {
		      out.push(buf);
		    } else {
		      out.push(buf.slice(0, buf.length + left));
		    }
		  }

		  return out;
		};

		// Signed APIs
		WBuf.prototype.writeInt8 = function writeInt8(num) {
		  if (num < 0)
		    return this.writeUInt8(0x100 + num);
		  else
		    return this.writeUInt8(num);
		};

		function toUnsigned16(num) {
		  if (num < 0)
		    return 0x10000 + num;
		  else
		    return num;
		}

		WBuf.prototype.writeInt16LE = function writeInt16LE(num) {
		  this.writeUInt16LE(toUnsigned16(num));
		};

		WBuf.prototype.writeInt16BE = function writeInt16BE(num) {
		  this.writeUInt16BE(toUnsigned16(num));
		};

		function toUnsigned24(num) {
		  if (num < 0)
		    return 0x1000000 + num;
		  else
		    return num;
		}

		WBuf.prototype.writeInt24LE = function writeInt24LE(num) {
		  this.writeUInt24LE(toUnsigned24(num));
		};

		WBuf.prototype.writeInt24BE = function writeInt24BE(num) {
		  this.writeUInt24BE(toUnsigned24(num));
		};

		function toUnsigned32(num) {
		  if (num < 0)
		    return (0xffffffff + num) + 1;
		  else
		    return num;
		}

		WBuf.prototype.writeInt32LE = function writeInt32LE(num) {
		  this.writeUInt32LE(toUnsigned32(num));
		};

		WBuf.prototype.writeInt32BE = function writeInt32BE(num) {
		  this.writeUInt32BE(toUnsigned32(num));
		};

		WBuf.prototype.writeComb = function writeComb(size, endian, value) {
		  if (size === 1)
		    return this.writeUInt8(value);

		  if (endian === 'le') {
		    if (size === 2)
		      this.writeUInt16LE(value);
		    else if (size === 3)
		      this.writeUInt24LE(value);
		    else if (size === 4)
		      this.writeUInt32LE(value);
		  } else {
		    if (size === 2)
		      this.writeUInt16BE(value);
		    else if (size === 3)
		      this.writeUInt24BE(value);
		    else if (size === 4)
		      this.writeUInt32BE(value);
		  }
		};


	/***/ },
	/* 182 */
	/***/ function(module, exports, __webpack_require__) {

		var inherits = __webpack_require__(2);
		var Reporter = __webpack_require__(82).Reporter;
		var Buffer = __webpack_require__(0).Buffer;

		function DecoderBuffer(base, options) {
		  Reporter.call(this, options);
		  if (!Buffer.isBuffer(base)) {
		    this.error('Input not Buffer');
		    return;
		  }

		  this.base = base;
		  this.offset = 0;
		  this.length = base.length;
		}
		inherits(DecoderBuffer, Reporter);
		exports.DecoderBuffer = DecoderBuffer;

		DecoderBuffer.prototype.save = function save() {
		  return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };
		};

		DecoderBuffer.prototype.restore = function restore(save) {
		  // Return skipped data
		  var res = new DecoderBuffer(this.base);
		  res.offset = save.offset;
		  res.length = this.offset;

		  this.offset = save.offset;
		  Reporter.prototype.restore.call(this, save.reporter);

		  return res;
		};

		DecoderBuffer.prototype.isEmpty = function isEmpty() {
		  return this.offset === this.length;
		};

		DecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {
		  if (this.offset + 1 <= this.length)
		    return this.base.readUInt8(this.offset++, true);
		  else
		    return this.error(fail || 'DecoderBuffer overrun');
		}

		DecoderBuffer.prototype.skip = function skip(bytes, fail) {
		  if (!(this.offset + bytes <= this.length))
		    return this.error(fail || 'DecoderBuffer overrun');

		  var res = new DecoderBuffer(this.base);

		  // Share reporter state
		  res._reporterState = this._reporterState;

		  res.offset = this.offset;
		  res.length = this.offset + bytes;
		  this.offset += bytes;
		  return res;
		}

		DecoderBuffer.prototype.raw = function raw(save) {
		  return this.base.slice(save ? save.offset : this.offset, this.length);
		}

		function EncoderBuffer(value, reporter) {
		  if (Array.isArray(value)) {
		    this.length = 0;
		    this.value = value.map(function(item) {
		      if (!(item instanceof EncoderBuffer))
		        item = new EncoderBuffer(item, reporter);
		      this.length += item.length;
		      return item;
		    }, this);
		  } else if (typeof value === 'number') {
		    if (!(0 <= value && value <= 0xff))
		      return reporter.error('non-byte EncoderBuffer value');
		    this.value = value;
		    this.length = 1;
		  } else if (typeof value === 'string') {
		    this.value = value;
		    this.length = Buffer.byteLength(value);
		  } else if (Buffer.isBuffer(value)) {
		    this.value = value;
		    this.length = value.length;
		  } else {
		    return reporter.error('Unsupported type: ' + typeof value);
		  }
		}
		exports.EncoderBuffer = EncoderBuffer;

		EncoderBuffer.prototype.join = function join(out, offset) {
		  if (!out)
		    out = new Buffer(this.length);
		  if (!offset)
		    offset = 0;

		  if (this.length === 0)
		    return out;

		  if (Array.isArray(this.value)) {
		    this.value.forEach(function(item) {
		      item.join(out, offset);
		      offset += item.length;
		    });
		  } else {
		    if (typeof this.value === 'number')
		      out[offset] = this.value;
		    else if (typeof this.value === 'string')
		      out.write(this.value, offset);
		    else if (Buffer.isBuffer(this.value))
		      this.value.copy(out, offset);
		    offset += this.length;
		  }

		  return out;
		};


	/***/ },
	/* 183 */
	/***/ function(module, exports, __webpack_require__) {

		var constants = exports;

		// Helper
		constants._reverse = function reverse(map) {
		  var res = {};

		  Object.keys(map).forEach(function(key) {
		    // Convert key to integer if it is stringified
		    if ((key | 0) == key)
		      key = key | 0;

		    var value = map[key];
		    res[value] = key;
		  });

		  return res;
		};

		constants.der = __webpack_require__(301);


	/***/ },
	/* 184 */
	/***/ function(module, exports, __webpack_require__) {

		var inherits = __webpack_require__(2);

		var asn1 = __webpack_require__(94);
		var base = asn1.base;
		var bignum = asn1.bignum;

		// Import DER constants
		var der = asn1.constants.der;

		function DERDecoder(entity) {
		  this.enc = 'der';
		  this.name = entity.name;
		  this.entity = entity;

		  // Construct base tree
		  this.tree = new DERNode();
		  this.tree._init(entity.body);
		};
		module.exports = DERDecoder;

		DERDecoder.prototype.decode = function decode(data, options) {
		  if (!(data instanceof base.DecoderBuffer))
		    data = new base.DecoderBuffer(data, options);

		  return this.tree._decode(data, options);
		};

		// Tree methods

		function DERNode(parent) {
		  base.Node.call(this, 'der', parent);
		}
		inherits(DERNode, base.Node);

		DERNode.prototype._peekTag = function peekTag(buffer, tag, any) {
		  if (buffer.isEmpty())
		    return false;

		  var state = buffer.save();
		  var decodedTag = derDecodeTag(buffer, 'Failed to peek tag: "' + tag + '"');
		  if (buffer.isError(decodedTag))
		    return decodedTag;

		  buffer.restore(state);

		  return decodedTag.tag === tag || decodedTag.tagStr === tag ||
		    (decodedTag.tagStr + 'of') === tag || any;
		};

		DERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {
		  var decodedTag = derDecodeTag(buffer,
		                                'Failed to decode tag of "' + tag + '"');
		  if (buffer.isError(decodedTag))
		    return decodedTag;

		  var len = derDecodeLen(buffer,
		                         decodedTag.primitive,
		                         'Failed to get length of "' + tag + '"');

		  // Failure
		  if (buffer.isError(len))
		    return len;

		  if (!any &&
		      decodedTag.tag !== tag &&
		      decodedTag.tagStr !== tag &&
		      decodedTag.tagStr + 'of' !== tag) {
		    return buffer.error('Failed to match tag: "' + tag + '"');
		  }

		  if (decodedTag.primitive || len !== null)
		    return buffer.skip(len, 'Failed to match body of: "' + tag + '"');

		  // Indefinite length... find END tag
		  var state = buffer.save();
		  var res = this._skipUntilEnd(
		      buffer,
		      'Failed to skip indefinite length body: "' + this.tag + '"');
		  if (buffer.isError(res))
		    return res;

		  len = buffer.offset - state.offset;
		  buffer.restore(state);
		  return buffer.skip(len, 'Failed to match body of: "' + tag + '"');
		};

		DERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {
		  while (true) {
		    var tag = derDecodeTag(buffer, fail);
		    if (buffer.isError(tag))
		      return tag;
		    var len = derDecodeLen(buffer, tag.primitive, fail);
		    if (buffer.isError(len))
		      return len;

		    var res;
		    if (tag.primitive || len !== null)
		      res = buffer.skip(len)
		    else
		      res = this._skipUntilEnd(buffer, fail);

		    // Failure
		    if (buffer.isError(res))
		      return res;

		    if (tag.tagStr === 'end')
		      break;
		  }
		};

		DERNode.prototype._decodeList = function decodeList(buffer, tag, decoder) {
		  var result = [];
		  while (!buffer.isEmpty()) {
		    var possibleEnd = this._peekTag(buffer, 'end');
		    if (buffer.isError(possibleEnd))
		      return possibleEnd;

		    var res = decoder.decode(buffer, 'der');
		    if (buffer.isError(res) && possibleEnd)
		      break;
		    result.push(res);
		  }
		  return result;
		};

		DERNode.prototype._decodeStr = function decodeStr(buffer, tag) {
		  if (tag === 'bitstr') {
		    var unused = buffer.readUInt8();
		    if (buffer.isError(unused))
		      return unused;
		    return { unused: unused, data: buffer.raw() };
		  } else if (tag === 'bmpstr') {
		    var raw = buffer.raw();
		    if (raw.length % 2 === 1)
		      return buffer.error('Decoding of string type: bmpstr length mismatch');

		    var str = '';
		    for (var i = 0; i < raw.length / 2; i++) {
		      str += String.fromCharCode(raw.readUInt16BE(i * 2));
		    }
		    return str;
		  } else if (tag === 'numstr') {
		    var numstr = buffer.raw().toString('ascii');
		    if (!this._isNumstr(numstr)) {
		      return buffer.error('Decoding of string type: ' +
		                          'numstr unsupported characters');
		    }
		    return numstr;
		  } else if (tag === 'octstr') {
		    return buffer.raw();
		  } else if (tag === 'printstr') {
		    var printstr = buffer.raw().toString('ascii');
		    if (!this._isPrintstr(printstr)) {
		      return buffer.error('Decoding of string type: ' +
		                          'printstr unsupported characters');
		    }
		    return printstr;
		  } else if (/str$/.test(tag)) {
		    return buffer.raw().toString();
		  } else {
		    return buffer.error('Decoding of string type: ' + tag + ' unsupported');
		  }
		};

		DERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {
		  var result;
		  var identifiers = [];
		  var ident = 0;
		  while (!buffer.isEmpty()) {
		    var subident = buffer.readUInt8();
		    ident <<= 7;
		    ident |= subident & 0x7f;
		    if ((subident & 0x80) === 0) {
		      identifiers.push(ident);
		      ident = 0;
		    }
		  }
		  if (subident & 0x80)
		    identifiers.push(ident);

		  var first = (identifiers[0] / 40) | 0;
		  var second = identifiers[0] % 40;

		  if (relative)
		    result = identifiers;
		  else
		    result = [first, second].concat(identifiers.slice(1));

		  if (values) {
		    var tmp = values[result.join(' ')];
		    if (tmp === undefined)
		      tmp = values[result.join('.')];
		    if (tmp !== undefined)
		      result = tmp;
		  }

		  return result;
		};

		DERNode.prototype._decodeTime = function decodeTime(buffer, tag) {
		  var str = buffer.raw().toString();
		  if (tag === 'gentime') {
		    var year = str.slice(0, 4) | 0;
		    var mon = str.slice(4, 6) | 0;
		    var day = str.slice(6, 8) | 0;
		    var hour = str.slice(8, 10) | 0;
		    var min = str.slice(10, 12) | 0;
		    var sec = str.slice(12, 14) | 0;
		  } else if (tag === 'utctime') {
		    var year = str.slice(0, 2) | 0;
		    var mon = str.slice(2, 4) | 0;
		    var day = str.slice(4, 6) | 0;
		    var hour = str.slice(6, 8) | 0;
		    var min = str.slice(8, 10) | 0;
		    var sec = str.slice(10, 12) | 0;
		    if (year < 70)
		      year = 2000 + year;
		    else
		      year = 1900 + year;
		  } else {
		    return buffer.error('Decoding ' + tag + ' time is not supported yet');
		  }

		  return Date.UTC(year, mon - 1, day, hour, min, sec, 0);
		};

		DERNode.prototype._decodeNull = function decodeNull(buffer) {
		  return null;
		};

		DERNode.prototype._decodeBool = function decodeBool(buffer) {
		  var res = buffer.readUInt8();
		  if (buffer.isError(res))
		    return res;
		  else
		    return res !== 0;
		};

		DERNode.prototype._decodeInt = function decodeInt(buffer, values) {
		  // Bigint, return as it is (assume big endian)
		  var raw = buffer.raw();
		  var res = new bignum(raw);

		  if (values)
		    res = values[res.toString(10)] || res;

		  return res;
		};

		DERNode.prototype._use = function use(entity, obj) {
		  if (typeof entity === 'function')
		    entity = entity(obj);
		  return entity._getDecoder('der').tree;
		};

		// Utility methods

		function derDecodeTag(buf, fail) {
		  var tag = buf.readUInt8(fail);
		  if (buf.isError(tag))
		    return tag;

		  var cls = der.tagClass[tag >> 6];
		  var primitive = (tag & 0x20) === 0;

		  // Multi-octet tag - load
		  if ((tag & 0x1f) === 0x1f) {
		    var oct = tag;
		    tag = 0;
		    while ((oct & 0x80) === 0x80) {
		      oct = buf.readUInt8(fail);
		      if (buf.isError(oct))
		        return oct;

		      tag <<= 7;
		      tag |= oct & 0x7f;
		    }
		  } else {
		    tag &= 0x1f;
		  }
		  var tagStr = der.tag[tag];

		  return {
		    cls: cls,
		    primitive: primitive,
		    tag: tag,
		    tagStr: tagStr
		  };
		}

		function derDecodeLen(buf, primitive, fail) {
		  var len = buf.readUInt8(fail);
		  if (buf.isError(len))
		    return len;

		  // Indefinite form
		  if (!primitive && len === 0x80)
		    return null;

		  // Definite form
		  if ((len & 0x80) === 0) {
		    // Short form
		    return len;
		  }

		  // Long form
		  var num = len & 0x7f;
		  if (num >= 4)
		    return buf.error('length octect is too long');

		  len = 0;
		  for (var i = 0; i < num; i++) {
		    len <<= 8;
		    var j = buf.readUInt8(fail);
		    if (buf.isError(j))
		      return j;
		    len |= j;
		  }

		  return len;
		}


	/***/ },
	/* 185 */
	/***/ function(module, exports, __webpack_require__) {

		var inherits = __webpack_require__(2);
		var Buffer = __webpack_require__(0).Buffer;

		var asn1 = __webpack_require__(94);
		var base = asn1.base;

		// Import DER constants
		var der = asn1.constants.der;

		function DEREncoder(entity) {
		  this.enc = 'der';
		  this.name = entity.name;
		  this.entity = entity;

		  // Construct base tree
		  this.tree = new DERNode();
		  this.tree._init(entity.body);
		};
		module.exports = DEREncoder;

		DEREncoder.prototype.encode = function encode(data, reporter) {
		  return this.tree._encode(data, reporter).join();
		};

		// Tree methods

		function DERNode(parent) {
		  base.Node.call(this, 'der', parent);
		}
		inherits(DERNode, base.Node);

		DERNode.prototype._encodeComposite = function encodeComposite(tag,
		                                                              primitive,
		                                                              cls,
		                                                              content) {
		  var encodedTag = encodeTag(tag, primitive, cls, this.reporter);

		  // Short form
		  if (content.length < 0x80) {
		    var header = new Buffer(2);
		    header[0] = encodedTag;
		    header[1] = content.length;
		    return this._createEncoderBuffer([ header, content ]);
		  }

		  // Long form
		  // Count octets required to store length
		  var lenOctets = 1;
		  for (var i = content.length; i >= 0x100; i >>= 8)
		    lenOctets++;

		  var header = new Buffer(1 + 1 + lenOctets);
		  header[0] = encodedTag;
		  header[1] = 0x80 | lenOctets;

		  for (var i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)
		    header[i] = j & 0xff;

		  return this._createEncoderBuffer([ header, content ]);
		};

		DERNode.prototype._encodeStr = function encodeStr(str, tag) {
		  if (tag === 'bitstr') {
		    return this._createEncoderBuffer([ str.unused | 0, str.data ]);
		  } else if (tag === 'bmpstr') {
		    var buf = new Buffer(str.length * 2);
		    for (var i = 0; i < str.length; i++) {
		      buf.writeUInt16BE(str.charCodeAt(i), i * 2);
		    }
		    return this._createEncoderBuffer(buf);
		  } else if (tag === 'numstr') {
		    if (!this._isNumstr(str)) {
		      return this.reporter.error('Encoding of string type: numstr supports ' +
		                                 'only digits and space');
		    }
		    return this._createEncoderBuffer(str);
		  } else if (tag === 'printstr') {
		    if (!this._isPrintstr(str)) {
		      return this.reporter.error('Encoding of string type: printstr supports ' +
		                                 'only latin upper and lower case letters, ' +
		                                 'digits, space, apostrophe, left and rigth ' +
		                                 'parenthesis, plus sign, comma, hyphen, ' +
		                                 'dot, slash, colon, equal sign, ' +
		                                 'question mark');
		    }
		    return this._createEncoderBuffer(str);
		  } else if (/str$/.test(tag)) {
		    return this._createEncoderBuffer(str);
		  } else {
		    return this.reporter.error('Encoding of string type: ' + tag +
		                               ' unsupported');
		  }
		};

		DERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {
		  if (typeof id === 'string') {
		    if (!values)
		      return this.reporter.error('string objid given, but no values map found');
		    if (!values.hasOwnProperty(id))
		      return this.reporter.error('objid not found in values map');
		    id = values[id].split(/[\s\.]+/g);
		    for (var i = 0; i < id.length; i++)
		      id[i] |= 0;
		  } else if (Array.isArray(id)) {
		    id = id.slice();
		    for (var i = 0; i < id.length; i++)
		      id[i] |= 0;
		  }

		  if (!Array.isArray(id)) {
		    return this.reporter.error('objid() should be either array or string, ' +
		                               'got: ' + JSON.stringify(id));
		  }

		  if (!relative) {
		    if (id[1] >= 40)
		      return this.reporter.error('Second objid identifier OOB');
		    id.splice(0, 2, id[0] * 40 + id[1]);
		  }

		  // Count number of octets
		  var size = 0;
		  for (var i = 0; i < id.length; i++) {
		    var ident = id[i];
		    for (size++; ident >= 0x80; ident >>= 7)
		      size++;
		  }

		  var objid = new Buffer(size);
		  var offset = objid.length - 1;
		  for (var i = id.length - 1; i >= 0; i--) {
		    var ident = id[i];
		    objid[offset--] = ident & 0x7f;
		    while ((ident >>= 7) > 0)
		      objid[offset--] = 0x80 | (ident & 0x7f);
		  }

		  return this._createEncoderBuffer(objid);
		};

		function two(num) {
		  if (num < 10)
		    return '0' + num;
		  else
		    return num;
		}

		DERNode.prototype._encodeTime = function encodeTime(time, tag) {
		  var str;
		  var date = new Date(time);

		  if (tag === 'gentime') {
		    str = [
		      two(date.getFullYear()),
		      two(date.getUTCMonth() + 1),
		      two(date.getUTCDate()),
		      two(date.getUTCHours()),
		      two(date.getUTCMinutes()),
		      two(date.getUTCSeconds()),
		      'Z'
		    ].join('');
		  } else if (tag === 'utctime') {
		    str = [
		      two(date.getFullYear() % 100),
		      two(date.getUTCMonth() + 1),
		      two(date.getUTCDate()),
		      two(date.getUTCHours()),
		      two(date.getUTCMinutes()),
		      two(date.getUTCSeconds()),
		      'Z'
		    ].join('');
		  } else {
		    this.reporter.error('Encoding ' + tag + ' time is not supported yet');
		  }

		  return this._encodeStr(str, 'octstr');
		};

		DERNode.prototype._encodeNull = function encodeNull() {
		  return this._createEncoderBuffer('');
		};

		DERNode.prototype._encodeInt = function encodeInt(num, values) {
		  if (typeof num === 'string') {
		    if (!values)
		      return this.reporter.error('String int or enum given, but no values map');
		    if (!values.hasOwnProperty(num)) {
		      return this.reporter.error('Values map doesn\'t contain: ' +
		                                 JSON.stringify(num));
		    }
		    num = values[num];
		  }

		  // Bignum, assume big endian
		  if (typeof num !== 'number' && !Buffer.isBuffer(num)) {
		    var numArray = num.toArray();
		    if (!num.sign && numArray[0] & 0x80) {
		      numArray.unshift(0);
		    }
		    num = new Buffer(numArray);
		  }

		  if (Buffer.isBuffer(num)) {
		    var size = num.length;
		    if (num.length === 0)
		      size++;

		    var out = new Buffer(size);
		    num.copy(out);
		    if (num.length === 0)
		      out[0] = 0
		    return this._createEncoderBuffer(out);
		  }

		  if (num < 0x80)
		    return this._createEncoderBuffer(num);

		  if (num < 0x100)
		    return this._createEncoderBuffer([0, num]);

		  var size = 1;
		  for (var i = num; i >= 0x100; i >>= 8)
		    size++;

		  var out = new Array(size);
		  for (var i = out.length - 1; i >= 0; i--) {
		    out[i] = num & 0xff;
		    num >>= 8;
		  }
		  if(out[0] & 0x80) {
		    out.unshift(0);
		  }

		  return this._createEncoderBuffer(new Buffer(out));
		};

		DERNode.prototype._encodeBool = function encodeBool(value) {
		  return this._createEncoderBuffer(value ? 0xff : 0);
		};

		DERNode.prototype._use = function use(entity, obj) {
		  if (typeof entity === 'function')
		    entity = entity(obj);
		  return entity._getEncoder('der').tree;
		};

		DERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {
		  var state = this._baseState;
		  var i;
		  if (state['default'] === null)
		    return false;

		  var data = dataBuffer.join();
		  if (state.defaultBuffer === undefined)
		    state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();

		  if (data.length !== state.defaultBuffer.length)
		    return false;

		  for (i=0; i < data.length; i++)
		    if (data[i] !== state.defaultBuffer[i])
		      return false;

		  return true;
		};

		// Utility methods

		function encodeTag(tag, primitive, cls, reporter) {
		  var res;

		  if (tag === 'seqof')
		    tag = 'seq';
		  else if (tag === 'setof')
		    tag = 'set';

		  if (der.tagByName.hasOwnProperty(tag))
		    res = der.tagByName[tag];
		  else if (typeof tag === 'number' && (tag | 0) === tag)
		    res = tag;
		  else
		    return reporter.error('Unknown tag: ' + tag);

		  if (res >= 0x1f)
		    return reporter.error('Multi-octet tag encoding unsupported');

		  if (!primitive)
		    res |= 0x20;

		  res |= (der.tagClassByName[cls || 'universal'] << 6);

		  return res;
		}


	/***/ },
	/* 186 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		var second = 1000;

		module.exports = {
		  maxProvidersPerRequest: 3,
		  provierRequestTimeout: 10 * second,
		  hasBlockTimeout: 15 * second,
		  provideTimeout: 15 * second,
		  kMaxPriority: Math.pow(2, 31) - 1,
		  rebroadcastDelay: 10 * second,
		  maxListeners: 1000
		};

	/***/ },
	/* 187 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var async = __webpack_require__(317);

		// BlockService is a hybrid block datastore. It stores data in a local
		// datastore and may retrieve data from a remote Exchange.
		// It uses an internal `datastore.Datastore` instance to store values.
		module.exports = function () {
		  function BlockService(ipfsRepo) {
		    _classCallCheck(this, BlockService);

		    this._repo = ipfsRepo;
		    this._bitswap = null;
		  }

		  _createClass(BlockService, [{
		    key: 'goOnline',
		    value: function goOnline(bitswap) {
		      this._bitswap = bitswap;
		    }
		  }, {
		    key: 'goOffline',
		    value: function goOffline() {
		      this._bitswap = null;
		    }
		  }, {
		    key: 'isOnline',
		    value: function isOnline() {
		      return this._bitswap != null;
		    }
		  }, {
		    key: 'addBlock',
		    value: function addBlock(block, extension, callback) {
		      if (this.isOnline()) {
		        if (typeof extension === 'function') {
		          callback = extension;
		          extension = undefined;
		        }

		        this._bitswap.hasBlock(block, callback);
		      } else {
		        this._repo.datastore.put(block, extension, callback);
		      }
		    }
		  }, {
		    key: 'addBlocks',
		    value: function addBlocks(blocks, callback) {
		      var _this = this;

		      if (!Array.isArray(blocks)) {
		        return callback(new Error('expects an array of Blocks'));
		      }

		      async.eachLimit(blocks, 100, function (block, next) {
		        _this.addBlock(block, next);
		      }, callback);
		    }
		  }, {
		    key: 'getBlock',
		    value: function getBlock(key, extension, callback) {
		      if (this.isOnline()) {
		        if (typeof extension === 'function') {
		          callback = extension;
		          extension = undefined;
		        }

		        this._bitswap.getBlock(key, callback);
		      } else {
		        this._repo.datastore.get(key, extension, callback);
		      }
		    }
		  }, {
		    key: 'getBlocks',
		    value: function getBlocks(multihashes, extension, callback) {
		      var _this2 = this;

		      if (typeof extension === 'function') {
		        callback = extension;
		        extension = undefined;
		      }

		      if (!Array.isArray(multihashes)) {
		        return callback(new Error('Invalid batch of multihashes'));
		      }

		      var results = {};

		      async.eachLimit(multihashes, 100, function (multihash, next) {
		        _this2.getBlock(multihash, extension, function (err, block) {
		          results[multihash] = {
		            err: err,
		            block: block
		          };
		          next();
		        });
		      }, function (err) {
		        callback(err, results);
		      });
		    }
		  }, {
		    key: 'deleteBlock',
		    value: function deleteBlock(key, extension, callback) {
		      this._repo.datastore.delete(key, extension, callback);
		    }
		  }, {
		    key: 'deleteBlocks',
		    value: function deleteBlocks(multihashes, extension, callback) {
		      var _this3 = this;

		      if (typeof extension === 'function') {
		        callback = extension;
		        extension = undefined;
		      }

		      if (!Array.isArray(multihashes)) {
		        return callback(new Error('Invalid batch of multihashes'));
		      }

		      async.eachLimit(multihashes, 100, function (multihash, next) {
		        _this3.deleteBlock(multihash, extension, next);
		      }, function (err) {
		        callback(err);
		      });
		    }
		  }]);

		  return BlockService;
		}();

	/***/ },
	/* 188 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var mh = __webpack_require__(121);

		// Link represents an IPFS Merkle DAG Link between Nodes.
		module.exports = function () {
		  function DAGLink(name, size, hash) {
		    _classCallCheck(this, DAGLink);

		    this.name = name;
		    this.size = size;

		    if (typeof hash === 'string') {
		      this.hash = mh.fromB58String(hash);
		    } else if (Buffer.isBuffer(hash)) {
		      this.hash = hash;
		    }
		  }

		  _createClass(DAGLink, [{
		    key: 'toJSON',
		    value: function toJSON() {
		      return {
		        Name: this.name,
		        Size: this.size,
		        Hash: mh.toB58String(this.hash)
		      };
		    }
		  }, {
		    key: 'toString',
		    value: function toString() {
		      var hash = mh.toB58String(this.hash);
		      return 'DAGLink <' + hash + ' - name: "' + this.name + '", size: ' + this.size + '>';
		    }
		  }]);

		  return DAGLink;
		}();
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 189 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var protobuf = __webpack_require__(90);
		var stable = __webpack_require__(287);

		var path = __webpack_require__(31);
		var mh = __webpack_require__(121);

		var util = __webpack_require__(190);
		var DAGLink = __webpack_require__(188);

		var proto = protobuf(Buffer("Ly8gQW4gSVBGUyBNZXJrbGVEQUcgTGluawptZXNzYWdlIFBCTGluayB7CgogIC8vIG11bHRpaGFzaCBvZiB0aGUgdGFyZ2V0IG9iamVjdAogIG9wdGlvbmFsIGJ5dGVzIEhhc2ggPSAxOwoKICAvLyB1dGYgc3RyaW5nIG5hbWUuIHNob3VsZCBiZSB1bmlxdWUgcGVyIG9iamVjdAogIG9wdGlvbmFsIHN0cmluZyBOYW1lID0gMjsKCiAgLy8gY3VtdWxhdGl2ZSBzaXplIG9mIHRhcmdldCBvYmplY3QKICBvcHRpb25hbCB1aW50NjQgVHNpemUgPSAzOwp9CgovLyBBbiBJUEZTIE1lcmtsZURBRyBOb2RlCm1lc3NhZ2UgUEJOb2RlIHsKCiAgLy8gcmVmcyB0byBvdGhlciBvYmplY3RzCiAgcmVwZWF0ZWQgUEJMaW5rIExpbmtzID0gMjsKCiAgLy8gb3BhcXVlIHVzZXIgZGF0YQogIG9wdGlvbmFsIGJ5dGVzIERhdGEgPSAxOwp9Cg==","base64"));

		function linkSort(a, b) {
		  return new Buffer(a.name, 'ascii').compare(new Buffer(b.name, 'ascii'));
		}

		// Helper method to get a protobuf object equivalent
		function toProtoBuf(node) {
		  var pbn = {};

		  if (node.data && node.data.length > 0) {
		    pbn.Data = node.data;
		  } else {
		    pbn.Data = null; // new Buffer(0)
		  }

		  if (node.links.length > 0) {
		    pbn.Links = node.links.map(function (link) {
		      return {
		        Hash: link.hash,
		        Name: link.name,
		        Tsize: link.size
		      };
		    });
		  } else {
		    pbn.Links = null;
		  }

		  return pbn;
		}

		module.exports = function () {
		  function DAGNode(data, links) {
		    var _this = this;

		    _classCallCheck(this, DAGNode);

		    this._cached = null;
		    this._encoded = null;

		    this.data = data;
		    this.links = [];

		    // ensure links are instances of DAGLink
		    if (links) {
		      links.forEach(function (l) {
		        if (l.name && typeof l.toJSON === 'function') {
		          _this.links.push(l);
		        } else {
		          _this.links.push(new DAGLink(l.Name, l.Size, l.Hash));
		        }
		      });

		      stable.inplace(this.links, linkSort);
		    }
		  }

		  // copy - returns a clone of the DAGNode

		  _createClass(DAGNode, [{
		    key: 'copy',
		    value: function copy() {
		      var clone = new DAGNode();
		      if (this.data && this.data.length > 0) {
		        var buf = new Buffer(this.data.length);
		        this.data.copy(buf);
		        clone.data = buf;
		      }

		      if (this.links.length > 0) {
		        clone.links = this.links.slice();
		      }

		      return clone;
		    }

		    // addNodeLink - adds a DAGLink to this node that points to node by a name

		  }, {
		    key: 'addNodeLink',
		    value: function addNodeLink(name, node) {
		      if (typeof name !== 'string') {
		        return;
		      }
		      var link = this.makeLink(node);

		      link.name = name;
		      this.addRawLink(link);
		    }

		    // addRawLink adds a Link to this node from a DAGLink

		  }, {
		    key: 'addRawLink',
		    value: function addRawLink(link) {
		      this._encoded = null;
		      this.links.push(new DAGLink(link.name, link.size, link.hash));
		      stable.inplace(this.links, linkSort);
		    }

		    // UpdateNodeLink return a copy of the node with the link name set to point to
		    // that. If a link of the same name existed, it is replaced.
		    // TODO this would make more sense as an utility

		  }, {
		    key: 'updateNodeLink',
		    value: function updateNodeLink(name, node) {
		      var newnode = this.copy();
		      newnode.removeNodeLink(name);
		      newnode.addNodeLink(name, node);
		      return newnode;
		    }

		    // removeNodeLink removes a Link from this node based on name

		  }, {
		    key: 'removeNodeLink',
		    value: function removeNodeLink(name) {
		      this._encoded = null; // uncache
		      this.links = this.links.filter(function (link) {
		        if (link.name === name) {
		          return false;
		        } else {
		          return true;
		        }
		      });
		    }

		    // removeNodeLink removes a Link from this node based on a multihash

		  }, {
		    key: 'removeNodeLinkByHash',
		    value: function removeNodeLinkByHash(multihash) {
		      this._encoded = null; // uncache
		      this.links = this.links.filter(function (link) {
		        if (link.hash.equals(multihash)) {
		          return false;
		        } else {
		          return true;
		        }
		      });
		    }

		    // makeLink returns a DAGLink node from a DAGNode
		    // TODO: this would make more sense as an utility

		  }, {
		    key: 'makeLink',
		    value: function makeLink(node) {
		      return new DAGLink(null, node.size(), node.multihash());
		    }

		    // multihash - returns the multihash value of this DAGNode

		  }, {
		    key: 'multihash',
		    value: function multihash() {
		      this.encoded();
		      return this._cached;
		    }

		    // Size returns the total size of the data addressed by node,
		    // including the total sizes of references.

		  }, {
		    key: 'size',
		    value: function size() {
		      var buf = this.encoded();
		      if (!buf) {
		        return 0;
		      }

		      return this.links.reduce(function (sum, l) {
		        return sum + l.size;
		      }, buf.length);
		    }

		    // Encoded returns the encoded raw data version of a Node instance.
		    // It may use a cached encoded version, unless the force flag is given.

		  }, {
		    key: 'encoded',
		    value: function encoded(force) {
		      if (force || !this._encoded) {
		        this._encoded = this.marshal();

		        if (this._encoded) {
		          this._cached = util.hash(this._encoded);
		        }
		      }
		      return this._encoded;
		    }

		    // marshal - encodes the DAGNode into a probuf

		  }, {
		    key: 'marshal',
		    value: function marshal() {
		      return proto.PBNode.encode(toProtoBuf(this));
		    }

		    // unMarshal - decodes a protobuf into a DAGNode
		    // TODO: this would make more sense as an utility

		  }, {
		    key: 'unMarshal',
		    value: function unMarshal(data) {
		      var pbn = proto.PBNode.decode(data);
		      this.links = pbn.Links.map(function (link) {
		        return new DAGLink(link.Name, link.Tsize, link.Hash);
		      });

		      stable.inplace(this.links, linkSort);
		      this.data = pbn.Data || new Buffer(0);
		      return this;
		    }
		  }, {
		    key: 'toJSON',
		    value: function toJSON() {
		      return {
		        Data: this.data,
		        Links: this.links.map(function (l) {
		          return l.toJSON();
		        }),
		        Hash: mh.toB58String(this.multihash()),
		        Size: this.size()
		      };
		    }
		  }, {
		    key: 'toString',
		    value: function toString() {
		      var hash = mh.toB58String(this.multihash());
		      return 'DAGNode <' + hash + ' - data: "' + this.data.toString() + '", links: ' + this.links.length + ', size: ' + this.size() + '>';
		    }
		  }]);

		  return DAGNode;
		}();
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 190 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var multihashing = __webpack_require__(122);

		exports = module.exports;

		// Hash is the global IPFS hash function. uses multihash SHA2_256, 256 bits
		exports.hash = function (data) {
		  return multihashing(data, 'sha2-256');
		};

	/***/ },
	/* 191 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var stores = __webpack_require__(323);

		function Repo(repoPath, options) {
		  var _this = this;

		  if (!(this instanceof Repo)) {
		    return new Repo(repoPath, options);
		  }
		  if (!options) {
		    throw new Error('missing options param');
		  }
		  if (!options.stores) {
		    throw new Error('missing options.stores param');
		  }

		  // If options.stores is an abstract-blob-store instead of a map, use it for
		  // all stores.
		  if (options.stores.prototype && options.stores.prototype.createWriteStream) {
		    var store = options.stores;
		    options.stores = {
		      keys: store,
		      config: store,
		      datastore: store,
		      logs: store,
		      locks: store,
		      version: store
		    };
		  }

		  this.path = repoPath;

		  this.locks = stores.locks.setUp(repoPath, options.stores.locks);

		  this.exists = function (callback) {
		    _this.version.exists(callback);
		  };

		  this.version = stores.version.setUp(repoPath, options.stores.version, this.locks);

		  this.config = stores.config.setUp(repoPath, options.stores.config, this.locks);

		  this.keys = stores.keys.setUp(repoPath, options.stores.keys, this.locks, this.config);

		  this.datastore = stores.datastore.setUp(repoPath, options.stores.datastore, this.locks);
		}

		exports = module.exports = Repo;

	/***/ },
	/* 192 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var multihashing = __webpack_require__(122);
		var isNode = __webpack_require__(598);

		exports = module.exports;

		// Hash is the global IPFS hash function. uses multihash SHA2_256, 256 bits
		exports.hash = function (data) {
		  return multihashing(data, 'sha2-256');
		};
		exports.isBrowser = function () {
		  return !isNode;
		};

	/***/ },
	/* 193 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(787);
		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__(65);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(65);

		  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__(14).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__(3)))

	/***/ },
	/* 194 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(65);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 195 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(65);

		  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__(65);

		  // Writable ctor is applied to Duplexes, though they're not
		  // instanceof Writable, they're instanceof Readable.
		  if (!(this instanceof Writable) && !(this instanceof Duplex)) return new Writable(options);

		  this._writableState = new WritableState(options, this);

		  // legacy.
		  this.writable = true;

		  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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 196 */
	/***/ function(module, exports, __webpack_require__) {

		var r;

		module.exports = function rand(len) {
		  if (!r)
		    r = new Rand(null);

		  return r.generate(len);
		};

		function Rand(rand) {
		  this.rand = rand;
		}
		module.exports.Rand = Rand;

		Rand.prototype.generate = function generate(len) {
		  return this._rand(len);
		};

		if (typeof window === 'object') {
		  if (window.crypto && window.crypto.getRandomValues) {
		    // Modern browsers
		    Rand.prototype._rand = function _rand(n) {
		      var arr = new Uint8Array(n);
		      window.crypto.getRandomValues(arr);
		      return arr;
		    };
		  } else if (window.msCrypto && window.msCrypto.getRandomValues) {
		    // IE
		    Rand.prototype._rand = function _rand(n) {
		      var arr = new Uint8Array(n);
		      window.msCrypto.getRandomValues(arr);
		      return arr;
		    };
		  } else {
		    // Old junk
		    Rand.prototype._rand = function() {
		      throw new Error('Not implemented yet');
		    };
		  }
		} else {
		  // Node.js or Web worker
		  try {
		    var crypto = __webpack_require__(238);

		    Rand.prototype._rand = function _rand(n) {
		      return crypto.randomBytes(n);
		    };
		  } catch (e) {
		    // Emulate crypto API using randy
		    Rand.prototype._rand = function _rand(n) {
		      var res = new Uint8Array(n);
		      for (var i = 0; i < res.length; i++)
		        res[i] = this.rand.getByte();
		      return res;
		    };
		  }
		}


	/***/ },
	/* 197 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var aes = __webpack_require__(99)
		var Transform = __webpack_require__(66)
		var inherits = __webpack_require__(2)
		var GHASH = __webpack_require__(369)
		var xor = __webpack_require__(85)
		inherits(StreamCipher, Transform)
		module.exports = StreamCipher

		function StreamCipher (mode, key, iv, decrypt) {
		  if (!(this instanceof StreamCipher)) {
		    return new StreamCipher(mode, key, iv)
		  }
		  Transform.call(this)
		  this._finID = Buffer.concat([iv, new Buffer([0, 0, 0, 1])])
		  iv = Buffer.concat([iv, new Buffer([0, 0, 0, 2])])
		  this._cipher = new aes.AES(key)
		  this._prev = new Buffer(iv.length)
		  this._cache = new Buffer('')
		  this._secCache = new Buffer('')
		  this._decrypt = decrypt
		  this._alen = 0
		  this._len = 0
		  iv.copy(this._prev)
		  this._mode = mode
		  var h = new Buffer(4)
		  h.fill(0)
		  this._ghash = new GHASH(this._cipher.encryptBlock(h))
		  this._authTag = null
		  this._called = false
		}
		StreamCipher.prototype._update = function (chunk) {
		  if (!this._called && this._alen) {
		    var rump = 16 - (this._alen % 16)
		    if (rump < 16) {
		      rump = new Buffer(rump)
		      rump.fill(0)
		      this._ghash.update(rump)
		    }
		  }
		  this._called = true
		  var out = this._mode.encrypt(this, chunk)
		  if (this._decrypt) {
		    this._ghash.update(chunk)
		  } else {
		    this._ghash.update(out)
		  }
		  this._len += chunk.length
		  return out
		}
		StreamCipher.prototype._final = function () {
		  if (this._decrypt && !this._authTag) {
		    throw new Error('Unsupported state or unable to authenticate data')
		  }
		  var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID))
		  if (this._decrypt) {
		    if (xorTest(tag, this._authTag)) {
		      throw new Error('Unsupported state or unable to authenticate data')
		    }
		  } else {
		    this._authTag = tag
		  }
		  this._cipher.scrub()
		}
		StreamCipher.prototype.getAuthTag = function getAuthTag () {
		  if (!this._decrypt && Buffer.isBuffer(this._authTag)) {
		    return this._authTag
		  } else {
		    throw new Error('Attempting to get auth tag in unsupported state')
		  }
		}
		StreamCipher.prototype.setAuthTag = function setAuthTag (tag) {
		  if (this._decrypt) {
		    this._authTag = tag
		  } else {
		    throw new Error('Attempting to set auth tag in unsupported state')
		  }
		}
		StreamCipher.prototype.setAAD = function setAAD (buf) {
		  if (!this._called) {
		    this._ghash.update(buf)
		    this._alen += buf.length
		  } else {
		    throw new Error('Attempting to set AAD in unsupported state')
		  }
		}
		function xorTest (a, b) {
		  var out = 0
		  if (a.length !== b.length) {
		    out++
		  }
		  var len = Math.min(a.length, b.length)
		  var i = -1
		  while (++i < len) {
		    out += (a[i] ^ b[i])
		  }
		  return out
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 198 */
	/***/ function(module, exports, __webpack_require__) {

		var xor = __webpack_require__(85)

		exports.encrypt = function (self, block) {
		  var data = xor(block, self._prev)

		  self._prev = self._cipher.encryptBlock(data)
		  return self._prev
		}

		exports.decrypt = function (self, block) {
		  var pad = self._prev

		  self._prev = block
		  var out = self._cipher.decryptBlock(block)

		  return xor(out, pad)
		}


	/***/ },
	/* 199 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var xor = __webpack_require__(85)

		exports.encrypt = function (self, data, decrypt) {
		  var out = new Buffer('')
		  var len

		  while (data.length) {
		    if (self._cache.length === 0) {
		      self._cache = self._cipher.encryptBlock(self._prev)
		      self._prev = new Buffer('')
		    }

		    if (self._cache.length <= data.length) {
		      len = self._cache.length
		      out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)])
		      data = data.slice(len)
		    } else {
		      out = Buffer.concat([out, encryptStart(self, data, decrypt)])
		      break
		    }
		  }

		  return out
		}
		function encryptStart (self, data, decrypt) {
		  var len = data.length
		  var out = xor(data, self._cache)
		  self._cache = self._cache.slice(len)
		  self._prev = Buffer.concat([self._prev, decrypt ? data : out])
		  return out
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 200 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {function encryptByte (self, byteParam, decrypt) {
		  var pad
		  var i = -1
		  var len = 8
		  var out = 0
		  var bit, value
		  while (++i < len) {
		    pad = self._cipher.encryptBlock(self._prev)
		    bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0
		    value = pad[0] ^ bit
		    out += ((value & 0x80) >> (i % 8))
		    self._prev = shiftIn(self._prev, decrypt ? bit : value)
		  }
		  return out
		}
		exports.encrypt = function (self, chunk, decrypt) {
		  var len = chunk.length
		  var out = new Buffer(len)
		  var i = -1
		  while (++i < len) {
		    out[i] = encryptByte(self, chunk[i], decrypt)
		  }
		  return out
		}
		function shiftIn (buffer, value) {
		  var len = buffer.length
		  var i = -1
		  var out = new Buffer(buffer.length)
		  buffer = Buffer.concat([buffer, new Buffer([value])])
		  while (++i < len) {
		    out[i] = buffer[i] << 1 | buffer[i + 1] >> (7)
		  }
		  return out
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 201 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {function encryptByte (self, byteParam, decrypt) {
		  var pad = self._cipher.encryptBlock(self._prev)
		  var out = pad[0] ^ byteParam
		  self._prev = Buffer.concat([self._prev.slice(1), new Buffer([decrypt ? byteParam : out])])
		  return out
		}
		exports.encrypt = function (self, chunk, decrypt) {
		  var len = chunk.length
		  var out = new Buffer(len)
		  var i = -1
		  while (++i < len) {
		    out[i] = encryptByte(self, chunk[i], decrypt)
		  }
		  return out
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 202 */
	/***/ function(module, exports) {

		exports.encrypt = function (self, block) {
		  return self._cipher.encryptBlock(block)
		}
		exports.decrypt = function (self, block) {
		  return self._cipher.decryptBlock(block)
		}


	/***/ },
	/* 203 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var xor = __webpack_require__(85)

		function getBlock (self) {
		  self._prev = self._cipher.encryptBlock(self._prev)
		  return self._prev
		}

		exports.encrypt = function (self, chunk) {
		  while (self._cache.length < chunk.length) {
		    self._cache = Buffer.concat([self._cache, getBlock(self)])
		  }

		  var pad = self._cache.slice(0, chunk.length)
		  self._cache = self._cache.slice(chunk.length)
		  return xor(chunk, pad)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 204 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var aes = __webpack_require__(99)
		var Transform = __webpack_require__(66)
		var inherits = __webpack_require__(2)

		inherits(StreamCipher, Transform)
		module.exports = StreamCipher
		function StreamCipher (mode, key, iv, decrypt) {
		  if (!(this instanceof StreamCipher)) {
		    return new StreamCipher(mode, key, iv)
		  }
		  Transform.call(this)
		  this._cipher = new aes.AES(key)
		  this._prev = new Buffer(iv.length)
		  this._cache = new Buffer('')
		  this._secCache = new Buffer('')
		  this._decrypt = decrypt
		  iv.copy(this._prev)
		  this._mode = mode
		}
		StreamCipher.prototype._update = function (chunk) {
		  return this._mode.encrypt(this, chunk, this._decrypt)
		}
		StreamCipher.prototype._final = function () {
		  this._cipher.scrub()
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 205 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict'
		exports['RSA-SHA224'] = exports.sha224WithRSAEncryption = {
		  sign: 'rsa',
		  hash: 'sha224',
		  id: new Buffer('302d300d06096086480165030402040500041c', 'hex')
		}
		exports['RSA-SHA256'] = exports.sha256WithRSAEncryption = {
		  sign: 'rsa',
		  hash: 'sha256',
		  id: new Buffer('3031300d060960864801650304020105000420', 'hex')
		}
		exports['RSA-SHA384'] = exports.sha384WithRSAEncryption = {
		  sign: 'rsa',
		  hash: 'sha384',
		  id: new Buffer('3041300d060960864801650304020205000430', 'hex')
		}
		exports['RSA-SHA512'] = exports.sha512WithRSAEncryption = {
		  sign: 'rsa',
		  hash: 'sha512',
		  id: new Buffer('3051300d060960864801650304020305000440', 'hex')
		}
		exports['RSA-SHA1'] = {
		  sign: 'rsa',
		  hash: 'sha1',
		  id: new Buffer('3021300906052b0e03021a05000414', 'hex')
		}
		exports['ecdsa-with-SHA1'] = {
		  sign: 'ecdsa',
		  hash: 'sha1',
		  id: new Buffer('', 'hex')
		}

		exports.DSA = exports['DSA-SHA1'] = exports['DSA-SHA'] = {
		  sign: 'dsa',
		  hash: 'sha1',
		  id: new Buffer('', 'hex')
		}
		exports['DSA-SHA224'] = exports['DSA-WITH-SHA224'] = {
		  sign: 'dsa',
		  hash: 'sha224',
		  id: new Buffer('', 'hex')
		}
		exports['DSA-SHA256'] = exports['DSA-WITH-SHA256'] = {
		  sign: 'dsa',
		  hash: 'sha256',
		  id: new Buffer('', 'hex')
		}
		exports['DSA-SHA384'] = exports['DSA-WITH-SHA384'] = {
		  sign: 'dsa',
		  hash: 'sha384',
		  id: new Buffer('', 'hex')
		}
		exports['DSA-SHA512'] = exports['DSA-WITH-SHA512'] = {
		  sign: 'dsa',
		  hash: 'sha512',
		  id: new Buffer('', 'hex')
		}
		exports['DSA-RIPEMD160'] = {
		  sign: 'dsa',
		  hash: 'rmd160',
		  id: new Buffer('', 'hex')
		}
		exports['RSA-RIPEMD160'] = exports.ripemd160WithRSA = {
		  sign: 'rsa',
		  hash: 'rmd160',
		  id: new Buffer('3021300906052b2403020105000414', 'hex')
		}
		exports['RSA-MD5'] = exports.md5WithRSAEncryption = {
		  sign: 'rsa',
		  hash: 'md5',
		  id: new Buffer('3020300c06082a864886f70d020505000410', 'hex')
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 206 */
	/***/ function(module, exports) {

		"use strict";
		'use strict'
		exports['1.3.132.0.10'] = 'secp256k1'

		exports['1.3.132.0.33'] = 'p224'

		exports['1.2.840.10045.3.1.1'] = 'p192'

		exports['1.2.840.10045.3.1.7'] = 'p256'

		exports['1.3.132.0.34'] = 'p384'

		exports['1.3.132.0.35'] = 'p521'


	/***/ },
	/* 207 */
	/***/ function(module, exports) {

		// 7.2.1 RequireObjectCoercible(argument)
		module.exports = function(it){
		  if(it == undefined)throw TypeError("Can't call method on  " + it);
		  return it;
		};

	/***/ },
	/* 208 */
	/***/ function(module, exports) {

		// 7.1.4 ToInteger
		var ceil  = Math.ceil
		  , floor = Math.floor;
		module.exports = function(it){
		  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);
		};

	/***/ },
	/* 209 */
	/***/ function(module, exports, __webpack_require__) {

		// to indexed object, toObject with fallback for non-array-like ES3 strings
		var IObject = __webpack_require__(393)
		  , defined = __webpack_require__(207);
		module.exports = function(it){
		  return IObject(defined(it));
		};

	/***/ },
	/* 210 */
	/***/ function(module, exports, __webpack_require__) {

		var cof = __webpack_require__(36);
		module.exports = function(it, msg){
		  if(typeof it != 'number' && cof(it) != 'Number')throw TypeError(msg);
		  return +it;
		};

	/***/ },
	/* 211 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)
		'use strict';
		var toObject = __webpack_require__(22)
		  , toIndex  = __webpack_require__(60)
		  , toLength = __webpack_require__(20);

		module.exports = [].copyWithin || function copyWithin(target/*= 0*/, start/*= 0, end = @length*/){
		  var O     = toObject(this)
		    , len   = toLength(O.length)
		    , to    = toIndex(target, len)
		    , from  = toIndex(start, len)
		    , end   = arguments.length > 2 ? arguments[2] : undefined
		    , count = Math.min((end === undefined ? len : toIndex(end, len)) - from, len - to)
		    , inc   = 1;
		  if(from < to && to < from + count){
		    inc  = -1;
		    from += count - 1;
		    to   += count - 1;
		  }
		  while(count-- > 0){
		    if(from in O)O[to] = O[from];
		    else delete O[to];
		    to   += inc;
		    from += inc;
		  } return O;
		};

	/***/ },
	/* 212 */
	/***/ function(module, exports, __webpack_require__) {

		var forOf = __webpack_require__(69);

		module.exports = function(iter, ITERATOR){
		  var result = [];
		  forOf(iter, false, result.push, result, ITERATOR);
		  return result;
		};


	/***/ },
	/* 213 */
	/***/ function(module, exports, __webpack_require__) {

		var aFunction = __webpack_require__(27)
		  , toObject  = __webpack_require__(22)
		  , IObject   = __webpack_require__(86)
		  , toLength  = __webpack_require__(20);

		module.exports = function(that, callbackfn, aLen, memo, isRight){
		  aFunction(callbackfn);
		  var O      = toObject(that)
		    , self   = IObject(O)
		    , length = toLength(O.length)
		    , index  = isRight ? length - 1 : 0
		    , i      = isRight ? -1 : 1;
		  if(aLen < 2)for(;;){
		    if(index in self){
		      memo = self[index];
		      index += i;
		      break;
		    }
		    index += i;
		    if(isRight ? index < 0 : length <= index){
		      throw TypeError('Reduce of empty array with no initial value');
		    }
		  }
		  for(;isRight ? index >= 0 : length > index; index += i)if(index in self){
		    memo = callbackfn(memo, self[index], index, O);
		  }
		  return memo;
		};

	/***/ },
	/* 214 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var aFunction  = __webpack_require__(27)
		  , isObject   = __webpack_require__(12)
		  , invoke     = __webpack_require__(107)
		  , arraySlice = [].slice
		  , factories  = {};

		var construct = function(F, len, args){
		  if(!(len in factories)){
		    for(var n = [], i = 0; i < len; i++)n[i] = 'a[' + i + ']';
		    factories[len] = Function('F,a', 'return new F(' + n.join(',') + ')');
		  } return factories[len](F, args);
		};

		module.exports = Function.bind || function bind(that /*, args... */){
		  var fn       = aFunction(this)
		    , partArgs = arraySlice.call(arguments, 1);
		  var bound = function(/* args... */){
		    var args = partArgs.concat(arraySlice.call(arguments));
		    return this instanceof bound ? construct(fn, args.length, args) : invoke(fn, args, that);
		  };
		  if(isObject(fn.prototype))bound.prototype = fn.prototype;
		  return bound;
		};

	/***/ },
	/* 215 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var dP          = __webpack_require__(16).f
		  , create      = __webpack_require__(55)
		  , hide        = __webpack_require__(25)
		  , redefineAll = __webpack_require__(58)
		  , ctx         = __webpack_require__(44)
		  , anInstance  = __webpack_require__(49)
		  , defined     = __webpack_require__(37)
		  , forOf       = __webpack_require__(69)
		  , $iterDefine = __webpack_require__(151)
		  , step        = __webpack_require__(220)
		  , setSpecies  = __webpack_require__(59)
		  , DESCRIPTORS = __webpack_require__(15)
		  , fastKey     = __webpack_require__(50).fastKey
		  , SIZE        = DESCRIPTORS ? '_s' : 'size';

		var getEntry = function(that, key){
		  // fast case
		  var index = fastKey(key), entry;
		  if(index !== 'F')return that._i[index];
		  // frozen object case
		  for(entry = that._f; entry; entry = entry.n){
		    if(entry.k == key)return entry;
		  }
		};

		module.exports = {
		  getConstructor: function(wrapper, NAME, IS_MAP, ADDER){
		    var C = wrapper(function(that, iterable){
		      anInstance(that, C, NAME, '_i');
		      that._i = create(null); // index
		      that._f = undefined;    // first entry
		      that._l = undefined;    // last entry
		      that[SIZE] = 0;         // size
		      if(iterable != undefined)forOf(iterable, IS_MAP, that[ADDER], that);
		    });
		    redefineAll(C.prototype, {
		      // 23.1.3.1 Map.prototype.clear()
		      // 23.2.3.2 Set.prototype.clear()
		      clear: function clear(){
		        for(var that = this, data = that._i, entry = that._f; entry; entry = entry.n){
		          entry.r = true;
		          if(entry.p)entry.p = entry.p.n = undefined;
		          delete data[entry.i];
		        }
		        that._f = that._l = undefined;
		        that[SIZE] = 0;
		      },
		      // 23.1.3.3 Map.prototype.delete(key)
		      // 23.2.3.4 Set.prototype.delete(value)
		      'delete': function(key){
		        var that  = this
		          , entry = getEntry(that, key);
		        if(entry){
		          var next = entry.n
		            , prev = entry.p;
		          delete that._i[entry.i];
		          entry.r = true;
		          if(prev)prev.n = next;
		          if(next)next.p = prev;
		          if(that._f == entry)that._f = next;
		          if(that._l == entry)that._l = prev;
		          that[SIZE]--;
		        } return !!entry;
		      },
		      // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)
		      // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)
		      forEach: function forEach(callbackfn /*, that = undefined */){
		        anInstance(this, C, 'forEach');
		        var f = ctx(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3)
		          , entry;
		        while(entry = entry ? entry.n : this._f){
		          f(entry.v, entry.k, this);
		          // revert to the last existing entry
		          while(entry && entry.r)entry = entry.p;
		        }
		      },
		      // 23.1.3.7 Map.prototype.has(key)
		      // 23.2.3.7 Set.prototype.has(value)
		      has: function has(key){
		        return !!getEntry(this, key);
		      }
		    });
		    if(DESCRIPTORS)dP(C.prototype, 'size', {
		      get: function(){
		        return defined(this[SIZE]);
		      }
		    });
		    return C;
		  },
		  def: function(that, key, value){
		    var entry = getEntry(that, key)
		      , prev, index;
		    // change existing entry
		    if(entry){
		      entry.v = value;
		    // create new entry
		    } else {
		      that._l = entry = {
		        i: index = fastKey(key, true), // <- index
		        k: key,                        // <- key
		        v: value,                      // <- value
		        p: prev = that._l,             // <- previous entry
		        n: undefined,                  // <- next entry
		        r: false                       // <- removed
		      };
		      if(!that._f)that._f = entry;
		      if(prev)prev.n = entry;
		      that[SIZE]++;
		      // add to index
		      if(index !== 'F')that._i[index] = entry;
		    } return that;
		  },
		  getEntry: getEntry,
		  setStrong: function(C, NAME, IS_MAP){
		    // add .keys, .values, .entries, [@@iterator]
		    // 23.1.3.4, 23.1.3.8, 23.1.3.11, 23.1.3.12, 23.2.3.5, 23.2.3.8, 23.2.3.10, 23.2.3.11
		    $iterDefine(C, NAME, function(iterated, kind){
		      this._t = iterated;  // target
		      this._k = kind;      // kind
		      this._l = undefined; // previous
		    }, function(){
		      var that  = this
		        , kind  = that._k
		        , entry = that._l;
		      // revert to the last existing entry
		      while(entry && entry.r)entry = entry.p;
		      // get next entry
		      if(!that._t || !(that._l = entry = entry ? entry.n : that._t._f)){
		        // or finish the iteration
		        that._t = undefined;
		        return step(1);
		      }
		      // return step by kind
		      if(kind == 'keys'  )return step(0, entry.k);
		      if(kind == 'values')return step(0, entry.v);
		      return step(0, [entry.k, entry.v]);
		    }, IS_MAP ? 'entries' : 'values' , !IS_MAP, true);

		    // add [@@species], 23.1.2.2, 23.2.2.2
		    setSpecies(NAME);
		  }
		};

	/***/ },
	/* 216 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/DavidBruant/Map-Set.prototype.toJSON
		var classof = __webpack_require__(68)
		  , from    = __webpack_require__(212);
		module.exports = function(NAME){
		  return function toJSON(){
		    if(classof(this) != NAME)throw TypeError(NAME + "#toJSON isn't generic");
		    return from(this);
		  };
		};

	/***/ },
	/* 217 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var redefineAll       = __webpack_require__(58)
		  , getWeak           = __webpack_require__(50).getWeak
		  , anObject          = __webpack_require__(6)
		  , isObject          = __webpack_require__(12)
		  , anInstance        = __webpack_require__(49)
		  , forOf             = __webpack_require__(69)
		  , createArrayMethod = __webpack_require__(39)
		  , $has              = __webpack_require__(23)
		  , arrayFind         = createArrayMethod(5)
		  , arrayFindIndex    = createArrayMethod(6)
		  , id                = 0;

		// fallback for uncaught frozen keys
		var uncaughtFrozenStore = function(that){
		  return that._l || (that._l = new UncaughtFrozenStore);
		};
		var UncaughtFrozenStore = function(){
		  this.a = [];
		};
		var findUncaughtFrozen = function(store, key){
		  return arrayFind(store.a, function(it){
		    return it[0] === key;
		  });
		};
		UncaughtFrozenStore.prototype = {
		  get: function(key){
		    var entry = findUncaughtFrozen(this, key);
		    if(entry)return entry[1];
		  },
		  has: function(key){
		    return !!findUncaughtFrozen(this, key);
		  },
		  set: function(key, value){
		    var entry = findUncaughtFrozen(this, key);
		    if(entry)entry[1] = value;
		    else this.a.push([key, value]);
		  },
		  'delete': function(key){
		    var index = arrayFindIndex(this.a, function(it){
		      return it[0] === key;
		    });
		    if(~index)this.a.splice(index, 1);
		    return !!~index;
		  }
		};

		module.exports = {
		  getConstructor: function(wrapper, NAME, IS_MAP, ADDER){
		    var C = wrapper(function(that, iterable){
		      anInstance(that, C, NAME, '_i');
		      that._i = id++;      // collection id
		      that._l = undefined; // leak store for uncaught frozen objects
		      if(iterable != undefined)forOf(iterable, IS_MAP, that[ADDER], that);
		    });
		    redefineAll(C.prototype, {
		      // 23.3.3.2 WeakMap.prototype.delete(key)
		      // 23.4.3.3 WeakSet.prototype.delete(value)
		      'delete': function(key){
		        if(!isObject(key))return false;
		        var data = getWeak(key);
		        if(data === true)return uncaughtFrozenStore(this)['delete'](key);
		        return data && $has(data, this._i) && delete data[this._i];
		      },
		      // 23.3.3.4 WeakMap.prototype.has(key)
		      // 23.4.3.4 WeakSet.prototype.has(value)
		      has: function has(key){
		        if(!isObject(key))return false;
		        var data = getWeak(key);
		        if(data === true)return uncaughtFrozenStore(this).has(key);
		        return data && $has(data, this._i);
		      }
		    });
		    return C;
		  },
		  def: function(that, key, value){
		    var data = getWeak(anObject(key), true);
		    if(data === true)uncaughtFrozenStore(that).set(key, value);
		    else data[that._i] = value;
		    return that;
		  },
		  ufstore: uncaughtFrozenStore
		};

	/***/ },
	/* 218 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = !__webpack_require__(15) && !__webpack_require__(9)(function(){
		  return Object.defineProperty(__webpack_require__(142)('div'), 'a', {get: function(){ return 7; }}).a != 7;
		});

	/***/ },
	/* 219 */
	/***/ function(module, exports, __webpack_require__) {

		// call something on iterator step with safe closing on error
		var anObject = __webpack_require__(6);
		module.exports = function(iterator, fn, value, entries){
		  try {
		    return entries ? fn(anObject(value)[0], value[1]) : fn(value);
		  // 7.4.6 IteratorClose(iterator, completion)
		  } catch(e){
		    var ret = iterator['return'];
		    if(ret !== undefined)anObject(ret.call(iterator));
		    throw e;
		  }
		};

	/***/ },
	/* 220 */
	/***/ function(module, exports) {

		module.exports = function(done, value){
		  return {value: value, done: !!done};
		};

	/***/ },
	/* 221 */
	/***/ function(module, exports) {

		// 20.2.2.20 Math.log1p(x)
		module.exports = Math.log1p || function log1p(x){
		  return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : Math.log(1 + x);
		};

	/***/ },
	/* 222 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 19.1.2.1 Object.assign(target, source, ...)
		var getKeys  = __webpack_require__(57)
		  , gOPS     = __webpack_require__(111)
		  , pIE      = __webpack_require__(87)
		  , toObject = __webpack_require__(22)
		  , IObject  = __webpack_require__(86)
		  , $assign  = Object.assign;

		// should work with symbols and should have deterministic property order (V8 bug)
		module.exports = !$assign || __webpack_require__(9)(function(){
		  var A = {}
		    , B = {}
		    , S = Symbol()
		    , K = 'abcdefghijklmnopqrst';
		  A[S] = 7;
		  K.split('').forEach(function(k){ B[k] = k; });
		  return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;
		}) ? function assign(target, source){ // eslint-disable-line no-unused-vars
		  var T     = toObject(target)
		    , aLen  = arguments.length
		    , index = 1
		    , getSymbols = gOPS.f
		    , isEnum     = pIE.f;
		  while(aLen > index){
		    var S      = IObject(arguments[index++])
		      , keys   = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S)
		      , length = keys.length
		      , j      = 0
		      , key;
		    while(length > j)if(isEnum.call(S, key = keys[j++]))T[key] = S[key];
		  } return T;
		} : $assign;

	/***/ },
	/* 223 */
	/***/ function(module, exports, __webpack_require__) {

		var dP       = __webpack_require__(16)
		  , anObject = __webpack_require__(6)
		  , getKeys  = __webpack_require__(57);

		module.exports = __webpack_require__(15) ? Object.defineProperties : function defineProperties(O, Properties){
		  anObject(O);
		  var keys   = getKeys(Properties)
		    , length = keys.length
		    , i = 0
		    , P;
		  while(length > i)dP.f(O, P = keys[i++], Properties[P]);
		  return O;
		};

	/***/ },
	/* 224 */
	/***/ function(module, exports, __webpack_require__) {

		// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window
		var toIObject = __webpack_require__(30)
		  , gOPN      = __webpack_require__(56).f
		  , toString  = {}.toString;

		var windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames
		  ? Object.getOwnPropertyNames(window) : [];

		var getWindowNames = function(it){
		  try {
		    return gOPN(it);
		  } catch(e){
		    return windowNames.slice();
		  }
		};

		module.exports.f = function getOwnPropertyNames(it){
		  return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it));
		};


	/***/ },
	/* 225 */
	/***/ function(module, exports, __webpack_require__) {

		var has          = __webpack_require__(23)
		  , toIObject    = __webpack_require__(30)
		  , arrayIndexOf = __webpack_require__(103)(false)
		  , IE_PROTO     = __webpack_require__(155)('IE_PROTO');

		module.exports = function(object, names){
		  var O      = toIObject(object)
		    , i      = 0
		    , result = []
		    , key;
		  for(key in O)if(key != IE_PROTO)has(O, key) && result.push(key);
		  // Don't enum bug & hidden keys
		  while(names.length > i)if(has(O, key = names[i++])){
		    ~arrayIndexOf(result, key) || result.push(key);
		  }
		  return result;
		};

	/***/ },
	/* 226 */
	/***/ function(module, exports, __webpack_require__) {

		var getKeys   = __webpack_require__(57)
		  , toIObject = __webpack_require__(30)
		  , isEnum    = __webpack_require__(87).f;
		module.exports = function(isEntries){
		  return function(it){
		    var O      = toIObject(it)
		      , keys   = getKeys(O)
		      , length = keys.length
		      , i      = 0
		      , result = []
		      , key;
		    while(length > i)if(isEnum.call(O, key = keys[i++])){
		      result.push(isEntries ? [key, O[key]] : O[key]);
		    } return result;
		  };
		};

	/***/ },
	/* 227 */
	/***/ function(module, exports, __webpack_require__) {

		// all object keys, includes non-enumerable and symbols
		var gOPN     = __webpack_require__(56)
		  , gOPS     = __webpack_require__(111)
		  , anObject = __webpack_require__(6)
		  , Reflect  = __webpack_require__(8).Reflect;
		module.exports = Reflect && Reflect.ownKeys || function ownKeys(it){
		  var keys       = gOPN.f(anObject(it))
		    , getSymbols = gOPS.f;
		  return getSymbols ? keys.concat(getSymbols(it)) : keys;
		};

	/***/ },
	/* 228 */
	/***/ function(module, exports, __webpack_require__) {

		var $parseFloat = __webpack_require__(8).parseFloat
		  , $trim       = __webpack_require__(71).trim;

		module.exports = 1 / $parseFloat(__webpack_require__(160) + '-0') !== -Infinity ? function parseFloat(str){
		  var string = $trim(String(str), 3)
		    , result = $parseFloat(string);
		  return result === 0 && string.charAt(0) == '-' ? -0 : result;
		} : $parseFloat;

	/***/ },
	/* 229 */
	/***/ function(module, exports, __webpack_require__) {

		var $parseInt = __webpack_require__(8).parseInt
		  , $trim     = __webpack_require__(71).trim
		  , ws        = __webpack_require__(160)
		  , hex       = /^[\-+]?0[xX]/;

		module.exports = $parseInt(ws + '08') !== 8 || $parseInt(ws + '0x16') !== 22 ? function parseInt(str, radix){
		  var string = $trim(String(str), 3);
		  return $parseInt(string, (radix >>> 0) || (hex.test(string) ? 16 : 10));
		} : $parseInt;

	/***/ },
	/* 230 */
	/***/ function(module, exports) {

		// 7.2.9 SameValue(x, y)
		module.exports = Object.is || function is(x, y){
		  return x === y ? x !== 0 || 1 / x === 1 / y : x != x && y != y;
		};

	/***/ },
	/* 231 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/tc39/proposal-string-pad-start-end
		var toLength = __webpack_require__(20)
		  , repeat   = __webpack_require__(159)
		  , defined  = __webpack_require__(37);

		module.exports = function(that, maxLength, fillString, left){
		  var S            = String(defined(that))
		    , stringLength = S.length
		    , fillStr      = fillString === undefined ? ' ' : String(fillString)
		    , intMaxLength = toLength(maxLength);
		  if(intMaxLength <= stringLength || fillStr == '')return S;
		  var fillLen = intMaxLength - stringLength
		    , stringFiller = repeat.call(fillStr, Math.ceil(fillLen / fillStr.length));
		  if(stringFiller.length > fillLen)stringFiller = stringFiller.slice(0, fillLen);
		  return left ? stringFiller + S : S + stringFiller;
		};


	/***/ },
	/* 232 */
	/***/ function(module, exports, __webpack_require__) {

		exports.f = __webpack_require__(13);

	/***/ },
	/* 233 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var strong = __webpack_require__(215);

		// 23.1 Map Objects
		module.exports = __webpack_require__(104)('Map', function(get){
		  return function Map(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); };
		}, {
		  // 23.1.3.6 Map.prototype.get(key)
		  get: function get(key){
		    var entry = strong.getEntry(this, key);
		    return entry && entry.v;
		  },
		  // 23.1.3.9 Map.prototype.set(key, value)
		  set: function set(key, value){
		    return strong.def(this, key === 0 ? 0 : key, value);
		  }
		}, strong, true);

	/***/ },
	/* 234 */
	/***/ function(module, exports, __webpack_require__) {

		// 21.2.5.3 get RegExp.prototype.flags()
		if(__webpack_require__(15) && /./g.flags != 'g')__webpack_require__(16).f(RegExp.prototype, 'flags', {
		  configurable: true,
		  get: __webpack_require__(106)
		});

	/***/ },
	/* 235 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var strong = __webpack_require__(215);

		// 23.2 Set Objects
		module.exports = __webpack_require__(104)('Set', function(get){
		  return function Set(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); };
		}, {
		  // 23.2.3.1 Set.prototype.add(value)
		  add: function add(value){
		    return strong.def(this, value = value === 0 ? 0 : value, value);
		  }
		}, strong);

	/***/ },
	/* 236 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var each         = __webpack_require__(39)(0)
		  , redefine     = __webpack_require__(28)
		  , meta         = __webpack_require__(50)
		  , assign       = __webpack_require__(222)
		  , weak         = __webpack_require__(217)
		  , isObject     = __webpack_require__(12)
		  , has          = __webpack_require__(23)
		  , getWeak      = meta.getWeak
		  , isExtensible = Object.isExtensible
		  , uncaughtFrozenStore = weak.ufstore
		  , tmp          = {}
		  , InternalMap;

		var wrapper = function(get){
		  return function WeakMap(){
		    return get(this, arguments.length > 0 ? arguments[0] : undefined);
		  };
		};

		var methods = {
		  // 23.3.3.3 WeakMap.prototype.get(key)
		  get: function get(key){
		    if(isObject(key)){
		      var data = getWeak(key);
		      if(data === true)return uncaughtFrozenStore(this).get(key);
		      return data ? data[this._i] : undefined;
		    }
		  },
		  // 23.3.3.5 WeakMap.prototype.set(key, value)
		  set: function set(key, value){
		    return weak.def(this, key, value);
		  }
		};

		// 23.3 WeakMap Objects
		var $WeakMap = module.exports = __webpack_require__(104)('WeakMap', wrapper, methods, weak, true, true);

		// IE11 WeakMap frozen keys fix
		if(new $WeakMap().set((Object.freeze || Object)(tmp), 7).get(tmp) != 7){
		  InternalMap = weak.getConstructor(wrapper);
		  assign(InternalMap.prototype, methods);
		  meta.NEED = true;
		  each(['delete', 'has', 'get', 'set'], function(key){
		    var proto  = $WeakMap.prototype
		      , method = proto[key];
		    redefine(proto, key, function(a, b){
		      // store frozen objects on internal weakmap shim
		      if(isObject(a) && !isExtensible(a)){
		        if(!this._f)this._f = new InternalMap;
		        var result = this._f[key](a, b);
		        return key == 'set' ? this : result;
		      // store all the rest on native weakmap
		      } return method.call(this, a, b);
		    });
		  });
		}

	/***/ },
	/* 237 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		/*
		 * 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__(589);

		/*
		 * 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);
		};

	/***/ },
	/* 238 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict'

		exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = __webpack_require__(91)
		exports.createHash = exports.Hash = __webpack_require__(72)
		exports.createHmac = exports.Hmac = __webpack_require__(166)

		var hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(Object.keys(__webpack_require__(205)))
		exports.getHashes = function () {
		  return hashes
		}

		var p = __webpack_require__(267)
		exports.pbkdf2 = p.pbkdf2
		exports.pbkdf2Sync = p.pbkdf2Sync

		var aes = __webpack_require__(370)
		;[
		  'Cipher',
		  'createCipher',
		  'Cipheriv',
		  'createCipheriv',
		  'Decipher',
		  'createDecipher',
		  'Decipheriv',
		  'createDecipheriv',
		  'getCiphers',
		  'listCiphers'
		].forEach(function (key) {
		  exports[key] = aes[key]
		})

		var dh = __webpack_require__(599)
		;[
		  'DiffieHellmanGroup',
		  'createDiffieHellmanGroup',
		  'getDiffieHellman',
		  'createDiffieHellman',
		  'DiffieHellman'
		].forEach(function (key) {
		  exports[key] = dh[key]
		})

		var sign = __webpack_require__(373)
		;[
		  'createSign',
		  'Sign',
		  'createVerify',
		  'Verify'
		].forEach(function (key) {
		  exports[key] = sign[key]
		})

		exports.createECDH = __webpack_require__(588)

		var publicEncrypt = __webpack_require__(729)

		;[
		  'publicEncrypt',
		  'privateEncrypt',
		  'publicDecrypt',
		  'privateDecrypt'
		].forEach(function (key) {
		  exports[key] = publicEncrypt[key]
		})

		// the least I can do is make error messages for the rest of the node.js/crypto api.
		;[
		  'createCredentials'
		].forEach(function (name) {
		  exports[name] = function () {
		    throw new Error([
		      'sorry, ' + name + ' is not implemented yet',
		      'we accept pull requests',
		      'https://github.com/crypto-browserify/crypto-browserify'
		    ].join('\n'))
		  }
		})


	/***/ },
	/* 239 */
	/***/ function(module, exports, __webpack_require__) {

		var randomBytes = __webpack_require__(91);
		module.exports = findPrime;
		findPrime.simpleSieve = simpleSieve;
		findPrime.fermatTest = fermatTest;
		var BN = __webpack_require__(19);
		var TWENTYFOUR = new BN(24);
		var MillerRabin = __webpack_require__(263);
		var millerRabin = new MillerRabin();
		var ONE = new BN(1);
		var TWO = new BN(2);
		var FIVE = new BN(5);
		var SIXTEEN = new BN(16);
		var EIGHT = new BN(8);
		var TEN = new BN(10);
		var THREE = new BN(3);
		var SEVEN = new BN(7);
		var ELEVEN = new BN(11);
		var FOUR = new BN(4);
		var TWELVE = new BN(12);
		var primes = null;

		function _getPrimes() {
		  if (primes !== null)
		    return primes;

		  var limit = 0x100000;
		  var res = [];
		  res[0] = 2;
		  for (var i = 1, k = 3; k < limit; k += 2) {
		    var sqrt = Math.ceil(Math.sqrt(k));
		    for (var j = 0; j < i && res[j] <= sqrt; j++)
		      if (k % res[j] === 0)
		        break;

		    if (i !== j && res[j] <= sqrt)
		      continue;

		    res[i++] = k;
		  }
		  primes = res;
		  return res;
		}

		function simpleSieve(p) {
		  var primes = _getPrimes();

		  for (var i = 0; i < primes.length; i++)
		    if (p.modn(primes[i]) === 0) {
		      if (p.cmpn(primes[i]) === 0) {
		        return true;
		      } else {
		        return false;
		      }
		    }

		  return true;
		}

		function fermatTest(p) {
		  var red = BN.mont(p);
		  return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;
		}

		function findPrime(bits, gen) {
		  if (bits < 16) {
		    // this is what openssl does
		    if (gen === 2 || gen === 5) {
		      return new BN([0x8c, 0x7b]);
		    } else {
		      return new BN([0x8c, 0x27]);
		    }
		  }
		  gen = new BN(gen);

		  var num, n2;

		  while (true) {
		    num = new BN(randomBytes(Math.ceil(bits / 8)));
		    while (num.bitLength() > bits) {
		      num.ishrn(1);
		    }
		    if (num.isEven()) {
		      num.iadd(ONE);
		    }
		    if (!num.testn(1)) {
		      num.iadd(TWO);
		    }
		    if (!gen.cmp(TWO)) {
		      while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {
		        num.iadd(FOUR);
		      }
		    } else if (!gen.cmp(FIVE)) {
		      while (num.mod(TEN).cmp(THREE)) {
		        num.iadd(FOUR);
		      }
		    }
		    n2 = num.shrn(1);
		    if (simpleSieve(n2) && simpleSieve(num) &&
		      fermatTest(n2) && fermatTest(num) &&
		      millerRabin.test(n2) && millerRabin.test(num)) {
		      return num;
		    }
		  }

		}


	/***/ },
	/* 240 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = DuplexPassThrough

		var util = __webpack_require__(11)

		var stream = __webpack_require__(5)
		var Duplex = stream.Duplex
		var PassThrough = stream.PassThrough

		util.inherits(DuplexPassThrough, Duplex)

		function DuplexPassThrough (stream, options) {
		  if (!(this instanceof DuplexPassThrough)) {
		    return new DuplexPassThrough(options)
		  }

		  this._reader = new PassThrough(options)
		  this._writer = new PassThrough(options)
		  Duplex.call(this, options)

		  if (stream) {
		    this.wrapStream(stream)
		  }

		  this._reader.on('error', this.emit.bind(this))
		  this._writer.on('error', this.emit.bind(this))

		  this._readableState = this._reader._readableState
		  this._writableState = this._writer._writableState
		}

		DuplexPassThrough.prototype.wrapStream = function (stream) {
		  this._stream = stream
		  this._writer.pipe(stream).pipe(this._reader)
		  this._reader.read(0)
		  this._writer.read(0)
		  stream.read(0)
		}

		DuplexPassThrough.prototype.on = function (ev, fn) {
		  switch (ev) {
		    case 'data':
		    case 'end':
		    case 'readable':
		      return this._reader.on(ev, fn)
		    case 'drain':
		    case 'finish':
		      return this._writer.on(ev, fn)
		    default:
		      return Duplex.prototype.on.call(this, ev, fn)
		  }
		}

		DuplexPassThrough.prototype.addListener = DuplexPassThrough.prototype.on

		DuplexPassThrough.prototype.pipe = function (dest, opts) {
		  return this._reader.pipe(dest, opts)
		}

		DuplexPassThrough.prototype.setEncoding = function (enc) {
		  return this._reader.setEncoding(enc)
		}

		DuplexPassThrough.prototype.read = function (size) {
		  return this._reader.read(size)
		}

		DuplexPassThrough.prototype.end = function (chunk, enc, cb) {
		  return this._writer.end(chunk, enc, cb)
		}

		DuplexPassThrough.prototype.write = function (chunk, enc, cb) {
		  return this._writer.write(chunk, enc, cb)
		}


	/***/ },
	/* 241 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(788);
		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__(73);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(73);

		  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__(14).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__(3)))

	/***/ },
	/* 242 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(73);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 243 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(73);

		  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__(73);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 244 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(789);
		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__(74);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(74);

		  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__(14).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__(3)))

	/***/ },
	/* 245 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(74);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 246 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(74);

		  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__(74);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 247 */
	/***/ function(module, exports, __webpack_require__) {

		var util = __webpack_require__(11)

		var INDENT_START = /[\{\[]/
		var INDENT_END = /[\}\]]/

		module.exports = function() {
		  var lines = []
		  var indent = 0

		  var push = function(str) {
		    var spaces = ''
		    while (spaces.length < indent*2) spaces += '  '
		    lines.push(spaces+str)
		  }

		  var line = function(fmt) {
		    if (!fmt) return line

		    if (INDENT_END.test(fmt.trim()[0]) && INDENT_START.test(fmt[fmt.length-1])) {
		      indent--
		      push(util.format.apply(util, arguments))
		      indent++
		      return line
		    }
		    if (INDENT_START.test(fmt[fmt.length-1])) {
		      push(util.format.apply(util, arguments))
		      indent++
		      return line
		    }
		    if (INDENT_END.test(fmt.trim()[0])) {
		      indent--
		      push(util.format.apply(util, arguments))
		      return line
		    }

		    push(util.format.apply(util, arguments))
		    return line
		  }

		  line.toString = function() {
		    return lines.join('\n')
		  }

		  line.toFunction = function(scope) {
		    var src = 'return ('+line.toString()+')'

		    var keys = Object.keys(scope || {}).map(function(key) {
		      return key
		    })

		    var vals = keys.map(function(key) {
		      return scope[key]
		    })

		    return Function.apply(null, keys.concat(src)).apply(null, vals)
		  }

		  if (arguments.length) line.apply(null, arguments)

		  return line
		}


	/***/ },
	/* 248 */
	/***/ function(module, exports, __webpack_require__) {

		var isProperty = __webpack_require__(648)

		var gen = function(obj, prop) {
		  return isProperty(prop) ? obj+'.'+prop : obj+'['+JSON.stringify(prop)+']'
		}

		gen.valid = isProperty
		gen.property = function (prop) {
		 return isProperty(prop) ? prop : JSON.stringify(prop)
		}

		module.exports = gen


	/***/ },
	/* 249 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {exports.alphasort = alphasort
		exports.alphasorti = alphasorti
		exports.setopts = setopts
		exports.ownProp = ownProp
		exports.makeAbs = makeAbs
		exports.finish = finish
		exports.mark = mark
		exports.isIgnored = isIgnored
		exports.childrenIgnored = childrenIgnored

		function ownProp (obj, field) {
		  return Object.prototype.hasOwnProperty.call(obj, field)
		}

		var path = __webpack_require__(31)
		var minimatch = __webpack_require__(172)
		var isAbsolute = __webpack_require__(175)
		var Minimatch = minimatch.Minimatch

		function alphasorti (a, b) {
		  return a.toLowerCase().localeCompare(b.toLowerCase())
		}

		function alphasort (a, b) {
		  return a.localeCompare(b)
		}

		function setupIgnores (self, options) {
		  self.ignore = options.ignore || []

		  if (!Array.isArray(self.ignore))
		    self.ignore = [self.ignore]

		  if (self.ignore.length) {
		    self.ignore = self.ignore.map(ignoreMap)
		  }
		}

		// ignore patterns are always in dot:true mode.
		function ignoreMap (pattern) {
		  var gmatcher = null
		  if (pattern.slice(-3) === '/**') {
		    var gpattern = pattern.replace(/(\/\*\*)+$/, '')
		    gmatcher = new Minimatch(gpattern, { dot: true })
		  }

		  return {
		    matcher: new Minimatch(pattern, { dot: true }),
		    gmatcher: gmatcher
		  }
		}

		function setopts (self, pattern, options) {
		  if (!options)
		    options = {}

		  // base-matching: just use globstar for that.
		  if (options.matchBase && -1 === pattern.indexOf("/")) {
		    if (options.noglobstar) {
		      throw new Error("base matching requires globstar")
		    }
		    pattern = "**/" + pattern
		  }

		  self.silent = !!options.silent
		  self.pattern = pattern
		  self.strict = options.strict !== false
		  self.realpath = !!options.realpath
		  self.realpathCache = options.realpathCache || Object.create(null)
		  self.follow = !!options.follow
		  self.dot = !!options.dot
		  self.mark = !!options.mark
		  self.nodir = !!options.nodir
		  if (self.nodir)
		    self.mark = true
		  self.sync = !!options.sync
		  self.nounique = !!options.nounique
		  self.nonull = !!options.nonull
		  self.nosort = !!options.nosort
		  self.nocase = !!options.nocase
		  self.stat = !!options.stat
		  self.noprocess = !!options.noprocess

		  self.maxLength = options.maxLength || Infinity
		  self.cache = options.cache || Object.create(null)
		  self.statCache = options.statCache || Object.create(null)
		  self.symlinks = options.symlinks || Object.create(null)

		  setupIgnores(self, options)

		  self.changedCwd = false
		  var cwd = process.cwd()
		  if (!ownProp(options, "cwd"))
		    self.cwd = cwd
		  else {
		    self.cwd = path.resolve(options.cwd)
		    self.changedCwd = self.cwd !== cwd
		  }

		  self.root = options.root || path.resolve(self.cwd, "/")
		  self.root = path.resolve(self.root)
		  if (process.platform === "win32")
		    self.root = self.root.replace(/\\/g, "/")

		  self.cwdAbs = makeAbs(self, self.cwd)
		  self.nomount = !!options.nomount

		  // disable comments and negation in Minimatch.
		  // Note that they are not supported in Glob itself anyway.
		  options.nonegate = true
		  options.nocomment = true

		  self.minimatch = new Minimatch(pattern, options)
		  self.options = self.minimatch.options
		}

		function finish (self) {
		  var nou = self.nounique
		  var all = nou ? [] : Object.create(null)

		  for (var i = 0, l = self.matches.length; i < l; i ++) {
		    var matches = self.matches[i]
		    if (!matches || Object.keys(matches).length === 0) {
		      if (self.nonull) {
		        // do like the shell, and spit out the literal glob
		        var literal = self.minimatch.globSet[i]
		        if (nou)
		          all.push(literal)
		        else
		          all[literal] = true
		      }
		    } else {
		      // had matches
		      var m = Object.keys(matches)
		      if (nou)
		        all.push.apply(all, m)
		      else
		        m.forEach(function (m) {
		          all[m] = true
		        })
		    }
		  }

		  if (!nou)
		    all = Object.keys(all)

		  if (!self.nosort)
		    all = all.sort(self.nocase ? alphasorti : alphasort)

		  // at *some* point we statted all of these
		  if (self.mark) {
		    for (var i = 0; i < all.length; i++) {
		      all[i] = self._mark(all[i])
		    }
		    if (self.nodir) {
		      all = all.filter(function (e) {
		        var notDir = !(/\/$/.test(e))
		        var c = self.cache[e] || self.cache[makeAbs(self, e)]
		        if (notDir && c)
		          notDir = c !== 'DIR' && !Array.isArray(c)
		        return notDir
		      })
		    }
		  }

		  if (self.ignore.length)
		    all = all.filter(function(m) {
		      return !isIgnored(self, m)
		    })

		  self.found = all
		}

		function mark (self, p) {
		  var abs = makeAbs(self, p)
		  var c = self.cache[abs]
		  var m = p
		  if (c) {
		    var isDir = c === 'DIR' || Array.isArray(c)
		    var slash = p.slice(-1) === '/'

		    if (isDir && !slash)
		      m += '/'
		    else if (!isDir && slash)
		      m = m.slice(0, -1)

		    if (m !== p) {
		      var mabs = makeAbs(self, m)
		      self.statCache[mabs] = self.statCache[abs]
		      self.cache[mabs] = self.cache[abs]
		    }
		  }

		  return m
		}

		// lotta situps...
		function makeAbs (self, f) {
		  var abs = f
		  if (f.charAt(0) === '/') {
		    abs = path.join(self.root, f)
		  } else if (isAbsolute(f) || f === '') {
		    abs = f
		  } else if (self.changedCwd) {
		    abs = path.resolve(self.cwd, f)
		  } else {
		    abs = path.resolve(f)
		  }

		  if (process.platform === 'win32')
		    abs = abs.replace(/\\/g, '/')

		  return abs
		}


		// Return true, if pattern ends with globstar '**', for the accompanying parent directory.
		// Ex:- If node_modules/** is the pattern, add 'node_modules' to ignore list along with it's contents
		function isIgnored (self, path) {
		  if (!self.ignore.length)
		    return false

		  return self.ignore.some(function(item) {
		    return item.matcher.match(path) || !!(item.gmatcher && item.gmatcher.match(path))
		  })
		}

		function childrenIgnored (self, path) {
		  if (!self.ignore.length)
		    return false

		  return self.ignore.some(function(item) {
		    return !!(item.gmatcher && item.gmatcher.match(path))
		  })
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 250 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {// Approach:
		//
		// 1. Get the minimatch set
		// 2. For each pattern in the set, PROCESS(pattern, false)
		// 3. Store matches per-set, then uniq them
		//
		// PROCESS(pattern, inGlobStar)
		// Get the first [n] items from pattern that are all strings
		// Join these together.  This is PREFIX.
		//   If there is no more remaining, then stat(PREFIX) and
		//   add to matches if it succeeds.  END.
		//
		// If inGlobStar and PREFIX is symlink and points to dir
		//   set ENTRIES = []
		// else readdir(PREFIX) as ENTRIES
		//   If fail, END
		//
		// with ENTRIES
		//   If pattern[n] is GLOBSTAR
		//     // handle the case where the globstar match is empty
		//     // by pruning it out, and testing the resulting pattern
		//     PROCESS(pattern[0..n] + pattern[n+1 .. $], false)
		//     // handle other cases.
		//     for ENTRY in ENTRIES (not dotfiles)
		//       // attach globstar + tail onto the entry
		//       // Mark that this entry is a globstar match
		//       PROCESS(pattern[0..n] + ENTRY + pattern[n .. $], true)
		//
		//   else // not globstar
		//     for ENTRY in ENTRIES (not dotfiles, unless pattern[n] is dot)
		//       Test ENTRY against pattern[n]
		//       If fails, continue
		//       If passes, PROCESS(pattern[0..n] + item + pattern[n+1 .. $])
		//
		// Caveat:
		//   Cache all stats and readdirs results to minimize syscall.  Since all
		//   we ever care about is existence and directory-ness, we can just keep
		//   `true` for files, and [children,...] for directories, or `false` for
		//   things that don't exist.

		module.exports = glob


		var minimatch = __webpack_require__(172)
		var Minimatch = minimatch.Minimatch
		var inherits = __webpack_require__(2)
		var EE = __webpack_require__(7).EventEmitter
		var path = __webpack_require__(31)
		var assert = __webpack_require__(34)
		var isAbsolute = __webpack_require__(175)
		var globSync = __webpack_require__(624)
		var common = __webpack_require__(249)
		var alphasort = common.alphasort
		var alphasorti = common.alphasorti
		var setopts = common.setopts
		var ownProp = common.ownProp
		var inflight = __webpack_require__(646)
		var util = __webpack_require__(11)
		var childrenIgnored = common.childrenIgnored
		var isIgnored = common.isIgnored

		var once = __webpack_require__(125)

		function glob (pattern, options, cb) {
		  if (typeof options === 'function') cb = options, options = {}
		  if (!options) options = {}

		  if (options.sync) {
		    if (cb)
		      throw new TypeError('callback provided to sync glob')
		    return globSync(pattern, options)
		  }

		  return new Glob(pattern, options, cb)
		}

		glob.sync = globSync
		var GlobSync = glob.GlobSync = globSync.GlobSync

		// old api surface
		glob.glob = glob

		function extend (origin, add) {
		  if (add === null || typeof add !== 'object') {
		    return origin
		  }

		  var keys = Object.keys(add)
		  var i = keys.length
		  while (i--) {
		    origin[keys[i]] = add[keys[i]]
		  }
		  return origin
		}

		glob.hasMagic = function (pattern, options_) {
		  var options = extend({}, options_)
		  options.noprocess = true

		  var g = new Glob(pattern, options)
		  var set = g.minimatch.set
		  if (set.length > 1)
		    return true

		  for (var j = 0; j < set[0].length; j++) {
		    if (typeof set[0][j] !== 'string')
		      return true
		  }

		  return false
		}

		glob.Glob = Glob
		inherits(Glob, EE)
		function Glob (pattern, options, cb) {
		  if (typeof options === 'function') {
		    cb = options
		    options = null
		  }

		  if (options && options.sync) {
		    if (cb)
		      throw new TypeError('callback provided to sync glob')
		    return new GlobSync(pattern, options)
		  }

		  if (!(this instanceof Glob))
		    return new Glob(pattern, options, cb)

		  setopts(this, pattern, options)
		  this._didRealPath = false

		  // process each pattern in the minimatch set
		  var n = this.minimatch.set.length

		  // The matches are stored as {<filename>: true,...} so that
		  // duplicates are automagically pruned.
		  // Later, we do an Object.keys() on these.
		  // Keep them as a list so we can fill in when nonull is set.
		  this.matches = new Array(n)

		  if (typeof cb === 'function') {
		    cb = once(cb)
		    this.on('error', cb)
		    this.on('end', function (matches) {
		      cb(null, matches)
		    })
		  }

		  var self = this
		  var n = this.minimatch.set.length
		  this._processing = 0
		  this.matches = new Array(n)

		  this._emitQueue = []
		  this._processQueue = []
		  this.paused = false

		  if (this.noprocess)
		    return this

		  if (n === 0)
		    return done()

		  var sync = true
		  for (var i = 0; i < n; i ++) {
		    this._process(this.minimatch.set[i], i, false, done)
		  }
		  sync = false

		  function done () {
		    --self._processing
		    if (self._processing <= 0) {
		      if (sync) {
		        process.nextTick(function () {
		          self._finish()
		        })
		      } else {
		        self._finish()
		      }
		    }
		  }
		}

		Glob.prototype._finish = function () {
		  assert(this instanceof Glob)
		  if (this.aborted)
		    return

		  if (this.realpath && !this._didRealpath)
		    return this._realpath()

		  common.finish(this)
		  this.emit('end', this.found)
		}

		Glob.prototype._realpath = function () {
		  if (this._didRealpath)
		    return

		  this._didRealpath = true

		  var n = this.matches.length
		  if (n === 0)
		    return this._finish()

		  var self = this
		  for (var i = 0; i < this.matches.length; i++)
		    this._realpathSet(i, next)

		  function next () {
		    if (--n === 0)
		      self._finish()
		  }
		}

		Glob.prototype._realpathSet = function (index, cb) {
		  var matchset = this.matches[index]
		  if (!matchset)
		    return cb()

		  var found = Object.keys(matchset)
		  var self = this
		  var n = found.length

		  if (n === 0)
		    return cb()

		  var set = this.matches[index] = Object.create(null)
		  found.forEach(function (p, i) {
		    // If there's a problem with the stat, then it means that
		    // one or more of the links in the realpath couldn't be
		    // resolved.  just return the abs value in that case.
		    p = self._makeAbs(p)
		    fs.realpath(p, self.realpathCache, function (er, real) {
		      if (!er)
		        set[real] = true
		      else if (er.syscall === 'stat')
		        set[p] = true
		      else
		        self.emit('error', er) // srsly wtf right here

		      if (--n === 0) {
		        self.matches[index] = set
		        cb()
		      }
		    })
		  })
		}

		Glob.prototype._mark = function (p) {
		  return common.mark(this, p)
		}

		Glob.prototype._makeAbs = function (f) {
		  return common.makeAbs(this, f)
		}

		Glob.prototype.abort = function () {
		  this.aborted = true
		  this.emit('abort')
		}

		Glob.prototype.pause = function () {
		  if (!this.paused) {
		    this.paused = true
		    this.emit('pause')
		  }
		}

		Glob.prototype.resume = function () {
		  if (this.paused) {
		    this.emit('resume')
		    this.paused = false
		    if (this._emitQueue.length) {
		      var eq = this._emitQueue.slice(0)
		      this._emitQueue.length = 0
		      for (var i = 0; i < eq.length; i ++) {
		        var e = eq[i]
		        this._emitMatch(e[0], e[1])
		      }
		    }
		    if (this._processQueue.length) {
		      var pq = this._processQueue.slice(0)
		      this._processQueue.length = 0
		      for (var i = 0; i < pq.length; i ++) {
		        var p = pq[i]
		        this._processing--
		        this._process(p[0], p[1], p[2], p[3])
		      }
		    }
		  }
		}

		Glob.prototype._process = function (pattern, index, inGlobStar, cb) {
		  assert(this instanceof Glob)
		  assert(typeof cb === 'function')

		  if (this.aborted)
		    return

		  this._processing++
		  if (this.paused) {
		    this._processQueue.push([pattern, index, inGlobStar, cb])
		    return
		  }

		  //console.error('PROCESS %d', this._processing, pattern)

		  // Get the first [n] parts of pattern that are all strings.
		  var n = 0
		  while (typeof pattern[n] === 'string') {
		    n ++
		  }
		  // now n is the index of the first one that is *not* a string.

		  // see if there's anything else
		  var prefix
		  switch (n) {
		    // if not, then this is rather simple
		    case pattern.length:
		      this._processSimple(pattern.join('/'), index, cb)
		      return

		    case 0:
		      // pattern *starts* with some non-trivial item.
		      // going to readdir(cwd), but not include the prefix in matches.
		      prefix = null
		      break

		    default:
		      // pattern has some string bits in the front.
		      // whatever it starts with, whether that's 'absolute' like /foo/bar,
		      // or 'relative' like '../baz'
		      prefix = pattern.slice(0, n).join('/')
		      break
		  }

		  var remain = pattern.slice(n)

		  // get the list of entries.
		  var read
		  if (prefix === null)
		    read = '.'
		  else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {
		    if (!prefix || !isAbsolute(prefix))
		      prefix = '/' + prefix
		    read = prefix
		  } else
		    read = prefix

		  var abs = this._makeAbs(read)

		  //if ignored, skip _processing
		  if (childrenIgnored(this, read))
		    return cb()

		  var isGlobStar = remain[0] === minimatch.GLOBSTAR
		  if (isGlobStar)
		    this._processGlobStar(prefix, read, abs, remain, index, inGlobStar, cb)
		  else
		    this._processReaddir(prefix, read, abs, remain, index, inGlobStar, cb)
		}

		Glob.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar, cb) {
		  var self = this
		  this._readdir(abs, inGlobStar, function (er, entries) {
		    return self._processReaddir2(prefix, read, abs, remain, index, inGlobStar, entries, cb)
		  })
		}

		Glob.prototype._processReaddir2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {

		  // if the abs isn't a dir, then nothing can match!
		  if (!entries)
		    return cb()

		  // It will only match dot entries if it starts with a dot, or if
		  // dot is set.  Stuff like @(.foo|.bar) isn't allowed.
		  var pn = remain[0]
		  var negate = !!this.minimatch.negate
		  var rawGlob = pn._glob
		  var dotOk = this.dot || rawGlob.charAt(0) === '.'

		  var matchedEntries = []
		  for (var i = 0; i < entries.length; i++) {
		    var e = entries[i]
		    if (e.charAt(0) !== '.' || dotOk) {
		      var m
		      if (negate && !prefix) {
		        m = !e.match(pn)
		      } else {
		        m = e.match(pn)
		      }
		      if (m)
		        matchedEntries.push(e)
		    }
		  }

		  //console.error('prd2', prefix, entries, remain[0]._glob, matchedEntries)

		  var len = matchedEntries.length
		  // If there are no matched entries, then nothing matches.
		  if (len === 0)
		    return cb()

		  // if this is the last remaining pattern bit, then no need for
		  // an additional stat *unless* the user has specified mark or
		  // stat explicitly.  We know they exist, since readdir returned
		  // them.

		  if (remain.length === 1 && !this.mark && !this.stat) {
		    if (!this.matches[index])
		      this.matches[index] = Object.create(null)

		    for (var i = 0; i < len; i ++) {
		      var e = matchedEntries[i]
		      if (prefix) {
		        if (prefix !== '/')
		          e = prefix + '/' + e
		        else
		          e = prefix + e
		      }

		      if (e.charAt(0) === '/' && !this.nomount) {
		        e = path.join(this.root, e)
		      }
		      this._emitMatch(index, e)
		    }
		    // This was the last one, and no stats were needed
		    return cb()
		  }

		  // now test all matched entries as stand-ins for that part
		  // of the pattern.
		  remain.shift()
		  for (var i = 0; i < len; i ++) {
		    var e = matchedEntries[i]
		    var newPattern
		    if (prefix) {
		      if (prefix !== '/')
		        e = prefix + '/' + e
		      else
		        e = prefix + e
		    }
		    this._process([e].concat(remain), index, inGlobStar, cb)
		  }
		  cb()
		}

		Glob.prototype._emitMatch = function (index, e) {
		  if (this.aborted)
		    return

		  if (this.matches[index][e])
		    return

		  if (isIgnored(this, e))
		    return

		  if (this.paused) {
		    this._emitQueue.push([index, e])
		    return
		  }

		  var abs = this._makeAbs(e)

		  if (this.nodir) {
		    var c = this.cache[abs]
		    if (c === 'DIR' || Array.isArray(c))
		      return
		  }

		  if (this.mark)
		    e = this._mark(e)

		  this.matches[index][e] = true

		  var st = this.statCache[abs]
		  if (st)
		    this.emit('stat', e, st)

		  this.emit('match', e)
		}

		Glob.prototype._readdirInGlobStar = function (abs, cb) {
		  if (this.aborted)
		    return

		  // follow all symlinked directories forever
		  // just proceed as if this is a non-globstar situation
		  if (this.follow)
		    return this._readdir(abs, false, cb)

		  var lstatkey = 'lstat\0' + abs
		  var self = this
		  var lstatcb = inflight(lstatkey, lstatcb_)

		  if (lstatcb)
		    fs.lstat(abs, lstatcb)

		  function lstatcb_ (er, lstat) {
		    if (er)
		      return cb()

		    var isSym = lstat.isSymbolicLink()
		    self.symlinks[abs] = isSym

		    // If it's not a symlink or a dir, then it's definitely a regular file.
		    // don't bother doing a readdir in that case.
		    if (!isSym && !lstat.isDirectory()) {
		      self.cache[abs] = 'FILE'
		      cb()
		    } else
		      self._readdir(abs, false, cb)
		  }
		}

		Glob.prototype._readdir = function (abs, inGlobStar, cb) {
		  if (this.aborted)
		    return

		  cb = inflight('readdir\0'+abs+'\0'+inGlobStar, cb)
		  if (!cb)
		    return

		  //console.error('RD %j %j', +inGlobStar, abs)
		  if (inGlobStar && !ownProp(this.symlinks, abs))
		    return this._readdirInGlobStar(abs, cb)

		  if (ownProp(this.cache, abs)) {
		    var c = this.cache[abs]
		    if (!c || c === 'FILE')
		      return cb()

		    if (Array.isArray(c))
		      return cb(null, c)
		  }

		  var self = this
		  fs.readdir(abs, readdirCb(this, abs, cb))
		}

		function readdirCb (self, abs, cb) {
		  return function (er, entries) {
		    if (er)
		      self._readdirError(abs, er, cb)
		    else
		      self._readdirEntries(abs, entries, cb)
		  }
		}

		Glob.prototype._readdirEntries = function (abs, entries, cb) {
		  if (this.aborted)
		    return

		  // if we haven't asked to stat everything, then just
		  // assume that everything in there exists, so we can avoid
		  // having to stat it a second time.
		  if (!this.mark && !this.stat) {
		    for (var i = 0; i < entries.length; i ++) {
		      var e = entries[i]
		      if (abs === '/')
		        e = abs + e
		      else
		        e = abs + '/' + e
		      this.cache[e] = true
		    }
		  }

		  this.cache[abs] = entries
		  return cb(null, entries)
		}

		Glob.prototype._readdirError = function (f, er, cb) {
		  if (this.aborted)
		    return

		  // handle errors, and cache the information
		  switch (er.code) {
		    case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205
		    case 'ENOTDIR': // totally normal. means it *does* exist.
		      var abs = this._makeAbs(f)
		      this.cache[abs] = 'FILE'
		      if (abs === this.cwdAbs) {
		        var error = new Error(er.code + ' invalid cwd ' + this.cwd)
		        error.path = this.cwd
		        error.code = er.code
		        this.emit('error', error)
		        this.abort()
		      }
		      break

		    case 'ENOENT': // not terribly unusual
		    case 'ELOOP':
		    case 'ENAMETOOLONG':
		    case 'UNKNOWN':
		      this.cache[this._makeAbs(f)] = false
		      break

		    default: // some unusual error.  Treat as failure.
		      this.cache[this._makeAbs(f)] = false
		      if (this.strict) {
		        this.emit('error', er)
		        // If the error is handled, then we abort
		        // if not, we threw out of here
		        this.abort()
		      }
		      if (!this.silent)
		        console.error('glob error', er)
		      break
		  }

		  return cb()
		}

		Glob.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar, cb) {
		  var self = this
		  this._readdir(abs, inGlobStar, function (er, entries) {
		    self._processGlobStar2(prefix, read, abs, remain, index, inGlobStar, entries, cb)
		  })
		}


		Glob.prototype._processGlobStar2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {
		  //console.error('pgs2', prefix, remain[0], entries)

		  // no entries means not a dir, so it can never have matches
		  // foo.txt/** doesn't match foo.txt
		  if (!entries)
		    return cb()

		  // test without the globstar, and with every child both below
		  // and replacing the globstar.
		  var remainWithoutGlobStar = remain.slice(1)
		  var gspref = prefix ? [ prefix ] : []
		  var noGlobStar = gspref.concat(remainWithoutGlobStar)

		  // the noGlobStar pattern exits the inGlobStar state
		  this._process(noGlobStar, index, false, cb)

		  var isSym = this.symlinks[abs]
		  var len = entries.length

		  // If it's a symlink, and we're in a globstar, then stop
		  if (isSym && inGlobStar)
		    return cb()

		  for (var i = 0; i < len; i++) {
		    var e = entries[i]
		    if (e.charAt(0) === '.' && !this.dot)
		      continue

		    // these two cases enter the inGlobStar state
		    var instead = gspref.concat(entries[i], remainWithoutGlobStar)
		    this._process(instead, index, true, cb)

		    var below = gspref.concat(entries[i], remain)
		    this._process(below, index, true, cb)
		  }

		  cb()
		}

		Glob.prototype._processSimple = function (prefix, index, cb) {
		  // XXX review this.  Shouldn't it be doing the mounting etc
		  // before doing stat?  kinda weird?
		  var self = this
		  this._stat(prefix, function (er, exists) {
		    self._processSimple2(prefix, index, er, exists, cb)
		  })
		}
		Glob.prototype._processSimple2 = function (prefix, index, er, exists, cb) {

		  //console.error('ps2', prefix, exists)

		  if (!this.matches[index])
		    this.matches[index] = Object.create(null)

		  // If it doesn't exist, then just mark the lack of results
		  if (!exists)
		    return cb()

		  if (prefix && isAbsolute(prefix) && !this.nomount) {
		    var trail = /[\/\\]$/.test(prefix)
		    if (prefix.charAt(0) === '/') {
		      prefix = path.join(this.root, prefix)
		    } else {
		      prefix = path.resolve(this.root, prefix)
		      if (trail)
		        prefix += '/'
		    }
		  }

		  if (process.platform === 'win32')
		    prefix = prefix.replace(/\\/g, '/')

		  // Mark this as a match
		  this._emitMatch(index, prefix)
		  cb()
		}

		// Returns either 'DIR', 'FILE', or false
		Glob.prototype._stat = function (f, cb) {
		  var abs = this._makeAbs(f)
		  var needDir = f.slice(-1) === '/'

		  if (f.length > this.maxLength)
		    return cb()

		  if (!this.stat && ownProp(this.cache, abs)) {
		    var c = this.cache[abs]

		    if (Array.isArray(c))
		      c = 'DIR'

		    // It exists, but maybe not how we need it
		    if (!needDir || c === 'DIR')
		      return cb(null, c)

		    if (needDir && c === 'FILE')
		      return cb()

		    // otherwise we have to stat, because maybe c=true
		    // if we know it exists, but not what it is.
		  }

		  var exists
		  var stat = this.statCache[abs]
		  if (stat !== undefined) {
		    if (stat === false)
		      return cb(null, stat)
		    else {
		      var type = stat.isDirectory() ? 'DIR' : 'FILE'
		      if (needDir && type === 'FILE')
		        return cb()
		      else
		        return cb(null, type, stat)
		    }
		  }

		  var self = this
		  var statcb = inflight('stat\0' + abs, lstatcb_)
		  if (statcb)
		    fs.lstat(abs, statcb)

		  function lstatcb_ (er, lstat) {
		    if (lstat && lstat.isSymbolicLink()) {
		      // If it's a symlink, then treat it as the target, unless
		      // the target does not exist, then treat it as a file.
		      return fs.stat(abs, function (er, stat) {
		        if (er)
		          self._stat2(f, abs, null, lstat, cb)
		        else
		          self._stat2(f, abs, er, stat, cb)
		      })
		    } else {
		      self._stat2(f, abs, er, lstat, cb)
		    }
		  }
		}

		Glob.prototype._stat2 = function (f, abs, er, stat, cb) {
		  if (er) {
		    this.statCache[abs] = false
		    return cb()
		  }

		  var needDir = f.slice(-1) === '/'
		  this.statCache[abs] = stat

		  if (abs.slice(-1) === '/' && !stat.isDirectory())
		    return cb(null, false, stat)

		  var c = stat.isDirectory() ? 'DIR' : 'FILE'
		  this.cache[abs] = this.cache[abs] || c

		  if (needDir && c !== 'DIR')
		    return cb()

		  return cb(null, c, stat)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 251 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global, setImmediate, process) {/**
		 * 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__(11).inherits;
		var EventEmitter = __webpack_require__(7).EventEmitter;
		var Decoder = __webpack_require__(14).StringDecoder;

		var Queue = __webpack_require__(633);
		var IntMap = __webpack_require__(632);

		// Create quick slice reference variable for speed
		var slice = Array.prototype.slice;
		var hasOwn = Object.prototype.hasOwnProperty;

		// Set up the global object.
		var _global = this;
		if (typeof global !== 'undefined') {
		    _global = global;
		}
		else if (typeof window !== 'undefined') {
		    _global = window;
		}

		/**
		 * 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 */
		var _ = exports = module.exports = __(Stream);
		function __(StreamCtor) {
		    return function(/*optional*/xs, /*optional*/ee, /*optional*/ mappingHint) {
		        /*eslint-enable no-multi-spaces */
		        var s = null;
		        if (_.isUndefined(xs)) {
		            // nothing else to do
		            s = new StreamCtor();
		            s.writable = true;
		        }
		        else if (_.isStream(xs)) {
		            if (!(xs instanceof StreamCtor)) { // different subclass or version
		                var ret = new StreamCtor();
		                xs.on('error', ret.write.bind(ret));
		                s = xs.pipe(ret);
		            }
		            else {
		                s = xs;
		            }
		        }
		        else if (_.isArray(xs)) {
		            s = new StreamCtor();
		            s._outgoing.enqueueAll(xs);
		            s._outgoing.enqueue(_.nil);
		        }
		        else if (_.isFunction(xs)) {
		            s = new StreamCtor(xs);
		        }
		        else if (_.isObject(xs)) {
		            // check to see if we have a readable stream
		            if (_.isFunction(xs.on) && _.isFunction(xs.pipe)) {
		                s = new StreamCtor();
		                s.writable = true;
		                pipeReadable(xs, s);
		                // s has to be writable so that the pipe works
		                // return a non-writable stream
		                return s.map(function (x) { return x; });
		            }
		            else if (_.isFunction(xs.then)) {
		                // probably a promise
		                s = promiseStream(StreamCtor, 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(StreamCtor, xs);
		            }
		            else if (!_.isUndefined(_global.Symbol) && xs[_global.Symbol.iterator]) {
		                //probably an iterable
		                return iteratorStream(StreamCtor, 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);

		            s = new StreamCtor();
		            ee.on(xs, function () {
		                var ctx = mapper.apply(this, arguments);
		                s.write(ctx);
		            });
		        }
		        else {
		            throw new Error(
		                'Unexpected argument type to Stream constructor: ' + (typeof xs)
		            );
		        }

		        return s;
		    };
		}
		/*eslint-enable no-use-before-define */

		// 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);
		    };
		}
		else {
		    // We don't use a direct alias since some tests depend
		    // on allowing Sinon.Js to override the global
		    // setImmediate.
		    _.setImmediate = function (fn) {
		        setImmediate(fn);
		    };
		}

		/**
		 * 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)
		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);

		    stream.onDestroy(function () {
		        if (xs.unpipe) {
		            xs.unpipe(stream);
		        }
		        xs.removeListener('error', writeStreamError);
		    });

		    function writeStreamError(err) {
		        stream.write(new StreamError(err));
		    }
		}

		function newPullFunction(xs) {
		    return function pull(cb) {
		        xs.pull(cb);
		    };
		}

		function newDelegateGenerator(pull) {
		    return function delegateGenerator(push, next) {
		        var self = this;
		        pull(function (err, x) {
		            // Minor optimization to immediately call the
		            // generator if requested.
		            var old = self._defer_run_generator;
		            self._defer_run_generator = true;

		            push(err, x);
		            if (x !== nil) {
		                next();
		            }

		            self._defer_run_generator = old;
		            if (!old && self._run_generator_deferred) {
		                self._runGenerator();
		            }
		        });
		    };
		}

		function promiseStream(StreamCtor, promise) {
		    return new StreamCtor(function (push) {
		        promise.then(function (value) {
		                push(null, value);
		                return push(null, nil);
		            },
		            function (err) {
		                push(err);
		                return push(null, nil);
		            });
		    });
		}

		function iteratorStream(StreamCtor, it) {
		    return new StreamCtor(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) {
		            resume();
		            resume = null;
		        }
		    }
		}

		/**
		 * Actual Stream constructor wrapped the the main exported function
		 */

		function Stream(generator) {
		    var self = this;

		    EventEmitter.call(self);

		    // 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);

		    self._outgoing = new Queue();
		    self._observers = [];
		    self._destructors = [];
		    self._send_events = false;

		    self.paused = true;
		    self.ended = false;
		    self._nil_seen = false;

		    self._request = null;
		    self._multiplexer = null;
		    self._consumer = null;

		    self._generator = generator;
		    self._generator_requested = true;
		    self._defer_run_generator = false;
		    self._run_generator_deferred = false;

		    // These are defined here instead of on the prototype
		    // because bind is super slow.
		    self._push_fn = function (err, x) {
		        if (self._nil_seen) {
		            throw new Error('Can not write to stream after nil');
		        }

		        if (x === nil) {
		            self._nil_seen = true;

		            // It's possible that next was called before the
		            // nil, causing the generator to be deferred. This
		            // is allowed since push can be called at any time.
		            // We have to cancel the deferred call to preserve the
		            // generator contract.
		            self._run_generator_deferred = false;
		        }

		        self._writeOutgoing(err ? new StreamError(err) : x);
		    };

		    self._next_fn = function (xs) {
		        // console.log(self.id, '_next', xs, self.paused);
		        if (self._nil_seen) {
		            throw new Error('Can not call next after nil');
		        }

		        self._generator_requested = true;
		        if (xs) {
		            xs = self.create(xs);
		            var pull = newPullFunction(xs);
		            self._generator = newDelegateGenerator(pull);
		        }

		        if (!self.paused) {
		            if (self._defer_run_generator) {
		                self._run_generator_deferred = true;
		            }
		            else {
		                _.setImmediate(function () {
		                    self._runGenerator();
		                });
		            }
		        }
		    };

		    // Old-style node Stream.pipe() checks for writable, and gulp checks for
		    // readable. Discussion at https://github.com/caolan/highland/pull/438.
		    self.readable = true;
		    self.writable = false;

		    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;
		            }
		        }
		    });
		}
		inherits(Stream, EventEmitter);

		function _addMethod(proto, topLevel) {
		    return function(name, f) {
		        proto[name] = f;
		        var n = f.length;
		        function relevel(coerce) {
		            return _.ncurry(n + 1, function () {
		                var args = slice.call(arguments);
		                var s = coerce(args.pop());
		                return f.apply(s, args);
		            });
		        }
		        topLevel[name] = relevel(topLevel);
		        topLevel[name]._relevel = relevel;
		    };
		}

		var addMethod = _addMethod(Stream.prototype, _);

		function _addMethods(proto, topLevel, methods) {
		    for (var p in methods) {
		        if (hasOwn.call(methods, p)) {
		            _addMethod(proto, topLevel)(p, methods[p]);
		        }
		    }
		}

		function _addToplevelMethod(topLevel) {
		    return function (name, fn) {
		        function relevel(_topLevel) {
		            var bound = fn.bind(_topLevel);
		            bound._relevel = relevel;
		            return bound;
		        }
		        topLevel[name] = relevel(topLevel);
		    };
		}

		var addToplevelMethod = _addToplevelMethod(_);

		function _addToplevelMethods(topLevel, methods) {
		    for (var p in methods) {
		        if (hasOwn.call(methods, p)) {
		            _addToplevelMethod(topLevel)(p, methods[p]);
		        }
		    }
		}

		function use(Super, originalTopLevel) {
		    return function(methods, toplevelMethods) {
		        function Sub() {
		            Stream.apply(this, arguments);
		        }
		        inherits(Sub, Super);

		        function topLevel() {
		            return __(Sub).apply(null, arguments);
		        }
		        for (var p in originalTopLevel) {
		            if (hasOwn.call(originalTopLevel, p)) {
		                var fn = originalTopLevel[p];
		                topLevel[p] = (typeof fn._relevel === 'function') ? fn._relevel(topLevel) : fn;
		            }
		        }
		        _addMethods(Sub.prototype, topLevel, methods || {});
		        _addToplevelMethods(topLevel, toplevelMethods || {});
		        topLevel.use = use(Sub, topLevel);

		        return topLevel;
		    };
		}

		_.use = use(Stream, _);

		Stream.prototype.create = function () {
		    return __(this.constructor).apply(null, arguments);
		};

		Stream.prototype.createChild = function createChild(/*varargs*/) {
		    var child = this.create.apply(this, arguments);
		    child.onDestroy(this.destroy.bind(this));
		    return child;
		};

		/**
		 * Used as an Error marker when writing to a Stream's incoming buffer
		 */

		function StreamError(err) {
		    this.__HighlandStreamError__ = true;
		    this.error = err;
		}

		/**
		 * 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 (token) {
		    // console.log(this.id, '_send', token, this._send_events);

		    var err = null,
		        x;

		    if (_._isStreamError(token)) {
		        err = token.error;
		        this.readable = false;
		    }
		    else {
		        x = token;
		    }

		    if (x === nil) {
		        // Per https://nodejs.org/docs/v0.8.28/api/stream.html#stream_stream_readable
		        // streams stop being readable when they end or are destroyed
		        this.readable = false;
		    }

		    if (this._request) {
		        // Allow pull to be called within the callback function.
		        var cb = this._request;
		        this._request = null;

		        // If we have a request, then it was from a pull() and we need to
		        // pause.
		        this.pause();
		        cb(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);
		        }
		    }

		    if (x === nil) {
		        this._onEnd();
		    }
		};

		Stream.prototype._onEnd = function _onEnd() {
		    if (this.ended) {
		        return;
		    }

		    this.pause();

		    this.ended = true;

		    for (var i = 0, len = this._destructors.length; i < len; i++) {
		        this._destructors[i].call(this);
		    }

		    this._generator = null;
		    this._request = null;
		    this._outgoing.clear();
		    this._observers = [];
		    this._destructors = [];
		};

		/**
		 * 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();
		 */

		addMethod('pause', function () {
		    //console.log(['pause', this.id]);
		    this.paused = true;
		});

		/*
		 * Emit as many buffered token as possible, but not to exceed num.
		 * If num is null, then emit as much as possible.
		 */

		Stream.prototype._emitNext = function (num) {
		    var emitted = 0;

		    while ((num == null || emitted < num) &&
		            this._outgoing.length &&
		            !this.paused) {
		        this._send(this._outgoing.dequeue());
		        emitted++;
		    }
		};

		/**
		 * 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();
		 */

		addMethod('resume', function () {
		    // console.log(this.id, 'resume', this.paused);
		    if (!this.paused ||
		            (this._consumer && this._consumer.paused) ||
		            (this._multiplexer && this._multiplexer.paused)) {
		        return;
		    }

		    this.paused = false;

		    // Emit all pending tokens in _outgoing.
		    if (this._outgoing.length) {
		        this._emitNext();

		        // The emit may have caused the stream to pause.
		        if (this.paused) {
		            return;
		        }
		    }

		    if (this._generator) {
		        this._runGenerator();
		    }
		    else {
		        // perhaps a node stream is being piped in
		        this.emit('drain');
		    }
		});

		/**
		 * 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()
		 * @aprototype.ppi public
		 *
		 * mystream.end();
		 */

		addMethod('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);
		 */

		addMethod('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
		 */

		addMethod('destroy', function () {
		    // Already destroyed.
		    if (this.ended) {
		        return;
		    }

		    this.readable = this.writable = false;

		    this.end();
		    this._onEnd();
		});

		Stream.prototype._writeOutgoing = function _writeOutgoing(token) {
		    //console.log('_writeOutgoing', token, this.id);
		    if (token === nil || _._isStreamError(token)) {
		        // Per https://nodejs.org/docs/v0.8.28/api/stream.html#stream_stream_writable
		        // writable should turn false after end is called or an error occurs
		        this.writable = false;
		    }
		    if (this.paused) {
		        this._outgoing.enqueue(token);
		    }
		    else {
		        this._send(token);
		    }
		};

		/**
		 * 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(this.id, '_runGenerator');
		    // if _generator already running, exit
		    if (!this._generator_requested) {
		        return;
		    }

		    if (this._defer_run_generator) {
		        this._run_generator_deferred = true;
		        return;
		    }

		    this._defer_run_generator = true;
		    do {
		        this._run_generator_deferred = false;
		        this._generator_requested = false;

		        // this._generator(this._push_fn, this._next_fn);

		        var gen = this._generator;

		        // Special handling for consume generators.
		        if (gen.__ConsumeGenerator__) {
		            var source = gen.source;
		            if (source._outgoing.length) {
		                var token = source._outgoing.dequeue();

		                // Inline the pull -> resume -> _emitNext call chain.
		                source._request = gen.pullCb;
		                source.paused = false;
		                source._send(token);
		            }
		            else {
		                // Inline pull.
		                source._request = gen.pullCb;
		                source.resume();
		            }
		        }
		        else {
		            gen.call(this, this._push_fn, this._next_fn);
		        }
		    } while (this._run_generator_deferred);
		    this._defer_run_generator = false;
		};

		/**
		 * 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();
		 *         }
		 *     });
		 * };
		 */

		addMethod('consume', function (f) {
		    var source = this,
		        consumer;

		    if (this._consumer) {
		        throw new Error(
		            'Stream already being consumed, you must either fork() or observe()'
		        );
		    }

		    if (this._multiplexer) {
		        throw new Error(
		            'Stream has been forked. You must either fork() or observe().'
		        );
		    }

		    // This should be a subclass, but prototype resolution is slow, and
		    // consume is on the critical path, so we inline it.
		    var gen = function () {
		        // Important. next may not be called outside of
		        // pullCb.
		        source.pull(pullCb);
		    };

		    gen.__ConsumeGenerator__ = true;
		    gen.pullCb = pullCb;
		    gen.source = source;

		    consumer = this._consumer = this.createChild(gen);

		    consumer.id = 'consume:' + consumer.id;

		    return consumer;

		    function pullCb(err, x) {
		        // Minor optimization to immediately call the
		        // generator if requested.
		        if (consumer._defer_run_generator) {
		            f(err, x, consumer._push_fn, consumer._next_fn);
		        }
		        else {
		            consumer._defer_run_generator = true;
		            f(err, x, consumer._push_fn, consumer._next_fn);
		            consumer._defer_run_generator = false;

		            if (consumer._run_generator_deferred) {
		                consumer._runGenerator();
		            }
		        }
		    }
		});

		/**
		 * 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
		 * });
		 */

		addMethod('pull', function (f) {
		    // console.log(this.id, 'pull', this._outgoing.toArray(), this.paused);
		    if (f == null) {
		        throw new Error('Cannot pull() with a null callback.');
		    }

		    if (this._request) {
		        f(new Error('Cannot service a second pull() request while one is in progress.'));
		    }

		    // Register the callback and send a message.
		    // Don't need to pause. _send will do it for us.
		    this._request = f;
		    this.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.
		 */

		addMethod('write', function (x) {
		    // console.log(this.id, 'write', x, this.paused);
		    this._writeOutgoing(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.
		 *
		 * @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();
		 */

		addMethod('fork', function () {
		    if (this._requests) {
		        throw new Error('Cannot fork a stream with an outstanding pull() request.');
		    }

		    if (this._consumer) {
		        throw new Error('Cannot fork a stream that has already been consumed().');
		    }

		    if (!this._multiplexer) {
		        this._multiplexer = new StreamMultiplexer(this);
		    }

		    var s = this._multiplexer.newStream();
		    s.id = 'fork:' + s.id;
		    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();
		 */

		addMethod('observe', function () {
		    var s = this.create();
		    s.id = 'observe:' + s.id;
		    s.writable = false;

		    s.onDestroy(this._removeObserver.bind(this, s));

		    // s.source = this;
		    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);
		 *     }
		 * });
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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);
		 * });
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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
		 * });
		 */

		addMethod('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;
		});

		/**
		 * 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
		 * });
		 */

		addMethod('apply', function (f) {
		    return this.toArray(function (args) {
		        f.apply(null, args);
		    });
		});

		/**
		 * 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]
		 * });
		 */

		addMethod('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
		 * });
		 */

		addMethod('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();
		});

		/**
		 * Registers a callback that will be called when the stream is destroyed. The
		 * callback will have its `this` variable bound to the stream being destroyed.
		 *
		 * This method can be used to free any resources that were allocated when
		 * creating the stream.
		 *
		 * @id onDestroy
		 * @section Consumption
		 * @name Stream.onDestroy(f)
		 * @param {Function} f - the callback
		 * @api public
		 *
		 * var _([1]).onDestroy(function () {
		 *     console.log('freed');
		 * }).each(console.log);
		 * // => 1
		 * // => freed
		 */

		Stream.prototype.onDestroy = function onDestroy(f) {
		    this._destructors.push(f);
		    return this;
		};

		/**
		 * Creates a new Stream of transformed values by applying a function to each
		 * value from the source.
		 *
		 * @id map
		 * @section Transforms
		 * @name Stream.map(f)
		 * @param {Function} f - the transformation function
		 * @api public
		 *
		 * var doubled = _([1, 2, 3, 4]).map(function (x) {
		 *     return x * 2;
		 * }); // => 2, 4, 6, 8
		 */

		addMethod('map', function (f) {
		    if (!_.isFunction(f)) {
		        throw new Error('map expects a function as its only argument.');
		    }
		    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();
		        }
		    });
		});

		/**
		 * 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
		 */

		addMethod('doto', function (f) {
		    return this.map(function (x) {
		        f(x);
		        return x;
		    });
		});

		/**
		 * 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
		 */

		addMethod('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);
		            }
		        }
		    });
		});

		/**
		 * 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)
		 */

		addMethod('flatMap', function (f) {
		    return this.map(f).sequence();
		});

		/**
		 * 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']
		 * });
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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 (value, key) {
		 *      return value > 4;
		 *  }).toArray(function (xs) {
		 *    // xs is now:
		 *    [
		 *      { age: 5 },
		 *      {},
		 *      { age: 9 }
		 *    ]
		 *  });
		 */

		addMethod('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(x[prop], 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;
		    }));
		});

		/**
		 *
		 * 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:
		 *      [
		 *          {},
		 *          {},
		 *          {}
		 *      ]
		 * });*/

		addMethod('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;
		    }));
		});

		/**
		 * 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;
		 * });
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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)
		 */

		addMethod('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);
		        });
		    }
		});

		/**
		 * 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;
		 * });
		 */

		addMethod('reject', function (f) {
		    return this.filter(_.compose(_.not, f));
		});

		/**
		 * 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'}
		 */

		addMethod('find', function (f) {
		    return this.filter(f).take(1);
		});

		/**
		 * 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'}
		 */

		addMethod('findWhere', function (props) {
		    return this.where(props).take(1);
		});


		/**
		 * 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'}]
		 * // =>  }
		 *
		 */

		addMethod('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;
		    }, {});
		});

		/**
		 * 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
		 */

		addMethod('compact', function () {
		    return this.filter(function (x) {
		        return x;
		    });
		});

		/**
		 * 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'}
		 */

		addMethod('where', function (props) {
		    return this.filter(function (x) {
		        for (var k in props) {
		            if (x[k] !== props[k]) {
		                return false;
		            }
		        }
		        return true;
		    });
		});

		/**
		 * 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'
		 *
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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'
		 */

		addMethod('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;
		    });
		});

		/**
		 * 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.
		 *
		 * @id zipAll
		 * @section Higher-order Streams
		 * @name Stream.zipAll()
		 * @api public
		 *
		 * _([
		 *     _([1, 2, 3]),
		 *     _([4, 5, 6]),
		 *     _([7, 8, 9]),
		 *     _([10, 11, 12])
		 * ]).zipAll()
		 * // => [ [ 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])
		 * ]).zipAll()
		 * // => [ [ 1, 5, 9, 13 ], [ 2, 6, 10, 14 ] ]
		 */

		addMethod('zipAll', 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();
		                }
		            }
		        });
		    }

		    var self = this;
		    return self.collect().flatMap(function (array) {
		        if (!array.length) {
		            return self.create([]);
		        }
		        return self.create(function (push, next) {
		            returned = 0;
		            z = [];
		            for (var i = 0, length = array.length; i < length; i++) {
		                nextValue(i, length, array[i], push, next);
		            }
		        });
		    });

		});

		/**
		 * Takes a stream and a `finite` stream of `N` streams
		 * and returns a stream of the corresponding `(N+1)`-tuples.
		 *
		 * @id zipEach
		 * @section Higher-order Streams
		 * @name Stream.zipEach(ys)
		 * @param {Array | Stream} ys - the array of streams to combine values with
		 * @api public
		 *
		 * _([1,2,3]).zipEach([[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]).zipEach([[5, 6, 7, 8], [9, 10, 11, 12], [13, 14]])
		 * // => [ [ 1, 5, 9, 13 ], [ 2, 6, 10, 14 ] ]
		 */

		addMethod('zipEach', function (ys) {
		    return this.create([this]).concat(this.create(ys).map(this.create.bind(this))).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]
		 */

		addMethod('zip', function (ys) {
		    return this.create([this, this.create(ys)]).zipAll();
		});

		/**
		 * 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]
		 */

		addMethod('batch', function (n) {
		    return this.batchWithTimeOrCount(-1, n);
		});

		/**
		 * 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]
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * [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
		 */

		addMethod('split', function () {
		    return this.splitBy(/\r?\n/);
		});

		/**
		 * 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
		 */

		addMethod('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;
		});

		/**
		 * 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
		 */

		addMethod('take', function (n) {
		    var s = this.slice(0, n);
		    s.id = 'take:' + s.id;
		    return s;
		});

		/**
		 * 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
		 */

		addMethod('drop', function (n) {
		    return this.slice(n, Infinity);
		});

		/**
		 * 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
		 */

		addMethod('head', function () {
		    return this.take(1);
		});

		/**
		 * 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
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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]
		 */

		addMethod('sortBy', function (f) {
		    return this.collect().invoke('sort', [f]).sequence();
		});

		/**
		 * 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']
		 */

		addMethod('sort', function () {
		    return this.sortBy();
		});


		/**
		 * 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
		 * });
		 */

		addMethod('through', function (target) {
		    var output;

		    if (_.isFunction(target)) {
		        return target(this);
		    }
		    else {
		        target.pause();
		        output = this.createChild();
		        this.on('error', writeErr);
		        target.on('error', writeErr);
		        return this.pipe(target).pipe(output);
		    }

		    function writeErr(err) {
		        output.write(new StreamError(err));
		    }
		});

		/**
		 * 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.
		 * });
		 */

		addToplevelMethod('pipeline', function (/*through...*/) {
		    if (!arguments.length) {
		        return this();
		    }
		    var start = arguments[0], rest, startHighland;
		    if (!_.isStream(start) && !_.isFunction(start.resume)) {
		        // not a Highland stream or Node stream, start with empty stream
		        start = this();
		        startHighland = start;
		        rest = slice.call(arguments);
		    }
		    else {
		        // got a stream as first argument, co-erce to Highland stream
		        startHighland = this(start);
		        rest = slice.call(arguments, 1);
		    }

		    var end = rest.reduce(function (src, dest) {
		        return src.through(dest);
		    }, startHighland);

		    var wrapper = this(function (push, next) {
		        end.pull(function (err, x) {
		            push(err, x);
		            if (x !== nil) {
		                next();
		            }
		        });
		    });

		    wrapper.writable = true;

		    wrapper.write = function (x) {
		        return start.write(x);
		    };

		    wrapper.end = function () {
		        wrapper.writable = false;
		        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()
		 */

		addMethod('sequence', function () {
		    var original = this;
		    var curr = this;
		    return this.create(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;
		    }
		});

		/**
		 * 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
		 */

		addMethod('flatten', function () {
		    var curr = this;
		    var stack = [];
		    return this.createChild(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();
		            }
		        });
		    });
		});

		/**
		 * 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);
		 */

		addMethod('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 this.create(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
		    });
		});

		/**
		 * 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'
		 */

		addMethod('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);
		        }
		    });
		});

		/**
		 * 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
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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.
		 *
		 * @id reduce
		 * @section Transforms
		 * @name Stream.reduce(iterator, memo)
		 * @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(add, 0)  // => 10
		 */

		addMethod('reduce', function (f, z) {
		    // 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();
		        }
		    });
		});

		/**
		 * 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
		 */

		addMethod('reduce1', function (f) {
		    var self = this;
		    return self.createChild(function (push, next) {
		        self.pull(function (err, x) {
		            if (err) {
		                push(err);
		                next();
		            }
		            else if (x === nil) {
		                push(null, nil);
		            }
		            else {
		                next(self.reduce(f, x));
		            }
		        });
		    });
		});

		/**
		 * 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']]
		 * });
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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.
		 *
		 * @id scan
		 * @section Transforms
		 * @name Stream.scan(iterator, memo)
		 * @param memo - the initial state of the reduction
		 * @param {Function} iterator - the function which reduces the values
		 * @api public
		 *
		 * _([1, 2, 3, 4]).scan(add, 0)  // => 0, 1, 3, 6, 10
		 */

		addMethod('scan', function (f, z) {
		    var self = this;
		    return this.create([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();
		            }
		        })
		    );
		});

		/**
		 * 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
		 */

		addMethod('scan1', function (f) {
		    var self = this;
		    return self.createChild(function (push, next) {
		        self.pull(function (err, x) {
		            if (err) {
		                push(err);
		                next();
		            }
		            else if (x === nil) {
		                push(null, nil);
		            }
		            else {
		                next(self.scan(f, x));
		            }
		        });
		    });
		});

		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]
		 */

		addMethod('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;
		        }
		    }
		});

		/**
		 * 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
		 */

		addMethod('concat', function (ys) {
		    ys = _(ys);
		    return this.consume(function (err, x, push, next) {
		        if (x === nil) {
		            next(ys);
		        }
		        else {
		            push(err, x);
		            next();
		        }
		    });
		});

		/**
		 * 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
		 */

		addMethod('merge', function () {
		    var self = this;
		    var srcs = [];

		    var srcsNeedPull = [],
		        first = true,
		        async = false;

		    return this.create(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);
		            }
		        }
		    }
		});

		/**
		 * 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.txt has been read
		 */


		addMethod('mergeWithLimit', function mergeWithLimit(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 this.create(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();
		});

		/**
		 * 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']);
		 */

		addMethod('invoke', function (method, args) {
		    return this.map(function (x) {
		        return x[method].apply(x, args);
		    });
		});

		/**
		 * 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'
		 * });
		 *
		 */

		addMethod('nfcall', function (args) {
		    var wrap = _.wrapCallback._relevel(this.create.bind(this));
		    return this.map(function (x) {
		        return wrap(x).apply(x, args);
		    });
		});

		/**
		 * 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);
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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);
		 */

		addMethod('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();
		        }
		    });
		});

		/**
		 * 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)
		 */

		addMethod('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 this.create(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();
		            }
		        }
		    });
		});

		function StreamMultiplexer(stream) {
		    this._stream = stream;

		    this._consumers = new IntMap();
		    this._requests = new IntMap();
		    this._nonce = 0;
		    this._emitting = false;
		    this._repeatEmit = false;
		    this._cached_value = null;
		    this.paused = true;

		    var self = this;
		    this._pullCb = function _pullCb(err, x) {
		        self.paused = true;
		        if (self._requests.size === self._consumers.size) {
		            self._send(err, x);
		        }
		        else {
		            self._saved_token = [err, x];
		        }
		    };
		}

		/**
		 * Emit downstream. The caller must guarantee that
		 * this._consumers.size === this._requests.size.
		 *
		 * @param err - an error.
		 * @param x - a value.
		 */

		StreamMultiplexer.prototype._send = function _send(err, x) {
		    // Take a snapshot of the current request since calling the callbacks
		    // may trigger more request to be registered.
		    var requests = this._requests;
		    this._requests = new IntMap();

		    requests.forEach(function (requestCb) {
		        requestCb(err, x);
		    });
		};

		/**
		 * Emit if we've met the backpressure requirements.
		 */
		StreamMultiplexer.prototype._resume = function _resume() {
		    if (this._emitting) {
		        this._repeatEmit = true;
		        return;
		    }

		    this._emitting = true;
		    do {
		        // use a repeat flag to avoid recursing pull() calls
		        this._repeatEmit = false;

		        if (this._requests.size === this._consumers.size) {
		            if (this._saved_token) {
		                var token = this._saved_token;
		                this._saved_token = null;
		                this.paused = true;
		                this._send(token[0], token[1]);
		            }
		            else if (this.paused) {
		                this.paused = false;
		                this._stream.pull(this._pullCb);
		            }
		        }
		    } while (this._repeatEmit);
		    this._emitting = false;
		};

		StreamMultiplexer.prototype.pull = function pull(id, cb) {
		    if (!cb) {
		        return;
		    }

		    if (this._requests.has(id)) {
		        cb(new Error('Cannot service a second pull() request while one is in progress.'));
		        return;
		    }

		    this._requests.set(id, cb);

		    this._resume();
		};

		StreamMultiplexer.prototype.newStream = function newStream() {
		    var self = this,
		        id = self._nonce++;

		    self._consumers.set(id, true);

		    var pull = this.pull.bind(this, id);
		    return new this._stream.constructor(newDelegateGenerator(pull))
		        .onDestroy(function () {
		            self.removeConsumer(id);
		        });
		};

		StreamMultiplexer.prototype.removeConsumer = function removeConsumer(id) {
		    if (!this._consumers.has(id)) {
		        return;
		    }

		    this._consumers.delete(id);
		    this._requests.delete(id);

		    this._resume();
		};

		/**
		 * 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 */
		addToplevelMethod('wrapCallback', function (f, /*optional*/mappingHint) {
		    /*eslint-enable no-multi-spaces */
		    var stream = this;
		    var mapper = hintMapper(mappingHint);

		    return function () {
		        var self = this;
		        var args = slice.call(arguments);
		        return stream(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 (wrapCallback, 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;
		}

		addToplevelMethod('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(this.wrapCallback, arg, suffix);
		    if (isClass(arg)) {
		        ret.prototype = streamifyAll(this.wrapCallback, 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__(18), __webpack_require__(21).setImmediate, __webpack_require__(3)))

	/***/ },
	/* 252 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(790);
		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__(76);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(76);

		  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__(14).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__(3)))

	/***/ },
	/* 253 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(76);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 254 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(76);

		  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__(76);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 255 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(252);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(254);
		exports.Duplex = __webpack_require__(76);
		exports.Transform = __webpack_require__(253);
		exports.PassThrough = __webpack_require__(642);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 256 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var base58 = __webpack_require__(35);
		var multihash = __webpack_require__(121);

		var urlPattern = /^https?:\/\/[^\/]+\/(ip(f|n)s)\/((\w+).*)/;
		var pathPattern = /^\/(ip(f|n)s)\/((\w+).*)/;

		function isMultihash(hash) {
		  var formatted = convertToString(hash);
		  try {
		    var buffer = new Buffer(base58.decode(formatted));
		    multihash.decode(buffer);
		    return true;
		  } catch (e) {
		    return false;
		  }
		}

		function isIpfs(input, pattern) {
		  var formatted = convertToString(input);
		  if (!formatted) {
		    return false;
		  }

		  var match = formatted.match(pattern);
		  if (!match) {
		    return false;
		  }

		  if (match[1] !== 'ipfs') {
		    return false;
		  }

		  var hash = match[4];
		  return isMultihash(hash);
		}

		function isIpns(input, pattern) {
		  var formatted = convertToString(input);
		  if (!formatted) {
		    return false;
		  }
		  var match = formatted.match(pattern);
		  if (!match) {
		    return false;
		  }

		  if (match[1] !== 'ipns') {
		    return false;
		  }

		  return true;
		}

		function convertToString(input) {
		  if (Buffer.isBuffer(input)) {
		    return base58.encode(input);
		  }

		  if (typeof input === 'string') {
		    return input;
		  }

		  return false;
		}

		module.exports = {
		  multihash: isMultihash,
		  ipfsUrl: function ipfsUrl(url) {
		    return isIpfs(url, urlPattern);
		  },
		  ipnsUrl: function ipnsUrl(url) {
		    return isIpns(url, urlPattern);
		  },
		  url: function url(_url) {
		    return isIpfs(_url, urlPattern) || isIpns(_url, urlPattern);
		  },
		  urlPattern: urlPattern,
		  ipfsPath: function ipfsPath(path) {
		    return isIpfs(path, pathPattern);
		  },
		  ipnsPath: function ipnsPath(path) {
		    return isIpns(path, pathPattern);
		  },
		  path: function path(_path) {
		    return isIpfs(_path, pathPattern) || isIpns(_path, pathPattern);
		  },
		  pathPattern: pathPattern,
		  urlOrPath: function urlOrPath(x) {
		    return isIpfs(x, urlPattern) || isIpns(x, urlPattern) || isIpfs(x, pathPattern) || isIpns(x, pathPattern);
		  }
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 257 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global) {/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var isNative = __webpack_require__(88),
		    isObject = __webpack_require__(119),
		    noop = __webpack_require__(262);

		/* Native method shortcuts for methods with the same name as other `lodash` methods */
		var nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate;

		/**
		 * The base implementation of `_.create` without support for assigning
		 * properties to the created object.
		 *
		 * @private
		 * @param {Object} prototype The object to inherit from.
		 * @returns {Object} Returns the new object.
		 */
		function baseCreate(prototype, properties) {
		  return isObject(prototype) ? nativeCreate(prototype) : {};
		}
		// fallback for browsers without `Object.create`
		if (!nativeCreate) {
		  baseCreate = (function() {
		    function Object() {}
		    return function(prototype) {
		      if (isObject(prototype)) {
		        Object.prototype = prototype;
		        var result = new Object;
		        Object.prototype = null;
		      }
		      return result || global.Object();
		    };
		  }());
		}

		module.exports = baseCreate;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 258 */
	/***/ function(module, exports) {

		/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */

		/** Used as references for various `Number` constants. */
		var MAX_SAFE_INTEGER = 9007199254740991;

		/** `Object#toString` result references. */
		var argsTag = '[object Arguments]',
		    funcTag = '[object Function]',
		    genTag = '[object GeneratorFunction]',
		    stringTag = '[object String]';

		/** Used to detect unsigned integer values. */
		var reIsUint = /^(?:0|[1-9]\d*)$/;

		/**
		 * The base implementation of `_.times` without support for iteratee shorthands
		 * or max array length checks.
		 *
		 * @private
		 * @param {number} n The number of times to invoke `iteratee`.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array} Returns the array of results.
		 */
		function baseTimes(n, iteratee) {
		  var index = -1,
		      result = Array(n);

		  while (++index < n) {
		    result[index] = iteratee(index);
		  }
		  return result;
		}

		/** Used for built-in method references. */
		var objectProto = Object.prototype;

		/** Used to check objects for own properties. */
		var hasOwnProperty = objectProto.hasOwnProperty;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/** Built-in value references. */
		var propertyIsEnumerable = objectProto.propertyIsEnumerable;

		/* Built-in method references for those with the same name as other `lodash` methods. */
		var nativeGetPrototype = Object.getPrototypeOf,
		    nativeKeys = Object.keys;

		/**
		 * The base implementation of `_.forEach` without support for iteratee shorthands.
		 *
		 * @private
		 * @param {Array|Object} collection The collection to iterate over.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array|Object} Returns `collection`.
		 */
		var baseEach = createBaseEach(baseForOwn);

		/**
		 * The base implementation of `baseForOwn` which iterates over `object`
		 * properties returned by `keysFunc` and invokes `iteratee` for each property.
		 * Iteratee functions may exit iteration early by explicitly returning `false`.
		 *
		 * @private
		 * @param {Object} object The object to iterate over.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @param {Function} keysFunc The function to get the keys of `object`.
		 * @returns {Object} Returns `object`.
		 */
		var baseFor = createBaseFor();

		/**
		 * The base implementation of `_.forOwn` without support for iteratee shorthands.
		 *
		 * @private
		 * @param {Object} object The object to iterate over.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Object} Returns `object`.
		 */
		function baseForOwn(object, iteratee) {
		  return object && baseFor(object, iteratee, keys);
		}

		/**
		 * The base implementation of `_.has` without support for deep paths.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} key The key to check.
		 * @returns {boolean} Returns `true` if `key` exists, else `false`.
		 */
		function baseHas(object, key) {
		  // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`,
		  // that are composed entirely of index properties, return `false` for
		  // `hasOwnProperty` checks of them.
		  return hasOwnProperty.call(object, key) ||
		    (typeof object == 'object' && key in object && getPrototype(object) === null);
		}

		/**
		 * The base implementation of `_.keys` which doesn't skip the constructor
		 * property of prototypes or treat sparse arrays as dense.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the array of property names.
		 */
		function baseKeys(object) {
		  return nativeKeys(Object(object));
		}

		/**
		 * The base implementation of `_.property` without support for deep paths.
		 *
		 * @private
		 * @param {string} key The key of the property to get.
		 * @returns {Function} Returns the new accessor function.
		 */
		function baseProperty(key) {
		  return function(object) {
		    return object == null ? undefined : object[key];
		  };
		}

		/**
		 * Creates a `baseEach` or `baseEachRight` function.
		 *
		 * @private
		 * @param {Function} eachFunc The function to iterate over a collection.
		 * @param {boolean} [fromRight] Specify iterating from right to left.
		 * @returns {Function} Returns the new base function.
		 */
		function createBaseEach(eachFunc, fromRight) {
		  return function(collection, iteratee) {
		    if (collection == null) {
		      return collection;
		    }
		    if (!isArrayLike(collection)) {
		      return eachFunc(collection, iteratee);
		    }
		    var length = collection.length,
		        index = fromRight ? length : -1,
		        iterable = Object(collection);

		    while ((fromRight ? index-- : ++index < length)) {
		      if (iteratee(iterable[index], index, iterable) === false) {
		        break;
		      }
		    }
		    return collection;
		  };
		}

		/**
		 * Creates a base function for methods like `_.forIn` and `_.forOwn`.
		 *
		 * @private
		 * @param {boolean} [fromRight] Specify iterating from right to left.
		 * @returns {Function} Returns the new base function.
		 */
		function createBaseFor(fromRight) {
		  return function(object, iteratee, keysFunc) {
		    var index = -1,
		        iterable = Object(object),
		        props = keysFunc(object),
		        length = props.length;

		    while (length--) {
		      var key = props[fromRight ? length : ++index];
		      if (iteratee(iterable[key], key, iterable) === false) {
		        break;
		      }
		    }
		    return object;
		  };
		}

		/**
		 * 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 `[[Prototype]]` of `value`.
		 *
		 * @private
		 * @param {*} value The value to query.
		 * @returns {null|Object} Returns the `[[Prototype]]`.
		 */
		function getPrototype(value) {
		  return nativeGetPrototype(Object(value));
		}

		/**
		 * Creates an array of index keys for `object` values of arrays,
		 * `arguments` objects, and strings, otherwise `null` is returned.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array|null} Returns index keys, else `null`.
		 */
		function indexKeys(object) {
		  var length = object ? object.length : undefined;
		  if (isLength(length) &&
		      (isArray(object) || isString(object) || isArguments(object))) {
		    return baseTimes(length, String);
		  }
		  return null;
		}

		/**
		 * Checks if `value` is a valid array-like index.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
		 * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
		 */
		function isIndex(value, length) {
		  length = length == null ? MAX_SAFE_INTEGER : length;
		  return !!length &&
		    (typeof value == 'number' || reIsUint.test(value)) &&
		    (value > -1 && value % 1 == 0 && value < length);
		}

		/**
		 * Checks if `value` is likely a prototype object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
		 */
		function isPrototype(value) {
		  var Ctor = value && value.constructor,
		      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;

		  return value === proto;
		}

		/**
		 * Checks if `value` is likely an `arguments` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isArguments(function() { return arguments; }());
		 * // => true
		 *
		 * _.isArguments([1, 2, 3]);
		 * // => false
		 */
		function isArguments(value) {
		  // Safari 8.1 incorrectly makes `arguments.callee` enumerable in strict mode.
		  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&
		    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);
		}

		/**
		 * Checks if `value` is classified as an `Array` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @type {Function}
		 * @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(document.body.children);
		 * // => false
		 *
		 * _.isArray('abc');
		 * // => false
		 *
		 * _.isArray(_.noop);
		 * // => false
		 */
		var isArray = Array.isArray;

		/**
		 * Checks if `value` is array-like. A value is considered array-like if it's
		 * not a function and has a `value.length` that's an integer greater than or
		 * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
		 * @example
		 *
		 * _.isArrayLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLike(document.body.children);
		 * // => true
		 *
		 * _.isArrayLike('abc');
		 * // => true
		 *
		 * _.isArrayLike(_.noop);
		 * // => false
		 */
		function isArrayLike(value) {
		  return value != null && isLength(getLength(value)) && !isFunction(value);
		}

		/**
		 * This method is like `_.isArrayLike` except that it also checks if `value`
		 * is an object.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an array-like object,
		 *  else `false`.
		 * @example
		 *
		 * _.isArrayLikeObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLikeObject(document.body.children);
		 * // => true
		 *
		 * _.isArrayLikeObject('abc');
		 * // => false
		 *
		 * _.isArrayLikeObject(_.noop);
		 * // => false
		 */
		function isArrayLikeObject(value) {
		  return isObjectLike(value) && isArrayLike(value);
		}

		/**
		 * Checks if `value` is classified as a `Function` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @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 Safari 8 which returns 'object' for typed array and weak map constructors,
		  // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		  var tag = isObject(value) ? objectToString.call(value) : '';
		  return tag == funcTag || tag == genTag;
		}

		/**
		 * Checks if `value` is a valid array-like length.
		 *
		 * **Note:** This function is loosely based on
		 * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a valid length,
		 *  else `false`.
		 * @example
		 *
		 * _.isLength(3);
		 * // => true
		 *
		 * _.isLength(Number.MIN_VALUE);
		 * // => false
		 *
		 * _.isLength(Infinity);
		 * // => false
		 *
		 * _.isLength('3');
		 * // => false
		 */
		function isLength(value) {
		  return typeof value == 'number' &&
		    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
		}

		/**
		 * Checks if `value` is the
		 * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
		 * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(_.noop);
		 * // => true
		 *
		 * _.isObject(null);
		 * // => false
		 */
		function isObject(value) {
		  var type = typeof value;
		  return !!value && (type == 'object' || type == 'function');
		}

		/**
		 * Checks if `value` is object-like. A value is object-like if it's not `null`
		 * and has a `typeof` result of "object".
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
		 * @example
		 *
		 * _.isObjectLike({});
		 * // => true
		 *
		 * _.isObjectLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isObjectLike(_.noop);
		 * // => false
		 *
		 * _.isObjectLike(null);
		 * // => false
		 */
		function isObjectLike(value) {
		  return !!value && typeof value == 'object';
		}

		/**
		 * Checks if `value` is classified as a `String` primitive or object.
		 *
		 * @static
		 * @since 0.1.0
		 * @memberOf _
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isString('abc');
		 * // => true
		 *
		 * _.isString(1);
		 * // => false
		 */
		function isString(value) {
		  return typeof value == 'string' ||
		    (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);
		}

		/**
		 * 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
		 * @since 0.1.0
		 * @memberOf _
		 * @category Object
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the array of property names.
		 * @example
		 *
		 * function Foo() {
		 *   this.a = 1;
		 *   this.b = 2;
		 * }
		 *
		 * Foo.prototype.c = 3;
		 *
		 * _.keys(new Foo);
		 * // => ['a', 'b'] (iteration order is not guaranteed)
		 *
		 * _.keys('hi');
		 * // => ['0', '1']
		 */
		function keys(object) {
		  var isProto = isPrototype(object);
		  if (!(isProto || isArrayLike(object))) {
		    return baseKeys(object);
		  }
		  var indexes = indexKeys(object),
		      skipIndexes = !!indexes,
		      result = indexes || [],
		      length = result.length;

		  for (var key in object) {
		    if (baseHas(object, key) &&
		        !(skipIndexes && (key == 'length' || isIndex(key, length))) &&
		        !(isProto && key == 'constructor')) {
		      result.push(key);
		    }
		  }
		  return result;
		}

		module.exports = baseEach;


	/***/ },
	/* 259 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(module, global) {/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */
		var stringToPath = __webpack_require__(672);

		/** Used as the size to enable large array optimizations. */
		var LARGE_ARRAY_SIZE = 200;

		/** Used to stand-in for `undefined` hash values. */
		var HASH_UNDEFINED = '__lodash_hash_undefined__';

		/** Used to compose bitmasks for comparison styles. */
		var UNORDERED_COMPARE_FLAG = 1,
		    PARTIAL_COMPARE_FLAG = 2;

		/** Used as references for various `Number` constants. */
		var INFINITY = 1 / 0,
		    MAX_SAFE_INTEGER = 9007199254740991;

		/** `Object#toString` result references. */
		var argsTag = '[object Arguments]',
		    arrayTag = '[object Array]',
		    boolTag = '[object Boolean]',
		    dateTag = '[object Date]',
		    errorTag = '[object Error]',
		    funcTag = '[object Function]',
		    genTag = '[object GeneratorFunction]',
		    mapTag = '[object Map]',
		    numberTag = '[object Number]',
		    objectTag = '[object Object]',
		    promiseTag = '[object Promise]',
		    regexpTag = '[object RegExp]',
		    setTag = '[object Set]',
		    stringTag = '[object String]',
		    symbolTag = '[object Symbol]',
		    weakMapTag = '[object WeakMap]';

		var arrayBufferTag = '[object ArrayBuffer]',
		    dataViewTag = '[object DataView]',
		    float32Tag = '[object Float32Array]',
		    float64Tag = '[object Float64Array]',
		    int8Tag = '[object Int8Array]',
		    int16Tag = '[object Int16Array]',
		    int32Tag = '[object Int32Array]',
		    uint8Tag = '[object Uint8Array]',
		    uint8ClampedTag = '[object Uint8ClampedArray]',
		    uint16Tag = '[object Uint16Array]',
		    uint32Tag = '[object Uint32Array]';

		/** Used to match property names within property paths. */
		var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
		    reIsPlainProp = /^\w*$/;

		/**
		 * Used to match `RegExp`
		 * [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns).
		 */
		var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;

		/** Used to detect host constructors (Safari). */
		var reIsHostCtor = /^\[object .+?Constructor\]$/;

		/** Used to detect unsigned integer values. */
		var reIsUint = /^(?:0|[1-9]\d*)$/;

		/** Used to identify `toStringTag` values of typed arrays. */
		var typedArrayTags = {};
		typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
		typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
		typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
		typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
		typedArrayTags[uint32Tag] = true;
		typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
		typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
		typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
		typedArrayTags[errorTag] = typedArrayTags[funcTag] =
		typedArrayTags[mapTag] = typedArrayTags[numberTag] =
		typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
		typedArrayTags[setTag] = typedArrayTags[stringTag] =
		typedArrayTags[weakMapTag] = false;

		/** Used to determine if values are of the language type `Object`. */
		var objectTypes = {
		  'function': true,
		  'object': true
		};

		/** Detect free variable `exports`. */
		var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
		  ? exports
		  : undefined;

		/** Detect free variable `module`. */
		var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
		  ? module
		  : undefined;

		/** Detect free variable `global` from Node.js. */
		var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);

		/** Detect free variable `self`. */
		var freeSelf = checkGlobal(objectTypes[typeof self] && self);

		/** Detect free variable `window`. */
		var freeWindow = checkGlobal(objectTypes[typeof window] && window);

		/** Detect `this` as the global object. */
		var thisGlobal = checkGlobal(objectTypes[typeof this] && this);

		/**
		 * 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 !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
		    freeSelf || thisGlobal || Function('return this')();

		/**
		 * A specialized version of `_.map` for arrays without support for iteratee
		 * shorthands.
		 *
		 * @private
		 * @param {Array} array The array to iterate over.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array} Returns the new mapped array.
		 */
		function arrayMap(array, iteratee) {
		  var index = -1,
		      length = array.length,
		      result = Array(length);

		  while (++index < length) {
		    result[index] = iteratee(array[index], index, array);
		  }
		  return result;
		}

		/**
		 * A specialized version of `_.some` for arrays without support for iteratee
		 * shorthands.
		 *
		 * @private
		 * @param {Array} array The array to iterate over.
		 * @param {Function} predicate The function invoked per iteration.
		 * @returns {boolean} Returns `true` if any element passes the predicate check,
		 *  else `false`.
		 */
		function arraySome(array, predicate) {
		  var index = -1,
		      length = array.length;

		  while (++index < length) {
		    if (predicate(array[index], index, array)) {
		      return true;
		    }
		  }
		  return false;
		}

		/**
		 * The base implementation of `_.times` without support for iteratee shorthands
		 * or max array length checks.
		 *
		 * @private
		 * @param {number} n The number of times to invoke `iteratee`.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array} Returns the array of results.
		 */
		function baseTimes(n, iteratee) {
		  var index = -1,
		      result = Array(n);

		  while (++index < n) {
		    result[index] = iteratee(index);
		  }
		  return result;
		}

		/**
		 * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
		 * of key-value pairs for `object` corresponding to the property names of `props`.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array} props The property names to get values for.
		 * @returns {Object} Returns the key-value pairs.
		 */
		function baseToPairs(object, props) {
		  return arrayMap(props, function(key) {
		    return [key, object[key]];
		  });
		}

		/**
		 * Checks if `value` is a global object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {null|Object} Returns `value` if it's a global object, else `null`.
		 */
		function checkGlobal(value) {
		  return (value && value.Object === Object) ? value : null;
		}

		/**
		 * Checks if `value` is a host object in IE < 9.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
		 */
		function isHostObject(value) {
		  // Many host objects are `Object` objects that can coerce to strings
		  // despite having improperly defined `toString` methods.
		  var result = false;
		  if (value != null && typeof value.toString != 'function') {
		    try {
		      result = !!(value + '');
		    } catch (e) {}
		  }
		  return result;
		}

		/**
		 * Converts `map` to its key-value pairs.
		 *
		 * @private
		 * @param {Object} map The map to convert.
		 * @returns {Array} Returns the key-value pairs.
		 */
		function mapToArray(map) {
		  var index = -1,
		      result = Array(map.size);

		  map.forEach(function(value, key) {
		    result[++index] = [key, value];
		  });
		  return result;
		}

		/**
		 * Converts `set` to an array of its values.
		 *
		 * @private
		 * @param {Object} set The set to convert.
		 * @returns {Array} Returns the values.
		 */
		function setToArray(set) {
		  var index = -1,
		      result = Array(set.size);

		  set.forEach(function(value) {
		    result[++index] = value;
		  });
		  return result;
		}

		/**
		 * Converts `set` to its value-value pairs.
		 *
		 * @private
		 * @param {Object} set The set to convert.
		 * @returns {Array} Returns the value-value pairs.
		 */
		function setToPairs(set) {
		  var index = -1,
		      result = Array(set.size);

		  set.forEach(function(value) {
		    result[++index] = [value, value];
		  });
		  return result;
		}

		/** Used for built-in method references. */
		var arrayProto = Array.prototype,
		    objectProto = Object.prototype;

		/** Used to resolve the decompiled source of functions. */
		var funcToString = Function.prototype.toString;

		/** Used to check objects for own properties. */
		var hasOwnProperty = objectProto.hasOwnProperty;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/** Used to detect if a method is native. */
		var reIsNative = RegExp('^' +
		  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
		  .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
		);

		/** Built-in value references. */
		var Symbol = root.Symbol,
		    Uint8Array = root.Uint8Array,
		    propertyIsEnumerable = objectProto.propertyIsEnumerable,
		    splice = arrayProto.splice;

		/* Built-in method references for those with the same name as other `lodash` methods. */
		var nativeGetPrototype = Object.getPrototypeOf,
		    nativeKeys = Object.keys;

		/* Built-in method references that are verified to be native. */
		var DataView = getNative(root, 'DataView'),
		    Map = getNative(root, 'Map'),
		    Promise = getNative(root, 'Promise'),
		    Set = getNative(root, 'Set'),
		    WeakMap = getNative(root, 'WeakMap'),
		    nativeCreate = getNative(Object, 'create');

		/** Used to detect maps, sets, and weakmaps. */
		var dataViewCtorString = toSource(DataView),
		    mapCtorString = toSource(Map),
		    promiseCtorString = toSource(Promise),
		    setCtorString = toSource(Set),
		    weakMapCtorString = toSource(WeakMap);

		/** Used to convert symbols to primitives and strings. */
		var symbolProto = Symbol ? Symbol.prototype : undefined,
		    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;

		/**
		 * Creates a hash object.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function Hash(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the hash.
		 *
		 * @private
		 * @name clear
		 * @memberOf Hash
		 */
		function hashClear() {
		  this.__data__ = nativeCreate ? nativeCreate(null) : {};
		}

		/**
		 * Removes `key` and its value from the hash.
		 *
		 * @private
		 * @name delete
		 * @memberOf Hash
		 * @param {Object} hash The hash to modify.
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function hashDelete(key) {
		  return this.has(key) && delete this.__data__[key];
		}

		/**
		 * Gets the hash value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf Hash
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function hashGet(key) {
		  var data = this.__data__;
		  if (nativeCreate) {
		    var result = data[key];
		    return result === HASH_UNDEFINED ? undefined : result;
		  }
		  return hasOwnProperty.call(data, key) ? data[key] : undefined;
		}

		/**
		 * Checks if a hash value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf Hash
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function hashHas(key) {
		  var data = this.__data__;
		  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);
		}

		/**
		 * Sets the hash `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf Hash
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the hash instance.
		 */
		function hashSet(key, value) {
		  var data = this.__data__;
		  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;
		  return this;
		}

		// Add methods to `Hash`.
		Hash.prototype.clear = hashClear;
		Hash.prototype['delete'] = hashDelete;
		Hash.prototype.get = hashGet;
		Hash.prototype.has = hashHas;
		Hash.prototype.set = hashSet;

		/**
		 * Creates an list cache object.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function ListCache(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the list cache.
		 *
		 * @private
		 * @name clear
		 * @memberOf ListCache
		 */
		function listCacheClear() {
		  this.__data__ = [];
		}

		/**
		 * Removes `key` and its value from the list cache.
		 *
		 * @private
		 * @name delete
		 * @memberOf ListCache
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function listCacheDelete(key) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  if (index < 0) {
		    return false;
		  }
		  var lastIndex = data.length - 1;
		  if (index == lastIndex) {
		    data.pop();
		  } else {
		    splice.call(data, index, 1);
		  }
		  return true;
		}

		/**
		 * Gets the list cache value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf ListCache
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function listCacheGet(key) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  return index < 0 ? undefined : data[index][1];
		}

		/**
		 * Checks if a list cache value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf ListCache
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function listCacheHas(key) {
		  return assocIndexOf(this.__data__, key) > -1;
		}

		/**
		 * Sets the list cache `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf ListCache
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the list cache instance.
		 */
		function listCacheSet(key, value) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  if (index < 0) {
		    data.push([key, value]);
		  } else {
		    data[index][1] = value;
		  }
		  return this;
		}

		// Add methods to `ListCache`.
		ListCache.prototype.clear = listCacheClear;
		ListCache.prototype['delete'] = listCacheDelete;
		ListCache.prototype.get = listCacheGet;
		ListCache.prototype.has = listCacheHas;
		ListCache.prototype.set = listCacheSet;

		/**
		 * Creates a map cache object to store key-value pairs.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function MapCache(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the map.
		 *
		 * @private
		 * @name clear
		 * @memberOf MapCache
		 */
		function mapCacheClear() {
		  this.__data__ = {
		    'hash': new Hash,
		    'map': new (Map || ListCache),
		    'string': new Hash
		  };
		}

		/**
		 * Removes `key` and its value from the map.
		 *
		 * @private
		 * @name delete
		 * @memberOf MapCache
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function mapCacheDelete(key) {
		  return getMapData(this, key)['delete'](key);
		}

		/**
		 * Gets the map value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf MapCache
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function mapCacheGet(key) {
		  return getMapData(this, key).get(key);
		}

		/**
		 * Checks if a map value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf MapCache
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function mapCacheHas(key) {
		  return getMapData(this, key).has(key);
		}

		/**
		 * Sets the map `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf MapCache
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the map cache instance.
		 */
		function mapCacheSet(key, value) {
		  getMapData(this, key).set(key, value);
		  return this;
		}

		// Add methods to `MapCache`.
		MapCache.prototype.clear = mapCacheClear;
		MapCache.prototype['delete'] = mapCacheDelete;
		MapCache.prototype.get = mapCacheGet;
		MapCache.prototype.has = mapCacheHas;
		MapCache.prototype.set = mapCacheSet;

		/**
		 *
		 * Creates an array cache object to store unique values.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [values] The values to cache.
		 */
		function SetCache(values) {
		  var index = -1,
		      length = values ? values.length : 0;

		  this.__data__ = new MapCache;
		  while (++index < length) {
		    this.add(values[index]);
		  }
		}

		/**
		 * Adds `value` to the array cache.
		 *
		 * @private
		 * @name add
		 * @memberOf SetCache
		 * @alias push
		 * @param {*} value The value to cache.
		 * @returns {Object} Returns the cache instance.
		 */
		function setCacheAdd(value) {
		  this.__data__.set(value, HASH_UNDEFINED);
		  return this;
		}

		/**
		 * Checks if `value` is in the array cache.
		 *
		 * @private
		 * @name has
		 * @memberOf SetCache
		 * @param {*} value The value to search for.
		 * @returns {number} Returns `true` if `value` is found, else `false`.
		 */
		function setCacheHas(value) {
		  return this.__data__.has(value);
		}

		// Add methods to `SetCache`.
		SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
		SetCache.prototype.has = setCacheHas;

		/**
		 * Creates a stack cache object to store key-value pairs.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function Stack(entries) {
		  this.__data__ = new ListCache(entries);
		}

		/**
		 * Removes all key-value entries from the stack.
		 *
		 * @private
		 * @name clear
		 * @memberOf Stack
		 */
		function stackClear() {
		  this.__data__ = new ListCache;
		}

		/**
		 * Removes `key` and its value from the stack.
		 *
		 * @private
		 * @name delete
		 * @memberOf Stack
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function stackDelete(key) {
		  return this.__data__['delete'](key);
		}

		/**
		 * Gets the stack value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf Stack
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function stackGet(key) {
		  return this.__data__.get(key);
		}

		/**
		 * Checks if a stack value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf Stack
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function stackHas(key) {
		  return this.__data__.has(key);
		}

		/**
		 * Sets the stack `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf Stack
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the stack cache instance.
		 */
		function stackSet(key, value) {
		  var cache = this.__data__;
		  if (cache instanceof ListCache && cache.__data__.length == LARGE_ARRAY_SIZE) {
		    cache = this.__data__ = new MapCache(cache.__data__);
		  }
		  cache.set(key, value);
		  return this;
		}

		// Add methods to `Stack`.
		Stack.prototype.clear = stackClear;
		Stack.prototype['delete'] = stackDelete;
		Stack.prototype.get = stackGet;
		Stack.prototype.has = stackHas;
		Stack.prototype.set = stackSet;

		/**
		 * Gets the index at which the `key` is found in `array` of key-value pairs.
		 *
		 * @private
		 * @param {Array} array The array to search.
		 * @param {*} key The key to search for.
		 * @returns {number} Returns the index of the matched value, else `-1`.
		 */
		function assocIndexOf(array, key) {
		  var length = array.length;
		  while (length--) {
		    if (eq(array[length][0], key)) {
		      return length;
		    }
		  }
		  return -1;
		}

		/**
		 * The base implementation of `_.get` without support for default values.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} path The path of the property to get.
		 * @returns {*} Returns the resolved value.
		 */
		function baseGet(object, path) {
		  path = isKey(path, object) ? [path] : castPath(path);

		  var index = 0,
		      length = path.length;

		  while (object != null && index < length) {
		    object = object[toKey(path[index++])];
		  }
		  return (index && index == length) ? object : undefined;
		}

		/**
		 * The base implementation of `_.has` without support for deep paths.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} key The key to check.
		 * @returns {boolean} Returns `true` if `key` exists, else `false`.
		 */
		function baseHas(object, key) {
		  // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`,
		  // that are composed entirely of index properties, return `false` for
		  // `hasOwnProperty` checks of them.
		  return hasOwnProperty.call(object, key) ||
		    (typeof object == 'object' && key in object && getPrototype(object) === null);
		}

		/**
		 * The base implementation of `_.hasIn` without support for deep paths.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} key The key to check.
		 * @returns {boolean} Returns `true` if `key` exists, else `false`.
		 */
		function baseHasIn(object, key) {
		  return key in Object(object);
		}

		/**
		 * The base implementation of `_.isEqual` which supports partial comparisons
		 * and tracks traversed objects.
		 *
		 * @private
		 * @param {*} value The value to compare.
		 * @param {*} other The other value to compare.
		 * @param {Function} [customizer] The function to customize comparisons.
		 * @param {boolean} [bitmask] The bitmask of comparison flags.
		 *  The bitmask may be composed of the following flags:
		 *     1 - Unordered comparison
		 *     2 - Partial comparison
		 * @param {Object} [stack] Tracks traversed `value` and `other` objects.
		 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		 */
		function baseIsEqual(value, other, customizer, bitmask, stack) {
		  if (value === other) {
		    return true;
		  }
		  if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
		    return value !== value && other !== other;
		  }
		  return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack);
		}

		/**
		 * A specialized version of `baseIsEqual` for arrays and objects which performs
		 * deep comparisons and tracks traversed objects enabling objects with circular
		 * references to be compared.
		 *
		 * @private
		 * @param {Object} object The object to compare.
		 * @param {Object} other The other object to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} [customizer] The function to customize comparisons.
		 * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} [stack] Tracks traversed `object` and `other` objects.
		 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		 */
		function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) {
		  var objIsArr = isArray(object),
		      othIsArr = isArray(other),
		      objTag = arrayTag,
		      othTag = arrayTag;

		  if (!objIsArr) {
		    objTag = getTag(object);
		    objTag = objTag == argsTag ? objectTag : objTag;
		  }
		  if (!othIsArr) {
		    othTag = getTag(other);
		    othTag = othTag == argsTag ? objectTag : othTag;
		  }
		  var objIsObj = objTag == objectTag && !isHostObject(object),
		      othIsObj = othTag == objectTag && !isHostObject(other),
		      isSameTag = objTag == othTag;

		  if (isSameTag && !objIsObj) {
		    stack || (stack = new Stack);
		    return (objIsArr || isTypedArray(object))
		      ? equalArrays(object, other, equalFunc, customizer, bitmask, stack)
		      : equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack);
		  }
		  if (!(bitmask & PARTIAL_COMPARE_FLAG)) {
		    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
		        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');

		    if (objIsWrapped || othIsWrapped) {
		      var objUnwrapped = objIsWrapped ? object.value() : object,
		          othUnwrapped = othIsWrapped ? other.value() : other;

		      stack || (stack = new Stack);
		      return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack);
		    }
		  }
		  if (!isSameTag) {
		    return false;
		  }
		  stack || (stack = new Stack);
		  return equalObjects(object, other, equalFunc, customizer, bitmask, stack);
		}

		/**
		 * The base implementation of `_.isMatch` without support for iteratee shorthands.
		 *
		 * @private
		 * @param {Object} object The object to inspect.
		 * @param {Object} source The object of property values to match.
		 * @param {Array} matchData The property names, values, and compare flags to match.
		 * @param {Function} [customizer] The function to customize comparisons.
		 * @returns {boolean} Returns `true` if `object` is a match, else `false`.
		 */
		function baseIsMatch(object, source, matchData, customizer) {
		  var index = matchData.length,
		      length = index,
		      noCustomizer = !customizer;

		  if (object == null) {
		    return !length;
		  }
		  object = Object(object);
		  while (index--) {
		    var data = matchData[index];
		    if ((noCustomizer && data[2])
		          ? data[1] !== object[data[0]]
		          : !(data[0] in object)
		        ) {
		      return false;
		    }
		  }
		  while (++index < length) {
		    data = matchData[index];
		    var key = data[0],
		        objValue = object[key],
		        srcValue = data[1];

		    if (noCustomizer && data[2]) {
		      if (objValue === undefined && !(key in object)) {
		        return false;
		      }
		    } else {
		      var stack = new Stack;
		      if (customizer) {
		        var result = customizer(objValue, srcValue, key, object, source, stack);
		      }
		      if (!(result === undefined
		            ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack)
		            : result
		          )) {
		        return false;
		      }
		    }
		  }
		  return true;
		}

		/**
		 * The base implementation of `_.iteratee`.
		 *
		 * @private
		 * @param {*} [value=_.identity] The value to convert to an iteratee.
		 * @returns {Function} Returns the iteratee.
		 */
		function baseIteratee(value) {
		  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
		  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
		  if (typeof value == 'function') {
		    return value;
		  }
		  if (value == null) {
		    return identity;
		  }
		  if (typeof value == 'object') {
		    return isArray(value)
		      ? baseMatchesProperty(value[0], value[1])
		      : baseMatches(value);
		  }
		  return property(value);
		}

		/**
		 * The base implementation of `_.keys` which doesn't skip the constructor
		 * property of prototypes or treat sparse arrays as dense.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the array of property names.
		 */
		function baseKeys(object) {
		  return nativeKeys(Object(object));
		}

		/**
		 * The base implementation of `_.matches` which doesn't clone `source`.
		 *
		 * @private
		 * @param {Object} source The object of property values to match.
		 * @returns {Function} Returns the new spec function.
		 */
		function baseMatches(source) {
		  var matchData = getMatchData(source);
		  if (matchData.length == 1 && matchData[0][2]) {
		    return matchesStrictComparable(matchData[0][0], matchData[0][1]);
		  }
		  return function(object) {
		    return object === source || baseIsMatch(object, source, matchData);
		  };
		}

		/**
		 * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
		 *
		 * @private
		 * @param {string} path The path of the property to get.
		 * @param {*} srcValue The value to match.
		 * @returns {Function} Returns the new spec function.
		 */
		function baseMatchesProperty(path, srcValue) {
		  if (isKey(path) && isStrictComparable(srcValue)) {
		    return matchesStrictComparable(toKey(path), srcValue);
		  }
		  return function(object) {
		    var objValue = get(object, path);
		    return (objValue === undefined && objValue === srcValue)
		      ? hasIn(object, path)
		      : baseIsEqual(srcValue, objValue, undefined, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG);
		  };
		}

		/**
		 * The base implementation of `_.property` without support for deep paths.
		 *
		 * @private
		 * @param {string} key The key of the property to get.
		 * @returns {Function} Returns the new accessor function.
		 */
		function baseProperty(key) {
		  return function(object) {
		    return object == null ? undefined : object[key];
		  };
		}

		/**
		 * A specialized version of `baseProperty` which supports deep paths.
		 *
		 * @private
		 * @param {Array|string} path The path of the property to get.
		 * @returns {Function} Returns the new accessor function.
		 */
		function basePropertyDeep(path) {
		  return function(object) {
		    return baseGet(object, path);
		  };
		}

		/**
		 * Casts `value` to a path array if it's not one.
		 *
		 * @private
		 * @param {*} value The value to inspect.
		 * @returns {Array} Returns the cast property path array.
		 */
		function castPath(value) {
		  return isArray(value) ? value : stringToPath(value);
		}

		/**
		 * Creates a `_.toPairs` or `_.toPairsIn` function.
		 *
		 * @private
		 * @param {Function} keysFunc The function to get the keys of a given object.
		 * @returns {Function} Returns the new pairs function.
		 */
		function createToPairs(keysFunc) {
		  return function(object) {
		    var tag = getTag(object);
		    if (tag == mapTag) {
		      return mapToArray(object);
		    }
		    if (tag == setTag) {
		      return setToPairs(object);
		    }
		    return baseToPairs(object, keysFunc(object));
		  };
		}

		/**
		 * A specialized version of `baseIsEqualDeep` for arrays with support for
		 * partial deep comparisons.
		 *
		 * @private
		 * @param {Array} array The array to compare.
		 * @param {Array} other The other array to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} customizer The function to customize comparisons.
		 * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} stack Tracks traversed `array` and `other` objects.
		 * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
		 */
		function equalArrays(array, other, equalFunc, customizer, bitmask, stack) {
		  var isPartial = bitmask & PARTIAL_COMPARE_FLAG,
		      arrLength = array.length,
		      othLength = other.length;

		  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
		    return false;
		  }
		  // Assume cyclic values are equal.
		  var stacked = stack.get(array);
		  if (stacked) {
		    return stacked == other;
		  }
		  var index = -1,
		      result = true,
		      seen = (bitmask & UNORDERED_COMPARE_FLAG) ? new SetCache : undefined;

		  stack.set(array, other);

		  // Ignore non-index properties.
		  while (++index < arrLength) {
		    var arrValue = array[index],
		        othValue = other[index];

		    if (customizer) {
		      var compared = isPartial
		        ? customizer(othValue, arrValue, index, other, array, stack)
		        : customizer(arrValue, othValue, index, array, other, stack);
		    }
		    if (compared !== undefined) {
		      if (compared) {
		        continue;
		      }
		      result = false;
		      break;
		    }
		    // Recursively compare arrays (susceptible to call stack limits).
		    if (seen) {
		      if (!arraySome(other, function(othValue, othIndex) {
		            if (!seen.has(othIndex) &&
		                (arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack))) {
		              return seen.add(othIndex);
		            }
		          })) {
		        result = false;
		        break;
		      }
		    } else if (!(
		          arrValue === othValue ||
		            equalFunc(arrValue, othValue, customizer, bitmask, stack)
		        )) {
		      result = false;
		      break;
		    }
		  }
		  stack['delete'](array);
		  return result;
		}

		/**
		 * A specialized version of `baseIsEqualDeep` for comparing objects of
		 * the same `toStringTag`.
		 *
		 * **Note:** This function only supports comparing values with tags of
		 * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
		 *
		 * @private
		 * @param {Object} object The object to compare.
		 * @param {Object} other The other object to compare.
		 * @param {string} tag The `toStringTag` of the objects to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} customizer The function to customize comparisons.
		 * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} stack Tracks traversed `object` and `other` objects.
		 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		 */
		function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) {
		  switch (tag) {
		    case dataViewTag:
		      if ((object.byteLength != other.byteLength) ||
		          (object.byteOffset != other.byteOffset)) {
		        return false;
		      }
		      object = object.buffer;
		      other = other.buffer;

		    case arrayBufferTag:
		      if ((object.byteLength != other.byteLength) ||
		          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
		        return false;
		      }
		      return true;

		    case boolTag:
		    case dateTag:
		      // 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 objects,
		      // as equal. See http://www.ecma-international.org/ecma-262/6.0/#sec-regexp.prototype.tostring
		      // for more details.
		      return object == (other + '');

		    case mapTag:
		      var convert = mapToArray;

		    case setTag:
		      var isPartial = bitmask & PARTIAL_COMPARE_FLAG;
		      convert || (convert = setToArray);

		      if (object.size != other.size && !isPartial) {
		        return false;
		      }
		      // Assume cyclic values are equal.
		      var stacked = stack.get(object);
		      if (stacked) {
		        return stacked == other;
		      }
		      bitmask |= UNORDERED_COMPARE_FLAG;
		      stack.set(object, other);

		      // Recursively compare objects (susceptible to call stack limits).
		      return equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack);

		    case symbolTag:
		      if (symbolValueOf) {
		        return symbolValueOf.call(object) == symbolValueOf.call(other);
		      }
		  }
		  return false;
		}

		/**
		 * A specialized version of `baseIsEqualDeep` for objects with support for
		 * partial deep comparisons.
		 *
		 * @private
		 * @param {Object} object The object to compare.
		 * @param {Object} other The other object to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} customizer The function to customize comparisons.
		 * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} stack Tracks traversed `object` and `other` objects.
		 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		 */
		function equalObjects(object, other, equalFunc, customizer, bitmask, stack) {
		  var isPartial = bitmask & PARTIAL_COMPARE_FLAG,
		      objProps = keys(object),
		      objLength = objProps.length,
		      othProps = keys(other),
		      othLength = othProps.length;

		  if (objLength != othLength && !isPartial) {
		    return false;
		  }
		  var index = objLength;
		  while (index--) {
		    var key = objProps[index];
		    if (!(isPartial ? key in other : baseHas(other, key))) {
		      return false;
		    }
		  }
		  // Assume cyclic values are equal.
		  var stacked = stack.get(object);
		  if (stacked) {
		    return stacked == other;
		  }
		  var result = true;
		  stack.set(object, other);

		  var skipCtor = isPartial;
		  while (++index < objLength) {
		    key = objProps[index];
		    var objValue = object[key],
		        othValue = other[key];

		    if (customizer) {
		      var compared = isPartial
		        ? customizer(othValue, objValue, key, other, object, stack)
		        : customizer(objValue, othValue, key, object, other, stack);
		    }
		    // Recursively compare objects (susceptible to call stack limits).
		    if (!(compared === undefined
		          ? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack))
		          : compared
		        )) {
		      result = false;
		      break;
		    }
		    skipCtor || (skipCtor = key == 'constructor');
		  }
		  if (result && !skipCtor) {
		    var objCtor = object.constructor,
		        othCtor = other.constructor;

		    // Non `Object` object instances with different constructors are not equal.
		    if (objCtor != othCtor &&
		        ('constructor' in object && 'constructor' in other) &&
		        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
		          typeof othCtor == 'function' && othCtor instanceof othCtor)) {
		      result = false;
		    }
		  }
		  stack['delete'](object);
		  return 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 data for `map`.
		 *
		 * @private
		 * @param {Object} map The map to query.
		 * @param {string} key The reference key.
		 * @returns {*} Returns the map data.
		 */
		function getMapData(map, key) {
		  var data = map.__data__;
		  return isKeyable(key)
		    ? data[typeof key == 'string' ? 'string' : 'hash']
		    : data.map;
		}

		/**
		 * Gets the property names, values, and compare flags of `object`.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the match data of `object`.
		 */
		function getMatchData(object) {
		  var result = toPairs(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[key];
		  return isNative(value) ? value : undefined;
		}

		/**
		 * Gets the `[[Prototype]]` of `value`.
		 *
		 * @private
		 * @param {*} value The value to query.
		 * @returns {null|Object} Returns the `[[Prototype]]`.
		 */
		function getPrototype(value) {
		  return nativeGetPrototype(Object(value));
		}

		/**
		 * Gets the `toStringTag` of `value`.
		 *
		 * @private
		 * @param {*} value The value to query.
		 * @returns {string} Returns the `toStringTag`.
		 */
		function getTag(value) {
		  return objectToString.call(value);
		}

		// Fallback for data views, maps, sets, and weak maps in IE 11,
		// for data views in Edge, and promises in Node.js.
		if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
		    (Map && getTag(new Map) != mapTag) ||
		    (Promise && getTag(Promise.resolve()) != promiseTag) ||
		    (Set && getTag(new Set) != setTag) ||
		    (WeakMap && getTag(new WeakMap) != weakMapTag)) {
		  getTag = function(value) {
		    var result = objectToString.call(value),
		        Ctor = result == objectTag ? value.constructor : undefined,
		        ctorString = Ctor ? toSource(Ctor) : undefined;

		    if (ctorString) {
		      switch (ctorString) {
		        case dataViewCtorString: return dataViewTag;
		        case mapCtorString: return mapTag;
		        case promiseCtorString: return promiseTag;
		        case setCtorString: return setTag;
		        case weakMapCtorString: return weakMapTag;
		      }
		    }
		    return result;
		  };
		}

		/**
		 * Checks if `path` exists on `object`.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} path The path to check.
		 * @param {Function} hasFunc The function to check properties.
		 * @returns {boolean} Returns `true` if `path` exists, else `false`.
		 */
		function hasPath(object, path, hasFunc) {
		  path = isKey(path, object) ? [path] : castPath(path);

		  var result,
		      index = -1,
		      length = path.length;

		  while (++index < length) {
		    var key = toKey(path[index]);
		    if (!(result = object != null && hasFunc(object, key))) {
		      break;
		    }
		    object = object[key];
		  }
		  if (result) {
		    return result;
		  }
		  var length = object ? object.length : 0;
		  return !!length && isLength(length) && isIndex(key, length) &&
		    (isArray(object) || isString(object) || isArguments(object));
		}

		/**
		 * Creates an array of index keys for `object` values of arrays,
		 * `arguments` objects, and strings, otherwise `null` is returned.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array|null} Returns index keys, else `null`.
		 */
		function indexKeys(object) {
		  var length = object ? object.length : undefined;
		  if (isLength(length) &&
		      (isArray(object) || isString(object) || isArguments(object))) {
		    return baseTimes(length, String);
		  }
		  return null;
		}

		/**
		 * Checks if `value` is a valid array-like index.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
		 * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
		 */
		function isIndex(value, length) {
		  length = length == null ? MAX_SAFE_INTEGER : length;
		  return !!length &&
		    (typeof value == 'number' || reIsUint.test(value)) &&
		    (value > -1 && value % 1 == 0 && value < length);
		}

		/**
		 * Checks if `value` is a property name and not a property path.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @param {Object} [object] The object to query keys on.
		 * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
		 */
		function isKey(value, object) {
		  if (isArray(value)) {
		    return false;
		  }
		  var type = typeof value;
		  if (type == 'number' || type == 'symbol' || type == 'boolean' ||
		      value == null || isSymbol(value)) {
		    return true;
		  }
		  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
		    (object != null && value in Object(object));
		}

		/**
		 * Checks if `value` is suitable for use as unique object key.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
		 */
		function isKeyable(value) {
		  var type = typeof value;
		  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
		    ? (value !== '__proto__')
		    : (value === null);
		}

		/**
		 * Checks if `value` is likely a prototype object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
		 */
		function isPrototype(value) {
		  var Ctor = value && value.constructor,
		      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;

		  return value === proto;
		}

		/**
		 * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` if suitable for strict
		 *  equality comparisons, else `false`.
		 */
		function isStrictComparable(value) {
		  return value === value && !isObject(value);
		}

		/**
		 * A specialized version of `matchesProperty` for source values suitable
		 * for strict equality comparisons, i.e. `===`.
		 *
		 * @private
		 * @param {string} key The key of the property to get.
		 * @param {*} srcValue The value to match.
		 * @returns {Function} Returns the new spec function.
		 */
		function matchesStrictComparable(key, srcValue) {
		  return function(object) {
		    if (object == null) {
		      return false;
		    }
		    return object[key] === srcValue &&
		      (srcValue !== undefined || (key in Object(object)));
		  };
		}

		/**
		 * Converts `value` to a string key if it's not a string or symbol.
		 *
		 * @private
		 * @param {*} value The value to inspect.
		 * @returns {string|symbol} Returns the key.
		 */
		function toKey(value) {
		  if (typeof value == 'string' || isSymbol(value)) {
		    return value;
		  }
		  var result = (value + '');
		  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
		}

		/**
		 * Converts `func` to its source code.
		 *
		 * @private
		 * @param {Function} func The function to process.
		 * @returns {string} Returns the source code.
		 */
		function toSource(func) {
		  if (func != null) {
		    try {
		      return funcToString.call(func);
		    } catch (e) {}
		    try {
		      return (func + '');
		    } catch (e) {}
		  }
		  return '';
		}

		/**
		 * Performs a
		 * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
		 * comparison between two values to determine if they are equivalent.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to compare.
		 * @param {*} other The other value to compare.
		 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		 * @example
		 *
		 * var object = { 'user': 'fred' };
		 * var other = { 'user': 'fred' };
		 *
		 * _.eq(object, object);
		 * // => true
		 *
		 * _.eq(object, other);
		 * // => false
		 *
		 * _.eq('a', 'a');
		 * // => true
		 *
		 * _.eq('a', Object('a'));
		 * // => false
		 *
		 * _.eq(NaN, NaN);
		 * // => true
		 */
		function eq(value, other) {
		  return value === other || (value !== value && other !== other);
		}

		/**
		 * Checks if `value` is likely an `arguments` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isArguments(function() { return arguments; }());
		 * // => true
		 *
		 * _.isArguments([1, 2, 3]);
		 * // => false
		 */
		function isArguments(value) {
		  // Safari 8.1 incorrectly makes `arguments.callee` enumerable in strict mode.
		  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&
		    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);
		}

		/**
		 * Checks if `value` is classified as an `Array` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @type {Function}
		 * @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(document.body.children);
		 * // => false
		 *
		 * _.isArray('abc');
		 * // => false
		 *
		 * _.isArray(_.noop);
		 * // => false
		 */
		var isArray = Array.isArray;

		/**
		 * Checks if `value` is array-like. A value is considered array-like if it's
		 * not a function and has a `value.length` that's an integer greater than or
		 * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
		 * @example
		 *
		 * _.isArrayLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLike(document.body.children);
		 * // => true
		 *
		 * _.isArrayLike('abc');
		 * // => true
		 *
		 * _.isArrayLike(_.noop);
		 * // => false
		 */
		function isArrayLike(value) {
		  return value != null && isLength(getLength(value)) && !isFunction(value);
		}

		/**
		 * This method is like `_.isArrayLike` except that it also checks if `value`
		 * is an object.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an array-like object,
		 *  else `false`.
		 * @example
		 *
		 * _.isArrayLikeObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLikeObject(document.body.children);
		 * // => true
		 *
		 * _.isArrayLikeObject('abc');
		 * // => false
		 *
		 * _.isArrayLikeObject(_.noop);
		 * // => false
		 */
		function isArrayLikeObject(value) {
		  return isObjectLike(value) && isArrayLike(value);
		}

		/**
		 * Checks if `value` is classified as a `Function` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @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 Safari 8 which returns 'object' for typed array and weak map constructors,
		  // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		  var tag = isObject(value) ? objectToString.call(value) : '';
		  return tag == funcTag || tag == genTag;
		}

		/**
		 * Checks if `value` is a valid array-like length.
		 *
		 * **Note:** This function is loosely based on
		 * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a valid length,
		 *  else `false`.
		 * @example
		 *
		 * _.isLength(3);
		 * // => true
		 *
		 * _.isLength(Number.MIN_VALUE);
		 * // => false
		 *
		 * _.isLength(Infinity);
		 * // => false
		 *
		 * _.isLength('3');
		 * // => false
		 */
		function isLength(value) {
		  return typeof value == 'number' &&
		    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
		}

		/**
		 * Checks if `value` is the
		 * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
		 * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(_.noop);
		 * // => true
		 *
		 * _.isObject(null);
		 * // => false
		 */
		function isObject(value) {
		  var type = typeof value;
		  return !!value && (type == 'object' || type == 'function');
		}

		/**
		 * Checks if `value` is object-like. A value is object-like if it's not `null`
		 * and has a `typeof` result of "object".
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
		 * @example
		 *
		 * _.isObjectLike({});
		 * // => true
		 *
		 * _.isObjectLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isObjectLike(_.noop);
		 * // => false
		 *
		 * _.isObjectLike(null);
		 * // => false
		 */
		function isObjectLike(value) {
		  return !!value && typeof value == 'object';
		}

		/**
		 * Checks if `value` is a native function.
		 *
		 * @static
		 * @memberOf _
		 * @since 3.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a native function,
		 *  else `false`.
		 * @example
		 *
		 * _.isNative(Array.prototype.push);
		 * // => true
		 *
		 * _.isNative(_);
		 * // => false
		 */
		function isNative(value) {
		  if (!isObject(value)) {
		    return false;
		  }
		  var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;
		  return pattern.test(toSource(value));
		}

		/**
		 * Checks if `value` is classified as a `String` primitive or object.
		 *
		 * @static
		 * @since 0.1.0
		 * @memberOf _
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isString('abc');
		 * // => true
		 *
		 * _.isString(1);
		 * // => false
		 */
		function isString(value) {
		  return typeof value == 'string' ||
		    (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);
		}

		/**
		 * Checks if `value` is classified as a `Symbol` primitive or object.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isSymbol(Symbol.iterator);
		 * // => true
		 *
		 * _.isSymbol('abc');
		 * // => false
		 */
		function isSymbol(value) {
		  return typeof value == 'symbol' ||
		    (isObjectLike(value) && objectToString.call(value) == symbolTag);
		}

		/**
		 * Checks if `value` is classified as a typed array.
		 *
		 * @static
		 * @memberOf _
		 * @since 3.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isTypedArray(new Uint8Array);
		 * // => true
		 *
		 * _.isTypedArray([]);
		 * // => false
		 */
		function isTypedArray(value) {
		  return isObjectLike(value) &&
		    isLength(value.length) && !!typedArrayTags[objectToString.call(value)];
		}

		/**
		 * Gets the value at `path` of `object`. If the resolved value is
		 * `undefined`, the `defaultValue` is used in its place.
		 *
		 * @static
		 * @memberOf _
		 * @since 3.7.0
		 * @category Object
		 * @param {Object} object The object to query.
		 * @param {Array|string} path The path of the property to get.
		 * @param {*} [defaultValue] The value returned for `undefined` resolved values.
		 * @returns {*} Returns the resolved value.
		 * @example
		 *
		 * var object = { 'a': [{ 'b': { 'c': 3 } }] };
		 *
		 * _.get(object, 'a[0].b.c');
		 * // => 3
		 *
		 * _.get(object, ['a', '0', 'b', 'c']);
		 * // => 3
		 *
		 * _.get(object, 'a.b.c', 'default');
		 * // => 'default'
		 */
		function get(object, path, defaultValue) {
		  var result = object == null ? undefined : baseGet(object, path);
		  return result === undefined ? defaultValue : result;
		}

		/**
		 * Checks if `path` is a direct or inherited property of `object`.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Object
		 * @param {Object} object The object to query.
		 * @param {Array|string} path The path to check.
		 * @returns {boolean} Returns `true` if `path` exists, else `false`.
		 * @example
		 *
		 * var object = _.create({ 'a': _.create({ 'b': 2 }) });
		 *
		 * _.hasIn(object, 'a');
		 * // => true
		 *
		 * _.hasIn(object, 'a.b');
		 * // => true
		 *
		 * _.hasIn(object, ['a', 'b']);
		 * // => true
		 *
		 * _.hasIn(object, 'b');
		 * // => false
		 */
		function hasIn(object, path) {
		  return object != null && hasPath(object, path, baseHasIn);
		}

		/**
		 * Creates an 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
		 * @since 0.1.0
		 * @memberOf _
		 * @category Object
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the array of property names.
		 * @example
		 *
		 * function Foo() {
		 *   this.a = 1;
		 *   this.b = 2;
		 * }
		 *
		 * Foo.prototype.c = 3;
		 *
		 * _.keys(new Foo);
		 * // => ['a', 'b'] (iteration order is not guaranteed)
		 *
		 * _.keys('hi');
		 * // => ['0', '1']
		 */
		function keys(object) {
		  var isProto = isPrototype(object);
		  if (!(isProto || isArrayLike(object))) {
		    return baseKeys(object);
		  }
		  var indexes = indexKeys(object),
		      skipIndexes = !!indexes,
		      result = indexes || [],
		      length = result.length;

		  for (var key in object) {
		    if (baseHas(object, key) &&
		        !(skipIndexes && (key == 'length' || isIndex(key, length))) &&
		        !(isProto && key == 'constructor')) {
		      result.push(key);
		    }
		  }
		  return result;
		}

		/**
		 * Creates an array of own enumerable string keyed-value pairs for `object`
		 * which can be consumed by `_.fromPairs`. If `object` is a map or set, its
		 * entries are returned.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @alias entries
		 * @category Object
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the key-value pairs.
		 * @example
		 *
		 * function Foo() {
		 *   this.a = 1;
		 *   this.b = 2;
		 * }
		 *
		 * Foo.prototype.c = 3;
		 *
		 * _.toPairs(new Foo);
		 * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
		 */
		var toPairs = createToPairs(keys);

		/**
		 * This method returns the first argument given to it.
		 *
		 * @static
		 * @since 0.1.0
		 * @memberOf _
		 * @category Util
		 * @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 returns the value at `path` of a given object.
		 *
		 * @static
		 * @memberOf _
		 * @since 2.4.0
		 * @category Util
		 * @param {Array|string} path The path of the property to get.
		 * @returns {Function} Returns the new accessor function.
		 * @example
		 *
		 * var objects = [
		 *   { 'a': { 'b': 2 } },
		 *   { 'a': { 'b': 1 } }
		 * ];
		 *
		 * _.map(objects, _.property('a.b'));
		 * // => [2, 1]
		 *
		 * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
		 * // => [1, 2]
		 */
		function property(path) {
		  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
		}

		module.exports = baseIteratee;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(48)(module), __webpack_require__(18)))

	/***/ },
	/* 260 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.3 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var baseIndexOf = __webpack_require__(667),
		    forOwn = __webpack_require__(675),
		    isArray = __webpack_require__(678),
		    isString = __webpack_require__(681);

		/* Native method shortcuts for methods with the same name as other `lodash` methods */
		var nativeMax = Math.max;

		/**
		 * Checks if a given value is present in a collection using strict equality
		 * for comparisons, i.e. `===`. If `fromIndex` is negative, it is used as the
		 * offset from the end of the collection.
		 *
		 * @static
		 * @memberOf _
		 * @alias include
		 * @category Collections
		 * @param {Array|Object|string} collection The collection to iterate over.
		 * @param {*} target The value to check for.
		 * @param {number} [fromIndex=0] The index to search from.
		 * @returns {boolean} Returns `true` if the `target` element is found, else `false`.
		 * @example
		 *
		 * _.contains([1, 2, 3], 1);
		 * // => true
		 *
		 * _.contains([1, 2, 3], 1, 2);
		 * // => false
		 *
		 * _.contains({ 'name': 'fred', 'age': 40 }, 'fred');
		 * // => true
		 *
		 * _.contains('pebbles', 'eb');
		 * // => true
		 */
		function contains(collection, target, fromIndex) {
		  var index = -1,
		      indexOf = baseIndexOf,
		      length = collection ? collection.length : 0,
		      result = false;

		  fromIndex = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex) || 0;
		  if (isArray(collection)) {
		    result = indexOf(collection, target, fromIndex) > -1;
		  } else if (typeof length == 'number') {
		    result = (isString(collection) ? collection.indexOf(target, fromIndex) : indexOf(collection, target, fromIndex)) > -1;
		  } else {
		    forOwn(collection, function(value) {
		      if (++index >= fromIndex) {
		        return !(result = value === target);
		      }
		    });
		  }
		  return result;
		}

		module.exports = contains;


	/***/ },
	/* 261 */
	/***/ function(module, exports) {

		/**
		 * lodash 3.0.1 (Custom Build) <https://lodash.com/>
		 * Build: `lodash modern modularize exports="npm" -o ./`
		 * 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>
		 */

		/**
		 * 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;
		}

		module.exports = isUndefined;


	/***/ },
	/* 262 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/**
		 * A no-operation function.
		 *
		 * @static
		 * @memberOf _
		 * @category Utilities
		 * @example
		 *
		 * var object = { 'name': 'fred' };
		 * _.noop(object) === undefined;
		 * // => true
		 */
		function noop() {
		  // no operation performed
		}

		module.exports = noop;


	/***/ },
	/* 263 */
	/***/ function(module, exports, __webpack_require__) {

		var bn = __webpack_require__(19);
		var brorand = __webpack_require__(196);

		function MillerRabin(rand) {
		  this.rand = rand || new brorand.Rand();
		}
		module.exports = MillerRabin;

		MillerRabin.create = function create(rand) {
		  return new MillerRabin(rand);
		};

		MillerRabin.prototype._rand = function _rand(n) {
		  var len = n.bitLength();
		  var buf = this.rand.generate(Math.ceil(len / 8));

		  // Set low bits
		  buf[0] |= 3;

		  // Mask high bits
		  var mask = len & 0x7;
		  if (mask !== 0)
		    buf[buf.length - 1] >>= 7 - mask;

		  return new bn(buf);
		}

		MillerRabin.prototype.test = function test(n, k, cb) {
		  var len = n.bitLength();
		  var red = bn.mont(n);
		  var rone = new bn(1).toRed(red);

		  if (!k)
		    k = Math.max(1, (len / 48) | 0);

		  // Find d and s, (n - 1) = (2 ^ s) * d;
		  var n1 = n.subn(1);
		  var n2 = n1.subn(1);
		  for (var s = 0; !n1.testn(s); s++) {}
		  var d = n.shrn(s);

		  var rn1 = n1.toRed(red);

		  var prime = true;
		  for (; k > 0; k--) {
		    var a = this._rand(n2);
		    if (cb)
		      cb(a);

		    var x = a.toRed(red).redPow(d);
		    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)
		      continue;

		    for (var i = 1; i < s; i++) {
		      x = x.redSqr();

		      if (x.cmp(rone) === 0)
		        return false;
		      if (x.cmp(rn1) === 0)
		        break;
		    }

		    if (i === s)
		      return false;
		  }

		  return prime;
		};

		MillerRabin.prototype.getDivisor = function getDivisor(n, k) {
		  var len = n.bitLength();
		  var red = bn.mont(n);
		  var rone = new bn(1).toRed(red);

		  if (!k)
		    k = Math.max(1, (len / 48) | 0);

		  // Find d and s, (n - 1) = (2 ^ s) * d;
		  var n1 = n.subn(1);
		  var n2 = n1.subn(1);
		  for (var s = 0; !n1.testn(s); s++) {}
		  var d = n.shrn(s);

		  var rn1 = n1.toRed(red);

		  for (; k > 0; k--) {
		    var a = this._rand(n2);

		    var g = n.gcd(a);
		    if (g.cmpn(1) !== 0)
		      return g;

		    var x = a.toRed(red).redPow(d);
		    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)
		      continue;

		    for (var i = 1; i < s; i++) {
		      x = x.redSqr();

		      if (x.cmp(rone) === 0)
		        return x.fromRed().subn(1).gcd(n);
		      if (x.cmp(rn1) === 0)
		        break;
		    }

		    if (i === s) {
		      x = x.redSqr();
		      return x.fromRed().subn(1).gcd(n);
		    }
		  }

		  return false;
		};


	/***/ },
	/* 264 */
	/***/ function(module, exports) {

		exports.endianness = function () { return 'LE' };

		exports.hostname = function () {
		    if (typeof location !== 'undefined') {
		        return location.hostname
		    }
		    else return '';
		};

		exports.loadavg = function () { return [] };

		exports.uptime = function () { return 0 };

		exports.freemem = function () {
		    return Number.MAX_VALUE;
		};

		exports.totalmem = function () {
		    return Number.MAX_VALUE;
		};

		exports.cpus = function () { return [] };

		exports.type = function () { return 'Browser' };

		exports.release = function () {
		    if (typeof navigator !== 'undefined') {
		        return navigator.appVersion;
		    }
		    return '';
		};

		exports.networkInterfaces
		= exports.getNetworkInterfaces
		= function () { return {} };

		exports.arch = function () { return 'javascript' };

		exports.platform = function () { return 'browser' };

		exports.tmpdir = exports.tmpDir = function () {
		    return '/tmp';
		};

		exports.EOL = '\n';


	/***/ },
	/* 265 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		// Note: adler32 takes 12% for level 0 and 2% for level 6.
		// It doesn't worth to make additional optimizationa as in original.
		// Small size is preferable.

		function adler32(adler, buf, len, pos) {
		  var s1 = (adler & 0xffff) |0,
		      s2 = ((adler >>> 16) & 0xffff) |0,
		      n = 0;

		  while (len !== 0) {
		    // Set limit ~ twice less than 5552, to keep
		    // s2 in 31-bits, because we force signed ints.
		    // in other case %= will fail.
		    n = len > 2000 ? 2000 : len;
		    len -= n;

		    do {
		      s1 = (s1 + buf[pos++]) |0;
		      s2 = (s2 + s1) |0;
		    } while (--n);

		    s1 %= 65521;
		    s2 %= 65521;
		  }

		  return (s1 | (s2 << 16)) |0;
		}


		module.exports = adler32;


	/***/ },
	/* 266 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		// Note: we can't get significant speed boost here.
		// So write code to minimize size - no pregenerated tables
		// and array tools dependencies.


		// Use ordinary array, since untyped makes no boost here
		function makeTable() {
		  var c, table = [];

		  for (var n = 0; n < 256; n++) {
		    c = n;
		    for (var k = 0; k < 8; k++) {
		      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
		    }
		    table[n] = c;
		  }

		  return table;
		}

		// Create table on load. Just 255 signed longs. Not a problem.
		var crcTable = makeTable();


		function crc32(crc, buf, len, pos) {
		  var t = crcTable,
		      end = pos + len;

		  crc ^= -1;

		  for (var i = pos; i < end; i++) {
		    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
		  }

		  return (crc ^ (-1)); // >>> 0;
		}


		module.exports = crc32;


	/***/ },
	/* 267 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var createHmac = __webpack_require__(166)
		var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs

		exports.pbkdf2 = pbkdf2
		function pbkdf2 (password, salt, iterations, keylen, digest, callback) {
		  if (typeof digest === 'function') {
		    callback = digest
		    digest = undefined
		  }

		  if (typeof callback !== 'function') {
		    throw new Error('No callback provided to pbkdf2')
		  }

		  var result = pbkdf2Sync(password, salt, iterations, keylen, digest)
		  setTimeout(function () {
		    callback(undefined, result)
		  })
		}

		exports.pbkdf2Sync = pbkdf2Sync
		function pbkdf2Sync (password, salt, iterations, keylen, digest) {
		  if (typeof iterations !== 'number') {
		    throw new TypeError('Iterations not a number')
		  }

		  if (iterations < 0) {
		    throw new TypeError('Bad iterations')
		  }

		  if (typeof keylen !== 'number') {
		    throw new TypeError('Key length not a number')
		  }

		  if (keylen < 0 || keylen > MAX_ALLOC) {
		    throw new TypeError('Bad key length')
		  }

		  digest = digest || 'sha1'

		  if (!Buffer.isBuffer(password)) password = new Buffer(password, 'binary')
		  if (!Buffer.isBuffer(salt)) salt = new Buffer(salt, 'binary')

		  var hLen
		  var l = 1
		  var DK = new Buffer(keylen)
		  var block1 = new Buffer(salt.length + 4)
		  salt.copy(block1, 0, 0, salt.length)

		  var r
		  var T

		  for (var i = 1; i <= l; i++) {
		    block1.writeUInt32BE(i, salt.length)
		    var U = 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
		    }

		    U.copy(T, 0, 0, hLen)

		    for (var j = 1; j < iterations; j++) {
		      U = 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
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 268 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = {
		    encode: __webpack_require__(719)
		  , decode: __webpack_require__(718)
		  , encodingLength: __webpack_require__(720)
		}


	/***/ },
	/* 269 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(791);
		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__(78);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(78);

		  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__(14).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__(3)))

	/***/ },
	/* 270 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(78);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 271 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(78);

		  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__(78);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 272 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var createHash = __webpack_require__(72);
		module.exports = function (seed, len) {
		  var t = new Buffer('');
		  var  i = 0, c;
		  while (t.length < len) {
		    c = i2ops(i++);
		    t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()]);
		  }
		  return t.slice(0, len);
		};

		function i2ops(c) {
		  var out = new Buffer(4);
		  out.writeUInt32BE(c,0);
		  return out;
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 273 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var bn = __webpack_require__(19);
		function withPublic(paddedMsg, key) {
		  return new Buffer(paddedMsg
		    .toRed(bn.mont(key.modulus))
		    .redPow(new bn(key.publicExponent))
		    .fromRed()
		    .toArray());
		}

		module.exports = withPublic;
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 274 */
	/***/ function(module, exports) {

		module.exports = function xor(a, b) {
		  var len = a.length;
		  var i = -1;
		  while (++i < len) {
		    a[i] ^= b[i];
		  }
		  return a
		};

	/***/ },
	/* 275 */
	/***/ 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__(733);
		/*</replacement>*/


		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7).EventEmitter;

		/*<replacement>*/
		if (!EE.listenerCount) EE.listenerCount = function(emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		var Stream = __webpack_require__(5);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var StringDecoder;


		/*<replacement>*/
		var debug = __webpack_require__(792);
		if (debug && debug.debuglog) {
		  debug = debug.debuglog('stream');
		} else {
		  debug = function () {};
		}
		/*</replacement>*/


		util.inherits(Readable, Stream);

		function ReadableState(options, stream) {
		  var Duplex = __webpack_require__(79);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		function Readable(options) {
		  var Duplex = __webpack_require__(79);

		  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__(14).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__(3)))

	/***/ },
	/* 276 */
	/***/ 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__(79);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}


	/***/ },
	/* 277 */
	/***/ 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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;


		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		var Stream = __webpack_require__(5);

		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__(79);

		  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__(79);

		  // 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__(3)))

	/***/ },
	/* 278 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {module.exports = function (tasks, cb) {
		  var results, pending, keys
		  var isSync = true

		  if (Array.isArray(tasks)) {
		    results = []
		    pending = tasks.length
		  } else {
		    keys = Object.keys(tasks)
		    results = {}
		    pending = keys.length
		  }

		  function done (err) {
		    function end () {
		      if (cb) cb(err, results)
		      cb = null
		    }
		    if (isSync) process.nextTick(end)
		    else end()
		  }

		  function each (i, err, result) {
		    results[i] = result
		    if (--pending === 0 || err) {
		      done(err)
		    }
		  }

		  if (!pending) {
		    // empty
		    done(null)
		  } else if (keys) {
		    // object
		    keys.forEach(function (key) {
		      tasks[key](function (err, result) { each(key, err, result) })
		    })
		  } else {
		    // array
		    tasks.forEach(function (task, i) {
		      task(function (err, result) { each(i, err, result) })
		    })
		  }

		  isSync = false
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 279 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/**
		 * 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__(2)
		var Hash = __webpack_require__(80)

		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, 64, 56)
		}

		inherits(Sha256, Hash)

		Sha256.prototype.init = function () {
		  this._a = 0x6a09e667
		  this._b = 0xbb67ae85
		  this._c = 0x3c6ef372
		  this._d = 0xa54ff53a
		  this._e = 0x510e527f
		  this._f = 0x9b05688c
		  this._g = 0x1f83d9ab
		  this._h = 0x5be0cd19

		  return this
		}

		function ch (x, y, z) {
		  return z ^ (x & (y ^ z))
		}

		function maj (x, y, z) {
		  return (x & y) | (z & (x | y))
		}

		function sigma0 (x) {
		  return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10)
		}

		function sigma1 (x) {
		  return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7)
		}

		function gamma0 (x) {
		  return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3)
		}

		function gamma1 (x) {
		  return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10)
		}

		Sha256.prototype._update = function (M) {
		  var W = this._w

		  var a = this._a | 0
		  var b = this._b | 0
		  var c = this._c | 0
		  var d = this._d | 0
		  var e = this._e | 0
		  var f = this._f | 0
		  var g = this._g | 0
		  var h = this._h | 0

		  for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)
		  for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0

		  for (var j = 0; j < 64; ++j) {
		    var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W[j]) | 0
		    var T2 = (sigma0(a) + maj(a, b, c)) | 0

		    h = g
		    g = f
		    f = e
		    e = (d + T1) | 0
		    d = c
		    c = b
		    b = a
		    a = (T1 + T2) | 0
		  }

		  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
		}

		module.exports = Sha256

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 280 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var inherits = __webpack_require__(2)
		var Hash = __webpack_require__(80)

		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._ah = 0x6a09e667
		  this._bh = 0xbb67ae85
		  this._ch = 0x3c6ef372
		  this._dh = 0xa54ff53a
		  this._eh = 0x510e527f
		  this._fh = 0x9b05688c
		  this._gh = 0x1f83d9ab
		  this._hh = 0x5be0cd19

		  this._al = 0xf3bcc908
		  this._bl = 0x84caa73b
		  this._cl = 0xfe94f82b
		  this._dl = 0x5f1d36f1
		  this._el = 0xade682d1
		  this._fl = 0x2b3e6c1f
		  this._gl = 0xfb41bd6b
		  this._hl = 0x137e2179

		  return this
		}

		function Ch (x, y, z) {
		  return z ^ (x & (y ^ z))
		}

		function maj (x, y, z) {
		  return (x & y) | (z & (x | y))
		}

		function sigma0 (x, xl) {
		  return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25)
		}

		function sigma1 (x, xl) {
		  return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23)
		}

		function Gamma0 (x, xl) {
		  return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7)
		}

		function Gamma0l (x, xl) {
		  return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25)
		}

		function Gamma1 (x, xl) {
		  return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6)
		}

		function Gamma1l (x, xl) {
		  return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26)
		}

		function getCarry (a, b) {
		  return (a >>> 0) < (b >>> 0) ? 1 : 0
		}

		Sha512.prototype._update = function (M) {
		  var W = this._w

		  var ah = this._ah | 0
		  var bh = this._bh | 0
		  var ch = this._ch | 0
		  var dh = this._dh | 0
		  var eh = this._eh | 0
		  var fh = this._fh | 0
		  var gh = this._gh | 0
		  var hh = this._hh | 0

		  var al = this._al | 0
		  var bl = this._bl | 0
		  var cl = this._cl | 0
		  var dl = this._dl | 0
		  var el = this._el | 0
		  var fl = this._fl | 0
		  var gl = this._gl | 0
		  var hl = this._hl | 0

		  for (var i = 0; i < 32; i += 2) {
		    W[i] = M.readInt32BE(i * 4)
		    W[i + 1] = M.readInt32BE(i * 4 + 4)
		  }
		  for (; i < 160; i += 2) {
		    var xh = W[i - 15 * 2]
		    var xl = W[i - 15 * 2 + 1]
		    var gamma0 = Gamma0(xh, xl)
		    var gamma0l = Gamma0l(xl, xh)

		    xh = W[i - 2 * 2]
		    xl = W[i - 2 * 2 + 1]
		    var gamma1 = Gamma1(xh, xl)
		    var gamma1l = Gamma1l(xl, xh)

		    // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]
		    var Wi7h = W[i - 7 * 2]
		    var Wi7l = W[i - 7 * 2 + 1]

		    var Wi16h = W[i - 16 * 2]
		    var Wi16l = W[i - 16 * 2 + 1]

		    var Wil = (gamma0l + Wi7l) | 0
		    var Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0
		    Wil = (Wil + gamma1l) | 0
		    Wih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0
		    Wil = (Wil + Wi16l) | 0
		    Wih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0

		    W[i] = Wih
		    W[i + 1] = Wil
		  }

		  for (var j = 0; j < 160; j += 2) {
		    Wih = W[j]
		    Wil = W[j + 1]

		    var majh = maj(ah, bh, ch)
		    var majl = maj(al, bl, cl)

		    var sigma0h = sigma0(ah, al)
		    var sigma0l = sigma0(al, ah)
		    var sigma1h = sigma1(eh, el)
		    var sigma1l = sigma1(el, eh)

		    // t1 = h + sigma1 + ch + K[j] + W[j]
		    var Kih = K[j]
		    var Kil = K[j + 1]

		    var chh = Ch(eh, fh, gh)
		    var chl = Ch(el, fl, gl)

		    var t1l = (hl + sigma1l) | 0
		    var t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0
		    t1l = (t1l + chl) | 0
		    t1h = (t1h + chh + getCarry(t1l, chl)) | 0
		    t1l = (t1l + Kil) | 0
		    t1h = (t1h + Kih + getCarry(t1l, Kil)) | 0
		    t1l = (t1l + Wil) | 0
		    t1h = (t1h + Wih + getCarry(t1l, Wil)) | 0

		    // t2 = sigma0 + maj
		    var t2l = (sigma0l + majl) | 0
		    var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0

		    hh = gh
		    hl = gl
		    gh = fh
		    gl = fl
		    fh = eh
		    fl = el
		    el = (dl + t1l) | 0
		    eh = (dh + t1h + getCarry(el, dl)) | 0
		    dh = ch
		    dl = cl
		    ch = bh
		    cl = bl
		    bh = ah
		    bl = al
		    al = (t1l + t2l) | 0
		    ah = (t1h + t2h + getCarry(al, t1l)) | 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._ah = (this._ah + ah + getCarry(this._al, al)) | 0
		  this._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0
		  this._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0
		  this._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0
		  this._eh = (this._eh + eh + getCarry(this._el, el)) | 0
		  this._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0
		  this._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0
		  this._hh = (this._hh + hh + getCarry(this._hl, hl)) | 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._ah, this._al, 0)
		  writeInt64BE(this._bh, this._bl, 8)
		  writeInt64BE(this._ch, this._cl, 16)
		  writeInt64BE(this._dh, this._dl, 24)
		  writeInt64BE(this._eh, this._el, 32)
		  writeInt64BE(this._fh, this._fl, 40)
		  writeInt64BE(this._gh, this._gl, 48)
		  writeInt64BE(this._hh, this._hl, 56)

		  return H
		}

		module.exports = Sha512

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 281 */
	/***/ function(module, exports, __webpack_require__) {

		var varint = __webpack_require__(745)
		exports.encode = function encode (v, b, o) {
		  v = v >= 0 ? v*2 : v*-2 - 1
		  var r = varint.encode(v, b, o)
		  encode.bytes = varint.encode.bytes
		  return r
		}
		exports.decode = function decode (b, o) {
		  var v = varint.decode(b, o)
		  decode.bytes = varint.decode.bytes
		  return v & 1 ? (v+1) / -2 : v / 2
		}

		exports.encodingLength = function (v) {
		  return varint.encodingLength(v >= 0 ? v*2 : v*-2 - 1)
		}


	/***/ },
	/* 282 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var transport = __webpack_require__(24);
		var base = transport.protocol.base;

		exports.FRAME_HEADER_SIZE = 8;

		exports.PING_OPAQUE_SIZE = 4;

		exports.MAX_CONCURRENT_STREAMS = Infinity;
		exports.DEFAULT_MAX_HEADER_LIST_SIZE = Infinity;

		exports.DEFAULT_WEIGHT = 16;

		exports.frameType = {
		  SYN_STREAM: 1,
		  SYN_REPLY: 2,
		  RST_STREAM: 3,
		  SETTINGS: 4,
		  PING: 6,
		  GOAWAY: 7,
		  HEADERS: 8,
		  WINDOW_UPDATE: 9,

		  // Custom
		  X_FORWARDED_FOR: 0xf000
		};

		exports.flags = {
		  FLAG_FIN: 0x01,
		  FLAG_COMPRESSED: 0x02,
		  FLAG_UNIDIRECTIONAL: 0x02
		};

		exports.error = {
		  PROTOCOL_ERROR: 1,
		  INVALID_STREAM: 2,
		  REFUSED_STREAM: 3,
		  UNSUPPORTED_VERSION: 4,
		  CANCEL: 5,
		  INTERNAL_ERROR: 6,
		  FLOW_CONTROL_ERROR: 7,
		  STREAM_IN_USE: 8,
		  // STREAM_ALREADY_CLOSED: 9
		  STREAM_CLOSED: 9,
		  INVALID_CREDENTIALS: 10,
		  FRAME_TOO_LARGE: 11
		};
		exports.errorByCode = base.utils.reverse(exports.error);

		exports.settings = {
		  FLAG_SETTINGS_PERSIST_VALUE: 1,
		  FLAG_SETTINGS_PERSISTED: 2,

		  SETTINGS_UPLOAD_BANDWIDTH: 1,
		  SETTINGS_DOWNLOAD_BANDWIDTH: 2,
		  SETTINGS_ROUND_TRIP_TIME: 3,
		  SETTINGS_MAX_CONCURRENT_STREAMS: 4,
		  SETTINGS_CURRENT_CWND: 5,
		  SETTINGS_DOWNLOAD_RETRANS_RATE: 6,
		  SETTINGS_INITIAL_WINDOW_SIZE: 7,
		  SETTINGS_CLIENT_CERTIFICATE_VECTOR_SIZE: 8
		};

		exports.settingsIndex = [
		  null,

		  'upload_bandwidth',
		  'download_bandwidth',
		  'round_trip_time',
		  'max_concurrent_streams',
		  'current_cwnd',
		  'download_retrans_rate',
		  'initial_window_size',
		  'client_certificate_vector_size'
		];

		exports.DEFAULT_WINDOW = 64 * 1024;
		exports.MAX_INITIAL_WINDOW_SIZE = 2147483647;

		exports.goaway = {
		  OK: 0,
		  PROTOCOL_ERROR: 1,
		  INTERNAL_ERROR: 2
		};
		exports.goawayByCode = base.utils.reverse(exports.goaway);

		exports.statusReason = {
		  100 : 'Continue',
		  101 : 'Switching Protocols',
		  102 : 'Processing',                 // RFC 2518, obsoleted by RFC 4918
		  200 : 'OK',
		  201 : 'Created',
		  202 : 'Accepted',
		  203 : 'Non-Authoritative Information',
		  204 : 'No Content',
		  205 : 'Reset Content',
		  206 : 'Partial Content',
		  207 : 'Multi-Status',               // RFC 4918
		  300 : 'Multiple Choices',
		  301 : 'Moved Permanently',
		  302 : 'Moved Temporarily',
		  303 : 'See Other',
		  304 : 'Not Modified',
		  305 : 'Use Proxy',
		  307 : 'Temporary Redirect',
		  308 : 'Permanent Redirect',         // RFC 7238
		  400 : 'Bad Request',
		  401 : 'Unauthorized',
		  402 : 'Payment Required',
		  403 : 'Forbidden',
		  404 : 'Not Found',
		  405 : 'Method Not Allowed',
		  406 : 'Not Acceptable',
		  407 : 'Proxy Authentication Required',
		  408 : 'Request Time-out',
		  409 : 'Conflict',
		  410 : 'Gone',
		  411 : 'Length Required',
		  412 : 'Precondition Failed',
		  413 : 'Request Entity Too Large',
		  414 : 'Request-URI Too Large',
		  415 : 'Unsupported Media Type',
		  416 : 'Requested Range Not Satisfiable',
		  417 : 'Expectation Failed',
		  418 : 'I\'m a teapot',              // RFC 2324
		  422 : 'Unprocessable Entity',       // RFC 4918
		  423 : 'Locked',                     // RFC 4918
		  424 : 'Failed Dependency',          // RFC 4918
		  425 : 'Unordered Collection',       // RFC 4918
		  426 : 'Upgrade Required',           // RFC 2817
		  428 : 'Precondition Required',      // RFC 6585
		  429 : 'Too Many Requests',          // RFC 6585
		  431 : 'Request Header Fields Too Large',// RFC 6585
		  500 : 'Internal Server Error',
		  501 : 'Not Implemented',
		  502 : 'Bad Gateway',
		  503 : 'Service Unavailable',
		  504 : 'Gateway Time-out',
		  505 : 'HTTP Version Not Supported',
		  506 : 'Variant Also Negotiates',    // RFC 2295
		  507 : 'Insufficient Storage',       // RFC 4918
		  509 : 'Bandwidth Limit Exceeded',
		  510 : 'Not Extended',               // RFC 2774
		  511 : 'Network Authentication Required' // RFC 6585
		};


	/***/ },
	/* 283 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.name = 'spdy';

		exports.dictionary = __webpack_require__(760);
		exports.constants = __webpack_require__(282);
		exports.parser = __webpack_require__(762);
		exports.framer = __webpack_require__(761);
		exports.compressionPool = __webpack_require__(763);


	/***/ },
	/* 284 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(793);
		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__(81);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(81);

		  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__(14).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__(3)))

	/***/ },
	/* 285 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(81);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 286 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(81);

		  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__(81);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 287 */
	/***/ function(module, exports, __webpack_require__) {

		//! stable.js 0.1.5, https://github.com/Two-Screen/stable
		//! © 2014 Angry Bytes and contributors. MIT licensed.

		(function() {

		// A stable array sort, because `Array#sort()` is not guaranteed stable.
		// This is an implementation of merge sort, without recursion.

		var stable = function(arr, comp) {
		    return exec(arr.slice(), comp);
		};

		stable.inplace = function(arr, comp) {
		    var result = exec(arr, comp);

		    // This simply copies back if the result isn't in the original array,
		    // which happens on an odd number of passes.
		    if (result !== arr) {
		        pass(result, null, arr.length, arr);
		    }

		    return arr;
		};

		// Execute the sort using the input array and a second buffer as work space.
		// Returns one of those two, containing the final result.
		function exec(arr, comp) {
		    if (typeof(comp) !== 'function') {
		        comp = function(a, b) {
		            return String(a).localeCompare(b);
		        };
		    }

		    // Short-circuit when there's nothing to sort.
		    var len = arr.length;
		    if (len <= 1) {
		        return arr;
		    }

		    // Rather than dividing input, simply iterate chunks of 1, 2, 4, 8, etc.
		    // Chunks are the size of the left or right hand in merge sort.
		    // Stop when the left-hand covers all of the array.
		    var buffer = new Array(len);
		    for (var chk = 1; chk < len; chk *= 2) {
		        pass(arr, comp, chk, buffer);

		        var tmp = arr;
		        arr = buffer;
		        buffer = tmp;
		    }

		    return arr;
		}

		// Run a single pass with the given chunk size.
		var pass = function(arr, comp, chk, result) {
		    var len = arr.length;
		    var i = 0;
		    // Step size / double chunk size.
		    var dbl = chk * 2;
		    // Bounds of the left and right chunks.
		    var l, r, e;
		    // Iterators over the left and right chunk.
		    var li, ri;

		    // Iterate over pairs of chunks.
		    for (l = 0; l < len; l += dbl) {
		        r = l + chk;
		        e = r + chk;
		        if (r > len) r = len;
		        if (e > len) e = len;

		        // Iterate both chunks in parallel.
		        li = l;
		        ri = r;
		        while (true) {
		            // Compare the chunks.
		            if (li < r && ri < e) {
		                // This works for a regular `sort()` compatible comparator,
		                // but also for a simple comparator like: `a > b`
		                if (comp(arr[li], arr[ri]) <= 0) {
		                    result[i++] = arr[li++];
		                }
		                else {
		                    result[i++] = arr[ri++];
		                }
		            }
		            // Nothing to compare, just flush what's left.
		            else if (li < r) {
		                result[i++] = arr[li++];
		            }
		            else if (ri < e) {
		                result[i++] = arr[ri++];
		            }
		            // Both iterators are at the chunk ends.
		            else {
		                break;
		            }
		        }
		    }
		};

		// Export using CommonJS or to the window.
		if (true) {
		    module.exports = stable;
		}
		else {
		    window.stable = stable;
		}

		})();


	/***/ },
	/* 288 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(179);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 289 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(794);
		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__(63);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(63);

		  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__(14).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__(3)))

	/***/ },
	/* 290 */
	/***/ function(module, exports) {

		// Returns a wrapper function that returns a wrapped callback
		// The wrapper function should do some stuff, and return a
		// presumably different callback function.
		// This makes sure that own properties are retained, so that
		// decorations and such are not lost along the way.
		module.exports = wrappy
		function wrappy (fn, cb) {
		  if (fn && cb) return wrappy(fn)(cb)

		  if (typeof fn !== 'function')
		    throw new TypeError('need wrapper function')

		  Object.keys(fn).forEach(function (k) {
		    wrapper[k] = fn[k]
		  })

		  return wrapper

		  function wrapper() {
		    var args = new Array(arguments.length)
		    for (var i = 0; i < args.length; i++) {
		      args[i] = arguments[i]
		    }
		    var ret = fn.apply(this, args)
		    var cb = args[args.length-1]
		    if (typeof ret === 'function' && ret !== cb) {
		      Object.keys(cb).forEach(function (k) {
		        ret[k] = cb[k]
		      })
		    }
		    return ret
		  }
		}


	/***/ },
	/* 291 */
	/***/ function(module, exports) {

		module.exports = extend

		var hasOwnProperty = Object.prototype.hasOwnProperty;

		function extend() {
		    var target = {}

		    for (var i = 0; i < arguments.length; i++) {
		        var source = arguments[i]

		        for (var key in source) {
		            if (hasOwnProperty.call(source, key)) {
		                target[key] = source[key]
		            }
		        }
		    }

		    return target
		}


	/***/ },
	/* 292 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 293 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var IPFS = __webpack_require__(338);

		exports = module.exports = IPFS;

	/***/ },
	/* 294 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(global) {/*istanbul ignore next*/"use strict";

		/*istanbul ignore next*/__webpack_require__(587);

		/*istanbul ignore next*/__webpack_require__(354);

		/*istanbul ignore next*/__webpack_require__(379);

		/* eslint max-len: 0 */

		if (global._babelPolyfill) {
		  throw new Error("only one instance of babel-polyfill is allowed");
		}
		global._babelPolyfill = true;

		// Should be removed in the next major release:

		var DEFINE_PROPERTY = "defineProperty";
		function define(O, key, value) {
		  O[key] || Object[DEFINE_PROPERTY](O, key, {
		    writable: true,
		    configurable: true,
		    value: value
		  });
		}

		define(String.prototype, "padLeft", "".padStart);
		define(String.prototype, "padRight", "".padEnd);

		"pop,reverse,shift,keys,values,entries,indexOf,every,some,forEach,map,filter,find,findIndex,includes,join,slice,concat,push,splice,unshift,sort,lastIndexOf,reduce,reduceRight,copyWithin,fill".split(",").forEach(function (key) {
		  [][key] && define(Array, key, Function.call.bind([][key]));
		});
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 295 */
	/***/ function(module, exports) {

		module.exports = {
			"modp1": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff"
			},
			"modp2": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff"
			},
			"modp5": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff"
			},
			"modp14": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff"
			},
			"modp15": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff"
			},
			"modp16": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff"
			},
			"modp17": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff"
			},
			"modp18": {
				"gen": "02",
				"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff"
			}
		};

	/***/ },
	/* 296 */
	/***/ function(module, exports) {

		module.exports = {
			"_args": [
				[
					"elliptic@^6.0.0",
					"/Users/ground-control/code/protocol-labs/_ipfs/js/js-ipfs/node_modules/browserify-sign"
				]
			],
			"_from": "elliptic@>=6.0.0 <7.0.0",
			"_id": "elliptic@6.2.3",
			"_inCache": true,
			"_installable": true,
			"_location": "/elliptic",
			"_nodeVersion": "5.4.1",
			"_npmUser": {
				"email": "fedor@indutny.com",
				"name": "indutny"
			},
			"_npmVersion": "3.3.12",
			"_phantomChildren": {},
			"_requested": {
				"name": "elliptic",
				"raw": "elliptic@^6.0.0",
				"rawSpec": "^6.0.0",
				"scope": null,
				"spec": ">=6.0.0 <7.0.0",
				"type": "range"
			},
			"_requiredBy": [
				"/browserify-sign",
				"/create-ecdh"
			],
			"_resolved": "https://registry.npmjs.org/elliptic/-/elliptic-6.2.3.tgz",
			"_shasum": "18e46d7306b0951275a2d42063270a14b74ebe99",
			"_shrinkwrap": null,
			"_spec": "elliptic@^6.0.0",
			"_where": "/Users/ground-control/code/protocol-labs/_ipfs/js/js-ipfs/node_modules/browserify-sign",
			"author": {
				"email": "fedor@indutny.com",
				"name": "Fedor Indutny"
			},
			"bugs": {
				"url": "https://github.com/indutny/elliptic/issues"
			},
			"dependencies": {
				"bn.js": "^4.0.0",
				"brorand": "^1.0.1",
				"hash.js": "^1.0.0",
				"inherits": "^2.0.1"
			},
			"description": "EC cryptography",
			"devDependencies": {
				"coveralls": "^2.11.3",
				"istanbul": "^0.4.2",
				"jscs": "^2.9.0",
				"jshint": "^2.6.0",
				"mocha": "^2.1.0"
			},
			"directories": {},
			"dist": {
				"shasum": "18e46d7306b0951275a2d42063270a14b74ebe99",
				"tarball": "https://registry.npmjs.org/elliptic/-/elliptic-6.2.3.tgz"
			},
			"files": [
				"lib"
			],
			"gitHead": "c32f20b22b420eb6af3c6dda28963deb7facf823",
			"homepage": "https://github.com/indutny/elliptic",
			"keywords": [
				"EC",
				"Elliptic",
				"curve",
				"Cryptography"
			],
			"license": "MIT",
			"main": "lib/elliptic.js",
			"maintainers": [
				{
					"email": "fedor@indutny.com",
					"name": "indutny"
				}
			],
			"name": "elliptic",
			"optionalDependencies": {},
			"readme": "ERROR: No README data found!",
			"repository": {
				"type": "git",
				"url": "git+ssh://git@github.com/indutny/elliptic.git"
			},
			"scripts": {
				"coverage": "npm run unit --coverage",
				"coveralls": "npm run coverage && cat ./coverage/lcov.info | coveralls",
				"jscs": "jscs benchmarks/*.js lib/*.js lib/**/*.js lib/**/**/*.js test/*.js",
				"jshint": "jscs benchmarks/*.js lib/*.js lib/**/*.js lib/**/**/*.js test/*.js",
				"lint": "npm run jscs && npm run jshint",
				"test": "npm run lint && npm run unit",
				"unit": "istanbul test _mocha --reporter=spec test/*-test.js"
			},
			"version": "6.2.3"
		};

	/***/ },
	/* 297 */
	/***/ function(module, exports) {

		module.exports = {
			"2.16.840.1.101.3.4.1.1": "aes-128-ecb",
			"2.16.840.1.101.3.4.1.2": "aes-128-cbc",
			"2.16.840.1.101.3.4.1.3": "aes-128-ofb",
			"2.16.840.1.101.3.4.1.4": "aes-128-cfb",
			"2.16.840.1.101.3.4.1.21": "aes-192-ecb",
			"2.16.840.1.101.3.4.1.22": "aes-192-cbc",
			"2.16.840.1.101.3.4.1.23": "aes-192-ofb",
			"2.16.840.1.101.3.4.1.24": "aes-192-cfb",
			"2.16.840.1.101.3.4.1.41": "aes-256-ecb",
			"2.16.840.1.101.3.4.1.42": "aes-256-cbc",
			"2.16.840.1.101.3.4.1.43": "aes-256-ofb",
			"2.16.840.1.101.3.4.1.44": "aes-256-cfb"
		};

	/***/ },
	/* 298 */
	/***/ function(module, exports, __webpack_require__) {

		var asn1 = __webpack_require__(94);
		var inherits = __webpack_require__(2);

		var api = exports;

		api.define = function define(name, body) {
		  return new Entity(name, body);
		};

		function Entity(name, body) {
		  this.name = name;
		  this.body = body;

		  this.decoders = {};
		  this.encoders = {};
		};

		Entity.prototype._createNamed = function createNamed(base) {
		  var named;
		  try {
		    named = __webpack_require__(783).runInThisContext(
		      '(function ' + this.name + '(entity) {\n' +
		      '  this._initNamed(entity);\n' +
		      '})'
		    );
		  } catch (e) {
		    named = function (entity) {
		      this._initNamed(entity);
		    };
		  }
		  inherits(named, base);
		  named.prototype._initNamed = function initnamed(entity) {
		    base.call(this, entity);
		  };

		  return new named(this);
		};

		Entity.prototype._getDecoder = function _getDecoder(enc) {
		  enc = enc || 'der';
		  // Lazily create decoder
		  if (!this.decoders.hasOwnProperty(enc))
		    this.decoders[enc] = this._createNamed(asn1.decoders[enc]);
		  return this.decoders[enc];
		};

		Entity.prototype.decode = function decode(data, enc, options) {
		  return this._getDecoder(enc).decode(data, options);
		};

		Entity.prototype._getEncoder = function _getEncoder(enc) {
		  enc = enc || 'der';
		  // Lazily create encoder
		  if (!this.encoders.hasOwnProperty(enc))
		    this.encoders[enc] = this._createNamed(asn1.encoders[enc]);
		  return this.encoders[enc];
		};

		Entity.prototype.encode = function encode(data, enc, /* internal */ reporter) {
		  return this._getEncoder(enc).encode(data, reporter);
		};


	/***/ },
	/* 299 */
	/***/ function(module, exports, __webpack_require__) {

		var Reporter = __webpack_require__(82).Reporter;
		var EncoderBuffer = __webpack_require__(82).EncoderBuffer;
		var DecoderBuffer = __webpack_require__(82).DecoderBuffer;
		var assert = __webpack_require__(77);

		// Supported tags
		var tags = [
		  'seq', 'seqof', 'set', 'setof', 'objid', 'bool',
		  'gentime', 'utctime', 'null_', 'enum', 'int',
		  'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',
		  'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'
		];

		// Public methods list
		var methods = [
		  'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',
		  'any', 'contains'
		].concat(tags);

		// Overrided methods list
		var overrided = [
		  '_peekTag', '_decodeTag', '_use',
		  '_decodeStr', '_decodeObjid', '_decodeTime',
		  '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',

		  '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',
		  '_encodeNull', '_encodeInt', '_encodeBool'
		];

		function Node(enc, parent) {
		  var state = {};
		  this._baseState = state;

		  state.enc = enc;

		  state.parent = parent || null;
		  state.children = null;

		  // State
		  state.tag = null;
		  state.args = null;
		  state.reverseArgs = null;
		  state.choice = null;
		  state.optional = false;
		  state.any = false;
		  state.obj = false;
		  state.use = null;
		  state.useDecoder = null;
		  state.key = null;
		  state['default'] = null;
		  state.explicit = null;
		  state.implicit = null;
		  state.contains = null;

		  // Should create new instance on each method
		  if (!state.parent) {
		    state.children = [];
		    this._wrap();
		  }
		}
		module.exports = Node;

		var stateProps = [
		  'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',
		  'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',
		  'implicit'
		];

		Node.prototype.clone = function clone() {
		  var state = this._baseState;
		  var cstate = {};
		  stateProps.forEach(function(prop) {
		    cstate[prop] = state[prop];
		  });
		  var res = new this.constructor(cstate.parent);
		  res._baseState = cstate;
		  return res;
		};

		Node.prototype._wrap = function wrap() {
		  var state = this._baseState;
		  methods.forEach(function(method) {
		    this[method] = function _wrappedMethod() {
		      var clone = new this.constructor(this);
		      state.children.push(clone);
		      return clone[method].apply(clone, arguments);
		    };
		  }, this);
		};

		Node.prototype._init = function init(body) {
		  var state = this._baseState;

		  assert(state.parent === null);
		  body.call(this);

		  // Filter children
		  state.children = state.children.filter(function(child) {
		    return child._baseState.parent === this;
		  }, this);
		  assert.equal(state.children.length, 1, 'Root node can have only one child');
		};

		Node.prototype._useArgs = function useArgs(args) {
		  var state = this._baseState;

		  // Filter children and args
		  var children = args.filter(function(arg) {
		    return arg instanceof this.constructor;
		  }, this);
		  args = args.filter(function(arg) {
		    return !(arg instanceof this.constructor);
		  }, this);

		  if (children.length !== 0) {
		    assert(state.children === null);
		    state.children = children;

		    // Replace parent to maintain backward link
		    children.forEach(function(child) {
		      child._baseState.parent = this;
		    }, this);
		  }
		  if (args.length !== 0) {
		    assert(state.args === null);
		    state.args = args;
		    state.reverseArgs = args.map(function(arg) {
		      if (typeof arg !== 'object' || arg.constructor !== Object)
		        return arg;

		      var res = {};
		      Object.keys(arg).forEach(function(key) {
		        if (key == (key | 0))
		          key |= 0;
		        var value = arg[key];
		        res[value] = key;
		      });
		      return res;
		    });
		  }
		};

		//
		// Overrided methods
		//

		overrided.forEach(function(method) {
		  Node.prototype[method] = function _overrided() {
		    var state = this._baseState;
		    throw new Error(method + ' not implemented for encoding: ' + state.enc);
		  };
		});

		//
		// Public methods
		//

		tags.forEach(function(tag) {
		  Node.prototype[tag] = function _tagMethod() {
		    var state = this._baseState;
		    var args = Array.prototype.slice.call(arguments);

		    assert(state.tag === null);
		    state.tag = tag;

		    this._useArgs(args);

		    return this;
		  };
		});

		Node.prototype.use = function use(item) {
		  var state = this._baseState;

		  assert(state.use === null);
		  state.use = item;

		  return this;
		};

		Node.prototype.optional = function optional() {
		  var state = this._baseState;

		  state.optional = true;

		  return this;
		};

		Node.prototype.def = function def(val) {
		  var state = this._baseState;

		  assert(state['default'] === null);
		  state['default'] = val;
		  state.optional = true;

		  return this;
		};

		Node.prototype.explicit = function explicit(num) {
		  var state = this._baseState;

		  assert(state.explicit === null && state.implicit === null);
		  state.explicit = num;

		  return this;
		};

		Node.prototype.implicit = function implicit(num) {
		  var state = this._baseState;

		  assert(state.explicit === null && state.implicit === null);
		  state.implicit = num;

		  return this;
		};

		Node.prototype.obj = function obj() {
		  var state = this._baseState;
		  var args = Array.prototype.slice.call(arguments);

		  state.obj = true;

		  if (args.length !== 0)
		    this._useArgs(args);

		  return this;
		};

		Node.prototype.key = function key(newKey) {
		  var state = this._baseState;

		  assert(state.key === null);
		  state.key = newKey;

		  return this;
		};

		Node.prototype.any = function any() {
		  var state = this._baseState;

		  state.any = true;

		  return this;
		};

		Node.prototype.choice = function choice(obj) {
		  var state = this._baseState;

		  assert(state.choice === null);
		  state.choice = obj;
		  this._useArgs(Object.keys(obj).map(function(key) {
		    return obj[key];
		  }));

		  return this;
		};

		Node.prototype.contains = function contains(item) {
		  var state = this._baseState;

		  assert(state.use === null);
		  state.contains = item;

		  return this;
		};

		//
		// Decoding
		//

		Node.prototype._decode = function decode(input) {
		  var state = this._baseState;

		  // Decode root node
		  if (state.parent === null)
		    return input.wrapResult(state.children[0]._decode(input));

		  var result = state['default'];
		  var present = true;

		  var prevKey;
		  if (state.key !== null)
		    prevKey = input.enterKey(state.key);

		  // Check if tag is there
		  if (state.optional) {
		    var tag = null;
		    if (state.explicit !== null)
		      tag = state.explicit;
		    else if (state.implicit !== null)
		      tag = state.implicit;
		    else if (state.tag !== null)
		      tag = state.tag;

		    if (tag === null && !state.any) {
		      // Trial and Error
		      var save = input.save();
		      try {
		        if (state.choice === null)
		          this._decodeGeneric(state.tag, input);
		        else
		          this._decodeChoice(input);
		        present = true;
		      } catch (e) {
		        present = false;
		      }
		      input.restore(save);
		    } else {
		      present = this._peekTag(input, tag, state.any);

		      if (input.isError(present))
		        return present;
		    }
		  }

		  // Push object on stack
		  var prevObj;
		  if (state.obj && present)
		    prevObj = input.enterObject();

		  if (present) {
		    // Unwrap explicit values
		    if (state.explicit !== null) {
		      var explicit = this._decodeTag(input, state.explicit);
		      if (input.isError(explicit))
		        return explicit;
		      input = explicit;
		    }

		    // Unwrap implicit and normal values
		    if (state.use === null && state.choice === null) {
		      if (state.any)
		        var save = input.save();
		      var body = this._decodeTag(
		        input,
		        state.implicit !== null ? state.implicit : state.tag,
		        state.any
		      );
		      if (input.isError(body))
		        return body;

		      if (state.any)
		        result = input.raw(save);
		      else
		        input = body;
		    }

		    // Select proper method for tag
		    if (state.any)
		      result = result;
		    else if (state.choice === null)
		      result = this._decodeGeneric(state.tag, input);
		    else
		      result = this._decodeChoice(input);

		    if (input.isError(result))
		      return result;

		    // Decode children
		    if (!state.any && state.choice === null && state.children !== null) {
		      state.children.forEach(function decodeChildren(child) {
		        // NOTE: We are ignoring errors here, to let parser continue with other
		        // parts of encoded data
		        child._decode(input);
		      });
		    }

		    // Decode contained/encoded by schema, only in bit or octet strings
		    if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {
		      var data = new DecoderBuffer(result);
		      result = this._getUse(state.contains, input._reporterState.obj)._decode(data);
		    }
		  }

		  // Pop object
		  if (state.obj && present)
		    result = input.leaveObject(prevObj);

		  // Set key
		  if (state.key !== null && (result !== null || present === true))
		    input.leaveKey(prevKey, state.key, result);

		  return result;
		};

		Node.prototype._decodeGeneric = function decodeGeneric(tag, input) {
		  var state = this._baseState;

		  if (tag === 'seq' || tag === 'set')
		    return null;
		  if (tag === 'seqof' || tag === 'setof')
		    return this._decodeList(input, tag, state.args[0]);
		  else if (/str$/.test(tag))
		    return this._decodeStr(input, tag);
		  else if (tag === 'objid' && state.args)
		    return this._decodeObjid(input, state.args[0], state.args[1]);
		  else if (tag === 'objid')
		    return this._decodeObjid(input, null, null);
		  else if (tag === 'gentime' || tag === 'utctime')
		    return this._decodeTime(input, tag);
		  else if (tag === 'null_')
		    return this._decodeNull(input);
		  else if (tag === 'bool')
		    return this._decodeBool(input);
		  else if (tag === 'int' || tag === 'enum')
		    return this._decodeInt(input, state.args && state.args[0]);
		  else if (state.use !== null)
		    return this._getUse(state.use, input._reporterState.obj)._decode(input);
		  else
		    return input.error('unknown tag: ' + tag);
		};

		Node.prototype._getUse = function _getUse(entity, obj) {

		  var state = this._baseState;
		  // Create altered use decoder if implicit is set
		  state.useDecoder = this._use(entity, obj);
		  assert(state.useDecoder._baseState.parent === null);
		  state.useDecoder = state.useDecoder._baseState.children[0];
		  if (state.implicit !== state.useDecoder._baseState.implicit) {
		    state.useDecoder = state.useDecoder.clone();
		    state.useDecoder._baseState.implicit = state.implicit;
		  }
		  return state.useDecoder;
		};

		Node.prototype._decodeChoice = function decodeChoice(input) {
		  var state = this._baseState;
		  var result = null;
		  var match = false;

		  Object.keys(state.choice).some(function(key) {
		    var save = input.save();
		    var node = state.choice[key];
		    try {
		      var value = node._decode(input);
		      if (input.isError(value))
		        return false;

		      result = { type: key, value: value };
		      match = true;
		    } catch (e) {
		      input.restore(save);
		      return false;
		    }
		    return true;
		  }, this);

		  if (!match)
		    return input.error('Choice not matched');

		  return result;
		};

		//
		// Encoding
		//

		Node.prototype._createEncoderBuffer = function createEncoderBuffer(data) {
		  return new EncoderBuffer(data, this.reporter);
		};

		Node.prototype._encode = function encode(data, reporter, parent) {
		  var state = this._baseState;
		  if (state['default'] !== null && state['default'] === data)
		    return;

		  var result = this._encodeValue(data, reporter, parent);
		  if (result === undefined)
		    return;

		  if (this._skipDefault(result, reporter, parent))
		    return;

		  return result;
		};

		Node.prototype._encodeValue = function encode(data, reporter, parent) {
		  var state = this._baseState;

		  // Decode root node
		  if (state.parent === null)
		    return state.children[0]._encode(data, reporter || new Reporter());

		  var result = null;

		  // Set reporter to share it with a child class
		  this.reporter = reporter;

		  // Check if data is there
		  if (state.optional && data === undefined) {
		    if (state['default'] !== null)
		      data = state['default']
		    else
		      return;
		  }

		  // Encode children first
		  var content = null;
		  var primitive = false;
		  if (state.any) {
		    // Anything that was given is translated to buffer
		    result = this._createEncoderBuffer(data);
		  } else if (state.choice) {
		    result = this._encodeChoice(data, reporter);
		  } else if (state.contains) {
		    content = this._getUse(state.contains, parent)._encode(data, reporter);
		    primitive = true;
		  } else if (state.children) {
		    content = state.children.map(function(child) {
		      if (child._baseState.tag === 'null_')
		        return child._encode(null, reporter, data);

		      if (child._baseState.key === null)
		        return reporter.error('Child should have a key');
		      var prevKey = reporter.enterKey(child._baseState.key);

		      if (typeof data !== 'object')
		        return reporter.error('Child expected, but input is not object');

		      var res = child._encode(data[child._baseState.key], reporter, data);
		      reporter.leaveKey(prevKey);

		      return res;
		    }, this).filter(function(child) {
		      return child;
		    });
		    content = this._createEncoderBuffer(content);
		  } else {
		    if (state.tag === 'seqof' || state.tag === 'setof') {
		      // TODO(indutny): this should be thrown on DSL level
		      if (!(state.args && state.args.length === 1))
		        return reporter.error('Too many args for : ' + state.tag);

		      if (!Array.isArray(data))
		        return reporter.error('seqof/setof, but data is not Array');

		      var child = this.clone();
		      child._baseState.implicit = null;
		      content = this._createEncoderBuffer(data.map(function(item) {
		        var state = this._baseState;

		        return this._getUse(state.args[0], data)._encode(item, reporter);
		      }, child));
		    } else if (state.use !== null) {
		      result = this._getUse(state.use, parent)._encode(data, reporter);
		    } else {
		      content = this._encodePrimitive(state.tag, data);
		      primitive = true;
		    }
		  }

		  // Encode data itself
		  var result;
		  if (!state.any && state.choice === null) {
		    var tag = state.implicit !== null ? state.implicit : state.tag;
		    var cls = state.implicit === null ? 'universal' : 'context';

		    if (tag === null) {
		      if (state.use === null)
		        reporter.error('Tag could be ommited only for .use()');
		    } else {
		      if (state.use === null)
		        result = this._encodeComposite(tag, primitive, cls, content);
		    }
		  }

		  // Wrap in explicit
		  if (state.explicit !== null)
		    result = this._encodeComposite(state.explicit, false, 'context', result);

		  return result;
		};

		Node.prototype._encodeChoice = function encodeChoice(data, reporter) {
		  var state = this._baseState;

		  var node = state.choice[data.type];
		  if (!node) {
		    assert(
		        false,
		        data.type + ' not found in ' +
		            JSON.stringify(Object.keys(state.choice)));
		  }
		  return node._encode(data.value, reporter);
		};

		Node.prototype._encodePrimitive = function encodePrimitive(tag, data) {
		  var state = this._baseState;

		  if (/str$/.test(tag))
		    return this._encodeStr(data, tag);
		  else if (tag === 'objid' && state.args)
		    return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);
		  else if (tag === 'objid')
		    return this._encodeObjid(data, null, null);
		  else if (tag === 'gentime' || tag === 'utctime')
		    return this._encodeTime(data, tag);
		  else if (tag === 'null_')
		    return this._encodeNull();
		  else if (tag === 'int' || tag === 'enum')
		    return this._encodeInt(data, state.args && state.reverseArgs[0]);
		  else if (tag === 'bool')
		    return this._encodeBool(data);
		  else
		    throw new Error('Unsupported tag: ' + tag);
		};

		Node.prototype._isNumstr = function isNumstr(str) {
		  return /^[0-9 ]*$/.test(str);
		};

		Node.prototype._isPrintstr = function isPrintstr(str) {
		  return /^[A-Za-z0-9 '\(\)\+,\-\.\/:=\?]*$/.test(str);
		};


	/***/ },
	/* 300 */
	/***/ function(module, exports, __webpack_require__) {

		var inherits = __webpack_require__(2);

		function Reporter(options) {
		  this._reporterState = {
		    obj: null,
		    path: [],
		    options: options || {},
		    errors: []
		  };
		}
		exports.Reporter = Reporter;

		Reporter.prototype.isError = function isError(obj) {
		  return obj instanceof ReporterError;
		};

		Reporter.prototype.save = function save() {
		  var state = this._reporterState;

		  return { obj: state.obj, pathLen: state.path.length };
		};

		Reporter.prototype.restore = function restore(data) {
		  var state = this._reporterState;

		  state.obj = data.obj;
		  state.path = state.path.slice(0, data.pathLen);
		};

		Reporter.prototype.enterKey = function enterKey(key) {
		  return this._reporterState.path.push(key);
		};

		Reporter.prototype.leaveKey = function leaveKey(index, key, value) {
		  var state = this._reporterState;

		  state.path = state.path.slice(0, index - 1);
		  if (state.obj !== null)
		    state.obj[key] = value;
		};

		Reporter.prototype.enterObject = function enterObject() {
		  var state = this._reporterState;

		  var prev = state.obj;
		  state.obj = {};
		  return prev;
		};

		Reporter.prototype.leaveObject = function leaveObject(prev) {
		  var state = this._reporterState;

		  var now = state.obj;
		  state.obj = prev;
		  return now;
		};

		Reporter.prototype.error = function error(msg) {
		  var err;
		  var state = this._reporterState;

		  var inherited = msg instanceof ReporterError;
		  if (inherited) {
		    err = msg;
		  } else {
		    err = new ReporterError(state.path.map(function(elem) {
		      return '[' + JSON.stringify(elem) + ']';
		    }).join(''), msg.message || msg, msg.stack);
		  }

		  if (!state.options.partial)
		    throw err;

		  if (!inherited)
		    state.errors.push(err);

		  return err;
		};

		Reporter.prototype.wrapResult = function wrapResult(result) {
		  var state = this._reporterState;
		  if (!state.options.partial)
		    return result;

		  return {
		    result: this.isError(result) ? null : result,
		    errors: state.errors
		  };
		};

		function ReporterError(path, msg) {
		  this.path = path;
		  this.rethrow(msg);
		};
		inherits(ReporterError, Error);

		ReporterError.prototype.rethrow = function rethrow(msg) {
		  this.message = msg + ' at: ' + (this.path || '(shallow)');
		  Error.captureStackTrace(this, ReporterError);

		  return this;
		};


	/***/ },
	/* 301 */
	/***/ function(module, exports, __webpack_require__) {

		var constants = __webpack_require__(183);

		exports.tagClass = {
		  0: 'universal',
		  1: 'application',
		  2: 'context',
		  3: 'private'
		};
		exports.tagClassByName = constants._reverse(exports.tagClass);

		exports.tag = {
		  0x00: 'end',
		  0x01: 'bool',
		  0x02: 'int',
		  0x03: 'bitstr',
		  0x04: 'octstr',
		  0x05: 'null_',
		  0x06: 'objid',
		  0x07: 'objDesc',
		  0x08: 'external',
		  0x09: 'real',
		  0x0a: 'enum',
		  0x0b: 'embed',
		  0x0c: 'utf8str',
		  0x0d: 'relativeOid',
		  0x10: 'seq',
		  0x11: 'set',
		  0x12: 'numstr',
		  0x13: 'printstr',
		  0x14: 't61str',
		  0x15: 'videostr',
		  0x16: 'ia5str',
		  0x17: 'utctime',
		  0x18: 'gentime',
		  0x19: 'graphstr',
		  0x1a: 'iso646str',
		  0x1b: 'genstr',
		  0x1c: 'unistr',
		  0x1d: 'charstr',
		  0x1e: 'bmpstr'
		};
		exports.tagByName = constants._reverse(exports.tag);


	/***/ },
	/* 302 */
	/***/ function(module, exports, __webpack_require__) {

		var decoders = exports;

		decoders.der = __webpack_require__(184);
		decoders.pem = __webpack_require__(303);


	/***/ },
	/* 303 */
	/***/ function(module, exports, __webpack_require__) {

		var inherits = __webpack_require__(2);
		var Buffer = __webpack_require__(0).Buffer;

		var DERDecoder = __webpack_require__(184);

		function PEMDecoder(entity) {
		  DERDecoder.call(this, entity);
		  this.enc = 'pem';
		};
		inherits(PEMDecoder, DERDecoder);
		module.exports = PEMDecoder;

		PEMDecoder.prototype.decode = function decode(data, options) {
		  var lines = data.toString().split(/[\r\n]+/g);

		  var label = options.label.toUpperCase();

		  var re = /^-----(BEGIN|END) ([^-]+)-----$/;
		  var start = -1;
		  var end = -1;
		  for (var i = 0; i < lines.length; i++) {
		    var match = lines[i].match(re);
		    if (match === null)
		      continue;

		    if (match[2] !== label)
		      continue;

		    if (start === -1) {
		      if (match[1] !== 'BEGIN')
		        break;
		      start = i;
		    } else {
		      if (match[1] !== 'END')
		        break;
		      end = i;
		      break;
		    }
		  }
		  if (start === -1 || end === -1)
		    throw new Error('PEM section not found for: ' + label);

		  var base64 = lines.slice(start + 1, end).join('');
		  // Remove excessive symbols
		  base64.replace(/[^a-z0-9\+\/=]+/gi, '');

		  var input = new Buffer(base64, 'base64');
		  return DERDecoder.prototype.decode.call(this, input, options);
		};


	/***/ },
	/* 304 */
	/***/ function(module, exports, __webpack_require__) {

		var encoders = exports;

		encoders.der = __webpack_require__(185);
		encoders.pem = __webpack_require__(305);


	/***/ },
	/* 305 */
	/***/ function(module, exports, __webpack_require__) {

		var inherits = __webpack_require__(2);

		var DEREncoder = __webpack_require__(185);

		function PEMEncoder(entity) {
		  DEREncoder.call(this, entity);
		  this.enc = 'pem';
		};
		inherits(PEMEncoder, DEREncoder);
		module.exports = PEMEncoder;

		PEMEncoder.prototype.encode = function encode(data, options) {
		  var buf = DEREncoder.prototype.encode.call(this, data);

		  var p = buf.toString('base64');
		  var out = [ '-----BEGIN ' + options.label + '-----' ];
		  for (var i = 0; i < p.length; i += 64)
		    out.push(p.slice(i, i + 64));
		  out.push('-----END ' + options.label + '-----');
		  return out.join('\n');
		};


	/***/ },
	/* 306 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var debug = __webpack_require__(17);
		var _ = __webpack_require__(251);
		var async = __webpack_require__(95);

		var log = debug('bitswap:engine');
		log.error = debug('bitswap:engine:error');

		var Message = __webpack_require__(96);
		var Wantlist = __webpack_require__(97);
		var PeerRequestQueue = __webpack_require__(309);
		var Ledger = __webpack_require__(308);

		module.exports = function () {
		  function Engine(datastore, network) {
		    _classCallCheck(this, Engine);

		    this.datastore = datastore;
		    this.network = network;

		    // A list of of ledgers by their partner id
		    this.ledgerMap = new Map();

		    // A priority queue of requests received from different
		    // peers.
		    this.peerRequestQueue = new PeerRequestQueue();
		  }

		  _createClass(Engine, [{
		    key: '_sendBlock',
		    value: function _sendBlock(env, cb) {
		      var msg = new Message(false);
		      msg.addBlock(env.block);

		      log('Sending block to %s', env.peer.toB58String(), env.block.data.toString());

		      this.network.sendMessage(env.peer, msg, function (err) {
		        if (err) {
		          log('sendblock error: %s', err.message);
		        }
		        cb(null, 'done');
		      });
		    }
		  }, {
		    key: '_outbox',
		    value: function _outbox() {
		      var _this = this;

		      if (!this._timer) {
		        this._timer = setTimeout(function () {
		          doIt(function () {
		            _this._timer = null;
		          });
		        }, 100);
		      }

		      var doIt = function doIt(cb) {
		        _(function (push, next) {
		          var nextTask = _this.peerRequestQueue.pop();

		          if (!nextTask) return push(null, _.nil);

		          _this.datastore.get(nextTask.entry.key, function (err, block) {
		            if (err || !block) {
		              nextTask.done();
		            } else {
		              push(null, {
		                peer: nextTask.target,
		                block: block,
		                sent: function sent() {
		                  nextTask.done();
		                }
		              });
		            }

		            next();
		          });
		        }).flatMap(function (envelope) {
		          return _.wrapCallback(_this._sendBlock.bind(_this))(envelope);
		        }).done(cb);
		      };
		    }
		  }, {
		    key: 'wantlistForPeer',
		    value: function wantlistForPeer(peerId) {
		      if (!this.ledgerMap.has(peerId.toB58String())) {
		        return new Map();
		      }

		      return this.ledgerMap.get(peerId.toB58String()).wantlist.sortedEntries();
		    }
		  }, {
		    key: 'peers',
		    value: function peers() {
		      return Array.from(this.ledgerMap.values()).map(function (l) {
		        return l.partner;
		      });
		    }

		    // Handle incoming messages

		  }, {
		    key: 'messageReceived',
		    value: function messageReceived(peerId, msg, cb) {
		      var _this2 = this;

		      if (msg.empty) {
		        log('received empty message from %s', peerId.toB58String());
		      }

		      var ledger = this._findOrCreate(peerId);

		      // If the message was a full wantlist clear the current one
		      if (msg.full) {
		        ledger.wantlist = new Wantlist();
		      }

		      this._processBlocks(msg.blocks, ledger);
		      log('wantlist', Array.from(msg.wantlist.values()));
		      async.eachSeries(msg.wantlist.values(), this._processWantlist.bind(this, ledger, peerId), function (err) {
		        var done = function done(err) {
		          return async.setImmediate(function () {
		            return cb(err);
		          });
		        };
		        if (err) return done(err);
		        _this2._outbox();
		        done();
		      });
		    }
		  }, {
		    key: 'receivedBlock',
		    value: function receivedBlock(block) {
		      this._processBlock(block);
		      this._outbox();
		    }
		  }, {
		    key: '_processBlock',
		    value: function _processBlock(block) {
		      // Check all connected peers if they want the block we received
		      var _iteratorNormalCompletion = true;
		      var _didIteratorError = false;
		      var _iteratorError = undefined;

		      try {
		        for (var _iterator = this.ledgerMap.values()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
		          var l = _step.value;

		          var entry = l.wantlistContains(block.key);

		          if (entry) {
		            this.peerRequestQueue.push(entry, l.partner);
		          }
		        }
		      } catch (err) {
		        _didIteratorError = true;
		        _iteratorError = err;
		      } finally {
		        try {
		          if (!_iteratorNormalCompletion && _iterator.return) {
		            _iterator.return();
		          }
		        } finally {
		          if (_didIteratorError) {
		            throw _iteratorError;
		          }
		        }
		      }
		    }
		  }, {
		    key: '_processWantlist',
		    value: function _processWantlist(ledger, peerId, entry, cb) {
		      var _this3 = this;

		      if (entry.cancel) {
		        log('cancel %s', entry.key.toString('hex'));
		        ledger.cancelWant(entry.key);
		        this.peerRequestQueue.remove(entry.key, peerId);
		        async.setImmediate(function () {
		          return cb();
		        });
		      } else {
		        log('wants %s - %s', entry.key.toString('hex'), entry.priority);
		        ledger.wants(entry.key, entry.priority);

		        // If we already have the block, serve it
		        this.datastore.has(entry.key, function (err, exists) {
		          if (err) {
		            log('failed existence check %s', entry.key.toString('hex'));
		          } else if (exists) {
		            log('has want %s', entry.key.toString('hex'));
		            _this3.peerRequestQueue.push(entry.entry, peerId);
		          }
		          cb();
		        });
		      }
		    }
		  }, {
		    key: '_processBlocks',
		    value: function _processBlocks(blocks, ledger) {
		      var _iteratorNormalCompletion2 = true;
		      var _didIteratorError2 = false;
		      var _iteratorError2 = undefined;

		      try {
		        for (var _iterator2 = blocks.values()[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
		          var block = _step2.value;

		          log('got block %s %s bytes', block.key.toString('hex'), block.data.length);
		          ledger.receivedBytes(block.data.length);

		          this.receivedBlock(block);
		        }
		      } catch (err) {
		        _didIteratorError2 = true;
		        _iteratorError2 = err;
		      } finally {
		        try {
		          if (!_iteratorNormalCompletion2 && _iterator2.return) {
		            _iterator2.return();
		          }
		        } finally {
		          if (_didIteratorError2) {
		            throw _iteratorError2;
		          }
		        }
		      }
		    }

		    // Clear up all accounting things after message was sent

		  }, {
		    key: 'messageSent',
		    value: function messageSent(peerId, msg) {
		      var ledger = this._findOrCreate(peerId);
		      var _iteratorNormalCompletion3 = true;
		      var _didIteratorError3 = false;
		      var _iteratorError3 = undefined;

		      try {
		        for (var _iterator3 = msg.blocks.values()[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
		          var block = _step3.value;

		          ledger.sentBytes(block.data.length);
		          ledger.wantlist.remove(block.key);
		          this.peerRequestQueue.remove(block.key, peerId);
		        }
		      } catch (err) {
		        _didIteratorError3 = true;
		        _iteratorError3 = err;
		      } finally {
		        try {
		          if (!_iteratorNormalCompletion3 && _iterator3.return) {
		            _iterator3.return();
		          }
		        } finally {
		          if (_didIteratorError3) {
		            throw _iteratorError3;
		          }
		        }
		      }
		    }
		  }, {
		    key: 'numBytesSentTo',
		    value: function numBytesSentTo(peerId) {
		      return this._findOrCreate(peerId).accounting.bytesSent;
		    }
		  }, {
		    key: 'numBytesReceivedFrom',
		    value: function numBytesReceivedFrom(peerId) {
		      return this._findOrCreate(peerId).accounting.bytesRecv;
		    }
		  }, {
		    key: 'peerDisconnected',
		    value: function peerDisconnected(peerId) {
		      // if (this.ledgerMap.has(peerId.toB58String())) {
		      //   this.ledgerMap.delete(peerId.toB58String())
		      // }
		      //
		      // TODO: figure out how to remove all other references
		      // in the peerrequestqueue
		    }
		  }, {
		    key: '_findOrCreate',
		    value: function _findOrCreate(peerId) {
		      if (this.ledgerMap.has(peerId.toB58String())) {
		        return this.ledgerMap.get(peerId.toB58String());
		      }

		      var l = new Ledger(peerId);
		      this.ledgerMap.set(peerId.toB58String(), l);

		      return l;
		    }
		  }]);

		  return Engine;
		}();

	/***/ },
	/* 307 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Engine = __webpack_require__(306);

		exports.Engine = Engine;

	/***/ },
	/* 308 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var Wantlist = __webpack_require__(97);

		module.exports = function () {
		  function Ledger(peerId) {
		    _classCallCheck(this, Ledger);

		    this.partner = peerId;
		    this.wantlist = new Wantlist();

		    this.exchangeCount = 0;
		    this.sentToPeer = new Map();

		    this.accounting = {
		      bytesSent: 0,
		      bytesRecv: 0
		    };
		  }

		  _createClass(Ledger, [{
		    key: 'sentBytes',
		    value: function sentBytes(n) {
		      this.exchangeCount++;
		      this.lastExchange = new Date().getTime();
		      this.accounting.bytesSent += n;
		    }
		  }, {
		    key: 'receivedBytes',
		    value: function receivedBytes(n) {
		      this.exchangeCount++;
		      this.lastExchange = new Date().getTime();
		      this.accounting.bytesRecv += n;
		    }
		  }, {
		    key: 'wants',
		    value: function wants(key, priority) {
		      this.wantlist.add(key, priority);
		    }
		  }, {
		    key: 'cancelWant',
		    value: function cancelWant(key) {
		      this.wantlist.remove(key);
		    }
		  }, {
		    key: 'wantlistContains',
		    value: function wantlistContains(key) {
		      return this.wantlist.contains(key);
		    }
		  }]);

		  return Ledger;
		}();

	/***/ },
	/* 309 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var PriorityQueue = __webpack_require__(310);

		var PeerRequestTask = function () {
		  function PeerRequestTask(entry, target, done) {
		    _classCallCheck(this, PeerRequestTask);

		    this.entry = entry;
		    this.target = target;
		    this.created = new Date().getTime();
		    this.done = done;
		  }

		  _createClass(PeerRequestTask, [{
		    key: 'key',
		    get: function get() {
		      return taskKey(this.target, this.entry.key);
		    }
		  }]);

		  return PeerRequestTask;
		}();

		var ActivePartner = function () {
		  function ActivePartner() {
		    _classCallCheck(this, ActivePartner);

		    // The number of blocks this peer is currently being sent.
		    this.active = 0;

		    // The number of blocks this peer is currently requesting
		    this.requests = 0;

		    // Queue of tasks belonging to this peer
		    this.taskQueue = new PriorityQueue(V1);

		    this.activeBlocks = new Map();
		  }

		  _createClass(ActivePartner, [{
		    key: 'startTask',
		    value: function startTask(key) {
		      this.activeBlocks.set(key, {});
		      this.active++;
		    }
		  }, {
		    key: 'taskDone',
		    value: function taskDone(key) {
		      this.activeBlocks.delete(key);
		      this.active--;

		      if (this.active < 0) {
		        throw new Error('more tasks finished than started');
		      }
		    }
		  }]);

		  return ActivePartner;
		}();

		module.exports = function () {
		  function PeerRequestQueue() {
		    _classCallCheck(this, PeerRequestQueue);

		    this.taskMap = new Map();
		    this.partners = new Map();
		    this.pQueue = new PriorityQueue(partnerCompare);
		  }

		  // Add a new entry to the queue

		  _createClass(PeerRequestQueue, [{
		    key: 'push',
		    value: function push(entry, to) {
		      var _this = this;

		      var partner = this.partners.get(to.toB58String());

		      if (!partner) {
		        partner = new ActivePartner();
		        this.pQueue.push(partner);
		        this.partners.set(to.toB58String(), partner);
		      }

		      if (partner.activeBlocks.has(entry.key)) {
		        return;
		      }

		      var task = this.taskMap.get(taskKey(to, entry.key));

		      if (task) {
		        task.entry.priority = entry.priority;
		        partner.taskQueue.update(task);
		        return;
		      }

		      task = new PeerRequestTask(entry, to, function () {
		        partner.taskDone(entry.key);
		        _this.pQueue.update(partner);
		      });

		      partner.taskQueue.push(task);
		      this.taskMap.set(task.key, task);
		      partner.requests++;
		      partner.taskQueue.update(task);
		    }

		    // Get the task with the hightest priority from the queue

		  }, {
		    key: 'pop',
		    value: function pop() {
		      if (this.pQueue.isEmpty()) return;

		      var partner = this.pQueue.pop();
		      var out = void 0;
		      while (!partner.taskQueue.isEmpty()) {
		        out = partner.taskQueue.pop();
		        this.taskMap.delete(out.key);
		        if (out.trash) {
		          out = null;
		          // discarding tasks that have been removed
		          continue;
		        }

		        partner.startTask(out.entry.key);
		        partner.requests--;
		        break;
		      }

		      this.pQueue.push(partner);
		      return out;
		    }

		    // Remove a task from the queue

		  }, {
		    key: 'remove',
		    value: function remove(key, peerId) {
		      var t = this.taskMap.get(taskKey(peerId, key));
		      if (t) {
		        // remove the task "lazily"
		        // simply mark it as trash, so it'll be dropped when popped off the
		        // queue.
		        t.trash = true;

		        // having canceled a block, we now account for that in the given partner
		        this.partners.get(peerId.toB58String()).requests--;
		      }
		    }
		  }]);

		  return PeerRequestQueue;
		}();

		function taskKey(peerId, key) {
		  return peerId.toB58String() + ':' + key.toString('hex');
		}

		function partnerCompare(a, b) {
		  // having no blocks in their wantlist means lowest priority
		  // having both of these checks ensures stability of the sort
		  if (a.requests === 0) return false;
		  if (b.requests === 0) return true;

		  if (a.active === b.active) {
		    // sorting by taskQueue.size() aids in cleaning out trash entries faster
		    // if we sorted instead by requests, one peer could potentially build up
		    // a huge number of cancelled entries in the queue resulting in a memory leak
		    return a.taskQueue.size() > b.taskQueue.size();
		  }

		  return a.active < b.active;
		}
		// A basic task comparator that returns tasks in the order created
		function FIFO(a, b) {
		  return a.created < b.created;
		}

		// For the same target compare based on the wantlist priorities
		// Otherwise fallback to oldest task first
		function V1(a, b) {
		  if (a.target.toBytes() === b.target.toBytes()) {
		    return a.entry.priority > b.entry.priority;
		  }

		  return FIFO(a, b);
		}

	/***/ },
	/* 310 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var Heap = __webpack_require__(630);

		module.exports = function () {
		  function PriorityQueue(cmp) {
		    _classCallCheck(this, PriorityQueue);

		    this.q = new Heap(function (a, b) {
		      return cmp(a, b) ? -1 : 1;
		    });
		  }

		  _createClass(PriorityQueue, [{
		    key: 'push',
		    value: function push(e) {
		      this.q.push(e);
		    }
		  }, {
		    key: 'pop',
		    value: function pop() {
		      return this.q.pop();
		    }
		  }, {
		    key: 'update',
		    value: function update(e) {
		      this.q.updateItem(e);
		    }
		  }, {
		    key: 'size',
		    value: function size() {
		      return this.q.size();
		    }
		  }, {
		    key: 'isEmpty',
		    value: function isEmpty() {
		      return this.q.empty();
		    }
		  }]);

		  return PriorityQueue;
		}();

	/***/ },
	/* 311 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var async = __webpack_require__(95);
		var debug = __webpack_require__(17);
		var log = debug('bitswap');
		log.error = debug('bitswap:error');
		var EventEmitter = __webpack_require__(7).EventEmitter;

		var cs = __webpack_require__(186);
		var WantManager = __webpack_require__(315);
		var Network = __webpack_require__(313);
		var decision = __webpack_require__(307);

		module.exports = function () {
		  function Bitwap(p, libp2p, datastore, peerBook) {
		    _classCallCheck(this, Bitwap);

		    // the ID of the peer to act on behalf of
		    this.self = p;

		    // the network delivers messages
		    this.network = new Network(libp2p, peerBook, this);

		    // local database
		    this.datastore = datastore;

		    this.engine = new decision.Engine(datastore, this.network);

		    // handle message sending
		    this.wm = new WantManager(this.network);

		    this.blocksRecvd = 0;
		    this.dupBlocksRecvd = 0;
		    this.dupDataRecvd = 0;

		    this.notifications = new EventEmitter();
		    this.notifications.setMaxListeners(cs.maxListeners);
		  }

		  // handle messages received through the network

		  _createClass(Bitwap, [{
		    key: '_receiveMessage',
		    value: function _receiveMessage(peerId, incoming, cb) {
		      var _this = this;

		      cb = cb || function () {};
		      log('receiving message from %s', peerId.toB58String());
		      this.engine.messageReceived(peerId, incoming, function (err) {
		        if (err) {
		          log('failed to receive message', incoming);
		        }

		        var iblocks = incoming.blocks;

		        if (iblocks.size === 0) {
		          return cb();
		        }

		        // quickly send out cancels, reduces chances of duplicate block receives
		        var keys = [];
		        var _iteratorNormalCompletion = true;
		        var _didIteratorError = false;
		        var _iteratorError = undefined;

		        try {
		          for (var _iterator = iblocks.values()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
		            var block = _step.value;

		            var found = _this.wm.wl.contains(block.key);
		            if (!found) {
		              log('received un-askes-for %s from %s', block.key.toString('hex'), peerId.toB58String());
		            } else {
		              keys.push(block.key);
		            }
		          }
		        } catch (err) {
		          _didIteratorError = true;
		          _iteratorError = err;
		        } finally {
		          try {
		            if (!_iteratorNormalCompletion && _iterator.return) {
		              _iterator.return();
		            }
		          } finally {
		            if (_didIteratorError) {
		              throw _iteratorError;
		            }
		          }
		        }

		        _this.wm.cancelWants(keys);

		        async.eachLimit(iblocks.values(), 10, function (block, next) {
		          async.series([function (innerCb) {
		            return _this._updateReceiveCounters(block, function (err) {
		              if (err) {
		                // ignore, as these have been handled in _updateReceiveCounters
		                return innerCb();
		              }

		              log('got block from %s', peerId.toB58String(), block.data.toString());
		              innerCb();
		            });
		          }, function (innerCb) {
		            return _this.hasBlock(block, function (err) {
		              if (err) {
		                log.error('receiveMessage hasBlock error: %s', err.message);
		              }
		              innerCb();
		            });
		          }], next);
		        }, cb);
		      });
		    }
		  }, {
		    key: '_updateReceiveCounters',
		    value: function _updateReceiveCounters(block, cb) {
		      var _this2 = this;

		      this.blocksRecvd++;
		      this.datastore.has(block.key, function (err, has) {
		        if (err) {
		          log('datastore.has error: %s', err.message);
		          return cb(err);
		        }

		        if (has) {
		          _this2.dupBlocksRecvd++;
		          _this2.dupDataRecvd += block.data.length;
		          return cb(new Error('Already have block'));
		        }

		        cb();
		      });
		    }
		  }, {
		    key: '_tryPutBlock',
		    value: function _tryPutBlock(block, times, cb) {
		      var _this3 = this;

		      log('trying to put block %s', block.data.toString());
		      async.retry({ times: times, interval: 400 }, function (done) {
		        _this3.datastore.put(block, done);
		      }, cb);
		    }

		    // handle errors on the receiving channel

		  }, {
		    key: '_receiveError',
		    value: function _receiveError(err) {
		      log.error('ReceiveError: %s', err.message);
		    }

		    // handle new peers

		  }, {
		    key: '_onPeerConnected',
		    value: function _onPeerConnected(peerId) {
		      this.wm.connected(peerId);
		    }

		    // handle peers being disconnected

		  }, {
		    key: '_onPeerDisconnected',
		    value: function _onPeerDisconnected(peerId) {
		      this.wm.disconnected(peerId);
		      this.engine.peerDisconnected(peerId);
		    }

		    // getBlock attempts to retrieve a particular block with key `key` from peers

		  }, {
		    key: 'getBlock',
		    value: function getBlock(key, cb) {
		      log('getBlock.start %s', key.toString('hex'));
		      var done = function done(err, block) {
		        if (err) {
		          log('getBlock.fail %s', key.toString('hex'));
		        } else {
		          log('getBlock.end %s', key.toString('hex'));
		        }
		        cb(err, block);
		      };

		      this.getBlocks([key], function (results) {
		        var err = results[key].error;
		        var block = results[key].block;

		        done(err, block);
		      });
		    }

		    // return the current wantlist for a given `peerId`

		  }, {
		    key: 'wantlistForPeer',
		    value: function wantlistForPeer(peerId) {
		      return this.engine.wantlistForPeer(peerId);
		    }
		  }, {
		    key: 'getBlocks',
		    value: function getBlocks(keys, cb) {
		      var _this4 = this;

		      var results = {};
		      var unwantListeners = {};
		      var blockListeners = {};
		      var unwantEvent = function unwantEvent(key) {
		        return 'unwant:' + key.toString('hex');
		      };
		      var blockEvent = function blockEvent(key) {
		        return 'block:' + key.toString('hex');
		      };

		      var cleanupListeners = function cleanupListeners() {
		        keys.forEach(function (key) {
		          _this4.notifications.removeListener(unwantEvent(key), unwantListeners[key]);
		          _this4.notifications.removeListener(blockEvent(key), blockListeners[key]);
		        });
		      };

		      var addListeners = function addListeners() {
		        keys.forEach(function (key) {
		          unwantListeners[key] = function () {
		            finish(key, new Error('manual unwant: ' + key.toString('hex')));
		          };

		          blockListeners[key] = function (block) {
		            finish(key, null, block);
		          };

		          _this4.notifications.once(unwantEvent(key), unwantListeners[key]);
		          _this4.notifications.once(blockEvent(key), blockListeners[key]);
		        });
		      };

		      var finish = function finish(key, err, block) {
		        results[key] = {
		          error: err,
		          block: block
		        };

		        if (Object.keys(results).length === keys.length) {
		          cleanupListeners();
		          cb(results);
		        }
		      };

		      addListeners();

		      keys.forEach(function (key) {
		        // We don't want to announce looking for blocks
		        // when we might have them ourselves.
		        _this4.datastore.has(key, function (err, exists) {
		          if (err) {
		            log('error in datastore.has: ', err.message);
		            return;
		          }

		          if (exists) {
		            _this4.datastore.get(key, function (err, res) {
		              if (!err && res) {
		                finish(key, null, res);
		                _this4.wm.cancelWants([key]);
		                return;
		              }

		              if (err) {
		                log('error in datastore.get: ', err.message);
		              }
		            });
		          }
		        });
		      });

		      this.wm.wantBlocks(keys);
		    }

		    // removes the given keys from the want list independent of any ref counts

		  }, {
		    key: 'unwantBlocks',
		    value: function unwantBlocks(keys) {
		      var _this5 = this;

		      this.wm.unwantBlocks(keys);
		      keys.forEach(function (key) {
		        _this5.notifications.emit('unwant:' + key.toString('hex'));
		      });
		    }

		    // removes the given keys from the want list

		  }, {
		    key: 'cancelWants',
		    value: function cancelWants(keys) {
		      this.wm.cancelWants(keys);
		    }

		    // announces the existance of a block to this service

		  }, {
		    key: 'hasBlock',
		    value: function hasBlock(block, cb) {
		      var _this6 = this;

		      cb = cb || function () {};

		      this._tryPutBlock(block, 4, function (err) {
		        if (err) {
		          log.error('Error writing block to datastore: %s', err.message);
		          return cb(err);
		        }
		        log('put block: %s', block.key.toString('hex'));
		        _this6.notifications.emit('block:' + block.key.toString('hex'), block);
		        _this6.engine.receivedBlock(block);
		        cb();
		      });
		    }
		  }, {
		    key: 'getWantlist',
		    value: function getWantlist() {
		      return this.wm.wl.entries();
		    }
		  }, {
		    key: 'stat',
		    value: function stat() {
		      return {
		        wantlist: this.getWantlist(),
		        blocksReceived: this.blocksRecvd,
		        dupBlksReceived: this.dupBlocksRecvd,
		        dupDataReceived: this.dupDataRecvd,
		        peers: this.engine.peers()
		      };
		    }
		  }, {
		    key: 'start',
		    value: function start() {
		      this.wm.run();
		      this.network.start();
		    }

		    // Halt everything

		  }, {
		    key: 'stop',
		    value: function stop() {
		      this.wm.stop();
		      this.network.start();
		    }
		  }]);

		  return Bitwap;
		}();

	/***/ },
	/* 312 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var WantlistEntry = __webpack_require__(97).Entry;

		module.exports = function () {
		  function BitswapMessageEntry(key, priority, cancel) {
		    _classCallCheck(this, BitswapMessageEntry);

		    this.entry = new WantlistEntry(key, priority);
		    this.cancel = Boolean(cancel);
		  }

		  _createClass(BitswapMessageEntry, [{
		    key: 'key',
		    get: function get() {
		      return this.entry.key;
		    },
		    set: function set(val) {
		      this.entry.key = val;
		    }
		  }, {
		    key: 'priority',
		    get: function get() {
		      return this.entry.priority;
		    },
		    set: function set(val) {
		      this.entry.priority = val;
		    }
		  }]);

		  return BitswapMessageEntry;
		}();

	/***/ },
	/* 313 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var bl = __webpack_require__(98);
		var async = __webpack_require__(95);
		var debug = __webpack_require__(17);

		var Message = __webpack_require__(96);
		var log = debug('bitswap:network');

		var PROTOCOL_IDENTIFIER = '/ipfs/bitswap/1.0.0';

		module.exports = function () {
		  function Network(libp2p, peerBook, bitswap) {
		    _classCallCheck(this, Network);

		    this.libp2p = libp2p;
		    this.peerBook = peerBook;
		    this.bitswap = bitswap;
		  }

		  _createClass(Network, [{
		    key: 'start',
		    value: function start() {
		      // bind event listeners
		      this._onConnection = this._onConnection.bind(this);
		      this._onPeerMux = this._onPeerMux.bind(this);
		      this._onPeerMuxClosed = this._onPeerMuxClosed.bind(this);

		      this.libp2p.swarm.handle(PROTOCOL_IDENTIFIER, this._onConnection);

		      this.libp2p.swarm.on('peer-mux-established', this._onPeerMux);

		      this.libp2p.swarm.on('peer-mux-closed', this._onPeerMuxClosed);
		    }
		  }, {
		    key: 'stop',
		    value: function stop() {
		      this.libp2p.swarm.unhandle(PROTOCOL_IDENTIFIER);
		      this.libp2p.swarm.removeEventListener('peer-mux-established', this._onPeerMux);

		      this.libp2p.swarm.removeEventListener('peer-mux-closed', this._onPeerMuxClosed);
		    }
		  }, {
		    key: '_onConnection',
		    value: function _onConnection(conn) {
		      var _this = this;

		      conn.pipe(bl(function (err, data) {
		        conn.end();
		        if (err) {
		          return _this.bitswap._receiveError(err);
		        }
		        var msg = void 0;
		        try {
		          msg = Message.fromProto(data);
		        } catch (err) {
		          return _this.bitswap._receiveError(err);
		        }
		        _this.bitswap._receiveMessage(conn.peerId, msg);
		      }));
		    }
		  }, {
		    key: '_onPeerMux',
		    value: function _onPeerMux(peerInfo) {
		      this.bitswap._onPeerConnected(peerInfo.id);
		    }
		  }, {
		    key: '_onPeerMuxClosed',
		    value: function _onPeerMuxClosed(peerInfo) {
		      this.bitswap._onPeerDisconnected(peerInfo.id);
		    }

		    // Connect to the given peer

		  }, {
		    key: 'connectTo',
		    value: function connectTo(peerId, cb) {
		      log('connecting to %s', peerId.toB58String());
		      var done = function done(err) {
		        return async.setImmediate(function () {
		          return cb(err);
		        });
		      };
		      // NOTE: For now, all this does is ensure that we are
		      // connected. Once we have Peer Routing, we will be able
		      // to find the Peer
		      if (this.libp2p.swarm.muxedConns[peerId.toB58String()]) {
		        done();
		      } else {
		        done(new Error('Could not connect to peer with peerId:', peerId.toB58String()));
		      }
		    }

		    // Send the given msg (instance of Message) to the given peer

		  }, {
		    key: 'sendMessage',
		    value: function sendMessage(peerId, msg, cb) {
		      log('sendMessage to %s', peerId.toB58String());
		      log('msg %s', msg.full, msg.wantlist, msg.blocks);
		      var done = function done(err) {
		        return async.setImmediate(function () {
		          return cb(err);
		        });
		      };
		      var peerInfo = void 0;
		      try {
		        peerInfo = this.peerBook.getByMultihash(peerId.toBytes());
		      } catch (err) {
		        return done(err);
		      }

		      var conn = this.libp2p.swarm.dial(peerInfo, '/ipfs/bitswap/1.0.0', function (err) {
		        if (err) {
		          return done(err);
		        }

		        conn.write(msg.toProto());
		        conn.once('error', function (err) {
		          return done(err);
		        });
		        conn.once('finish', done);
		        conn.end();
		      });
		    }
		  }]);

		  return Network;
		}();

	/***/ },
	/* 314 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var isUndefined = __webpack_require__(261);

		module.exports = function () {
		  function WantlistEntry(key, priority) {
		    _classCallCheck(this, WantlistEntry);

		    // Keep track of how many requests we have for this key
		    this._refCounter = 1;

		    this.key = key;
		    this.priority = isUndefined(priority) ? 1 : priority;
		  }

		  _createClass(WantlistEntry, [{
		    key: 'inc',
		    value: function inc() {
		      this._refCounter += 1;
		    }
		  }, {
		    key: 'dec',
		    value: function dec() {
		      this._refCounter = Math.max(0, this._refCounter - 1);
		    }
		  }, {
		    key: 'hasRefs',
		    value: function hasRefs() {
		      return this._refCounter > 0;
		    }
		  }]);

		  return WantlistEntry;
		}();

	/***/ },
	/* 315 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var debug = __webpack_require__(17);
		var _ = __webpack_require__(251);

		var Message = __webpack_require__(96);
		var Wantlist = __webpack_require__(97);
		var cs = __webpack_require__(186);
		var MsgQueue = __webpack_require__(316);

		var log = debug('bitswap:wantmanager');
		log.error = debug('bitswap:wantmanager:error');

		module.exports = function () {
		  function Wantmanager(network) {
		    _classCallCheck(this, Wantmanager);

		    this.peers = new Map();
		    this.wl = new Wantlist();

		    this.network = network;
		  }

		  _createClass(Wantmanager, [{
		    key: '_newMsgQueue',
		    value: function _newMsgQueue(peerId) {
		      return new MsgQueue(peerId, this.network);
		    }
		  }, {
		    key: '_addEntries',
		    value: function _addEntries(keys, cancel, force) {
		      var _this = this;

		      var i = -1;
		      _(keys).map(function (key) {
		        i++;
		        return new Message.Entry(key, cs.kMaxPriority - i, cancel);
		      }).tap(function (e) {
		        // add changes to our wantlist
		        if (e.cancel) {
		          if (force) {
		            _this.wl.removeForce(e.key);
		          } else {
		            _this.wl.remove(e.key);
		          }
		        } else {
		          _this.wl.add(e.key, e.priority);
		        }
		      }).toArray(function (entries) {
		        // broadcast changes
		        var _iteratorNormalCompletion = true;
		        var _didIteratorError = false;
		        var _iteratorError = undefined;

		        try {
		          for (var _iterator = _this.peers.values()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
		            var p = _step.value;

		            p.addEntries(entries, false);
		          }
		        } catch (err) {
		          _didIteratorError = true;
		          _iteratorError = err;
		        } finally {
		          try {
		            if (!_iteratorNormalCompletion && _iterator.return) {
		              _iterator.return();
		            }
		          } finally {
		            if (_didIteratorError) {
		              throw _iteratorError;
		            }
		          }
		        }
		      });
		    }
		  }, {
		    key: '_startPeerHandler',
		    value: function _startPeerHandler(peerId) {
		      var mq = this.peers.get(peerId.toB58String());

		      if (mq) {
		        mq.refcnt++;
		        return;
		      }

		      mq = this._newMsgQueue(peerId);

		      // new peer, give them the full wantlist
		      var fullwantlist = new Message(true);
		      var _iteratorNormalCompletion2 = true;
		      var _didIteratorError2 = false;
		      var _iteratorError2 = undefined;

		      try {
		        for (var _iterator2 = this.wl.entries()[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
		          var entry = _step2.value;

		          fullwantlist.addEntry(entry[1].key, entry[1].priority);
		        }
		      } catch (err) {
		        _didIteratorError2 = true;
		        _iteratorError2 = err;
		      } finally {
		        try {
		          if (!_iteratorNormalCompletion2 && _iterator2.return) {
		            _iterator2.return();
		          }
		        } finally {
		          if (_didIteratorError2) {
		            throw _iteratorError2;
		          }
		        }
		      }

		      mq.addMessage(fullwantlist);

		      this.peers.set(peerId.toB58String(), mq);
		      mq.run();
		      return mq;
		    }
		  }, {
		    key: '_stopPeerHandler',
		    value: function _stopPeerHandler(peerId) {
		      var mq = this.peers.get(peerId.toB58String());

		      if (!mq) {
		        return;
		      }

		      mq.refcnt--;
		      if (mq.refcnt > 0) {
		        return;
		      }

		      mq.stop();
		      this.peers.delete(peerId.toB58String());
		    }

		    // add all the keys to the wantlist

		  }, {
		    key: 'wantBlocks',
		    value: function wantBlocks(keys) {
		      log('want blocks:', keys);
		      this._addEntries(keys, false);
		    }

		    // remove blocks of all the given keys without respecting refcounts

		  }, {
		    key: 'unwantBlocks',
		    value: function unwantBlocks(keys) {
		      log('unwant blocks:', keys);
		      this._addEntries(keys, true, true);
		    }

		    // cancel wanting all of the given keys

		  }, {
		    key: 'cancelWants',
		    value: function cancelWants(keys) {
		      log('cancel wants: ', keys);
		      this._addEntries(keys, true);
		    }

		    // Returns a list of all currently connected peers

		  }, {
		    key: 'connectedPeers',
		    value: function connectedPeers() {
		      return Array.from(this.peers.keys());
		    }
		  }, {
		    key: 'connected',
		    value: function connected(peerId) {
		      log('peer connected: %s', peerId.toB58String());
		      this._startPeerHandler(peerId);
		    }
		  }, {
		    key: 'disconnected',
		    value: function disconnected(peerId) {
		      log('peer disconnected: %s', peerId.toB58String());
		      this._stopPeerHandler(peerId);
		    }
		  }, {
		    key: 'run',
		    value: function run() {
		      // TODO: is this needed? if so enable it
		      //     // resend entirew wantlist every so often
		      //     const es = []
		      //     for (let e of this.wl.entries()) {
		      //       es.push(new Message.Entry(e.key, e.priority))
		      //     }

		      //     this.peers.forEach((p) => {
		      //       p.addEntries(es, true)
		      //     })
		      //     timer.start()
		      //   }
		      // }
		    }
		  }, {
		    key: 'stop',
		    value: function stop() {
		      var _iteratorNormalCompletion3 = true;
		      var _didIteratorError3 = false;
		      var _iteratorError3 = undefined;

		      try {
		        for (var _iterator3 = this.peers.values()[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
		          var mq = _step3.value;

		          this.disconnected(mq.p);
		        }
		      } catch (err) {
		        _didIteratorError3 = true;
		        _iteratorError3 = err;
		      } finally {
		        try {
		          if (!_iteratorNormalCompletion3 && _iterator3.return) {
		            _iterator3.return();
		          }
		        } finally {
		          if (_didIteratorError3) {
		            throw _iteratorError3;
		          }
		        }
		      }
		    }
		  }]);

		  return Wantmanager;
		}();

	/***/ },
	/* 316 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var debug = __webpack_require__(17);
		var async = __webpack_require__(95);

		var Message = __webpack_require__(96);

		var log = debug('bitswap:wantmanager:queue');
		log.error = debug('bitswap:wantmanager:queue:error');

		module.exports = function () {
		  function MsgQueue(peerId, network) {
		    _classCallCheck(this, MsgQueue);

		    this.p = peerId;
		    this.network = network;
		    this.refcnt = 1;

		    this.queue = async.queue(this.doWork.bind(this), 1);
		    // only start when `run` is called
		    this.queue.pause();
		  }

		  _createClass(MsgQueue, [{
		    key: 'addMessage',
		    value: function addMessage(msg) {
		      log('addMessage: %s', this.p.toB58String());
		      this.queue.push(msg);
		    }
		  }, {
		    key: 'addEntries',
		    value: function addEntries(entries, full) {
		      log('addEntries: %s', entries.length);
		      var msg = new Message(Boolean(full));
		      entries.forEach(function (entry) {
		        if (entry.cancel) {
		          msg.cancel(entry.key);
		        } else {
		          msg.addEntry(entry.key, entry.priority);
		        }
		      });

		      this.addMessage(msg);
		    }
		  }, {
		    key: 'doWork',
		    value: function doWork(wlm, cb) {
		      var _this = this;

		      log('doWork: %s', this.p.toB58String());
		      this.network.connectTo(this.p, function (err) {
		        if (err) {
		          log.error('cant connect to peer %s: %s', _this.p.toB58String(), err.message);
		          return cb();
		        }

		        _this.network.sendMessage(_this.p, wlm, function (err) {
		          if (err) {
		            log.error('send error: %s', err.message);
		          }

		          cb();
		        });
		      });
		    }
		  }, {
		    key: 'run',
		    value: function run() {
		      this.queue.resume();
		    }
		  }, {
		    key: 'stop',
		    value: function stop() {
		      var _this2 = this;

		      var done = function done() {
		        _this2.queue.kill();
		        _this2.queue.pause();
		      };

		      // Give the queue up to 1s time to finish things
		      this.queue.drain = done;
		      setTimeout(done, 1000);
		    }
		  }]);

		  return MsgQueue;
		}();

	/***/ },
	/* 317 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(global, setImmediate, process, module) {var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;'use strict';

		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; };

		/*!
		 * async
		 * https://github.com/caolan/async
		 *
		 * Copyright 2010-2014 Caolan McMahon
		 * Released under the MIT license
		 */
		(function () {

		    var async = {};
		    function noop() {}
		    function identity(v) {
		        return v;
		    }
		    function toBool(v) {
		        return !!v;
		    }
		    function notId(v) {
		        return !v;
		    }

		    // global on the server, window in the browser
		    var previous_async;

		    // Establish the root object, `window` (`self`) in the browser, `global`
		    // on the server, or `this` in some virtual machines. We use `self`
		    // instead of `window` for `WebWorker` support.
		    var root = (typeof self === 'undefined' ? 'undefined' : _typeof(self)) === 'object' && self.self === self && self || (typeof global === 'undefined' ? 'undefined' : _typeof(global)) === 'object' && global.global === global && global || this;

		    if (root != null) {
		        previous_async = root.async;
		    }

		    async.noConflict = function () {
		        root.async = previous_async;
		        return async;
		    };

		    function only_once(fn) {
		        return function () {
		            if (fn === null) throw new Error("Callback was already called.");
		            fn.apply(this, arguments);
		            fn = null;
		        };
		    }

		    function _once(fn) {
		        return function () {
		            if (fn === null) return;
		            fn.apply(this, arguments);
		            fn = null;
		        };
		    }

		    //// cross-browser compatiblity functions ////

		    var _toString = Object.prototype.toString;

		    var _isArray = Array.isArray || function (obj) {
		        return _toString.call(obj) === '[object Array]';
		    };

		    // Ported from underscore.js isObject
		    var _isObject = function _isObject(obj) {
		        var type = typeof obj === 'undefined' ? 'undefined' : _typeof(obj);
		        return type === 'function' || type === 'object' && !!obj;
		    };

		    function _isArrayLike(arr) {
		        return _isArray(arr) ||
		        // has a positive integer length property
		        typeof arr.length === "number" && arr.length >= 0 && arr.length % 1 === 0;
		    }

		    function _arrayEach(arr, iterator) {
		        var index = -1,
		            length = arr.length;

		        while (++index < length) {
		            iterator(arr[index], index, arr);
		        }
		    }

		    function _map(arr, iterator) {
		        var index = -1,
		            length = arr.length,
		            result = Array(length);

		        while (++index < length) {
		            result[index] = iterator(arr[index], index, arr);
		        }
		        return result;
		    }

		    function _range(count) {
		        return _map(Array(count), function (v, i) {
		            return i;
		        });
		    }

		    function _reduce(arr, iterator, memo) {
		        _arrayEach(arr, function (x, i, a) {
		            memo = iterator(memo, x, i, a);
		        });
		        return memo;
		    }

		    function _forEachOf(object, iterator) {
		        _arrayEach(_keys(object), function (key) {
		            iterator(object[key], key);
		        });
		    }

		    function _indexOf(arr, item) {
		        for (var i = 0; i < arr.length; i++) {
		            if (arr[i] === item) return i;
		        }
		        return -1;
		    }

		    var _keys = Object.keys || function (obj) {
		        var keys = [];
		        for (var k in obj) {
		            if (obj.hasOwnProperty(k)) {
		                keys.push(k);
		            }
		        }
		        return keys;
		    };

		    function _keyIterator(coll) {
		        var i = -1;
		        var len;
		        var keys;
		        if (_isArrayLike(coll)) {
		            len = coll.length;
		            return function next() {
		                i++;
		                return i < len ? i : null;
		            };
		        } else {
		            keys = _keys(coll);
		            len = keys.length;
		            return function next() {
		                i++;
		                return i < len ? keys[i] : null;
		            };
		        }
		    }

		    // Similar to ES6's rest param (http://ariya.ofilabs.com/2013/03/es6-and-rest-parameter.html)
		    // This accumulates the arguments passed into an array, after a given index.
		    // From underscore.js (https://github.com/jashkenas/underscore/pull/2140).
		    function _restParam(func, startIndex) {
		        startIndex = startIndex == null ? func.length - 1 : +startIndex;
		        return function () {
		            var length = Math.max(arguments.length - startIndex, 0);
		            var rest = Array(length);
		            for (var index = 0; index < length; index++) {
		                rest[index] = arguments[index + startIndex];
		            }
		            switch (startIndex) {
		                case 0:
		                    return func.call(this, rest);
		                case 1:
		                    return func.call(this, arguments[0], rest);
		            }
		            // Currently unused but handle cases outside of the switch statement:
		            // var args = Array(startIndex + 1);
		            // for (index = 0; index < startIndex; index++) {
		            //     args[index] = arguments[index];
		            // }
		            // args[startIndex] = rest;
		            // return func.apply(this, args);
		        };
		    }

		    function _withoutIndex(iterator) {
		        return function (value, index, callback) {
		            return iterator(value, callback);
		        };
		    }

		    //// exported async module functions ////

		    //// nextTick implementation with browser-compatible fallback ////

		    // capture the global reference to guard against fakeTimer mocks
		    var _setImmediate = typeof setImmediate === 'function' && setImmediate;

		    var _delay = _setImmediate ? function (fn) {
		        // not a direct alias for IE10 compatibility
		        _setImmediate(fn);
		    } : function (fn) {
		        setTimeout(fn, 0);
		    };

		    if ((typeof process === 'undefined' ? 'undefined' : _typeof(process)) === 'object' && typeof process.nextTick === 'function') {
		        async.nextTick = process.nextTick;
		    } else {
		        async.nextTick = _delay;
		    }
		    async.setImmediate = _setImmediate ? _delay : async.nextTick;

		    async.forEach = async.each = function (arr, iterator, callback) {
		        return async.eachOf(arr, _withoutIndex(iterator), callback);
		    };

		    async.forEachSeries = async.eachSeries = function (arr, iterator, callback) {
		        return async.eachOfSeries(arr, _withoutIndex(iterator), callback);
		    };

		    async.forEachLimit = async.eachLimit = function (arr, limit, iterator, callback) {
		        return _eachOfLimit(limit)(arr, _withoutIndex(iterator), callback);
		    };

		    async.forEachOf = async.eachOf = function (object, iterator, callback) {
		        callback = _once(callback || noop);
		        object = object || [];

		        var iter = _keyIterator(object);
		        var key,
		            completed = 0;

		        while ((key = iter()) != null) {
		            completed += 1;
		            iterator(object[key], key, only_once(done));
		        }

		        if (completed === 0) callback(null);

		        function done(err) {
		            completed--;
		            if (err) {
		                callback(err);
		            }
		            // Check key is null in case iterator isn't exhausted
		            // and done resolved synchronously.
		            else if (key === null && completed <= 0) {
		                    callback(null);
		                }
		        }
		    };

		    async.forEachOfSeries = async.eachOfSeries = function (obj, iterator, callback) {
		        callback = _once(callback || noop);
		        obj = obj || [];
		        var nextKey = _keyIterator(obj);
		        var key = nextKey();
		        function iterate() {
		            var sync = true;
		            if (key === null) {
		                return callback(null);
		            }
		            iterator(obj[key], key, only_once(function (err) {
		                if (err) {
		                    callback(err);
		                } else {
		                    key = nextKey();
		                    if (key === null) {
		                        return callback(null);
		                    } else {
		                        if (sync) {
		                            async.setImmediate(iterate);
		                        } else {
		                            iterate();
		                        }
		                    }
		                }
		            }));
		            sync = false;
		        }
		        iterate();
		    };

		    async.forEachOfLimit = async.eachOfLimit = function (obj, limit, iterator, callback) {
		        _eachOfLimit(limit)(obj, iterator, callback);
		    };

		    function _eachOfLimit(limit) {

		        return function (obj, iterator, callback) {
		            callback = _once(callback || noop);
		            obj = obj || [];
		            var nextKey = _keyIterator(obj);
		            if (limit <= 0) {
		                return callback(null);
		            }
		            var done = false;
		            var running = 0;
		            var errored = false;

		            (function replenish() {
		                if (done && running <= 0) {
		                    return callback(null);
		                }

		                while (running < limit && !errored) {
		                    var key = nextKey();
		                    if (key === null) {
		                        done = true;
		                        if (running <= 0) {
		                            callback(null);
		                        }
		                        return;
		                    }
		                    running += 1;
		                    iterator(obj[key], key, only_once(function (err) {
		                        running -= 1;
		                        if (err) {
		                            callback(err);
		                            errored = true;
		                        } else {
		                            replenish();
		                        }
		                    }));
		                }
		            })();
		        };
		    }

		    function doParallel(fn) {
		        return function (obj, iterator, callback) {
		            return fn(async.eachOf, obj, iterator, callback);
		        };
		    }
		    function doParallelLimit(fn) {
		        return function (obj, limit, iterator, callback) {
		            return fn(_eachOfLimit(limit), obj, iterator, callback);
		        };
		    }
		    function doSeries(fn) {
		        return function (obj, iterator, callback) {
		            return fn(async.eachOfSeries, obj, iterator, callback);
		        };
		    }

		    function _asyncMap(eachfn, arr, iterator, callback) {
		        callback = _once(callback || noop);
		        arr = arr || [];
		        var results = _isArrayLike(arr) ? [] : {};
		        eachfn(arr, function (value, index, callback) {
		            iterator(value, function (err, v) {
		                results[index] = v;
		                callback(err);
		            });
		        }, function (err) {
		            callback(err, results);
		        });
		    }

		    async.map = doParallel(_asyncMap);
		    async.mapSeries = doSeries(_asyncMap);
		    async.mapLimit = doParallelLimit(_asyncMap);

		    // reduce only has a series version, as doing reduce in parallel won't
		    // work in many situations.
		    async.inject = async.foldl = async.reduce = function (arr, memo, iterator, callback) {
		        async.eachOfSeries(arr, function (x, i, callback) {
		            iterator(memo, x, function (err, v) {
		                memo = v;
		                callback(err);
		            });
		        }, function (err) {
		            callback(err, memo);
		        });
		    };

		    async.foldr = async.reduceRight = function (arr, memo, iterator, callback) {
		        var reversed = _map(arr, identity).reverse();
		        async.reduce(reversed, memo, iterator, callback);
		    };

		    async.transform = function (arr, memo, iterator, callback) {
		        if (arguments.length === 3) {
		            callback = iterator;
		            iterator = memo;
		            memo = _isArray(arr) ? [] : {};
		        }

		        async.eachOf(arr, function (v, k, cb) {
		            iterator(memo, v, k, cb);
		        }, function (err) {
		            callback(err, memo);
		        });
		    };

		    function _filter(eachfn, arr, iterator, callback) {
		        var results = [];
		        eachfn(arr, function (x, index, callback) {
		            iterator(x, function (v) {
		                if (v) {
		                    results.push({ index: index, value: x });
		                }
		                callback();
		            });
		        }, function () {
		            callback(_map(results.sort(function (a, b) {
		                return a.index - b.index;
		            }), function (x) {
		                return x.value;
		            }));
		        });
		    }

		    async.select = async.filter = doParallel(_filter);

		    async.selectLimit = async.filterLimit = doParallelLimit(_filter);

		    async.selectSeries = async.filterSeries = doSeries(_filter);

		    function _reject(eachfn, arr, iterator, callback) {
		        _filter(eachfn, arr, function (value, cb) {
		            iterator(value, function (v) {
		                cb(!v);
		            });
		        }, callback);
		    }
		    async.reject = doParallel(_reject);
		    async.rejectLimit = doParallelLimit(_reject);
		    async.rejectSeries = doSeries(_reject);

		    function _createTester(eachfn, check, getResult) {
		        return function (arr, limit, iterator, cb) {
		            function done() {
		                if (cb) cb(getResult(false, void 0));
		            }
		            function iteratee(x, _, callback) {
		                if (!cb) return callback();
		                iterator(x, function (v) {
		                    if (cb && check(v)) {
		                        cb(getResult(true, x));
		                        cb = iterator = false;
		                    }
		                    callback();
		                });
		            }
		            if (arguments.length > 3) {
		                eachfn(arr, limit, iteratee, done);
		            } else {
		                cb = iterator;
		                iterator = limit;
		                eachfn(arr, iteratee, done);
		            }
		        };
		    }

		    async.any = async.some = _createTester(async.eachOf, toBool, identity);

		    async.someLimit = _createTester(async.eachOfLimit, toBool, identity);

		    async.all = async.every = _createTester(async.eachOf, notId, notId);

		    async.everyLimit = _createTester(async.eachOfLimit, notId, notId);

		    function _findGetResult(v, x) {
		        return x;
		    }
		    async.detect = _createTester(async.eachOf, identity, _findGetResult);
		    async.detectSeries = _createTester(async.eachOfSeries, identity, _findGetResult);
		    async.detectLimit = _createTester(async.eachOfLimit, identity, _findGetResult);

		    async.sortBy = function (arr, iterator, callback) {
		        async.map(arr, function (x, callback) {
		            iterator(x, function (err, criteria) {
		                if (err) {
		                    callback(err);
		                } else {
		                    callback(null, { value: x, criteria: criteria });
		                }
		            });
		        }, function (err, results) {
		            if (err) {
		                return callback(err);
		            } else {
		                callback(null, _map(results.sort(comparator), function (x) {
		                    return x.value;
		                }));
		            }
		        });

		        function comparator(left, right) {
		            var a = left.criteria,
		                b = right.criteria;
		            return a < b ? -1 : a > b ? 1 : 0;
		        }
		    };

		    async.auto = function (tasks, concurrency, callback) {
		        if (typeof arguments[1] === 'function') {
		            // concurrency is optional, shift the args.
		            callback = concurrency;
		            concurrency = null;
		        }
		        callback = _once(callback || noop);
		        var keys = _keys(tasks);
		        var remainingTasks = keys.length;
		        if (!remainingTasks) {
		            return callback(null);
		        }
		        if (!concurrency) {
		            concurrency = remainingTasks;
		        }

		        var results = {};
		        var runningTasks = 0;

		        var hasError = false;

		        var listeners = [];
		        function addListener(fn) {
		            listeners.unshift(fn);
		        }
		        function removeListener(fn) {
		            var idx = _indexOf(listeners, fn);
		            if (idx >= 0) listeners.splice(idx, 1);
		        }
		        function taskComplete() {
		            remainingTasks--;
		            _arrayEach(listeners.slice(0), function (fn) {
		                fn();
		            });
		        }

		        addListener(function () {
		            if (!remainingTasks) {
		                callback(null, results);
		            }
		        });

		        _arrayEach(keys, function (k) {
		            if (hasError) return;
		            var task = _isArray(tasks[k]) ? tasks[k] : [tasks[k]];
		            var taskCallback = _restParam(function (err, args) {
		                runningTasks--;
		                if (args.length <= 1) {
		                    args = args[0];
		                }
		                if (err) {
		                    var safeResults = {};
		                    _forEachOf(results, function (val, rkey) {
		                        safeResults[rkey] = val;
		                    });
		                    safeResults[k] = args;
		                    hasError = true;

		                    callback(err, safeResults);
		                } else {
		                    results[k] = args;
		                    async.setImmediate(taskComplete);
		                }
		            });
		            var requires = task.slice(0, task.length - 1);
		            // prevent dead-locks
		            var len = requires.length;
		            var dep;
		            while (len--) {
		                if (!(dep = tasks[requires[len]])) {
		                    throw new Error('Has nonexistent dependency in ' + requires.join(', '));
		                }
		                if (_isArray(dep) && _indexOf(dep, k) >= 0) {
		                    throw new Error('Has cyclic dependencies');
		                }
		            }
		            function ready() {
		                return runningTasks < concurrency && _reduce(requires, function (a, x) {
		                    return a && results.hasOwnProperty(x);
		                }, true) && !results.hasOwnProperty(k);
		            }
		            if (ready()) {
		                runningTasks++;
		                task[task.length - 1](taskCallback, results);
		            } else {
		                addListener(listener);
		            }
		            function listener() {
		                if (ready()) {
		                    runningTasks++;
		                    removeListener(listener);
		                    task[task.length - 1](taskCallback, results);
		                }
		            }
		        });
		    };

		    async.retry = function (times, task, callback) {
		        var DEFAULT_TIMES = 5;
		        var DEFAULT_INTERVAL = 0;

		        var attempts = [];

		        var opts = {
		            times: DEFAULT_TIMES,
		            interval: DEFAULT_INTERVAL
		        };

		        function parseTimes(acc, t) {
		            if (typeof t === 'number') {
		                acc.times = parseInt(t, 10) || DEFAULT_TIMES;
		            } else if ((typeof t === 'undefined' ? 'undefined' : _typeof(t)) === 'object') {
		                acc.times = parseInt(t.times, 10) || DEFAULT_TIMES;
		                acc.interval = parseInt(t.interval, 10) || DEFAULT_INTERVAL;
		            } else {
		                throw new Error('Unsupported argument type for \'times\': ' + (typeof t === 'undefined' ? 'undefined' : _typeof(t)));
		            }
		        }

		        var length = arguments.length;
		        if (length < 1 || length > 3) {
		            throw new Error('Invalid arguments - must be either (task), (task, callback), (times, task) or (times, task, callback)');
		        } else if (length <= 2 && typeof times === 'function') {
		            callback = task;
		            task = times;
		        }
		        if (typeof times !== 'function') {
		            parseTimes(opts, times);
		        }
		        opts.callback = callback;
		        opts.task = task;

		        function wrappedTask(wrappedCallback, wrappedResults) {
		            function retryAttempt(task, finalAttempt) {
		                return function (seriesCallback) {
		                    task(function (err, result) {
		                        seriesCallback(!err || finalAttempt, { err: err, result: result });
		                    }, wrappedResults);
		                };
		            }

		            function retryInterval(interval) {
		                return function (seriesCallback) {
		                    setTimeout(function () {
		                        seriesCallback(null);
		                    }, interval);
		                };
		            }

		            while (opts.times) {

		                var finalAttempt = !(opts.times -= 1);
		                attempts.push(retryAttempt(opts.task, finalAttempt));
		                if (!finalAttempt && opts.interval > 0) {
		                    attempts.push(retryInterval(opts.interval));
		                }
		            }

		            async.series(attempts, function (done, data) {
		                data = data[data.length - 1];
		                (wrappedCallback || opts.callback)(data.err, data.result);
		            });
		        }

		        // If a callback is passed, run this as a controll flow
		        return opts.callback ? wrappedTask() : wrappedTask;
		    };

		    async.waterfall = function (tasks, callback) {
		        callback = _once(callback || noop);
		        if (!_isArray(tasks)) {
		            var err = new Error('First argument to waterfall must be an array of functions');
		            return callback(err);
		        }
		        if (!tasks.length) {
		            return callback();
		        }
		        function wrapIterator(iterator) {
		            return _restParam(function (err, args) {
		                if (err) {
		                    callback.apply(null, [err].concat(args));
		                } else {
		                    var next = iterator.next();
		                    if (next) {
		                        args.push(wrapIterator(next));
		                    } else {
		                        args.push(callback);
		                    }
		                    ensureAsync(iterator).apply(null, args);
		                }
		            });
		        }
		        wrapIterator(async.iterator(tasks))();
		    };

		    function _parallel(eachfn, tasks, callback) {
		        callback = callback || noop;
		        var results = _isArrayLike(tasks) ? [] : {};

		        eachfn(tasks, function (task, key, callback) {
		            task(_restParam(function (err, args) {
		                if (args.length <= 1) {
		                    args = args[0];
		                }
		                results[key] = args;
		                callback(err);
		            }));
		        }, function (err) {
		            callback(err, results);
		        });
		    }

		    async.parallel = function (tasks, callback) {
		        _parallel(async.eachOf, tasks, callback);
		    };

		    async.parallelLimit = function (tasks, limit, callback) {
		        _parallel(_eachOfLimit(limit), tasks, callback);
		    };

		    async.series = function (tasks, callback) {
		        _parallel(async.eachOfSeries, tasks, callback);
		    };

		    async.iterator = function (tasks) {
		        function makeCallback(index) {
		            function fn() {
		                if (tasks.length) {
		                    tasks[index].apply(null, arguments);
		                }
		                return fn.next();
		            }
		            fn.next = function () {
		                return index < tasks.length - 1 ? makeCallback(index + 1) : null;
		            };
		            return fn;
		        }
		        return makeCallback(0);
		    };

		    async.apply = _restParam(function (fn, args) {
		        return _restParam(function (callArgs) {
		            return fn.apply(null, args.concat(callArgs));
		        });
		    });

		    function _concat(eachfn, arr, fn, callback) {
		        var result = [];
		        eachfn(arr, function (x, index, cb) {
		            fn(x, function (err, y) {
		                result = result.concat(y || []);
		                cb(err);
		            });
		        }, function (err) {
		            callback(err, result);
		        });
		    }
		    async.concat = doParallel(_concat);
		    async.concatSeries = doSeries(_concat);

		    async.whilst = function (test, iterator, callback) {
		        callback = callback || noop;
		        if (test()) {
		            var next = _restParam(function (err, args) {
		                if (err) {
		                    callback(err);
		                } else if (test.apply(this, args)) {
		                    iterator(next);
		                } else {
		                    callback.apply(null, [null].concat(args));
		                }
		            });
		            iterator(next);
		        } else {
		            callback(null);
		        }
		    };

		    async.doWhilst = function (iterator, test, callback) {
		        var calls = 0;
		        return async.whilst(function () {
		            return ++calls <= 1 || test.apply(this, arguments);
		        }, iterator, callback);
		    };

		    async.until = function (test, iterator, callback) {
		        return async.whilst(function () {
		            return !test.apply(this, arguments);
		        }, iterator, callback);
		    };

		    async.doUntil = function (iterator, test, callback) {
		        return async.doWhilst(iterator, function () {
		            return !test.apply(this, arguments);
		        }, callback);
		    };

		    async.during = function (test, iterator, callback) {
		        callback = callback || noop;

		        var next = _restParam(function (err, args) {
		            if (err) {
		                callback(err);
		            } else {
		                args.push(check);
		                test.apply(this, args);
		            }
		        });

		        var check = function check(err, truth) {
		            if (err) {
		                callback(err);
		            } else if (truth) {
		                iterator(next);
		            } else {
		                callback(null);
		            }
		        };

		        test(check);
		    };

		    async.doDuring = function (iterator, test, callback) {
		        var calls = 0;
		        async.during(function (next) {
		            if (calls++ < 1) {
		                next(null, true);
		            } else {
		                test.apply(this, arguments);
		            }
		        }, iterator, callback);
		    };

		    function _queue(worker, concurrency, payload) {
		        if (concurrency == null) {
		            concurrency = 1;
		        } else if (concurrency === 0) {
		            throw new Error('Concurrency must not be zero');
		        }
		        function _insert(q, data, pos, callback) {
		            if (callback != null && typeof callback !== "function") {
		                throw new Error("task callback must be a function");
		            }
		            q.started = true;
		            if (!_isArray(data)) {
		                data = [data];
		            }
		            if (data.length === 0 && q.idle()) {
		                // call drain immediately if there are no tasks
		                return async.setImmediate(function () {
		                    q.drain();
		                });
		            }
		            _arrayEach(data, function (task) {
		                var item = {
		                    data: task,
		                    callback: callback || noop
		                };

		                if (pos) {
		                    q.tasks.unshift(item);
		                } else {
		                    q.tasks.push(item);
		                }

		                if (q.tasks.length === q.concurrency) {
		                    q.saturated();
		                }
		            });
		            async.setImmediate(q.process);
		        }
		        function _next(q, tasks) {
		            return function () {
		                workers -= 1;

		                var removed = false;
		                var args = arguments;
		                _arrayEach(tasks, function (task) {
		                    _arrayEach(_workersList, function (worker, index) {
		                        if (worker === task && !removed) {
		                            _workersList.splice(index, 1);
		                            removed = true;
		                        }
		                    });

		                    task.callback.apply(task, args);
		                });
		                if (q.tasks.length + workers === 0) {
		                    q.drain();
		                }
		                q.process();
		            };
		        }

		        var workers = 0;
		        var _workersList = [];
		        var q = {
		            tasks: [],
		            concurrency: concurrency,
		            payload: payload,
		            saturated: noop,
		            empty: noop,
		            drain: noop,
		            started: false,
		            paused: false,
		            push: function push(data, callback) {
		                _insert(q, data, false, callback);
		            },
		            kill: function kill() {
		                q.drain = noop;
		                q.tasks = [];
		            },
		            unshift: function unshift(data, callback) {
		                _insert(q, data, true, callback);
		            },
		            process: function process() {
		                while (!q.paused && workers < q.concurrency && q.tasks.length) {

		                    var tasks = q.payload ? q.tasks.splice(0, q.payload) : q.tasks.splice(0, q.tasks.length);

		                    var data = _map(tasks, function (task) {
		                        return task.data;
		                    });

		                    if (q.tasks.length === 0) {
		                        q.empty();
		                    }
		                    workers += 1;
		                    _workersList.push(tasks[0]);
		                    var cb = only_once(_next(q, tasks));
		                    worker(data, cb);
		                }
		            },
		            length: function length() {
		                return q.tasks.length;
		            },
		            running: function running() {
		                return workers;
		            },
		            workersList: function workersList() {
		                return _workersList;
		            },
		            idle: function idle() {
		                return q.tasks.length + workers === 0;
		            },
		            pause: function pause() {
		                q.paused = true;
		            },
		            resume: function resume() {
		                if (q.paused === false) {
		                    return;
		                }
		                q.paused = false;
		                var resumeCount = Math.min(q.concurrency, q.tasks.length);
		                // Need to call q.process once per concurrent
		                // worker to preserve full concurrency after pause
		                for (var w = 1; w <= resumeCount; w++) {
		                    async.setImmediate(q.process);
		                }
		            }
		        };
		        return q;
		    }

		    async.queue = function (worker, concurrency) {
		        var q = _queue(function (items, cb) {
		            worker(items[0], cb);
		        }, concurrency, 1);

		        return q;
		    };

		    async.priorityQueue = function (worker, concurrency) {

		        function _compareTasks(a, b) {
		            return a.priority - b.priority;
		        }

		        function _binarySearch(sequence, item, compare) {
		            var beg = -1,
		                end = sequence.length - 1;
		            while (beg < end) {
		                var mid = beg + (end - beg + 1 >>> 1);
		                if (compare(item, sequence[mid]) >= 0) {
		                    beg = mid;
		                } else {
		                    end = mid - 1;
		                }
		            }
		            return beg;
		        }

		        function _insert(q, data, priority, callback) {
		            if (callback != null && typeof callback !== "function") {
		                throw new Error("task callback must be a function");
		            }
		            q.started = true;
		            if (!_isArray(data)) {
		                data = [data];
		            }
		            if (data.length === 0) {
		                // call drain immediately if there are no tasks
		                return async.setImmediate(function () {
		                    q.drain();
		                });
		            }
		            _arrayEach(data, function (task) {
		                var item = {
		                    data: task,
		                    priority: priority,
		                    callback: typeof callback === 'function' ? callback : noop
		                };

		                q.tasks.splice(_binarySearch(q.tasks, item, _compareTasks) + 1, 0, item);

		                if (q.tasks.length === q.concurrency) {
		                    q.saturated();
		                }
		                async.setImmediate(q.process);
		            });
		        }

		        // Start with a normal queue
		        var q = async.queue(worker, concurrency);

		        // Override push to accept second parameter representing priority
		        q.push = function (data, priority, callback) {
		            _insert(q, data, priority, callback);
		        };

		        // Remove unshift function
		        delete q.unshift;

		        return q;
		    };

		    async.cargo = function (worker, payload) {
		        return _queue(worker, 1, payload);
		    };

		    function _console_fn(name) {
		        return _restParam(function (fn, args) {
		            fn.apply(null, args.concat([_restParam(function (err, args) {
		                if ((typeof console === 'undefined' ? 'undefined' : _typeof(console)) === 'object') {
		                    if (err) {
		                        if (console.error) {
		                            console.error(err);
		                        }
		                    } else if (console[name]) {
		                        _arrayEach(args, function (x) {
		                            console[name](x);
		                        });
		                    }
		                }
		            })]));
		        });
		    }
		    async.log = _console_fn('log');
		    async.dir = _console_fn('dir');
		    /*async.info = _console_fn('info');
		    async.warn = _console_fn('warn');
		    async.error = _console_fn('error');*/

		    async.memoize = function (fn, hasher) {
		        var memo = {};
		        var queues = {};
		        var has = Object.prototype.hasOwnProperty;
		        hasher = hasher || identity;
		        var memoized = _restParam(function memoized(args) {
		            var callback = args.pop();
		            var key = hasher.apply(null, args);
		            if (has.call(memo, key)) {
		                async.setImmediate(function () {
		                    callback.apply(null, memo[key]);
		                });
		            } else if (has.call(queues, key)) {
		                queues[key].push(callback);
		            } else {
		                queues[key] = [callback];
		                fn.apply(null, args.concat([_restParam(function (args) {
		                    memo[key] = args;
		                    var q = queues[key];
		                    delete queues[key];
		                    for (var i = 0, l = q.length; i < l; i++) {
		                        q[i].apply(null, args);
		                    }
		                })]));
		            }
		        });
		        memoized.memo = memo;
		        memoized.unmemoized = fn;
		        return memoized;
		    };

		    async.unmemoize = function (fn) {
		        return function () {
		            return (fn.unmemoized || fn).apply(null, arguments);
		        };
		    };

		    function _times(mapper) {
		        return function (count, iterator, callback) {
		            mapper(_range(count), iterator, callback);
		        };
		    }

		    async.times = _times(async.map);
		    async.timesSeries = _times(async.mapSeries);
		    async.timesLimit = function (count, limit, iterator, callback) {
		        return async.mapLimit(_range(count), limit, iterator, callback);
		    };

		    async.seq = function () /* functions... */{
		        var fns = arguments;
		        return _restParam(function (args) {
		            var that = this;

		            var callback = args[args.length - 1];
		            if (typeof callback == 'function') {
		                args.pop();
		            } else {
		                callback = noop;
		            }

		            async.reduce(fns, args, function (newargs, fn, cb) {
		                fn.apply(that, newargs.concat([_restParam(function (err, nextargs) {
		                    cb(err, nextargs);
		                })]));
		            }, function (err, results) {
		                callback.apply(that, [err].concat(results));
		            });
		        });
		    };

		    async.compose = function () /* functions... */{
		        return async.seq.apply(null, Array.prototype.reverse.call(arguments));
		    };

		    function _applyEach(eachfn) {
		        return _restParam(function (fns, args) {
		            var go = _restParam(function (args) {
		                var that = this;
		                var callback = args.pop();
		                return eachfn(fns, function (fn, _, cb) {
		                    fn.apply(that, args.concat([cb]));
		                }, callback);
		            });
		            if (args.length) {
		                return go.apply(this, args);
		            } else {
		                return go;
		            }
		        });
		    }

		    async.applyEach = _applyEach(async.eachOf);
		    async.applyEachSeries = _applyEach(async.eachOfSeries);

		    async.forever = function (fn, callback) {
		        var done = only_once(callback || noop);
		        var task = ensureAsync(fn);
		        function next(err) {
		            if (err) {
		                return done(err);
		            }
		            task(next);
		        }
		        next();
		    };

		    function ensureAsync(fn) {
		        return _restParam(function (args) {
		            var callback = args.pop();
		            args.push(function () {
		                var innerArgs = arguments;
		                if (sync) {
		                    async.setImmediate(function () {
		                        callback.apply(null, innerArgs);
		                    });
		                } else {
		                    callback.apply(null, innerArgs);
		                }
		            });
		            var sync = true;
		            fn.apply(this, args);
		            sync = false;
		        });
		    }

		    async.ensureAsync = ensureAsync;

		    async.constant = _restParam(function (values) {
		        var args = [null].concat(values);
		        return function (callback) {
		            return callback.apply(this, args);
		        };
		    });

		    async.wrapSync = async.asyncify = function asyncify(func) {
		        return _restParam(function (args) {
		            var callback = args.pop();
		            var result;
		            try {
		                result = func.apply(this, args);
		            } catch (e) {
		                return callback(e);
		            }
		            // if result is Promise object
		            if (_isObject(result) && typeof result.then === "function") {
		                result.then(function (value) {
		                    callback(null, value);
		                })["catch"](function (err) {
		                    callback(err.message ? err : new Error(err));
		                });
		            } else {
		                callback(null, result);
		            }
		        });
		    };

		    // Node.js
		    if (( false ? 'undefined' : _typeof(module)) === 'object' && module.exports) {
		        module.exports = async;
		    }
		    // AMD / RequireJS
		    else if (true) {
		            !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = function () {
		                return async;
		            }.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
		        }
		        // included directly via <script> tag
		        else {
		                root.async = async;
		            }
		})();
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18), __webpack_require__(21).setImmediate, __webpack_require__(3), __webpack_require__(48)(module)))

	/***/ },
	/* 318 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var multihashing = __webpack_require__(122);

		exports = module.exports;

		// Hash is the global IPFS hash function. uses multihash SHA2_256, 256 bits
		exports.hash = function (data) {
		  return multihashing(data, 'sha2-256');
		};

	/***/ },
	/* 319 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var Block = __webpack_require__(64);

		// Batch is to defer writes
		module.exports = function () {
		  function Batch(ds, max) {
		    _classCallCheck(this, Batch);

		    if (!ds) {
		      throw Error('Invalid DAG Service');
		    }

		    this.dagService = ds;
		    this.blocks = [];
		    this.size = 0;
		    this.maxSize = max || 0;
		  }

		  _createClass(Batch, [{
		    key: 'add',
		    value: function add(node, cb) {
		      if (!node) {
		        return cb('Node is invalid');
		      }

		      var data = node.encoded();

		      if (!data) {
		        return cb('Node is unencoded');
		      }

		      this.size += data.length;
		      var block = new Block(data);
		      this.blocks.push(block);

		      if (this.size > this.maxSize) {
		        this.commit(cb, block.key);
		      } else {
		        cb(null, block.key);
		      }
		    }
		  }, {
		    key: 'commit',
		    value: function commit(cb, key) {
		      var _this = this;

		      this.dagService.blocks().addBlocks(this.blocks, function (err) {
		        if (err) {
		          return cb(err);
		        }

		        _this.blocks = [];
		        _this.size = 0;
		        cb(null, key);
		      });
		    }
		  }]);

		  return Batch;
		}();

	/***/ },
	/* 320 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		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;
		  };
		}();

		function _classCallCheck(instance, Constructor) {
		  if (!(instance instanceof Constructor)) {
		    throw new TypeError("Cannot call a class as a function");
		  }
		}

		var Block = __webpack_require__(64);
		var isIPFS = __webpack_require__(256);
		var base58 = __webpack_require__(35);

		var DAGNode = __webpack_require__(189);

		module.exports = function () {
		  function DAGService(blockService) {
		    _classCallCheck(this, DAGService);

		    if (!blockService) {
		      throw new Error('DAGService requires a BlockService instance');
		    }

		    this.bs = blockService;
		  }

		  // add a DAGNode to the service, storing it on the block service

		  _createClass(DAGService, [{
		    key: 'add',
		    value: function add(node, callback) {
		      this.bs.addBlock(new Block(node.encoded()), callback);
		    }

		    // DEPRECATED - https://github.com/ipfs/go-ipfs/issues/2262
		    // this.addRecursive

		    // get retrieves a DAGNode, using the Block Service

		  }, {
		    key: 'get',
		    value: function get(multihash, callback) {
		      var isMhash = isIPFS.multihash(multihash);
		      var isPath = isIPFS.path(multihash);

		      if (!isMhash && !isPath) {
		        return callback(new Error('Invalid Key'));
		      }

		      if (isMhash) {
		        this.getWith(multihash, callback);
		      }

		      if (isPath) {
		        var ipfsKey = multihash.replace('/ipfs/', '');
		        this.getWith(ipfsKey, callback);
		      }
		    }
		  }, {
		    key: 'getWith',
		    value: function getWith(key, callback) {
		      var formatted = typeof key === 'string' ? new Buffer(base58.decode(key)) : key;
		      this.bs.getBlock(formatted, function (err, block) {
		        if (err) {
		          return callback(err);
		        }

		        var node = new DAGNode();
		        node.unMarshal(block.data);
		        return callback(null, node);
		      });
		    }

		    // getRecursive fetches a node and all of the nodes on its links recursively
		    // TODO add depth param

		  }, {
		    key: 'getRecursive',
		    value: function getRecursive(multihash, callback, linkStack, nodeStack) {
		      var _this = this;

		      this.get(multihash, function (err, node) {
		        if (err && nodeStack.length > 0) {
		          return callback(new Error('Could not complete the recursive get'), nodeStack);
		        }
		        if (err) {
		          return callback(err);
		        }

		        if (!linkStack) {
		          linkStack = [];
		        }
		        if (!nodeStack) {
		          nodeStack = [];
		        }

		        nodeStack.push(node);

		        var keys = node.links.map(function (link) {
		          return link.hash;
		        });

		        linkStack = linkStack.concat(keys);

		        var next = linkStack.pop();

		        if (next) {
		          _this.getRecursive(next, callback, linkStack, nodeStack);
		        } else {
		          var compare = function compare(hash) {
		            return function (node) {
		              node.multihash().equals(hash);
		            };
		          };

		          var link = void 0;
		          for (var k = 0; k < nodeStack.length; k++) {
		            var current = nodeStack[k];
		            for (var j = 0; j < current.links.length; j++) {
		              link = current.links[j];
		              var index = nodeStack.findIndex(compare(link.hash));
		              if (index !== -1) {
		                link.node = nodeStack[index];
		              }
		            }
		          }
		          return callback(null, nodeStack);
		        }
		      });
		    }

		    // remove deletes a node with given multihash from the blockService

		  }, {
		    key: 'remove',
		    value: function remove(multihash, cb) {
		      if (!multihash) {
		        return cb(new Error('Invalid multihash'));
		      }

		      this.bs.deleteBlock(multihash, cb);
		    }

		    // DEPRECATED - https://github.com/ipfs/go-ipfs/issues/2262
		    // this.removeRecursive = (key, callback) => { }

		  }]);

		  return DAGService;
		}();
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 321 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var bl = __webpack_require__(98);

		exports = module.exports;

		exports.setUp = function (basePath, blobStore, locks) {
		  var store = blobStore(basePath);
		  return {
		    get: function get(callback) {
		      store.createReadStream('config').pipe(bl(function (err, config) {
		        if (err) {
		          return callback(err);
		        }
		        var result = void 0;
		        try {
		          result = JSON.parse(config.toString());
		        } catch (err) {
		          return callback(err);
		        }
		        callback(null, result);
		      }));
		    },

		    set: function set(config, callback) {
		      locks.lock(function (err) {
		        if (err) {
		          return callback(err);
		        }

		        store.createWriteStream('config').once('finish', function () {
		          locks.unlock(callback);
		        }).end(JSON.stringify(config, null, 2));
		      });
		    }
		  };
		};

	/***/ },
	/* 322 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Lock = __webpack_require__(662);
		var stream = __webpack_require__(5);
		var bl = __webpack_require__(98);
		var Block = __webpack_require__(64);

		var PREFIX_LENGTH = 8;

		exports = module.exports;

		function multihashToPath(multihash, extension) {
		  extension = extension || 'data';
		  var filename = multihash.toString('hex') + '.' + extension;
		  var folder = filename.slice(0, PREFIX_LENGTH);
		  var path = folder + '/' + filename;

		  return path;
		}

		exports.setUp = function (basePath, blobStore, locks) {
		  var store = blobStore(basePath + '/blocks');
		  var lock = new Lock();

		  var createReadStream = function createReadStream(multihash, extension) {
		    var path = multihashToPath(multihash, extension);
		    return store.createReadStream(path);
		  };

		  var createWriteStream = function createWriteStream(multihash, extension, cb) {
		    var path = multihashToPath(multihash, extension);
		    var through = stream.PassThrough();

		    lock(path, function (release) {
		      var ws = store.createWriteStream(path, release(cb));
		      through.pipe(ws);
		    });

		    return through;
		  };

		  return {
		    get: function get(key, extension, cb) {
		      if (typeof extension === 'function') {
		        cb = extension;
		        extension = 'data';
		      }

		      if (!key) {
		        return cb(new Error('Invalid key'));
		      }

		      createReadStream(key, extension).pipe(bl(function (err, data) {
		        if (err) {
		          return cb(err);
		        }
		        if (extension === 'data') {
		          extension = 'protobuf';
		        }
		        cb(null, new Block(data, extension));
		      }));
		    },

		    put: function put(block, cb) {
		      if (!block || !block.data) {
		        return cb(new Error('Invalid block'));
		      }

		      var ws = createWriteStream(block.key, block.extension, cb);
		      ws.write(block.data);
		      ws.end();
		    },

		    has: function has(key, extension, cb) {
		      if (typeof extension === 'function') {
		        cb = extension;
		        extension = undefined;
		      }

		      if (!key) {
		        return cb(new Error('Invalid key'));
		      }

		      var path = multihashToPath(key, extension);
		      store.exists(path, cb);
		    },

		    delete: function _delete(key, extension, cb) {
		      if (typeof extension === 'function') {
		        cb = extension;
		        extension = undefined;
		      }

		      if (!key) {
		        return cb(new Error('Invalid key'));
		      }

		      var path = multihashToPath(key, extension);
		      store.remove(path, cb);
		    }
		  };
		};

	/***/ },
	/* 323 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports = module.exports;

		exports.locks = __webpack_require__(325);
		exports.version = __webpack_require__(326);
		exports.config = __webpack_require__(321);
		exports.keys = __webpack_require__(324);
		exports.datastore = __webpack_require__(322);
		// exports.datastoreLegacy = require('./datastore-legacy')
		// exports.logs = require('./logs')

	/***/ },
	/* 324 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		exports = module.exports;

		exports.setUp = function (basePath, blobStore, locks, config) {
		  return {
		    get: function get(callback) {
		      config.get(function (err, config) {
		        if (err) {
		          return callback(err);
		        }
		        callback(null, config.Identity.PrivKey);
		      });
		    }
		  };
		};

	/***/ },
	/* 325 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		exports = module.exports;

		exports.setUp = function (basePath, blobStore) {
		  var store = blobStore(basePath);
		  var lockFile = 'repo.lock';

		  return {
		    lock: function lock(cb) {
		      function createLock() {
		        store.createWriteStream(lockFile).once('finish', function () {
		          cb();
		        }).end();
		      }

		      function doesExist(err, exists) {
		        if (err) {
		          return cb(err);
		        }
		        if (exists) {
		          // default 100ms
		          setTimeout(function () {
		            store.exists(lockFile, doesExist);
		          }, 100);
		          return;
		        }
		        createLock();
		      }

		      store.exists(lockFile, doesExist);
		    },
		    unlock: function unlock(cb) {
		      store.remove(lockFile, function (err) {
		        if (err) {
		          return cb(err);
		        }
		        store.exists(lockFile, function (err, exists) {
		          if (err) {
		            return cb(err);
		          }

		          store.exists(lockFile, function (err, exists) {
		            if (err) {
		              return cb(err);
		            }
		            cb();
		          });
		        });
		      });
		    }
		  };
		};

	/***/ },
	/* 326 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var bl = __webpack_require__(98);

		exports = module.exports;

		exports.setUp = function (basePath, blobStore, locks) {
		  var store = blobStore(basePath);

		  return {
		    exists: function exists(callback) {
		      store.exists('version', callback);
		    },
		    get: function get(callback) {
		      store.createReadStream('version').pipe(bl(function (err, version) {
		        if (err) {
		          return callback(err);
		        }
		        callback(null, version.toString('utf8'));
		      }));
		    },
		    set: function set(value, callback) {
		      locks.lock(function (err) {
		        if (err) {
		          return callback(err);
		        }

		        store.createWriteStream('version').once('finish', function () {
		          locks.unlock(callback);
		        }).end(value);
		      });
		    }
		  };
		};

	/***/ },
	/* 327 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var chunker = __webpack_require__(363);

		exports = module.exports = function (size) {
		  return chunker({ size: size, zeroPadding: false });
		};

	/***/ },
	/* 328 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var _typeof2 = 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; };

		var _typeof = typeof Symbol === "function" && _typeof2(Symbol.iterator) === "symbol" ? function (obj) {
		  return typeof obj === "undefined" ? "undefined" : _typeof2(obj);
		} : function (obj) {
		  return obj && typeof Symbol === "function" && obj.constructor === Symbol ? "symbol" : typeof obj === "undefined" ? "undefined" : _typeof2(obj);
		};

		var debug = __webpack_require__(17);
		var log = debug('exporter');
		log.err = debug('exporter:error');
		var UnixFS = __webpack_require__(133);
		var async = __webpack_require__(330);
		var events = __webpack_require__(7);
		var Readable = __webpack_require__(176).Readable;
		var pathj = __webpack_require__(31);

		exports = module.exports = exporter;

		function exporter(hash, dagService, options, callback) {
		  if (typeof options === 'function') {
		    callback = options;
		    options = {};
		  }

		  var ee = new events.EventEmitter();
		  dagService.get(hash, function (err, fetchedNode) {
		    if (err) {
		      if (callback) {
		        return callback(err);
		      }
		      return;
		    }
		    var data = UnixFS.unmarshal(fetchedNode.data);
		    var type = data.type;
		    if (type === 'directory') {
		      dirExporter(fetchedNode, hash, callback);
		    }
		    if (type === 'file') {
		      fileExporter(fetchedNode, hash, false, callback);
		    }
		  });
		  return ee;

		  function fileExporter(node, name, dir, callback) {
		    var init = void 0;

		    if (typeof dir === 'function') {
		      callback = dir;dir = {};
		    }
		    var rs = new Readable();
		    if (node.links.length === 0) {
		      var _ret = function () {
		        var unmarshaledData = UnixFS.unmarshal(node.data);
		        init = false;
		        rs._read = function () {
		          if (init) {
		            return;
		          }
		          init = true;
		          rs.push(unmarshaledData.data);
		          rs.push(null);
		        };
		        ee.emit('file', { stream: rs, path: name, dir: dir });
		        if (callback) {
		          callback();
		        }
		        return {
		          v: void 0
		        };
		      }();

		      if ((typeof _ret === 'undefined' ? 'undefined' : _typeof(_ret)) === "object") return _ret.v;
		    } else {
		      ee.emit('file', { stream: rs, path: name, dir: dir });
		      init = false;
		      rs._read = function () {
		        if (init) {
		          return;
		        }
		        init = true;
		        async.forEachSeries(node.links, function (link, callback) {
		          dagService.get(link.hash, function (err, res) {
		            if (err) {
		              callback(err);
		            }
		            var unmarshaledData = UnixFS.unmarshal(res.data);
		            rs.push(unmarshaledData.data);
		            callback();
		          });
		        }, function (err) {
		          if (err) {
		            if (callback) {
		              return callback(err);
		            }
		            return;
		          }
		          rs.push(null);
		          if (callback) {
		            callback();
		          }
		          return;
		        });
		      };
		    }
		  }

		  function dirExporter(node, name, callback) {
		    var init = void 0;

		    var rs = new Readable();
		    if (node.links.length === 0) {
		      init = false;
		      rs._read = function () {
		        if (init) {
		          return;
		        }
		        init = true;
		        rs.push(node.data);
		        rs.push(null);
		      };
		      ee.emit('file', { stream: rs, path: name });
		      if (callback) {
		        callback();
		      }
		      return;
		    } else {
		      async.forEachSeries(node.links, function (link, callback) {
		        dagService.get(link.hash, function (err, res) {
		          if (err) {
		            callback(err);
		          }
		          var unmarshaledData = UnixFS.unmarshal(res.data);
		          if (unmarshaledData.type === 'file') {
		            return fileExporter(res, pathj.join(name, link.name), callback);
		          }
		          if (unmarshaledData.type === 'directory') {
		            return dirExporter(res, pathj.join(name, link.name), callback);
		          }
		          callback();
		        });
		      }, function (err) {
		        if (err) {
		          if (callback) {
		            return callback(err);
		          }
		          return;
		        }
		        if (callback) {
		          callback();
		        }
		        return;
		      });
		    }
		  }
		}

	/***/ },
	/* 329 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var _typeof2 = 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; };

		var _typeof = typeof Symbol === "function" && _typeof2(Symbol.iterator) === "symbol" ? function (obj) {
		  return typeof obj === "undefined" ? "undefined" : _typeof2(obj);
		} : function (obj) {
		  return obj && typeof Symbol === "function" && obj.constructor === Symbol ? "symbol" : typeof obj === "undefined" ? "undefined" : _typeof2(obj);
		};

		var debug = __webpack_require__(17);
		var log = debug('importer');
		log.err = debug('importer:error');
		var fsc = __webpack_require__(327);
		var through2 = __webpack_require__(777);
		var merkleDAG = __webpack_require__(333);
		var UnixFS = __webpack_require__(133);
		var util = __webpack_require__(11);
		var bs58 = __webpack_require__(35);
		var Duplex = __webpack_require__(176).Duplex;

		exports = module.exports = Importer;

		var CHUNK_SIZE = 262144;

		util.inherits(Importer, Duplex);

		function Importer(dagService, options) {
		  var _this = this;

		  Duplex.call(this, { objectMode: true });

		  if (!(this instanceof Importer)) {
		    return new Importer(dagService);
		  }

		  if (!dagService) {
		    return new Error('must specify a dagService');
		  }

		  var files = [];
		  var counter = 0;

		  this._read = function (n) {};

		  this._write = function (fl, enc, next) {
		    _this.read();
		    counter++;
		    if (!fl.stream) {
		      var _ret = function () {
		        // 1. create the empty dir dag node
		        // 2. write it to the dag store
		        // 3. add to the files array {path: <>, hash: <>}
		        // 4. emit the path + hash
		        var d = new UnixFS('directory');
		        var n = new merkleDAG.DAGNode();
		        n.data = d.marshal();
		        dagService.add(n, function (err) {
		          if (err) {
		            _this.emit('error', 'Failed to store: ' + fl.path);
		            return;
		          }
		          var el = {
		            path: fl.path,
		            multihash: n.multihash(),
		            size: n.size(),
		            dataSize: d.fileSize()
		          };
		          files.push(el);
		          _this.push(el);
		          counter--;
		          next();
		        });
		        return {
		          v: void 0
		        };
		      }();

		      if ((typeof _ret === 'undefined' ? 'undefined' : _typeof(_ret)) === "object") return _ret.v;
		    }

		    var leaves = [];
		    fl.stream.pipe(fsc(CHUNK_SIZE)).pipe(through2(function (chunk, enc, cb) {
		      // 1. create the unixfs merkledag node
		      // 2. add its hash and size to the leafs array

		      // TODO - Support really large files
		      // a) check if we already reach max chunks if yes
		      // a.1) create a parent node for all of the current leaves
		      // b.2) clean up the leaves array and add just the parent node

		      var l = new UnixFS('file', chunk);
		      var n = new merkleDAG.DAGNode(l.marshal());

		      dagService.add(n, function (err) {
		        if (err) {
		          _this.push({ error: 'Failed to store chunk of: ${fl.path}' });
		          return cb(err);
		        }

		        leaves.push({
		          Hash: n.multihash(),
		          Size: n.size(),
		          leafSize: l.fileSize(),
		          Name: ''
		        });

		        cb();
		      });
		    }, function (cb) {
		      if (leaves.length === 1) {
		        // 1. add to the files array {path: <>, hash: <>}
		        // 2. emit the path + hash

		        var el = {
		          path: fl.path,
		          multihash: leaves[0].Hash,
		          size: leaves[0].Size,
		          dataSize: leaves[0].leafSize
		        };

		        files.push(el);
		        _this.push(el);
		        return done(cb);
		      }
		      // 1. create a parent node and add all the leafs
		      // 2. add to the files array {path: <>, hash: <>}
		      // 3. emit the path + hash of the parent node

		      var f = new UnixFS('file');
		      var n = new merkleDAG.DAGNode();

		      leaves.forEach(function (leaf) {
		        f.addBlockSize(leaf.leafSize);
		        var l = new merkleDAG.DAGLink(leaf.Name, leaf.Size, leaf.Hash);
		        n.addRawLink(l);
		      });

		      n.data = f.marshal();
		      dagService.add(n, function (err) {
		        if (err) {
		          // this.emit('error', `Failed to store: ${fl.path}`)
		          _this.push({ error: 'Failed to store chunk of: ${fl.path}' });
		          return cb();
		        }

		        var el = {
		          path: fl.path,
		          multihash: n.multihash(),
		          size: n.size()
		          // dataSize: f.fileSize()
		        };

		        files.push(el);
		        // this.emit('file', el)
		        _this.push(el);
		        return done(cb);
		      });
		    }));

		    function done(cb) {
		      counter--;
		      next();
		      cb();
		    }
		  };

		  this.end = function () {
		    finish.call(_this);

		    function finish() {
		      var _this2 = this;

		      if (counter > 0) {
		        return setTimeout(function () {
		          finish.call(_this2);
		        }, 200);
		      }
		      // file struct
		      // {
		      //   path: // full path
		      //   multihash: // multihash of the dagNode
		      //   size: // cumulative size
		      //   dataSize: // dagNode size
		      // }

		      // 1) convert files to a tree
		      // for each path, split, add to a json tree and in the end the name of the
		      // file points to an object that is has a key multihash and respective value
		      // { foo: { bar: { baz.txt: <multihash> }}}
		      // the stop condition is if the value is not an object
		      var fileTree = {};
		      files.forEach(function (file) {
		        var splitted = file.path.split('/');
		        if (splitted.length === 1) {
		          return; // adding just one file
		          // fileTree[file.path] = bs58.encode(file.multihash).toString()
		        }
		        if (splitted[0] === '') {
		          splitted = splitted.slice(1);
		        }
		        var tmpTree = fileTree;

		        for (var i = 0; i < splitted.length; i++) {
		          if (!tmpTree[splitted[i]]) {
		            tmpTree[splitted[i]] = {};
		          }
		          if (i === splitted.length - 1) {
		            tmpTree[splitted[i]] = file.multihash;
		          } else {
		            tmpTree = tmpTree[splitted[i]];
		          }
		        }
		      });

		      if (Object.keys(fileTree).length === 0) {
		        this.push(null);
		        return; // no dirs to be created
		      }

		      // 2) create a index for multihash: { size, dataSize } so
		      // that we can fetch these when creating the merkle dag nodes

		      var mhIndex = {};

		      files.forEach(function (file) {
		        mhIndex[bs58.encode(file.multihash)] = {
		          size: file.size,
		          dataSize: file.dataSize
		        };
		      });

		      // 3) expand leaves recursively
		      // create a dirNode
		      // Object.keys
		      // If the value is an Object
		      //   create a dir Node
		      //   Object.keys
		      //   Once finished, add the result as a link to the dir node
		      // If the value is not an object
		      //   add as a link to the dirNode

		      function traverse(tree, base) {
		        var _this3 = this;

		        var keys = Object.keys(tree);
		        var tmpTree = tree;
		        keys.map(function (key) {
		          if (_typeof(tmpTree[key]) === 'object' && !Buffer.isBuffer(tmpTree[key])) {
		            tmpTree[key] = traverse.call(_this3, tmpTree[key], base ? base + '/' + key : key);
		          }
		        });

		        // at this stage, all keys are multihashes
		        // create a dir node
		        // add all the multihashes as links
		        // return this new node multihash

		        var d = new UnixFS('directory');
		        var n = new merkleDAG.DAGNode();

		        keys.forEach(function (key) {
		          var b58mh = bs58.encode(tmpTree[key]);
		          var l = new merkleDAG.DAGLink(key, mhIndex[b58mh].size, tmpTree[key]);
		          n.addRawLink(l);
		        });

		        n.data = d.marshal();
		        dagService.add(n, function (err) {
		          if (err) {
		            _this3.push({ error: 'failed to store dirNode' });
		          }
		        });

		        if (!base) {
		          return;
		        }

		        var el = {
		          path: base,
		          multihash: n.multihash(),
		          size: n.size()
		        };
		        this.push(el);

		        mhIndex[bs58.encode(n.multihash())] = { size: n.size() };
		        return n.multihash();
		      }
		      /* const rootHash = */traverse.call(this, fileTree);
		      this.push(null);
		    }
		  };
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 330 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(global, setImmediate, process, module) {var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;'use strict';

		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; };

		/*!
		 * async
		 * https://github.com/caolan/async
		 *
		 * Copyright 2010-2014 Caolan McMahon
		 * Released under the MIT license
		 */
		(function () {

		    var async = {};
		    function noop() {}
		    function identity(v) {
		        return v;
		    }
		    function toBool(v) {
		        return !!v;
		    }
		    function notId(v) {
		        return !v;
		    }

		    // global on the server, window in the browser
		    var previous_async;

		    // Establish the root object, `window` (`self`) in the browser, `global`
		    // on the server, or `this` in some virtual machines. We use `self`
		    // instead of `window` for `WebWorker` support.
		    var root = (typeof self === 'undefined' ? 'undefined' : _typeof(self)) === 'object' && self.self === self && self || (typeof global === 'undefined' ? 'undefined' : _typeof(global)) === 'object' && global.global === global && global || this;

		    if (root != null) {
		        previous_async = root.async;
		    }

		    async.noConflict = function () {
		        root.async = previous_async;
		        return async;
		    };

		    function only_once(fn) {
		        return function () {
		            if (fn === null) throw new Error("Callback was already called.");
		            fn.apply(this, arguments);
		            fn = null;
		        };
		    }

		    function _once(fn) {
		        return function () {
		            if (fn === null) return;
		            fn.apply(this, arguments);
		            fn = null;
		        };
		    }

		    //// cross-browser compatiblity functions ////

		    var _toString = Object.prototype.toString;

		    var _isArray = Array.isArray || function (obj) {
		        return _toString.call(obj) === '[object Array]';
		    };

		    // Ported from underscore.js isObject
		    var _isObject = function _isObject(obj) {
		        var type = typeof obj === 'undefined' ? 'undefined' : _typeof(obj);
		        return type === 'function' || type === 'object' && !!obj;
		    };

		    function _isArrayLike(arr) {
		        return _isArray(arr) ||
		        // has a positive integer length property
		        typeof arr.length === "number" && arr.length >= 0 && arr.length % 1 === 0;
		    }

		    function _arrayEach(arr, iterator) {
		        var index = -1,
		            length = arr.length;

		        while (++index < length) {
		            iterator(arr[index], index, arr);
		        }
		    }

		    function _map(arr, iterator) {
		        var index = -1,
		            length = arr.length,
		            result = Array(length);

		        while (++index < length) {
		            result[index] = iterator(arr[index], index, arr);
		        }
		        return result;
		    }

		    function _range(count) {
		        return _map(Array(count), function (v, i) {
		            return i;
		        });
		    }

		    function _reduce(arr, iterator, memo) {
		        _arrayEach(arr, function (x, i, a) {
		            memo = iterator(memo, x, i, a);
		        });
		        return memo;
		    }

		    function _forEachOf(object, iterator) {
		        _arrayEach(_keys(object), function (key) {
		            iterator(object[key], key);
		        });
		    }

		    function _indexOf(arr, item) {
		        for (var i = 0; i < arr.length; i++) {
		            if (arr[i] === item) return i;
		        }
		        return -1;
		    }

		    var _keys = Object.keys || function (obj) {
		        var keys = [];
		        for (var k in obj) {
		            if (obj.hasOwnProperty(k)) {
		                keys.push(k);
		            }
		        }
		        return keys;
		    };

		    function _keyIterator(coll) {
		        var i = -1;
		        var len;
		        var keys;
		        if (_isArrayLike(coll)) {
		            len = coll.length;
		            return function next() {
		                i++;
		                return i < len ? i : null;
		            };
		        } else {
		            keys = _keys(coll);
		            len = keys.length;
		            return function next() {
		                i++;
		                return i < len ? keys[i] : null;
		            };
		        }
		    }

		    // Similar to ES6's rest param (http://ariya.ofilabs.com/2013/03/es6-and-rest-parameter.html)
		    // This accumulates the arguments passed into an array, after a given index.
		    // From underscore.js (https://github.com/jashkenas/underscore/pull/2140).
		    function _restParam(func, startIndex) {
		        startIndex = startIndex == null ? func.length - 1 : +startIndex;
		        return function () {
		            var length = Math.max(arguments.length - startIndex, 0);
		            var rest = Array(length);
		            for (var index = 0; index < length; index++) {
		                rest[index] = arguments[index + startIndex];
		            }
		            switch (startIndex) {
		                case 0:
		                    return func.call(this, rest);
		                case 1:
		                    return func.call(this, arguments[0], rest);
		            }
		            // Currently unused but handle cases outside of the switch statement:
		            // var args = Array(startIndex + 1);
		            // for (index = 0; index < startIndex; index++) {
		            //     args[index] = arguments[index];
		            // }
		            // args[startIndex] = rest;
		            // return func.apply(this, args);
		        };
		    }

		    function _withoutIndex(iterator) {
		        return function (value, index, callback) {
		            return iterator(value, callback);
		        };
		    }

		    //// exported async module functions ////

		    //// nextTick implementation with browser-compatible fallback ////

		    // capture the global reference to guard against fakeTimer mocks
		    var _setImmediate = typeof setImmediate === 'function' && setImmediate;

		    var _delay = _setImmediate ? function (fn) {
		        // not a direct alias for IE10 compatibility
		        _setImmediate(fn);
		    } : function (fn) {
		        setTimeout(fn, 0);
		    };

		    if ((typeof process === 'undefined' ? 'undefined' : _typeof(process)) === 'object' && typeof process.nextTick === 'function') {
		        async.nextTick = process.nextTick;
		    } else {
		        async.nextTick = _delay;
		    }
		    async.setImmediate = _setImmediate ? _delay : async.nextTick;

		    async.forEach = async.each = function (arr, iterator, callback) {
		        return async.eachOf(arr, _withoutIndex(iterator), callback);
		    };

		    async.forEachSeries = async.eachSeries = function (arr, iterator, callback) {
		        return async.eachOfSeries(arr, _withoutIndex(iterator), callback);
		    };

		    async.forEachLimit = async.eachLimit = function (arr, limit, iterator, callback) {
		        return _eachOfLimit(limit)(arr, _withoutIndex(iterator), callback);
		    };

		    async.forEachOf = async.eachOf = function (object, iterator, callback) {
		        callback = _once(callback || noop);
		        object = object || [];

		        var iter = _keyIterator(object);
		        var key,
		            completed = 0;

		        while ((key = iter()) != null) {
		            completed += 1;
		            iterator(object[key], key, only_once(done));
		        }

		        if (completed === 0) callback(null);

		        function done(err) {
		            completed--;
		            if (err) {
		                callback(err);
		            }
		            // Check key is null in case iterator isn't exhausted
		            // and done resolved synchronously.
		            else if (key === null && completed <= 0) {
		                    callback(null);
		                }
		        }
		    };

		    async.forEachOfSeries = async.eachOfSeries = function (obj, iterator, callback) {
		        callback = _once(callback || noop);
		        obj = obj || [];
		        var nextKey = _keyIterator(obj);
		        var key = nextKey();
		        function iterate() {
		            var sync = true;
		            if (key === null) {
		                return callback(null);
		            }
		            iterator(obj[key], key, only_once(function (err) {
		                if (err) {
		                    callback(err);
		                } else {
		                    key = nextKey();
		                    if (key === null) {
		                        return callback(null);
		                    } else {
		                        if (sync) {
		                            async.setImmediate(iterate);
		                        } else {
		                            iterate();
		                        }
		                    }
		                }
		            }));
		            sync = false;
		        }
		        iterate();
		    };

		    async.forEachOfLimit = async.eachOfLimit = function (obj, limit, iterator, callback) {
		        _eachOfLimit(limit)(obj, iterator, callback);
		    };

		    function _eachOfLimit(limit) {

		        return function (obj, iterator, callback) {
		            callback = _once(callback || noop);
		            obj = obj || [];
		            var nextKey = _keyIterator(obj);
		            if (limit <= 0) {
		                return callback(null);
		            }
		            var done = false;
		            var running = 0;
		            var errored = false;

		            (function replenish() {
		                if (done && running <= 0) {
		                    return callback(null);
		                }

		                while (running < limit && !errored) {
		                    var key = nextKey();
		                    if (key === null) {
		                        done = true;
		                        if (running <= 0) {
		                            callback(null);
		                        }
		                        return;
		                    }
		                    running += 1;
		                    iterator(obj[key], key, only_once(function (err) {
		                        running -= 1;
		                        if (err) {
		                            callback(err);
		                            errored = true;
		                        } else {
		                            replenish();
		                        }
		                    }));
		                }
		            })();
		        };
		    }

		    function doParallel(fn) {
		        return function (obj, iterator, callback) {
		            return fn(async.eachOf, obj, iterator, callback);
		        };
		    }
		    function doParallelLimit(fn) {
		        return function (obj, limit, iterator, callback) {
		            return fn(_eachOfLimit(limit), obj, iterator, callback);
		        };
		    }
		    function doSeries(fn) {
		        return function (obj, iterator, callback) {
		            return fn(async.eachOfSeries, obj, iterator, callback);
		        };
		    }

		    function _asyncMap(eachfn, arr, iterator, callback) {
		        callback = _once(callback || noop);
		        arr = arr || [];
		        var results = _isArrayLike(arr) ? [] : {};
		        eachfn(arr, function (value, index, callback) {
		            iterator(value, function (err, v) {
		                results[index] = v;
		                callback(err);
		            });
		        }, function (err) {
		            callback(err, results);
		        });
		    }

		    async.map = doParallel(_asyncMap);
		    async.mapSeries = doSeries(_asyncMap);
		    async.mapLimit = doParallelLimit(_asyncMap);

		    // reduce only has a series version, as doing reduce in parallel won't
		    // work in many situations.
		    async.inject = async.foldl = async.reduce = function (arr, memo, iterator, callback) {
		        async.eachOfSeries(arr, function (x, i, callback) {
		            iterator(memo, x, function (err, v) {
		                memo = v;
		                callback(err);
		            });
		        }, function (err) {
		            callback(err, memo);
		        });
		    };

		    async.foldr = async.reduceRight = function (arr, memo, iterator, callback) {
		        var reversed = _map(arr, identity).reverse();
		        async.reduce(reversed, memo, iterator, callback);
		    };

		    async.transform = function (arr, memo, iterator, callback) {
		        if (arguments.length === 3) {
		            callback = iterator;
		            iterator = memo;
		            memo = _isArray(arr) ? [] : {};
		        }

		        async.eachOf(arr, function (v, k, cb) {
		            iterator(memo, v, k, cb);
		        }, function (err) {
		            callback(err, memo);
		        });
		    };

		    function _filter(eachfn, arr, iterator, callback) {
		        var results = [];
		        eachfn(arr, function (x, index, callback) {
		            iterator(x, function (v) {
		                if (v) {
		                    results.push({ index: index, value: x });
		                }
		                callback();
		            });
		        }, function () {
		            callback(_map(results.sort(function (a, b) {
		                return a.index - b.index;
		            }), function (x) {
		                return x.value;
		            }));
		        });
		    }

		    async.select = async.filter = doParallel(_filter);

		    async.selectLimit = async.filterLimit = doParallelLimit(_filter);

		    async.selectSeries = async.filterSeries = doSeries(_filter);

		    function _reject(eachfn, arr, iterator, callback) {
		        _filter(eachfn, arr, function (value, cb) {
		            iterator(value, function (v) {
		                cb(!v);
		            });
		        }, callback);
		    }
		    async.reject = doParallel(_reject);
		    async.rejectLimit = doParallelLimit(_reject);
		    async.rejectSeries = doSeries(_reject);

		    function _createTester(eachfn, check, getResult) {
		        return function (arr, limit, iterator, cb) {
		            function done() {
		                if (cb) cb(getResult(false, void 0));
		            }
		            function iteratee(x, _, callback) {
		                if (!cb) return callback();
		                iterator(x, function (v) {
		                    if (cb && check(v)) {
		                        cb(getResult(true, x));
		                        cb = iterator = false;
		                    }
		                    callback();
		                });
		            }
		            if (arguments.length > 3) {
		                eachfn(arr, limit, iteratee, done);
		            } else {
		                cb = iterator;
		                iterator = limit;
		                eachfn(arr, iteratee, done);
		            }
		        };
		    }

		    async.any = async.some = _createTester(async.eachOf, toBool, identity);

		    async.someLimit = _createTester(async.eachOfLimit, toBool, identity);

		    async.all = async.every = _createTester(async.eachOf, notId, notId);

		    async.everyLimit = _createTester(async.eachOfLimit, notId, notId);

		    function _findGetResult(v, x) {
		        return x;
		    }
		    async.detect = _createTester(async.eachOf, identity, _findGetResult);
		    async.detectSeries = _createTester(async.eachOfSeries, identity, _findGetResult);
		    async.detectLimit = _createTester(async.eachOfLimit, identity, _findGetResult);

		    async.sortBy = function (arr, iterator, callback) {
		        async.map(arr, function (x, callback) {
		            iterator(x, function (err, criteria) {
		                if (err) {
		                    callback(err);
		                } else {
		                    callback(null, { value: x, criteria: criteria });
		                }
		            });
		        }, function (err, results) {
		            if (err) {
		                return callback(err);
		            } else {
		                callback(null, _map(results.sort(comparator), function (x) {
		                    return x.value;
		                }));
		            }
		        });

		        function comparator(left, right) {
		            var a = left.criteria,
		                b = right.criteria;
		            return a < b ? -1 : a > b ? 1 : 0;
		        }
		    };

		    async.auto = function (tasks, concurrency, callback) {
		        if (typeof arguments[1] === 'function') {
		            // concurrency is optional, shift the args.
		            callback = concurrency;
		            concurrency = null;
		        }
		        callback = _once(callback || noop);
		        var keys = _keys(tasks);
		        var remainingTasks = keys.length;
		        if (!remainingTasks) {
		            return callback(null);
		        }
		        if (!concurrency) {
		            concurrency = remainingTasks;
		        }

		        var results = {};
		        var runningTasks = 0;

		        var hasError = false;

		        var listeners = [];
		        function addListener(fn) {
		            listeners.unshift(fn);
		        }
		        function removeListener(fn) {
		            var idx = _indexOf(listeners, fn);
		            if (idx >= 0) listeners.splice(idx, 1);
		        }
		        function taskComplete() {
		            remainingTasks--;
		            _arrayEach(listeners.slice(0), function (fn) {
		                fn();
		            });
		        }

		        addListener(function () {
		            if (!remainingTasks) {
		                callback(null, results);
		            }
		        });

		        _arrayEach(keys, function (k) {
		            if (hasError) return;
		            var task = _isArray(tasks[k]) ? tasks[k] : [tasks[k]];
		            var taskCallback = _restParam(function (err, args) {
		                runningTasks--;
		                if (args.length <= 1) {
		                    args = args[0];
		                }
		                if (err) {
		                    var safeResults = {};
		                    _forEachOf(results, function (val, rkey) {
		                        safeResults[rkey] = val;
		                    });
		                    safeResults[k] = args;
		                    hasError = true;

		                    callback(err, safeResults);
		                } else {
		                    results[k] = args;
		                    async.setImmediate(taskComplete);
		                }
		            });
		            var requires = task.slice(0, task.length - 1);
		            // prevent dead-locks
		            var len = requires.length;
		            var dep;
		            while (len--) {
		                if (!(dep = tasks[requires[len]])) {
		                    throw new Error('Has nonexistent dependency in ' + requires.join(', '));
		                }
		                if (_isArray(dep) && _indexOf(dep, k) >= 0) {
		                    throw new Error('Has cyclic dependencies');
		                }
		            }
		            function ready() {
		                return runningTasks < concurrency && _reduce(requires, function (a, x) {
		                    return a && results.hasOwnProperty(x);
		                }, true) && !results.hasOwnProperty(k);
		            }
		            if (ready()) {
		                runningTasks++;
		                task[task.length - 1](taskCallback, results);
		            } else {
		                addListener(listener);
		            }
		            function listener() {
		                if (ready()) {
		                    runningTasks++;
		                    removeListener(listener);
		                    task[task.length - 1](taskCallback, results);
		                }
		            }
		        });
		    };

		    async.retry = function (times, task, callback) {
		        var DEFAULT_TIMES = 5;
		        var DEFAULT_INTERVAL = 0;

		        var attempts = [];

		        var opts = {
		            times: DEFAULT_TIMES,
		            interval: DEFAULT_INTERVAL
		        };

		        function parseTimes(acc, t) {
		            if (typeof t === 'number') {
		                acc.times = parseInt(t, 10) || DEFAULT_TIMES;
		            } else if ((typeof t === 'undefined' ? 'undefined' : _typeof(t)) === 'object') {
		                acc.times = parseInt(t.times, 10) || DEFAULT_TIMES;
		                acc.interval = parseInt(t.interval, 10) || DEFAULT_INTERVAL;
		            } else {
		                throw new Error('Unsupported argument type for \'times\': ' + (typeof t === 'undefined' ? 'undefined' : _typeof(t)));
		            }
		        }

		        var length = arguments.length;
		        if (length < 1 || length > 3) {
		            throw new Error('Invalid arguments - must be either (task), (task, callback), (times, task) or (times, task, callback)');
		        } else if (length <= 2 && typeof times === 'function') {
		            callback = task;
		            task = times;
		        }
		        if (typeof times !== 'function') {
		            parseTimes(opts, times);
		        }
		        opts.callback = callback;
		        opts.task = task;

		        function wrappedTask(wrappedCallback, wrappedResults) {
		            function retryAttempt(task, finalAttempt) {
		                return function (seriesCallback) {
		                    task(function (err, result) {
		                        seriesCallback(!err || finalAttempt, { err: err, result: result });
		                    }, wrappedResults);
		                };
		            }

		            function retryInterval(interval) {
		                return function (seriesCallback) {
		                    setTimeout(function () {
		                        seriesCallback(null);
		                    }, interval);
		                };
		            }

		            while (opts.times) {

		                var finalAttempt = !(opts.times -= 1);
		                attempts.push(retryAttempt(opts.task, finalAttempt));
		                if (!finalAttempt && opts.interval > 0) {
		                    attempts.push(retryInterval(opts.interval));
		                }
		            }

		            async.series(attempts, function (done, data) {
		                data = data[data.length - 1];
		                (wrappedCallback || opts.callback)(data.err, data.result);
		            });
		        }

		        // If a callback is passed, run this as a controll flow
		        return opts.callback ? wrappedTask() : wrappedTask;
		    };

		    async.waterfall = function (tasks, callback) {
		        callback = _once(callback || noop);
		        if (!_isArray(tasks)) {
		            var err = new Error('First argument to waterfall must be an array of functions');
		            return callback(err);
		        }
		        if (!tasks.length) {
		            return callback();
		        }
		        function wrapIterator(iterator) {
		            return _restParam(function (err, args) {
		                if (err) {
		                    callback.apply(null, [err].concat(args));
		                } else {
		                    var next = iterator.next();
		                    if (next) {
		                        args.push(wrapIterator(next));
		                    } else {
		                        args.push(callback);
		                    }
		                    ensureAsync(iterator).apply(null, args);
		                }
		            });
		        }
		        wrapIterator(async.iterator(tasks))();
		    };

		    function _parallel(eachfn, tasks, callback) {
		        callback = callback || noop;
		        var results = _isArrayLike(tasks) ? [] : {};

		        eachfn(tasks, function (task, key, callback) {
		            task(_restParam(function (err, args) {
		                if (args.length <= 1) {
		                    args = args[0];
		                }
		                results[key] = args;
		                callback(err);
		            }));
		        }, function (err) {
		            callback(err, results);
		        });
		    }

		    async.parallel = function (tasks, callback) {
		        _parallel(async.eachOf, tasks, callback);
		    };

		    async.parallelLimit = function (tasks, limit, callback) {
		        _parallel(_eachOfLimit(limit), tasks, callback);
		    };

		    async.series = function (tasks, callback) {
		        _parallel(async.eachOfSeries, tasks, callback);
		    };

		    async.iterator = function (tasks) {
		        function makeCallback(index) {
		            function fn() {
		                if (tasks.length) {
		                    tasks[index].apply(null, arguments);
		                }
		                return fn.next();
		            }
		            fn.next = function () {
		                return index < tasks.length - 1 ? makeCallback(index + 1) : null;
		            };
		            return fn;
		        }
		        return makeCallback(0);
		    };

		    async.apply = _restParam(function (fn, args) {
		        return _restParam(function (callArgs) {
		            return fn.apply(null, args.concat(callArgs));
		        });
		    });

		    function _concat(eachfn, arr, fn, callback) {
		        var result = [];
		        eachfn(arr, function (x, index, cb) {
		            fn(x, function (err, y) {
		                result = result.concat(y || []);
		                cb(err);
		            });
		        }, function (err) {
		            callback(err, result);
		        });
		    }
		    async.concat = doParallel(_concat);
		    async.concatSeries = doSeries(_concat);

		    async.whilst = function (test, iterator, callback) {
		        callback = callback || noop;
		        if (test()) {
		            var next = _restParam(function (err, args) {
		                if (err) {
		                    callback(err);
		                } else if (test.apply(this, args)) {
		                    iterator(next);
		                } else {
		                    callback.apply(null, [null].concat(args));
		                }
		            });
		            iterator(next);
		        } else {
		            callback(null);
		        }
		    };

		    async.doWhilst = function (iterator, test, callback) {
		        var calls = 0;
		        return async.whilst(function () {
		            return ++calls <= 1 || test.apply(this, arguments);
		        }, iterator, callback);
		    };

		    async.until = function (test, iterator, callback) {
		        return async.whilst(function () {
		            return !test.apply(this, arguments);
		        }, iterator, callback);
		    };

		    async.doUntil = function (iterator, test, callback) {
		        return async.doWhilst(iterator, function () {
		            return !test.apply(this, arguments);
		        }, callback);
		    };

		    async.during = function (test, iterator, callback) {
		        callback = callback || noop;

		        var next = _restParam(function (err, args) {
		            if (err) {
		                callback(err);
		            } else {
		                args.push(check);
		                test.apply(this, args);
		            }
		        });

		        var check = function check(err, truth) {
		            if (err) {
		                callback(err);
		            } else if (truth) {
		                iterator(next);
		            } else {
		                callback(null);
		            }
		        };

		        test(check);
		    };

		    async.doDuring = function (iterator, test, callback) {
		        var calls = 0;
		        async.during(function (next) {
		            if (calls++ < 1) {
		                next(null, true);
		            } else {
		                test.apply(this, arguments);
		            }
		        }, iterator, callback);
		    };

		    function _queue(worker, concurrency, payload) {
		        if (concurrency == null) {
		            concurrency = 1;
		        } else if (concurrency === 0) {
		            throw new Error('Concurrency must not be zero');
		        }
		        function _insert(q, data, pos, callback) {
		            if (callback != null && typeof callback !== "function") {
		                throw new Error("task callback must be a function");
		            }
		            q.started = true;
		            if (!_isArray(data)) {
		                data = [data];
		            }
		            if (data.length === 0 && q.idle()) {
		                // call drain immediately if there are no tasks
		                return async.setImmediate(function () {
		                    q.drain();
		                });
		            }
		            _arrayEach(data, function (task) {
		                var item = {
		                    data: task,
		                    callback: callback || noop
		                };

		                if (pos) {
		                    q.tasks.unshift(item);
		                } else {
		                    q.tasks.push(item);
		                }

		                if (q.tasks.length === q.concurrency) {
		                    q.saturated();
		                }
		            });
		            async.setImmediate(q.process);
		        }
		        function _next(q, tasks) {
		            return function () {
		                workers -= 1;

		                var removed = false;
		                var args = arguments;
		                _arrayEach(tasks, function (task) {
		                    _arrayEach(_workersList, function (worker, index) {
		                        if (worker === task && !removed) {
		                            _workersList.splice(index, 1);
		                            removed = true;
		                        }
		                    });

		                    task.callback.apply(task, args);
		                });
		                if (q.tasks.length + workers === 0) {
		                    q.drain();
		                }
		                q.process();
		            };
		        }

		        var workers = 0;
		        var _workersList = [];
		        var q = {
		            tasks: [],
		            concurrency: concurrency,
		            payload: payload,
		            saturated: noop,
		            empty: noop,
		            drain: noop,
		            started: false,
		            paused: false,
		            push: function push(data, callback) {
		                _insert(q, data, false, callback);
		            },
		            kill: function kill() {
		                q.drain = noop;
		                q.tasks = [];
		            },
		            unshift: function unshift(data, callback) {
		                _insert(q, data, true, callback);
		            },
		            process: function process() {
		                while (!q.paused && workers < q.concurrency && q.tasks.length) {

		                    var tasks = q.payload ? q.tasks.splice(0, q.payload) : q.tasks.splice(0, q.tasks.length);

		                    var data = _map(tasks, function (task) {
		                        return task.data;
		                    });

		                    if (q.tasks.length === 0) {
		                        q.empty();
		                    }
		                    workers += 1;
		                    _workersList.push(tasks[0]);
		                    var cb = only_once(_next(q, tasks));
		                    worker(data, cb);
		                }
		            },
		            length: function length() {
		                return q.tasks.length;
		            },
		            running: function running() {
		                return workers;
		            },
		            workersList: function workersList() {
		                return _workersList;
		            },
		            idle: function idle() {
		                return q.tasks.length + workers === 0;
		            },
		            pause: function pause() {
		                q.paused = true;
		            },
		            resume: function resume() {
		                if (q.paused === false) {
		                    return;
		                }
		                q.paused = false;
		                var resumeCount = Math.min(q.concurrency, q.tasks.length);
		                // Need to call q.process once per concurrent
		                // worker to preserve full concurrency after pause
		                for (var w = 1; w <= resumeCount; w++) {
		                    async.setImmediate(q.process);
		                }
		            }
		        };
		        return q;
		    }

		    async.queue = function (worker, concurrency) {
		        var q = _queue(function (items, cb) {
		            worker(items[0], cb);
		        }, concurrency, 1);

		        return q;
		    };

		    async.priorityQueue = function (worker, concurrency) {

		        function _compareTasks(a, b) {
		            return a.priority - b.priority;
		        }

		        function _binarySearch(sequence, item, compare) {
		            var beg = -1,
		                end = sequence.length - 1;
		            while (beg < end) {
		                var mid = beg + (end - beg + 1 >>> 1);
		                if (compare(item, sequence[mid]) >= 0) {
		                    beg = mid;
		                } else {
		                    end = mid - 1;
		                }
		            }
		            return beg;
		        }

		        function _insert(q, data, priority, callback) {
		            if (callback != null && typeof callback !== "function") {
		                throw new Error("task callback must be a function");
		            }
		            q.started = true;
		            if (!_isArray(data)) {
		                data = [data];
		            }
		            if (data.length === 0) {
		                // call drain immediately if there are no tasks
		                return async.setImmediate(function () {
		                    q.drain();
		                });
		            }
		            _arrayEach(data, function (task) {
		                var item = {
		                    data: task,
		                    priority: priority,
		                    callback: typeof callback === 'function' ? callback : noop
		                };

		                q.tasks.splice(_binarySearch(q.tasks, item, _compareTasks) + 1, 0, item);

		                if (q.tasks.length === q.concurrency) {
		                    q.saturated();
		                }
		                async.setImmediate(q.process);
		            });
		        }

		        // Start with a normal queue
		        var q = async.queue(worker, concurrency);

		        // Override push to accept second parameter representing priority
		        q.push = function (data, priority, callback) {
		            _insert(q, data, priority, callback);
		        };

		        // Remove unshift function
		        delete q.unshift;

		        return q;
		    };

		    async.cargo = function (worker, payload) {
		        return _queue(worker, 1, payload);
		    };

		    function _console_fn(name) {
		        return _restParam(function (fn, args) {
		            fn.apply(null, args.concat([_restParam(function (err, args) {
		                if ((typeof console === 'undefined' ? 'undefined' : _typeof(console)) === 'object') {
		                    if (err) {
		                        if (console.error) {
		                            console.error(err);
		                        }
		                    } else if (console[name]) {
		                        _arrayEach(args, function (x) {
		                            console[name](x);
		                        });
		                    }
		                }
		            })]));
		        });
		    }
		    async.log = _console_fn('log');
		    async.dir = _console_fn('dir');
		    /*async.info = _console_fn('info');
		    async.warn = _console_fn('warn');
		    async.error = _console_fn('error');*/

		    async.memoize = function (fn, hasher) {
		        var memo = {};
		        var queues = {};
		        var has = Object.prototype.hasOwnProperty;
		        hasher = hasher || identity;
		        var memoized = _restParam(function memoized(args) {
		            var callback = args.pop();
		            var key = hasher.apply(null, args);
		            if (has.call(memo, key)) {
		                async.setImmediate(function () {
		                    callback.apply(null, memo[key]);
		                });
		            } else if (has.call(queues, key)) {
		                queues[key].push(callback);
		            } else {
		                queues[key] = [callback];
		                fn.apply(null, args.concat([_restParam(function (args) {
		                    memo[key] = args;
		                    var q = queues[key];
		                    delete queues[key];
		                    for (var i = 0, l = q.length; i < l; i++) {
		                        q[i].apply(null, args);
		                    }
		                })]));
		            }
		        });
		        memoized.memo = memo;
		        memoized.unmemoized = fn;
		        return memoized;
		    };

		    async.unmemoize = function (fn) {
		        return function () {
		            return (fn.unmemoized || fn).apply(null, arguments);
		        };
		    };

		    function _times(mapper) {
		        return function (count, iterator, callback) {
		            mapper(_range(count), iterator, callback);
		        };
		    }

		    async.times = _times(async.map);
		    async.timesSeries = _times(async.mapSeries);
		    async.timesLimit = function (count, limit, iterator, callback) {
		        return async.mapLimit(_range(count), limit, iterator, callback);
		    };

		    async.seq = function () /* functions... */{
		        var fns = arguments;
		        return _restParam(function (args) {
		            var that = this;

		            var callback = args[args.length - 1];
		            if (typeof callback == 'function') {
		                args.pop();
		            } else {
		                callback = noop;
		            }

		            async.reduce(fns, args, function (newargs, fn, cb) {
		                fn.apply(that, newargs.concat([_restParam(function (err, nextargs) {
		                    cb(err, nextargs);
		                })]));
		            }, function (err, results) {
		                callback.apply(that, [err].concat(results));
		            });
		        });
		    };

		    async.compose = function () /* functions... */{
		        return async.seq.apply(null, Array.prototype.reverse.call(arguments));
		    };

		    function _applyEach(eachfn) {
		        return _restParam(function (fns, args) {
		            var go = _restParam(function (args) {
		                var that = this;
		                var callback = args.pop();
		                return eachfn(fns, function (fn, _, cb) {
		                    fn.apply(that, args.concat([cb]));
		                }, callback);
		            });
		            if (args.length) {
		                return go.apply(this, args);
		            } else {
		                return go;
		            }
		        });
		    }

		    async.applyEach = _applyEach(async.eachOf);
		    async.applyEachSeries = _applyEach(async.eachOfSeries);

		    async.forever = function (fn, callback) {
		        var done = only_once(callback || noop);
		        var task = ensureAsync(fn);
		        function next(err) {
		            if (err) {
		                return done(err);
		            }
		            task(next);
		        }
		        next();
		    };

		    function ensureAsync(fn) {
		        return _restParam(function (args) {
		            var callback = args.pop();
		            args.push(function () {
		                var innerArgs = arguments;
		                if (sync) {
		                    async.setImmediate(function () {
		                        callback.apply(null, innerArgs);
		                    });
		                } else {
		                    callback.apply(null, innerArgs);
		                }
		            });
		            var sync = true;
		            fn.apply(this, args);
		            sync = false;
		        });
		    }

		    async.ensureAsync = ensureAsync;

		    async.constant = _restParam(function (values) {
		        var args = [null].concat(values);
		        return function (callback) {
		            return callback.apply(this, args);
		        };
		    });

		    async.wrapSync = async.asyncify = function asyncify(func) {
		        return _restParam(function (args) {
		            var callback = args.pop();
		            var result;
		            try {
		                result = func.apply(this, args);
		            } catch (e) {
		                return callback(e);
		            }
		            // if result is Promise object
		            if (_isObject(result) && typeof result.then === "function") {
		                result.then(function (value) {
		                    callback(null, value);
		                })["catch"](function (err) {
		                    callback(err.message ? err : new Error(err));
		                });
		            } else {
		                callback(null, result);
		            }
		        });
		    };

		    // Node.js
		    if (( false ? 'undefined' : _typeof(module)) === 'object' && module.exports) {
		        module.exports = async;
		    }
		    // AMD / RequireJS
		    else if (true) {
		            !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = function () {
		                return async;
		            }.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
		        }
		        // included directly via <script> tag
		        else {
		                root.async = async;
		            }
		})();
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18), __webpack_require__(21).setImmediate, __webpack_require__(3), __webpack_require__(48)(module)))

	/***/ },
	/* 331 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Block = __webpack_require__(64);

		exports = module.exports = Batch;

		// Batch is to defer writes
		function Batch(ds, max) {
		  var _this = this;

		  if (!ds) {
		    throw Error('Invalid DAG Service');
		  }
		  this.dagService = ds;
		  this.blocks = [];
		  this.size = 0;
		  this.maxSize = max || 0;

		  this.add = function (node, cb) {
		    if (!node) {
		      return cb('Node is invalid');
		    }

		    var data = node.encoded();

		    if (!data) {
		      return cb('Node is unencoded');
		    }
		    _this.size += data.length;
		    var block = new Block(data);
		    _this.blocks.push(block);
		    if (_this.size > _this.maxSize) {
		      _this.commit(cb, block.key);
		    } else {
		      cb(null, block.key);
		    }
		  };
		  this.commit = function (cb, key) {
		    var self = _this;
		    _this.dagService.blocks().addBlocks(_this.blocks, function (err) {
		      if (err) {
		        return cb(err);
		      }
		      self.blocks = [];
		      self.size = 0;
		      cb(null, key);
		    });
		  };
		}

	/***/ },
	/* 332 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var DAGNode = __webpack_require__(132).DAGNode;
		var Block = __webpack_require__(64);
		var isIPFS = __webpack_require__(256);
		var base58 = __webpack_require__(35);

		exports = module.exports = DAGService;

		function DAGService(blockService) {
		  var _this = this;

		  if (!blockService) {
		    throw new Error('DAGService requires a BlockService instance');
		  }

		  this.bs = blockService;

		  // add a DAGNode to the service, storing it on the block service
		  this.add = function (node, callback) {
		    var data = node.encoded();

		    var block = new Block(data);

		    _this.bs.addBlock(block, callback);
		  };

		  // DEPRECATED - https://github.com/ipfs/go-ipfs/issues/2262
		  // this.addRecursive

		  // get retrieves a DAGNode, using the Block Service
		  this.get = function (multihash, callback) {
		    var isMhash = isIPFS.multihash(multihash);
		    var isPath = isIPFS.path(multihash);

		    if (!isMhash && !isPath) {
		      return callback(new Error('Invalid Key'));
		    }

		    if (isMhash) {
		      this.getWith(multihash, callback);
		    }

		    if (isPath) {
		      var ipfsKey = multihash.replace('/ipfs/', '');
		      this.getWith(ipfsKey, callback);
		    }
		  };

		  this.getWith = function (key, callback) {
		    var formatted = typeof key === 'string' ? new Buffer(base58.decode(key)) : key;
		    this.bs.getBlock(formatted, function (err, block) {
		      if (err) {
		        return callback(err);
		      }
		      var node = new DAGNode();
		      node.unMarshal(block.data);
		      return callback(null, node);
		    });
		  };

		  // getRecursive fetches a node and all of the nodes on its links recursively
		  // TODO add depth param
		  this.getRecursive = function (multihash, callback, linkStack, nodeStack) {
		    _this.get(multihash, function (err, node) {
		      if (err && nodeStack.length > 0) {
		        return callback(new Error('Could not complete the recursive get'), nodeStack);
		      }
		      if (err) {
		        return callback(err);
		      }

		      if (!linkStack) {
		        linkStack = [];
		      }
		      if (!nodeStack) {
		        nodeStack = [];
		      }

		      nodeStack.push(node);

		      var keys = [];
		      var link;
		      for (var i = 0; i < node.links.length; i++) {
		        link = node.links[i];
		        keys.push(link.hash);
		      }
		      linkStack = linkStack.concat(keys);

		      var next = linkStack.pop();

		      if (next) {
		        _this.getRecursive(next, callback, linkStack, nodeStack);
		      } else {
		        var compare = function compare(hash) {
		          return function (node) {
		            node.multihash().equals(hash);
		          };
		        };
		        for (var k = 0; k < nodeStack.length; k++) {
		          var current = nodeStack[k];
		          for (var j = 0; j < current.links.length; j++) {
		            link = current.links[j];
		            var index = nodeStack.findIndex(compare(link.hash));
		            if (index !== -1) {
		              link.node = nodeStack[index];
		            }
		          }
		        }
		        return callback(null, nodeStack);
		      }
		    });
		  };

		  // remove deletes a node with given multihash from the blockService
		  this.remove = function (multihash, cb) {
		    if (!multihash) {
		      return cb(new Error('Invalid multihash'));
		    }

		    _this.bs.deleteBlock(multihash, cb);
		  };

		  // DEPRECATED - https://github.com/ipfs/go-ipfs/issues/2262
		  // this.removeRecursive = (key, callback) => { }
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 333 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		exports.DAGNode = __webpack_require__(132).DAGNode;
		exports.DAGLink = __webpack_require__(132).DAGLink;
		exports.DAGService = __webpack_require__(332);
		exports.Batch = __webpack_require__(331);
		exports.util = __webpack_require__(192);

	/***/ },
	/* 334 */
	/***/ function(module, exports) {

		"use strict";
		/** PROMISIFY CALLBACK-STYLE FUNCTIONS TO ES6 PROMISES
		 *
		 * EXAMPLE:
		 * const fn = promisify( (callback) => callback(null, "Hello world!") );
		 * fn((err, str) => console.log(str));
		 * fn().then((str) => console.log(str));
		 * //Both functions, will log 'Hello world!'
		 *
		 * Note: The function you pass, may have any arguments you want, but the latest
		 * have to be the callback, which you will call with: next(err, value)
		 *
		 * @param method: Function/Array/Map = The function(s) to promisify
		 * @param options: Map =
		 *  "context" (default is function): The context which to apply the called function
		 *  "replace" (default is falsy): When passed an array/map, if to replace the original object
		 *
		 * @return: A promise if passed a function, otherwise the object with the promises
		 *
		 * @license: MIT
		 * @version: 1.0.1
		 * @author: Manuel Di Iorio
		 **/

		"use strict";

		var createCallback = function createCallback(method, context) {
		    return function () {
		        var args = Array.prototype.slice.call(arguments);

		        return new Promise(function (solve, reject) {
		            args.push(function (err, val) {
		                if (err) return reject(err);
		                solve(val);
		            });

		            method.apply(context, args);
		        });
		    };
		};

		module.exports = function (methods, options) {
		    options = options || {};
		    var type = Object.prototype.toString.call(methods);

		    if (type === "[object Object]" || type === "[object Array]") {
		        var obj = options.replace ? methods : {};

		        for (var key in methods) {
		            if (methods.hasOwnProperty(key)) obj[key] = createCallback(methods[key]);
		        }return obj;
		    }

		    return createCallback(methods, options.context || methods);
		};

	/***/ },
	/* 335 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var idb = __webpack_require__(643);
		var IPFSRepo = __webpack_require__(191);

		module.exports = function () {
		  return new IPFSRepo('ipfs', { stores: idb });
		};

	/***/ },
	/* 336 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(global) {'use strict';

		var isNode = !global.window;

		module.exports = isNode ? __webpack_require__(337) : __webpack_require__(335);
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 337 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var os = __webpack_require__(264);
		var fs = __webpack_require__(623);
		var IPFSRepo = __webpack_require__(191);
		var path = __webpack_require__(31);

		module.exports = function (dir) {
		  var repoPath = dir || path.join(os.homedir(), '.ipfs');
		  return new IPFSRepo(repoPath, { stores: fs });
		};

	/***/ },
	/* 338 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var BlockService = __webpack_require__(187);
		var mDAG = __webpack_require__(130);
		var DAGService = mDAG.DAGService;
		var PeerBook = __webpack_require__(704);

		var defaultRepo = __webpack_require__(336);

		var goOnline = __webpack_require__(345);
		var goOffline = __webpack_require__(344);
		var isOnline = __webpack_require__(348);
		var load = __webpack_require__(350);
		var version = __webpack_require__(353);
		var id = __webpack_require__(346);
		var repo = __webpack_require__(352);
		var init = __webpack_require__(347);
		var bootstrap = __webpack_require__(341);
		var config = __webpack_require__(342);
		var block = __webpack_require__(340);
		var object = __webpack_require__(351);
		var libp2p = __webpack_require__(349);
		var files = __webpack_require__(343);
		var bitswap = __webpack_require__(339);

		exports = module.exports = IPFS;

		function IPFS(repoInstance) {
		  if (!(this instanceof IPFS)) {
		    throw new Error('Must be instantiated with new');
		  }

		  if (typeof repoInstance === 'string' || repoInstance === undefined) {
		    repoInstance = defaultRepo(repoInstance);
		  }

		  this._repo = repoInstance;
		  this._peerInfoBook = new PeerBook();
		  this._peerInfo = null;
		  this._libp2pNode = null;
		  this._bitswap = null;
		  this._blockS = new BlockService(this._repo);
		  this._dagS = new DAGService(this._blockS);

		  this.goOnline = goOnline(this);
		  this.goOffline = goOffline(this);
		  this.isOnline = isOnline(this);
		  this.load = load(this);
		  this.version = version(this);
		  this.id = id(this);
		  this.repo = repo(this);
		  this.init = init(this);
		  this.bootstrap = bootstrap(this);
		  this.config = config(this);
		  this.block = block(this);
		  this.object = object(this);
		  this.libp2p = libp2p(this);
		  this.files = files(this);
		  this.bitswap = bitswap(this);
		}

	/***/ },
	/* 339 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var bs58 = __webpack_require__(35);

		var OFFLINE_ERROR = __webpack_require__(83).OFFLINE_ERROR;

		function formatWantlist(list) {
		  return Array.from(list).map(function (el) {
		    return bs58.encode(new Buffer(el[0], 'hex'));
		  });
		}

		module.exports = function bitswap(self) {
		  return {
		    wantlist: function wantlist() {
		      if (!self.isOnline()) {
		        throw OFFLINE_ERROR;
		      }

		      var list = self._bitswap.getWantlist();
		      return formatWantlist(list);
		    },
		    stat: function stat() {
		      if (!self.isOnline()) {
		        throw OFFLINE_ERROR;
		      }

		      var stats = self._bitswap.stat();
		      stats.wantlist = formatWantlist(stats.wantlist);
		      stats.peers = stats.peers.map(function (id) {
		        return id.toB58String();
		      });

		      return stats;
		    },
		    unwant: function unwant(key) {
		      if (!self.isOnline()) {
		        throw OFFLINE_ERROR;
		      }

		      // TODO: implement when https://github.com/ipfs/js-ipfs-bitswap/pull/10 is merged
		    }
		  };
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 340 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = function block(self) {
		  return {
		    get: function get(multihash, callback) {
		      self._blockS.getBlock(multihash, callback);
		    },
		    put: function put(block, callback) {
		      self._blockS.addBlock(block, callback);
		    },
		    del: function del(multihash, callback) {
		      self._blockS.deleteBlock(multihash, callback);
		    },
		    stat: function stat(multihash, callback) {
		      self._blockS.getBlock(multihash, function (err, block) {
		        if (err) {
		          return callback(err);
		        }
		        callback(null, {
		          Key: multihash,
		          Size: block.data.length
		        });
		      });
		    }
		  };
		};

	/***/ },
	/* 341 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = function bootstrap(self) {
		  return {
		    list: function list(callback) {
		      self._repo.config.get(function (err, config) {
		        if (err) {
		          return callback(err);
		        }
		        callback(null, config.Bootstrap);
		      });
		    },
		    add: function add(multiaddr, callback) {
		      self._repo.config.get(function (err, config) {
		        if (err) {
		          return callback(err);
		        }
		        config.Bootstrap.push(multiaddr);
		        self._repo.config.set(config, callback);
		      });
		    },
		    rm: function rm(multiaddr, callback) {
		      self._repo.config.get(function (err, config) {
		        if (err) {
		          return callback(err);
		        }

		        config.Bootstrap = config.Bootstrap.filter(function (mh) {
		          if (mh === multiaddr) {
		            return false;
		          } else {
		            return true;
		          }
		        });
		        self._repo.config.set(config, callback);
		      });
		    }
		  };
		};

	/***/ },
	/* 342 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = function config(self) {
		  return {
		    // cli only feature built with show and replace
		    // edit: (callback) => {},
		    replace: function replace(config, callback) {
		      self._repo.config.set(config, callback);
		    },
		    show: function show(callback) {
		      self._repo.config.get(callback);
		    }
		  };
		};

	/***/ },
	/* 343 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Importer = __webpack_require__(131).importer;
		var Exporter = __webpack_require__(131).exporter;
		var UnixFS = __webpack_require__(133);

		module.exports = function files(self) {
		  return {
		    add: function add(arr, callback) {
		      if (typeof arr === 'function') {
		        callback = arr;
		        arr = undefined;
		      }
		      if (callback === undefined) {
		        callback = function noop() {};
		      }
		      if (arr === undefined) {
		        return new Importer(self._dagS);
		      }

		      var i = new Importer(self._dagS);
		      var res = [];

		      i.on('data', function (info) {
		        res.push(info);
		      });

		      i.once('end', function () {
		        callback(null, res);
		      });

		      arr.forEach(function (tuple) {
		        i.write(tuple);
		      });

		      i.end();
		    },
		    cat: function cat(hash, callback) {
		      self._dagS.get(hash, function (err, fetchedNode) {
		        if (err) {
		          return callback(err, null);
		        }
		        var data = UnixFS.unmarshal(fetchedNode.data);
		        if (data.type === 'directory') {
		          callback('This dag node is a directory', null);
		        } else {
		          var exportEvent = Exporter(hash, self._dagS);
		          callback(null, exportEvent);
		        }
		      });
		    },
		    get: function get(hash, callback) {
		      var exportFile = Exporter(hash, self._dagS);
		      callback(null, exportFile);
		    }
		  };
		};

	/***/ },
	/* 344 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = function goOffline(self) {
		  return function (cb) {
		    self._blockS.goOffline();
		    self._bitswap.stop();
		    self.libp2p.stop(cb);
		  };
		};

	/***/ },
	/* 345 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var series = __webpack_require__(736);
		var Bitswap = __webpack_require__(311);

		module.exports = function goOnline(self) {
		  return function (cb) {
		    series([self.load, self.libp2p.start], function (err) {
		      if (err) {
		        return cb(err);
		      }

		      self._bitswap = new Bitswap(self._peerInfo, self._libp2pNode, self._repo.datastore, self._peerInfoBook);
		      self._bitswap.start();
		      self._blockS.goOnline(self._bitswap);
		      cb();
		    });
		  };
		};

	/***/ },
	/* 346 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = function id(self) {
		  return function (opts, callback) {
		    if (typeof opts === 'function') {
		      callback = opts;
		      opts = {};
		    }
		    if (!self._peerInfo) {
		      // because of split second warmup
		      setTimeout(ready, 100);
		    } else {
		      ready();
		    }

		    function ready() {
		      callback(null, {
		        ID: self._peerInfo.id.toB58String(),
		        PublicKey: self._peerInfo.id.pubKey.toString('base64'),
		        Addresses: self._peerInfo.multiaddrs.map(function (ma) {
		          return ma.toString();
		        }).sort(),
		        AgentVersion: 'js-ipfs',
		        ProtocolVersion: '9000'
		      });
		    }
		  };
		};

	/***/ },
	/* 347 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer, global, __dirname) {'use strict';

		var peerId = __webpack_require__(89);
		var BlockService = __webpack_require__(187);
		var DagService = __webpack_require__(130).DAGService;
		var path = __webpack_require__(31);
		var glob = __webpack_require__(250);
		var parallelLimit = __webpack_require__(735);
		var Readable = __webpack_require__(5).Readable;

		var Importer = __webpack_require__(131).importer;

		module.exports = function init(self) {
		  return function (opts, callback) {
		    opts = opts || {};
		    opts.emptyRepo = opts.emptyRepo || false;
		    opts.bits = opts.bits || 2048;

		    // Pre-set config values.
		    var config = JSON.parse(Buffer("ewogICJBZGRyZXNzZXMiOiB7CiAgICAiU3dhcm0iOiBbCiAgICAgICIvaXA0LzAuMC4wLjAvdGNwLzQwMDEiLAogICAgICAiL2lwNi86Oi90Y3AvNDAwMSIKICAgIF0sCiAgICAiQVBJIjogIi9pcDQvMTI3LjAuMC4xL3RjcC81MDAxIiwKICAgICJHYXRld2F5IjogIi9pcDQvMTI3LjAuMC4xL3RjcC84MDgwIgogIH0sCiAgIkRpc2NvdmVyeSI6IHsKICAgICJNRE5TIjogewogICAgICAiRW5hYmxlZCI6IHRydWUsCiAgICAgICJJbnRlcnZhbCI6IDEwCiAgICB9CiAgfSwKICAiTW91bnRzIjogewogICAgIklQRlMiOiAiL2lwZnMiLAogICAgIklQTlMiOiAiL2lwbnMiCiAgfSwKICAiSXBucyI6IHsKICAgICJSZXNvbHZlQ2FjaGVTaXplIjogMTI4CiAgfSwKICAiR2F0ZXdheSI6IHsKICAgICJSb290UmVkaXJlY3QiOiAiIiwKICAgICJXcml0YWJsZSI6IGZhbHNlCiAgfSwKICAiQm9vdHN0cmFwIjogWwogICAgIi9pcDQvMTA0LjEzMS4xMzEuODIvdGNwLzQwMDEvaXBmcy9RbWFDcERNR3ZWMkJHSGVZRVJVRW5SUUF3ZTNOOFN6YlV0ZnNtdnNxUUx1dnVKIiwKICAgICIvaXA0LzEwNC4yMzYuMTc2LjUyL3RjcC80MDAxL2lwZnMvUW1Tb0xuU0djY0Z1WlFKelJhZEhuOTVXMkNyU0ZtWnVUZERXUDhIWGFIY2E5eiIsCiAgICAiL2lwNC8xMDQuMjM2LjE3OS4yNDEvdGNwLzQwMDEvaXBmcy9RbVNvTFBwcHVCdFFTR3dLRFpUMk03M1VMcGp2ZmQzYVo2aGE0b0ZHTDFLckdNIiwKICAgICIvaXA0LzE2Mi4yNDMuMjQ4LjIxMy90Y3AvNDAwMS9pcGZzL1FtU29MdWVSNHhCZVViWTlXWjl4R1VVeHVuYktXY3JORlREQWFkUUptb2NuV20iLAogICAgIi9pcDQvMTI4LjE5OS4yMTkuMTExL3RjcC80MDAxL2lwZnMvUW1Tb0xTYWZUTUJzUEthZFRFZ2FYY3REUVZjcU44OENOTEhYTWtUTndNS1BudSIsCiAgICAiL2lwNC8xMDQuMjM2Ljc2LjQwL3RjcC80MDAxL2lwZnMvUW1Tb0xWNEJibTUxak05QzRnRFlaUTlDeTNVNmFYTUpEQWJ6Z3UyZnphRHM2NCIsCiAgICAiL2lwNC8xNzguNjIuMTU4LjI0Ny90Y3AvNDAwMS9pcGZzL1FtU29MZXIyNjVOUmdTcDJMQTNkUGFleWtpUzFKNkRpZlRDODhmNXVWUUtOQWQiLAogICAgIi9pcDQvMTc4LjYyLjYxLjE4NS90Y3AvNDAwMS9pcGZzL1FtU29MTWVXcUI3WUdWTEpOM3BOTFFwbW1FazM1djZ3WXRzTUdMelNyNVFCVTMiLAogICAgIi9pcDQvMTA0LjIzNi4xNTEuMTIyL3RjcC80MDAxL2lwZnMvUW1Tb0xqdTZtN3hUaDNEdW9rdlQzODg2UVJZcXhBemIxa1NoYWFuSmdXMzZ5eCIKICBdCn0K","base64").toString());

		    // Verify repo does not yet exist.
		    self._repo.exists(function (err, exists) {
		      if (err) {
		        return callback(err);
		      }

		      if (exists === true) {
		        return callback(new Error('repo already exists'));
		      }

		      generateAndSetKeypair();
		    });

		    // Generate peer identity keypair + transform to desired format + add to config.
		    function generateAndSetKeypair() {
		      var keys = peerId.create({
		        bits: opts.bits
		      });
		      config.Identity = {
		        PeerID: keys.toB58String(),
		        PrivKey: keys.privKey.toString('base64')
		      };

		      writeVersion();
		    }

		    function writeVersion() {
		      var version = '3';

		      self._repo.version.set(version, function (err) {
		        if (err) {
		          return callback(err);
		        }

		        writeConfig();
		      });
		    }

		    // Write the config to the repo.
		    function writeConfig() {
		      self._repo.config.set(config, function (err) {
		        if (err) {
		          return callback(err);
		        }

		        addDefaultAssets();
		      });
		    }

		    // Add the default assets to the repo.
		    function addDefaultAssets() {
		      // Skip this step on the browser, or if emptyRepo was supplied.
		      var isNode = !global.window;
		      if (!isNode || opts.emptyRepo) {
		        return doneImport(null);
		      }

		      var blocks = new BlockService(self._repo);
		      var dag = new DagService(blocks);

		      var initDocsPath = path.join(__dirname, '../../init-files/init-docs');

		      var i = new Importer(dag);
		      i.resume();

		      glob(path.join(initDocsPath, '/**/*'), function (err, res) {
		        if (err) {
		          throw err;
		        }
		        var index = __dirname.lastIndexOf('/');
		        parallelLimit(res.map(function (element) {
		          return function (callback) {
		            var addPath = element.substring(index + 1, element.length);
		            if (!fs.statSync(element).isDirectory()) {
		              var rs = new Readable();
		              rs.push(fs.readFileSync(element));
		              rs.push(null);
		              var filePair = { path: addPath, stream: rs };
		              i.write(filePair);
		            }
		            callback();
		          };
		        }), 10, function (err) {
		          if (err) {
		            throw err;
		          }
		          i.end();
		        });
		      });

		      i.once('end', function () {
		        doneImport(null);
		      });

		      function doneImport(err, stat) {
		        if (err) {
		          return callback(err);
		        }

		        // All finished!
		        callback(null, true);
		      }
		    }
		  };
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer, __webpack_require__(18), "/"))

	/***/ },
	/* 348 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = function isOnline(self) {
		  return function () {
		    return self._bitswap && self._libp2pNode;
		  };
		};

	/***/ },
	/* 349 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var peerId = __webpack_require__(89);
		var PeerInfo = __webpack_require__(128);
		var multiaddr = __webpack_require__(120);
		var Libp2pNode = __webpack_require__(654).Node;

		var OFFLINE_ERROR = __webpack_require__(83).OFFLINE_ERROR;

		module.exports = function libp2p(self) {
		  return {
		    start: function start(callback) {
		      self._libp2pNode = new Libp2pNode(self._peerInfo);
		      self._libp2pNode.start(function () {
		        // TODO connect to bootstrap nodes, it will get us more addrs
		        self._peerInfo.multiaddrs.forEach(function (ma) {
		          console.log('Swarm listening on', ma.toString());
		        });
		        callback();
		      });
		    },
		    stop: function stop(callback) {
		      self._libp2pNode.swarm.close(callback);
		    },
		    swarm: {
		      peers: function peers(callback) {
		        if (!self.isOnline()) {
		          return callback(OFFLINE_ERROR);
		        }

		        callback(null, self._peerInfoBook.getAll());
		      },
		      // all the addrs we know
		      addrs: function addrs(callback) {
		        if (!self.isOnline()) {
		          return callback(OFFLINE_ERROR);
		        }
		        // TODO
		        throw new Error('Not implemented');
		      },
		      localAddrs: function localAddrs(callback) {
		        if (!self.isOnline()) {
		          return callback(OFFLINE_ERROR);
		        }

		        callback(null, self._peerInfo.multiaddrs);
		      },
		      connect: function connect(ma, callback) {
		        if (!self.isOnline()) {
		          return callback(OFFLINE_ERROR);
		        }

		        var idStr = ma.toString().match(/\/ipfs\/(.*)/);
		        if (!idStr) {
		          return callback(new Error('invalid multiaddr'));
		        }
		        var id = peerId.createFromB58String(idStr[1]);
		        var peer = new PeerInfo(id);

		        peer.multiaddr.add(multiaddr(ma));

		        self._peerInfoBook.put(peer);

		        self._libp2pNode.swarm.dial(peer, function (err) {
		          callback(err, id);
		        });
		      },
		      disconnect: function disconnect(callback) {
		        if (!self.isOnline()) {
		          return callback(OFFLINE_ERROR);
		        }

		        throw new Error('Not implemented');
		      },
		      filters: function filters() {
		        // TODO
		        throw new Error('Not implemented');
		      }
		    },
		    routing: {},
		    records: {},
		    ping: function ping() {
		      throw new Error('Not implemented');
		    }
		  };
		};

	/***/ },
	/* 350 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var peerId = __webpack_require__(89);
		var PeerInfo = __webpack_require__(128);
		var multiaddr = __webpack_require__(120);

		var utils = __webpack_require__(83);

		module.exports = function load(self) {
		  return function (callback) {
		    utils.ifRepoExists(self._repo, function (err) {
		      if (err) {
		        return callback(err);
		      }

		      self._repo.config.get(function (err, config) {
		        if (err) {
		          return callback(err);
		        }
		        var pid = peerId.createFromPrivKey(config.Identity.PrivKey);
		        self._peerInfo = new PeerInfo(pid);
		        config.Addresses.Swarm.forEach(function (addr) {
		          self._peerInfo.multiaddr.add(multiaddr(addr));
		        });
		        callback();
		      });
		    });
		  };
		};

	/***/ },
	/* 351 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		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; };

		var mDAG = __webpack_require__(130);
		var waterfall = __webpack_require__(737);
		var promisify = __webpack_require__(334);
		var bs58 = __webpack_require__(35);
		var DAGNode = mDAG.DAGNode;
		var DAGLink = mDAG.DAGLink;

		function normalizeMultihash(multihash, enc) {
		  if (typeof multihash === 'string') {
		    if (enc === 'base58') {
		      return multihash;
		    }

		    return new Buffer(multihash, enc);
		  } else if (Buffer.isBuffer(multihash)) {
		    return multihash;
		  } else {
		    throw new Error('unsupported multihash');
		  }
		}

		function parseBuffer(buf, encoding) {
		  switch (encoding) {
		    case 'json':
		      return parseJSONBuffer(buf);
		    case 'protobuf':
		      return parseProtoBuffer(buf);
		    default:
		      throw new Error('unkown encoding: ' + encoding);
		  }
		}

		function parseJSONBuffer(buf) {
		  try {
		    var parsed = JSON.parse(buf.toString());
		    var links = (parsed.Links || []).map(function (link) {
		      return new DAGLink(link.Name, link.Size, new Buffer(bs58.decode(link.Hash)));
		    });
		    return new DAGNode(new Buffer(parsed.Data), links);
		  } catch (err) {
		    throw new Error('failed to parse JSON: ' + err);
		  }
		}

		function parseProtoBuffer(buf) {
		  var node = new DAGNode();
		  node.unMarshal(buf);
		  return node;
		}

		module.exports = function object(self) {
		  function editAndSave(edit) {
		    return function (multihash, options, cb) {
		      if (typeof options === 'function') {
		        cb = options;
		        options = {};
		      }

		      waterfall([function (cb) {
		        return self.object.get(multihash, options, cb);
		      }, function (node, cb) {
		        self._dagS.add(edit(node), function (err) {
		          cb(err, node);
		        });
		      }], function (err, node) {
		        if (err) {
		          return cb(err);
		        }
		        cb(null, node);
		      });
		    };
		  }

		  return {
		    new: promisify(function (cb) {
		      var node = new DAGNode();

		      self._dagS.add(node, function (err) {
		        if (err) {
		          return cb(err);
		        }

		        cb(null, node);
		      });
		    }),

		    put: promisify(function (obj, options, cb) {
		      if (typeof options === 'function') {
		        cb = options;
		        options = {};
		      }

		      var encoding = options.enc;
		      var node = void 0;

		      if (Buffer.isBuffer(obj)) {
		        if (encoding) {
		          try {
		            node = parseBuffer(obj, encoding);
		          } catch (err) {
		            return cb(err);
		          }
		        } else {
		          node = new DAGNode(obj);
		        }
		      } else if (obj.multihash) {
		        // already a dag node
		        node = obj;
		      } else if ((typeof obj === 'undefined' ? 'undefined' : _typeof(obj)) === 'object') {
		        node = new DAGNode(obj.Data, obj.Links);
		      } else {
		        return cb(new Error('obj not recognized'));
		      }

		      self._dagS.add(node, function (err, block) {
		        if (err) {
		          return cb(err);
		        }

		        self.object.get(node.multihash(), cb);
		      });
		    }),

		    get: promisify(function (multihash, options, cb) {
		      if (typeof options === 'function') {
		        cb = options;
		        options = {};
		      }

		      var mh = void 0;

		      try {
		        mh = normalizeMultihash(multihash, options.enc);
		      } catch (err) {
		        return cb(err);
		      }

		      self._dagS.get(mh, cb);
		    }),

		    data: promisify(function (multihash, options, cb) {
		      if (typeof options === 'function') {
		        cb = options;
		        options = {};
		      }

		      self.object.get(multihash, options, function (err, node) {
		        if (err) {
		          return cb(err);
		        }

		        cb(null, node.data);
		      });
		    }),

		    links: promisify(function (multihash, options, cb) {
		      if (typeof options === 'function') {
		        cb = options;
		        options = {};
		      }

		      self.object.get(multihash, options, function (err, node) {
		        if (err) {
		          return cb(err);
		        }

		        cb(null, node.links);
		      });
		    }),

		    stat: promisify(function (multihash, options, cb) {
		      if (typeof options === 'function') {
		        cb = options;
		        options = {};
		      }

		      self.object.get(multihash, options, function (err, node) {
		        if (err) {
		          return cb(err);
		        }

		        var blockSize = node.marshal().length;
		        var linkLength = node.links.reduce(function (a, l) {
		          return a + l.size;
		        }, 0);

		        cb(null, {
		          Hash: node.toJSON().Hash,
		          NumLinks: node.links.length,
		          BlockSize: blockSize,
		          LinksSize: blockSize - node.data.length,
		          DataSize: node.data.length,
		          CumulativeSize: blockSize + linkLength
		        });
		      });
		    }),

		    patch: promisify({
		      addLink: function addLink(multihash, link, options, cb) {
		        editAndSave(function (node) {
		          node.addRawLink(link);
		          return node;
		        })(multihash, options, cb);
		      },
		      rmLink: function rmLink(multihash, linkRef, options, cb) {
		        editAndSave(function (node) {
		          node.links = node.links.filter(function (link) {
		            if (typeof linkRef === 'string') {
		              return link.name !== linkRef;
		            }

		            if (Buffer.isBuffer(linkRef)) {
		              return !link.hash.equals(linkRef);
		            }

		            if (linkRef.name) {
		              return link.name !== linkRef.name;
		            }

		            return !link.hash.equals(linkRef.hash);
		          });
		          return node;
		        })(multihash, options, cb);
		      },
		      appendData: function appendData(multihash, data, options, cb) {
		        editAndSave(function (node) {
		          node.data = Buffer.concat([node.data, data]);
		          return node;
		        })(multihash, options, cb);
		      },
		      setData: function setData(multihash, data, options, cb) {
		        editAndSave(function (node) {
		          node.data = data;
		          return node;
		        })(multihash, options, cb);
		      }
		    })
		  };
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 352 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var utils = __webpack_require__(83);

		module.exports = function repo(self) {
		  return {
		    init: function init(bits, empty, callback) {
		      // 1. check if repo already exists
		    },

		    version: function version(opts, callback) {
		      if (typeof opts === 'function') {
		        callback = opts;
		        opts = {};
		      }

		      utils.ifRepoExists(self._repo, function (err, res) {
		        if (err) {
		          return callback(err);
		        }

		        self._repo.version.get(callback);
		      });
		    },

		    gc: function gc() {},

		    path: function path() {
		      return self._repo.path;
		    }
		  };
		};

	/***/ },
	/* 353 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var utils = __webpack_require__(83);

		module.exports = function version(self) {
		  return function (opts, callback) {
		    if (typeof opts === 'function') {
		      callback = opts;
		      opts = {};
		    }

		    utils.ifRepoExists(self._repo, function (err) {
		      if (err) {
		        return callback(err);
		      }

		      self._repo.config.get(function (err, config) {
		        if (err) {
		          return callback(err);
		        }

		        callback(null, config.Version.Current);
		      });
		    });
		  };
		};

	/***/ },
	/* 354 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global, process) {/**
		 * Copyright (c) 2014, Facebook, Inc.
		 * All rights reserved.
		 *
		 * This source code is licensed under the BSD-style license found in the
		 * https://raw.github.com/facebook/regenerator/master/LICENSE file. An
		 * additional grant of patent rights can be found in the PATENTS file in
		 * the same directory.
		 */

		!(function(global) {
		  "use strict";

		  var hasOwn = Object.prototype.hasOwnProperty;
		  var undefined; // More compressible than void 0.
		  var iteratorSymbol =
		    typeof Symbol === "function" && Symbol.iterator || "@@iterator";

		  var inModule = typeof module === "object";
		  var runtime = global.regeneratorRuntime;
		  if (runtime) {
		    if (inModule) {
		      // If regeneratorRuntime is defined globally and we're in a module,
		      // make the exports object identical to regeneratorRuntime.
		      module.exports = runtime;
		    }
		    // Don't bother evaluating the rest of this file if the runtime was
		    // already defined globally.
		    return;
		  }

		  // Define the runtime globally (as expected by generated code) as either
		  // module.exports (if we're in a module) or a new, empty object.
		  runtime = global.regeneratorRuntime = inModule ? module.exports : {};

		  function wrap(innerFn, outerFn, self, tryLocsList) {
		    // If outerFn provided, then outerFn.prototype instanceof Generator.
		    var generator = Object.create((outerFn || Generator).prototype);
		    var context = new Context(tryLocsList || []);

		    // The ._invoke method unifies the implementations of the .next,
		    // .throw, and .return methods.
		    generator._invoke = makeInvokeMethod(innerFn, self, context);

		    return generator;
		  }
		  runtime.wrap = wrap;

		  // Try/catch helper to minimize deoptimizations. Returns a completion
		  // record like context.tryEntries[i].completion. This interface could
		  // have been (and was previously) designed to take a closure to be
		  // invoked without arguments, but in all the cases we care about we
		  // already have an existing method we want to call, so there's no need
		  // to create a new function object. We can even get away with assuming
		  // the method takes exactly one argument, since that happens to be true
		  // in every case, so we don't have to touch the arguments object. The
		  // only additional allocation required is the completion record, which
		  // has a stable shape and so hopefully should be cheap to allocate.
		  function tryCatch(fn, obj, arg) {
		    try {
		      return { type: "normal", arg: fn.call(obj, arg) };
		    } catch (err) {
		      return { type: "throw", arg: err };
		    }
		  }

		  var GenStateSuspendedStart = "suspendedStart";
		  var GenStateSuspendedYield = "suspendedYield";
		  var GenStateExecuting = "executing";
		  var GenStateCompleted = "completed";

		  // Returning this object from the innerFn has the same effect as
		  // breaking out of the dispatch switch statement.
		  var ContinueSentinel = {};

		  // Dummy constructor functions that we use as the .constructor and
		  // .constructor.prototype properties for functions that return Generator
		  // objects. For full spec compliance, you may wish to configure your
		  // minifier not to mangle the names of these two functions.
		  function Generator() {}
		  function GeneratorFunction() {}
		  function GeneratorFunctionPrototype() {}

		  var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype;
		  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;
		  GeneratorFunctionPrototype.constructor = GeneratorFunction;
		  GeneratorFunction.displayName = "GeneratorFunction";

		  // Helper for defining the .next, .throw, and .return methods of the
		  // Iterator interface in terms of a single ._invoke method.
		  function defineIteratorMethods(prototype) {
		    ["next", "throw", "return"].forEach(function(method) {
		      prototype[method] = function(arg) {
		        return this._invoke(method, arg);
		      };
		    });
		  }

		  runtime.isGeneratorFunction = function(genFun) {
		    var ctor = typeof genFun === "function" && genFun.constructor;
		    return ctor
		      ? ctor === GeneratorFunction ||
		        // For the native GeneratorFunction constructor, the best we can
		        // do is to check its .name property.
		        (ctor.displayName || ctor.name) === "GeneratorFunction"
		      : false;
		  };

		  runtime.mark = function(genFun) {
		    if (Object.setPrototypeOf) {
		      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);
		    } else {
		      genFun.__proto__ = GeneratorFunctionPrototype;
		    }
		    genFun.prototype = Object.create(Gp);
		    return genFun;
		  };

		  // Within the body of any async function, `await x` is transformed to
		  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test
		  // `value instanceof AwaitArgument` to determine if the yielded value is
		  // meant to be awaited. Some may consider the name of this method too
		  // cutesy, but they are curmudgeons.
		  runtime.awrap = function(arg) {
		    return new AwaitArgument(arg);
		  };

		  function AwaitArgument(arg) {
		    this.arg = arg;
		  }

		  function AsyncIterator(generator) {
		    // This invoke function is written in a style that assumes some
		    // calling function (or Promise) will handle exceptions.
		    function invoke(method, arg) {
		      var result = generator[method](arg);
		      var value = result.value;
		      return value instanceof AwaitArgument
		        ? Promise.resolve(value.arg).then(invokeNext, invokeThrow)
		        : Promise.resolve(value).then(function(unwrapped) {
		            // When a yielded Promise is resolved, its final value becomes
		            // the .value of the Promise<{value,done}> result for the
		            // current iteration. If the Promise is rejected, however, the
		            // result for this iteration will be rejected with the same
		            // reason. Note that rejections of yielded Promises are not
		            // thrown back into the generator function, as is the case
		            // when an awaited Promise is rejected. This difference in
		            // behavior between yield and await is important, because it
		            // allows the consumer to decide what to do with the yielded
		            // rejection (swallow it and continue, manually .throw it back
		            // into the generator, abandon iteration, whatever). With
		            // await, by contrast, there is no opportunity to examine the
		            // rejection reason outside the generator function, so the
		            // only option is to throw it from the await expression, and
		            // let the generator function handle the exception.
		            result.value = unwrapped;
		            return result;
		          });
		    }

		    if (typeof process === "object" && process.domain) {
		      invoke = process.domain.bind(invoke);
		    }

		    var invokeNext = invoke.bind(generator, "next");
		    var invokeThrow = invoke.bind(generator, "throw");
		    var invokeReturn = invoke.bind(generator, "return");
		    var previousPromise;

		    function enqueue(method, arg) {
		      function callInvokeWithMethodAndArg() {
		        return invoke(method, arg);
		      }

		      return previousPromise =
		        // If enqueue has been called before, then we want to wait until
		        // all previous Promises have been resolved before calling invoke,
		        // so that results are always delivered in the correct order. If
		        // enqueue has not been called before, then it is important to
		        // call invoke immediately, without waiting on a callback to fire,
		        // so that the async generator function has the opportunity to do
		        // any necessary setup in a predictable way. This predictability
		        // is why the Promise constructor synchronously invokes its
		        // executor callback, and why async functions synchronously
		        // execute code before the first await. Since we implement simple
		        // async functions in terms of async generators, it is especially
		        // important to get this right, even though it requires care.
		        previousPromise ? previousPromise.then(
		          callInvokeWithMethodAndArg,
		          // Avoid propagating failures to Promises returned by later
		          // invocations of the iterator.
		          callInvokeWithMethodAndArg
		        ) : new Promise(function (resolve) {
		          resolve(callInvokeWithMethodAndArg());
		        });
		    }

		    // Define the unified helper method that is used to implement .next,
		    // .throw, and .return (see defineIteratorMethods).
		    this._invoke = enqueue;
		  }

		  defineIteratorMethods(AsyncIterator.prototype);

		  // Note that simple async functions are implemented on top of
		  // AsyncIterator objects; they just return a Promise for the value of
		  // the final result produced by the iterator.
		  runtime.async = function(innerFn, outerFn, self, tryLocsList) {
		    var iter = new AsyncIterator(
		      wrap(innerFn, outerFn, self, tryLocsList)
		    );

		    return runtime.isGeneratorFunction(outerFn)
		      ? iter // If outerFn is a generator, return the full iterator.
		      : iter.next().then(function(result) {
		          return result.done ? result.value : iter.next();
		        });
		  };

		  function makeInvokeMethod(innerFn, self, context) {
		    var state = GenStateSuspendedStart;

		    return function invoke(method, arg) {
		      if (state === GenStateExecuting) {
		        throw new Error("Generator is already running");
		      }

		      if (state === GenStateCompleted) {
		        if (method === "throw") {
		          throw arg;
		        }

		        // Be forgiving, per 25.3.3.3.3 of the spec:
		        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume
		        return doneResult();
		      }

		      while (true) {
		        var delegate = context.delegate;
		        if (delegate) {
		          if (method === "return" ||
		              (method === "throw" && delegate.iterator[method] === undefined)) {
		            // A return or throw (when the delegate iterator has no throw
		            // method) always terminates the yield* loop.
		            context.delegate = null;

		            // If the delegate iterator has a return method, give it a
		            // chance to clean up.
		            var returnMethod = delegate.iterator["return"];
		            if (returnMethod) {
		              var record = tryCatch(returnMethod, delegate.iterator, arg);
		              if (record.type === "throw") {
		                // If the return method threw an exception, let that
		                // exception prevail over the original return or throw.
		                method = "throw";
		                arg = record.arg;
		                continue;
		              }
		            }

		            if (method === "return") {
		              // Continue with the outer return, now that the delegate
		              // iterator has been terminated.
		              continue;
		            }
		          }

		          var record = tryCatch(
		            delegate.iterator[method],
		            delegate.iterator,
		            arg
		          );

		          if (record.type === "throw") {
		            context.delegate = null;

		            // Like returning generator.throw(uncaught), but without the
		            // overhead of an extra function call.
		            method = "throw";
		            arg = record.arg;
		            continue;
		          }

		          // Delegate generator ran and handled its own exceptions so
		          // regardless of what the method was, we continue as if it is
		          // "next" with an undefined arg.
		          method = "next";
		          arg = undefined;

		          var info = record.arg;
		          if (info.done) {
		            context[delegate.resultName] = info.value;
		            context.next = delegate.nextLoc;
		          } else {
		            state = GenStateSuspendedYield;
		            return info;
		          }

		          context.delegate = null;
		        }

		        if (method === "next") {
		          context._sent = arg;

		          if (state === GenStateSuspendedYield) {
		            context.sent = arg;
		          } else {
		            context.sent = undefined;
		          }
		        } else if (method === "throw") {
		          if (state === GenStateSuspendedStart) {
		            state = GenStateCompleted;
		            throw arg;
		          }

		          if (context.dispatchException(arg)) {
		            // If the dispatched exception was caught by a catch block,
		            // then let that catch block handle the exception normally.
		            method = "next";
		            arg = undefined;
		          }

		        } else if (method === "return") {
		          context.abrupt("return", arg);
		        }

		        state = GenStateExecuting;

		        var record = tryCatch(innerFn, self, context);
		        if (record.type === "normal") {
		          // If an exception is thrown from innerFn, we leave state ===
		          // GenStateExecuting and loop back for another invocation.
		          state = context.done
		            ? GenStateCompleted
		            : GenStateSuspendedYield;

		          var info = {
		            value: record.arg,
		            done: context.done
		          };

		          if (record.arg === ContinueSentinel) {
		            if (context.delegate && method === "next") {
		              // Deliberately forget the last sent value so that we don't
		              // accidentally pass it on to the delegate.
		              arg = undefined;
		            }
		          } else {
		            return info;
		          }

		        } else if (record.type === "throw") {
		          state = GenStateCompleted;
		          // Dispatch the exception by looping back around to the
		          // context.dispatchException(arg) call above.
		          method = "throw";
		          arg = record.arg;
		        }
		      }
		    };
		  }

		  // Define Generator.prototype.{next,throw,return} in terms of the
		  // unified ._invoke helper method.
		  defineIteratorMethods(Gp);

		  Gp[iteratorSymbol] = function() {
		    return this;
		  };

		  Gp.toString = function() {
		    return "[object Generator]";
		  };

		  function pushTryEntry(locs) {
		    var entry = { tryLoc: locs[0] };

		    if (1 in locs) {
		      entry.catchLoc = locs[1];
		    }

		    if (2 in locs) {
		      entry.finallyLoc = locs[2];
		      entry.afterLoc = locs[3];
		    }

		    this.tryEntries.push(entry);
		  }

		  function resetTryEntry(entry) {
		    var record = entry.completion || {};
		    record.type = "normal";
		    delete record.arg;
		    entry.completion = record;
		  }

		  function Context(tryLocsList) {
		    // The root entry object (effectively a try statement without a catch
		    // or a finally block) gives us a place to store values thrown from
		    // locations where there is no enclosing try statement.
		    this.tryEntries = [{ tryLoc: "root" }];
		    tryLocsList.forEach(pushTryEntry, this);
		    this.reset(true);
		  }

		  runtime.keys = function(object) {
		    var keys = [];
		    for (var key in object) {
		      keys.push(key);
		    }
		    keys.reverse();

		    // Rather than returning an object with a next method, we keep
		    // things simple and return the next function itself.
		    return function next() {
		      while (keys.length) {
		        var key = keys.pop();
		        if (key in object) {
		          next.value = key;
		          next.done = false;
		          return next;
		        }
		      }

		      // To avoid creating an additional object, we just hang the .value
		      // and .done properties off the next function object itself. This
		      // also ensures that the minifier will not anonymize the function.
		      next.done = true;
		      return next;
		    };
		  };

		  function values(iterable) {
		    if (iterable) {
		      var iteratorMethod = iterable[iteratorSymbol];
		      if (iteratorMethod) {
		        return iteratorMethod.call(iterable);
		      }

		      if (typeof iterable.next === "function") {
		        return iterable;
		      }

		      if (!isNaN(iterable.length)) {
		        var i = -1, next = function next() {
		          while (++i < iterable.length) {
		            if (hasOwn.call(iterable, i)) {
		              next.value = iterable[i];
		              next.done = false;
		              return next;
		            }
		          }

		          next.value = undefined;
		          next.done = true;

		          return next;
		        };

		        return next.next = next;
		      }
		    }

		    // Return an iterator with no values.
		    return { next: doneResult };
		  }
		  runtime.values = values;

		  function doneResult() {
		    return { value: undefined, done: true };
		  }

		  Context.prototype = {
		    constructor: Context,

		    reset: function(skipTempReset) {
		      this.prev = 0;
		      this.next = 0;
		      this.sent = undefined;
		      this.done = false;
		      this.delegate = null;

		      this.tryEntries.forEach(resetTryEntry);

		      if (!skipTempReset) {
		        for (var name in this) {
		          // Not sure about the optimal order of these conditions:
		          if (name.charAt(0) === "t" &&
		              hasOwn.call(this, name) &&
		              !isNaN(+name.slice(1))) {
		            this[name] = undefined;
		          }
		        }
		      }
		    },

		    stop: function() {
		      this.done = true;

		      var rootEntry = this.tryEntries[0];
		      var rootRecord = rootEntry.completion;
		      if (rootRecord.type === "throw") {
		        throw rootRecord.arg;
		      }

		      return this.rval;
		    },

		    dispatchException: function(exception) {
		      if (this.done) {
		        throw exception;
		      }

		      var context = this;
		      function handle(loc, caught) {
		        record.type = "throw";
		        record.arg = exception;
		        context.next = loc;
		        return !!caught;
		      }

		      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
		        var entry = this.tryEntries[i];
		        var record = entry.completion;

		        if (entry.tryLoc === "root") {
		          // Exception thrown outside of any try block that could handle
		          // it, so set the completion value of the entire function to
		          // throw the exception.
		          return handle("end");
		        }

		        if (entry.tryLoc <= this.prev) {
		          var hasCatch = hasOwn.call(entry, "catchLoc");
		          var hasFinally = hasOwn.call(entry, "finallyLoc");

		          if (hasCatch && hasFinally) {
		            if (this.prev < entry.catchLoc) {
		              return handle(entry.catchLoc, true);
		            } else if (this.prev < entry.finallyLoc) {
		              return handle(entry.finallyLoc);
		            }

		          } else if (hasCatch) {
		            if (this.prev < entry.catchLoc) {
		              return handle(entry.catchLoc, true);
		            }

		          } else if (hasFinally) {
		            if (this.prev < entry.finallyLoc) {
		              return handle(entry.finallyLoc);
		            }

		          } else {
		            throw new Error("try statement without catch or finally");
		          }
		        }
		      }
		    },

		    abrupt: function(type, arg) {
		      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
		        var entry = this.tryEntries[i];
		        if (entry.tryLoc <= this.prev &&
		            hasOwn.call(entry, "finallyLoc") &&
		            this.prev < entry.finallyLoc) {
		          var finallyEntry = entry;
		          break;
		        }
		      }

		      if (finallyEntry &&
		          (type === "break" ||
		           type === "continue") &&
		          finallyEntry.tryLoc <= arg &&
		          arg <= finallyEntry.finallyLoc) {
		        // Ignore the finally entry if control is not jumping to a
		        // location outside the try/catch block.
		        finallyEntry = null;
		      }

		      var record = finallyEntry ? finallyEntry.completion : {};
		      record.type = type;
		      record.arg = arg;

		      if (finallyEntry) {
		        this.next = finallyEntry.finallyLoc;
		      } else {
		        this.complete(record);
		      }

		      return ContinueSentinel;
		    },

		    complete: function(record, afterLoc) {
		      if (record.type === "throw") {
		        throw record.arg;
		      }

		      if (record.type === "break" ||
		          record.type === "continue") {
		        this.next = record.arg;
		      } else if (record.type === "return") {
		        this.rval = record.arg;
		        this.next = "end";
		      } else if (record.type === "normal" && afterLoc) {
		        this.next = afterLoc;
		      }
		    },

		    finish: function(finallyLoc) {
		      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
		        var entry = this.tryEntries[i];
		        if (entry.finallyLoc === finallyLoc) {
		          this.complete(entry.completion, entry.afterLoc);
		          resetTryEntry(entry);
		          return ContinueSentinel;
		        }
		      }
		    },

		    "catch": function(tryLoc) {
		      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
		        var entry = this.tryEntries[i];
		        if (entry.tryLoc === tryLoc) {
		          var record = entry.completion;
		          if (record.type === "throw") {
		            var thrown = record.arg;
		            resetTryEntry(entry);
		          }
		          return thrown;
		        }
		      }

		      // The context.catch method must only be called with a location
		      // argument that corresponds to a known catch block.
		      throw new Error("illegal catch attempt");
		    },

		    delegateYield: function(iterable, resultName, nextLoc) {
		      this.delegate = {
		        iterator: values(iterable),
		        resultName: resultName,
		        nextLoc: nextLoc
		      };

		      return ContinueSentinel;
		    }
		  };
		})(
		  // Among the various tricks for obtaining a reference to the global
		  // object, this seems to be the most reliable technique that does not
		  // use indirect eval (which violates Content Security Policy).
		  typeof global === "object" ? global :
		  typeof window === "object" ? window :
		  typeof self === "object" ? self : this
		);

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18), __webpack_require__(3)))

	/***/ },
	/* 355 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = { "default": __webpack_require__(380), __esModule: true };

	/***/ },
	/* 356 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = { "default": __webpack_require__(381), __esModule: true };

	/***/ },
	/* 357 */
	/***/ function(module, exports) {

		module.exports = balanced;
		function balanced(a, b, str) {
		  if (a instanceof RegExp) a = maybeMatch(a, str);
		  if (b instanceof RegExp) b = maybeMatch(b, str);

		  var r = range(a, b, str);

		  return r && {
		    start: r[0],
		    end: r[1],
		    pre: str.slice(0, r[0]),
		    body: str.slice(r[0] + a.length, r[1]),
		    post: str.slice(r[1] + b.length)
		  };
		}

		function maybeMatch(reg, str) {
		  var m = str.match(reg);
		  return m ? m[0] : null;
		}

		balanced.range = range;
		function range(a, b, str) {
		  var begs, beg, left, right, result;
		  var ai = str.indexOf(a);
		  var bi = str.indexOf(b, ai + 1);
		  var i = ai;

		  if (ai >= 0 && bi > 0) {
		    begs = [];
		    left = str.length;

		    while (i < str.length && i >= 0 && ! result) {
		      if (i == ai) {
		        begs.push(i);
		        ai = str.indexOf(a, i + 1);
		      } else if (begs.length == 1) {
		        result = [ begs.pop(), bi ];
		      } else {
		        beg = begs.pop();
		        if (beg < left) {
		          left = beg;
		          right = bi;
		        }

		        bi = str.indexOf(b, i + 1);
		      }

		      i = ai < bi && ai >= 0 ? ai : bi;
		    }

		    if (begs.length) {
		      result = [ left, right ];
		    }
		  }

		  return result;
		}


	/***/ },
	/* 358 */
	/***/ function(module, exports) {

		// base-x encoding
		// Forked from https://github.com/cryptocoinjs/bs58
		// Originally written by Mike Hearn for BitcoinJ
		// Copyright (c) 2011 Google Inc
		// Ported to JavaScript by Stefan Thomas
		// Merged Buffer refactorings from base58-native by Stephen Pair
		// Copyright (c) 2013 BitPay Inc

		module.exports = function base (ALPHABET) {
		  var ALPHABET_MAP = {}
		  var BASE = ALPHABET.length
		  var LEADER = ALPHABET.charAt(0)

		  // pre-compute lookup table
		  for (var i = 0; i < ALPHABET.length; i++) {
		    ALPHABET_MAP[ALPHABET.charAt(i)] = i
		  }

		  function encode (source) {
		    if (source.length === 0) return ''

		    var digits = [0]
		    for (var i = 0; i < source.length; ++i) {
		      for (var j = 0, carry = source[i]; j < digits.length; ++j) {
		        carry += digits[j] << 8
		        digits[j] = carry % BASE
		        carry = (carry / BASE) | 0
		      }

		      while (carry > 0) {
		        digits.push(carry % BASE)
		        carry = (carry / BASE) | 0
		      }
		    }

		    // deal with leading zeros
		    for (var k = 0; source[k] === 0 && k < source.length - 1; ++k) {
		      digits.push(0)
		    }

		    // convert digits to a string
		    for (var ii = 0, jj = digits.length - 1; ii <= jj; ++ii, --jj) {
		      var tmp = ALPHABET[digits[ii]]
		      digits[ii] = ALPHABET[digits[jj]]
		      digits[jj] = tmp
		    }

		    return digits.join('')
		  }

		  function decode (string) {
		    if (string.length === 0) return []

		    var bytes = [0]
		    for (var i = 0; i < string.length; i++) {
		      var value = ALPHABET_MAP[string[i]]
		      if (value === undefined) throw new Error('Non-base' + BASE + ' character')

		      for (var j = 0, carry = value; j < bytes.length; ++j) {
		        carry += bytes[j] * BASE
		        bytes[j] = carry & 0xff
		        carry >>= 8
		      }

		      while (carry > 0) {
		        bytes.push(carry & 0xff)
		        carry >>= 8
		      }
		    }

		    // deal with leading zeros
		    for (var k = 0; string[k] === LEADER && k < string.length - 1; ++k) {
		      bytes.push(0)
		    }

		    return bytes.reverse()
		  }

		  return {
		    encode: encode,
		    decode: decode
		  }
		}


	/***/ },
	/* 359 */
	/***/ function(module, exports) {

		"use strict";
		'use strict'

		exports.toByteArray = toByteArray
		exports.fromByteArray = fromByteArray

		var lookup = []
		var revLookup = []
		var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array

		function init () {
		  var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'
		  for (var i = 0, len = code.length; i < len; ++i) {
		    lookup[i] = code[i]
		    revLookup[code.charCodeAt(i)] = i
		  }

		  revLookup['-'.charCodeAt(0)] = 62
		  revLookup['_'.charCodeAt(0)] = 63
		}

		init()

		function toByteArray (b64) {
		  var i, j, l, tmp, placeHolders, arr
		  var len = b64.length

		  if (len % 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
		  placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0

		  // base64 is 4/3 + up to two characters of the original data
		  arr = new Arr(len * 3 / 4 - placeHolders)

		  // if there are placeholders, only get up to the last complete 4 chars
		  l = placeHolders > 0 ? len - 4 : len

		  var L = 0

		  for (i = 0, j = 0; i < l; i += 4, j += 3) {
		    tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)]
		    arr[L++] = (tmp >> 16) & 0xFF
		    arr[L++] = (tmp >> 8) & 0xFF
		    arr[L++] = tmp & 0xFF
		  }

		  if (placeHolders === 2) {
		    tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4)
		    arr[L++] = tmp & 0xFF
		  } else if (placeHolders === 1) {
		    tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2)
		    arr[L++] = (tmp >> 8) & 0xFF
		    arr[L++] = tmp & 0xFF
		  }

		  return arr
		}

		function tripletToBase64 (num) {
		  return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F]
		}

		function encodeChunk (uint8, start, end) {
		  var tmp
		  var output = []
		  for (var i = start; i < end; i += 3) {
		    tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2])
		    output.push(tripletToBase64(tmp))
		  }
		  return output.join('')
		}

		function fromByteArray (uint8) {
		  var tmp
		  var len = uint8.length
		  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes
		  var output = ''
		  var parts = []
		  var maxChunkLength = 16383 // must be multiple of 3

		  // go through the array every three bytes, we'll deal with trailing stuff later
		  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
		    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))
		  }

		  // pad the end with zeros, but make sure to not forget the extra bytes
		  if (extraBytes === 1) {
		    tmp = uint8[len - 1]
		    output += lookup[tmp >> 2]
		    output += lookup[(tmp << 4) & 0x3F]
		    output += '=='
		  } else if (extraBytes === 2) {
		    tmp = (uint8[len - 2] << 8) + (uint8[len - 1])
		    output += lookup[tmp >> 10]
		    output += lookup[(tmp >> 4) & 0x3F]
		    output += lookup[(tmp << 2) & 0x3F]
		    output += '='
		  }

		  parts.push(output)

		  return parts.join('')
		}


	/***/ },
	/* 360 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(84)


	/***/ },
	/* 361 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(786);
		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__(84);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(84);

		  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__(14).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__(3)))

	/***/ },
	/* 362 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(84);

		  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__(84);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 363 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var inherits = __webpack_require__(2);
		var Transform = __webpack_require__(365).Transform;
		var defined = __webpack_require__(592);

		module.exports = Block;
		inherits(Block, Transform);

		function Block (size, opts) {
		    if (!(this instanceof Block)) return new Block(size, opts);
		    Transform.call(this);
		    if (!opts) opts = {};
		    if (typeof size === 'object') {
		        opts = size;
		        size = opts.size;
		    }
		    this.size = size || 512;
		    
		    if (opts.nopad) this._zeroPadding = false;
		    else this._zeroPadding = defined(opts.zeroPadding, true);
		    
		    this._buffered = [];
		    this._bufferedBytes = 0;
		}

		Block.prototype._transform = function (buf, enc, next) {
		    this._bufferedBytes += buf.length;
		    this._buffered.push(buf);
		    
		    while (this._bufferedBytes >= this.size) {
		        var b = Buffer.concat(this._buffered);
		        this._bufferedBytes -= this.size;
		        this.push(b.slice(0, this.size));
		        this._buffered = [ b.slice(this.size, b.length) ];
		    }
		    next();
		};

		Block.prototype._flush = function () {
		    if (this._bufferedBytes && this._zeroPadding) {
		        var zeroes = new Buffer(this.size - this._bufferedBytes);
		        zeroes.fill(0);
		        this._buffered.push(zeroes);
		        this.push(Buffer.concat(this._buffered));
		        this._buffered = null;
		    }
		    else if (this._bufferedBytes) {
		        this.push(Buffer.concat(this._buffered));
		        this._buffered = null;
		    }
		    this.push(null);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 364 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(194);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 365 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(193);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(195);
		exports.Duplex = __webpack_require__(65);
		exports.Transform = __webpack_require__(194);
		exports.PassThrough = __webpack_require__(364);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 366 */
	/***/ function(module, exports, __webpack_require__) {

		var concatMap = __webpack_require__(378);
		var balanced = __webpack_require__(357);

		module.exports = expandTop;

		var escSlash = '\0SLASH'+Math.random()+'\0';
		var escOpen = '\0OPEN'+Math.random()+'\0';
		var escClose = '\0CLOSE'+Math.random()+'\0';
		var escComma = '\0COMMA'+Math.random()+'\0';
		var escPeriod = '\0PERIOD'+Math.random()+'\0';

		function numeric(str) {
		  return parseInt(str, 10) == str
		    ? parseInt(str, 10)
		    : str.charCodeAt(0);
		}

		function escapeBraces(str) {
		  return str.split('\\\\').join(escSlash)
		            .split('\\{').join(escOpen)
		            .split('\\}').join(escClose)
		            .split('\\,').join(escComma)
		            .split('\\.').join(escPeriod);
		}

		function unescapeBraces(str) {
		  return str.split(escSlash).join('\\')
		            .split(escOpen).join('{')
		            .split(escClose).join('}')
		            .split(escComma).join(',')
		            .split(escPeriod).join('.');
		}


		// Basically just str.split(","), but handling cases
		// where we have nested braced sections, which should be
		// treated as individual members, like {a,{b,c},d}
		function parseCommaParts(str) {
		  if (!str)
		    return [''];

		  var parts = [];
		  var m = balanced('{', '}', str);

		  if (!m)
		    return str.split(',');

		  var pre = m.pre;
		  var body = m.body;
		  var post = m.post;
		  var p = pre.split(',');

		  p[p.length-1] += '{' + body + '}';
		  var postParts = parseCommaParts(post);
		  if (post.length) {
		    p[p.length-1] += postParts.shift();
		    p.push.apply(p, postParts);
		  }

		  parts.push.apply(parts, p);

		  return parts;
		}

		function expandTop(str) {
		  if (!str)
		    return [];

		  return expand(escapeBraces(str), true).map(unescapeBraces);
		}

		function identity(e) {
		  return e;
		}

		function embrace(str) {
		  return '{' + str + '}';
		}
		function isPadded(el) {
		  return /^-?0\d/.test(el);
		}

		function lte(i, y) {
		  return i <= y;
		}
		function gte(i, y) {
		  return i >= y;
		}

		function expand(str, isTop) {
		  var expansions = [];

		  var m = balanced('{', '}', str);
		  if (!m || /\$$/.test(m.pre)) return [str];

		  var isNumericSequence = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(m.body);
		  var isAlphaSequence = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(m.body);
		  var isSequence = isNumericSequence || isAlphaSequence;
		  var isOptions = /^(.*,)+(.+)?$/.test(m.body);
		  if (!isSequence && !isOptions) {
		    // {a},b}
		    if (m.post.match(/,.*\}/)) {
		      str = m.pre + '{' + m.body + escClose + m.post;
		      return expand(str);
		    }
		    return [str];
		  }

		  var n;
		  if (isSequence) {
		    n = m.body.split(/\.\./);
		  } else {
		    n = parseCommaParts(m.body);
		    if (n.length === 1) {
		      // x{{a,b}}y ==> x{a}y x{b}y
		      n = expand(n[0], false).map(embrace);
		      if (n.length === 1) {
		        var post = m.post.length
		          ? expand(m.post, false)
		          : [''];
		        return post.map(function(p) {
		          return m.pre + n[0] + p;
		        });
		      }
		    }
		  }

		  // at this point, n is the parts, and we know it's not a comma set
		  // with a single entry.

		  // no need to expand pre, since it is guaranteed to be free of brace-sets
		  var pre = m.pre;
		  var post = m.post.length
		    ? expand(m.post, false)
		    : [''];

		  var N;

		  if (isSequence) {
		    var x = numeric(n[0]);
		    var y = numeric(n[1]);
		    var width = Math.max(n[0].length, n[1].length)
		    var incr = n.length == 3
		      ? Math.abs(numeric(n[2]))
		      : 1;
		    var test = lte;
		    var reverse = y < x;
		    if (reverse) {
		      incr *= -1;
		      test = gte;
		    }
		    var pad = n.some(isPadded);

		    N = [];

		    for (var i = x; test(i, y); i += incr) {
		      var c;
		      if (isAlphaSequence) {
		        c = String.fromCharCode(i);
		        if (c === '\\')
		          c = '';
		      } else {
		        c = String(i);
		        if (pad) {
		          var need = width - c.length;
		          if (need > 0) {
		            var z = new Array(need + 1).join('0');
		            if (i < 0)
		              c = '-' + z + c.slice(1);
		            else
		              c = z + c;
		          }
		        }
		      }
		      N.push(c);
		    }
		  } else {
		    N = concatMap(n, function(el) { return expand(el, false) });
		  }

		  for (var j = 0; j < N.length; j++) {
		    for (var k = 0; k < post.length; k++) {
		      var expansion = pre + N[j] + post[k];
		      if (!isTop || isSequence || expansion)
		        expansions.push(expansion);
		    }
		  }

		  return expansions;
		}



	/***/ },
	/* 367 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var aes = __webpack_require__(99)
		var Transform = __webpack_require__(66)
		var inherits = __webpack_require__(2)
		var modes = __webpack_require__(100)
		var StreamCipher = __webpack_require__(204)
		var AuthCipher = __webpack_require__(197)
		var ebtk = __webpack_require__(116)

		inherits(Decipher, Transform)
		function Decipher (mode, key, iv) {
		  if (!(this instanceof Decipher)) {
		    return new Decipher(mode, key, iv)
		  }
		  Transform.call(this)
		  this._cache = new Splitter()
		  this._last = void 0
		  this._cipher = new aes.AES(key)
		  this._prev = new Buffer(iv.length)
		  iv.copy(this._prev)
		  this._mode = mode
		  this._autopadding = true
		}
		Decipher.prototype._update = function (data) {
		  this._cache.add(data)
		  var chunk
		  var thing
		  var out = []
		  while ((chunk = this._cache.get(this._autopadding))) {
		    thing = this._mode.decrypt(this, chunk)
		    out.push(thing)
		  }
		  return Buffer.concat(out)
		}
		Decipher.prototype._final = function () {
		  var chunk = this._cache.flush()
		  if (this._autopadding) {
		    return unpad(this._mode.decrypt(this, chunk))
		  } else if (chunk) {
		    throw new Error('data not multiple of block length')
		  }
		}
		Decipher.prototype.setAutoPadding = function (setTo) {
		  this._autopadding = !!setTo
		  return this
		}
		function Splitter () {
		  if (!(this instanceof Splitter)) {
		    return new Splitter()
		  }
		  this.cache = new Buffer('')
		}
		Splitter.prototype.add = function (data) {
		  this.cache = Buffer.concat([this.cache, data])
		}

		Splitter.prototype.get = function (autoPadding) {
		  var out
		  if (autoPadding) {
		    if (this.cache.length > 16) {
		      out = this.cache.slice(0, 16)
		      this.cache = this.cache.slice(16)
		      return out
		    }
		  } else {
		    if (this.cache.length >= 16) {
		      out = this.cache.slice(0, 16)
		      this.cache = this.cache.slice(16)
		      return out
		    }
		  }
		  return null
		}
		Splitter.prototype.flush = function () {
		  if (this.cache.length) {
		    return this.cache
		  }
		}
		function unpad (last) {
		  var padded = last[15]
		  var i = -1
		  while (++i < padded) {
		    if (last[(i + (16 - padded))] !== padded) {
		      throw new Error('unable to decrypt data')
		    }
		  }
		  if (padded === 16) {
		    return
		  }
		  return last.slice(0, 16 - padded)
		}

		var modelist = {
		  ECB: __webpack_require__(202),
		  CBC: __webpack_require__(198),
		  CFB: __webpack_require__(199),
		  CFB8: __webpack_require__(201),
		  CFB1: __webpack_require__(200),
		  OFB: __webpack_require__(203),
		  CTR: __webpack_require__(101),
		  GCM: __webpack_require__(101)
		}

		function createDecipheriv (suite, password, iv) {
		  var config = modes[suite.toLowerCase()]
		  if (!config) {
		    throw new TypeError('invalid suite type')
		  }
		  if (typeof iv === 'string') {
		    iv = new Buffer(iv)
		  }
		  if (typeof password === 'string') {
		    password = new Buffer(password)
		  }
		  if (password.length !== config.key / 8) {
		    throw new TypeError('invalid key length ' + password.length)
		  }
		  if (iv.length !== config.iv) {
		    throw new TypeError('invalid iv length ' + iv.length)
		  }
		  if (config.type === 'stream') {
		    return new StreamCipher(modelist[config.mode], password, iv, true)
		  } else if (config.type === 'auth') {
		    return new AuthCipher(modelist[config.mode], password, iv, true)
		  }
		  return new Decipher(modelist[config.mode], password, iv)
		}

		function createDecipher (suite, password) {
		  var config = modes[suite.toLowerCase()]
		  if (!config) {
		    throw new TypeError('invalid suite type')
		  }
		  var keys = ebtk(password, false, config.key, config.iv)
		  return createDecipheriv(suite, keys.key, keys.iv)
		}
		exports.createDecipher = createDecipher
		exports.createDecipheriv = createDecipheriv

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 368 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var aes = __webpack_require__(99)
		var Transform = __webpack_require__(66)
		var inherits = __webpack_require__(2)
		var modes = __webpack_require__(100)
		var ebtk = __webpack_require__(116)
		var StreamCipher = __webpack_require__(204)
		var AuthCipher = __webpack_require__(197)
		inherits(Cipher, Transform)
		function Cipher (mode, key, iv) {
		  if (!(this instanceof Cipher)) {
		    return new Cipher(mode, key, iv)
		  }
		  Transform.call(this)
		  this._cache = new Splitter()
		  this._cipher = new aes.AES(key)
		  this._prev = new Buffer(iv.length)
		  iv.copy(this._prev)
		  this._mode = mode
		  this._autopadding = true
		}
		Cipher.prototype._update = function (data) {
		  this._cache.add(data)
		  var chunk
		  var thing
		  var out = []
		  while ((chunk = this._cache.get())) {
		    thing = this._mode.encrypt(this, chunk)
		    out.push(thing)
		  }
		  return Buffer.concat(out)
		}
		Cipher.prototype._final = function () {
		  var chunk = this._cache.flush()
		  if (this._autopadding) {
		    chunk = this._mode.encrypt(this, chunk)
		    this._cipher.scrub()
		    return chunk
		  } else if (chunk.toString('hex') !== '10101010101010101010101010101010') {
		    this._cipher.scrub()
		    throw new Error('data not multiple of block length')
		  }
		}
		Cipher.prototype.setAutoPadding = function (setTo) {
		  this._autopadding = !!setTo
		  return this
		}

		function Splitter () {
		  if (!(this instanceof Splitter)) {
		    return new Splitter()
		  }
		  this.cache = new Buffer('')
		}
		Splitter.prototype.add = function (data) {
		  this.cache = Buffer.concat([this.cache, data])
		}

		Splitter.prototype.get = function () {
		  if (this.cache.length > 15) {
		    var out = this.cache.slice(0, 16)
		    this.cache = this.cache.slice(16)
		    return out
		  }
		  return null
		}
		Splitter.prototype.flush = function () {
		  var len = 16 - this.cache.length
		  var padBuff = new Buffer(len)

		  var i = -1
		  while (++i < len) {
		    padBuff.writeUInt8(len, i)
		  }
		  var out = Buffer.concat([this.cache, padBuff])
		  return out
		}
		var modelist = {
		  ECB: __webpack_require__(202),
		  CBC: __webpack_require__(198),
		  CFB: __webpack_require__(199),
		  CFB8: __webpack_require__(201),
		  CFB1: __webpack_require__(200),
		  OFB: __webpack_require__(203),
		  CTR: __webpack_require__(101),
		  GCM: __webpack_require__(101)
		}

		function createCipheriv (suite, password, iv) {
		  var config = modes[suite.toLowerCase()]
		  if (!config) {
		    throw new TypeError('invalid suite type')
		  }
		  if (typeof iv === 'string') {
		    iv = new Buffer(iv)
		  }
		  if (typeof password === 'string') {
		    password = new Buffer(password)
		  }
		  if (password.length !== config.key / 8) {
		    throw new TypeError('invalid key length ' + password.length)
		  }
		  if (iv.length !== config.iv) {
		    throw new TypeError('invalid iv length ' + iv.length)
		  }
		  if (config.type === 'stream') {
		    return new StreamCipher(modelist[config.mode], password, iv)
		  } else if (config.type === 'auth') {
		    return new AuthCipher(modelist[config.mode], password, iv)
		  }
		  return new Cipher(modelist[config.mode], password, iv)
		}
		function createCipher (suite, password) {
		  var config = modes[suite.toLowerCase()]
		  if (!config) {
		    throw new TypeError('invalid suite type')
		  }
		  var keys = ebtk(password, false, config.key, config.iv)
		  return createCipheriv(suite, keys.key, keys.iv)
		}

		exports.createCipheriv = createCipheriv
		exports.createCipher = createCipher

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 369 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var zeros = new Buffer(16)
		zeros.fill(0)
		module.exports = GHASH
		function GHASH (key) {
		  this.h = key
		  this.state = new Buffer(16)
		  this.state.fill(0)
		  this.cache = new Buffer('')
		}
		// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html
		// by Juho Vähä-Herttua
		GHASH.prototype.ghash = function (block) {
		  var i = -1
		  while (++i < block.length) {
		    this.state[i] ^= block[i]
		  }
		  this._multiply()
		}

		GHASH.prototype._multiply = function () {
		  var Vi = toArray(this.h)
		  var Zi = [0, 0, 0, 0]
		  var j, xi, lsb_Vi
		  var i = -1
		  while (++i < 128) {
		    xi = (this.state[~~(i / 8)] & (1 << (7 - i % 8))) !== 0
		    if (xi) {
		      // Z_i+1 = Z_i ^ V_i
		      Zi = xor(Zi, Vi)
		    }

		    // Store the value of LSB(V_i)
		    lsb_Vi = (Vi[3] & 1) !== 0

		    // V_i+1 = V_i >> 1
		    for (j = 3; j > 0; j--) {
		      Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31)
		    }
		    Vi[0] = Vi[0] >>> 1

		    // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R
		    if (lsb_Vi) {
		      Vi[0] = Vi[0] ^ (0xe1 << 24)
		    }
		  }
		  this.state = fromArray(Zi)
		}
		GHASH.prototype.update = function (buf) {
		  this.cache = Buffer.concat([this.cache, buf])
		  var chunk
		  while (this.cache.length >= 16) {
		    chunk = this.cache.slice(0, 16)
		    this.cache = this.cache.slice(16)
		    this.ghash(chunk)
		  }
		}
		GHASH.prototype.final = function (abl, bl) {
		  if (this.cache.length) {
		    this.ghash(Buffer.concat([this.cache, zeros], 16))
		  }
		  this.ghash(fromArray([
		    0, abl,
		    0, bl
		  ]))
		  return this.state
		}

		function toArray (buf) {
		  return [
		    buf.readUInt32BE(0),
		    buf.readUInt32BE(4),
		    buf.readUInt32BE(8),
		    buf.readUInt32BE(12)
		  ]
		}
		function fromArray (out) {
		  out = out.map(fixup_uint32)
		  var buf = new Buffer(16)
		  buf.writeUInt32BE(out[0], 0)
		  buf.writeUInt32BE(out[1], 4)
		  buf.writeUInt32BE(out[2], 8)
		  buf.writeUInt32BE(out[3], 12)
		  return buf
		}
		var uint_max = Math.pow(2, 32)
		function fixup_uint32 (x) {
		  var ret, x_pos
		  ret = x > uint_max || x < 0 ? (x_pos = Math.abs(x) % uint_max, x < 0 ? uint_max - x_pos : x_pos) : x
		  return ret
		}
		function xor (a, b) {
		  return [
		    a[0] ^ b[0],
		    a[1] ^ b[1],
		    a[2] ^ b[2],
		    a[3] ^ b[3]
		  ]
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 370 */
	/***/ function(module, exports, __webpack_require__) {

		var ebtk = __webpack_require__(116)
		var aes = __webpack_require__(134)
		var DES = __webpack_require__(371)
		var desModes = __webpack_require__(372)
		var aesModes = __webpack_require__(100)
		function createCipher (suite, password) {
		  var keyLen, ivLen
		  suite = suite.toLowerCase()
		  if (aesModes[suite]) {
		    keyLen = aesModes[suite].key
		    ivLen = aesModes[suite].iv
		  } else if (desModes[suite]) {
		    keyLen = desModes[suite].key * 8
		    ivLen = desModes[suite].iv
		  } else {
		    throw new TypeError('invalid suite type')
		  }
		  var keys = ebtk(password, false, keyLen, ivLen)
		  return createCipheriv(suite, keys.key, keys.iv)
		}
		function createDecipher (suite, password) {
		  var keyLen, ivLen
		  suite = suite.toLowerCase()
		  if (aesModes[suite]) {
		    keyLen = aesModes[suite].key
		    ivLen = aesModes[suite].iv
		  } else if (desModes[suite]) {
		    keyLen = desModes[suite].key * 8
		    ivLen = desModes[suite].iv
		  } else {
		    throw new TypeError('invalid suite type')
		  }
		  var keys = ebtk(password, false, keyLen, ivLen)
		  return createDecipheriv(suite, keys.key, keys.iv)
		}

		function createCipheriv (suite, key, iv) {
		  suite = suite.toLowerCase()
		  if (aesModes[suite]) {
		    return aes.createCipheriv(suite, key, iv)
		  } else if (desModes[suite]) {
		    return new DES({
		      key: key,
		      iv: iv,
		      mode: suite
		    })
		  } else {
		    throw new TypeError('invalid suite type')
		  }
		}
		function createDecipheriv (suite, key, iv) {
		  suite = suite.toLowerCase()
		  if (aesModes[suite]) {
		    return aes.createDecipheriv(suite, key, iv)
		  } else if (desModes[suite]) {
		    return new DES({
		      key: key,
		      iv: iv,
		      mode: suite,
		      decrypt: true
		    })
		  } else {
		    throw new TypeError('invalid suite type')
		  }
		}
		exports.createCipher = exports.Cipher = createCipher
		exports.createCipheriv = exports.Cipheriv = createCipheriv
		exports.createDecipher = exports.Decipher = createDecipher
		exports.createDecipheriv = exports.Decipheriv = createDecipheriv
		function getCiphers () {
		  return Object.keys(desModes).concat(aes.getCiphers())
		}
		exports.listCiphers = exports.getCiphers = getCiphers


	/***/ },
	/* 371 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var CipherBase = __webpack_require__(66)
		var des = __webpack_require__(167)
		var inherits = __webpack_require__(2)

		var modes = {
		  'des-ede3-cbc': des.CBC.instantiate(des.EDE),
		  'des-ede3': des.EDE,
		  'des-ede-cbc': des.CBC.instantiate(des.EDE),
		  'des-ede': des.EDE,
		  'des-cbc': des.CBC.instantiate(des.DES),
		  'des-ecb': des.DES
		}
		modes.des = modes['des-cbc']
		modes.des3 = modes['des-ede3-cbc']
		module.exports = DES
		inherits(DES, CipherBase)
		function DES (opts) {
		  CipherBase.call(this)
		  var modeName = opts.mode.toLowerCase()
		  var mode = modes[modeName]
		  var type
		  if (opts.decrypt) {
		    type = 'decrypt'
		  } else {
		    type = 'encrypt'
		  }
		  var key = opts.key
		  if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {
		    key = Buffer.concat([key, key.slice(0, 8)])
		  }
		  var iv = opts.iv
		  this._des = mode.create({
		    key: key,
		    iv: iv,
		    type: type
		  })
		}
		DES.prototype._update = function (data) {
		  return new Buffer(this._des.update(data))
		}
		DES.prototype._final = function () {
		  return new Buffer(this._des.final())
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 372 */
	/***/ function(module, exports) {

		exports['des-ecb'] = {
		  key: 8,
		  iv: 0
		}
		exports['des-cbc'] = exports.des = {
		  key: 8,
		  iv: 8
		}
		exports['des-ede3-cbc'] = exports.des3 = {
		  key: 24,
		  iv: 8
		}
		exports['des-ede3'] = {
		  key: 24,
		  iv: 0
		}
		exports['des-ede-cbc'] = {
		  key: 16,
		  iv: 8
		}
		exports['des-ede'] = {
		  key: 16,
		  iv: 0
		}


	/***/ },
	/* 373 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var _algos = __webpack_require__(205)
		var createHash = __webpack_require__(72)
		var inherits = __webpack_require__(2)
		var sign = __webpack_require__(374)
		var stream = __webpack_require__(5)
		var verify = __webpack_require__(375)

		var algos = {}
		Object.keys(_algos).forEach(function (key) {
		  algos[key] = algos[key.toLowerCase()] = _algos[key]
		})

		function Sign (algorithm) {
		  stream.Writable.call(this)

		  var data = algos[algorithm]
		  if (!data) {
		    throw new Error('Unknown message digest')
		  }

		  this._hashType = data.hash
		  this._hash = createHash(data.hash)
		  this._tag = data.id
		  this._signType = data.sign
		}
		inherits(Sign, stream.Writable)

		Sign.prototype._write = function _write (data, _, done) {
		  this._hash.update(data)
		  done()
		}

		Sign.prototype.update = function update (data, enc) {
		  if (typeof data === 'string') {
		    data = new Buffer(data, enc)
		  }

		  this._hash.update(data)
		  return this
		}

		Sign.prototype.sign = function signMethod (key, enc) {
		  this.end()
		  var hash = this._hash.digest()
		  var sig = sign(Buffer.concat([this._tag, hash]), key, this._hashType, this._signType)

		  return enc ? sig.toString(enc) : sig
		}

		function Verify (algorithm) {
		  stream.Writable.call(this)

		  var data = algos[algorithm]
		  if (!data) {
		    throw new Error('Unknown message digest')
		  }

		  this._hash = createHash(data.hash)
		  this._tag = data.id
		  this._signType = data.sign
		}
		inherits(Verify, stream.Writable)

		Verify.prototype._write = function _write (data, _, done) {
		  this._hash.update(data)

		  done()
		}

		Verify.prototype.update = function update (data, enc) {
		  if (typeof data === 'string') {
		    data = new Buffer(data, enc)
		  }

		  this._hash.update(data)
		  return this
		}

		Verify.prototype.verify = function verifyMethod (key, sig, enc) {
		  if (typeof sig === 'string') {
		    sig = new Buffer(sig, enc)
		  }

		  this.end()
		  var hash = this._hash.digest()

		  return verify(sig, Buffer.concat([this._tag, hash]), key, this._signType)
		}

		function createSign (algorithm) {
		  return new Sign(algorithm)
		}

		function createVerify (algorithm) {
		  return new Verify(algorithm)
		}

		module.exports = {
		  Sign: createSign,
		  Verify: createVerify,
		  createSign: createSign,
		  createVerify: createVerify
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 374 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js
		var createHmac = __webpack_require__(166)
		var crt = __webpack_require__(135)
		var curves = __webpack_require__(206)
		var elliptic = __webpack_require__(26)
		var parseKeys = __webpack_require__(127)

		var BN = __webpack_require__(19)
		var EC = elliptic.ec

		function sign (hash, key, hashType, signType) {
		  var priv = parseKeys(key)
		  if (priv.curve) {
		    if (signType !== 'ecdsa') throw new Error('wrong private key type')

		    return ecSign(hash, priv)
		  } else if (priv.type === 'dsa') {
		    if (signType !== 'dsa') {
		      throw new Error('wrong private key type')
		    }
		    return dsaSign(hash, priv, hashType)
		  } else {
		    if (signType !== 'rsa') throw new Error('wrong private key type')
		  }

		  var len = priv.modulus.byteLength()
		  var pad = [ 0, 1 ]
		  while (hash.length + pad.length + 1 < len) {
		    pad.push(0xff)
		  }
		  pad.push(0x00)
		  var i = -1
		  while (++i < hash.length) {
		    pad.push(hash[i])
		  }

		  var out = crt(pad, priv)
		  return out
		}

		function ecSign (hash, priv) {
		  var curveId = curves[priv.curve.join('.')]
		  if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))

		  var curve = new EC(curveId)
		  var key = curve.genKeyPair()

		  key._importPrivate(priv.privateKey)
		  var out = key.sign(hash)

		  return new Buffer(out.toDER())
		}

		function dsaSign (hash, priv, algo) {
		  var x = priv.params.priv_key
		  var p = priv.params.p
		  var q = priv.params.q
		  var g = priv.params.g
		  var r = new BN(0)
		  var k
		  var H = bits2int(hash, q).mod(q)
		  var s = false
		  var kv = getKey(x, q, hash, algo)
		  while (s === false) {
		    k = makeKey(q, kv, algo)
		    r = makeR(g, k, p, q)
		    s = k.invm(q).imul(H.add(x.mul(r))).mod(q)
		    if (!s.cmpn(0)) {
		      s = false
		      r = new BN(0)
		    }
		  }
		  return toDER(r, s)
		}

		function toDER (r, s) {
		  r = r.toArray()
		  s = s.toArray()

		  // Pad values
		  if (r[0] & 0x80) {
		    r = [ 0 ].concat(r)
		  }
		  // Pad values
		  if (s[0] & 0x80) {
		    s = [0].concat(s)
		  }

		  var total = r.length + s.length + 4
		  var res = [ 0x30, total, 0x02, r.length ]
		  res = res.concat(r, [ 0x02, s.length ], s)
		  return new Buffer(res)
		}

		function getKey (x, q, hash, algo) {
		  x = new Buffer(x.toArray())
		  if (x.length < q.byteLength()) {
		    var zeros = new Buffer(q.byteLength() - x.length)
		    zeros.fill(0)
		    x = Buffer.concat([zeros, x])
		  }
		  var hlen = hash.length
		  var hbits = bits2octets(hash, q)
		  var v = new Buffer(hlen)
		  v.fill(1)
		  var k = new Buffer(hlen)
		  k.fill(0)
		  k = createHmac(algo, k)
		    .update(v)
		    .update(new Buffer([0]))
		    .update(x)
		    .update(hbits)
		    .digest()
		  v = createHmac(algo, k)
		    .update(v)
		    .digest()
		  k = createHmac(algo, k)
		    .update(v)
		    .update(new Buffer([1]))
		    .update(x)
		    .update(hbits)
		    .digest()
		  v = createHmac(algo, k)
		    .update(v)
		    .digest()
		  return {
		    k: k,
		    v: v
		  }
		}

		function bits2int (obits, q) {
		  var bits = new BN(obits)
		  var shift = (obits.length << 3) - q.bitLength()
		  if (shift > 0) {
		    bits.ishrn(shift)
		  }
		  return bits
		}

		function bits2octets (bits, q) {
		  bits = bits2int(bits, q)
		  bits = bits.mod(q)
		  var out = new Buffer(bits.toArray())
		  if (out.length < q.byteLength()) {
		    var zeros = new Buffer(q.byteLength() - out.length)
		    zeros.fill(0)
		    out = Buffer.concat([zeros, out])
		  }
		  return out
		}

		function makeKey (q, kv, algo) {
		  var t, k

		  do {
		    t = new Buffer('')

		    while (t.length * 8 < q.bitLength()) {
		      kv.v = createHmac(algo, kv.k)
		        .update(kv.v)
		        .digest()
		      t = Buffer.concat([t, kv.v])
		    }

		    k = bits2int(t, q)
		    kv.k = createHmac(algo, kv.k)
		      .update(kv.v)
		      .update(new Buffer([0]))
		      .digest()
		    kv.v = createHmac(algo, kv.k)
		      .update(kv.v)
		      .digest()
		  } while (k.cmp(q) !== -1)

		  return k
		}

		function makeR (g, k, p, q) {
		  return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q)
		}

		module.exports = sign
		module.exports.getKey = getKey
		module.exports.makeKey = makeKey

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 375 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js
		var curves = __webpack_require__(206)
		var elliptic = __webpack_require__(26)
		var parseKeys = __webpack_require__(127)

		var BN = __webpack_require__(19)
		var EC = elliptic.ec

		function verify (sig, hash, key, signType) {
		  var pub = parseKeys(key)
		  if (pub.type === 'ec') {
		    if (signType !== 'ecdsa') {
		      throw new Error('wrong public key type')
		    }
		    return ecVerify(sig, hash, pub)
		  } else if (pub.type === 'dsa') {
		    if (signType !== 'dsa') {
		      throw new Error('wrong public key type')
		    }
		    return dsaVerify(sig, hash, pub)
		  } else {
		    if (signType !== 'rsa') {
		      throw new Error('wrong public key type')
		    }
		  }
		  var len = pub.modulus.byteLength()
		  var pad = [ 1 ]
		  var padNum = 0
		  while (hash.length + pad.length + 2 < len) {
		    pad.push(0xff)
		    padNum++
		  }
		  pad.push(0x00)
		  var i = -1
		  while (++i < hash.length) {
		    pad.push(hash[i])
		  }
		  pad = new Buffer(pad)
		  var red = BN.mont(pub.modulus)
		  sig = new BN(sig).toRed(red)

		  sig = sig.redPow(new BN(pub.publicExponent))

		  sig = new Buffer(sig.fromRed().toArray())
		  var out = 0
		  if (padNum < 8) {
		    out = 1
		  }
		  len = Math.min(sig.length, pad.length)
		  if (sig.length !== pad.length) {
		    out = 1
		  }

		  i = -1
		  while (++i < len) {
		    out |= (sig[i] ^ pad[i])
		  }
		  return out === 0
		}

		function ecVerify (sig, hash, pub) {
		  var curveId = curves[pub.data.algorithm.curve.join('.')]
		  if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))

		  var curve = new EC(curveId)
		  var pubkey = pub.data.subjectPrivateKey.data

		  return curve.verify(hash, sig, pubkey)
		}

		function dsaVerify (sig, hash, pub) {
		  var p = pub.data.p
		  var q = pub.data.q
		  var g = pub.data.g
		  var y = pub.data.pub_key
		  var unpacked = parseKeys.signature.decode(sig, 'der')
		  var s = unpacked.s
		  var r = unpacked.r
		  checkValue(s, q)
		  checkValue(r, q)
		  var montp = BN.mont(p)
		  var w = s.invm(q)
		  var v = g.toRed(montp)
		    .redPow(new BN(hash).mul(w).mod(q))
		    .fromRed()
		    .mul(
		      y.toRed(montp)
		        .redPow(r.mul(w).mod(q))
		        .fromRed()
		  ).mod(p).mod(q)
		  return !v.cmp(r)
		}

		function checkValue (b, q) {
		  if (b.cmpn(0) <= 0) {
		    throw new Error('invalid sig')
		  }
		  if (b.cmp(q) >= q) {
		    throw new Error('invalid sig')
		  }
		}

		module.exports = verify

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 376 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer, process) {'use strict'

		var assert = __webpack_require__(34)

		var Zstream = __webpack_require__(701)
		var zlib_deflate = __webpack_require__(695)
		var zlib_inflate = __webpack_require__(697)
		var constants = __webpack_require__(694)

		for (var key in constants) {
		  exports[key] = constants[key]
		}

		// zlib modes
		exports.NONE = 0
		exports.DEFLATE = 1
		exports.INFLATE = 2
		exports.GZIP = 3
		exports.GUNZIP = 4
		exports.DEFLATERAW = 5
		exports.INFLATERAW = 6
		exports.UNZIP = 7

		var GZIP_HEADER_ID1 = 0x1f
		var GZIP_HEADER_ID2 = 0x8b
		var GZIP_MIN_HEADER_SIZE = 10

		/**
		 * Emulate Node's zlib C++ layer for use by the JS layer in index.js
		 */
		function Zlib (mode) {
		  if (mode == null || mode < exports.DEFLATE || mode > exports.UNZIP) {
		    throw new TypeError('Bad argument')
		  }

		  this.chunk_size = 0
		  this.dictionary = null
		  this.err = 0
		  this.flush = 0
		  this.init_done = false
		  this.level = 0
		  this.memLevel = 0
		  this.mode = mode
		  this.strategy = 0
		  this.windowBits = 0
		  this.write_in_progress = false
		  this.pending_close = false
		}

		Zlib.prototype.close = function () {
		  if (this.write_in_progress) {
		    this.pending_close = true
		    return
		  }

		  this.pending_close = false

		  assert(this.init_done, 'close before init')
		  assert(this.mode <= exports.UNZIP)

		  if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) {
		    zlib_deflate.deflateEnd(this.strm)
		  } else {
		    zlib_inflate.inflateEnd(this.strm)
		  }

		  this.mode = exports.NONE

		  if (this.dictionary != null) {
		    this.dictionary = null
		  }
		}

		Zlib.prototype.write = function (flush, input, in_off, in_len, out, out_off, out_len) {
		  return this._write(true, flush, input, in_off, in_len, out, out_off, out_len)
		}

		Zlib.prototype.writeSync = function (flush, input, in_off, in_len, out, out_off, out_len) {
		  return this._write(false, flush, input, in_off, in_len, out, out_off, out_len)
		}

		Zlib.prototype._write = function (async, flush, input, in_off, in_len, out, out_off, out_len) {
		  assert.equal(arguments.length, 8)

		  assert(this.init_done, 'write before init')
		  assert(this.mode !== exports.NONE, 'already finalized')
		  assert.equal(false, this.write_in_progress, 'write already in progress')
		  assert.equal(false, this.pending_close, 'close is pending')

		  this.write_in_progress = true

		  assert.equal(false, flush === undefined, 'must provide flush value')

		  this.write_in_progress = true

		  if (flush !== exports.Z_NO_FLUSH &&
		    flush !== exports.Z_PARTIAL_FLUSH &&
		    flush !== exports.Z_SYNC_FLUSH &&
		    flush !== exports.Z_FULL_FLUSH &&
		    flush !== exports.Z_FINISH &&
		    flush !== exports.Z_BLOCK) {
		    throw new Error('Invalid flush value')
		  }

		  if (input == null) {
		    input = new Buffer(0)
		    in_len = 0
		    in_off = 0
		  }

		  if (out._set) {
		    out.set = out._set
		  } else {
		    out.set = bufferSet
		  }

		  this.strm.avail_in = in_len
		  this.strm.input = input
		  this.strm.next_in = in_off
		  this.strm.avail_out = out_len
		  this.strm.output = out
		  this.strm.next_out = out_off
		  this.flush = flush

		  this.chunk_size = out_len

		  if (!async) {
		    // sync version
		    this._process()

		    if (this._checkError()) {
		      return this._afterSync()
		    }
		    return
		  }

		  // async version
		  var self = this
		  process.nextTick(function () {
		    self._process()
		    self._after()
		  })

		  return this
		}

		Zlib.prototype._afterSync = function () {
		  var avail_out = this.strm.avail_out
		  var avail_in = this.strm.avail_in

		  this.write_in_progress = false

		  return [avail_in, avail_out]
		}

		Zlib.prototype._process = function () {
		  // If the avail_out is left at 0, then it means that it ran out
		  // of room.  If there was avail_out left over, then it means
		  // that all of the input was consumed.
		  switch (this.mode) {
		    case exports.DEFLATE:
		    case exports.GZIP:
		    case exports.DEFLATERAW:
		      this.err = zlib_deflate.deflate(this.strm, this.flush)
		      break
		    case exports.UNZIP:
		    case exports.INFLATE:
		    case exports.GUNZIP:
		    case exports.INFLATERAW:
		      this.err = zlib_inflate.inflate(this.strm, this.flush)

		      // If data was encoded with dictionary
		      if (this.err === exports.Z_NEED_DICT && this.dictionary) {
		        // Load it
		        this.err = zlib_inflate.inflateSetDictionary(this.strm, this.dictionary)
		        if (this.err === exports.Z_OK) {
		          // And try to decode again
		          this.err = zlib_inflate.inflate(this.strm, this.flush)
		        } else if (this.err === exports.Z_DATA_ERROR) {
		          // Both inflateSetDictionary() and inflate() return Z_DATA_ERROR.
		          // Make it possible for After() to tell a bad dictionary from bad
		          // input.
		          this.err = exports.Z_NEED_DICT
		        }
		      }
		      while (this.strm.avail_in >= GZIP_MIN_HEADER_SIZE &&
		             this.mode === exports.GUNZIP) {
		        // Bytes remain in input buffer. Perhaps this is another compressed
		        // member in the same archive, or just trailing garbage.
		        // Check the header to find out.
		        if (this.strm.next_in[0] !== GZIP_HEADER_ID1 ||
		            this.strm.next_in[1] !== GZIP_HEADER_ID2) {
		          // Not a valid gzip member
		          break
		        }
		        this.reset()
		        this.err = zlib_inflate.inflate(this.strm, this.flush)
		      }
		      break
		    default:
		      throw new Error('Unknown mode ' + this.mode)
		  }
		}

		Zlib.prototype._checkError = function () {
		  // Acceptable error states depend on the type of zlib stream.
		  switch (this.err) {
		    case exports.Z_OK:
		    case exports.Z_BUF_ERROR:
		      if (this.strm.avail_out !== 0 && this.flush === exports.Z_FINISH) {
		        this._error('unexpected end of file')
		        return false
		      }
		      break
		    case exports.Z_STREAM_END:
		      // normal statuses, not fatal
		      break
		    case exports.Z_NEED_DICT:
		      if (this.dictionary == null) {
		        this._error('Missing dictionary')
		      } else {
		        this._error('Bad dictionary')
		      }
		      return false
		    default:
		      // something else.
		      this._error('Zlib error')
		      return false
		  }

		  return true
		}

		Zlib.prototype._after = function () {
		  if (!this._checkError()) {
		    return
		  }

		  var avail_out = this.strm.avail_out
		  var avail_in = this.strm.avail_in

		  this.write_in_progress = false

		  // call the write() cb
		  this.callback(avail_in, avail_out)

		  if (this.pending_close) {
		    this.close()
		  }
		}

		Zlib.prototype._error = function (message) {
		  this.onerror(message, this.err)

		  // no hope of rescue.
		  this.write_in_progress = false
		  if (this.pending_close) {
		    this.close()
		  }
		}

		Zlib.prototype.init = function (windowBits, level, memLevel, strategy, dictionary) {
		  assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strategy, [dictionary])')

		  assert(windowBits >= 6 && windowBits <= 15, 'invalid windowBits')
		  assert(level >= -1 && level <= 9, 'invalid compression level')

		  assert(memLevel >= 1 && memLevel <= 9, 'invalid memlevel')

		  assert(strategy === exports.Z_FILTERED ||
		         strategy === exports.Z_HUFFMAN_ONLY ||
		         strategy === exports.Z_RLE ||
		         strategy === exports.Z_FIXED ||
		         strategy === exports.Z_DEFAULT_STRATEGY, 'invalid strategy')

		  this._init(level, windowBits, memLevel, strategy, dictionary)
		  this._setDictionary()
		}

		Zlib.prototype.params = function () {
		  throw new Error('deflateParams Not supported')
		}

		Zlib.prototype.reset = function () {
		  this._reset()
		  this._setDictionary()
		}

		Zlib.prototype._init = function (level, windowBits, memLevel, strategy, dictionary) {
		  this.level = level
		  this.windowBits = windowBits
		  this.memLevel = memLevel
		  this.strategy = strategy

		  this.flush = exports.Z_NO_FLUSH

		  this.err = exports.Z_OK

		  if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) {
		    this.windowBits += 16
		  }

		  if (this.mode === exports.UNZIP) {
		    this.windowBits += 32
		  }

		  if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) {
		    this.windowBits = -1 * this.windowBits
		  }

		  this.strm = new Zstream()

		  switch (this.mode) {
		    case exports.DEFLATE:
		    case exports.GZIP:
		    case exports.DEFLATERAW:
		      this.err = zlib_deflate.deflateInit2(
		        this.strm,
		        this.level,
		        exports.Z_DEFLATED,
		        this.windowBits,
		        this.memLevel,
		        this.strategy
		      )
		      break
		    case exports.INFLATE:
		    case exports.GUNZIP:
		    case exports.INFLATERAW:
		    case exports.UNZIP:
		      this.err = zlib_inflate.inflateInit2(
		        this.strm,
		        this.windowBits
		      )
		      break
		    default:
		      throw new Error('Unknown mode ' + this.mode)
		  }

		  if (this.err !== exports.Z_OK) {
		    this._error('Init error')
		  }

		  this.dictionary = dictionary

		  this.write_in_progress = false
		  this.init_done = true
		}

		Zlib.prototype._setDictionary = function () {
		  if (this.dictionary == null) {
		    return
		  }

		  this.err = exports.Z_OK

		  switch (this.mode) {
		    case exports.DEFLATE:
		    case exports.DEFLATERAW:
		      this.err = zlib_deflate.deflateSetDictionary(this.strm, this.dictionary)
		      break
		    default:
		      break
		  }

		  if (this.err !== exports.Z_OK) {
		    this._error('Failed to set dictionary')
		  }
		}

		Zlib.prototype._reset = function () {
		  this.err = exports.Z_OK

		  switch (this.mode) {
		    case exports.DEFLATE:
		    case exports.DEFLATERAW:
		    case exports.GZIP:
		      this.err = zlib_deflate.deflateReset(this.strm)
		      break
		    case exports.INFLATE:
		    case exports.INFLATERAW:
		    case exports.GUNZIP:
		      this.err = zlib_inflate.inflateReset(this.strm)
		      break
		    default:
		      break
		  }

		  if (this.err !== exports.Z_OK) {
		    this._error('Failed to reset stream')
		  }
		}

		// set method for Node buffers, used by pako
		function bufferSet (data, offset) {
		  for (var i = 0; i < data.length; i++) {
		    this[offset + i] = data[i]
		  }
		}

		exports.Zlib = Zlib

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer, __webpack_require__(3)))

	/***/ },
	/* 377 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict'

		var Buffer = __webpack_require__(0).Buffer
		var Transform = __webpack_require__(5).Transform
		var binding = __webpack_require__(376)
		var util = __webpack_require__(11)
		var assert = __webpack_require__(34).ok

		function kMaxLength () {
		  var max = __webpack_require__(0).kMaxLength

		  if (max) {
		    return max
		  } else if (Buffer.TYPED_ARRAY_SUPPORT) {
		    return 0x7fffffff
		  } else {
		    return 0x3fffffff
		  }
		}

		var kRangeErrorMessage = 'Cannot create final Buffer. ' +
		      'It would be larger than 0x' + kMaxLength().toString(16) + ' bytes.'

		// zlib doesn't provide these, so kludge them in following the same
		// var naming scheme zlib uses.
		binding.Z_MIN_WINDOWBITS = 8
		binding.Z_MAX_WINDOWBITS = 15
		binding.Z_DEFAULT_WINDOWBITS = 15

		// fewer than 64 bytes per chunk is stupid.
		// technically it could work with as few as 8, but even 64 bytes
		// is absurdly low.  Usually a MB or more is best.
		binding.Z_MIN_CHUNK = 64
		binding.Z_MAX_CHUNK = Infinity
		binding.Z_DEFAULT_CHUNK = (16 * 1024)

		binding.Z_MIN_MEMLEVEL = 1
		binding.Z_MAX_MEMLEVEL = 9
		binding.Z_DEFAULT_MEMLEVEL = 8

		binding.Z_MIN_LEVEL = -1
		binding.Z_MAX_LEVEL = 9
		binding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION

		// expose all the zlib varants
		var bkeys = Object.keys(binding)
		for (var bk = 0; bk < bkeys.length; bk++) {
		  var bkey = bkeys[bk]
		  if (bkey.match(/^Z/)) {
		    Object.defineProperty(exports, bkey, {
		      enumerable: true, value: binding[bkey], writable: false
		    })
		  }
		}

		// translation table for return codes.
		var codes = {
		  Z_OK: binding.Z_OK,
		  Z_STREAM_END: binding.Z_STREAM_END,
		  Z_NEED_DICT: binding.Z_NEED_DICT,
		  Z_ERRNO: binding.Z_ERRNO,
		  Z_STREAM_ERROR: binding.Z_STREAM_ERROR,
		  Z_DATA_ERROR: binding.Z_DATA_ERROR,
		  Z_MEM_ERROR: binding.Z_MEM_ERROR,
		  Z_BUF_ERROR: binding.Z_BUF_ERROR,
		  Z_VERSION_ERROR: binding.Z_VERSION_ERROR
		}

		var ckeys = Object.keys(codes)
		for (var ck = 0; ck < ckeys.length; ck++) {
		  var ckey = ckeys[ck]
		  codes[codes[ckey]] = ckey
		}

		Object.defineProperty(exports, 'codes', {
		  enumerable: true, value: Object.freeze(codes), writable: false
		})

		exports.Deflate = Deflate
		exports.Inflate = Inflate
		exports.Gzip = Gzip
		exports.Gunzip = Gunzip
		exports.DeflateRaw = DeflateRaw
		exports.InflateRaw = InflateRaw
		exports.Unzip = Unzip

		exports.createDeflate = function (o) {
		  return new Deflate(o)
		}

		exports.createInflate = function (o) {
		  return new Inflate(o)
		}

		exports.createDeflateRaw = function (o) {
		  return new DeflateRaw(o)
		}

		exports.createInflateRaw = function (o) {
		  return new InflateRaw(o)
		}

		exports.createGzip = function (o) {
		  return new Gzip(o)
		}

		exports.createGunzip = function (o) {
		  return new Gunzip(o)
		}

		exports.createUnzip = function (o) {
		  return new Unzip(o)
		}

		// Convenience methods.
		// compress/decompress a string or buffer in one step.
		exports.deflate = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new Deflate(opts), buffer, callback)
		}

		exports.deflateSync = function (buffer, opts) {
		  return zlibBufferSync(new Deflate(opts), buffer)
		}

		exports.gzip = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new Gzip(opts), buffer, callback)
		}

		exports.gzipSync = function (buffer, opts) {
		  return zlibBufferSync(new Gzip(opts), buffer)
		}

		exports.deflateRaw = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new DeflateRaw(opts), buffer, callback)
		}

		exports.deflateRawSync = function (buffer, opts) {
		  return zlibBufferSync(new DeflateRaw(opts), buffer)
		}

		exports.unzip = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new Unzip(opts), buffer, callback)
		}

		exports.unzipSync = function (buffer, opts) {
		  return zlibBufferSync(new Unzip(opts), buffer)
		}

		exports.inflate = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new Inflate(opts), buffer, callback)
		}

		exports.inflateSync = function (buffer, opts) {
		  return zlibBufferSync(new Inflate(opts), buffer)
		}

		exports.gunzip = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new Gunzip(opts), buffer, callback)
		}

		exports.gunzipSync = function (buffer, opts) {
		  return zlibBufferSync(new Gunzip(opts), buffer)
		}

		exports.inflateRaw = function (buffer, opts, callback) {
		  if (typeof opts === 'function') {
		    callback = opts
		    opts = {}
		  }
		  return zlibBuffer(new InflateRaw(opts), buffer, callback)
		}

		exports.inflateRawSync = function (buffer, opts) {
		  return zlibBufferSync(new InflateRaw(opts), buffer)
		}

		function zlibBuffer (engine, buffer, callback) {
		  var buffers = []
		  var nread = 0

		  engine.on('error', onError)
		  engine.on('end', onEnd)

		  engine.end(buffer)
		  flow()

		  function flow () {
		    var chunk
		    // eslint-disable-next-line
		    while (null !== (chunk = engine.read())) {
		      buffers.push(chunk)
		      nread += chunk.length
		    }
		    engine.once('readable', flow)
		  }

		  function onError (err) {
		    engine.removeListener('end', onEnd)
		    engine.removeListener('readable', flow)
		    callback(err)
		  }

		  function onEnd () {
		    var buf
		    var err = null

		    if (nread >= kMaxLength()) {
		      err = new RangeError(kRangeErrorMessage)
		    } else {
		      buf = Buffer.concat(buffers, nread)
		    }

		    buffers = []
		    engine.close()
		    callback(err, buf)
		  }
		}

		function zlibBufferSync (engine, buffer) {
		  if (typeof buffer === 'string') {
		    buffer = new Buffer(buffer)
		  }
		  if (!(buffer instanceof Buffer)) {
		    throw new TypeError('Not a string or buffer')
		  }
		  var flushFlag = binding.Z_FINISH

		  return engine._processChunk(buffer, flushFlag)
		}

		// generic zlib
		// minimal 2-byte header
		function Deflate (opts) {
		  if (!(this instanceof Deflate)) return new Deflate(opts)
		  Zlib.call(this, opts, binding.DEFLATE)
		}

		function Inflate (opts) {
		  if (!(this instanceof Inflate)) return new Inflate(opts)
		  Zlib.call(this, opts, binding.INFLATE)
		}

		// gzip - bigger header, same deflate compression
		function Gzip (opts) {
		  if (!(this instanceof Gzip)) return new Gzip(opts)
		  Zlib.call(this, opts, binding.GZIP)
		}

		function Gunzip (opts) {
		  if (!(this instanceof Gunzip)) return new Gunzip(opts)
		  Zlib.call(this, opts, binding.GUNZIP)
		}

		// raw - no header
		function DeflateRaw (opts) {
		  if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts)
		  Zlib.call(this, opts, binding.DEFLATERAW)
		}

		function InflateRaw (opts) {
		  if (!(this instanceof InflateRaw)) return new InflateRaw(opts)
		  Zlib.call(this, opts, binding.INFLATERAW)
		}

		// auto-detect header.
		function Unzip (opts) {
		  if (!(this instanceof Unzip)) return new Unzip(opts)
		  Zlib.call(this, opts, binding.UNZIP)
		}

		// the Zlib class they all inherit from
		// This thing manages the queue of requests, and returns
		// true or false if there is anything in the queue when
		// you call the .write() method.

		function Zlib (opts, mode) {
		  this._opts = opts = opts || {}
		  this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK

		  Transform.call(this, opts)

		  if (opts.flush) {
		    if (opts.flush !== binding.Z_NO_FLUSH &&
		      opts.flush !== binding.Z_PARTIAL_FLUSH &&
		      opts.flush !== binding.Z_SYNC_FLUSH &&
		      opts.flush !== binding.Z_FULL_FLUSH &&
		      opts.flush !== binding.Z_FINISH &&
		      opts.flush !== binding.Z_BLOCK) {
		      throw new Error('Invalid flush flag: ' + opts.flush)
		    }
		  }
		  this._flushFlag = opts.flush || binding.Z_NO_FLUSH

		  if (opts.chunkSize) {
		    if (opts.chunkSize < exports.Z_MIN_CHUNK ||
		      opts.chunkSize > exports.Z_MAX_CHUNK) {
		      throw new Error('Invalid chunk size: ' + opts.chunkSize)
		    }
		  }

		  if (opts.windowBits) {
		    if (opts.windowBits < exports.Z_MIN_WINDOWBITS ||
		      opts.windowBits > exports.Z_MAX_WINDOWBITS) {
		      throw new Error('Invalid windowBits: ' + opts.windowBits)
		    }
		  }

		  if (opts.level) {
		    if (opts.level < exports.Z_MIN_LEVEL ||
		      opts.level > exports.Z_MAX_LEVEL) {
		      throw new Error('Invalid compression level: ' + opts.level)
		    }
		  }

		  if (opts.memLevel) {
		    if (opts.memLevel < exports.Z_MIN_MEMLEVEL ||
		      opts.memLevel > exports.Z_MAX_MEMLEVEL) {
		      throw new Error('Invalid memLevel: ' + opts.memLevel)
		    }
		  }

		  if (opts.strategy) {
		    if (opts.strategy !== exports.Z_FILTERED &&
		      opts.strategy !== exports.Z_HUFFMAN_ONLY &&
		      opts.strategy !== exports.Z_RLE &&
		      opts.strategy !== exports.Z_FIXED &&
		      opts.strategy !== exports.Z_DEFAULT_STRATEGY) {
		      throw new Error('Invalid strategy: ' + opts.strategy)
		    }
		  }

		  if (opts.dictionary) {
		    if (!(opts.dictionary instanceof Buffer)) {
		      throw new Error('Invalid dictionary: it should be a Buffer instance')
		    }
		  }

		  this._handle = new binding.Zlib(mode)

		  var self = this
		  this._hadError = false
		  this._handle.onerror = function (message, errno) {
		    // there is no way to cleanly recover.
		    // continuing only obscures problems.
		    self._handle = null
		    self._hadError = true

		    var error = new Error(message)

		    error.errno = errno
		    error.code = exports.codes[errno]
		    self.emit('error', error)
		  }

		  var level = exports.Z_DEFAULT_COMPRESSION
		  if (typeof opts.level === 'number') level = opts.level

		  var strategy = exports.Z_DEFAULT_STRATEGY
		  if (typeof opts.strategy === 'number') strategy = opts.strategy

		  this._handle.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS,
		    level,
		    opts.memLevel || exports.Z_DEFAULT_MEMLEVEL,
		    strategy,
		    opts.dictionary)

		  this._buffer = new Buffer(this._chunkSize)
		  this._offset = 0
		  this._closed = false
		  this._level = level
		  this._strategy = strategy

		  this.once('end', this.close)
		}

		util.inherits(Zlib, Transform)

		Zlib.prototype.params = function (level, strategy, callback) {
		  if (level < exports.Z_MIN_LEVEL ||
		    level > exports.Z_MAX_LEVEL) {
		    throw new RangeError('Invalid compression level: ' + level)
		  }
		  if (strategy !== exports.Z_FILTERED &&
		    strategy !== exports.Z_HUFFMAN_ONLY &&
		    strategy !== exports.Z_RLE &&
		    strategy !== exports.Z_FIXED &&
		    strategy !== exports.Z_DEFAULT_STRATEGY) {
		    throw new TypeError('Invalid strategy: ' + strategy)
		  }

		  if (this._level !== level || this._strategy !== strategy) {
		    var self = this
		    this.flush(binding.Z_SYNC_FLUSH, function () {
		      assert(!self._closed, 'zlib binding closed')
		      self._handle.params(level, strategy)
		      if (!self._hadError) {
		        self._level = level
		        self._strategy = strategy
		        if (callback) callback()
		      }
		    })
		  } else {
		    process.nextTick(callback)
		  }
		}

		Zlib.prototype.reset = function () {
		  assert(!this._closed, 'zlib binding closed')
		  return this._handle.reset()
		}

		// This is the _flush function called by the transform class,
		// internally, when the last chunk has been written.
		Zlib.prototype._flush = function (callback) {
		  this._transform(new Buffer(0), '', callback)
		}

		Zlib.prototype.flush = function (kind, callback) {
		  var ws = this._writableState

		  if (typeof kind === 'function' || (kind === undefined && !callback)) {
		    callback = kind
		    kind = binding.Z_FULL_FLUSH
		  }

		  if (ws.ended) {
		    if (callback) {
		      process.nextTick(callback)
		    }
		  } else if (ws.ending) {
		    if (callback) {
		      this.once('end', callback)
		    }
		  } else if (ws.needDrain) {
		    if (callback) {
		      var self = this
		      this.once('drain', function () {
		        self.flush(kind, callback)
		      })
		    }
		  } else {
		    this._flushFlag = kind
		    this.write(new Buffer(0), '', callback)
		  }
		}

		Zlib.prototype.close = function (callback) {
		  if (callback) {
		    process.nextTick(callback)
		  }

		  if (this._closed) {
		    return
		  }
		  this._closed = true

		  this._handle.close()

		  process.nextTick(emitCloseNT, this)
		}

		function emitCloseNT (self) {
		  self.emit('close')
		}

		Zlib.prototype._transform = function (chunk, encoding, cb) {
		  var flushFlag
		  var ws = this._writableState
		  var ending = ws.ending || ws.ended
		  var last = ending && (!chunk || ws.length === chunk.length)

		  if (chunk !== null && !(chunk instanceof Buffer)) {
		    return cb(new Error('invalid input'))
		  }

		  if (this._closed) {
		    return cb(new Error('zlib binding closed'))
		  }

		  // If it's the last chunk, or a final flush, we use the Z_FINISH flush flag.
		  // If it's explicitly flushing at some other time, then we use
		  // Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression
		  // goodness.
		  if (last) {
		    flushFlag = binding.Z_FINISH
		  } else {
		    flushFlag = this._flushFlag
		    // once we've flushed the last of the queue, stop flushing and
		    // go back to the normal behavior.
		    if (chunk.length >= ws.length) {
		      this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH
		    }
		  }

		  this._processChunk(chunk, flushFlag, cb)
		}

		Zlib.prototype._processChunk = function (chunk, flushFlag, cb) {
		  var availInBefore = chunk && chunk.length
		  var availOutBefore = this._chunkSize - this._offset
		  var inOff = 0

		  var self = this

		  var async = typeof cb === 'function'

		  if (!async) {
		    var buffers = []
		    var nread = 0

		    var error
		    this.on('error', function (er) {
		      error = er
		    })

		    assert(!this._closed, 'zlib binding closed')
		    do {
		      var res = this._handle.writeSync(flushFlag,
		        chunk, // in
		        inOff, // in_off
		        availInBefore, // in_len
		        this._buffer, // out
		        this._offset, // out_off
		        availOutBefore) // out_len
		    } while (!this._hadError && callback(res[0], res[1]))

		    if (this._hadError) {
		      throw error
		    }

		    if (nread >= kMaxLength()) {
		      this.close()
		      throw new RangeError(kRangeErrorMessage)
		    }

		    var buf = Buffer.concat(buffers, nread)
		    this.close()

		    return buf
		  }

		  assert(!this._closed, 'zlib binding closed')
		  var req = this._handle.write(flushFlag,
		    chunk, // in
		    inOff, // in_off
		    availInBefore, // in_len
		    this._buffer, // out
		    this._offset, // out_off
		    availOutBefore) // out_len

		  req.buffer = chunk
		  req.callback = callback

		  function callback (availInAfter, availOutAfter) {
		    if (self._hadError) {
		      return
		    }

		    var have = availOutBefore - availOutAfter
		    assert(have >= 0, 'have should not go down')

		    if (have > 0) {
		      var out = self._buffer.slice(self._offset, self._offset + have)
		      self._offset += have
		      // serve some output to the consumer.
		      if (async) {
		        self.push(out)
		      } else {
		        buffers.push(out)
		        nread += out.length
		      }
		    }

		    // exhausted the output buffer, or used all the input create a new one.
		    if (availOutAfter === 0 || self._offset >= self._chunkSize) {
		      availOutBefore = self._chunkSize
		      self._offset = 0
		      self._buffer = new Buffer(self._chunkSize)
		    }

		    if (availOutAfter === 0) {
		      // Not actually done.  Need to reprocess.
		      // Also, update the availInBefore to the availInAfter value,
		      // so that if we have to hit it a third (fourth, etc.) time,
		      // it'll have the correct byte counts.
		      inOff += (availInBefore - availInAfter)
		      availInBefore = availInAfter

		      if (!async) {
		        return true
		      }

		      var newReq = self._handle.write(flushFlag,
		        chunk,
		        inOff,
		        availInBefore,
		        self._buffer,
		        self._offset,
		        self._chunkSize)
		      newReq.callback = callback // this same function
		      newReq.buffer = chunk
		      return
		    }

		    if (!async) {
		      return false
		    }
		    // finished with the chunk.
		    cb()
		  }
		}

		util.inherits(Deflate, Zlib)
		util.inherits(Inflate, Zlib)
		util.inherits(Gzip, Zlib)
		util.inherits(Gunzip, Zlib)
		util.inherits(DeflateRaw, Zlib)
		util.inherits(InflateRaw, Zlib)
		util.inherits(Unzip, Zlib)

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 378 */
	/***/ function(module, exports) {

		module.exports = function (xs, fn) {
		    var res = [];
		    for (var i = 0; i < xs.length; i++) {
		        var x = fn(xs[i], i);
		        if (isArray(x)) res.push.apply(res, x);
		        else res.push(x);
		    }
		    return res;
		};

		var isArray = Array.isArray || function (xs) {
		    return Object.prototype.toString.call(xs) === '[object Array]';
		};


	/***/ },
	/* 379 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(416);
		module.exports = __webpack_require__(40).RegExp.escape;

	/***/ },
	/* 380 */
	/***/ function(module, exports, __webpack_require__) {

		var core  = __webpack_require__(102)
		  , $JSON = core.JSON || (core.JSON = {stringify: JSON.stringify});
		module.exports = function stringify(it){ // eslint-disable-line no-unused-vars
		  return $JSON.stringify.apply($JSON, arguments);
		};

	/***/ },
	/* 381 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(406);
		module.exports = __webpack_require__(102).Object.keys;

	/***/ },
	/* 382 */
	/***/ function(module, exports) {

		module.exports = function(it){
		  if(typeof it != 'function')throw TypeError(it + ' is not a function!');
		  return it;
		};

	/***/ },
	/* 383 */
	/***/ function(module, exports, __webpack_require__) {

		var isObject = __webpack_require__(139);
		module.exports = function(it){
		  if(!isObject(it))throw TypeError(it + ' is not an object!');
		  return it;
		};

	/***/ },
	/* 384 */
	/***/ function(module, exports, __webpack_require__) {

		// false -> Array#indexOf
		// true  -> Array#includes
		var toIObject = __webpack_require__(209)
		  , toLength  = __webpack_require__(402)
		  , toIndex   = __webpack_require__(401);
		module.exports = function(IS_INCLUDES){
		  return function($this, el, fromIndex){
		    var O      = toIObject($this)
		      , length = toLength(O.length)
		      , index  = toIndex(fromIndex, length)
		      , value;
		    // Array#includes uses SameValueZero equality algorithm
		    if(IS_INCLUDES && el != el)while(length > index){
		      value = O[index++];
		      if(value != value)return true;
		    // Array#toIndex ignores holes, Array#includes - not
		    } else for(;length > index; index++)if(IS_INCLUDES || index in O){
		      if(O[index] === el)return IS_INCLUDES || index || 0;
		    } return !IS_INCLUDES && -1;
		  };
		};

	/***/ },
	/* 385 */
	/***/ function(module, exports) {

		var toString = {}.toString;

		module.exports = function(it){
		  return toString.call(it).slice(8, -1);
		};

	/***/ },
	/* 386 */
	/***/ function(module, exports, __webpack_require__) {

		// optional / simple context binding
		var aFunction = __webpack_require__(382);
		module.exports = function(fn, that, length){
		  aFunction(fn);
		  if(that === undefined)return fn;
		  switch(length){
		    case 1: return function(a){
		      return fn.call(that, a);
		    };
		    case 2: return function(a, b){
		      return fn.call(that, a, b);
		    };
		    case 3: return function(a, b, c){
		      return fn.call(that, a, b, c);
		    };
		  }
		  return function(/* ...args */){
		    return fn.apply(that, arguments);
		  };
		};

	/***/ },
	/* 387 */
	/***/ function(module, exports, __webpack_require__) {

		var isObject = __webpack_require__(139)
		  , document = __webpack_require__(138).document
		  // in old IE typeof document.createElement is 'object'
		  , is = isObject(document) && isObject(document.createElement);
		module.exports = function(it){
		  return is ? document.createElement(it) : {};
		};

	/***/ },
	/* 388 */
	/***/ function(module, exports) {

		// IE 8- don't enum bug keys
		module.exports = (
		  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'
		).split(',');

	/***/ },
	/* 389 */
	/***/ function(module, exports, __webpack_require__) {

		var global    = __webpack_require__(138)
		  , core      = __webpack_require__(102)
		  , ctx       = __webpack_require__(386)
		  , hide      = __webpack_require__(391)
		  , PROTOTYPE = 'prototype';

		var $export = function(type, name, source){
		  var IS_FORCED = type & $export.F
		    , IS_GLOBAL = type & $export.G
		    , IS_STATIC = type & $export.S
		    , IS_PROTO  = type & $export.P
		    , IS_BIND   = type & $export.B
		    , IS_WRAP   = type & $export.W
		    , exports   = IS_GLOBAL ? core : core[name] || (core[name] = {})
		    , expProto  = exports[PROTOTYPE]
		    , target    = IS_GLOBAL ? global : IS_STATIC ? global[name] : (global[name] || {})[PROTOTYPE]
		    , key, own, out;
		  if(IS_GLOBAL)source = name;
		  for(key in source){
		    // contains in native
		    own = !IS_FORCED && target && target[key] !== undefined;
		    if(own && key in exports)continue;
		    // export native or passed
		    out = own ? target[key] : source[key];
		    // prevent global pollution for namespaces
		    exports[key] = IS_GLOBAL && typeof target[key] != 'function' ? source[key]
		    // bind timers to global for call from export context
		    : IS_BIND && own ? ctx(out, global)
		    // wrap global constructors for prevent change them in library
		    : IS_WRAP && target[key] == out ? (function(C){
		      var F = function(a, b, c){
		        if(this instanceof C){
		          switch(arguments.length){
		            case 0: return new C;
		            case 1: return new C(a);
		            case 2: return new C(a, b);
		          } return new C(a, b, c);
		        } return C.apply(this, arguments);
		      };
		      F[PROTOTYPE] = C[PROTOTYPE];
		      return F;
		    // make static versions for prototype methods
		    })(out) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;
		    // export proto methods to core.%CONSTRUCTOR%.methods.%NAME%
		    if(IS_PROTO){
		      (exports.virtual || (exports.virtual = {}))[key] = out;
		      // export proto methods to core.%CONSTRUCTOR%.prototype.%NAME%
		      if(type & $export.R && expProto && !expProto[key])hide(expProto, key, out);
		    }
		  }
		};
		// type bitmap
		$export.F = 1;   // forced
		$export.G = 2;   // global
		$export.S = 4;   // static
		$export.P = 8;   // proto
		$export.B = 16;  // bind
		$export.W = 32;  // wrap
		$export.U = 64;  // safe
		$export.R = 128; // real proto method for `library` 
		module.exports = $export;

	/***/ },
	/* 390 */
	/***/ function(module, exports) {

		var hasOwnProperty = {}.hasOwnProperty;
		module.exports = function(it, key){
		  return hasOwnProperty.call(it, key);
		};

	/***/ },
	/* 391 */
	/***/ function(module, exports, __webpack_require__) {

		var dP         = __webpack_require__(394)
		  , createDesc = __webpack_require__(398);
		module.exports = __webpack_require__(136) ? function(object, key, value){
		  return dP.f(object, key, createDesc(1, value));
		} : function(object, key, value){
		  object[key] = value;
		  return object;
		};

	/***/ },
	/* 392 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = !__webpack_require__(136) && !__webpack_require__(137)(function(){
		  return Object.defineProperty(__webpack_require__(387)('div'), 'a', {get: function(){ return 7; }}).a != 7;
		});

	/***/ },
	/* 393 */
	/***/ function(module, exports, __webpack_require__) {

		// fallback for non-array-like ES3 and non-enumerable old V8 strings
		var cof = __webpack_require__(385);
		module.exports = Object('z').propertyIsEnumerable(0) ? Object : function(it){
		  return cof(it) == 'String' ? it.split('') : Object(it);
		};

	/***/ },
	/* 394 */
	/***/ function(module, exports, __webpack_require__) {

		var anObject       = __webpack_require__(383)
		  , IE8_DOM_DEFINE = __webpack_require__(392)
		  , toPrimitive    = __webpack_require__(404)
		  , dP             = Object.defineProperty;

		exports.f = __webpack_require__(136) ? Object.defineProperty : function defineProperty(O, P, Attributes){
		  anObject(O);
		  P = toPrimitive(P, true);
		  anObject(Attributes);
		  if(IE8_DOM_DEFINE)try {
		    return dP(O, P, Attributes);
		  } catch(e){ /* empty */ }
		  if('get' in Attributes || 'set' in Attributes)throw TypeError('Accessors not supported!');
		  if('value' in Attributes)O[P] = Attributes.value;
		  return O;
		};

	/***/ },
	/* 395 */
	/***/ function(module, exports, __webpack_require__) {

		var has          = __webpack_require__(390)
		  , toIObject    = __webpack_require__(209)
		  , arrayIndexOf = __webpack_require__(384)(false)
		  , IE_PROTO     = __webpack_require__(399)('IE_PROTO');

		module.exports = function(object, names){
		  var O      = toIObject(object)
		    , i      = 0
		    , result = []
		    , key;
		  for(key in O)if(key != IE_PROTO)has(O, key) && result.push(key);
		  // Don't enum bug & hidden keys
		  while(names.length > i)if(has(O, key = names[i++])){
		    ~arrayIndexOf(result, key) || result.push(key);
		  }
		  return result;
		};

	/***/ },
	/* 396 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.14 / 15.2.3.14 Object.keys(O)
		var $keys       = __webpack_require__(395)
		  , enumBugKeys = __webpack_require__(388);

		module.exports = Object.keys || function keys(O){
		  return $keys(O, enumBugKeys);
		};

	/***/ },
	/* 397 */
	/***/ function(module, exports, __webpack_require__) {

		// most Object methods by ES6 should accept primitives
		var $export = __webpack_require__(389)
		  , core    = __webpack_require__(102)
		  , fails   = __webpack_require__(137);
		module.exports = function(KEY, exec){
		  var fn  = (core.Object || {})[KEY] || Object[KEY]
		    , exp = {};
		  exp[KEY] = exec(fn);
		  $export($export.S + $export.F * fails(function(){ fn(1); }), 'Object', exp);
		};

	/***/ },
	/* 398 */
	/***/ function(module, exports) {

		module.exports = function(bitmap, value){
		  return {
		    enumerable  : !(bitmap & 1),
		    configurable: !(bitmap & 2),
		    writable    : !(bitmap & 4),
		    value       : value
		  };
		};

	/***/ },
	/* 399 */
	/***/ function(module, exports, __webpack_require__) {

		var shared = __webpack_require__(400)('keys')
		  , uid    = __webpack_require__(405);
		module.exports = function(key){
		  return shared[key] || (shared[key] = uid(key));
		};

	/***/ },
	/* 400 */
	/***/ function(module, exports, __webpack_require__) {

		var global = __webpack_require__(138)
		  , SHARED = '__core-js_shared__'
		  , store  = global[SHARED] || (global[SHARED] = {});
		module.exports = function(key){
		  return store[key] || (store[key] = {});
		};

	/***/ },
	/* 401 */
	/***/ function(module, exports, __webpack_require__) {

		var toInteger = __webpack_require__(208)
		  , max       = Math.max
		  , min       = Math.min;
		module.exports = function(index, length){
		  index = toInteger(index);
		  return index < 0 ? max(index + length, 0) : min(index, length);
		};

	/***/ },
	/* 402 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.1.15 ToLength
		var toInteger = __webpack_require__(208)
		  , min       = Math.min;
		module.exports = function(it){
		  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991
		};

	/***/ },
	/* 403 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.1.13 ToObject(argument)
		var defined = __webpack_require__(207);
		module.exports = function(it){
		  return Object(defined(it));
		};

	/***/ },
	/* 404 */
	/***/ function(module, exports, __webpack_require__) {

		// 7.1.1 ToPrimitive(input [, PreferredType])
		var isObject = __webpack_require__(139);
		// instead of the ES6 spec version, we didn't implement @@toPrimitive case
		// and the second argument - flag - preferred type is a string
		module.exports = function(it, S){
		  if(!isObject(it))return it;
		  var fn, val;
		  if(S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
		  if(typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it)))return val;
		  if(!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
		  throw TypeError("Can't convert object to primitive value");
		};

	/***/ },
	/* 405 */
	/***/ function(module, exports) {

		var id = 0
		  , px = Math.random();
		module.exports = function(key){
		  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));
		};

	/***/ },
	/* 406 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.14 Object.keys(O)
		var toObject = __webpack_require__(403)
		  , $keys    = __webpack_require__(396);

		__webpack_require__(397)('keys', function(){
		  return function keys(it){
		    return $keys(toObject(it));
		  };
		});

	/***/ },
	/* 407 */
	/***/ function(module, exports, __webpack_require__) {

		var isObject = __webpack_require__(12)
		  , isArray  = __webpack_require__(148)
		  , SPECIES  = __webpack_require__(13)('species');

		module.exports = function(original){
		  var C;
		  if(isArray(original)){
		    C = original.constructor;
		    // cross-realm fallback
		    if(typeof C == 'function' && (C === Array || isArray(C.prototype)))C = undefined;
		    if(isObject(C)){
		      C = C[SPECIES];
		      if(C === null)C = undefined;
		    }
		  } return C === undefined ? Array : C;
		};

	/***/ },
	/* 408 */
	/***/ function(module, exports, __webpack_require__) {

		// 9.4.2.3 ArraySpeciesCreate(originalArray, length)
		var speciesConstructor = __webpack_require__(407);

		module.exports = function(original, length){
		  return new (speciesConstructor(original))(length);
		};

	/***/ },
	/* 409 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var anObject    = __webpack_require__(6)
		  , toPrimitive = __webpack_require__(42)
		  , NUMBER      = 'number';

		module.exports = function(hint){
		  if(hint !== 'string' && hint !== NUMBER && hint !== 'default')throw TypeError('Incorrect hint');
		  return toPrimitive(anObject(this), hint != NUMBER);
		};

	/***/ },
	/* 410 */
	/***/ function(module, exports, __webpack_require__) {

		// all enumerable object keys, includes symbols
		var getKeys = __webpack_require__(57)
		  , gOPS    = __webpack_require__(111)
		  , pIE     = __webpack_require__(87);
		module.exports = function(it){
		  var result     = getKeys(it)
		    , getSymbols = gOPS.f;
		  if(getSymbols){
		    var symbols = getSymbols(it)
		      , isEnum  = pIE.f
		      , i       = 0
		      , key;
		    while(symbols.length > i)if(isEnum.call(it, key = symbols[i++]))result.push(key);
		  } return result;
		};

	/***/ },
	/* 411 */
	/***/ function(module, exports, __webpack_require__) {

		var getKeys   = __webpack_require__(57)
		  , toIObject = __webpack_require__(30);
		module.exports = function(object, el){
		  var O      = toIObject(object)
		    , keys   = getKeys(O)
		    , length = keys.length
		    , index  = 0
		    , key;
		  while(length > index)if(O[key = keys[index++]] === el)return key;
		};

	/***/ },
	/* 412 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var path      = __webpack_require__(413)
		  , invoke    = __webpack_require__(107)
		  , aFunction = __webpack_require__(27);
		module.exports = function(/* ...pargs */){
		  var fn     = aFunction(this)
		    , length = arguments.length
		    , pargs  = Array(length)
		    , i      = 0
		    , _      = path._
		    , holder = false;
		  while(length > i)if((pargs[i] = arguments[i++]) === _)holder = true;
		  return function(/* ...args */){
		    var that = this
		      , aLen = arguments.length
		      , j = 0, k = 0, args;
		    if(!holder && !aLen)return invoke(fn, pargs, that);
		    args = pargs.slice();
		    if(holder)for(;length > j; j++)if(args[j] === _)args[j] = arguments[k++];
		    while(aLen > k)args.push(arguments[k++]);
		    return invoke(fn, args, that);
		  };
		};

	/***/ },
	/* 413 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(8);

	/***/ },
	/* 414 */
	/***/ function(module, exports) {

		module.exports = function(regExp, replace){
		  var replacer = replace === Object(replace) ? function(part){
		    return replace[part];
		  } : replace;
		  return function(it){
		    return String(it).replace(regExp, replacer);
		  };
		};

	/***/ },
	/* 415 */
	/***/ function(module, exports, __webpack_require__) {

		var classof   = __webpack_require__(68)
		  , ITERATOR  = __webpack_require__(13)('iterator')
		  , Iterators = __webpack_require__(53);
		module.exports = __webpack_require__(40).isIterable = function(it){
		  var O = Object(it);
		  return O[ITERATOR] !== undefined
		    || '@@iterator' in O
		    || Iterators.hasOwnProperty(classof(O));
		};

	/***/ },
	/* 416 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/benjamingr/RexExp.escape
		var $export = __webpack_require__(1)
		  , $re     = __webpack_require__(414)(/[\\^$*+?.()|[\]{}]/g, '\\$&');

		$export($export.S, 'RegExp', {escape: function escape(it){ return $re(it); }});


	/***/ },
	/* 417 */
	/***/ function(module, exports, __webpack_require__) {

		// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)
		var $export = __webpack_require__(1);

		$export($export.P, 'Array', {copyWithin: __webpack_require__(211)});

		__webpack_require__(67)('copyWithin');

	/***/ },
	/* 418 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $every  = __webpack_require__(39)(4);

		$export($export.P + $export.F * !__webpack_require__(38)([].every, true), 'Array', {
		  // 22.1.3.5 / 15.4.4.16 Array.prototype.every(callbackfn [, thisArg])
		  every: function every(callbackfn /* , thisArg */){
		    return $every(this, callbackfn, arguments[1]);
		  }
		});

	/***/ },
	/* 419 */
	/***/ function(module, exports, __webpack_require__) {

		// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)
		var $export = __webpack_require__(1);

		$export($export.P, 'Array', {fill: __webpack_require__(140)});

		__webpack_require__(67)('fill');

	/***/ },
	/* 420 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $filter = __webpack_require__(39)(2);

		$export($export.P + $export.F * !__webpack_require__(38)([].filter, true), 'Array', {
		  // 22.1.3.7 / 15.4.4.20 Array.prototype.filter(callbackfn [, thisArg])
		  filter: function filter(callbackfn /* , thisArg */){
		    return $filter(this, callbackfn, arguments[1]);
		  }
		});

	/***/ },
	/* 421 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 22.1.3.9 Array.prototype.findIndex(predicate, thisArg = undefined)
		var $export = __webpack_require__(1)
		  , $find   = __webpack_require__(39)(6)
		  , KEY     = 'findIndex'
		  , forced  = true;
		// Shouldn't skip holes
		if(KEY in [])Array(1)[KEY](function(){ forced = false; });
		$export($export.P + $export.F * forced, 'Array', {
		  findIndex: function findIndex(callbackfn/*, that = undefined */){
		    return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);
		  }
		});
		__webpack_require__(67)(KEY);

	/***/ },
	/* 422 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 22.1.3.8 Array.prototype.find(predicate, thisArg = undefined)
		var $export = __webpack_require__(1)
		  , $find   = __webpack_require__(39)(5)
		  , KEY     = 'find'
		  , forced  = true;
		// Shouldn't skip holes
		if(KEY in [])Array(1)[KEY](function(){ forced = false; });
		$export($export.P + $export.F * forced, 'Array', {
		  find: function find(callbackfn/*, that = undefined */){
		    return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);
		  }
		});
		__webpack_require__(67)(KEY);

	/***/ },
	/* 423 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export  = __webpack_require__(1)
		  , $forEach = __webpack_require__(39)(0)
		  , STRICT   = __webpack_require__(38)([].forEach, true);

		$export($export.P + $export.F * !STRICT, 'Array', {
		  // 22.1.3.10 / 15.4.4.18 Array.prototype.forEach(callbackfn [, thisArg])
		  forEach: function forEach(callbackfn /* , thisArg */){
		    return $forEach(this, callbackfn, arguments[1]);
		  }
		});

	/***/ },
	/* 424 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var ctx            = __webpack_require__(44)
		  , $export        = __webpack_require__(1)
		  , toObject       = __webpack_require__(22)
		  , call           = __webpack_require__(219)
		  , isArrayIter    = __webpack_require__(147)
		  , toLength       = __webpack_require__(20)
		  , createProperty = __webpack_require__(141)
		  , getIterFn      = __webpack_require__(164);

		$export($export.S + $export.F * !__webpack_require__(109)(function(iter){ Array.from(iter); }), 'Array', {
		  // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)
		  from: function from(arrayLike/*, mapfn = undefined, thisArg = undefined*/){
		    var O       = toObject(arrayLike)
		      , C       = typeof this == 'function' ? this : Array
		      , aLen    = arguments.length
		      , mapfn   = aLen > 1 ? arguments[1] : undefined
		      , mapping = mapfn !== undefined
		      , index   = 0
		      , iterFn  = getIterFn(O)
		      , length, result, step, iterator;
		    if(mapping)mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2);
		    // if object isn't iterable or it's array with default iterator - use simple case
		    if(iterFn != undefined && !(C == Array && isArrayIter(iterFn))){
		      for(iterator = iterFn.call(O), result = new C; !(step = iterator.next()).done; index++){
		        createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value);
		      }
		    } else {
		      length = toLength(O.length);
		      for(result = new C(length); length > index; index++){
		        createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]);
		      }
		    }
		    result.length = index;
		    return result;
		  }
		});


	/***/ },
	/* 425 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export       = __webpack_require__(1)
		  , $indexOf      = __webpack_require__(103)(false)
		  , $native       = [].indexOf
		  , NEGATIVE_ZERO = !!$native && 1 / [1].indexOf(1, -0) < 0;

		$export($export.P + $export.F * (NEGATIVE_ZERO || !__webpack_require__(38)($native)), 'Array', {
		  // 22.1.3.11 / 15.4.4.14 Array.prototype.indexOf(searchElement [, fromIndex])
		  indexOf: function indexOf(searchElement /*, fromIndex = 0 */){
		    return NEGATIVE_ZERO
		      // convert -0 to +0
		      ? $native.apply(this, arguments) || 0
		      : $indexOf(this, searchElement, arguments[1]);
		  }
		});

	/***/ },
	/* 426 */
	/***/ function(module, exports, __webpack_require__) {

		// 22.1.2.2 / 15.4.3.2 Array.isArray(arg)
		var $export = __webpack_require__(1);

		$export($export.S, 'Array', {isArray: __webpack_require__(148)});

	/***/ },
	/* 427 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 22.1.3.13 Array.prototype.join(separator)
		var $export   = __webpack_require__(1)
		  , toIObject = __webpack_require__(30)
		  , arrayJoin = [].join;

		// fallback for not array-like strings
		$export($export.P + $export.F * (__webpack_require__(86) != Object || !__webpack_require__(38)(arrayJoin)), 'Array', {
		  join: function join(separator){
		    return arrayJoin.call(toIObject(this), separator === undefined ? ',' : separator);
		  }
		});

	/***/ },
	/* 428 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export       = __webpack_require__(1)
		  , toIObject     = __webpack_require__(30)
		  , toInteger     = __webpack_require__(52)
		  , toLength      = __webpack_require__(20)
		  , $native       = [].lastIndexOf
		  , NEGATIVE_ZERO = !!$native && 1 / [1].lastIndexOf(1, -0) < 0;

		$export($export.P + $export.F * (NEGATIVE_ZERO || !__webpack_require__(38)($native)), 'Array', {
		  // 22.1.3.14 / 15.4.4.15 Array.prototype.lastIndexOf(searchElement [, fromIndex])
		  lastIndexOf: function lastIndexOf(searchElement /*, fromIndex = @[*-1] */){
		    // convert -0 to +0
		    if(NEGATIVE_ZERO)return $native.apply(this, arguments) || 0;
		    var O      = toIObject(this)
		      , length = toLength(O.length)
		      , index  = length - 1;
		    if(arguments.length > 1)index = Math.min(index, toInteger(arguments[1]));
		    if(index < 0)index = length + index;
		    for(;index >= 0; index--)if(index in O)if(O[index] === searchElement)return index || 0;
		    return -1;
		  }
		});

	/***/ },
	/* 429 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $map    = __webpack_require__(39)(1);

		$export($export.P + $export.F * !__webpack_require__(38)([].map, true), 'Array', {
		  // 22.1.3.15 / 15.4.4.19 Array.prototype.map(callbackfn [, thisArg])
		  map: function map(callbackfn /* , thisArg */){
		    return $map(this, callbackfn, arguments[1]);
		  }
		});

	/***/ },
	/* 430 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export        = __webpack_require__(1)
		  , createProperty = __webpack_require__(141);

		// WebKit Array.of isn't generic
		$export($export.S + $export.F * __webpack_require__(9)(function(){
		  function F(){}
		  return !(Array.of.call(F) instanceof F);
		}), 'Array', {
		  // 22.1.2.3 Array.of( ...items)
		  of: function of(/* ...args */){
		    var index  = 0
		      , aLen   = arguments.length
		      , result = new (typeof this == 'function' ? this : Array)(aLen);
		    while(aLen > index)createProperty(result, index, arguments[index++]);
		    result.length = aLen;
		    return result;
		  }
		});

	/***/ },
	/* 431 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $reduce = __webpack_require__(213);

		$export($export.P + $export.F * !__webpack_require__(38)([].reduceRight, true), 'Array', {
		  // 22.1.3.19 / 15.4.4.22 Array.prototype.reduceRight(callbackfn [, initialValue])
		  reduceRight: function reduceRight(callbackfn /* , initialValue */){
		    return $reduce(this, callbackfn, arguments.length, arguments[1], true);
		  }
		});

	/***/ },
	/* 432 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $reduce = __webpack_require__(213);

		$export($export.P + $export.F * !__webpack_require__(38)([].reduce, true), 'Array', {
		  // 22.1.3.18 / 15.4.4.21 Array.prototype.reduce(callbackfn [, initialValue])
		  reduce: function reduce(callbackfn /* , initialValue */){
		    return $reduce(this, callbackfn, arguments.length, arguments[1], false);
		  }
		});

	/***/ },
	/* 433 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export    = __webpack_require__(1)
		  , html       = __webpack_require__(145)
		  , cof        = __webpack_require__(36)
		  , toIndex    = __webpack_require__(60)
		  , toLength   = __webpack_require__(20)
		  , arraySlice = [].slice;

		// fallback for not array-like ES3 strings and DOM objects
		$export($export.P + $export.F * __webpack_require__(9)(function(){
		  if(html)arraySlice.call(html);
		}), 'Array', {
		  slice: function slice(begin, end){
		    var len   = toLength(this.length)
		      , klass = cof(this);
		    end = end === undefined ? len : end;
		    if(klass == 'Array')return arraySlice.call(this, begin, end);
		    var start  = toIndex(begin, len)
		      , upTo   = toIndex(end, len)
		      , size   = toLength(upTo - start)
		      , cloned = Array(size)
		      , i      = 0;
		    for(; i < size; i++)cloned[i] = klass == 'String'
		      ? this.charAt(start + i)
		      : this[start + i];
		    return cloned;
		  }
		});

	/***/ },
	/* 434 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $some   = __webpack_require__(39)(3);

		$export($export.P + $export.F * !__webpack_require__(38)([].some, true), 'Array', {
		  // 22.1.3.23 / 15.4.4.17 Array.prototype.some(callbackfn [, thisArg])
		  some: function some(callbackfn /* , thisArg */){
		    return $some(this, callbackfn, arguments[1]);
		  }
		});

	/***/ },
	/* 435 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export   = __webpack_require__(1)
		  , aFunction = __webpack_require__(27)
		  , toObject  = __webpack_require__(22)
		  , fails     = __webpack_require__(9)
		  , $sort     = [].sort
		  , test      = [1, 2, 3];

		$export($export.P + $export.F * (fails(function(){
		  // IE8-
		  test.sort(undefined);
		}) || !fails(function(){
		  // V8 bug
		  test.sort(null);
		  // Old WebKit
		}) || !__webpack_require__(38)($sort)), 'Array', {
		  // 22.1.3.25 Array.prototype.sort(comparefn)
		  sort: function sort(comparefn){
		    return comparefn === undefined
		      ? $sort.call(toObject(this))
		      : $sort.call(toObject(this), aFunction(comparefn));
		  }
		});

	/***/ },
	/* 436 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(59)('Array');

	/***/ },
	/* 437 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.3.3.1 / 15.9.4.4 Date.now()
		var $export = __webpack_require__(1);

		$export($export.S, 'Date', {now: function(){ return new Date().getTime(); }});

	/***/ },
	/* 438 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()
		var $export = __webpack_require__(1)
		  , fails   = __webpack_require__(9)
		  , getTime = Date.prototype.getTime;

		var lz = function(num){
		  return num > 9 ? num : '0' + num;
		};

		// PhantomJS / old WebKit has a broken implementations
		$export($export.P + $export.F * (fails(function(){
		  return new Date(-5e13 - 1).toISOString() != '0385-07-25T07:06:39.999Z';
		}) || !fails(function(){
		  new Date(NaN).toISOString();
		})), 'Date', {
		  toISOString: function toISOString(){
		    if(!isFinite(getTime.call(this)))throw RangeError('Invalid time value');
		    var d = this
		      , y = d.getUTCFullYear()
		      , m = d.getUTCMilliseconds()
		      , s = y < 0 ? '-' : y > 9999 ? '+' : '';
		    return s + ('00000' + Math.abs(y)).slice(s ? -6 : -4) +
		      '-' + lz(d.getUTCMonth() + 1) + '-' + lz(d.getUTCDate()) +
		      'T' + lz(d.getUTCHours()) + ':' + lz(d.getUTCMinutes()) +
		      ':' + lz(d.getUTCSeconds()) + '.' + (m > 99 ? m : '0' + lz(m)) + 'Z';
		  }
		});

	/***/ },
	/* 439 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export     = __webpack_require__(1)
		  , toObject    = __webpack_require__(22)
		  , toPrimitive = __webpack_require__(42);

		$export($export.P + $export.F * __webpack_require__(9)(function(){
		  return new Date(NaN).toJSON() !== null || Date.prototype.toJSON.call({toISOString: function(){ return 1; }}) !== 1;
		}), 'Date', {
		  toJSON: function toJSON(key){
		    var O  = toObject(this)
		      , pv = toPrimitive(O);
		    return typeof pv == 'number' && !isFinite(pv) ? null : O.toISOString();
		  }
		});

	/***/ },
	/* 440 */
	/***/ function(module, exports, __webpack_require__) {

		var TO_PRIMITIVE = __webpack_require__(13)('toPrimitive')
		  , proto        = Date.prototype;

		if(!(TO_PRIMITIVE in proto))__webpack_require__(25)(proto, TO_PRIMITIVE, __webpack_require__(409));

	/***/ },
	/* 441 */
	/***/ function(module, exports, __webpack_require__) {

		var DateProto    = Date.prototype
		  , INVALID_DATE = 'Invalid Date'
		  , TO_STRING    = 'toString'
		  , $toString    = DateProto[TO_STRING]
		  , getTime      = DateProto.getTime;
		if(new Date(NaN) + '' != INVALID_DATE){
		  __webpack_require__(28)(DateProto, TO_STRING, function toString(){
		    var value = getTime.call(this);
		    return value === value ? $toString.call(this) : INVALID_DATE;
		  });
		}

	/***/ },
	/* 442 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.2.3.2 / 15.3.4.5 Function.prototype.bind(thisArg, args...)
		var $export = __webpack_require__(1);

		$export($export.P, 'Function', {bind: __webpack_require__(214)});

	/***/ },
	/* 443 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var isObject       = __webpack_require__(12)
		  , getPrototypeOf = __webpack_require__(33)
		  , HAS_INSTANCE   = __webpack_require__(13)('hasInstance')
		  , FunctionProto  = Function.prototype;
		// 19.2.3.6 Function.prototype[@@hasInstance](V)
		if(!(HAS_INSTANCE in FunctionProto))__webpack_require__(16).f(FunctionProto, HAS_INSTANCE, {value: function(O){
		  if(typeof this != 'function' || !isObject(O))return false;
		  if(!isObject(this.prototype))return O instanceof this;
		  // for environment w/o native `@@hasInstance` logic enough `instanceof`, but add this:
		  while(O = getPrototypeOf(O))if(this.prototype === O)return true;
		  return false;
		}});

	/***/ },
	/* 444 */
	/***/ function(module, exports, __webpack_require__) {

		var dP         = __webpack_require__(16).f
		  , createDesc = __webpack_require__(51)
		  , has        = __webpack_require__(23)
		  , FProto     = Function.prototype
		  , nameRE     = /^\s*function ([^ (]*)/
		  , NAME       = 'name';

		var isExtensible = Object.isExtensible || function(){
		  return true;
		};

		// 19.2.4.2 name
		NAME in FProto || __webpack_require__(15) && dP(FProto, NAME, {
		  configurable: true,
		  get: function(){
		    try {
		      var that = this
		        , name = ('' + that).match(nameRE)[1];
		      has(that, NAME) || !isExtensible(that) || dP(that, NAME, createDesc(5, name));
		      return name;
		    } catch(e){
		      return '';
		    }
		  }
		});

	/***/ },
	/* 445 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.3 Math.acosh(x)
		var $export = __webpack_require__(1)
		  , log1p   = __webpack_require__(221)
		  , sqrt    = Math.sqrt
		  , $acosh  = Math.acosh;

		$export($export.S + $export.F * !($acosh
		  // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509
		  && Math.floor($acosh(Number.MAX_VALUE)) == 710
		  // Tor Browser bug: Math.acosh(Infinity) -> NaN 
		  && $acosh(Infinity) == Infinity
		), 'Math', {
		  acosh: function acosh(x){
		    return (x = +x) < 1 ? NaN : x > 94906265.62425156
		      ? Math.log(x) + Math.LN2
		      : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1));
		  }
		});

	/***/ },
	/* 446 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.5 Math.asinh(x)
		var $export = __webpack_require__(1)
		  , $asinh  = Math.asinh;

		function asinh(x){
		  return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : Math.log(x + Math.sqrt(x * x + 1));
		}

		// Tor Browser bug: Math.asinh(0) -> -0 
		$export($export.S + $export.F * !($asinh && 1 / $asinh(0) > 0), 'Math', {asinh: asinh});

	/***/ },
	/* 447 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.7 Math.atanh(x)
		var $export = __webpack_require__(1)
		  , $atanh  = Math.atanh;

		// Tor Browser bug: Math.atanh(-0) -> 0 
		$export($export.S + $export.F * !($atanh && 1 / $atanh(-0) < 0), 'Math', {
		  atanh: function atanh(x){
		    return (x = +x) == 0 ? x : Math.log((1 + x) / (1 - x)) / 2;
		  }
		});

	/***/ },
	/* 448 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.9 Math.cbrt(x)
		var $export = __webpack_require__(1)
		  , sign    = __webpack_require__(153);

		$export($export.S, 'Math', {
		  cbrt: function cbrt(x){
		    return sign(x = +x) * Math.pow(Math.abs(x), 1 / 3);
		  }
		});

	/***/ },
	/* 449 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.11 Math.clz32(x)
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  clz32: function clz32(x){
		    return (x >>>= 0) ? 31 - Math.floor(Math.log(x + 0.5) * Math.LOG2E) : 32;
		  }
		});

	/***/ },
	/* 450 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.12 Math.cosh(x)
		var $export = __webpack_require__(1)
		  , exp     = Math.exp;

		$export($export.S, 'Math', {
		  cosh: function cosh(x){
		    return (exp(x = +x) + exp(-x)) / 2;
		  }
		});

	/***/ },
	/* 451 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.14 Math.expm1(x)
		var $export = __webpack_require__(1)
		  , $expm1  = __webpack_require__(152);

		$export($export.S + $export.F * ($expm1 != Math.expm1), 'Math', {expm1: $expm1});

	/***/ },
	/* 452 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.16 Math.fround(x)
		var $export   = __webpack_require__(1)
		  , sign      = __webpack_require__(153)
		  , pow       = Math.pow
		  , EPSILON   = pow(2, -52)
		  , EPSILON32 = pow(2, -23)
		  , MAX32     = pow(2, 127) * (2 - EPSILON32)
		  , MIN32     = pow(2, -126);

		var roundTiesToEven = function(n){
		  return n + 1 / EPSILON - 1 / EPSILON;
		};


		$export($export.S, 'Math', {
		  fround: function fround(x){
		    var $abs  = Math.abs(x)
		      , $sign = sign(x)
		      , a, result;
		    if($abs < MIN32)return $sign * roundTiesToEven($abs / MIN32 / EPSILON32) * MIN32 * EPSILON32;
		    a = (1 + EPSILON32 / EPSILON) * $abs;
		    result = a - (a - $abs);
		    if(result > MAX32 || result != result)return $sign * Infinity;
		    return $sign * result;
		  }
		});

	/***/ },
	/* 453 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.17 Math.hypot([value1[, value2[, … ]]])
		var $export = __webpack_require__(1)
		  , abs     = Math.abs;

		$export($export.S, 'Math', {
		  hypot: function hypot(value1, value2){ // eslint-disable-line no-unused-vars
		    var sum  = 0
		      , i    = 0
		      , aLen = arguments.length
		      , larg = 0
		      , arg, div;
		    while(i < aLen){
		      arg = abs(arguments[i++]);
		      if(larg < arg){
		        div  = larg / arg;
		        sum  = sum * div * div + 1;
		        larg = arg;
		      } else if(arg > 0){
		        div  = arg / larg;
		        sum += div * div;
		      } else sum += arg;
		    }
		    return larg === Infinity ? Infinity : larg * Math.sqrt(sum);
		  }
		});

	/***/ },
	/* 454 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.18 Math.imul(x, y)
		var $export = __webpack_require__(1)
		  , $imul   = Math.imul;

		// some WebKit versions fails with big numbers, some has wrong arity
		$export($export.S + $export.F * __webpack_require__(9)(function(){
		  return $imul(0xffffffff, 5) != -5 || $imul.length != 2;
		}), 'Math', {
		  imul: function imul(x, y){
		    var UINT16 = 0xffff
		      , xn = +x
		      , yn = +y
		      , xl = UINT16 & xn
		      , yl = UINT16 & yn;
		    return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0);
		  }
		});

	/***/ },
	/* 455 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.21 Math.log10(x)
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  log10: function log10(x){
		    return Math.log(x) / Math.LN10;
		  }
		});

	/***/ },
	/* 456 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.20 Math.log1p(x)
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {log1p: __webpack_require__(221)});

	/***/ },
	/* 457 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.22 Math.log2(x)
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  log2: function log2(x){
		    return Math.log(x) / Math.LN2;
		  }
		});

	/***/ },
	/* 458 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.28 Math.sign(x)
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {sign: __webpack_require__(153)});

	/***/ },
	/* 459 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.30 Math.sinh(x)
		var $export = __webpack_require__(1)
		  , expm1   = __webpack_require__(152)
		  , exp     = Math.exp;

		// V8 near Chromium 38 has a problem with very small numbers
		$export($export.S + $export.F * __webpack_require__(9)(function(){
		  return !Math.sinh(-2e-17) != -2e-17;
		}), 'Math', {
		  sinh: function sinh(x){
		    return Math.abs(x = +x) < 1
		      ? (expm1(x) - expm1(-x)) / 2
		      : (exp(x - 1) - exp(-x - 1)) * (Math.E / 2);
		  }
		});

	/***/ },
	/* 460 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.33 Math.tanh(x)
		var $export = __webpack_require__(1)
		  , expm1   = __webpack_require__(152)
		  , exp     = Math.exp;

		$export($export.S, 'Math', {
		  tanh: function tanh(x){
		    var a = expm1(x = +x)
		      , b = expm1(-x);
		    return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x));
		  }
		});

	/***/ },
	/* 461 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.2.2.34 Math.trunc(x)
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  trunc: function trunc(it){
		    return (it > 0 ? Math.floor : Math.ceil)(it);
		  }
		});

	/***/ },
	/* 462 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var global            = __webpack_require__(8)
		  , has               = __webpack_require__(23)
		  , cof               = __webpack_require__(36)
		  , inheritIfRequired = __webpack_require__(146)
		  , toPrimitive       = __webpack_require__(42)
		  , fails             = __webpack_require__(9)
		  , gOPN              = __webpack_require__(56).f
		  , gOPD              = __webpack_require__(32).f
		  , dP                = __webpack_require__(16).f
		  , $trim             = __webpack_require__(71).trim
		  , NUMBER            = 'Number'
		  , $Number           = global[NUMBER]
		  , Base              = $Number
		  , proto             = $Number.prototype
		  // Opera ~12 has broken Object#toString
		  , BROKEN_COF        = cof(__webpack_require__(55)(proto)) == NUMBER
		  , TRIM              = 'trim' in String.prototype;

		// 7.1.3 ToNumber(argument)
		var toNumber = function(argument){
		  var it = toPrimitive(argument, false);
		  if(typeof it == 'string' && it.length > 2){
		    it = TRIM ? it.trim() : $trim(it, 3);
		    var first = it.charCodeAt(0)
		      , third, radix, maxCode;
		    if(first === 43 || first === 45){
		      third = it.charCodeAt(2);
		      if(third === 88 || third === 120)return NaN; // Number('+0x1') should be NaN, old V8 fix
		    } else if(first === 48){
		      switch(it.charCodeAt(1)){
		        case 66 : case 98  : radix = 2; maxCode = 49; break; // fast equal /^0b[01]+$/i
		        case 79 : case 111 : radix = 8; maxCode = 55; break; // fast equal /^0o[0-7]+$/i
		        default : return +it;
		      }
		      for(var digits = it.slice(2), i = 0, l = digits.length, code; i < l; i++){
		        code = digits.charCodeAt(i);
		        // parseInt parses a string to a first unavailable symbol
		        // but ToNumber should return NaN if a string contains unavailable symbols
		        if(code < 48 || code > maxCode)return NaN;
		      } return parseInt(digits, radix);
		    }
		  } return +it;
		};

		if(!$Number(' 0o1') || !$Number('0b1') || $Number('+0x1')){
		  $Number = function Number(value){
		    var it = arguments.length < 1 ? 0 : value
		      , that = this;
		    return that instanceof $Number
		      // check on 1..constructor(foo) case
		      && (BROKEN_COF ? fails(function(){ proto.valueOf.call(that); }) : cof(that) != NUMBER)
		        ? inheritIfRequired(new Base(toNumber(it)), that, $Number) : toNumber(it);
		  };
		  for(var keys = __webpack_require__(15) ? gOPN(Base) : (
		    // ES3:
		    'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +
		    // ES6 (in case, if modules with ES6 Number statics required before):
		    'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' +
		    'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger'
		  ).split(','), j = 0, key; keys.length > j; j++){
		    if(has(Base, key = keys[j]) && !has($Number, key)){
		      dP($Number, key, gOPD(Base, key));
		    }
		  }
		  $Number.prototype = proto;
		  proto.constructor = $Number;
		  __webpack_require__(28)(global, NUMBER, $Number);
		}

	/***/ },
	/* 463 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.1 Number.EPSILON
		var $export = __webpack_require__(1);

		$export($export.S, 'Number', {EPSILON: Math.pow(2, -52)});

	/***/ },
	/* 464 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.2 Number.isFinite(number)
		var $export   = __webpack_require__(1)
		  , _isFinite = __webpack_require__(8).isFinite;

		$export($export.S, 'Number', {
		  isFinite: function isFinite(it){
		    return typeof it == 'number' && _isFinite(it);
		  }
		});

	/***/ },
	/* 465 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.3 Number.isInteger(number)
		var $export = __webpack_require__(1);

		$export($export.S, 'Number', {isInteger: __webpack_require__(149)});

	/***/ },
	/* 466 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.4 Number.isNaN(number)
		var $export = __webpack_require__(1);

		$export($export.S, 'Number', {
		  isNaN: function isNaN(number){
		    return number != number;
		  }
		});

	/***/ },
	/* 467 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.5 Number.isSafeInteger(number)
		var $export   = __webpack_require__(1)
		  , isInteger = __webpack_require__(149)
		  , abs       = Math.abs;

		$export($export.S, 'Number', {
		  isSafeInteger: function isSafeInteger(number){
		    return isInteger(number) && abs(number) <= 0x1fffffffffffff;
		  }
		});

	/***/ },
	/* 468 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.6 Number.MAX_SAFE_INTEGER
		var $export = __webpack_require__(1);

		$export($export.S, 'Number', {MAX_SAFE_INTEGER: 0x1fffffffffffff});

	/***/ },
	/* 469 */
	/***/ function(module, exports, __webpack_require__) {

		// 20.1.2.10 Number.MIN_SAFE_INTEGER
		var $export = __webpack_require__(1);

		$export($export.S, 'Number', {MIN_SAFE_INTEGER: -0x1fffffffffffff});

	/***/ },
	/* 470 */
	/***/ function(module, exports, __webpack_require__) {

		var $export     = __webpack_require__(1)
		  , $parseFloat = __webpack_require__(228);
		// 20.1.2.12 Number.parseFloat(string)
		$export($export.S + $export.F * (Number.parseFloat != $parseFloat), 'Number', {parseFloat: $parseFloat});

	/***/ },
	/* 471 */
	/***/ function(module, exports, __webpack_require__) {

		var $export   = __webpack_require__(1)
		  , $parseInt = __webpack_require__(229);
		// 20.1.2.13 Number.parseInt(string, radix)
		$export($export.S + $export.F * (Number.parseInt != $parseInt), 'Number', {parseInt: $parseInt});

	/***/ },
	/* 472 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export      = __webpack_require__(1)
		  , anInstance   = __webpack_require__(49)
		  , toInteger    = __webpack_require__(52)
		  , aNumberValue = __webpack_require__(210)
		  , repeat       = __webpack_require__(159)
		  , $toFixed     = 1..toFixed
		  , floor        = Math.floor
		  , data         = [0, 0, 0, 0, 0, 0]
		  , ERROR        = 'Number.toFixed: incorrect invocation!'
		  , ZERO         = '0';

		var multiply = function(n, c){
		  var i  = -1
		    , c2 = c;
		  while(++i < 6){
		    c2 += n * data[i];
		    data[i] = c2 % 1e7;
		    c2 = floor(c2 / 1e7);
		  }
		};
		var divide = function(n){
		  var i = 6
		    , c = 0;
		  while(--i >= 0){
		    c += data[i];
		    data[i] = floor(c / n);
		    c = (c % n) * 1e7;
		  }
		};
		var numToString = function(){
		  var i = 6
		    , s = '';
		  while(--i >= 0){
		    if(s !== '' || i === 0 || data[i] !== 0){
		      var t = String(data[i]);
		      s = s === '' ? t : s + repeat.call(ZERO, 7 - t.length) + t;
		    }
		  } return s;
		};
		var pow = function(x, n, acc){
		  return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);
		};
		var log = function(x){
		  var n  = 0
		    , x2 = x;
		  while(x2 >= 4096){
		    n += 12;
		    x2 /= 4096;
		  }
		  while(x2 >= 2){
		    n  += 1;
		    x2 /= 2;
		  } return n;
		};

		$export($export.P + $export.F * (!!$toFixed && (
		  0.00008.toFixed(3) !== '0.000' ||
		  0.9.toFixed(0) !== '1' ||
		  1.255.toFixed(2) !== '1.25' ||
		  1000000000000000128..toFixed(0) !== '1000000000000000128'
		) || !__webpack_require__(9)(function(){
		  // V8 ~ Android 4.3-
		  $toFixed.call({});
		})), 'Number', {
		  toFixed: function toFixed(fractionDigits){
		    var x = aNumberValue(this, ERROR)
		      , f = toInteger(fractionDigits)
		      , s = ''
		      , m = ZERO
		      , e, z, j, k;
		    if(f < 0 || f > 20)throw RangeError(ERROR);
		    if(x != x)return 'NaN';
		    if(x <= -1e21 || x >= 1e21)return String(x);
		    if(x < 0){
		      s = '-';
		      x = -x;
		    }
		    if(x > 1e-21){
		      e = log(x * pow(2, 69, 1)) - 69;
		      z = e < 0 ? x * pow(2, -e, 1) : x / pow(2, e, 1);
		      z *= 0x10000000000000;
		      e = 52 - e;
		      if(e > 0){
		        multiply(0, z);
		        j = f;
		        while(j >= 7){
		          multiply(1e7, 0);
		          j -= 7;
		        }
		        multiply(pow(10, j, 1), 0);
		        j = e - 1;
		        while(j >= 23){
		          divide(1 << 23);
		          j -= 23;
		        }
		        divide(1 << j);
		        multiply(1, 1);
		        divide(2);
		        m = numToString();
		      } else {
		        multiply(0, z);
		        multiply(1 << -e, 0);
		        m = numToString() + repeat.call(ZERO, f);
		      }
		    }
		    if(f > 0){
		      k = m.length;
		      m = s + (k <= f ? '0.' + repeat.call(ZERO, f - k) + m : m.slice(0, k - f) + '.' + m.slice(k - f));
		    } else {
		      m = s + m;
		    } return m;
		  }
		});

	/***/ },
	/* 473 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export      = __webpack_require__(1)
		  , $fails       = __webpack_require__(9)
		  , aNumberValue = __webpack_require__(210)
		  , $toPrecision = 1..toPrecision;

		$export($export.P + $export.F * ($fails(function(){
		  // IE7-
		  return $toPrecision.call(1, undefined) !== '1';
		}) || !$fails(function(){
		  // V8 ~ Android 4.3-
		  $toPrecision.call({});
		})), 'Number', {
		  toPrecision: function toPrecision(precision){
		    var that = aNumberValue(this, 'Number#toPrecision: incorrect invocation!');
		    return precision === undefined ? $toPrecision.call(that) : $toPrecision.call(that, precision); 
		  }
		});

	/***/ },
	/* 474 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.3.1 Object.assign(target, source)
		var $export = __webpack_require__(1);

		$export($export.S + $export.F, 'Object', {assign: __webpack_require__(222)});

	/***/ },
	/* 475 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1)
		// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])
		$export($export.S, 'Object', {create: __webpack_require__(55)});

	/***/ },
	/* 476 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1);
		// 19.1.2.3 / 15.2.3.7 Object.defineProperties(O, Properties)
		$export($export.S + $export.F * !__webpack_require__(15), 'Object', {defineProperties: __webpack_require__(223)});

	/***/ },
	/* 477 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1);
		// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)
		$export($export.S + $export.F * !__webpack_require__(15), 'Object', {defineProperty: __webpack_require__(16).f});

	/***/ },
	/* 478 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.5 Object.freeze(O)
		var isObject = __webpack_require__(12)
		  , meta     = __webpack_require__(50).onFreeze;

		__webpack_require__(41)('freeze', function($freeze){
		  return function freeze(it){
		    return $freeze && isObject(it) ? $freeze(meta(it)) : it;
		  };
		});

	/***/ },
	/* 479 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)
		var toIObject                 = __webpack_require__(30)
		  , $getOwnPropertyDescriptor = __webpack_require__(32).f;

		__webpack_require__(41)('getOwnPropertyDescriptor', function(){
		  return function getOwnPropertyDescriptor(it, key){
		    return $getOwnPropertyDescriptor(toIObject(it), key);
		  };
		});

	/***/ },
	/* 480 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.7 Object.getOwnPropertyNames(O)
		__webpack_require__(41)('getOwnPropertyNames', function(){
		  return __webpack_require__(224).f;
		});

	/***/ },
	/* 481 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.9 Object.getPrototypeOf(O)
		var toObject        = __webpack_require__(22)
		  , $getPrototypeOf = __webpack_require__(33);

		__webpack_require__(41)('getPrototypeOf', function(){
		  return function getPrototypeOf(it){
		    return $getPrototypeOf(toObject(it));
		  };
		});

	/***/ },
	/* 482 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.11 Object.isExtensible(O)
		var isObject = __webpack_require__(12);

		__webpack_require__(41)('isExtensible', function($isExtensible){
		  return function isExtensible(it){
		    return isObject(it) ? $isExtensible ? $isExtensible(it) : true : false;
		  };
		});

	/***/ },
	/* 483 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.12 Object.isFrozen(O)
		var isObject = __webpack_require__(12);

		__webpack_require__(41)('isFrozen', function($isFrozen){
		  return function isFrozen(it){
		    return isObject(it) ? $isFrozen ? $isFrozen(it) : false : true;
		  };
		});

	/***/ },
	/* 484 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.13 Object.isSealed(O)
		var isObject = __webpack_require__(12);

		__webpack_require__(41)('isSealed', function($isSealed){
		  return function isSealed(it){
		    return isObject(it) ? $isSealed ? $isSealed(it) : false : true;
		  };
		});

	/***/ },
	/* 485 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.3.10 Object.is(value1, value2)
		var $export = __webpack_require__(1);
		$export($export.S, 'Object', {is: __webpack_require__(230)});

	/***/ },
	/* 486 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.14 Object.keys(O)
		var toObject = __webpack_require__(22)
		  , $keys    = __webpack_require__(57);

		__webpack_require__(41)('keys', function(){
		  return function keys(it){
		    return $keys(toObject(it));
		  };
		});

	/***/ },
	/* 487 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.15 Object.preventExtensions(O)
		var isObject = __webpack_require__(12)
		  , meta     = __webpack_require__(50).onFreeze;

		__webpack_require__(41)('preventExtensions', function($preventExtensions){
		  return function preventExtensions(it){
		    return $preventExtensions && isObject(it) ? $preventExtensions(meta(it)) : it;
		  };
		});

	/***/ },
	/* 488 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.2.17 Object.seal(O)
		var isObject = __webpack_require__(12)
		  , meta     = __webpack_require__(50).onFreeze;

		__webpack_require__(41)('seal', function($seal){
		  return function seal(it){
		    return $seal && isObject(it) ? $seal(meta(it)) : it;
		  };
		});

	/***/ },
	/* 489 */
	/***/ function(module, exports, __webpack_require__) {

		// 19.1.3.19 Object.setPrototypeOf(O, proto)
		var $export = __webpack_require__(1);
		$export($export.S, 'Object', {setPrototypeOf: __webpack_require__(112).set});

	/***/ },
	/* 490 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 19.1.3.6 Object.prototype.toString()
		var classof = __webpack_require__(68)
		  , test    = {};
		test[__webpack_require__(13)('toStringTag')] = 'z';
		if(test + '' != '[object z]'){
		  __webpack_require__(28)(Object.prototype, 'toString', function toString(){
		    return '[object ' + classof(this) + ']';
		  }, true);
		}

	/***/ },
	/* 491 */
	/***/ function(module, exports, __webpack_require__) {

		var $export     = __webpack_require__(1)
		  , $parseFloat = __webpack_require__(228);
		// 18.2.4 parseFloat(string)
		$export($export.G + $export.F * (parseFloat != $parseFloat), {parseFloat: $parseFloat});

	/***/ },
	/* 492 */
	/***/ function(module, exports, __webpack_require__) {

		var $export   = __webpack_require__(1)
		  , $parseInt = __webpack_require__(229);
		// 18.2.5 parseInt(string, radix)
		$export($export.G + $export.F * (parseInt != $parseInt), {parseInt: $parseInt});

	/***/ },
	/* 493 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var LIBRARY            = __webpack_require__(54)
		  , global             = __webpack_require__(8)
		  , ctx                = __webpack_require__(44)
		  , classof            = __webpack_require__(68)
		  , $export            = __webpack_require__(1)
		  , isObject           = __webpack_require__(12)
		  , anObject           = __webpack_require__(6)
		  , aFunction          = __webpack_require__(27)
		  , anInstance         = __webpack_require__(49)
		  , forOf              = __webpack_require__(69)
		  , setProto           = __webpack_require__(112).set
		  , speciesConstructor = __webpack_require__(156)
		  , task               = __webpack_require__(161).set
		  , microtask          = __webpack_require__(154)()
		  , PROMISE            = 'Promise'
		  , TypeError          = global.TypeError
		  , process            = global.process
		  , $Promise           = global[PROMISE]
		  , process            = global.process
		  , isNode             = classof(process) == 'process'
		  , empty              = function(){ /* empty */ }
		  , Internal, GenericPromiseCapability, Wrapper;

		var USE_NATIVE = !!function(){
		  try {
		    // correct subclassing with @@species support
		    var promise     = $Promise.resolve(1)
		      , FakePromise = (promise.constructor = {})[__webpack_require__(13)('species')] = function(exec){ exec(empty, empty); };
		    // unhandled rejections tracking support, NodeJS Promise without it fails @@species test
		    return (isNode || typeof PromiseRejectionEvent == 'function') && promise.then(empty) instanceof FakePromise;
		  } catch(e){ /* empty */ }
		}();

		// helpers
		var sameConstructor = function(a, b){
		  // with library wrapper special case
		  return a === b || a === $Promise && b === Wrapper;
		};
		var isThenable = function(it){
		  var then;
		  return isObject(it) && typeof (then = it.then) == 'function' ? then : false;
		};
		var newPromiseCapability = function(C){
		  return sameConstructor($Promise, C)
		    ? new PromiseCapability(C)
		    : new GenericPromiseCapability(C);
		};
		var PromiseCapability = GenericPromiseCapability = function(C){
		  var resolve, reject;
		  this.promise = new C(function($$resolve, $$reject){
		    if(resolve !== undefined || reject !== undefined)throw TypeError('Bad Promise constructor');
		    resolve = $$resolve;
		    reject  = $$reject;
		  });
		  this.resolve = aFunction(resolve);
		  this.reject  = aFunction(reject);
		};
		var perform = function(exec){
		  try {
		    exec();
		  } catch(e){
		    return {error: e};
		  }
		};
		var notify = function(promise, isReject){
		  if(promise._n)return;
		  promise._n = true;
		  var chain = promise._c;
		  microtask(function(){
		    var value = promise._v
		      , ok    = promise._s == 1
		      , i     = 0;
		    var run = function(reaction){
		      var handler = ok ? reaction.ok : reaction.fail
		        , resolve = reaction.resolve
		        , reject  = reaction.reject
		        , domain  = reaction.domain
		        , result, then;
		      try {
		        if(handler){
		          if(!ok){
		            if(promise._h == 2)onHandleUnhandled(promise);
		            promise._h = 1;
		          }
		          if(handler === true)result = value;
		          else {
		            if(domain)domain.enter();
		            result = handler(value);
		            if(domain)domain.exit();
		          }
		          if(result === reaction.promise){
		            reject(TypeError('Promise-chain cycle'));
		          } else if(then = isThenable(result)){
		            then.call(result, resolve, reject);
		          } else resolve(result);
		        } else reject(value);
		      } catch(e){
		        reject(e);
		      }
		    };
		    while(chain.length > i)run(chain[i++]); // variable length - can't use forEach
		    promise._c = [];
		    promise._n = false;
		    if(isReject && !promise._h)onUnhandled(promise);
		  });
		};
		var onUnhandled = function(promise){
		  task.call(global, function(){
		    var value = promise._v
		      , abrupt, handler, console;
		    if(isUnhandled(promise)){
		      abrupt = perform(function(){
		        if(isNode){
		          process.emit('unhandledRejection', value, promise);
		        } else if(handler = global.onunhandledrejection){
		          handler({promise: promise, reason: value});
		        } else if((console = global.console) && console.error){
		          console.error('Unhandled promise rejection', value);
		        }
		      });
		      // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should
		      promise._h = isNode || isUnhandled(promise) ? 2 : 1;
		    } promise._a = undefined;
		    if(abrupt)throw abrupt.error;
		  });
		};
		var isUnhandled = function(promise){
		  if(promise._h == 1)return false;
		  var chain = promise._a || promise._c
		    , i     = 0
		    , reaction;
		  while(chain.length > i){
		    reaction = chain[i++];
		    if(reaction.fail || !isUnhandled(reaction.promise))return false;
		  } return true;
		};
		var onHandleUnhandled = function(promise){
		  task.call(global, function(){
		    var handler;
		    if(isNode){
		      process.emit('rejectionHandled', promise);
		    } else if(handler = global.onrejectionhandled){
		      handler({promise: promise, reason: promise._v});
		    }
		  });
		};
		var $reject = function(value){
		  var promise = this;
		  if(promise._d)return;
		  promise._d = true;
		  promise = promise._w || promise; // unwrap
		  promise._v = value;
		  promise._s = 2;
		  if(!promise._a)promise._a = promise._c.slice();
		  notify(promise, true);
		};
		var $resolve = function(value){
		  var promise = this
		    , then;
		  if(promise._d)return;
		  promise._d = true;
		  promise = promise._w || promise; // unwrap
		  try {
		    if(promise === value)throw TypeError("Promise can't be resolved itself");
		    if(then = isThenable(value)){
		      microtask(function(){
		        var wrapper = {_w: promise, _d: false}; // wrap
		        try {
		          then.call(value, ctx($resolve, wrapper, 1), ctx($reject, wrapper, 1));
		        } catch(e){
		          $reject.call(wrapper, e);
		        }
		      });
		    } else {
		      promise._v = value;
		      promise._s = 1;
		      notify(promise, false);
		    }
		  } catch(e){
		    $reject.call({_w: promise, _d: false}, e); // wrap
		  }
		};

		// constructor polyfill
		if(!USE_NATIVE){
		  // 25.4.3.1 Promise(executor)
		  $Promise = function Promise(executor){
		    anInstance(this, $Promise, PROMISE, '_h');
		    aFunction(executor);
		    Internal.call(this);
		    try {
		      executor(ctx($resolve, this, 1), ctx($reject, this, 1));
		    } catch(err){
		      $reject.call(this, err);
		    }
		  };
		  Internal = function Promise(executor){
		    this._c = [];             // <- awaiting reactions
		    this._a = undefined;      // <- checked in isUnhandled reactions
		    this._s = 0;              // <- state
		    this._d = false;          // <- done
		    this._v = undefined;      // <- value
		    this._h = 0;              // <- rejection state, 0 - default, 1 - handled, 2 - unhandled
		    this._n = false;          // <- notify
		  };
		  Internal.prototype = __webpack_require__(58)($Promise.prototype, {
		    // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected)
		    then: function then(onFulfilled, onRejected){
		      var reaction    = newPromiseCapability(speciesConstructor(this, $Promise));
		      reaction.ok     = typeof onFulfilled == 'function' ? onFulfilled : true;
		      reaction.fail   = typeof onRejected == 'function' && onRejected;
		      reaction.domain = isNode ? process.domain : undefined;
		      this._c.push(reaction);
		      if(this._a)this._a.push(reaction);
		      if(this._s)notify(this, false);
		      return reaction.promise;
		    },
		    // 25.4.5.1 Promise.prototype.catch(onRejected)
		    'catch': function(onRejected){
		      return this.then(undefined, onRejected);
		    }
		  });
		  PromiseCapability = function(){
		    var promise  = new Internal;
		    this.promise = promise;
		    this.resolve = ctx($resolve, promise, 1);
		    this.reject  = ctx($reject, promise, 1);
		  };
		}

		$export($export.G + $export.W + $export.F * !USE_NATIVE, {Promise: $Promise});
		__webpack_require__(70)($Promise, PROMISE);
		__webpack_require__(59)(PROMISE);
		Wrapper = __webpack_require__(40)[PROMISE];

		// statics
		$export($export.S + $export.F * !USE_NATIVE, PROMISE, {
		  // 25.4.4.5 Promise.reject(r)
		  reject: function reject(r){
		    var capability = newPromiseCapability(this)
		      , $$reject   = capability.reject;
		    $$reject(r);
		    return capability.promise;
		  }
		});
		$export($export.S + $export.F * (LIBRARY || !USE_NATIVE), PROMISE, {
		  // 25.4.4.6 Promise.resolve(x)
		  resolve: function resolve(x){
		    // instanceof instead of internal slot check because we should fix it without replacement native Promise core
		    if(x instanceof $Promise && sameConstructor(x.constructor, this))return x;
		    var capability = newPromiseCapability(this)
		      , $$resolve  = capability.resolve;
		    $$resolve(x);
		    return capability.promise;
		  }
		});
		$export($export.S + $export.F * !(USE_NATIVE && __webpack_require__(109)(function(iter){
		  $Promise.all(iter)['catch'](empty);
		})), PROMISE, {
		  // 25.4.4.1 Promise.all(iterable)
		  all: function all(iterable){
		    var C          = this
		      , capability = newPromiseCapability(C)
		      , resolve    = capability.resolve
		      , reject     = capability.reject;
		    var abrupt = perform(function(){
		      var values    = []
		        , index     = 0
		        , remaining = 1;
		      forOf(iterable, false, function(promise){
		        var $index        = index++
		          , alreadyCalled = false;
		        values.push(undefined);
		        remaining++;
		        C.resolve(promise).then(function(value){
		          if(alreadyCalled)return;
		          alreadyCalled  = true;
		          values[$index] = value;
		          --remaining || resolve(values);
		        }, reject);
		      });
		      --remaining || resolve(values);
		    });
		    if(abrupt)reject(abrupt.error);
		    return capability.promise;
		  },
		  // 25.4.4.4 Promise.race(iterable)
		  race: function race(iterable){
		    var C          = this
		      , capability = newPromiseCapability(C)
		      , reject     = capability.reject;
		    var abrupt = perform(function(){
		      forOf(iterable, false, function(promise){
		        C.resolve(promise).then(capability.resolve, reject);
		      });
		    });
		    if(abrupt)reject(abrupt.error);
		    return capability.promise;
		  }
		});

	/***/ },
	/* 494 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.1 Reflect.apply(target, thisArgument, argumentsList)
		var $export   = __webpack_require__(1)
		  , aFunction = __webpack_require__(27)
		  , anObject  = __webpack_require__(6)
		  , _apply    = Function.apply;

		$export($export.S, 'Reflect', {
		  apply: function apply(target, thisArgument, argumentsList){
		    return _apply.call(aFunction(target), thisArgument, anObject(argumentsList));
		  }
		});

	/***/ },
	/* 495 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.2 Reflect.construct(target, argumentsList [, newTarget])
		var $export   = __webpack_require__(1)
		  , create    = __webpack_require__(55)
		  , aFunction = __webpack_require__(27)
		  , anObject  = __webpack_require__(6)
		  , isObject  = __webpack_require__(12)
		  , bind      = __webpack_require__(214);

		// MS Edge supports only 2 arguments
		// FF Nightly sets third argument as `new.target`, but does not create `this` from it
		$export($export.S + $export.F * __webpack_require__(9)(function(){
		  function F(){}
		  return !(Reflect.construct(function(){}, [], F) instanceof F);
		}), 'Reflect', {
		  construct: function construct(Target, args /*, newTarget*/){
		    aFunction(Target);
		    anObject(args);
		    var newTarget = arguments.length < 3 ? Target : aFunction(arguments[2]);
		    if(Target == newTarget){
		      // w/o altered newTarget, optimization for 0-4 arguments
		      switch(args.length){
		        case 0: return new Target;
		        case 1: return new Target(args[0]);
		        case 2: return new Target(args[0], args[1]);
		        case 3: return new Target(args[0], args[1], args[2]);
		        case 4: return new Target(args[0], args[1], args[2], args[3]);
		      }
		      // w/o altered newTarget, lot of arguments case
		      var $args = [null];
		      $args.push.apply($args, args);
		      return new (bind.apply(Target, $args));
		    }
		    // with altered newTarget, not support built-in constructors
		    var proto    = newTarget.prototype
		      , instance = create(isObject(proto) ? proto : Object.prototype)
		      , result   = Function.apply.call(Target, instance, args);
		    return isObject(result) ? result : instance;
		  }
		});

	/***/ },
	/* 496 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.3 Reflect.defineProperty(target, propertyKey, attributes)
		var dP          = __webpack_require__(16)
		  , $export     = __webpack_require__(1)
		  , anObject    = __webpack_require__(6)
		  , toPrimitive = __webpack_require__(42);

		// MS Edge has broken Reflect.defineProperty - throwing instead of returning false
		$export($export.S + $export.F * __webpack_require__(9)(function(){
		  Reflect.defineProperty(dP.f({}, 1, {value: 1}), 1, {value: 2});
		}), 'Reflect', {
		  defineProperty: function defineProperty(target, propertyKey, attributes){
		    anObject(target);
		    propertyKey = toPrimitive(propertyKey, true);
		    anObject(attributes);
		    try {
		      dP.f(target, propertyKey, attributes);
		      return true;
		    } catch(e){
		      return false;
		    }
		  }
		});

	/***/ },
	/* 497 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.4 Reflect.deleteProperty(target, propertyKey)
		var $export  = __webpack_require__(1)
		  , gOPD     = __webpack_require__(32).f
		  , anObject = __webpack_require__(6);

		$export($export.S, 'Reflect', {
		  deleteProperty: function deleteProperty(target, propertyKey){
		    var desc = gOPD(anObject(target), propertyKey);
		    return desc && !desc.configurable ? false : delete target[propertyKey];
		  }
		});

	/***/ },
	/* 498 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 26.1.5 Reflect.enumerate(target)
		var $export  = __webpack_require__(1)
		  , anObject = __webpack_require__(6);
		var Enumerate = function(iterated){
		  this._t = anObject(iterated); // target
		  this._i = 0;                  // next index
		  var keys = this._k = []       // keys
		    , key;
		  for(key in iterated)keys.push(key);
		};
		__webpack_require__(150)(Enumerate, 'Object', function(){
		  var that = this
		    , keys = that._k
		    , key;
		  do {
		    if(that._i >= keys.length)return {value: undefined, done: true};
		  } while(!((key = keys[that._i++]) in that._t));
		  return {value: key, done: false};
		});

		$export($export.S, 'Reflect', {
		  enumerate: function enumerate(target){
		    return new Enumerate(target);
		  }
		});

	/***/ },
	/* 499 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.7 Reflect.getOwnPropertyDescriptor(target, propertyKey)
		var gOPD     = __webpack_require__(32)
		  , $export  = __webpack_require__(1)
		  , anObject = __webpack_require__(6);

		$export($export.S, 'Reflect', {
		  getOwnPropertyDescriptor: function getOwnPropertyDescriptor(target, propertyKey){
		    return gOPD.f(anObject(target), propertyKey);
		  }
		});

	/***/ },
	/* 500 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.8 Reflect.getPrototypeOf(target)
		var $export  = __webpack_require__(1)
		  , getProto = __webpack_require__(33)
		  , anObject = __webpack_require__(6);

		$export($export.S, 'Reflect', {
		  getPrototypeOf: function getPrototypeOf(target){
		    return getProto(anObject(target));
		  }
		});

	/***/ },
	/* 501 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.6 Reflect.get(target, propertyKey [, receiver])
		var gOPD           = __webpack_require__(32)
		  , getPrototypeOf = __webpack_require__(33)
		  , has            = __webpack_require__(23)
		  , $export        = __webpack_require__(1)
		  , isObject       = __webpack_require__(12)
		  , anObject       = __webpack_require__(6);

		function get(target, propertyKey/*, receiver*/){
		  var receiver = arguments.length < 3 ? target : arguments[2]
		    , desc, proto;
		  if(anObject(target) === receiver)return target[propertyKey];
		  if(desc = gOPD.f(target, propertyKey))return has(desc, 'value')
		    ? desc.value
		    : desc.get !== undefined
		      ? desc.get.call(receiver)
		      : undefined;
		  if(isObject(proto = getPrototypeOf(target)))return get(proto, propertyKey, receiver);
		}

		$export($export.S, 'Reflect', {get: get});

	/***/ },
	/* 502 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.9 Reflect.has(target, propertyKey)
		var $export = __webpack_require__(1);

		$export($export.S, 'Reflect', {
		  has: function has(target, propertyKey){
		    return propertyKey in target;
		  }
		});

	/***/ },
	/* 503 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.10 Reflect.isExtensible(target)
		var $export       = __webpack_require__(1)
		  , anObject      = __webpack_require__(6)
		  , $isExtensible = Object.isExtensible;

		$export($export.S, 'Reflect', {
		  isExtensible: function isExtensible(target){
		    anObject(target);
		    return $isExtensible ? $isExtensible(target) : true;
		  }
		});

	/***/ },
	/* 504 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.11 Reflect.ownKeys(target)
		var $export = __webpack_require__(1);

		$export($export.S, 'Reflect', {ownKeys: __webpack_require__(227)});

	/***/ },
	/* 505 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.12 Reflect.preventExtensions(target)
		var $export            = __webpack_require__(1)
		  , anObject           = __webpack_require__(6)
		  , $preventExtensions = Object.preventExtensions;

		$export($export.S, 'Reflect', {
		  preventExtensions: function preventExtensions(target){
		    anObject(target);
		    try {
		      if($preventExtensions)$preventExtensions(target);
		      return true;
		    } catch(e){
		      return false;
		    }
		  }
		});

	/***/ },
	/* 506 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.14 Reflect.setPrototypeOf(target, proto)
		var $export  = __webpack_require__(1)
		  , setProto = __webpack_require__(112);

		if(setProto)$export($export.S, 'Reflect', {
		  setPrototypeOf: function setPrototypeOf(target, proto){
		    setProto.check(target, proto);
		    try {
		      setProto.set(target, proto);
		      return true;
		    } catch(e){
		      return false;
		    }
		  }
		});

	/***/ },
	/* 507 */
	/***/ function(module, exports, __webpack_require__) {

		// 26.1.13 Reflect.set(target, propertyKey, V [, receiver])
		var dP             = __webpack_require__(16)
		  , gOPD           = __webpack_require__(32)
		  , getPrototypeOf = __webpack_require__(33)
		  , has            = __webpack_require__(23)
		  , $export        = __webpack_require__(1)
		  , createDesc     = __webpack_require__(51)
		  , anObject       = __webpack_require__(6)
		  , isObject       = __webpack_require__(12);

		function set(target, propertyKey, V/*, receiver*/){
		  var receiver = arguments.length < 4 ? target : arguments[3]
		    , ownDesc  = gOPD.f(anObject(target), propertyKey)
		    , existingDescriptor, proto;
		  if(!ownDesc){
		    if(isObject(proto = getPrototypeOf(target))){
		      return set(proto, propertyKey, V, receiver);
		    }
		    ownDesc = createDesc(0);
		  }
		  if(has(ownDesc, 'value')){
		    if(ownDesc.writable === false || !isObject(receiver))return false;
		    existingDescriptor = gOPD.f(receiver, propertyKey) || createDesc(0);
		    existingDescriptor.value = V;
		    dP.f(receiver, propertyKey, existingDescriptor);
		    return true;
		  }
		  return ownDesc.set === undefined ? false : (ownDesc.set.call(receiver, V), true);
		}

		$export($export.S, 'Reflect', {set: set});

	/***/ },
	/* 508 */
	/***/ function(module, exports, __webpack_require__) {

		var global            = __webpack_require__(8)
		  , inheritIfRequired = __webpack_require__(146)
		  , dP                = __webpack_require__(16).f
		  , gOPN              = __webpack_require__(56).f
		  , isRegExp          = __webpack_require__(108)
		  , $flags            = __webpack_require__(106)
		  , $RegExp           = global.RegExp
		  , Base              = $RegExp
		  , proto             = $RegExp.prototype
		  , re1               = /a/g
		  , re2               = /a/g
		  // "new" creates a new object, old webkit buggy here
		  , CORRECT_NEW       = new $RegExp(re1) !== re1;

		if(__webpack_require__(15) && (!CORRECT_NEW || __webpack_require__(9)(function(){
		  re2[__webpack_require__(13)('match')] = false;
		  // RegExp constructor can alter flags and IsRegExp works correct with @@match
		  return $RegExp(re1) != re1 || $RegExp(re2) == re2 || $RegExp(re1, 'i') != '/a/i';
		}))){
		  $RegExp = function RegExp(p, f){
		    var tiRE = this instanceof $RegExp
		      , piRE = isRegExp(p)
		      , fiU  = f === undefined;
		    return !tiRE && piRE && p.constructor === $RegExp && fiU ? p
		      : inheritIfRequired(CORRECT_NEW
		        ? new Base(piRE && !fiU ? p.source : p, f)
		        : Base((piRE = p instanceof $RegExp) ? p.source : p, piRE && fiU ? $flags.call(p) : f)
		      , tiRE ? this : proto, $RegExp);
		  };
		  var proxy = function(key){
		    key in $RegExp || dP($RegExp, key, {
		      configurable: true,
		      get: function(){ return Base[key]; },
		      set: function(it){ Base[key] = it; }
		    });
		  };
		  for(var keys = gOPN(Base), i = 0; keys.length > i; )proxy(keys[i++]);
		  proto.constructor = $RegExp;
		  $RegExp.prototype = proto;
		  __webpack_require__(28)(global, 'RegExp', $RegExp);
		}

		__webpack_require__(59)('RegExp');

	/***/ },
	/* 509 */
	/***/ function(module, exports, __webpack_require__) {

		// @@match logic
		__webpack_require__(105)('match', 1, function(defined, MATCH, $match){
		  // 21.1.3.11 String.prototype.match(regexp)
		  return [function match(regexp){
		    'use strict';
		    var O  = defined(this)
		      , fn = regexp == undefined ? undefined : regexp[MATCH];
		    return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[MATCH](String(O));
		  }, $match];
		});

	/***/ },
	/* 510 */
	/***/ function(module, exports, __webpack_require__) {

		// @@replace logic
		__webpack_require__(105)('replace', 2, function(defined, REPLACE, $replace){
		  // 21.1.3.14 String.prototype.replace(searchValue, replaceValue)
		  return [function replace(searchValue, replaceValue){
		    'use strict';
		    var O  = defined(this)
		      , fn = searchValue == undefined ? undefined : searchValue[REPLACE];
		    return fn !== undefined
		      ? fn.call(searchValue, O, replaceValue)
		      : $replace.call(String(O), searchValue, replaceValue);
		  }, $replace];
		});

	/***/ },
	/* 511 */
	/***/ function(module, exports, __webpack_require__) {

		// @@search logic
		__webpack_require__(105)('search', 1, function(defined, SEARCH, $search){
		  // 21.1.3.15 String.prototype.search(regexp)
		  return [function search(regexp){
		    'use strict';
		    var O  = defined(this)
		      , fn = regexp == undefined ? undefined : regexp[SEARCH];
		    return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[SEARCH](String(O));
		  }, $search];
		});

	/***/ },
	/* 512 */
	/***/ function(module, exports, __webpack_require__) {

		// @@split logic
		__webpack_require__(105)('split', 2, function(defined, SPLIT, $split){
		  'use strict';
		  var isRegExp   = __webpack_require__(108)
		    , _split     = $split
		    , $push      = [].push
		    , $SPLIT     = 'split'
		    , LENGTH     = 'length'
		    , LAST_INDEX = 'lastIndex';
		  if(
		    'abbc'[$SPLIT](/(b)*/)[1] == 'c' ||
		    'test'[$SPLIT](/(?:)/, -1)[LENGTH] != 4 ||
		    'ab'[$SPLIT](/(?:ab)*/)[LENGTH] != 2 ||
		    '.'[$SPLIT](/(.?)(.?)/)[LENGTH] != 4 ||
		    '.'[$SPLIT](/()()/)[LENGTH] > 1 ||
		    ''[$SPLIT](/.?/)[LENGTH]
		  ){
		    var NPCG = /()??/.exec('')[1] === undefined; // nonparticipating capturing group
		    // based on es5-shim implementation, need to rework it
		    $split = function(separator, limit){
		      var string = String(this);
		      if(separator === undefined && limit === 0)return [];
		      // If `separator` is not a regex, use native split
		      if(!isRegExp(separator))return _split.call(string, separator, limit);
		      var output = [];
		      var flags = (separator.ignoreCase ? 'i' : '') +
		                  (separator.multiline ? 'm' : '') +
		                  (separator.unicode ? 'u' : '') +
		                  (separator.sticky ? 'y' : '');
		      var lastLastIndex = 0;
		      var splitLimit = limit === undefined ? 4294967295 : limit >>> 0;
		      // Make `global` and avoid `lastIndex` issues by working with a copy
		      var separatorCopy = new RegExp(separator.source, flags + 'g');
		      var separator2, match, lastIndex, lastLength, i;
		      // Doesn't need flags gy, but they don't hurt
		      if(!NPCG)separator2 = new RegExp('^' + separatorCopy.source + '$(?!\\s)', flags);
		      while(match = separatorCopy.exec(string)){
		        // `separatorCopy.lastIndex` is not reliable cross-browser
		        lastIndex = match.index + match[0][LENGTH];
		        if(lastIndex > lastLastIndex){
		          output.push(string.slice(lastLastIndex, match.index));
		          // Fix browsers whose `exec` methods don't consistently return `undefined` for NPCG
		          if(!NPCG && match[LENGTH] > 1)match[0].replace(separator2, function(){
		            for(i = 1; i < arguments[LENGTH] - 2; i++)if(arguments[i] === undefined)match[i] = undefined;
		          });
		          if(match[LENGTH] > 1 && match.index < string[LENGTH])$push.apply(output, match.slice(1));
		          lastLength = match[0][LENGTH];
		          lastLastIndex = lastIndex;
		          if(output[LENGTH] >= splitLimit)break;
		        }
		        if(separatorCopy[LAST_INDEX] === match.index)separatorCopy[LAST_INDEX]++; // Avoid an infinite loop
		      }
		      if(lastLastIndex === string[LENGTH]){
		        if(lastLength || !separatorCopy.test(''))output.push('');
		      } else output.push(string.slice(lastLastIndex));
		      return output[LENGTH] > splitLimit ? output.slice(0, splitLimit) : output;
		    };
		  // Chakra, V8
		  } else if('0'[$SPLIT](undefined, 0)[LENGTH]){
		    $split = function(separator, limit){
		      return separator === undefined && limit === 0 ? [] : _split.call(this, separator, limit);
		    };
		  }
		  // 21.1.3.17 String.prototype.split(separator, limit)
		  return [function split(separator, limit){
		    var O  = defined(this)
		      , fn = separator == undefined ? undefined : separator[SPLIT];
		    return fn !== undefined ? fn.call(separator, O, limit) : $split.call(String(O), separator, limit);
		  }, $split];
		});

	/***/ },
	/* 513 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		__webpack_require__(234);
		var anObject    = __webpack_require__(6)
		  , $flags      = __webpack_require__(106)
		  , DESCRIPTORS = __webpack_require__(15)
		  , TO_STRING   = 'toString'
		  , $toString   = /./[TO_STRING];

		var define = function(fn){
		  __webpack_require__(28)(RegExp.prototype, TO_STRING, fn, true);
		};

		// 21.2.5.14 RegExp.prototype.toString()
		if(__webpack_require__(9)(function(){ return $toString.call({source: 'a', flags: 'b'}) != '/a/b'; })){
		  define(function toString(){
		    var R = anObject(this);
		    return '/'.concat(R.source, '/',
		      'flags' in R ? R.flags : !DESCRIPTORS && R instanceof RegExp ? $flags.call(R) : undefined);
		  });
		// FF44- RegExp#toString has a wrong name
		} else if($toString.name != TO_STRING){
		  define(function toString(){
		    return $toString.call(this);
		  });
		}

	/***/ },
	/* 514 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.2 String.prototype.anchor(name)
		__webpack_require__(29)('anchor', function(createHTML){
		  return function anchor(name){
		    return createHTML(this, 'a', 'name', name);
		  }
		});

	/***/ },
	/* 515 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.3 String.prototype.big()
		__webpack_require__(29)('big', function(createHTML){
		  return function big(){
		    return createHTML(this, 'big', '', '');
		  }
		});

	/***/ },
	/* 516 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.4 String.prototype.blink()
		__webpack_require__(29)('blink', function(createHTML){
		  return function blink(){
		    return createHTML(this, 'blink', '', '');
		  }
		});

	/***/ },
	/* 517 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.5 String.prototype.bold()
		__webpack_require__(29)('bold', function(createHTML){
		  return function bold(){
		    return createHTML(this, 'b', '', '');
		  }
		});

	/***/ },
	/* 518 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export = __webpack_require__(1)
		  , $at     = __webpack_require__(157)(false);
		$export($export.P, 'String', {
		  // 21.1.3.3 String.prototype.codePointAt(pos)
		  codePointAt: function codePointAt(pos){
		    return $at(this, pos);
		  }
		});

	/***/ },
	/* 519 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 21.1.3.6 String.prototype.endsWith(searchString [, endPosition])
		'use strict';
		var $export   = __webpack_require__(1)
		  , toLength  = __webpack_require__(20)
		  , context   = __webpack_require__(158)
		  , ENDS_WITH = 'endsWith'
		  , $endsWith = ''[ENDS_WITH];

		$export($export.P + $export.F * __webpack_require__(144)(ENDS_WITH), 'String', {
		  endsWith: function endsWith(searchString /*, endPosition = @length */){
		    var that = context(this, searchString, ENDS_WITH)
		      , endPosition = arguments.length > 1 ? arguments[1] : undefined
		      , len    = toLength(that.length)
		      , end    = endPosition === undefined ? len : Math.min(toLength(endPosition), len)
		      , search = String(searchString);
		    return $endsWith
		      ? $endsWith.call(that, search, end)
		      : that.slice(end - search.length, end) === search;
		  }
		});

	/***/ },
	/* 520 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.6 String.prototype.fixed()
		__webpack_require__(29)('fixed', function(createHTML){
		  return function fixed(){
		    return createHTML(this, 'tt', '', '');
		  }
		});

	/***/ },
	/* 521 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.7 String.prototype.fontcolor(color)
		__webpack_require__(29)('fontcolor', function(createHTML){
		  return function fontcolor(color){
		    return createHTML(this, 'font', 'color', color);
		  }
		});

	/***/ },
	/* 522 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.8 String.prototype.fontsize(size)
		__webpack_require__(29)('fontsize', function(createHTML){
		  return function fontsize(size){
		    return createHTML(this, 'font', 'size', size);
		  }
		});

	/***/ },
	/* 523 */
	/***/ function(module, exports, __webpack_require__) {

		var $export        = __webpack_require__(1)
		  , toIndex        = __webpack_require__(60)
		  , fromCharCode   = String.fromCharCode
		  , $fromCodePoint = String.fromCodePoint;

		// length should be 1, old FF problem
		$export($export.S + $export.F * (!!$fromCodePoint && $fromCodePoint.length != 1), 'String', {
		  // 21.1.2.2 String.fromCodePoint(...codePoints)
		  fromCodePoint: function fromCodePoint(x){ // eslint-disable-line no-unused-vars
		    var res  = []
		      , aLen = arguments.length
		      , i    = 0
		      , code;
		    while(aLen > i){
		      code = +arguments[i++];
		      if(toIndex(code, 0x10ffff) !== code)throw RangeError(code + ' is not a valid code point');
		      res.push(code < 0x10000
		        ? fromCharCode(code)
		        : fromCharCode(((code -= 0x10000) >> 10) + 0xd800, code % 0x400 + 0xdc00)
		      );
		    } return res.join('');
		  }
		});

	/***/ },
	/* 524 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 21.1.3.7 String.prototype.includes(searchString, position = 0)
		'use strict';
		var $export  = __webpack_require__(1)
		  , context  = __webpack_require__(158)
		  , INCLUDES = 'includes';

		$export($export.P + $export.F * __webpack_require__(144)(INCLUDES), 'String', {
		  includes: function includes(searchString /*, position = 0 */){
		    return !!~context(this, searchString, INCLUDES)
		      .indexOf(searchString, arguments.length > 1 ? arguments[1] : undefined);
		  }
		});

	/***/ },
	/* 525 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.9 String.prototype.italics()
		__webpack_require__(29)('italics', function(createHTML){
		  return function italics(){
		    return createHTML(this, 'i', '', '');
		  }
		});

	/***/ },
	/* 526 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $at  = __webpack_require__(157)(true);

		// 21.1.3.27 String.prototype[@@iterator]()
		__webpack_require__(151)(String, 'String', function(iterated){
		  this._t = String(iterated); // target
		  this._i = 0;                // next index
		// 21.1.5.2.1 %StringIteratorPrototype%.next()
		}, function(){
		  var O     = this._t
		    , index = this._i
		    , point;
		  if(index >= O.length)return {value: undefined, done: true};
		  point = $at(O, index);
		  this._i += point.length;
		  return {value: point, done: false};
		});

	/***/ },
	/* 527 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.10 String.prototype.link(url)
		__webpack_require__(29)('link', function(createHTML){
		  return function link(url){
		    return createHTML(this, 'a', 'href', url);
		  }
		});

	/***/ },
	/* 528 */
	/***/ function(module, exports, __webpack_require__) {

		var $export   = __webpack_require__(1)
		  , toIObject = __webpack_require__(30)
		  , toLength  = __webpack_require__(20);

		$export($export.S, 'String', {
		  // 21.1.2.4 String.raw(callSite, ...substitutions)
		  raw: function raw(callSite){
		    var tpl  = toIObject(callSite.raw)
		      , len  = toLength(tpl.length)
		      , aLen = arguments.length
		      , res  = []
		      , i    = 0;
		    while(len > i){
		      res.push(String(tpl[i++]));
		      if(i < aLen)res.push(String(arguments[i]));
		    } return res.join('');
		  }
		});

	/***/ },
	/* 529 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1);

		$export($export.P, 'String', {
		  // 21.1.3.13 String.prototype.repeat(count)
		  repeat: __webpack_require__(159)
		});

	/***/ },
	/* 530 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.11 String.prototype.small()
		__webpack_require__(29)('small', function(createHTML){
		  return function small(){
		    return createHTML(this, 'small', '', '');
		  }
		});

	/***/ },
	/* 531 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 21.1.3.18 String.prototype.startsWith(searchString [, position ])
		'use strict';
		var $export     = __webpack_require__(1)
		  , toLength    = __webpack_require__(20)
		  , context     = __webpack_require__(158)
		  , STARTS_WITH = 'startsWith'
		  , $startsWith = ''[STARTS_WITH];

		$export($export.P + $export.F * __webpack_require__(144)(STARTS_WITH), 'String', {
		  startsWith: function startsWith(searchString /*, position = 0 */){
		    var that   = context(this, searchString, STARTS_WITH)
		      , index  = toLength(Math.min(arguments.length > 1 ? arguments[1] : undefined, that.length))
		      , search = String(searchString);
		    return $startsWith
		      ? $startsWith.call(that, search, index)
		      : that.slice(index, index + search.length) === search;
		  }
		});

	/***/ },
	/* 532 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.12 String.prototype.strike()
		__webpack_require__(29)('strike', function(createHTML){
		  return function strike(){
		    return createHTML(this, 'strike', '', '');
		  }
		});

	/***/ },
	/* 533 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.13 String.prototype.sub()
		__webpack_require__(29)('sub', function(createHTML){
		  return function sub(){
		    return createHTML(this, 'sub', '', '');
		  }
		});

	/***/ },
	/* 534 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// B.2.3.14 String.prototype.sup()
		__webpack_require__(29)('sup', function(createHTML){
		  return function sup(){
		    return createHTML(this, 'sup', '', '');
		  }
		});

	/***/ },
	/* 535 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// 21.1.3.25 String.prototype.trim()
		__webpack_require__(71)('trim', function($trim){
		  return function trim(){
		    return $trim(this, 3);
		  };
		});

	/***/ },
	/* 536 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// ECMAScript 6 symbols shim
		var global         = __webpack_require__(8)
		  , has            = __webpack_require__(23)
		  , DESCRIPTORS    = __webpack_require__(15)
		  , $export        = __webpack_require__(1)
		  , redefine       = __webpack_require__(28)
		  , META           = __webpack_require__(50).KEY
		  , $fails         = __webpack_require__(9)
		  , shared         = __webpack_require__(113)
		  , setToStringTag = __webpack_require__(70)
		  , uid            = __webpack_require__(61)
		  , wks            = __webpack_require__(13)
		  , wksExt         = __webpack_require__(232)
		  , wksDefine      = __webpack_require__(163)
		  , keyOf          = __webpack_require__(411)
		  , enumKeys       = __webpack_require__(410)
		  , isArray        = __webpack_require__(148)
		  , anObject       = __webpack_require__(6)
		  , toIObject      = __webpack_require__(30)
		  , toPrimitive    = __webpack_require__(42)
		  , createDesc     = __webpack_require__(51)
		  , _create        = __webpack_require__(55)
		  , gOPNExt        = __webpack_require__(224)
		  , $GOPD          = __webpack_require__(32)
		  , $DP            = __webpack_require__(16)
		  , $keys          = __webpack_require__(57)
		  , gOPD           = $GOPD.f
		  , dP             = $DP.f
		  , gOPN           = gOPNExt.f
		  , $Symbol        = global.Symbol
		  , $JSON          = global.JSON
		  , _stringify     = $JSON && $JSON.stringify
		  , PROTOTYPE      = 'prototype'
		  , HIDDEN         = wks('_hidden')
		  , TO_PRIMITIVE   = wks('toPrimitive')
		  , isEnum         = {}.propertyIsEnumerable
		  , SymbolRegistry = shared('symbol-registry')
		  , AllSymbols     = shared('symbols')
		  , OPSymbols      = shared('op-symbols')
		  , ObjectProto    = Object[PROTOTYPE]
		  , USE_NATIVE     = typeof $Symbol == 'function'
		  , QObject        = global.QObject;
		// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173
		var setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;

		// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687
		var setSymbolDesc = DESCRIPTORS && $fails(function(){
		  return _create(dP({}, 'a', {
		    get: function(){ return dP(this, 'a', {value: 7}).a; }
		  })).a != 7;
		}) ? function(it, key, D){
		  var protoDesc = gOPD(ObjectProto, key);
		  if(protoDesc)delete ObjectProto[key];
		  dP(it, key, D);
		  if(protoDesc && it !== ObjectProto)dP(ObjectProto, key, protoDesc);
		} : dP;

		var wrap = function(tag){
		  var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]);
		  sym._k = tag;
		  return sym;
		};

		var isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function(it){
		  return typeof it == 'symbol';
		} : function(it){
		  return it instanceof $Symbol;
		};

		var $defineProperty = function defineProperty(it, key, D){
		  if(it === ObjectProto)$defineProperty(OPSymbols, key, D);
		  anObject(it);
		  key = toPrimitive(key, true);
		  anObject(D);
		  if(has(AllSymbols, key)){
		    if(!D.enumerable){
		      if(!has(it, HIDDEN))dP(it, HIDDEN, createDesc(1, {}));
		      it[HIDDEN][key] = true;
		    } else {
		      if(has(it, HIDDEN) && it[HIDDEN][key])it[HIDDEN][key] = false;
		      D = _create(D, {enumerable: createDesc(0, false)});
		    } return setSymbolDesc(it, key, D);
		  } return dP(it, key, D);
		};
		var $defineProperties = function defineProperties(it, P){
		  anObject(it);
		  var keys = enumKeys(P = toIObject(P))
		    , i    = 0
		    , l = keys.length
		    , key;
		  while(l > i)$defineProperty(it, key = keys[i++], P[key]);
		  return it;
		};
		var $create = function create(it, P){
		  return P === undefined ? _create(it) : $defineProperties(_create(it), P);
		};
		var $propertyIsEnumerable = function propertyIsEnumerable(key){
		  var E = isEnum.call(this, key = toPrimitive(key, true));
		  if(this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key))return false;
		  return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true;
		};
		var $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key){
		  it  = toIObject(it);
		  key = toPrimitive(key, true);
		  if(it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key))return;
		  var D = gOPD(it, key);
		  if(D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key]))D.enumerable = true;
		  return D;
		};
		var $getOwnPropertyNames = function getOwnPropertyNames(it){
		  var names  = gOPN(toIObject(it))
		    , result = []
		    , i      = 0
		    , key;
		  while(names.length > i){
		    if(!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META)result.push(key);
		  } return result;
		};
		var $getOwnPropertySymbols = function getOwnPropertySymbols(it){
		  var IS_OP  = it === ObjectProto
		    , names  = gOPN(IS_OP ? OPSymbols : toIObject(it))
		    , result = []
		    , i      = 0
		    , key;
		  while(names.length > i){
		    if(has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true))result.push(AllSymbols[key]);
		  } return result;
		};

		// 19.4.1.1 Symbol([description])
		if(!USE_NATIVE){
		  $Symbol = function Symbol(){
		    if(this instanceof $Symbol)throw TypeError('Symbol is not a constructor!');
		    var tag = uid(arguments.length > 0 ? arguments[0] : undefined);
		    var $set = function(value){
		      if(this === ObjectProto)$set.call(OPSymbols, value);
		      if(has(this, HIDDEN) && has(this[HIDDEN], tag))this[HIDDEN][tag] = false;
		      setSymbolDesc(this, tag, createDesc(1, value));
		    };
		    if(DESCRIPTORS && setter)setSymbolDesc(ObjectProto, tag, {configurable: true, set: $set});
		    return wrap(tag);
		  };
		  redefine($Symbol[PROTOTYPE], 'toString', function toString(){
		    return this._k;
		  });

		  $GOPD.f = $getOwnPropertyDescriptor;
		  $DP.f   = $defineProperty;
		  __webpack_require__(56).f = gOPNExt.f = $getOwnPropertyNames;
		  __webpack_require__(87).f  = $propertyIsEnumerable;
		  __webpack_require__(111).f = $getOwnPropertySymbols;

		  if(DESCRIPTORS && !__webpack_require__(54)){
		    redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true);
		  }

		  wksExt.f = function(name){
		    return wrap(wks(name));
		  }
		}

		$export($export.G + $export.W + $export.F * !USE_NATIVE, {Symbol: $Symbol});

		for(var symbols = (
		  // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14
		  'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables'
		).split(','), i = 0; symbols.length > i; )wks(symbols[i++]);

		for(var symbols = $keys(wks.store), i = 0; symbols.length > i; )wksDefine(symbols[i++]);

		$export($export.S + $export.F * !USE_NATIVE, 'Symbol', {
		  // 19.4.2.1 Symbol.for(key)
		  'for': function(key){
		    return has(SymbolRegistry, key += '')
		      ? SymbolRegistry[key]
		      : SymbolRegistry[key] = $Symbol(key);
		  },
		  // 19.4.2.5 Symbol.keyFor(sym)
		  keyFor: function keyFor(key){
		    if(isSymbol(key))return keyOf(SymbolRegistry, key);
		    throw TypeError(key + ' is not a symbol!');
		  },
		  useSetter: function(){ setter = true; },
		  useSimple: function(){ setter = false; }
		});

		$export($export.S + $export.F * !USE_NATIVE, 'Object', {
		  // 19.1.2.2 Object.create(O [, Properties])
		  create: $create,
		  // 19.1.2.4 Object.defineProperty(O, P, Attributes)
		  defineProperty: $defineProperty,
		  // 19.1.2.3 Object.defineProperties(O, Properties)
		  defineProperties: $defineProperties,
		  // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)
		  getOwnPropertyDescriptor: $getOwnPropertyDescriptor,
		  // 19.1.2.7 Object.getOwnPropertyNames(O)
		  getOwnPropertyNames: $getOwnPropertyNames,
		  // 19.1.2.8 Object.getOwnPropertySymbols(O)
		  getOwnPropertySymbols: $getOwnPropertySymbols
		});

		// 24.3.2 JSON.stringify(value [, replacer [, space]])
		$JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function(){
		  var S = $Symbol();
		  // MS Edge converts symbol values to JSON as {}
		  // WebKit converts symbol values to JSON as null
		  // V8 throws on boxed symbols
		  return _stringify([S]) != '[null]' || _stringify({a: S}) != '{}' || _stringify(Object(S)) != '{}';
		})), 'JSON', {
		  stringify: function stringify(it){
		    if(it === undefined || isSymbol(it))return; // IE8 returns string on undefined
		    var args = [it]
		      , i    = 1
		      , replacer, $replacer;
		    while(arguments.length > i)args.push(arguments[i++]);
		    replacer = args[1];
		    if(typeof replacer == 'function')$replacer = replacer;
		    if($replacer || !isArray(replacer))replacer = function(key, value){
		      if($replacer)value = $replacer.call(this, key, value);
		      if(!isSymbol(value))return value;
		    };
		    args[1] = replacer;
		    return _stringify.apply($JSON, args);
		  }
		});

		// 19.4.3.4 Symbol.prototype[@@toPrimitive](hint)
		$Symbol[PROTOTYPE][TO_PRIMITIVE] || __webpack_require__(25)($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);
		// 19.4.3.5 Symbol.prototype[@@toStringTag]
		setToStringTag($Symbol, 'Symbol');
		// 20.2.1.9 Math[@@toStringTag]
		setToStringTag(Math, 'Math', true);
		// 24.3.3 JSON[@@toStringTag]
		setToStringTag(global.JSON, 'JSON', true);

	/***/ },
	/* 537 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export      = __webpack_require__(1)
		  , $typed       = __webpack_require__(114)
		  , buffer       = __webpack_require__(162)
		  , anObject     = __webpack_require__(6)
		  , toIndex      = __webpack_require__(60)
		  , toLength     = __webpack_require__(20)
		  , isObject     = __webpack_require__(12)
		  , TYPED_ARRAY  = __webpack_require__(13)('typed_array')
		  , ArrayBuffer  = __webpack_require__(8).ArrayBuffer
		  , speciesConstructor = __webpack_require__(156)
		  , $ArrayBuffer = buffer.ArrayBuffer
		  , $DataView    = buffer.DataView
		  , $isView      = $typed.ABV && ArrayBuffer.isView
		  , $slice       = $ArrayBuffer.prototype.slice
		  , VIEW         = $typed.VIEW
		  , ARRAY_BUFFER = 'ArrayBuffer';

		$export($export.G + $export.W + $export.F * (ArrayBuffer !== $ArrayBuffer), {ArrayBuffer: $ArrayBuffer});

		$export($export.S + $export.F * !$typed.CONSTR, ARRAY_BUFFER, {
		  // 24.1.3.1 ArrayBuffer.isView(arg)
		  isView: function isView(it){
		    return $isView && $isView(it) || isObject(it) && VIEW in it;
		  }
		});

		$export($export.P + $export.U + $export.F * __webpack_require__(9)(function(){
		  return !new $ArrayBuffer(2).slice(1, undefined).byteLength;
		}), ARRAY_BUFFER, {
		  // 24.1.4.3 ArrayBuffer.prototype.slice(start, end)
		  slice: function slice(start, end){
		    if($slice !== undefined && end === undefined)return $slice.call(anObject(this), start); // FF fix
		    var len    = anObject(this).byteLength
		      , first  = toIndex(start, len)
		      , final  = toIndex(end === undefined ? len : end, len)
		      , result = new (speciesConstructor(this, $ArrayBuffer))(toLength(final - first))
		      , viewS  = new $DataView(this)
		      , viewT  = new $DataView(result)
		      , index  = 0;
		    while(first < final){
		      viewT.setUint8(index++, viewS.getUint8(first++));
		    } return result;
		  }
		});

		__webpack_require__(59)(ARRAY_BUFFER);

	/***/ },
	/* 538 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1);
		$export($export.G + $export.W + $export.F * !__webpack_require__(114).ABV, {
		  DataView: __webpack_require__(162).DataView
		});

	/***/ },
	/* 539 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Float32', 4, function(init){
		  return function Float32Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 540 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Float64', 8, function(init){
		  return function Float64Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 541 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Int16', 2, function(init){
		  return function Int16Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 542 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Int32', 4, function(init){
		  return function Int32Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 543 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Int8', 1, function(init){
		  return function Int8Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 544 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Uint16', 2, function(init){
		  return function Uint16Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 545 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Uint32', 4, function(init){
		  return function Uint32Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 546 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Uint8', 1, function(init){
		  return function Uint8Array(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		});

	/***/ },
	/* 547 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(46)('Uint8', 1, function(init){
		  return function Uint8ClampedArray(data, byteOffset, length){
		    return init(this, data, byteOffset, length);
		  };
		}, true);

	/***/ },
	/* 548 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var weak = __webpack_require__(217);

		// 23.4 WeakSet Objects
		__webpack_require__(104)('WeakSet', function(get){
		  return function WeakSet(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); };
		}, {
		  // 23.4.3.1 WeakSet.prototype.add(value)
		  add: function add(value){
		    return weak.def(this, value, true);
		  }
		}, weak, false, true);

	/***/ },
	/* 549 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/tc39/Array.prototype.includes
		var $export   = __webpack_require__(1)
		  , $includes = __webpack_require__(103)(true);

		$export($export.P, 'Array', {
		  includes: function includes(el /*, fromIndex = 0 */){
		    return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined);
		  }
		});

		__webpack_require__(67)('includes');

	/***/ },
	/* 550 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/rwaldron/tc39-notes/blob/master/es6/2014-09/sept-25.md#510-globalasap-for-enqueuing-a-microtask
		var $export   = __webpack_require__(1)
		  , microtask = __webpack_require__(154)()
		  , process   = __webpack_require__(8).process
		  , isNode    = __webpack_require__(36)(process) == 'process';

		$export($export.G, {
		  asap: function asap(fn){
		    var domain = isNode && process.domain;
		    microtask(domain ? domain.bind(fn) : fn);
		  }
		});

	/***/ },
	/* 551 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/ljharb/proposal-is-error
		var $export = __webpack_require__(1)
		  , cof     = __webpack_require__(36);

		$export($export.S, 'Error', {
		  isError: function isError(it){
		    return cof(it) === 'Error';
		  }
		});

	/***/ },
	/* 552 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/DavidBruant/Map-Set.prototype.toJSON
		var $export  = __webpack_require__(1);

		$export($export.P + $export.R, 'Map', {toJSON: __webpack_require__(216)('Map')});

	/***/ },
	/* 553 */
	/***/ function(module, exports, __webpack_require__) {

		// https://gist.github.com/BrendanEich/4294d5c212a6d2254703
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  iaddh: function iaddh(x0, x1, y0, y1){
		    var $x0 = x0 >>> 0
		      , $x1 = x1 >>> 0
		      , $y0 = y0 >>> 0;
		    return $x1 + (y1 >>> 0) + (($x0 & $y0 | ($x0 | $y0) & ~($x0 + $y0 >>> 0)) >>> 31) | 0;
		  }
		});

	/***/ },
	/* 554 */
	/***/ function(module, exports, __webpack_require__) {

		// https://gist.github.com/BrendanEich/4294d5c212a6d2254703
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  imulh: function imulh(u, v){
		    var UINT16 = 0xffff
		      , $u = +u
		      , $v = +v
		      , u0 = $u & UINT16
		      , v0 = $v & UINT16
		      , u1 = $u >> 16
		      , v1 = $v >> 16
		      , t  = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);
		    return u1 * v1 + (t >> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >> 16);
		  }
		});

	/***/ },
	/* 555 */
	/***/ function(module, exports, __webpack_require__) {

		// https://gist.github.com/BrendanEich/4294d5c212a6d2254703
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  isubh: function isubh(x0, x1, y0, y1){
		    var $x0 = x0 >>> 0
		      , $x1 = x1 >>> 0
		      , $y0 = y0 >>> 0;
		    return $x1 - (y1 >>> 0) - ((~$x0 & $y0 | ~($x0 ^ $y0) & $x0 - $y0 >>> 0) >>> 31) | 0;
		  }
		});

	/***/ },
	/* 556 */
	/***/ function(module, exports, __webpack_require__) {

		// https://gist.github.com/BrendanEich/4294d5c212a6d2254703
		var $export = __webpack_require__(1);

		$export($export.S, 'Math', {
		  umulh: function umulh(u, v){
		    var UINT16 = 0xffff
		      , $u = +u
		      , $v = +v
		      , u0 = $u & UINT16
		      , v0 = $v & UINT16
		      , u1 = $u >>> 16
		      , v1 = $v >>> 16
		      , t  = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);
		    return u1 * v1 + (t >>> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >>> 16);
		  }
		});

	/***/ },
	/* 557 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export         = __webpack_require__(1)
		  , toObject        = __webpack_require__(22)
		  , aFunction       = __webpack_require__(27)
		  , $defineProperty = __webpack_require__(16);

		// B.2.2.2 Object.prototype.__defineGetter__(P, getter)
		__webpack_require__(15) && $export($export.P + __webpack_require__(110), 'Object', {
		  __defineGetter__: function __defineGetter__(P, getter){
		    $defineProperty.f(toObject(this), P, {get: aFunction(getter), enumerable: true, configurable: true});
		  }
		});

	/***/ },
	/* 558 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export         = __webpack_require__(1)
		  , toObject        = __webpack_require__(22)
		  , aFunction       = __webpack_require__(27)
		  , $defineProperty = __webpack_require__(16);

		// B.2.2.3 Object.prototype.__defineSetter__(P, setter)
		__webpack_require__(15) && $export($export.P + __webpack_require__(110), 'Object', {
		  __defineSetter__: function __defineSetter__(P, setter){
		    $defineProperty.f(toObject(this), P, {set: aFunction(setter), enumerable: true, configurable: true});
		  }
		});

	/***/ },
	/* 559 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/tc39/proposal-object-values-entries
		var $export  = __webpack_require__(1)
		  , $entries = __webpack_require__(226)(true);

		$export($export.S, 'Object', {
		  entries: function entries(it){
		    return $entries(it);
		  }
		});

	/***/ },
	/* 560 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/tc39/proposal-object-getownpropertydescriptors
		var $export        = __webpack_require__(1)
		  , ownKeys        = __webpack_require__(227)
		  , toIObject      = __webpack_require__(30)
		  , gOPD           = __webpack_require__(32)
		  , createProperty = __webpack_require__(141);

		$export($export.S, 'Object', {
		  getOwnPropertyDescriptors: function getOwnPropertyDescriptors(object){
		    var O       = toIObject(object)
		      , getDesc = gOPD.f
		      , keys    = ownKeys(O)
		      , result  = {}
		      , i       = 0
		      , key, D;
		    while(keys.length > i)createProperty(result, key = keys[i++], getDesc(O, key));
		    return result;
		  }
		});

	/***/ },
	/* 561 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export                  = __webpack_require__(1)
		  , toObject                 = __webpack_require__(22)
		  , toPrimitive              = __webpack_require__(42)
		  , getPrototypeOf           = __webpack_require__(33)
		  , getOwnPropertyDescriptor = __webpack_require__(32).f;

		// B.2.2.4 Object.prototype.__lookupGetter__(P)
		__webpack_require__(15) && $export($export.P + __webpack_require__(110), 'Object', {
		  __lookupGetter__: function __lookupGetter__(P){
		    var O = toObject(this)
		      , K = toPrimitive(P, true)
		      , D;
		    do {
		      if(D = getOwnPropertyDescriptor(O, K))return D.get;
		    } while(O = getPrototypeOf(O));
		  }
		});

	/***/ },
	/* 562 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		var $export                  = __webpack_require__(1)
		  , toObject                 = __webpack_require__(22)
		  , toPrimitive              = __webpack_require__(42)
		  , getPrototypeOf           = __webpack_require__(33)
		  , getOwnPropertyDescriptor = __webpack_require__(32).f;

		// B.2.2.5 Object.prototype.__lookupSetter__(P)
		__webpack_require__(15) && $export($export.P + __webpack_require__(110), 'Object', {
		  __lookupSetter__: function __lookupSetter__(P){
		    var O = toObject(this)
		      , K = toPrimitive(P, true)
		      , D;
		    do {
		      if(D = getOwnPropertyDescriptor(O, K))return D.set;
		    } while(O = getPrototypeOf(O));
		  }
		});

	/***/ },
	/* 563 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/tc39/proposal-object-values-entries
		var $export = __webpack_require__(1)
		  , $values = __webpack_require__(226)(false);

		$export($export.S, 'Object', {
		  values: function values(it){
		    return $values(it);
		  }
		});

	/***/ },
	/* 564 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/zenparsing/es-observable
		var $export     = __webpack_require__(1)
		  , global      = __webpack_require__(8)
		  , core        = __webpack_require__(40)
		  , microtask   = __webpack_require__(154)()
		  , OBSERVABLE  = __webpack_require__(13)('observable')
		  , aFunction   = __webpack_require__(27)
		  , anObject    = __webpack_require__(6)
		  , anInstance  = __webpack_require__(49)
		  , redefineAll = __webpack_require__(58)
		  , hide        = __webpack_require__(25)
		  , forOf       = __webpack_require__(69)
		  , RETURN      = forOf.RETURN;

		var getMethod = function(fn){
		  return fn == null ? undefined : aFunction(fn);
		};

		var cleanupSubscription = function(subscription){
		  var cleanup = subscription._c;
		  if(cleanup){
		    subscription._c = undefined;
		    cleanup();
		  }
		};

		var subscriptionClosed = function(subscription){
		  return subscription._o === undefined;
		};

		var closeSubscription = function(subscription){
		  if(!subscriptionClosed(subscription)){
		    subscription._o = undefined;
		    cleanupSubscription(subscription);
		  }
		};

		var Subscription = function(observer, subscriber){
		  anObject(observer);
		  this._c = undefined;
		  this._o = observer;
		  observer = new SubscriptionObserver(this);
		  try {
		    var cleanup      = subscriber(observer)
		      , subscription = cleanup;
		    if(cleanup != null){
		      if(typeof cleanup.unsubscribe === 'function')cleanup = function(){ subscription.unsubscribe(); };
		      else aFunction(cleanup);
		      this._c = cleanup;
		    }
		  } catch(e){
		    observer.error(e);
		    return;
		  } if(subscriptionClosed(this))cleanupSubscription(this);
		};

		Subscription.prototype = redefineAll({}, {
		  unsubscribe: function unsubscribe(){ closeSubscription(this); }
		});

		var SubscriptionObserver = function(subscription){
		  this._s = subscription;
		};

		SubscriptionObserver.prototype = redefineAll({}, {
		  next: function next(value){
		    var subscription = this._s;
		    if(!subscriptionClosed(subscription)){
		      var observer = subscription._o;
		      try {
		        var m = getMethod(observer.next);
		        if(m)return m.call(observer, value);
		      } catch(e){
		        try {
		          closeSubscription(subscription);
		        } finally {
		          throw e;
		        }
		      }
		    }
		  },
		  error: function error(value){
		    var subscription = this._s;
		    if(subscriptionClosed(subscription))throw value;
		    var observer = subscription._o;
		    subscription._o = undefined;
		    try {
		      var m = getMethod(observer.error);
		      if(!m)throw value;
		      value = m.call(observer, value);
		    } catch(e){
		      try {
		        cleanupSubscription(subscription);
		      } finally {
		        throw e;
		      }
		    } cleanupSubscription(subscription);
		    return value;
		  },
		  complete: function complete(value){
		    var subscription = this._s;
		    if(!subscriptionClosed(subscription)){
		      var observer = subscription._o;
		      subscription._o = undefined;
		      try {
		        var m = getMethod(observer.complete);
		        value = m ? m.call(observer, value) : undefined;
		      } catch(e){
		        try {
		          cleanupSubscription(subscription);
		        } finally {
		          throw e;
		        }
		      } cleanupSubscription(subscription);
		      return value;
		    }
		  }
		});

		var $Observable = function Observable(subscriber){
		  anInstance(this, $Observable, 'Observable', '_f')._f = aFunction(subscriber);
		};

		redefineAll($Observable.prototype, {
		  subscribe: function subscribe(observer){
		    return new Subscription(observer, this._f);
		  },
		  forEach: function forEach(fn){
		    var that = this;
		    return new (core.Promise || global.Promise)(function(resolve, reject){
		      aFunction(fn);
		      var subscription = that.subscribe({
		        next : function(value){
		          try {
		            return fn(value);
		          } catch(e){
		            reject(e);
		            subscription.unsubscribe();
		          }
		        },
		        error: reject,
		        complete: resolve
		      });
		    });
		  }
		});

		redefineAll($Observable, {
		  from: function from(x){
		    var C = typeof this === 'function' ? this : $Observable;
		    var method = getMethod(anObject(x)[OBSERVABLE]);
		    if(method){
		      var observable = anObject(method.call(x));
		      return observable.constructor === C ? observable : new C(function(observer){
		        return observable.subscribe(observer);
		      });
		    }
		    return new C(function(observer){
		      var done = false;
		      microtask(function(){
		        if(!done){
		          try {
		            if(forOf(x, false, function(it){
		              observer.next(it);
		              if(done)return RETURN;
		            }) === RETURN)return;
		          } catch(e){
		            if(done)throw e;
		            observer.error(e);
		            return;
		          } observer.complete();
		        }
		      });
		      return function(){ done = true; };
		    });
		  },
		  of: function of(){
		    for(var i = 0, l = arguments.length, items = Array(l); i < l;)items[i] = arguments[i++];
		    return new (typeof this === 'function' ? this : $Observable)(function(observer){
		      var done = false;
		      microtask(function(){
		        if(!done){
		          for(var i = 0; i < items.length; ++i){
		            observer.next(items[i]);
		            if(done)return;
		          } observer.complete();
		        }
		      });
		      return function(){ done = true; };
		    });
		  }
		});

		hide($Observable.prototype, OBSERVABLE, function(){ return this; });

		$export($export.G, {Observable: $Observable});

		__webpack_require__(59)('Observable');

	/***/ },
	/* 565 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata                  = __webpack_require__(45)
		  , anObject                  = __webpack_require__(6)
		  , toMetaKey                 = metadata.key
		  , ordinaryDefineOwnMetadata = metadata.set;

		metadata.exp({defineMetadata: function defineMetadata(metadataKey, metadataValue, target, targetKey){
		  ordinaryDefineOwnMetadata(metadataKey, metadataValue, anObject(target), toMetaKey(targetKey));
		}});

	/***/ },
	/* 566 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata               = __webpack_require__(45)
		  , anObject               = __webpack_require__(6)
		  , toMetaKey              = metadata.key
		  , getOrCreateMetadataMap = metadata.map
		  , store                  = metadata.store;

		metadata.exp({deleteMetadata: function deleteMetadata(metadataKey, target /*, targetKey */){
		  var targetKey   = arguments.length < 3 ? undefined : toMetaKey(arguments[2])
		    , metadataMap = getOrCreateMetadataMap(anObject(target), targetKey, false);
		  if(metadataMap === undefined || !metadataMap['delete'](metadataKey))return false;
		  if(metadataMap.size)return true;
		  var targetMetadata = store.get(target);
		  targetMetadata['delete'](targetKey);
		  return !!targetMetadata.size || store['delete'](target);
		}});

	/***/ },
	/* 567 */
	/***/ function(module, exports, __webpack_require__) {

		var Set                     = __webpack_require__(235)
		  , from                    = __webpack_require__(212)
		  , metadata                = __webpack_require__(45)
		  , anObject                = __webpack_require__(6)
		  , getPrototypeOf          = __webpack_require__(33)
		  , ordinaryOwnMetadataKeys = metadata.keys
		  , toMetaKey               = metadata.key;

		var ordinaryMetadataKeys = function(O, P){
		  var oKeys  = ordinaryOwnMetadataKeys(O, P)
		    , parent = getPrototypeOf(O);
		  if(parent === null)return oKeys;
		  var pKeys  = ordinaryMetadataKeys(parent, P);
		  return pKeys.length ? oKeys.length ? from(new Set(oKeys.concat(pKeys))) : pKeys : oKeys;
		};

		metadata.exp({getMetadataKeys: function getMetadataKeys(target /*, targetKey */){
		  return ordinaryMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));
		}});

	/***/ },
	/* 568 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata               = __webpack_require__(45)
		  , anObject               = __webpack_require__(6)
		  , getPrototypeOf         = __webpack_require__(33)
		  , ordinaryHasOwnMetadata = metadata.has
		  , ordinaryGetOwnMetadata = metadata.get
		  , toMetaKey              = metadata.key;

		var ordinaryGetMetadata = function(MetadataKey, O, P){
		  var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);
		  if(hasOwn)return ordinaryGetOwnMetadata(MetadataKey, O, P);
		  var parent = getPrototypeOf(O);
		  return parent !== null ? ordinaryGetMetadata(MetadataKey, parent, P) : undefined;
		};

		metadata.exp({getMetadata: function getMetadata(metadataKey, target /*, targetKey */){
		  return ordinaryGetMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));
		}});

	/***/ },
	/* 569 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata                = __webpack_require__(45)
		  , anObject                = __webpack_require__(6)
		  , ordinaryOwnMetadataKeys = metadata.keys
		  , toMetaKey               = metadata.key;

		metadata.exp({getOwnMetadataKeys: function getOwnMetadataKeys(target /*, targetKey */){
		  return ordinaryOwnMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));
		}});

	/***/ },
	/* 570 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata               = __webpack_require__(45)
		  , anObject               = __webpack_require__(6)
		  , ordinaryGetOwnMetadata = metadata.get
		  , toMetaKey              = metadata.key;

		metadata.exp({getOwnMetadata: function getOwnMetadata(metadataKey, target /*, targetKey */){
		  return ordinaryGetOwnMetadata(metadataKey, anObject(target)
		    , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));
		}});

	/***/ },
	/* 571 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata               = __webpack_require__(45)
		  , anObject               = __webpack_require__(6)
		  , getPrototypeOf         = __webpack_require__(33)
		  , ordinaryHasOwnMetadata = metadata.has
		  , toMetaKey              = metadata.key;

		var ordinaryHasMetadata = function(MetadataKey, O, P){
		  var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);
		  if(hasOwn)return true;
		  var parent = getPrototypeOf(O);
		  return parent !== null ? ordinaryHasMetadata(MetadataKey, parent, P) : false;
		};

		metadata.exp({hasMetadata: function hasMetadata(metadataKey, target /*, targetKey */){
		  return ordinaryHasMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));
		}});

	/***/ },
	/* 572 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata               = __webpack_require__(45)
		  , anObject               = __webpack_require__(6)
		  , ordinaryHasOwnMetadata = metadata.has
		  , toMetaKey              = metadata.key;

		metadata.exp({hasOwnMetadata: function hasOwnMetadata(metadataKey, target /*, targetKey */){
		  return ordinaryHasOwnMetadata(metadataKey, anObject(target)
		    , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));
		}});

	/***/ },
	/* 573 */
	/***/ function(module, exports, __webpack_require__) {

		var metadata                  = __webpack_require__(45)
		  , anObject                  = __webpack_require__(6)
		  , aFunction                 = __webpack_require__(27)
		  , toMetaKey                 = metadata.key
		  , ordinaryDefineOwnMetadata = metadata.set;

		metadata.exp({metadata: function metadata(metadataKey, metadataValue){
		  return function decorator(target, targetKey){
		    ordinaryDefineOwnMetadata(
		      metadataKey, metadataValue,
		      (targetKey !== undefined ? anObject : aFunction)(target),
		      toMetaKey(targetKey)
		    );
		  };
		}});

	/***/ },
	/* 574 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/DavidBruant/Map-Set.prototype.toJSON
		var $export  = __webpack_require__(1);

		$export($export.P + $export.R, 'Set', {toJSON: __webpack_require__(216)('Set')});

	/***/ },
	/* 575 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/mathiasbynens/String.prototype.at
		var $export = __webpack_require__(1)
		  , $at     = __webpack_require__(157)(true);

		$export($export.P, 'String', {
		  at: function at(pos){
		    return $at(this, pos);
		  }
		});

	/***/ },
	/* 576 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://tc39.github.io/String.prototype.matchAll/
		var $export     = __webpack_require__(1)
		  , defined     = __webpack_require__(37)
		  , toLength    = __webpack_require__(20)
		  , isRegExp    = __webpack_require__(108)
		  , getFlags    = __webpack_require__(106)
		  , RegExpProto = RegExp.prototype;

		var $RegExpStringIterator = function(regexp, string){
		  this._r = regexp;
		  this._s = string;
		};

		__webpack_require__(150)($RegExpStringIterator, 'RegExp String', function next(){
		  var match = this._r.exec(this._s);
		  return {value: match, done: match === null};
		});

		$export($export.P, 'String', {
		  matchAll: function matchAll(regexp){
		    defined(this);
		    if(!isRegExp(regexp))throw TypeError(regexp + ' is not a regexp!');
		    var S     = String(this)
		      , flags = 'flags' in RegExpProto ? String(regexp.flags) : getFlags.call(regexp)
		      , rx    = new RegExp(regexp.source, ~flags.indexOf('g') ? flags : 'g' + flags);
		    rx.lastIndex = toLength(regexp.lastIndex);
		    return new $RegExpStringIterator(rx, S);
		  }
		});

	/***/ },
	/* 577 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/tc39/proposal-string-pad-start-end
		var $export = __webpack_require__(1)
		  , $pad    = __webpack_require__(231);

		$export($export.P, 'String', {
		  padEnd: function padEnd(maxLength /*, fillString = ' ' */){
		    return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, false);
		  }
		});

	/***/ },
	/* 578 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/tc39/proposal-string-pad-start-end
		var $export = __webpack_require__(1)
		  , $pad    = __webpack_require__(231);

		$export($export.P, 'String', {
		  padStart: function padStart(maxLength /*, fillString = ' ' */){
		    return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, true);
		  }
		});

	/***/ },
	/* 579 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/sebmarkbage/ecmascript-string-left-right-trim
		__webpack_require__(71)('trimLeft', function($trim){
		  return function trimLeft(){
		    return $trim(this, 1);
		  };
		}, 'trimStart');

	/***/ },
	/* 580 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';
		// https://github.com/sebmarkbage/ecmascript-string-left-right-trim
		__webpack_require__(71)('trimRight', function($trim){
		  return function trimRight(){
		    return $trim(this, 2);
		  };
		}, 'trimEnd');

	/***/ },
	/* 581 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(163)('asyncIterator');

	/***/ },
	/* 582 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(163)('observable');

	/***/ },
	/* 583 */
	/***/ function(module, exports, __webpack_require__) {

		// https://github.com/ljharb/proposal-global
		var $export = __webpack_require__(1);

		$export($export.S, 'System', {global: __webpack_require__(8)});

	/***/ },
	/* 584 */
	/***/ function(module, exports, __webpack_require__) {

		var $iterators    = __webpack_require__(165)
		  , redefine      = __webpack_require__(28)
		  , global        = __webpack_require__(8)
		  , hide          = __webpack_require__(25)
		  , Iterators     = __webpack_require__(53)
		  , wks           = __webpack_require__(13)
		  , ITERATOR      = wks('iterator')
		  , TO_STRING_TAG = wks('toStringTag')
		  , ArrayValues   = Iterators.Array;

		for(var collections = ['NodeList', 'DOMTokenList', 'MediaList', 'StyleSheetList', 'CSSRuleList'], i = 0; i < 5; i++){
		  var NAME       = collections[i]
		    , Collection = global[NAME]
		    , proto      = Collection && Collection.prototype
		    , key;
		  if(proto){
		    if(!proto[ITERATOR])hide(proto, ITERATOR, ArrayValues);
		    if(!proto[TO_STRING_TAG])hide(proto, TO_STRING_TAG, NAME);
		    Iterators[NAME] = ArrayValues;
		    for(key in $iterators)if(!proto[key])redefine(proto, key, $iterators[key], true);
		  }
		}

	/***/ },
	/* 585 */
	/***/ function(module, exports, __webpack_require__) {

		var $export = __webpack_require__(1)
		  , $task   = __webpack_require__(161);
		$export($export.G + $export.B, {
		  setImmediate:   $task.set,
		  clearImmediate: $task.clear
		});

	/***/ },
	/* 586 */
	/***/ function(module, exports, __webpack_require__) {

		// ie9- setTimeout & setInterval additional parameters fix
		var global     = __webpack_require__(8)
		  , $export    = __webpack_require__(1)
		  , invoke     = __webpack_require__(107)
		  , partial    = __webpack_require__(412)
		  , navigator  = global.navigator
		  , MSIE       = !!navigator && /MSIE .\./.test(navigator.userAgent); // <- dirty ie9- check
		var wrap = function(set){
		  return MSIE ? function(fn, time /*, ...args */){
		    return set(invoke(
		      partial,
		      [].slice.call(arguments, 2),
		      typeof fn == 'function' ? fn : Function(fn)
		    ), time);
		  } : set;
		};
		$export($export.G + $export.B + $export.F * MSIE, {
		  setTimeout:  wrap(global.setTimeout),
		  setInterval: wrap(global.setInterval)
		});

	/***/ },
	/* 587 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(536);
		__webpack_require__(475);
		__webpack_require__(477);
		__webpack_require__(476);
		__webpack_require__(479);
		__webpack_require__(481);
		__webpack_require__(486);
		__webpack_require__(480);
		__webpack_require__(478);
		__webpack_require__(488);
		__webpack_require__(487);
		__webpack_require__(483);
		__webpack_require__(484);
		__webpack_require__(482);
		__webpack_require__(474);
		__webpack_require__(485);
		__webpack_require__(489);
		__webpack_require__(490);
		__webpack_require__(442);
		__webpack_require__(444);
		__webpack_require__(443);
		__webpack_require__(492);
		__webpack_require__(491);
		__webpack_require__(462);
		__webpack_require__(472);
		__webpack_require__(473);
		__webpack_require__(463);
		__webpack_require__(464);
		__webpack_require__(465);
		__webpack_require__(466);
		__webpack_require__(467);
		__webpack_require__(468);
		__webpack_require__(469);
		__webpack_require__(470);
		__webpack_require__(471);
		__webpack_require__(445);
		__webpack_require__(446);
		__webpack_require__(447);
		__webpack_require__(448);
		__webpack_require__(449);
		__webpack_require__(450);
		__webpack_require__(451);
		__webpack_require__(452);
		__webpack_require__(453);
		__webpack_require__(454);
		__webpack_require__(455);
		__webpack_require__(456);
		__webpack_require__(457);
		__webpack_require__(458);
		__webpack_require__(459);
		__webpack_require__(460);
		__webpack_require__(461);
		__webpack_require__(523);
		__webpack_require__(528);
		__webpack_require__(535);
		__webpack_require__(526);
		__webpack_require__(518);
		__webpack_require__(519);
		__webpack_require__(524);
		__webpack_require__(529);
		__webpack_require__(531);
		__webpack_require__(514);
		__webpack_require__(515);
		__webpack_require__(516);
		__webpack_require__(517);
		__webpack_require__(520);
		__webpack_require__(521);
		__webpack_require__(522);
		__webpack_require__(525);
		__webpack_require__(527);
		__webpack_require__(530);
		__webpack_require__(532);
		__webpack_require__(533);
		__webpack_require__(534);
		__webpack_require__(437);
		__webpack_require__(439);
		__webpack_require__(438);
		__webpack_require__(441);
		__webpack_require__(440);
		__webpack_require__(426);
		__webpack_require__(424);
		__webpack_require__(430);
		__webpack_require__(427);
		__webpack_require__(433);
		__webpack_require__(435);
		__webpack_require__(423);
		__webpack_require__(429);
		__webpack_require__(420);
		__webpack_require__(434);
		__webpack_require__(418);
		__webpack_require__(432);
		__webpack_require__(431);
		__webpack_require__(425);
		__webpack_require__(428);
		__webpack_require__(417);
		__webpack_require__(419);
		__webpack_require__(422);
		__webpack_require__(421);
		__webpack_require__(436);
		__webpack_require__(165);
		__webpack_require__(508);
		__webpack_require__(513);
		__webpack_require__(234);
		__webpack_require__(509);
		__webpack_require__(510);
		__webpack_require__(511);
		__webpack_require__(512);
		__webpack_require__(493);
		__webpack_require__(233);
		__webpack_require__(235);
		__webpack_require__(236);
		__webpack_require__(548);
		__webpack_require__(537);
		__webpack_require__(538);
		__webpack_require__(543);
		__webpack_require__(546);
		__webpack_require__(547);
		__webpack_require__(541);
		__webpack_require__(544);
		__webpack_require__(542);
		__webpack_require__(545);
		__webpack_require__(539);
		__webpack_require__(540);
		__webpack_require__(494);
		__webpack_require__(495);
		__webpack_require__(496);
		__webpack_require__(497);
		__webpack_require__(498);
		__webpack_require__(501);
		__webpack_require__(499);
		__webpack_require__(500);
		__webpack_require__(502);
		__webpack_require__(503);
		__webpack_require__(504);
		__webpack_require__(505);
		__webpack_require__(507);
		__webpack_require__(506);
		__webpack_require__(549);
		__webpack_require__(575);
		__webpack_require__(578);
		__webpack_require__(577);
		__webpack_require__(579);
		__webpack_require__(580);
		__webpack_require__(576);
		__webpack_require__(581);
		__webpack_require__(582);
		__webpack_require__(560);
		__webpack_require__(563);
		__webpack_require__(559);
		__webpack_require__(557);
		__webpack_require__(558);
		__webpack_require__(561);
		__webpack_require__(562);
		__webpack_require__(552);
		__webpack_require__(574);
		__webpack_require__(583);
		__webpack_require__(551);
		__webpack_require__(553);
		__webpack_require__(555);
		__webpack_require__(554);
		__webpack_require__(556);
		__webpack_require__(565);
		__webpack_require__(566);
		__webpack_require__(568);
		__webpack_require__(567);
		__webpack_require__(570);
		__webpack_require__(569);
		__webpack_require__(571);
		__webpack_require__(572);
		__webpack_require__(573);
		__webpack_require__(550);
		__webpack_require__(564);
		__webpack_require__(586);
		__webpack_require__(585);
		__webpack_require__(584);
		module.exports = __webpack_require__(40);

	/***/ },
	/* 588 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var elliptic = __webpack_require__(26);
		var BN = __webpack_require__(19);

		module.exports = function createECDH(curve) {
			return new ECDH(curve);
		};

		var aliases = {
			secp256k1: {
				name: 'secp256k1',
				byteLength: 32
			},
			secp224r1: {
				name: 'p224',
				byteLength: 28
			},
			prime256v1: {
				name: 'p256',
				byteLength: 32
			},
			prime192v1: {
				name: 'p192',
				byteLength: 24
			},
			ed25519: {
				name: 'ed25519',
				byteLength: 32
			},
			secp384r1: {
				name: 'p384',
				byteLength: 48
			},
			secp521r1: {
				name: 'p521',
				byteLength: 66
			}
		};

		aliases.p224 = aliases.secp224r1;
		aliases.p256 = aliases.secp256r1 = aliases.prime256v1;
		aliases.p192 = aliases.secp192r1 = aliases.prime192v1;
		aliases.p384 = aliases.secp384r1;
		aliases.p521 = aliases.secp521r1;

		function ECDH(curve) {
			this.curveType = aliases[curve];
			if (!this.curveType ) {
				this.curveType = {
					name: curve
				};
			}
			this.curve = new elliptic.ec(this.curveType.name);
			this.keys = void 0;
		}

		ECDH.prototype.generateKeys = function (enc, format) {
			this.keys = this.curve.genKeyPair();
			return this.getPublicKey(enc, format);
		};

		ECDH.prototype.computeSecret = function (other, inenc, enc) {
			inenc = inenc || 'utf8';
			if (!Buffer.isBuffer(other)) {
				other = new Buffer(other, inenc);
			}
			var otherPub = this.curve.keyFromPublic(other).getPublic();
			var out = otherPub.mul(this.keys.getPrivate()).getX();
			return formatReturnValue(out, enc, this.curveType.byteLength);
		};

		ECDH.prototype.getPublicKey = function (enc, format) {
			var key = this.keys.getPublic(format === 'compressed', true);
			if (format === 'hybrid') {
				if (key[key.length - 1] % 2) {
					key[0] = 7;
				} else {
					key [0] = 6;
				}
			}
			return formatReturnValue(key, enc);
		};

		ECDH.prototype.getPrivateKey = function (enc) {
			return formatReturnValue(this.keys.getPrivate(), enc);
		};

		ECDH.prototype.setPublicKey = function (pub, enc) {
			enc = enc || 'utf8';
			if (!Buffer.isBuffer(pub)) {
				pub = new Buffer(pub, enc);
			}
			this.keys._importPublic(pub);
			return this;
		};

		ECDH.prototype.setPrivateKey = function (priv, enc) {
			enc = enc || 'utf8';
			if (!Buffer.isBuffer(priv)) {
				priv = new Buffer(priv, enc);
			}
			var _priv = new BN(priv);
			_priv = _priv.toString(16);
			this.keys._importPrivate(_priv);
			return this;
		};

		function formatReturnValue(bn, enc, len) {
			if (!Array.isArray(bn)) {
				bn = bn.toArray();
			}
			var buf = new Buffer(bn);
			if (len && buf.length < len) {
				var zeros = new Buffer(len - buf.length);
				zeros.fill(0);
				buf = Buffer.concat([zeros, buf]);
			}
			if (!enc) {
				return buf;
			} else {
				return buf.toString(enc);
			}
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 589 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';
		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);
		}
		exports.hash = hash;
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 590 */
	/***/ function(module, exports, __webpack_require__) {

		var require;var require;!function(a){if(true)module.exports=a();else if("function"==typeof define&&define.amd)define([],a);else{var b;b="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this,b.db=a()}}(function(){var a;return function b(a,c,d){function e(g,h){if(!c[g]){if(!a[g]){var i="function"==typeof require&&require;if(!h&&i)return require(g,!0);if(f)return f(g,!0);var j=new Error("Cannot find module '"+g+"'");throw j.code="MODULE_NOT_FOUND",j}var k=c[g]={exports:{}};a[g][0].call(k.exports,function(b){var c=a[g][1][b];return e(c?c:b)},k,k.exports,b,a,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g<d.length;g++)e(d[g]);return e}({1:[function(b,c,d){"use strict";function e(a){if(Array.isArray(a)){for(var b=0,c=Array(a.length);b<a.length;b++)c[b]=a[b];return c}return Array.from(a)}var f=function(){function a(a,b){var c=[],d=!0,e=!1,f=void 0;try{for(var g,h=a[Symbol.iterator]();!(d=(g=h.next()).done)&&(c.push(g.value),!b||c.length!==b);d=!0);}catch(i){e=!0,f=i}finally{try{!d&&h["return"]&&h["return"]()}finally{if(e)throw f}}return c}return function(b,c){if(Array.isArray(b))return b;if(Symbol.iterator in Object(b))return a(b,c);throw new TypeError("Invalid attempt to destructure non-iterable instance")}}(),g="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(a){return typeof a}:function(a){return a&&"function"==typeof Symbol&&a.constructor===Symbol?"symbol":typeof a};!function(b){function d(a){return a&&"object"===("undefined"==typeof a?"undefined":g(a))}function h(a){var b=Object.keys(a).sort();if(1===b.length){var c=b[0],d=a[c],e=void 0,f=void 0;switch(c){case"eq":e="only";break;case"gt":e="lowerBound",f=!0;break;case"lt":e="upperBound",f=!0;break;case"gte":e="lowerBound";break;case"lte":e="upperBound";break;default:throw new TypeError("`"+c+"` is not a valid key")}return[e,[d,f]]}var g=a[b[0]],h=a[b[1]],i=b.join("-");switch(i){case"gt-lt":case"gt-lte":case"gte-lt":case"gte-lte":return["bound",[g,h,"gt"===b[0],"lt"===b[1]]];default:throw new TypeError("`"+i+"` are conflicted keys")}}function i(a){if(a&&"object"===("undefined"==typeof a?"undefined":g(a))&&!(a instanceof j)){var b=h(a),c=f(b,2),d=c[0],i=c[1];return j[d].apply(j,e(i))}return a}var j=b.IDBKeyRange||b.webkitIDBKeyRange,k={readonly:"readonly",readwrite:"readwrite"},l=Object.prototype.hasOwnProperty,m=function(a){return a},n=b.indexedDB||b.webkitIndexedDB||b.mozIndexedDB||b.oIndexedDB||b.msIndexedDB||b.shimIndexedDB||function(){throw new Error("IndexedDB required")}(),o={},p=["abort","error","versionchange"],q=function(a,b,c,d){var f=this,i=null,l=function(d,f,h,l,m,n,o){return new Promise(function(p,q){var r=void 0;try{r=d?j[d].apply(j,e(f)):null}catch(s){return void q(s)}n=n||[],m=m||null;var t=[],u=0,v=[r],w=b.transaction(a,i?k.readwrite:k.readonly);w.onerror=function(a){return q(a)},w.onabort=function(a){return q(a)},w.oncomplete=function(){return p(t)};var x=w.objectStore(a),y="string"==typeof c?x.index(c):x;"count"!==h&&v.push(l||"next");var z=i?Object.keys(i):[],A=function(a){return z.forEach(function(b){var c=i[b];"function"==typeof c&&(c=c(a)),a[b]=c}),a};y[h].apply(y,v).onsuccess=function(a){var b=a.target.result;if("number"==typeof b)t=b;else if(b)if(null!==m&&m[0]>u)u=m[0],b.advance(m[0]);else if(null!==m&&u>=m[0]+m[1]);else{var c=function(){var a=!0,c="value"in b?b.value:b.key;try{n.forEach(function(b){a="function"==typeof b[0]?a&&b[0](c):a&&c[b[0]]===b[1]})}catch(d){return q(d),{v:void 0}}if(a){if(u++,i)try{c=A(c),b.update(c)}catch(d){return q(d),{v:void 0}}try{t.push(o(c))}catch(d){return q(d),{v:void 0}}}b["continue"]()}();if("object"===("undefined"==typeof c?"undefined":g(c)))return c.v}}})},n=function(a,b,c){var e=[],f="next",h="openCursor",j=null,k=m,n=!1,o=d||c,p=function(){return o?Promise.reject(o):l(a,b,h,n?f+"unique":f,j,e,k)},q=function(){return f=null,h="count",{execute:p}},r=function(){return h="openKeyCursor",{desc:u,distinct:v,execute:p,filter:t,limit:s,map:x}},s=function(a,b){return j=b?[a,b]:[0,a],o=j.some(function(a){return"number"!=typeof a})?new Error("limit() arguments must be numeric"):o,{desc:u,distinct:v,filter:t,keys:r,execute:p,map:x,modify:w}},t=function y(a,b){return e.push([a,b]),{desc:u,distinct:v,execute:p,filter:y,keys:r,limit:s,map:x,modify:w}},u=function(){return f="prev",{distinct:v,execute:p,filter:t,keys:r,limit:s,map:x,modify:w}},v=function(){return n=!0,{count:q,desc:u,execute:p,filter:t,keys:r,limit:s,map:x,modify:w}},w=function(a){return i=a&&"object"===("undefined"==typeof a?"undefined":g(a))?a:null,{execute:p}},x=function(a){return k=a,{count:q,desc:u,distinct:v,execute:p,filter:t,keys:r,limit:s,modify:w}};return{count:q,desc:u,distinct:v,execute:p,filter:t,keys:r,limit:s,map:x,modify:w}};["only","bound","upperBound","lowerBound"].forEach(function(a){f[a]=function(){return n(a,arguments)}}),this.range=function(a){var b=void 0,c=[null,null];try{c=h(a)}catch(d){b=d}return n.apply(void 0,e(c).concat([b]))},this.filter=function(){var a=n(null,null);return a.filter.apply(a,arguments)},this.all=function(){return this.filter()}},r=function(a,b,c,e){var f=this,g=!1;if(this.getIndexedDB=function(){return a},this.isClosed=function(){return g},this.query=function(b,c){var d=g?new Error("Database has been closed"):null;return new q(b,a,c,d)},this.add=function(b){for(var c=arguments.length,e=Array(c>1?c-1:0),f=1;c>f;f++)e[f-1]=arguments[f];return new Promise(function(c,f){if(g)return void f(new Error("Database has been closed"));var h=e.reduce(function(a,b){return a.concat(b)},[]),j=a.transaction(b,k.readwrite);j.onerror=function(a){a.preventDefault(),f(a)},j.onabort=function(a){return f(a)},j.oncomplete=function(){return c(h)};var m=j.objectStore(b);h.some(function(a){var b=void 0,c=void 0;if(d(a)&&l.call(a,"item")&&(c=a.key,a=a.item,null!=c))try{c=i(c)}catch(e){return f(e),!0}try{b=null!=c?m.add(a,c):m.add(a)}catch(e){return f(e),!0}b.onsuccess=function(b){if(d(a)){var c=b.target,e=c.source.keyPath;null===e&&(e="__id__"),l.call(a,e)||Object.defineProperty(a,e,{value:c.result,enumerable:!0})}}})})},this.update=function(b){for(var c=arguments.length,e=Array(c>1?c-1:0),f=1;c>f;f++)e[f-1]=arguments[f];return new Promise(function(c,f){if(g)return void f(new Error("Database has been closed"));var h=e.reduce(function(a,b){return a.concat(b)},[]),j=a.transaction(b,k.readwrite);j.onerror=function(a){a.preventDefault(),f(a)},j.onabort=function(a){return f(a)},j.oncomplete=function(){return c(h)};var m=j.objectStore(b);h.some(function(a){var b=void 0,c=void 0;if(d(a)&&l.call(a,"item")&&(c=a.key,a=a.item,null!=c))try{c=i(c)}catch(e){return f(e),!0}try{b=null!=c?m.put(a,c):m.put(a)}catch(g){return f(g),!0}b.onsuccess=function(b){if(d(a)){var c=b.target,e=c.source.keyPath;null===e&&(e="__id__"),l.call(a,e)||Object.defineProperty(a,e,{value:c.result,enumerable:!0})}}})})},this.put=function(){return this.update.apply(this,arguments)},this.remove=function(b,c){return new Promise(function(d,e){if(g)return void e(new Error("Database has been closed"));try{c=i(c)}catch(f){return void e(f)}var h=a.transaction(b,k.readwrite);h.onerror=function(a){a.preventDefault(),e(a)},h.onabort=function(a){return e(a)},h.oncomplete=function(){return d(c)};var j=h.objectStore(b);try{j["delete"](c)}catch(l){e(l)}})},this["delete"]=function(){return this.remove.apply(this,arguments)},this.clear=function(b){return new Promise(function(c,d){if(g)return void d(new Error("Database has been closed"));var e=a.transaction(b,k.readwrite);e.onerror=function(a){return d(a)},e.onabort=function(a){return d(a)},e.oncomplete=function(){return c()};var f=e.objectStore(b);f.clear()})},this.close=function(){return new Promise(function(d,e){return g?void e(new Error("Database has been closed")):(a.close(),g=!0,delete o[b][c],void d())})},this.get=function(b,c){return new Promise(function(d,e){if(g)return void e(new Error("Database has been closed"));try{c=i(c)}catch(f){return void e(f)}var h=a.transaction(b);h.onerror=function(a){a.preventDefault(),e(a)},h.onabort=function(a){return e(a)};var j=h.objectStore(b),k=void 0;try{k=j.get(c)}catch(l){e(l)}k.onsuccess=function(a){return d(a.target.result)}})},this.count=function(b,c){return new Promise(function(d,e){if(g)return void e(new Error("Database has been closed"));try{c=i(c)}catch(f){return void e(f)}var h=a.transaction(b);h.onerror=function(a){a.preventDefault(),e(a)},h.onabort=function(a){return e(a)};var j=h.objectStore(b),k=void 0;try{k=null==c?j.count():j.count(c)}catch(l){e(l)}k.onsuccess=function(a){return d(a.target.result)}})},this.addEventListener=function(b,c){if(!p.includes(b))throw new Error("Unrecognized event type "+b);return"error"===b?void a.addEventListener(b,function(a){a.preventDefault(),c(a)}):void a.addEventListener(b,c)},this.removeEventListener=function(b,c){if(!p.includes(b))throw new Error("Unrecognized event type "+b);a.removeEventListener(b,c)},p.forEach(function(a){this[a]=function(b){return this.addEventListener(a,b),this}},this),!e){var h=void 0;return[].some.call(a.objectStoreNames,function(a){if(f[a])return h=new Error('The store name, "'+a+'", which you have attempted to load, conflicts with db.js method names."'),f.close(),!0;f[a]={};var b=Object.keys(f);b.filter(function(a){return![].concat(p,["close","addEventListener","removeEventListener"]).includes(a)}).map(function(b){return f[a][b]=function(){for(var c=arguments.length,d=Array(c),e=0;c>e;e++)d[e]=arguments[e];return f[b].apply(f,[a].concat(d))}})}),h}},s=function(a,b,c,d,e,f){if(c&&0!==c.length){for(var h=0;h<d.objectStoreNames.length;h++){var i=d.objectStoreNames[h];l.call(c,i)||d.deleteObjectStore(i)}var j=void 0;return Object.keys(c).some(function(a){var e=c[a],f=void 0;if(d.objectStoreNames.contains(a))f=b.transaction.objectStore(a);else try{f=d.createObjectStore(a,e.key)}catch(h){return j=h,!0}Object.keys(e.indexes||{}).some(function(a){try{f.index(a)}catch(b){var c=e.indexes[a];c=c&&"object"===("undefined"==typeof c?"undefined":g(c))?c:{};try{f.createIndex(a,c.keyPath||c.key||a,c)}catch(d){return j=d,!0}}})}),j}},t=function(a,b,c,d){var e=a.target.result;o[b][c]=e;var f=new r(e,b,c,d);return f instanceof Error?Promise.reject(f):Promise.resolve(f)},u={version:"0.15.0",open:function(a){var b=a.server,c=a.version||1,d=a.schema,e=a.noServerMethods;return o[b]||(o[b]={}),new Promise(function(a,f){if(o[b][c])t({target:{result:o[b][c]}},b,c,e).then(a,f);else{var h=function(){if("function"==typeof d)try{d=d()}catch(g){return f(g),{v:void 0}}var h=n.open(b,c);h.onsuccess=function(d){return t(d,b,c,e).then(a,f)},h.onerror=function(a){a.preventDefault(),f(a)},h.onupgradeneeded=function(a){var e=s(a,h,d,a.target.result,b,c);e&&f(e)},h.onblocked=function(a){var d=new Promise(function(a,d){h.onsuccess=function(f){t(f,b,c,e).then(a,d)},h.onerror=function(a){return d(a)}});a.resume=d,f(a)}}();if("object"===("undefined"==typeof h?"undefined":g(h)))return h.v}})},"delete":function(a){return new Promise(function(b,c){var d=n.deleteDatabase(a);d.onsuccess=function(a){return b(a)},d.onerror=function(a){return c(a)},d.onblocked=function(a){a=null===a.newVersion||"undefined"==typeof Proxy?a:new Proxy(a,{get:function(a,b){return"newVersion"===b?null:a[b]}});var b=new Promise(function(b,c){d.onsuccess=function(c){"newVersion"in c||(c.newVersion=a.newVersion),"oldVersion"in c||(c.oldVersion=a.oldVersion),b(c)},d.onerror=function(a){return c(a)}});a.resume=b,c(a)}})},cmp:function(a,b){return new Promise(function(c,d){try{c(n.cmp(a,b))}catch(e){d(e)}})}};"undefined"!=typeof c&&"undefined"!=typeof c.exports?c.exports=u:"function"==typeof a&&a.amd?a(function(){return u}):b.db=u}(self)},{}]},{},[1])(1)});
		//# sourceMappingURL=db.min.js.map

	/***/ },
	/* 591 */
	/***/ function(module, exports, __webpack_require__) {

		
		/**
		 * This is the common logic for both the Node.js and web browser
		 * implementations of `debug()`.
		 *
		 * Expose `debug()` as the module.
		 */

		exports = module.exports = debug;
		exports.coerce = coerce;
		exports.disable = disable;
		exports.enable = enable;
		exports.enabled = enabled;
		exports.humanize = __webpack_require__(686);

		/**
		 * The currently active debug mode names, and names to skip.
		 */

		exports.names = [];
		exports.skips = [];

		/**
		 * Map of special "%n" handling functions, for the debug "format" argument.
		 *
		 * Valid key names are a single, lowercased letter, i.e. "n".
		 */

		exports.formatters = {};

		/**
		 * Previously assigned color.
		 */

		var prevColor = 0;

		/**
		 * Previous log timestamp.
		 */

		var prevTime;

		/**
		 * Select a color.
		 *
		 * @return {Number}
		 * @api private
		 */

		function selectColor() {
		  return exports.colors[prevColor++ % exports.colors.length];
		}

		/**
		 * Create a debugger with the given `namespace`.
		 *
		 * @param {String} namespace
		 * @return {Function}
		 * @api public
		 */

		function debug(namespace) {

		  // define the `disabled` version
		  function disabled() {
		  }
		  disabled.enabled = false;

		  // define the `enabled` version
		  function enabled() {

		    var self = enabled;

		    // set `diff` timestamp
		    var curr = +new Date();
		    var ms = curr - (prevTime || curr);
		    self.diff = ms;
		    self.prev = prevTime;
		    self.curr = curr;
		    prevTime = curr;

		    // add the `color` if not set
		    if (null == self.useColors) self.useColors = exports.useColors();
		    if (null == self.color && self.useColors) self.color = selectColor();

		    var args = Array.prototype.slice.call(arguments);

		    args[0] = exports.coerce(args[0]);

		    if ('string' !== typeof args[0]) {
		      // anything else let's inspect with %o
		      args = ['%o'].concat(args);
		    }

		    // apply any `formatters` transformations
		    var index = 0;
		    args[0] = args[0].replace(/%([a-z%])/g, function(match, format) {
		      // if we encounter an escaped % then don't increase the array index
		      if (match === '%%') return match;
		      index++;
		      var formatter = exports.formatters[format];
		      if ('function' === typeof formatter) {
		        var val = args[index];
		        match = formatter.call(self, val);

		        // now we need to remove `args[index]` since it's inlined in the `format`
		        args.splice(index, 1);
		        index--;
		      }
		      return match;
		    });

		    if ('function' === typeof exports.formatArgs) {
		      args = exports.formatArgs.apply(self, args);
		    }
		    var logFn = enabled.log || exports.log || console.log.bind(console);
		    logFn.apply(self, args);
		  }
		  enabled.enabled = true;

		  var fn = exports.enabled(namespace) ? enabled : disabled;

		  fn.namespace = namespace;

		  return fn;
		}

		/**
		 * Enables a debug mode by namespaces. This can include modes
		 * separated by a colon and wildcards.
		 *
		 * @param {String} namespaces
		 * @api public
		 */

		function enable(namespaces) {
		  exports.save(namespaces);

		  var split = (namespaces || '').split(/[\s,]+/);
		  var len = split.length;

		  for (var i = 0; i < len; i++) {
		    if (!split[i]) continue; // ignore empty strings
		    namespaces = split[i].replace(/\*/g, '.*?');
		    if (namespaces[0] === '-') {
		      exports.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));
		    } else {
		      exports.names.push(new RegExp('^' + namespaces + '$'));
		    }
		  }
		}

		/**
		 * Disable debug output.
		 *
		 * @api public
		 */

		function disable() {
		  exports.enable('');
		}

		/**
		 * Returns true if the given mode name is enabled, false otherwise.
		 *
		 * @param {String} name
		 * @return {Boolean}
		 * @api public
		 */

		function enabled(name) {
		  var i, len;
		  for (i = 0, len = exports.skips.length; i < len; i++) {
		    if (exports.skips[i].test(name)) {
		      return false;
		    }
		  }
		  for (i = 0, len = exports.names.length; i < len; i++) {
		    if (exports.names[i].test(name)) {
		      return true;
		    }
		  }
		  return false;
		}

		/**
		 * Coerce `val`.
		 *
		 * @param {Mixed} val
		 * @return {Mixed}
		 * @api private
		 */

		function coerce(val) {
		  if (val instanceof Error) return val.stack || val.message;
		  return val;
		}


	/***/ },
	/* 592 */
	/***/ function(module, exports) {

		module.exports = function () {
		    for (var i = 0; i < arguments.length; i++) {
		        if (arguments[i] !== undefined) return arguments[i];
		    }
		};


	/***/ },
	/* 593 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var assert = __webpack_require__(77);
		var inherits = __webpack_require__(2);

		var proto = {};

		function CBCState(iv) {
		  assert.equal(iv.length, 8, 'Invalid IV length');

		  this.iv = new Array(8);
		  for (var i = 0; i < this.iv.length; i++)
		    this.iv[i] = iv[i];
		}

		function instantiate(Base) {
		  function CBC(options) {
		    Base.call(this, options);
		    this._cbcInit();
		  }
		  inherits(CBC, Base);

		  var keys = Object.keys(proto);
		  for (var i = 0; i < keys.length; i++) {
		    var key = keys[i];
		    CBC.prototype[key] = proto[key];
		  }

		  CBC.create = function create(options) {
		    return new CBC(options);
		  };

		  return CBC;
		}

		exports.instantiate = instantiate;

		proto._cbcInit = function _cbcInit() {
		  var state = new CBCState(this.options.iv);
		  this._cbcState = state;
		};

		proto._update = function _update(inp, inOff, out, outOff) {
		  var state = this._cbcState;
		  var superProto = this.constructor.super_.prototype;

		  var iv = state.iv;
		  if (this.type === 'encrypt') {
		    for (var i = 0; i < this.blockSize; i++)
		      iv[i] ^= inp[inOff + i];

		    superProto._update.call(this, iv, 0, out, outOff);

		    for (var i = 0; i < this.blockSize; i++)
		      iv[i] = out[outOff + i];
		  } else {
		    superProto._update.call(this, inp, inOff, out, outOff);

		    for (var i = 0; i < this.blockSize; i++)
		      out[outOff + i] ^= iv[i];

		    for (var i = 0; i < this.blockSize; i++)
		      iv[i] = inp[inOff + i];
		  }
		};


	/***/ },
	/* 594 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var assert = __webpack_require__(77);

		function Cipher(options) {
		  this.options = options;

		  this.type = this.options.type;
		  this.blockSize = 8;
		  this._init();

		  this.buffer = new Array(this.blockSize);
		  this.bufferOff = 0;
		}
		module.exports = Cipher;

		Cipher.prototype._init = function _init() {
		  // Might be overrided
		};

		Cipher.prototype.update = function update(data) {
		  if (data.length === 0)
		    return [];

		  if (this.type === 'decrypt')
		    return this._updateDecrypt(data);
		  else
		    return this._updateEncrypt(data);
		};

		Cipher.prototype._buffer = function _buffer(data, off) {
		  // Append data to buffer
		  var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);
		  for (var i = 0; i < min; i++)
		    this.buffer[this.bufferOff + i] = data[off + i];
		  this.bufferOff += min;

		  // Shift next
		  return min;
		};

		Cipher.prototype._flushBuffer = function _flushBuffer(out, off) {
		  this._update(this.buffer, 0, out, off);
		  this.bufferOff = 0;
		  return this.blockSize;
		};

		Cipher.prototype._updateEncrypt = function _updateEncrypt(data) {
		  var inputOff = 0;
		  var outputOff = 0;

		  var count = ((this.bufferOff + data.length) / this.blockSize) | 0;
		  var out = new Array(count * this.blockSize);

		  if (this.bufferOff !== 0) {
		    inputOff += this._buffer(data, inputOff);

		    if (this.bufferOff === this.buffer.length)
		      outputOff += this._flushBuffer(out, outputOff);
		  }

		  // Write blocks
		  var max = data.length - ((data.length - inputOff) % this.blockSize);
		  for (; inputOff < max; inputOff += this.blockSize) {
		    this._update(data, inputOff, out, outputOff);
		    outputOff += this.blockSize;
		  }

		  // Queue rest
		  for (; inputOff < data.length; inputOff++, this.bufferOff++)
		    this.buffer[this.bufferOff] = data[inputOff];

		  return out;
		};

		Cipher.prototype._updateDecrypt = function _updateDecrypt(data) {
		  var inputOff = 0;
		  var outputOff = 0;

		  var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;
		  var out = new Array(count * this.blockSize);

		  // TODO(indutny): optimize it, this is far from optimal
		  for (; count > 0; count--) {
		    inputOff += this._buffer(data, inputOff);
		    outputOff += this._flushBuffer(out, outputOff);
		  }

		  // Buffer rest of the input
		  inputOff += this._buffer(data, inputOff);

		  return out;
		};

		Cipher.prototype.final = function final(buffer) {
		  var first;
		  if (buffer)
		    first = this.update(buffer);

		  var last;
		  if (this.type === 'encrypt')
		    last = this._finalEncrypt();
		  else
		    last = this._finalDecrypt();

		  if (first)
		    return first.concat(last);
		  else
		    return last;
		};

		Cipher.prototype._pad = function _pad(buffer, off) {
		  if (off === 0)
		    return false;

		  while (off < buffer.length)
		    buffer[off++] = 0;

		  return true;
		};

		Cipher.prototype._finalEncrypt = function _finalEncrypt() {
		  if (!this._pad(this.buffer, this.bufferOff))
		    return [];

		  var out = new Array(this.blockSize);
		  this._update(this.buffer, 0, out, 0);
		  return out;
		};

		Cipher.prototype._unpad = function _unpad(buffer) {
		  return buffer;
		};

		Cipher.prototype._finalDecrypt = function _finalDecrypt() {
		  assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');
		  var out = new Array(this.blockSize);
		  this._flushBuffer(out, 0);

		  return this._unpad(out);
		};


	/***/ },
	/* 595 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var assert = __webpack_require__(77);
		var inherits = __webpack_require__(2);

		var des = __webpack_require__(167);
		var utils = des.utils;
		var Cipher = des.Cipher;

		function DESState() {
		  this.tmp = new Array(2);
		  this.keys = null;
		}

		function DES(options) {
		  Cipher.call(this, options);

		  var state = new DESState();
		  this._desState = state;

		  this.deriveKeys(state, options.key);
		}
		inherits(DES, Cipher);
		module.exports = DES;

		DES.create = function create(options) {
		  return new DES(options);
		};

		var shiftTable = [
		  1, 1, 2, 2, 2, 2, 2, 2,
		  1, 2, 2, 2, 2, 2, 2, 1
		];

		DES.prototype.deriveKeys = function deriveKeys(state, key) {
		  state.keys = new Array(16 * 2);

		  assert.equal(key.length, this.blockSize, 'Invalid key length');

		  var kL = utils.readUInt32BE(key, 0);
		  var kR = utils.readUInt32BE(key, 4);

		  utils.pc1(kL, kR, state.tmp, 0);
		  kL = state.tmp[0];
		  kR = state.tmp[1];
		  for (var i = 0; i < state.keys.length; i += 2) {
		    var shift = shiftTable[i >>> 1];
		    kL = utils.r28shl(kL, shift);
		    kR = utils.r28shl(kR, shift);
		    utils.pc2(kL, kR, state.keys, i);
		  }
		};

		DES.prototype._update = function _update(inp, inOff, out, outOff) {
		  var state = this._desState;

		  var l = utils.readUInt32BE(inp, inOff);
		  var r = utils.readUInt32BE(inp, inOff + 4);

		  // Initial Permutation
		  utils.ip(l, r, state.tmp, 0);
		  l = state.tmp[0];
		  r = state.tmp[1];

		  if (this.type === 'encrypt')
		    this._encrypt(state, l, r, state.tmp, 0);
		  else
		    this._decrypt(state, l, r, state.tmp, 0);

		  l = state.tmp[0];
		  r = state.tmp[1];

		  utils.writeUInt32BE(out, l, outOff);
		  utils.writeUInt32BE(out, r, outOff + 4);
		};

		DES.prototype._pad = function _pad(buffer, off) {
		  var value = buffer.length - off;
		  for (var i = off; i < buffer.length; i++)
		    buffer[i] = value;

		  return true;
		};

		DES.prototype._unpad = function _unpad(buffer) {
		  var pad = buffer[buffer.length - 1];
		  for (var i = buffer.length - pad; i < buffer.length; i++)
		    assert.equal(buffer[i], pad);

		  return buffer.slice(0, buffer.length - pad);
		};

		DES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {
		  var l = lStart;
		  var r = rStart;

		  // Apply f() x16 times
		  for (var i = 0; i < state.keys.length; i += 2) {
		    var keyL = state.keys[i];
		    var keyR = state.keys[i + 1];

		    // f(r, k)
		    utils.expand(r, state.tmp, 0);

		    keyL ^= state.tmp[0];
		    keyR ^= state.tmp[1];
		    var s = utils.substitute(keyL, keyR);
		    var f = utils.permute(s);

		    var t = r;
		    r = (l ^ f) >>> 0;
		    l = t;
		  }

		  // Reverse Initial Permutation
		  utils.rip(r, l, out, off);
		};

		DES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {
		  var l = rStart;
		  var r = lStart;

		  // Apply f() x16 times
		  for (var i = state.keys.length - 2; i >= 0; i -= 2) {
		    var keyL = state.keys[i];
		    var keyR = state.keys[i + 1];

		    // f(r, k)
		    utils.expand(l, state.tmp, 0);

		    keyL ^= state.tmp[0];
		    keyR ^= state.tmp[1];
		    var s = utils.substitute(keyL, keyR);
		    var f = utils.permute(s);

		    var t = l;
		    l = (r ^ f) >>> 0;
		    r = t;
		  }

		  // Reverse Initial Permutation
		  utils.rip(l, r, out, off);
		};


	/***/ },
	/* 596 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var assert = __webpack_require__(77);
		var inherits = __webpack_require__(2);

		var des = __webpack_require__(167);
		var Cipher = des.Cipher;
		var DES = des.DES;

		function EDEState(type, key) {
		  assert.equal(key.length, 24, 'Invalid key length');

		  var k1 = key.slice(0, 8);
		  var k2 = key.slice(8, 16);
		  var k3 = key.slice(16, 24);

		  if (type === 'encrypt') {
		    this.ciphers = [
		      DES.create({ type: 'encrypt', key: k1 }),
		      DES.create({ type: 'decrypt', key: k2 }),
		      DES.create({ type: 'encrypt', key: k3 })
		    ];
		  } else {
		    this.ciphers = [
		      DES.create({ type: 'decrypt', key: k3 }),
		      DES.create({ type: 'encrypt', key: k2 }),
		      DES.create({ type: 'decrypt', key: k1 })
		    ];
		  }
		}

		function EDE(options) {
		  Cipher.call(this, options);

		  var state = new EDEState(this.type, this.options.key);
		  this._edeState = state;
		}
		inherits(EDE, Cipher);

		module.exports = EDE;

		EDE.create = function create(options) {
		  return new EDE(options);
		};

		EDE.prototype._update = function _update(inp, inOff, out, outOff) {
		  var state = this._edeState;

		  state.ciphers[0]._update(inp, inOff, out, outOff);
		  state.ciphers[1]._update(out, outOff, out, outOff);
		  state.ciphers[2]._update(out, outOff, out, outOff);
		};

		EDE.prototype._pad = DES.prototype._pad;
		EDE.prototype._unpad = DES.prototype._unpad;


	/***/ },
	/* 597 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		exports.readUInt32BE = function readUInt32BE(bytes, off) {
		  var res =  (bytes[0 + off] << 24) |
		             (bytes[1 + off] << 16) |
		             (bytes[2 + off] << 8) |
		             bytes[3 + off];
		  return res >>> 0;
		};

		exports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {
		  bytes[0 + off] = value >>> 24;
		  bytes[1 + off] = (value >>> 16) & 0xff;
		  bytes[2 + off] = (value >>> 8) & 0xff;
		  bytes[3 + off] = value & 0xff;
		};

		exports.ip = function ip(inL, inR, out, off) {
		  var outL = 0;
		  var outR = 0;

		  for (var i = 6; i >= 0; i -= 2) {
		    for (var j = 0; j <= 24; j += 8) {
		      outL <<= 1;
		      outL |= (inR >>> (j + i)) & 1;
		    }
		    for (var j = 0; j <= 24; j += 8) {
		      outL <<= 1;
		      outL |= (inL >>> (j + i)) & 1;
		    }
		  }

		  for (var i = 6; i >= 0; i -= 2) {
		    for (var j = 1; j <= 25; j += 8) {
		      outR <<= 1;
		      outR |= (inR >>> (j + i)) & 1;
		    }
		    for (var j = 1; j <= 25; j += 8) {
		      outR <<= 1;
		      outR |= (inL >>> (j + i)) & 1;
		    }
		  }

		  out[off + 0] = outL >>> 0;
		  out[off + 1] = outR >>> 0;
		};

		exports.rip = function rip(inL, inR, out, off) {
		  var outL = 0;
		  var outR = 0;

		  for (var i = 0; i < 4; i++) {
		    for (var j = 24; j >= 0; j -= 8) {
		      outL <<= 1;
		      outL |= (inR >>> (j + i)) & 1;
		      outL <<= 1;
		      outL |= (inL >>> (j + i)) & 1;
		    }
		  }
		  for (var i = 4; i < 8; i++) {
		    for (var j = 24; j >= 0; j -= 8) {
		      outR <<= 1;
		      outR |= (inR >>> (j + i)) & 1;
		      outR <<= 1;
		      outR |= (inL >>> (j + i)) & 1;
		    }
		  }

		  out[off + 0] = outL >>> 0;
		  out[off + 1] = outR >>> 0;
		};

		exports.pc1 = function pc1(inL, inR, out, off) {
		  var outL = 0;
		  var outR = 0;

		  // 7, 15, 23, 31, 39, 47, 55, 63
		  // 6, 14, 22, 30, 39, 47, 55, 63
		  // 5, 13, 21, 29, 39, 47, 55, 63
		  // 4, 12, 20, 28
		  for (var i = 7; i >= 5; i--) {
		    for (var j = 0; j <= 24; j += 8) {
		      outL <<= 1;
		      outL |= (inR >> (j + i)) & 1;
		    }
		    for (var j = 0; j <= 24; j += 8) {
		      outL <<= 1;
		      outL |= (inL >> (j + i)) & 1;
		    }
		  }
		  for (var j = 0; j <= 24; j += 8) {
		    outL <<= 1;
		    outL |= (inR >> (j + i)) & 1;
		  }

		  // 1, 9, 17, 25, 33, 41, 49, 57
		  // 2, 10, 18, 26, 34, 42, 50, 58
		  // 3, 11, 19, 27, 35, 43, 51, 59
		  // 36, 44, 52, 60
		  for (var i = 1; i <= 3; i++) {
		    for (var j = 0; j <= 24; j += 8) {
		      outR <<= 1;
		      outR |= (inR >> (j + i)) & 1;
		    }
		    for (var j = 0; j <= 24; j += 8) {
		      outR <<= 1;
		      outR |= (inL >> (j + i)) & 1;
		    }
		  }
		  for (var j = 0; j <= 24; j += 8) {
		    outR <<= 1;
		    outR |= (inL >> (j + i)) & 1;
		  }

		  out[off + 0] = outL >>> 0;
		  out[off + 1] = outR >>> 0;
		};

		exports.r28shl = function r28shl(num, shift) {
		  return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));
		};

		var pc2table = [
		  // inL => outL
		  14, 11, 17, 4, 27, 23, 25, 0,
		  13, 22, 7, 18, 5, 9, 16, 24,
		  2, 20, 12, 21, 1, 8, 15, 26,

		  // inR => outR
		  15, 4, 25, 19, 9, 1, 26, 16,
		  5, 11, 23, 8, 12, 7, 17, 0,
		  22, 3, 10, 14, 6, 20, 27, 24
		];

		exports.pc2 = function pc2(inL, inR, out, off) {
		  var outL = 0;
		  var outR = 0;

		  var len = pc2table.length >>> 1;
		  for (var i = 0; i < len; i++) {
		    outL <<= 1;
		    outL |= (inL >>> pc2table[i]) & 0x1;
		  }
		  for (var i = len; i < pc2table.length; i++) {
		    outR <<= 1;
		    outR |= (inR >>> pc2table[i]) & 0x1;
		  }

		  out[off + 0] = outL >>> 0;
		  out[off + 1] = outR >>> 0;
		};

		exports.expand = function expand(r, out, off) {
		  var outL = 0;
		  var outR = 0;

		  outL = ((r & 1) << 5) | (r >>> 27);
		  for (var i = 23; i >= 15; i -= 4) {
		    outL <<= 6;
		    outL |= (r >>> i) & 0x3f;
		  }
		  for (var i = 11; i >= 3; i -= 4) {
		    outR |= (r >>> i) & 0x3f;
		    outR <<= 6;
		  }
		  outR |= ((r & 0x1f) << 1) | (r >>> 31);

		  out[off + 0] = outL >>> 0;
		  out[off + 1] = outR >>> 0;
		};

		var sTable = [
		  14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,
		  3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,
		  4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,
		  15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,

		  15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,
		  9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,
		  0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,
		  5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,

		  10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,
		  1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,
		  13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,
		  11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,

		  7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,
		  1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,
		  10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,
		  15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,

		  2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,
		  8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,
		  4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,
		  15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,

		  12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,
		  0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,
		  9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,
		  7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,

		  4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,
		  3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,
		  1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,
		  10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,

		  13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,
		  10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,
		  7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,
		  0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11
		];

		exports.substitute = function substitute(inL, inR) {
		  var out = 0;
		  for (var i = 0; i < 4; i++) {
		    var b = (inL >>> (18 - i * 6)) & 0x3f;
		    var sb = sTable[i * 0x40 + b];

		    out <<= 4;
		    out |= sb;
		  }
		  for (var i = 0; i < 4; i++) {
		    var b = (inR >>> (18 - i * 6)) & 0x3f;
		    var sb = sTable[4 * 0x40 + i * 0x40 + b];

		    out <<= 4;
		    out |= sb;
		  }
		  return out >>> 0;
		};

		var permuteTable = [
		  16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,
		  30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7
		];

		exports.permute = function permute(num) {
		  var out = 0;
		  for (var i = 0; i < permuteTable.length; i++) {
		    out <<= 1;
		    out |= (num >>> permuteTable[i]) & 0x1;
		  }
		  return out >>> 0;
		};

		exports.padSplit = function padSplit(num, size, group) {
		  var str = num.toString(2);
		  while (str.length < size)
		    str = '0' + str;

		  var out = [];
		  for (var i = 0; i < size; i += group)
		    out.push(str.slice(i, i + group));
		  return out.join(' ');
		};


	/***/ },
	/* 598 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global) {module.exports = false;

		// Only Node.JS has a process variable that is of [[Class]] process
		try {
		 module.exports = Object.prototype.toString.call(global.process) === '[object process]' 
		} catch(e) {}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 599 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var generatePrime = __webpack_require__(239)
		var primes = __webpack_require__(295)

		var DH = __webpack_require__(600)

		function getDiffieHellman (mod) {
		  var prime = new Buffer(primes[mod].prime, 'hex')
		  var gen = new Buffer(primes[mod].gen, 'hex')

		  return new DH(prime, gen)
		}

		var ENCODINGS = {
		  'binary': true, 'hex': true, 'base64': true
		}

		function createDiffieHellman (prime, enc, generator, genc) {
		  if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {
		    return createDiffieHellman(prime, 'binary', enc, generator)
		  }

		  enc = enc || 'binary'
		  genc = genc || 'binary'
		  generator = generator || new Buffer([2])

		  if (!Buffer.isBuffer(generator)) {
		    generator = new Buffer(generator, genc)
		  }

		  if (typeof prime === 'number') {
		    return new DH(generatePrime(prime, generator), generator, true)
		  }

		  if (!Buffer.isBuffer(prime)) {
		    prime = new Buffer(prime, enc)
		  }

		  return new DH(prime, generator, true)
		}

		exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman
		exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 600 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var BN = __webpack_require__(19);
		var MillerRabin = __webpack_require__(263);
		var millerRabin = new MillerRabin();
		var TWENTYFOUR = new BN(24);
		var ELEVEN = new BN(11);
		var TEN = new BN(10);
		var THREE = new BN(3);
		var SEVEN = new BN(7);
		var primes = __webpack_require__(239);
		var randomBytes = __webpack_require__(91);
		module.exports = DH;

		function setPublicKey(pub, enc) {
		  enc = enc || 'utf8';
		  if (!Buffer.isBuffer(pub)) {
		    pub = new Buffer(pub, enc);
		  }
		  this._pub = new BN(pub);
		  return this;
		}

		function setPrivateKey(priv, enc) {
		  enc = enc || 'utf8';
		  if (!Buffer.isBuffer(priv)) {
		    priv = new Buffer(priv, enc);
		  }
		  this._priv = new BN(priv);
		  return this;
		}

		var primeCache = {};
		function checkPrime(prime, generator) {
		  var gen = generator.toString('hex');
		  var hex = [gen, prime.toString(16)].join('_');
		  if (hex in primeCache) {
		    return primeCache[hex];
		  }
		  var error = 0;

		  if (prime.isEven() ||
		    !primes.simpleSieve ||
		    !primes.fermatTest(prime) ||
		    !millerRabin.test(prime)) {
		    //not a prime so +1
		    error += 1;

		    if (gen === '02' || gen === '05') {
		      // we'd be able to check the generator
		      // it would fail so +8
		      error += 8;
		    } else {
		      //we wouldn't be able to test the generator
		      // so +4
		      error += 4;
		    }
		    primeCache[hex] = error;
		    return error;
		  }
		  if (!millerRabin.test(prime.shrn(1))) {
		    //not a safe prime
		    error += 2;
		  }
		  var rem;
		  switch (gen) {
		    case '02':
		      if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {
		        // unsuidable generator
		        error += 8;
		      }
		      break;
		    case '05':
		      rem = prime.mod(TEN);
		      if (rem.cmp(THREE) && rem.cmp(SEVEN)) {
		        // prime mod 10 needs to equal 3 or 7
		        error += 8;
		      }
		      break;
		    default:
		      error += 4;
		  }
		  primeCache[hex] = error;
		  return error;
		}

		function DH(prime, generator, malleable) {
		  this.setGenerator(generator);
		  this.__prime = new BN(prime);
		  this._prime = BN.mont(this.__prime);
		  this._primeLen = prime.length;
		  this._pub = undefined;
		  this._priv = undefined;
		  this._primeCode = undefined;
		  if (malleable) {
		    this.setPublicKey = setPublicKey;
		    this.setPrivateKey = setPrivateKey;
		  } else {
		    this._primeCode = 8;
		  }
		}
		Object.defineProperty(DH.prototype, 'verifyError', {
		  enumerable: true,
		  get: function () {
		    if (typeof this._primeCode !== 'number') {
		      this._primeCode = checkPrime(this.__prime, this.__gen);
		    }
		    return this._primeCode;
		  }
		});
		DH.prototype.generateKeys = function () {
		  if (!this._priv) {
		    this._priv = new BN(randomBytes(this._primeLen));
		  }
		  this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();
		  return this.getPublicKey();
		};

		DH.prototype.computeSecret = function (other) {
		  other = new BN(other);
		  other = other.toRed(this._prime);
		  var secret = other.redPow(this._priv).fromRed();
		  var out = new Buffer(secret.toArray());
		  var prime = this.getPrime();
		  if (out.length < prime.length) {
		    var front = new Buffer(prime.length - out.length);
		    front.fill(0);
		    out = Buffer.concat([front, out]);
		  }
		  return out;
		};

		DH.prototype.getPublicKey = function getPublicKey(enc) {
		  return formatReturnValue(this._pub, enc);
		};

		DH.prototype.getPrivateKey = function getPrivateKey(enc) {
		  return formatReturnValue(this._priv, enc);
		};

		DH.prototype.getPrime = function (enc) {
		  return formatReturnValue(this.__prime, enc);
		};

		DH.prototype.getGenerator = function (enc) {
		  return formatReturnValue(this._gen, enc);
		};

		DH.prototype.setGenerator = function (gen, enc) {
		  enc = enc || 'utf8';
		  if (!Buffer.isBuffer(gen)) {
		    gen = new Buffer(gen, enc);
		  }
		  this.__gen = gen;
		  this._gen = new BN(gen);
		  return this;
		};

		function formatReturnValue(bn, enc) {
		  var buf = new Buffer(bn.toArray());
		  if (!enc) {
		    return buf;
		  } else {
		    return buf.toString(enc);
		  }
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 601 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer, process) {var stream = __webpack_require__(604)
		var eos = __webpack_require__(602)
		var inherits = __webpack_require__(2)

		var SIGNAL_FLUSH = new Buffer([0])

		var onuncork = function(self, fn) {
		  if (self._corked) self.once('uncork', fn)
		  else fn()
		}

		var destroyer = function(self, end) {
		  return function(err) {
		    if (err) self.destroy(err.message === 'premature close' ? null : err)
		    else if (end && !self._ended) self.end()
		  }
		}

		var end = function(ws, fn) {
		  if (!ws) return fn()
		  if (ws._writableState && ws._writableState.finished) return fn()
		  if (ws._writableState) return ws.end(fn)
		  ws.end()
		  fn()
		}

		var toStreams2 = function(rs) {
		  return new (stream.Readable)({objectMode:true, highWaterMark:16}).wrap(rs)
		}

		var Duplexify = function(writable, readable, opts) {
		  if (!(this instanceof Duplexify)) return new Duplexify(writable, readable, opts)
		  stream.Duplex.call(this, opts)

		  this._writable = null
		  this._readable = null
		  this._readable2 = null

		  this._forwardDestroy = !opts || opts.destroy !== false
		  this._forwardEnd = !opts || opts.end !== false
		  this._corked = 1 // start corked
		  this._ondrain = null
		  this._drained = false
		  this._forwarding = false
		  this._unwrite = null
		  this._unread = null
		  this._ended = false

		  this.destroyed = false

		  if (writable) this.setWritable(writable)
		  if (readable) this.setReadable(readable)
		}

		inherits(Duplexify, stream.Duplex)

		Duplexify.obj = function(writable, readable, opts) {
		  if (!opts) opts = {}
		  opts.objectMode = true
		  opts.highWaterMark = 16
		  return new Duplexify(writable, readable, opts)
		}

		Duplexify.prototype.cork = function() {
		  if (++this._corked === 1) this.emit('cork')
		}

		Duplexify.prototype.uncork = function() {
		  if (this._corked && --this._corked === 0) this.emit('uncork')
		}

		Duplexify.prototype.setWritable = function(writable) {
		  if (this._unwrite) this._unwrite()

		  if (this.destroyed) {
		    if (writable && writable.destroy) writable.destroy()
		    return
		  }

		  if (writable === null || writable === false) {
		    this.end()
		    return
		  }

		  var self = this
		  var unend = eos(writable, {writable:true, readable:false}, destroyer(this, this._forwardEnd))

		  var ondrain = function() {
		    var ondrain = self._ondrain
		    self._ondrain = null
		    if (ondrain) ondrain()
		  }

		  var clear = function() {
		    self._writable.removeListener('drain', ondrain)
		    unend()
		  }

		  if (this._unwrite) process.nextTick(ondrain) // force a drain on stream reset to avoid livelocks

		  this._writable = writable
		  this._writable.on('drain', ondrain)
		  this._unwrite = clear

		  this.uncork() // always uncork setWritable
		}

		Duplexify.prototype.setReadable = function(readable) {
		  if (this._unread) this._unread()

		  if (this.destroyed) {
		    if (readable && readable.destroy) readable.destroy()
		    return
		  }

		  if (readable === null || readable === false) {
		    this.push(null)
		    this.resume()
		    return
		  }

		  var self = this
		  var unend = eos(readable, {writable:false, readable:true}, destroyer(this))

		  var onreadable = function() {
		    self._forward()
		  }

		  var onend = function() {
		    self.push(null)
		  }

		  var clear = function() {
		    self._readable2.removeListener('readable', onreadable)
		    self._readable2.removeListener('end', onend)
		    unend()
		  }

		  this._drained = true
		  this._readable = readable
		  this._readable2 = readable._readableState ? readable : toStreams2(readable)
		  this._readable2.on('readable', onreadable)
		  this._readable2.on('end', onend)
		  this._unread = clear

		  this._forward()
		}

		Duplexify.prototype._read = function() {
		  this._drained = true
		  this._forward()
		}

		Duplexify.prototype._forward = function() {
		  if (this._forwarding || !this._readable2 || !this._drained) return
		  this._forwarding = true

		  var data
		  var state = this._readable2._readableState

		  while ((data = this._readable2.read(state.buffer.length ? state.buffer[0].length : state.length)) !== null) {
		    this._drained = this.push(data)
		  }

		  this._forwarding = false
		}

		Duplexify.prototype.destroy = function(err) {
		  if (this.destroyed) return
		  this.destroyed = true

		  var self = this
		  process.nextTick(function() {
		    self._destroy(err)
		  })
		}

		Duplexify.prototype._destroy = function(err) {
		  if (err) {
		    var ondrain = this._ondrain
		    this._ondrain = null
		    if (ondrain) ondrain(err)
		    else this.emit('error', err)
		  }

		  if (this._forwardDestroy) {
		    if (this._readable && this._readable.destroy) this._readable.destroy()
		    if (this._writable && this._writable.destroy) this._writable.destroy()
		  }

		  this.emit('close')
		}

		Duplexify.prototype._write = function(data, enc, cb) {
		  if (this.destroyed) return cb()
		  if (this._corked) return onuncork(this, this._write.bind(this, data, enc, cb))
		  if (data === SIGNAL_FLUSH) return this._finish(cb)
		  if (!this._writable) return cb()

		  if (this._writable.write(data) === false) this._ondrain = cb
		  else cb()
		}


		Duplexify.prototype._finish = function(cb) {
		  var self = this
		  this.emit('preend')
		  onuncork(this, function() {
		    end(self._forwardEnd && self._writable, function() {
		      // haxx to not emit prefinish twice
		      if (self._writableState.prefinished === false) self._writableState.prefinished = true
		      self.emit('prefinish')
		      onuncork(self, cb)
		    })
		  })
		}

		Duplexify.prototype.end = function(data, enc, cb) {
		  if (typeof data === 'function') return this.end(null, null, data)
		  if (typeof enc === 'function') return this.end(data, null, enc)
		  this._ended = true
		  if (data) this.write(data)
		  if (!this._writableState.ending) this.write(SIGNAL_FLUSH)
		  return stream.Writable.prototype.end.call(this, cb)
		}

		module.exports = Duplexify

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer, __webpack_require__(3)))

	/***/ },
	/* 602 */
	/***/ function(module, exports, __webpack_require__) {

		var once = __webpack_require__(125);

		var noop = function() {};

		var isRequest = function(stream) {
			return stream.setHeader && typeof stream.abort === 'function';
		};

		var eos = function(stream, opts, callback) {
			if (typeof opts === 'function') return eos(stream, null, opts);
			if (!opts) opts = {};

			callback = once(callback || noop);

			var ws = stream._writableState;
			var rs = stream._readableState;
			var readable = opts.readable || (opts.readable !== false && stream.readable);
			var writable = opts.writable || (opts.writable !== false && stream.writable);

			var onlegacyfinish = function() {
				if (!stream.writable) onfinish();
			};

			var onfinish = function() {
				writable = false;
				if (!readable) callback();
			};

			var onend = function() {
				readable = false;
				if (!writable) callback();
			};

			var onclose = function() {
				if (readable && !(rs && rs.ended)) return callback(new Error('premature close'));
				if (writable && !(ws && ws.ended)) return callback(new Error('premature close'));
			};

			var onrequest = function() {
				stream.req.on('finish', onfinish);
			};

			if (isRequest(stream)) {
				stream.on('complete', onfinish);
				stream.on('abort', onclose);
				if (stream.req) onrequest();
				else stream.on('request', onrequest);
			} else if (writable && !ws) { // legacy streams
				stream.on('end', onlegacyfinish);
				stream.on('close', onlegacyfinish);
			}

			stream.on('end', onend);
			stream.on('finish', onfinish);
			if (opts.error !== false) stream.on('error', callback);
			stream.on('close', onclose);

			return function() {
				stream.removeListener('complete', onfinish);
				stream.removeListener('abort', onclose);
				stream.removeListener('request', onrequest);
				if (stream.req) stream.req.removeListener('finish', onfinish);
				stream.removeListener('end', onlegacyfinish);
				stream.removeListener('close', onlegacyfinish);
				stream.removeListener('finish', onfinish);
				stream.removeListener('end', onend);
				stream.removeListener('error', callback);
				stream.removeListener('close', onclose);
			};
		};

		module.exports = eos;

	/***/ },
	/* 603 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(242);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 604 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(241);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(243);
		exports.Duplex = __webpack_require__(73);
		exports.Transform = __webpack_require__(242);
		exports.PassThrough = __webpack_require__(603);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 605 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var BN = __webpack_require__(19);
		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var getNAF = utils.getNAF;
		var getJSF = utils.getJSF;
		var assert = utils.assert;

		function BaseCurve(type, conf) {
		  this.type = type;
		  this.p = new BN(conf.p, 16);

		  // Use Montgomery, when there is no fast reduction for the prime
		  this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);

		  // Useful for many curves
		  this.zero = new BN(0).toRed(this.red);
		  this.one = new BN(1).toRed(this.red);
		  this.two = new BN(2).toRed(this.red);

		  // Curve configuration, optional
		  this.n = conf.n && new BN(conf.n, 16);
		  this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);

		  // Temporary arrays
		  this._wnafT1 = new Array(4);
		  this._wnafT2 = new Array(4);
		  this._wnafT3 = new Array(4);
		  this._wnafT4 = new Array(4);
		}
		module.exports = BaseCurve;

		BaseCurve.prototype.point = function point() {
		  throw new Error('Not implemented');
		};

		BaseCurve.prototype.validate = function validate() {
		  throw new Error('Not implemented');
		};

		BaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {
		  assert(p.precomputed);
		  var doubles = p._getDoubles();

		  var naf = getNAF(k, 1);
		  var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);
		  I /= 3;

		  // Translate into more windowed form
		  var repr = [];
		  for (var j = 0; j < naf.length; j += doubles.step) {
		    var nafW = 0;
		    for (var k = j + doubles.step - 1; k >= j; k--)
		      nafW = (nafW << 1) + naf[k];
		    repr.push(nafW);
		  }

		  var a = this.jpoint(null, null, null);
		  var b = this.jpoint(null, null, null);
		  for (var i = I; i > 0; i--) {
		    for (var j = 0; j < repr.length; j++) {
		      var nafW = repr[j];
		      if (nafW === i)
		        b = b.mixedAdd(doubles.points[j]);
		      else if (nafW === -i)
		        b = b.mixedAdd(doubles.points[j].neg());
		    }
		    a = a.add(b);
		  }
		  return a.toP();
		};

		BaseCurve.prototype._wnafMul = function _wnafMul(p, k) {
		  var w = 4;

		  // Precompute window
		  var nafPoints = p._getNAFPoints(w);
		  w = nafPoints.wnd;
		  var wnd = nafPoints.points;

		  // Get NAF form
		  var naf = getNAF(k, w);

		  // Add `this`*(N+1) for every w-NAF index
		  var acc = this.jpoint(null, null, null);
		  for (var i = naf.length - 1; i >= 0; i--) {
		    // Count zeroes
		    for (var k = 0; i >= 0 && naf[i] === 0; i--)
		      k++;
		    if (i >= 0)
		      k++;
		    acc = acc.dblp(k);

		    if (i < 0)
		      break;
		    var z = naf[i];
		    assert(z !== 0);
		    if (p.type === 'affine') {
		      // J +- P
		      if (z > 0)
		        acc = acc.mixedAdd(wnd[(z - 1) >> 1]);
		      else
		        acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());
		    } else {
		      // J +- J
		      if (z > 0)
		        acc = acc.add(wnd[(z - 1) >> 1]);
		      else
		        acc = acc.add(wnd[(-z - 1) >> 1].neg());
		    }
		  }
		  return p.type === 'affine' ? acc.toP() : acc;
		};

		BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,
		                                                       points,
		                                                       coeffs,
		                                                       len) {
		  var wndWidth = this._wnafT1;
		  var wnd = this._wnafT2;
		  var naf = this._wnafT3;

		  // Fill all arrays
		  var max = 0;
		  for (var i = 0; i < len; i++) {
		    var p = points[i];
		    var nafPoints = p._getNAFPoints(defW);
		    wndWidth[i] = nafPoints.wnd;
		    wnd[i] = nafPoints.points;
		  }

		  // Comb small window NAFs
		  for (var i = len - 1; i >= 1; i -= 2) {
		    var a = i - 1;
		    var b = i;
		    if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {
		      naf[a] = getNAF(coeffs[a], wndWidth[a]);
		      naf[b] = getNAF(coeffs[b], wndWidth[b]);
		      max = Math.max(naf[a].length, max);
		      max = Math.max(naf[b].length, max);
		      continue;
		    }

		    var comb = [
		      points[a], /* 1 */
		      null, /* 3 */
		      null, /* 5 */
		      points[b] /* 7 */
		    ];

		    // Try to avoid Projective points, if possible
		    if (points[a].y.cmp(points[b].y) === 0) {
		      comb[1] = points[a].add(points[b]);
		      comb[2] = points[a].toJ().mixedAdd(points[b].neg());
		    } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {
		      comb[1] = points[a].toJ().mixedAdd(points[b]);
		      comb[2] = points[a].add(points[b].neg());
		    } else {
		      comb[1] = points[a].toJ().mixedAdd(points[b]);
		      comb[2] = points[a].toJ().mixedAdd(points[b].neg());
		    }

		    var index = [
		      -3, /* -1 -1 */
		      -1, /* -1 0 */
		      -5, /* -1 1 */
		      -7, /* 0 -1 */
		      0, /* 0 0 */
		      7, /* 0 1 */
		      5, /* 1 -1 */
		      1, /* 1 0 */
		      3  /* 1 1 */
		    ];

		    var jsf = getJSF(coeffs[a], coeffs[b]);
		    max = Math.max(jsf[0].length, max);
		    naf[a] = new Array(max);
		    naf[b] = new Array(max);
		    for (var j = 0; j < max; j++) {
		      var ja = jsf[0][j] | 0;
		      var jb = jsf[1][j] | 0;

		      naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];
		      naf[b][j] = 0;
		      wnd[a] = comb;
		    }
		  }

		  var acc = this.jpoint(null, null, null);
		  var tmp = this._wnafT4;
		  for (var i = max; i >= 0; i--) {
		    var k = 0;

		    while (i >= 0) {
		      var zero = true;
		      for (var j = 0; j < len; j++) {
		        tmp[j] = naf[j][i] | 0;
		        if (tmp[j] !== 0)
		          zero = false;
		      }
		      if (!zero)
		        break;
		      k++;
		      i--;
		    }
		    if (i >= 0)
		      k++;
		    acc = acc.dblp(k);
		    if (i < 0)
		      break;

		    for (var j = 0; j < len; j++) {
		      var z = tmp[j];
		      var p;
		      if (z === 0)
		        continue;
		      else if (z > 0)
		        p = wnd[j][(z - 1) >> 1];
		      else if (z < 0)
		        p = wnd[j][(-z - 1) >> 1].neg();

		      if (p.type === 'affine')
		        acc = acc.mixedAdd(p);
		      else
		        acc = acc.add(p);
		    }
		  }
		  // Zeroify references
		  for (var i = 0; i < len; i++)
		    wnd[i] = null;
		  return acc.toP();
		};

		function BasePoint(curve, type) {
		  this.curve = curve;
		  this.type = type;
		  this.precomputed = null;
		}
		BaseCurve.BasePoint = BasePoint;

		BasePoint.prototype.eq = function eq(/*other*/) {
		  throw new Error('Not implemented');
		};

		BasePoint.prototype.validate = function validate() {
		  return this.curve.validate(this);
		};

		BaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {
		  bytes = utils.toArray(bytes, enc);

		  var len = this.p.byteLength();
		  if (bytes[0] === 0x04 && bytes.length - 1 === 2 * len) {
		    return this.point(bytes.slice(1, 1 + len),
		                      bytes.slice(1 + len, 1 + 2 * len));
		  } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&
		              bytes.length - 1 === len) {
		    return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);
		  }
		  throw new Error('Unknown point format');
		};

		BasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {
		  return this.encode(enc, true);
		};

		BasePoint.prototype._encode = function _encode(compact) {
		  var len = this.curve.p.byteLength();
		  var x = this.getX().toArray('be', len);

		  if (compact)
		    return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);

		  return [ 0x04 ].concat(x, this.getY().toArray('be', len)) ;
		};

		BasePoint.prototype.encode = function encode(enc, compact) {
		  return utils.encode(this._encode(compact), enc);
		};

		BasePoint.prototype.precompute = function precompute(power) {
		  if (this.precomputed)
		    return this;

		  var precomputed = {
		    doubles: null,
		    naf: null,
		    beta: null
		  };
		  precomputed.naf = this._getNAFPoints(8);
		  precomputed.doubles = this._getDoubles(4, power);
		  precomputed.beta = this._getBeta();
		  this.precomputed = precomputed;

		  return this;
		};

		BasePoint.prototype._hasDoubles = function _hasDoubles(k) {
		  if (!this.precomputed)
		    return false;

		  var doubles = this.precomputed.doubles;
		  if (!doubles)
		    return false;

		  return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);
		};

		BasePoint.prototype._getDoubles = function _getDoubles(step, power) {
		  if (this.precomputed && this.precomputed.doubles)
		    return this.precomputed.doubles;

		  var doubles = [ this ];
		  var acc = this;
		  for (var i = 0; i < power; i += step) {
		    for (var j = 0; j < step; j++)
		      acc = acc.dbl();
		    doubles.push(acc);
		  }
		  return {
		    step: step,
		    points: doubles
		  };
		};

		BasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {
		  if (this.precomputed && this.precomputed.naf)
		    return this.precomputed.naf;

		  var res = [ this ];
		  var max = (1 << wnd) - 1;
		  var dbl = max === 1 ? null : this.dbl();
		  for (var i = 1; i < max; i++)
		    res[i] = res[i - 1].add(dbl);
		  return {
		    wnd: wnd,
		    points: res
		  };
		};

		BasePoint.prototype._getBeta = function _getBeta() {
		  return null;
		};

		BasePoint.prototype.dblp = function dblp(k) {
		  var r = this;
		  for (var i = 0; i < k; i++)
		    r = r.dbl();
		  return r;
		};


	/***/ },
	/* 606 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var curve = __webpack_require__(115);
		var elliptic = __webpack_require__(26);
		var BN = __webpack_require__(19);
		var inherits = __webpack_require__(2);
		var Base = curve.base;

		var assert = elliptic.utils.assert;

		function EdwardsCurve(conf) {
		  // NOTE: Important as we are creating point in Base.call()
		  this.twisted = (conf.a | 0) !== 1;
		  this.mOneA = this.twisted && (conf.a | 0) === -1;
		  this.extended = this.mOneA;

		  Base.call(this, 'edwards', conf);

		  this.a = new BN(conf.a, 16).umod(this.red.m);
		  this.a = this.a.toRed(this.red);
		  this.c = new BN(conf.c, 16).toRed(this.red);
		  this.c2 = this.c.redSqr();
		  this.d = new BN(conf.d, 16).toRed(this.red);
		  this.dd = this.d.redAdd(this.d);

		  assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);
		  this.oneC = (conf.c | 0) === 1;
		}
		inherits(EdwardsCurve, Base);
		module.exports = EdwardsCurve;

		EdwardsCurve.prototype._mulA = function _mulA(num) {
		  if (this.mOneA)
		    return num.redNeg();
		  else
		    return this.a.redMul(num);
		};

		EdwardsCurve.prototype._mulC = function _mulC(num) {
		  if (this.oneC)
		    return num;
		  else
		    return this.c.redMul(num);
		};

		// Just for compatibility with Short curve
		EdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {
		  return this.point(x, y, z, t);
		};

		EdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {
		  x = new BN(x, 16);
		  if (!x.red)
		    x = x.toRed(this.red);

		  var x2 = x.redSqr();
		  var rhs = this.c2.redSub(this.a.redMul(x2));
		  var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));

		  var y2 = rhs.redMul(lhs.redInvm());
		  var y = y2.redSqrt();
		  if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)
		    throw new Error('invalid point');

		  var isOdd = y.fromRed().isOdd();
		  if (odd && !isOdd || !odd && isOdd)
		    y = y.redNeg();

		  return this.point(x, y);
		};

		EdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {
		  y = new BN(y, 16);
		  if (!y.red)
		    y = y.toRed(this.red);

		  // x^2 = (y^2 - 1) / (d y^2 + 1)
		  var y2 = y.redSqr();
		  var lhs = y2.redSub(this.one);
		  var rhs = y2.redMul(this.d).redAdd(this.one);
		  var x2 = lhs.redMul(rhs.redInvm());

		  if (x2.cmp(this.zero) === 0) {
		    if (odd)
		      throw new Error('invalid point');
		    else
		      return this.point(this.zero, y);
		  }

		  var x = x2.redSqrt();
		  if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)
		    throw new Error('invalid point');

		  if (x.isOdd() !== odd)
		    x = x.redNeg();

		  return this.point(x, y);
		};

		EdwardsCurve.prototype.validate = function validate(point) {
		  if (point.isInfinity())
		    return true;

		  // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)
		  point.normalize();

		  var x2 = point.x.redSqr();
		  var y2 = point.y.redSqr();
		  var lhs = x2.redMul(this.a).redAdd(y2);
		  var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));

		  return lhs.cmp(rhs) === 0;
		};

		function Point(curve, x, y, z, t) {
		  Base.BasePoint.call(this, curve, 'projective');
		  if (x === null && y === null && z === null) {
		    this.x = this.curve.zero;
		    this.y = this.curve.one;
		    this.z = this.curve.one;
		    this.t = this.curve.zero;
		    this.zOne = true;
		  } else {
		    this.x = new BN(x, 16);
		    this.y = new BN(y, 16);
		    this.z = z ? new BN(z, 16) : this.curve.one;
		    this.t = t && new BN(t, 16);
		    if (!this.x.red)
		      this.x = this.x.toRed(this.curve.red);
		    if (!this.y.red)
		      this.y = this.y.toRed(this.curve.red);
		    if (!this.z.red)
		      this.z = this.z.toRed(this.curve.red);
		    if (this.t && !this.t.red)
		      this.t = this.t.toRed(this.curve.red);
		    this.zOne = this.z === this.curve.one;

		    // Use extended coordinates
		    if (this.curve.extended && !this.t) {
		      this.t = this.x.redMul(this.y);
		      if (!this.zOne)
		        this.t = this.t.redMul(this.z.redInvm());
		    }
		  }
		}
		inherits(Point, Base.BasePoint);

		EdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {
		  return Point.fromJSON(this, obj);
		};

		EdwardsCurve.prototype.point = function point(x, y, z, t) {
		  return new Point(this, x, y, z, t);
		};

		Point.fromJSON = function fromJSON(curve, obj) {
		  return new Point(curve, obj[0], obj[1], obj[2]);
		};

		Point.prototype.inspect = function inspect() {
		  if (this.isInfinity())
		    return '<EC Point Infinity>';
		  return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
		      ' y: ' + this.y.fromRed().toString(16, 2) +
		      ' z: ' + this.z.fromRed().toString(16, 2) + '>';
		};

		Point.prototype.isInfinity = function isInfinity() {
		  // XXX This code assumes that zero is always zero in red
		  return this.x.cmpn(0) === 0 &&
		         this.y.cmp(this.z) === 0;
		};

		Point.prototype._extDbl = function _extDbl() {
		  // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html
		  //     #doubling-dbl-2008-hwcd
		  // 4M + 4S

		  // A = X1^2
		  var a = this.x.redSqr();
		  // B = Y1^2
		  var b = this.y.redSqr();
		  // C = 2 * Z1^2
		  var c = this.z.redSqr();
		  c = c.redIAdd(c);
		  // D = a * A
		  var d = this.curve._mulA(a);
		  // E = (X1 + Y1)^2 - A - B
		  var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);
		  // G = D + B
		  var g = d.redAdd(b);
		  // F = G - C
		  var f = g.redSub(c);
		  // H = D - B
		  var h = d.redSub(b);
		  // X3 = E * F
		  var nx = e.redMul(f);
		  // Y3 = G * H
		  var ny = g.redMul(h);
		  // T3 = E * H
		  var nt = e.redMul(h);
		  // Z3 = F * G
		  var nz = f.redMul(g);
		  return this.curve.point(nx, ny, nz, nt);
		};

		Point.prototype._projDbl = function _projDbl() {
		  // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html
		  //     #doubling-dbl-2008-bbjlp
		  //     #doubling-dbl-2007-bl
		  // and others
		  // Generally 3M + 4S or 2M + 4S

		  // B = (X1 + Y1)^2
		  var b = this.x.redAdd(this.y).redSqr();
		  // C = X1^2
		  var c = this.x.redSqr();
		  // D = Y1^2
		  var d = this.y.redSqr();

		  var nx;
		  var ny;
		  var nz;
		  if (this.curve.twisted) {
		    // E = a * C
		    var e = this.curve._mulA(c);
		    // F = E + D
		    var f = e.redAdd(d);
		    if (this.zOne) {
		      // X3 = (B - C - D) * (F - 2)
		      nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));
		      // Y3 = F * (E - D)
		      ny = f.redMul(e.redSub(d));
		      // Z3 = F^2 - 2 * F
		      nz = f.redSqr().redSub(f).redSub(f);
		    } else {
		      // H = Z1^2
		      var h = this.z.redSqr();
		      // J = F - 2 * H
		      var j = f.redSub(h).redISub(h);
		      // X3 = (B-C-D)*J
		      nx = b.redSub(c).redISub(d).redMul(j);
		      // Y3 = F * (E - D)
		      ny = f.redMul(e.redSub(d));
		      // Z3 = F * J
		      nz = f.redMul(j);
		    }
		  } else {
		    // E = C + D
		    var e = c.redAdd(d);
		    // H = (c * Z1)^2
		    var h = this.curve._mulC(this.c.redMul(this.z)).redSqr();
		    // J = E - 2 * H
		    var j = e.redSub(h).redSub(h);
		    // X3 = c * (B - E) * J
		    nx = this.curve._mulC(b.redISub(e)).redMul(j);
		    // Y3 = c * E * (C - D)
		    ny = this.curve._mulC(e).redMul(c.redISub(d));
		    // Z3 = E * J
		    nz = e.redMul(j);
		  }
		  return this.curve.point(nx, ny, nz);
		};

		Point.prototype.dbl = function dbl() {
		  if (this.isInfinity())
		    return this;

		  // Double in extended coordinates
		  if (this.curve.extended)
		    return this._extDbl();
		  else
		    return this._projDbl();
		};

		Point.prototype._extAdd = function _extAdd(p) {
		  // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html
		  //     #addition-add-2008-hwcd-3
		  // 8M

		  // A = (Y1 - X1) * (Y2 - X2)
		  var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));
		  // B = (Y1 + X1) * (Y2 + X2)
		  var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));
		  // C = T1 * k * T2
		  var c = this.t.redMul(this.curve.dd).redMul(p.t);
		  // D = Z1 * 2 * Z2
		  var d = this.z.redMul(p.z.redAdd(p.z));
		  // E = B - A
		  var e = b.redSub(a);
		  // F = D - C
		  var f = d.redSub(c);
		  // G = D + C
		  var g = d.redAdd(c);
		  // H = B + A
		  var h = b.redAdd(a);
		  // X3 = E * F
		  var nx = e.redMul(f);
		  // Y3 = G * H
		  var ny = g.redMul(h);
		  // T3 = E * H
		  var nt = e.redMul(h);
		  // Z3 = F * G
		  var nz = f.redMul(g);
		  return this.curve.point(nx, ny, nz, nt);
		};

		Point.prototype._projAdd = function _projAdd(p) {
		  // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html
		  //     #addition-add-2008-bbjlp
		  //     #addition-add-2007-bl
		  // 10M + 1S

		  // A = Z1 * Z2
		  var a = this.z.redMul(p.z);
		  // B = A^2
		  var b = a.redSqr();
		  // C = X1 * X2
		  var c = this.x.redMul(p.x);
		  // D = Y1 * Y2
		  var d = this.y.redMul(p.y);
		  // E = d * C * D
		  var e = this.curve.d.redMul(c).redMul(d);
		  // F = B - E
		  var f = b.redSub(e);
		  // G = B + E
		  var g = b.redAdd(e);
		  // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)
		  var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);
		  var nx = a.redMul(f).redMul(tmp);
		  var ny;
		  var nz;
		  if (this.curve.twisted) {
		    // Y3 = A * G * (D - a * C)
		    ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));
		    // Z3 = F * G
		    nz = f.redMul(g);
		  } else {
		    // Y3 = A * G * (D - C)
		    ny = a.redMul(g).redMul(d.redSub(c));
		    // Z3 = c * F * G
		    nz = this.curve._mulC(f).redMul(g);
		  }
		  return this.curve.point(nx, ny, nz);
		};

		Point.prototype.add = function add(p) {
		  if (this.isInfinity())
		    return p;
		  if (p.isInfinity())
		    return this;

		  if (this.curve.extended)
		    return this._extAdd(p);
		  else
		    return this._projAdd(p);
		};

		Point.prototype.mul = function mul(k) {
		  if (this._hasDoubles(k))
		    return this.curve._fixedNafMul(this, k);
		  else
		    return this.curve._wnafMul(this, k);
		};

		Point.prototype.mulAdd = function mulAdd(k1, p, k2) {
		  return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2);
		};

		Point.prototype.normalize = function normalize() {
		  if (this.zOne)
		    return this;

		  // Normalize coordinates
		  var zi = this.z.redInvm();
		  this.x = this.x.redMul(zi);
		  this.y = this.y.redMul(zi);
		  if (this.t)
		    this.t = this.t.redMul(zi);
		  this.z = this.curve.one;
		  this.zOne = true;
		  return this;
		};

		Point.prototype.neg = function neg() {
		  return this.curve.point(this.x.redNeg(),
		                          this.y,
		                          this.z,
		                          this.t && this.t.redNeg());
		};

		Point.prototype.getX = function getX() {
		  this.normalize();
		  return this.x.fromRed();
		};

		Point.prototype.getY = function getY() {
		  this.normalize();
		  return this.y.fromRed();
		};

		Point.prototype.eq = function eq(other) {
		  return this === other ||
		         this.getX().cmp(other.getX()) === 0 &&
		         this.getY().cmp(other.getY()) === 0;
		};

		// Compatibility with BaseCurve
		Point.prototype.toP = Point.prototype.normalize;
		Point.prototype.mixedAdd = Point.prototype.add;


	/***/ },
	/* 607 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var curve = __webpack_require__(115);
		var BN = __webpack_require__(19);
		var inherits = __webpack_require__(2);
		var Base = curve.base;

		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;

		function MontCurve(conf) {
		  Base.call(this, 'mont', conf);

		  this.a = new BN(conf.a, 16).toRed(this.red);
		  this.b = new BN(conf.b, 16).toRed(this.red);
		  this.i4 = new BN(4).toRed(this.red).redInvm();
		  this.two = new BN(2).toRed(this.red);
		  this.a24 = this.i4.redMul(this.a.redAdd(this.two));
		}
		inherits(MontCurve, Base);
		module.exports = MontCurve;

		MontCurve.prototype.validate = function validate(point) {
		  var x = point.normalize().x;
		  var x2 = x.redSqr();
		  var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);
		  var y = rhs.redSqrt();

		  return y.redSqr().cmp(rhs) === 0;
		};

		function Point(curve, x, z) {
		  Base.BasePoint.call(this, curve, 'projective');
		  if (x === null && z === null) {
		    this.x = this.curve.one;
		    this.z = this.curve.zero;
		  } else {
		    this.x = new BN(x, 16);
		    this.z = new BN(z, 16);
		    if (!this.x.red)
		      this.x = this.x.toRed(this.curve.red);
		    if (!this.z.red)
		      this.z = this.z.toRed(this.curve.red);
		  }
		}
		inherits(Point, Base.BasePoint);

		MontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {
		  return this.point(utils.toArray(bytes, enc), 1);
		};

		MontCurve.prototype.point = function point(x, z) {
		  return new Point(this, x, z);
		};

		MontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {
		  return Point.fromJSON(this, obj);
		};

		Point.prototype.precompute = function precompute() {
		  // No-op
		};

		Point.prototype._encode = function _encode() {
		  return this.getX().toArray('be', this.curve.p.byteLength());
		};

		Point.fromJSON = function fromJSON(curve, obj) {
		  return new Point(curve, obj[0], obj[1] || curve.one);
		};

		Point.prototype.inspect = function inspect() {
		  if (this.isInfinity())
		    return '<EC Point Infinity>';
		  return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
		      ' z: ' + this.z.fromRed().toString(16, 2) + '>';
		};

		Point.prototype.isInfinity = function isInfinity() {
		  // XXX This code assumes that zero is always zero in red
		  return this.z.cmpn(0) === 0;
		};

		Point.prototype.dbl = function dbl() {
		  // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3
		  // 2M + 2S + 4A

		  // A = X1 + Z1
		  var a = this.x.redAdd(this.z);
		  // AA = A^2
		  var aa = a.redSqr();
		  // B = X1 - Z1
		  var b = this.x.redSub(this.z);
		  // BB = B^2
		  var bb = b.redSqr();
		  // C = AA - BB
		  var c = aa.redSub(bb);
		  // X3 = AA * BB
		  var nx = aa.redMul(bb);
		  // Z3 = C * (BB + A24 * C)
		  var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));
		  return this.curve.point(nx, nz);
		};

		Point.prototype.add = function add() {
		  throw new Error('Not supported on Montgomery curve');
		};

		Point.prototype.diffAdd = function diffAdd(p, diff) {
		  // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3
		  // 4M + 2S + 6A

		  // A = X2 + Z2
		  var a = this.x.redAdd(this.z);
		  // B = X2 - Z2
		  var b = this.x.redSub(this.z);
		  // C = X3 + Z3
		  var c = p.x.redAdd(p.z);
		  // D = X3 - Z3
		  var d = p.x.redSub(p.z);
		  // DA = D * A
		  var da = d.redMul(a);
		  // CB = C * B
		  var cb = c.redMul(b);
		  // X5 = Z1 * (DA + CB)^2
		  var nx = diff.z.redMul(da.redAdd(cb).redSqr());
		  // Z5 = X1 * (DA - CB)^2
		  var nz = diff.x.redMul(da.redISub(cb).redSqr());
		  return this.curve.point(nx, nz);
		};

		Point.prototype.mul = function mul(k) {
		  var t = k.clone();
		  var a = this; // (N / 2) * Q + Q
		  var b = this.curve.point(null, null); // (N / 2) * Q
		  var c = this; // Q

		  for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))
		    bits.push(t.andln(1));

		  for (var i = bits.length - 1; i >= 0; i--) {
		    if (bits[i] === 0) {
		      // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q
		      a = a.diffAdd(b, c);
		      // N * Q = 2 * ((N / 2) * Q + Q))
		      b = b.dbl();
		    } else {
		      // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)
		      b = a.diffAdd(b, c);
		      // N * Q + Q = 2 * ((N / 2) * Q + Q)
		      a = a.dbl();
		    }
		  }
		  return b;
		};

		Point.prototype.mulAdd = function mulAdd() {
		  throw new Error('Not supported on Montgomery curve');
		};

		Point.prototype.eq = function eq(other) {
		  return this.getX().cmp(other.getX()) === 0;
		};

		Point.prototype.normalize = function normalize() {
		  this.x = this.x.redMul(this.z.redInvm());
		  this.z = this.curve.one;
		  return this;
		};

		Point.prototype.getX = function getX() {
		  // Normalize coordinates
		  this.normalize();

		  return this.x.fromRed();
		};


	/***/ },
	/* 608 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var curve = __webpack_require__(115);
		var elliptic = __webpack_require__(26);
		var BN = __webpack_require__(19);
		var inherits = __webpack_require__(2);
		var Base = curve.base;

		var assert = elliptic.utils.assert;

		function ShortCurve(conf) {
		  Base.call(this, 'short', conf);

		  this.a = new BN(conf.a, 16).toRed(this.red);
		  this.b = new BN(conf.b, 16).toRed(this.red);
		  this.tinv = this.two.redInvm();

		  this.zeroA = this.a.fromRed().cmpn(0) === 0;
		  this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;

		  // If the curve is endomorphic, precalculate beta and lambda
		  this.endo = this._getEndomorphism(conf);
		  this._endoWnafT1 = new Array(4);
		  this._endoWnafT2 = new Array(4);
		}
		inherits(ShortCurve, Base);
		module.exports = ShortCurve;

		ShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {
		  // No efficient endomorphism
		  if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)
		    return;

		  // Compute beta and lambda, that lambda * P = (beta * Px; Py)
		  var beta;
		  var lambda;
		  if (conf.beta) {
		    beta = new BN(conf.beta, 16).toRed(this.red);
		  } else {
		    var betas = this._getEndoRoots(this.p);
		    // Choose the smallest beta
		    beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];
		    beta = beta.toRed(this.red);
		  }
		  if (conf.lambda) {
		    lambda = new BN(conf.lambda, 16);
		  } else {
		    // Choose the lambda that is matching selected beta
		    var lambdas = this._getEndoRoots(this.n);
		    if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {
		      lambda = lambdas[0];
		    } else {
		      lambda = lambdas[1];
		      assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);
		    }
		  }

		  // Get basis vectors, used for balanced length-two representation
		  var basis;
		  if (conf.basis) {
		    basis = conf.basis.map(function(vec) {
		      return {
		        a: new BN(vec.a, 16),
		        b: new BN(vec.b, 16)
		      };
		    });
		  } else {
		    basis = this._getEndoBasis(lambda);
		  }

		  return {
		    beta: beta,
		    lambda: lambda,
		    basis: basis
		  };
		};

		ShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {
		  // Find roots of for x^2 + x + 1 in F
		  // Root = (-1 +- Sqrt(-3)) / 2
		  //
		  var red = num === this.p ? this.red : BN.mont(num);
		  var tinv = new BN(2).toRed(red).redInvm();
		  var ntinv = tinv.redNeg();

		  var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);

		  var l1 = ntinv.redAdd(s).fromRed();
		  var l2 = ntinv.redSub(s).fromRed();
		  return [ l1, l2 ];
		};

		ShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {
		  // aprxSqrt >= sqrt(this.n)
		  var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));

		  // 3.74
		  // Run EGCD, until r(L + 1) < aprxSqrt
		  var u = lambda;
		  var v = this.n.clone();
		  var x1 = new BN(1);
		  var y1 = new BN(0);
		  var x2 = new BN(0);
		  var y2 = new BN(1);

		  // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)
		  var a0;
		  var b0;
		  // First vector
		  var a1;
		  var b1;
		  // Second vector
		  var a2;
		  var b2;

		  var prevR;
		  var i = 0;
		  var r;
		  var x;
		  while (u.cmpn(0) !== 0) {
		    var q = v.div(u);
		    r = v.sub(q.mul(u));
		    x = x2.sub(q.mul(x1));
		    var y = y2.sub(q.mul(y1));

		    if (!a1 && r.cmp(aprxSqrt) < 0) {
		      a0 = prevR.neg();
		      b0 = x1;
		      a1 = r.neg();
		      b1 = x;
		    } else if (a1 && ++i === 2) {
		      break;
		    }
		    prevR = r;

		    v = u;
		    u = r;
		    x2 = x1;
		    x1 = x;
		    y2 = y1;
		    y1 = y;
		  }
		  a2 = r.neg();
		  b2 = x;

		  var len1 = a1.sqr().add(b1.sqr());
		  var len2 = a2.sqr().add(b2.sqr());
		  if (len2.cmp(len1) >= 0) {
		    a2 = a0;
		    b2 = b0;
		  }

		  // Normalize signs
		  if (a1.negative) {
		    a1 = a1.neg();
		    b1 = b1.neg();
		  }
		  if (a2.negative) {
		    a2 = a2.neg();
		    b2 = b2.neg();
		  }

		  return [
		    { a: a1, b: b1 },
		    { a: a2, b: b2 }
		  ];
		};

		ShortCurve.prototype._endoSplit = function _endoSplit(k) {
		  var basis = this.endo.basis;
		  var v1 = basis[0];
		  var v2 = basis[1];

		  var c1 = v2.b.mul(k).divRound(this.n);
		  var c2 = v1.b.neg().mul(k).divRound(this.n);

		  var p1 = c1.mul(v1.a);
		  var p2 = c2.mul(v2.a);
		  var q1 = c1.mul(v1.b);
		  var q2 = c2.mul(v2.b);

		  // Calculate answer
		  var k1 = k.sub(p1).sub(p2);
		  var k2 = q1.add(q2).neg();
		  return { k1: k1, k2: k2 };
		};

		ShortCurve.prototype.pointFromX = function pointFromX(x, odd) {
		  x = new BN(x, 16);
		  if (!x.red)
		    x = x.toRed(this.red);

		  var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);
		  var y = y2.redSqrt();
		  if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)
		    throw new Error('invalid point');

		  // XXX Is there any way to tell if the number is odd without converting it
		  // to non-red form?
		  var isOdd = y.fromRed().isOdd();
		  if (odd && !isOdd || !odd && isOdd)
		    y = y.redNeg();

		  return this.point(x, y);
		};

		ShortCurve.prototype.validate = function validate(point) {
		  if (point.inf)
		    return true;

		  var x = point.x;
		  var y = point.y;

		  var ax = this.a.redMul(x);
		  var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);
		  return y.redSqr().redISub(rhs).cmpn(0) === 0;
		};

		ShortCurve.prototype._endoWnafMulAdd =
		    function _endoWnafMulAdd(points, coeffs) {
		  var npoints = this._endoWnafT1;
		  var ncoeffs = this._endoWnafT2;
		  for (var i = 0; i < points.length; i++) {
		    var split = this._endoSplit(coeffs[i]);
		    var p = points[i];
		    var beta = p._getBeta();

		    if (split.k1.negative) {
		      split.k1.ineg();
		      p = p.neg(true);
		    }
		    if (split.k2.negative) {
		      split.k2.ineg();
		      beta = beta.neg(true);
		    }

		    npoints[i * 2] = p;
		    npoints[i * 2 + 1] = beta;
		    ncoeffs[i * 2] = split.k1;
		    ncoeffs[i * 2 + 1] = split.k2;
		  }
		  var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2);

		  // Clean-up references to points and coefficients
		  for (var j = 0; j < i * 2; j++) {
		    npoints[j] = null;
		    ncoeffs[j] = null;
		  }
		  return res;
		};

		function Point(curve, x, y, isRed) {
		  Base.BasePoint.call(this, curve, 'affine');
		  if (x === null && y === null) {
		    this.x = null;
		    this.y = null;
		    this.inf = true;
		  } else {
		    this.x = new BN(x, 16);
		    this.y = new BN(y, 16);
		    // Force redgomery representation when loading from JSON
		    if (isRed) {
		      this.x.forceRed(this.curve.red);
		      this.y.forceRed(this.curve.red);
		    }
		    if (!this.x.red)
		      this.x = this.x.toRed(this.curve.red);
		    if (!this.y.red)
		      this.y = this.y.toRed(this.curve.red);
		    this.inf = false;
		  }
		}
		inherits(Point, Base.BasePoint);

		ShortCurve.prototype.point = function point(x, y, isRed) {
		  return new Point(this, x, y, isRed);
		};

		ShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {
		  return Point.fromJSON(this, obj, red);
		};

		Point.prototype._getBeta = function _getBeta() {
		  if (!this.curve.endo)
		    return;

		  var pre = this.precomputed;
		  if (pre && pre.beta)
		    return pre.beta;

		  var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);
		  if (pre) {
		    var curve = this.curve;
		    var endoMul = function(p) {
		      return curve.point(p.x.redMul(curve.endo.beta), p.y);
		    };
		    pre.beta = beta;
		    beta.precomputed = {
		      beta: null,
		      naf: pre.naf && {
		        wnd: pre.naf.wnd,
		        points: pre.naf.points.map(endoMul)
		      },
		      doubles: pre.doubles && {
		        step: pre.doubles.step,
		        points: pre.doubles.points.map(endoMul)
		      }
		    };
		  }
		  return beta;
		};

		Point.prototype.toJSON = function toJSON() {
		  if (!this.precomputed)
		    return [ this.x, this.y ];

		  return [ this.x, this.y, this.precomputed && {
		    doubles: this.precomputed.doubles && {
		      step: this.precomputed.doubles.step,
		      points: this.precomputed.doubles.points.slice(1)
		    },
		    naf: this.precomputed.naf && {
		      wnd: this.precomputed.naf.wnd,
		      points: this.precomputed.naf.points.slice(1)
		    }
		  } ];
		};

		Point.fromJSON = function fromJSON(curve, obj, red) {
		  if (typeof obj === 'string')
		    obj = JSON.parse(obj);
		  var res = curve.point(obj[0], obj[1], red);
		  if (!obj[2])
		    return res;

		  function obj2point(obj) {
		    return curve.point(obj[0], obj[1], red);
		  }

		  var pre = obj[2];
		  res.precomputed = {
		    beta: null,
		    doubles: pre.doubles && {
		      step: pre.doubles.step,
		      points: [ res ].concat(pre.doubles.points.map(obj2point))
		    },
		    naf: pre.naf && {
		      wnd: pre.naf.wnd,
		      points: [ res ].concat(pre.naf.points.map(obj2point))
		    }
		  };
		  return res;
		};

		Point.prototype.inspect = function inspect() {
		  if (this.isInfinity())
		    return '<EC Point Infinity>';
		  return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
		      ' y: ' + this.y.fromRed().toString(16, 2) + '>';
		};

		Point.prototype.isInfinity = function isInfinity() {
		  return this.inf;
		};

		Point.prototype.add = function add(p) {
		  // O + P = P
		  if (this.inf)
		    return p;

		  // P + O = P
		  if (p.inf)
		    return this;

		  // P + P = 2P
		  if (this.eq(p))
		    return this.dbl();

		  // P + (-P) = O
		  if (this.neg().eq(p))
		    return this.curve.point(null, null);

		  // P + Q = O
		  if (this.x.cmp(p.x) === 0)
		    return this.curve.point(null, null);

		  var c = this.y.redSub(p.y);
		  if (c.cmpn(0) !== 0)
		    c = c.redMul(this.x.redSub(p.x).redInvm());
		  var nx = c.redSqr().redISub(this.x).redISub(p.x);
		  var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);
		  return this.curve.point(nx, ny);
		};

		Point.prototype.dbl = function dbl() {
		  if (this.inf)
		    return this;

		  // 2P = O
		  var ys1 = this.y.redAdd(this.y);
		  if (ys1.cmpn(0) === 0)
		    return this.curve.point(null, null);

		  var a = this.curve.a;

		  var x2 = this.x.redSqr();
		  var dyinv = ys1.redInvm();
		  var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);

		  var nx = c.redSqr().redISub(this.x.redAdd(this.x));
		  var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);
		  return this.curve.point(nx, ny);
		};

		Point.prototype.getX = function getX() {
		  return this.x.fromRed();
		};

		Point.prototype.getY = function getY() {
		  return this.y.fromRed();
		};

		Point.prototype.mul = function mul(k) {
		  k = new BN(k, 16);

		  if (this._hasDoubles(k))
		    return this.curve._fixedNafMul(this, k);
		  else if (this.curve.endo)
		    return this.curve._endoWnafMulAdd([ this ], [ k ]);
		  else
		    return this.curve._wnafMul(this, k);
		};

		Point.prototype.mulAdd = function mulAdd(k1, p2, k2) {
		  var points = [ this, p2 ];
		  var coeffs = [ k1, k2 ];
		  if (this.curve.endo)
		    return this.curve._endoWnafMulAdd(points, coeffs);
		  else
		    return this.curve._wnafMulAdd(1, points, coeffs, 2);
		};

		Point.prototype.eq = function eq(p) {
		  return this === p ||
		         this.inf === p.inf &&
		             (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);
		};

		Point.prototype.neg = function neg(_precompute) {
		  if (this.inf)
		    return this;

		  var res = this.curve.point(this.x, this.y.redNeg());
		  if (_precompute && this.precomputed) {
		    var pre = this.precomputed;
		    var negate = function(p) {
		      return p.neg();
		    };
		    res.precomputed = {
		      naf: pre.naf && {
		        wnd: pre.naf.wnd,
		        points: pre.naf.points.map(negate)
		      },
		      doubles: pre.doubles && {
		        step: pre.doubles.step,
		        points: pre.doubles.points.map(negate)
		      }
		    };
		  }
		  return res;
		};

		Point.prototype.toJ = function toJ() {
		  if (this.inf)
		    return this.curve.jpoint(null, null, null);

		  var res = this.curve.jpoint(this.x, this.y, this.curve.one);
		  return res;
		};

		function JPoint(curve, x, y, z) {
		  Base.BasePoint.call(this, curve, 'jacobian');
		  if (x === null && y === null && z === null) {
		    this.x = this.curve.one;
		    this.y = this.curve.one;
		    this.z = new BN(0);
		  } else {
		    this.x = new BN(x, 16);
		    this.y = new BN(y, 16);
		    this.z = new BN(z, 16);
		  }
		  if (!this.x.red)
		    this.x = this.x.toRed(this.curve.red);
		  if (!this.y.red)
		    this.y = this.y.toRed(this.curve.red);
		  if (!this.z.red)
		    this.z = this.z.toRed(this.curve.red);

		  this.zOne = this.z === this.curve.one;
		}
		inherits(JPoint, Base.BasePoint);

		ShortCurve.prototype.jpoint = function jpoint(x, y, z) {
		  return new JPoint(this, x, y, z);
		};

		JPoint.prototype.toP = function toP() {
		  if (this.isInfinity())
		    return this.curve.point(null, null);

		  var zinv = this.z.redInvm();
		  var zinv2 = zinv.redSqr();
		  var ax = this.x.redMul(zinv2);
		  var ay = this.y.redMul(zinv2).redMul(zinv);

		  return this.curve.point(ax, ay);
		};

		JPoint.prototype.neg = function neg() {
		  return this.curve.jpoint(this.x, this.y.redNeg(), this.z);
		};

		JPoint.prototype.add = function add(p) {
		  // O + P = P
		  if (this.isInfinity())
		    return p;

		  // P + O = P
		  if (p.isInfinity())
		    return this;

		  // 12M + 4S + 7A
		  var pz2 = p.z.redSqr();
		  var z2 = this.z.redSqr();
		  var u1 = this.x.redMul(pz2);
		  var u2 = p.x.redMul(z2);
		  var s1 = this.y.redMul(pz2.redMul(p.z));
		  var s2 = p.y.redMul(z2.redMul(this.z));

		  var h = u1.redSub(u2);
		  var r = s1.redSub(s2);
		  if (h.cmpn(0) === 0) {
		    if (r.cmpn(0) !== 0)
		      return this.curve.jpoint(null, null, null);
		    else
		      return this.dbl();
		  }

		  var h2 = h.redSqr();
		  var h3 = h2.redMul(h);
		  var v = u1.redMul(h2);

		  var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
		  var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
		  var nz = this.z.redMul(p.z).redMul(h);

		  return this.curve.jpoint(nx, ny, nz);
		};

		JPoint.prototype.mixedAdd = function mixedAdd(p) {
		  // O + P = P
		  if (this.isInfinity())
		    return p.toJ();

		  // P + O = P
		  if (p.isInfinity())
		    return this;

		  // 8M + 3S + 7A
		  var z2 = this.z.redSqr();
		  var u1 = this.x;
		  var u2 = p.x.redMul(z2);
		  var s1 = this.y;
		  var s2 = p.y.redMul(z2).redMul(this.z);

		  var h = u1.redSub(u2);
		  var r = s1.redSub(s2);
		  if (h.cmpn(0) === 0) {
		    if (r.cmpn(0) !== 0)
		      return this.curve.jpoint(null, null, null);
		    else
		      return this.dbl();
		  }

		  var h2 = h.redSqr();
		  var h3 = h2.redMul(h);
		  var v = u1.redMul(h2);

		  var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
		  var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
		  var nz = this.z.redMul(h);

		  return this.curve.jpoint(nx, ny, nz);
		};

		JPoint.prototype.dblp = function dblp(pow) {
		  if (pow === 0)
		    return this;
		  if (this.isInfinity())
		    return this;
		  if (!pow)
		    return this.dbl();

		  if (this.curve.zeroA || this.curve.threeA) {
		    var r = this;
		    for (var i = 0; i < pow; i++)
		      r = r.dbl();
		    return r;
		  }

		  // 1M + 2S + 1A + N * (4S + 5M + 8A)
		  // N = 1 => 6M + 6S + 9A
		  var a = this.curve.a;
		  var tinv = this.curve.tinv;

		  var jx = this.x;
		  var jy = this.y;
		  var jz = this.z;
		  var jz4 = jz.redSqr().redSqr();

		  // Reuse results
		  var jyd = jy.redAdd(jy);
		  for (var i = 0; i < pow; i++) {
		    var jx2 = jx.redSqr();
		    var jyd2 = jyd.redSqr();
		    var jyd4 = jyd2.redSqr();
		    var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));

		    var t1 = jx.redMul(jyd2);
		    var nx = c.redSqr().redISub(t1.redAdd(t1));
		    var t2 = t1.redISub(nx);
		    var dny = c.redMul(t2);
		    dny = dny.redIAdd(dny).redISub(jyd4);
		    var nz = jyd.redMul(jz);
		    if (i + 1 < pow)
		      jz4 = jz4.redMul(jyd4);

		    jx = nx;
		    jz = nz;
		    jyd = dny;
		  }

		  return this.curve.jpoint(jx, jyd.redMul(tinv), jz);
		};

		JPoint.prototype.dbl = function dbl() {
		  if (this.isInfinity())
		    return this;

		  if (this.curve.zeroA)
		    return this._zeroDbl();
		  else if (this.curve.threeA)
		    return this._threeDbl();
		  else
		    return this._dbl();
		};

		JPoint.prototype._zeroDbl = function _zeroDbl() {
		  var nx;
		  var ny;
		  var nz;
		  // Z = 1
		  if (this.zOne) {
		    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html
		    //     #doubling-mdbl-2007-bl
		    // 1M + 5S + 14A

		    // XX = X1^2
		    var xx = this.x.redSqr();
		    // YY = Y1^2
		    var yy = this.y.redSqr();
		    // YYYY = YY^2
		    var yyyy = yy.redSqr();
		    // S = 2 * ((X1 + YY)^2 - XX - YYYY)
		    var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
		    s = s.redIAdd(s);
		    // M = 3 * XX + a; a = 0
		    var m = xx.redAdd(xx).redIAdd(xx);
		    // T = M ^ 2 - 2*S
		    var t = m.redSqr().redISub(s).redISub(s);

		    // 8 * YYYY
		    var yyyy8 = yyyy.redIAdd(yyyy);
		    yyyy8 = yyyy8.redIAdd(yyyy8);
		    yyyy8 = yyyy8.redIAdd(yyyy8);

		    // X3 = T
		    nx = t;
		    // Y3 = M * (S - T) - 8 * YYYY
		    ny = m.redMul(s.redISub(t)).redISub(yyyy8);
		    // Z3 = 2*Y1
		    nz = this.y.redAdd(this.y);
		  } else {
		    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html
		    //     #doubling-dbl-2009-l
		    // 2M + 5S + 13A

		    // A = X1^2
		    var a = this.x.redSqr();
		    // B = Y1^2
		    var b = this.y.redSqr();
		    // C = B^2
		    var c = b.redSqr();
		    // D = 2 * ((X1 + B)^2 - A - C)
		    var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);
		    d = d.redIAdd(d);
		    // E = 3 * A
		    var e = a.redAdd(a).redIAdd(a);
		    // F = E^2
		    var f = e.redSqr();

		    // 8 * C
		    var c8 = c.redIAdd(c);
		    c8 = c8.redIAdd(c8);
		    c8 = c8.redIAdd(c8);

		    // X3 = F - 2 * D
		    nx = f.redISub(d).redISub(d);
		    // Y3 = E * (D - X3) - 8 * C
		    ny = e.redMul(d.redISub(nx)).redISub(c8);
		    // Z3 = 2 * Y1 * Z1
		    nz = this.y.redMul(this.z);
		    nz = nz.redIAdd(nz);
		  }

		  return this.curve.jpoint(nx, ny, nz);
		};

		JPoint.prototype._threeDbl = function _threeDbl() {
		  var nx;
		  var ny;
		  var nz;
		  // Z = 1
		  if (this.zOne) {
		    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html
		    //     #doubling-mdbl-2007-bl
		    // 1M + 5S + 15A

		    // XX = X1^2
		    var xx = this.x.redSqr();
		    // YY = Y1^2
		    var yy = this.y.redSqr();
		    // YYYY = YY^2
		    var yyyy = yy.redSqr();
		    // S = 2 * ((X1 + YY)^2 - XX - YYYY)
		    var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
		    s = s.redIAdd(s);
		    // M = 3 * XX + a
		    var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);
		    // T = M^2 - 2 * S
		    var t = m.redSqr().redISub(s).redISub(s);
		    // X3 = T
		    nx = t;
		    // Y3 = M * (S - T) - 8 * YYYY
		    var yyyy8 = yyyy.redIAdd(yyyy);
		    yyyy8 = yyyy8.redIAdd(yyyy8);
		    yyyy8 = yyyy8.redIAdd(yyyy8);
		    ny = m.redMul(s.redISub(t)).redISub(yyyy8);
		    // Z3 = 2 * Y1
		    nz = this.y.redAdd(this.y);
		  } else {
		    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b
		    // 3M + 5S

		    // delta = Z1^2
		    var delta = this.z.redSqr();
		    // gamma = Y1^2
		    var gamma = this.y.redSqr();
		    // beta = X1 * gamma
		    var beta = this.x.redMul(gamma);
		    // alpha = 3 * (X1 - delta) * (X1 + delta)
		    var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));
		    alpha = alpha.redAdd(alpha).redIAdd(alpha);
		    // X3 = alpha^2 - 8 * beta
		    var beta4 = beta.redIAdd(beta);
		    beta4 = beta4.redIAdd(beta4);
		    var beta8 = beta4.redAdd(beta4);
		    nx = alpha.redSqr().redISub(beta8);
		    // Z3 = (Y1 + Z1)^2 - gamma - delta
		    nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);
		    // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2
		    var ggamma8 = gamma.redSqr();
		    ggamma8 = ggamma8.redIAdd(ggamma8);
		    ggamma8 = ggamma8.redIAdd(ggamma8);
		    ggamma8 = ggamma8.redIAdd(ggamma8);
		    ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);
		  }

		  return this.curve.jpoint(nx, ny, nz);
		};

		JPoint.prototype._dbl = function _dbl() {
		  var a = this.curve.a;

		  // 4M + 6S + 10A
		  var jx = this.x;
		  var jy = this.y;
		  var jz = this.z;
		  var jz4 = jz.redSqr().redSqr();

		  var jx2 = jx.redSqr();
		  var jy2 = jy.redSqr();

		  var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));

		  var jxd4 = jx.redAdd(jx);
		  jxd4 = jxd4.redIAdd(jxd4);
		  var t1 = jxd4.redMul(jy2);
		  var nx = c.redSqr().redISub(t1.redAdd(t1));
		  var t2 = t1.redISub(nx);

		  var jyd8 = jy2.redSqr();
		  jyd8 = jyd8.redIAdd(jyd8);
		  jyd8 = jyd8.redIAdd(jyd8);
		  jyd8 = jyd8.redIAdd(jyd8);
		  var ny = c.redMul(t2).redISub(jyd8);
		  var nz = jy.redAdd(jy).redMul(jz);

		  return this.curve.jpoint(nx, ny, nz);
		};

		JPoint.prototype.trpl = function trpl() {
		  if (!this.curve.zeroA)
		    return this.dbl().add(this);

		  // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl
		  // 5M + 10S + ...

		  // XX = X1^2
		  var xx = this.x.redSqr();
		  // YY = Y1^2
		  var yy = this.y.redSqr();
		  // ZZ = Z1^2
		  var zz = this.z.redSqr();
		  // YYYY = YY^2
		  var yyyy = yy.redSqr();
		  // M = 3 * XX + a * ZZ2; a = 0
		  var m = xx.redAdd(xx).redIAdd(xx);
		  // MM = M^2
		  var mm = m.redSqr();
		  // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM
		  var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
		  e = e.redIAdd(e);
		  e = e.redAdd(e).redIAdd(e);
		  e = e.redISub(mm);
		  // EE = E^2
		  var ee = e.redSqr();
		  // T = 16*YYYY
		  var t = yyyy.redIAdd(yyyy);
		  t = t.redIAdd(t);
		  t = t.redIAdd(t);
		  t = t.redIAdd(t);
		  // U = (M + E)^2 - MM - EE - T
		  var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);
		  // X3 = 4 * (X1 * EE - 4 * YY * U)
		  var yyu4 = yy.redMul(u);
		  yyu4 = yyu4.redIAdd(yyu4);
		  yyu4 = yyu4.redIAdd(yyu4);
		  var nx = this.x.redMul(ee).redISub(yyu4);
		  nx = nx.redIAdd(nx);
		  nx = nx.redIAdd(nx);
		  // Y3 = 8 * Y1 * (U * (T - U) - E * EE)
		  var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));
		  ny = ny.redIAdd(ny);
		  ny = ny.redIAdd(ny);
		  ny = ny.redIAdd(ny);
		  // Z3 = (Z1 + E)^2 - ZZ - EE
		  var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);

		  return this.curve.jpoint(nx, ny, nz);
		};

		JPoint.prototype.mul = function mul(k, kbase) {
		  k = new BN(k, kbase);

		  return this.curve._wnafMul(this, k);
		};

		JPoint.prototype.eq = function eq(p) {
		  if (p.type === 'affine')
		    return this.eq(p.toJ());

		  if (this === p)
		    return true;

		  // x1 * z2^2 == x2 * z1^2
		  var z2 = this.z.redSqr();
		  var pz2 = p.z.redSqr();
		  if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)
		    return false;

		  // y1 * z2^3 == y2 * z1^3
		  var z3 = z2.redMul(this.z);
		  var pz3 = pz2.redMul(p.z);
		  return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;
		};

		JPoint.prototype.inspect = function inspect() {
		  if (this.isInfinity())
		    return '<EC JPoint Infinity>';
		  return '<EC JPoint x: ' + this.x.toString(16, 2) +
		      ' y: ' + this.y.toString(16, 2) +
		      ' z: ' + this.z.toString(16, 2) + '>';
		};

		JPoint.prototype.isInfinity = function isInfinity() {
		  // XXX This code assumes that zero is always zero in red
		  return this.z.cmpn(0) === 0;
		};


	/***/ },
	/* 609 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var curves = exports;

		var hash = __webpack_require__(62);
		var elliptic = __webpack_require__(26);

		var assert = elliptic.utils.assert;

		function PresetCurve(options) {
		  if (options.type === 'short')
		    this.curve = new elliptic.curve.short(options);
		  else if (options.type === 'edwards')
		    this.curve = new elliptic.curve.edwards(options);
		  else
		    this.curve = new elliptic.curve.mont(options);
		  this.g = this.curve.g;
		  this.n = this.curve.n;
		  this.hash = options.hash;

		  assert(this.g.validate(), 'Invalid curve');
		  assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');
		}
		curves.PresetCurve = PresetCurve;

		function defineCurve(name, options) {
		  Object.defineProperty(curves, name, {
		    configurable: true,
		    enumerable: true,
		    get: function() {
		      var curve = new PresetCurve(options);
		      Object.defineProperty(curves, name, {
		        configurable: true,
		        enumerable: true,
		        value: curve
		      });
		      return curve;
		    }
		  });
		}

		defineCurve('p192', {
		  type: 'short',
		  prime: 'p192',
		  p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',
		  a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',
		  b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',
		  n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',
		  hash: hash.sha256,
		  gRed: false,
		  g: [
		    '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',
		    '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811'
		  ]
		});

		defineCurve('p224', {
		  type: 'short',
		  prime: 'p224',
		  p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',
		  a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',
		  b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',
		  n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',
		  hash: hash.sha256,
		  gRed: false,
		  g: [
		    'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',
		    'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34'
		  ]
		});

		defineCurve('p256', {
		  type: 'short',
		  prime: null,
		  p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',
		  a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',
		  b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',
		  n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',
		  hash: hash.sha256,
		  gRed: false,
		  g: [
		    '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',
		    '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5'
		  ]
		});

		defineCurve('p384', {
		  type: 'short',
		  prime: null,
		  p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'fffffffe ffffffff 00000000 00000000 ffffffff',
		  a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'fffffffe ffffffff 00000000 00000000 fffffffc',
		  b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +
		     '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',
		  n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +
		     'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',
		  hash: hash.sha384,
		  gRed: false,
		  g: [
		    'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +
		    '5502f25d bf55296c 3a545e38 72760ab7',
		    '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +
		    '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f'
		  ]
		});

		defineCurve('p521', {
		  type: 'short',
		  prime: null,
		  p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'ffffffff ffffffff ffffffff ffffffff ffffffff',
		  a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'ffffffff ffffffff ffffffff ffffffff fffffffc',
		  b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +
		     '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +
		     '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',
		  n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
		     'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +
		     'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',
		  hash: hash.sha512,
		  gRed: false,
		  g: [
		    '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +
		    '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +
		    'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',
		    '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +
		    '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +
		    '3fad0761 353c7086 a272c240 88be9476 9fd16650'
		  ]
		});

		defineCurve('curve25519', {
		  type: 'mont',
		  prime: 'p25519',
		  p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',
		  a: '76d06',
		  b: '0',
		  n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
		  hash: hash.sha256,
		  gRed: false,
		  g: [
		    '9'
		  ]
		});

		defineCurve('ed25519', {
		  type: 'edwards',
		  prime: 'p25519',
		  p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',
		  a: '-1',
		  c: '1',
		  // -121665 * (121666^(-1)) (mod P)
		  d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',
		  n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
		  hash: hash.sha256,
		  gRed: false,
		  g: [
		    '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',

		    // 4/5
		    '6666666666666666666666666666666666666666666666666666666666666658'
		  ]
		});

		var pre;
		try {
		  pre = __webpack_require__(617);
		} catch (e) {
		  pre = undefined;
		}

		defineCurve('secp256k1', {
		  type: 'short',
		  prime: 'k256',
		  p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',
		  a: '0',
		  b: '7',
		  n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',
		  h: '1',
		  hash: hash.sha256,

		  // Precomputed endomorphism
		  beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',
		  lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',
		  basis: [
		    {
		      a: '3086d221a7d46bcde86c90e49284eb15',
		      b: '-e4437ed6010e88286f547fa90abfe4c3'
		    },
		    {
		      a: '114ca50f7a8e2f3f657c1108d9d44cfd8',
		      b: '3086d221a7d46bcde86c90e49284eb15'
		    }
		  ],

		  gRed: false,
		  g: [
		    '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',
		    '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',
		    pre
		  ]
		});


	/***/ },
	/* 610 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var BN = __webpack_require__(19);
		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var assert = utils.assert;

		var KeyPair = __webpack_require__(611);
		var Signature = __webpack_require__(612);

		function EC(options) {
		  if (!(this instanceof EC))
		    return new EC(options);

		  // Shortcut `elliptic.ec(curve-name)`
		  if (typeof options === 'string') {
		    assert(elliptic.curves.hasOwnProperty(options), 'Unknown curve ' + options);

		    options = elliptic.curves[options];
		  }

		  // Shortcut for `elliptic.ec(elliptic.curves.curveName)`
		  if (options instanceof elliptic.curves.PresetCurve)
		    options = { curve: options };

		  this.curve = options.curve.curve;
		  this.n = this.curve.n;
		  this.nh = this.n.ushrn(1);
		  this.g = this.curve.g;

		  // Point on curve
		  this.g = options.curve.g;
		  this.g.precompute(options.curve.n.bitLength() + 1);

		  // Hash for function for DRBG
		  this.hash = options.hash || options.curve.hash;
		}
		module.exports = EC;

		EC.prototype.keyPair = function keyPair(options) {
		  return new KeyPair(this, options);
		};

		EC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {
		  return KeyPair.fromPrivate(this, priv, enc);
		};

		EC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {
		  return KeyPair.fromPublic(this, pub, enc);
		};

		EC.prototype.genKeyPair = function genKeyPair(options) {
		  if (!options)
		    options = {};

		  // Instantiate Hmac_DRBG
		  var drbg = new elliptic.hmacDRBG({
		    hash: this.hash,
		    pers: options.pers,
		    entropy: options.entropy || elliptic.rand(this.hash.hmacStrength),
		    nonce: this.n.toArray()
		  });

		  var bytes = this.n.byteLength();
		  var ns2 = this.n.sub(new BN(2));
		  do {
		    var priv = new BN(drbg.generate(bytes));
		    if (priv.cmp(ns2) > 0)
		      continue;

		    priv.iaddn(1);
		    return this.keyFromPrivate(priv);
		  } while (true);
		};

		EC.prototype._truncateToN = function truncateToN(msg, truncOnly) {
		  var delta = msg.byteLength() * 8 - this.n.bitLength();
		  if (delta > 0)
		    msg = msg.ushrn(delta);
		  if (!truncOnly && msg.cmp(this.n) >= 0)
		    return msg.sub(this.n);
		  else
		    return msg;
		};

		EC.prototype.sign = function sign(msg, key, enc, options) {
		  if (typeof enc === 'object') {
		    options = enc;
		    enc = null;
		  }
		  if (!options)
		    options = {};

		  key = this.keyFromPrivate(key, enc);
		  msg = this._truncateToN(new BN(msg, 16));

		  // Zero-extend key to provide enough entropy
		  var bytes = this.n.byteLength();
		  var bkey = key.getPrivate().toArray('be', bytes);

		  // Zero-extend nonce to have the same byte size as N
		  var nonce = msg.toArray('be', bytes);

		  // Instantiate Hmac_DRBG
		  var drbg = new elliptic.hmacDRBG({
		    hash: this.hash,
		    entropy: bkey,
		    nonce: nonce,
		    pers: options.pers,
		    persEnc: options.persEnc
		  });

		  // Number of bytes to generate
		  var ns1 = this.n.sub(new BN(1));

		  for (var iter = 0; true; iter++) {
		    var k = options.k ?
		        options.k(iter) :
		        new BN(drbg.generate(this.n.byteLength()));
		    k = this._truncateToN(k, true);
		    if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)
		      continue;

		    var kp = this.g.mul(k);
		    if (kp.isInfinity())
		      continue;

		    var kpX = kp.getX();
		    var r = kpX.umod(this.n);
		    if (r.cmpn(0) === 0)
		      continue;

		    var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));
		    s = s.umod(this.n);
		    if (s.cmpn(0) === 0)
		      continue;

		    var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |
		                        (kpX.cmp(r) !== 0 ? 2 : 0);

		    // Use complement of `s`, if it is > `n / 2`
		    if (options.canonical && s.cmp(this.nh) > 0) {
		      s = this.n.sub(s);
		      recoveryParam ^= 1;
		    }

		    return new Signature({ r: r, s: s, recoveryParam: recoveryParam });
		  }
		};

		EC.prototype.verify = function verify(msg, signature, key, enc) {
		  msg = this._truncateToN(new BN(msg, 16));
		  key = this.keyFromPublic(key, enc);
		  signature = new Signature(signature, 'hex');

		  // Perform primitive values validation
		  var r = signature.r;
		  var s = signature.s;
		  if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)
		    return false;
		  if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)
		    return false;

		  // Validate signature
		  var sinv = s.invm(this.n);
		  var u1 = sinv.mul(msg).umod(this.n);
		  var u2 = sinv.mul(r).umod(this.n);

		  var p = this.g.mulAdd(u1, key.getPublic(), u2);
		  if (p.isInfinity())
		    return false;

		  return p.getX().umod(this.n).cmp(r) === 0;
		};

		EC.prototype.recoverPubKey = function(msg, signature, j, enc) {
		  assert((3 & j) === j, 'The recovery param is more than two bits');
		  signature = new Signature(signature, enc);

		  var n = this.n;
		  var e = new BN(msg);
		  var r = signature.r;
		  var s = signature.s;

		  // A set LSB signifies that the y-coordinate is odd
		  var isYOdd = j & 1;
		  var isSecondKey = j >> 1;
		  if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)
		    throw new Error('Unable to find sencond key candinate');

		  // 1.1. Let x = r + jn.
		  if (isSecondKey)
		    r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);
		  else
		    r = this.curve.pointFromX(r, isYOdd);

		  var eNeg = n.sub(e);

		  // 1.6.1 Compute Q = r^-1 (sR -  eG)
		  //               Q = r^-1 (sR + -eG)
		  var rInv = signature.r.invm(n);
		  return this.g.mulAdd(eNeg, r, s).mul(rInv);
		};

		EC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {
		  signature = new Signature(signature, enc);
		  if (signature.recoveryParam !== null)
		    return signature.recoveryParam;

		  for (var i = 0; i < 4; i++) {
		    var Qprime;
		    try {
		      Qprime = this.recoverPubKey(e, signature, i);
		    } catch (e) {
		      continue;
		    }

		    if (Qprime.eq(Q))
		      return i;
		  }
		  throw new Error('Unable to find valid recovery factor');
		};


	/***/ },
	/* 611 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var BN = __webpack_require__(19);

		function KeyPair(ec, options) {
		  this.ec = ec;
		  this.priv = null;
		  this.pub = null;

		  // KeyPair(ec, { priv: ..., pub: ... })
		  if (options.priv)
		    this._importPrivate(options.priv, options.privEnc);
		  if (options.pub)
		    this._importPublic(options.pub, options.pubEnc);
		}
		module.exports = KeyPair;

		KeyPair.fromPublic = function fromPublic(ec, pub, enc) {
		  if (pub instanceof KeyPair)
		    return pub;

		  return new KeyPair(ec, {
		    pub: pub,
		    pubEnc: enc
		  });
		};

		KeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {
		  if (priv instanceof KeyPair)
		    return priv;

		  return new KeyPair(ec, {
		    priv: priv,
		    privEnc: enc
		  });
		};

		KeyPair.prototype.validate = function validate() {
		  var pub = this.getPublic();

		  if (pub.isInfinity())
		    return { result: false, reason: 'Invalid public key' };
		  if (!pub.validate())
		    return { result: false, reason: 'Public key is not a point' };
		  if (!pub.mul(this.ec.curve.n).isInfinity())
		    return { result: false, reason: 'Public key * N != O' };

		  return { result: true, reason: null };
		};

		KeyPair.prototype.getPublic = function getPublic(compact, enc) {
		  // compact is optional argument
		  if (typeof compact === 'string') {
		    enc = compact;
		    compact = null;
		  }

		  if (!this.pub)
		    this.pub = this.ec.g.mul(this.priv);

		  if (!enc)
		    return this.pub;

		  return this.pub.encode(enc, compact);
		};

		KeyPair.prototype.getPrivate = function getPrivate(enc) {
		  if (enc === 'hex')
		    return this.priv.toString(16, 2);
		  else
		    return this.priv;
		};

		KeyPair.prototype._importPrivate = function _importPrivate(key, enc) {
		  this.priv = new BN(key, enc || 16);

		  // Ensure that the priv won't be bigger than n, otherwise we may fail
		  // in fixed multiplication method
		  this.priv = this.priv.umod(this.ec.curve.n);
		};

		KeyPair.prototype._importPublic = function _importPublic(key, enc) {
		  if (key.x || key.y) {
		    this.pub = this.ec.curve.point(key.x, key.y);
		    return;
		  }
		  this.pub = this.ec.curve.decodePoint(key, enc);
		};

		// ECDH
		KeyPair.prototype.derive = function derive(pub) {
		  return pub.mul(this.priv).getX();
		};

		// ECDSA
		KeyPair.prototype.sign = function sign(msg, enc, options) {
		  return this.ec.sign(msg, this, enc, options);
		};

		KeyPair.prototype.verify = function verify(msg, signature) {
		  return this.ec.verify(msg, signature, this);
		};

		KeyPair.prototype.inspect = function inspect() {
		  return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) +
		         ' pub: ' + (this.pub && this.pub.inspect()) + ' >';
		};


	/***/ },
	/* 612 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var BN = __webpack_require__(19);

		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var assert = utils.assert;

		function Signature(options, enc) {
		  if (options instanceof Signature)
		    return options;

		  if (this._importDER(options, enc))
		    return;

		  assert(options.r && options.s, 'Signature without r or s');
		  this.r = new BN(options.r, 16);
		  this.s = new BN(options.s, 16);
		  if (options.recoveryParam === undefined)
		    this.recoveryParam = null;
		  else
		    this.recoveryParam = options.recoveryParam;
		}
		module.exports = Signature;

		function Position() {
		  this.place = 0;
		}

		function getLength(buf, p) {
		  var initial = buf[p.place++];
		  if (!(initial & 0x80)) {
		    return initial;
		  }
		  var octetLen = initial & 0xf;
		  var val = 0;
		  for (var i = 0, off = p.place; i < octetLen; i++, off++) {
		    val <<= 8;
		    val |= buf[off];
		  }
		  p.place = off;
		  return val;
		}

		function rmPadding(buf) {
		  var i = 0;
		  var len = buf.length - 1;
		  while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {
		    i++;
		  }
		  if (i === 0) {
		    return buf;
		  }
		  return buf.slice(i);
		}

		Signature.prototype._importDER = function _importDER(data, enc) {
		  data = utils.toArray(data, enc);
		  var p = new Position();
		  if (data[p.place++] !== 0x30) {
		    return false;
		  }
		  var len = getLength(data, p);
		  if ((len + p.place) !== data.length) {
		    return false;
		  }
		  if (data[p.place++] !== 0x02) {
		    return false;
		  }
		  var rlen = getLength(data, p);
		  var r = data.slice(p.place, rlen + p.place);
		  p.place += rlen;
		  if (data[p.place++] !== 0x02) {
		    return false;
		  }
		  var slen = getLength(data, p);
		  if (data.length !== slen + p.place) {
		    return false;
		  }
		  var s = data.slice(p.place, slen + p.place);
		  if (r[0] === 0 && (r[1] & 0x80)) {
		    r = r.slice(1);
		  }
		  if (s[0] === 0 && (s[1] & 0x80)) {
		    s = s.slice(1);
		  }

		  this.r = new BN(r);
		  this.s = new BN(s);
		  this.recoveryParam = null;

		  return true;
		};

		function constructLength(arr, len) {
		  if (len < 0x80) {
		    arr.push(len);
		    return;
		  }
		  var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);
		  arr.push(octets | 0x80);
		  while (--octets) {
		    arr.push((len >>> (octets << 3)) & 0xff);
		  }
		  arr.push(len);
		}

		Signature.prototype.toDER = function toDER(enc) {
		  var r = this.r.toArray();
		  var s = this.s.toArray();

		  // Pad values
		  if (r[0] & 0x80)
		    r = [ 0 ].concat(r);
		  // Pad values
		  if (s[0] & 0x80)
		    s = [ 0 ].concat(s);

		  r = rmPadding(r);
		  s = rmPadding(s);

		  while (!s[0] && !(s[1] & 0x80)) {
		    s = s.slice(1);
		  }
		  var arr = [ 0x02 ];
		  constructLength(arr, r.length);
		  arr = arr.concat(r);
		  arr.push(0x02);
		  constructLength(arr, s.length);
		  var backHalf = arr.concat(s);
		  var res = [ 0x30 ];
		  constructLength(res, backHalf.length);
		  res = res.concat(backHalf);
		  return utils.encode(res, enc);
		};


	/***/ },
	/* 613 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var hash = __webpack_require__(62);
		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var assert = utils.assert;
		var parseBytes = utils.parseBytes;
		var KeyPair = __webpack_require__(614);
		var Signature = __webpack_require__(615);

		function EDDSA(curve) {
		  assert(curve === 'ed25519', 'only tested with ed25519 so far');

		  if (!(this instanceof EDDSA))
		    return new EDDSA(curve);

		  var curve = elliptic.curves[curve].curve;
		  this.curve = curve;
		  this.g = curve.g;
		  this.g.precompute(curve.n.bitLength() + 1);

		  this.pointClass = curve.point().constructor;
		  this.encodingLength = Math.ceil(curve.n.bitLength() / 8);
		  this.hash = hash.sha512;
		}

		module.exports = EDDSA;

		/**
		* @param {Array|String} message - message bytes
		* @param {Array|String|KeyPair} secret - secret bytes or a keypair
		* @returns {Signature} - signature
		*/
		EDDSA.prototype.sign = function sign(message, secret) {
		  message = parseBytes(message);
		  var key = this.keyFromSecret(secret);
		  var r = this.hashInt(key.messagePrefix(), message);
		  var R = this.g.mul(r);
		  var Rencoded = this.encodePoint(R);
		  var s_ = this.hashInt(Rencoded, key.pubBytes(), message)
		               .mul(key.priv());
		  var S = r.add(s_).umod(this.curve.n);
		  return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });
		};

		/**
		* @param {Array} message - message bytes
		* @param {Array|String|Signature} sig - sig bytes
		* @param {Array|String|Point|KeyPair} pub - public key
		* @returns {Boolean} - true if public key matches sig of message
		*/
		EDDSA.prototype.verify = function verify(message, sig, pub) {
		  message = parseBytes(message);
		  sig = this.makeSignature(sig);
		  var key = this.keyFromPublic(pub);
		  var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);
		  var SG = this.g.mul(sig.S());
		  var RplusAh = sig.R().add(key.pub().mul(h));
		  return RplusAh.eq(SG);
		};

		EDDSA.prototype.hashInt = function hashInt() {
		  var hash = this.hash();
		  for (var i = 0; i < arguments.length; i++)
		    hash.update(arguments[i]);
		  return utils.intFromLE(hash.digest()).umod(this.curve.n);
		};

		EDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {
		  return KeyPair.fromPublic(this, pub);
		};

		EDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {
		  return KeyPair.fromSecret(this, secret);
		};

		EDDSA.prototype.makeSignature = function makeSignature(sig) {
		  if (sig instanceof Signature)
		    return sig;
		  return new Signature(this, sig);
		};

		/**
		* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2
		*
		* EDDSA defines methods for encoding and decoding points and integers. These are
		* helper convenience methods, that pass along to utility functions implied
		* parameters.
		*
		*/
		EDDSA.prototype.encodePoint = function encodePoint(point) {
		  var enc = point.getY().toArray('le', this.encodingLength);
		  enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;
		  return enc;
		};

		EDDSA.prototype.decodePoint = function decodePoint(bytes) {
		  bytes = utils.parseBytes(bytes);

		  var lastIx = bytes.length - 1;
		  var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);
		  var xIsOdd = (bytes[lastIx] & 0x80) !== 0;

		  var y = utils.intFromLE(normed);
		  return this.curve.pointFromY(y, xIsOdd);
		};

		EDDSA.prototype.encodeInt = function encodeInt(num) {
		  return num.toArray('le', this.encodingLength);
		};

		EDDSA.prototype.decodeInt = function decodeInt(bytes) {
		  return utils.intFromLE(bytes);
		};

		EDDSA.prototype.isPoint = function isPoint(val) {
		  return val instanceof this.pointClass;
		};


	/***/ },
	/* 614 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var assert = utils.assert;
		var parseBytes = utils.parseBytes;
		var cachedProperty = utils.cachedProperty;

		/**
		* @param {EDDSA} eddsa - instance
		* @param {Object} params - public/private key parameters
		*
		* @param {Array<Byte>} [params.secret] - secret seed bytes
		* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)
		* @param {Array<Byte>} [params.pub] - public key point encoded as bytes
		*
		*/
		function KeyPair(eddsa, params) {
		  this.eddsa = eddsa;
		  this._secret = parseBytes(params.secret);
		  if (eddsa.isPoint(params.pub))
		    this._pub = params.pub;
		  else
		    this._pubBytes = parseBytes(params.pub);
		}

		KeyPair.fromPublic = function fromPublic(eddsa, pub) {
		  if (pub instanceof KeyPair)
		    return pub;
		  return new KeyPair(eddsa, { pub: pub });
		};

		KeyPair.fromSecret = function fromSecret(eddsa, secret) {
		  if (secret instanceof KeyPair)
		    return secret;
		  return new KeyPair(eddsa, { secret: secret });
		};

		KeyPair.prototype.secret = function secret() {
		  return this._secret;
		};

		cachedProperty(KeyPair, function pubBytes() {
		  return this.eddsa.encodePoint(this.pub());
		});

		cachedProperty(KeyPair, function pub() {
		  if (this._pubBytes)
		    return this.eddsa.decodePoint(this._pubBytes);
		  return this.eddsa.g.mul(this.priv());
		});

		cachedProperty(KeyPair, function privBytes() {
		  var eddsa = this.eddsa;
		  var hash = this.hash();
		  var lastIx = eddsa.encodingLength - 1;

		  var a = hash.slice(0, eddsa.encodingLength);
		  a[0] &= 248;
		  a[lastIx] &= 127;
		  a[lastIx] |= 64;

		  return a;
		});

		cachedProperty(KeyPair, function priv() {
		  return this.eddsa.decodeInt(this.privBytes());
		});

		cachedProperty(KeyPair, function hash() {
		  return this.eddsa.hash().update(this.secret()).digest();
		});

		cachedProperty(KeyPair, function messagePrefix() {
		  return this.hash().slice(this.eddsa.encodingLength);
		});

		KeyPair.prototype.sign = function sign(message) {
		  assert(this._secret, 'KeyPair can only verify');
		  return this.eddsa.sign(message, this);
		};

		KeyPair.prototype.verify = function verify(message, sig) {
		  return this.eddsa.verify(message, sig, this);
		};

		KeyPair.prototype.getSecret = function getSecret(enc) {
		  assert(this._secret, 'KeyPair is public only');
		  return utils.encode(this.secret(), enc);
		};

		KeyPair.prototype.getPublic = function getPublic(enc) {
		  return utils.encode(this.pubBytes(), enc);
		};

		module.exports = KeyPair;


	/***/ },
	/* 615 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var BN = __webpack_require__(19);
		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var assert = utils.assert;
		var cachedProperty = utils.cachedProperty;
		var parseBytes = utils.parseBytes;

		/**
		* @param {EDDSA} eddsa - eddsa instance
		* @param {Array<Bytes>|Object} sig -
		* @param {Array<Bytes>|Point} [sig.R] - R point as Point or bytes
		* @param {Array<Bytes>|bn} [sig.S] - S scalar as bn or bytes
		* @param {Array<Bytes>} [sig.Rencoded] - R point encoded
		* @param {Array<Bytes>} [sig.Sencoded] - S scalar encoded
		*/
		function Signature(eddsa, sig) {
		  this.eddsa = eddsa;

		  if (typeof sig !== 'object')
		    sig = parseBytes(sig);

		  if (Array.isArray(sig)) {
		    sig = {
		      R: sig.slice(0, eddsa.encodingLength),
		      S: sig.slice(eddsa.encodingLength)
		    };
		  }

		  assert(sig.R && sig.S, 'Signature without R or S');

		  if (eddsa.isPoint(sig.R))
		    this._R = sig.R;
		  if (sig.S instanceof BN)
		    this._S = sig.S;

		  this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;
		  this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;
		}

		cachedProperty(Signature, function S() {
		  return this.eddsa.decodeInt(this.Sencoded());
		});

		cachedProperty(Signature, function R() {
		  return this.eddsa.decodePoint(this.Rencoded());
		});

		cachedProperty(Signature, function Rencoded() {
		  return this.eddsa.encodePoint(this.R());
		});

		cachedProperty(Signature, function Sencoded() {
		  return this.eddsa.encodeInt(this.S());
		});

		Signature.prototype.toBytes = function toBytes() {
		  return this.Rencoded().concat(this.Sencoded());
		};

		Signature.prototype.toHex = function toHex() {
		  return utils.encode(this.toBytes(), 'hex').toUpperCase();
		};

		module.exports = Signature;


	/***/ },
	/* 616 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var hash = __webpack_require__(62);
		var elliptic = __webpack_require__(26);
		var utils = elliptic.utils;
		var assert = utils.assert;

		function HmacDRBG(options) {
		  if (!(this instanceof HmacDRBG))
		    return new HmacDRBG(options);
		  this.hash = options.hash;
		  this.predResist = !!options.predResist;

		  this.outLen = this.hash.outSize;
		  this.minEntropy = options.minEntropy || this.hash.hmacStrength;

		  this.reseed = null;
		  this.reseedInterval = null;
		  this.K = null;
		  this.V = null;

		  var entropy = utils.toArray(options.entropy, options.entropyEnc);
		  var nonce = utils.toArray(options.nonce, options.nonceEnc);
		  var pers = utils.toArray(options.pers, options.persEnc);
		  assert(entropy.length >= (this.minEntropy / 8),
		         'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');
		  this._init(entropy, nonce, pers);
		}
		module.exports = HmacDRBG;

		HmacDRBG.prototype._init = function init(entropy, nonce, pers) {
		  var seed = entropy.concat(nonce).concat(pers);

		  this.K = new Array(this.outLen / 8);
		  this.V = new Array(this.outLen / 8);
		  for (var i = 0; i < this.V.length; i++) {
		    this.K[i] = 0x00;
		    this.V[i] = 0x01;
		  }

		  this._update(seed);
		  this.reseed = 1;
		  this.reseedInterval = 0x1000000000000;  // 2^48
		};

		HmacDRBG.prototype._hmac = function hmac() {
		  return new hash.hmac(this.hash, this.K);
		};

		HmacDRBG.prototype._update = function update(seed) {
		  var kmac = this._hmac()
		                 .update(this.V)
		                 .update([ 0x00 ]);
		  if (seed)
		    kmac = kmac.update(seed);
		  this.K = kmac.digest();
		  this.V = this._hmac().update(this.V).digest();
		  if (!seed)
		    return;

		  this.K = this._hmac()
		               .update(this.V)
		               .update([ 0x01 ])
		               .update(seed)
		               .digest();
		  this.V = this._hmac().update(this.V).digest();
		};

		HmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {
		  // Optional entropy enc
		  if (typeof entropyEnc !== 'string') {
		    addEnc = add;
		    add = entropyEnc;
		    entropyEnc = null;
		  }

		  entropy = utils.toBuffer(entropy, entropyEnc);
		  add = utils.toBuffer(add, addEnc);

		  assert(entropy.length >= (this.minEntropy / 8),
		         'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');

		  this._update(entropy.concat(add || []));
		  this.reseed = 1;
		};

		HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {
		  if (this.reseed > this.reseedInterval)
		    throw new Error('Reseed is required');

		  // Optional encoding
		  if (typeof enc !== 'string') {
		    addEnc = add;
		    add = enc;
		    enc = null;
		  }

		  // Optional additional data
		  if (add) {
		    add = utils.toArray(add, addEnc);
		    this._update(add);
		  }

		  var temp = [];
		  while (temp.length < len) {
		    this.V = this._hmac().update(this.V).digest();
		    temp = temp.concat(this.V);
		  }

		  var res = temp.slice(0, len);
		  this._update(add);
		  this.reseed++;
		  return utils.encode(res, enc);
		};


	/***/ },
	/* 617 */
	/***/ function(module, exports) {

		module.exports = {
		  doubles: {
		    step: 4,
		    points: [
		      [
		        'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',
		        'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821'
		      ],
		      [
		        '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',
		        '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf'
		      ],
		      [
		        '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',
		        'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695'
		      ],
		      [
		        '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',
		        '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9'
		      ],
		      [
		        '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',
		        '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36'
		      ],
		      [
		        '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',
		        '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f'
		      ],
		      [
		        'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',
		        '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999'
		      ],
		      [
		        '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',
		        'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09'
		      ],
		      [
		        'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',
		        '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d'
		      ],
		      [
		        'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',
		        'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088'
		      ],
		      [
		        'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',
		        '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d'
		      ],
		      [
		        '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',
		        '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8'
		      ],
		      [
		        '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',
		        '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a'
		      ],
		      [
		        '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',
		        '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453'
		      ],
		      [
		        '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',
		        '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160'
		      ],
		      [
		        '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',
		        '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0'
		      ],
		      [
		        '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',
		        '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6'
		      ],
		      [
		        '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',
		        '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589'
		      ],
		      [
		        '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',
		        'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17'
		      ],
		      [
		        'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',
		        '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda'
		      ],
		      [
		        'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',
		        '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd'
		      ],
		      [
		        '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',
		        '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2'
		      ],
		      [
		        '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',
		        '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6'
		      ],
		      [
		        'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',
		        '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f'
		      ],
		      [
		        '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',
		        'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01'
		      ],
		      [
		        'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',
		        '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3'
		      ],
		      [
		        'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',
		        'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f'
		      ],
		      [
		        'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',
		        '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7'
		      ],
		      [
		        'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',
		        'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78'
		      ],
		      [
		        'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',
		        '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1'
		      ],
		      [
		        '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',
		        'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150'
		      ],
		      [
		        '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',
		        '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82'
		      ],
		      [
		        'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',
		        '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc'
		      ],
		      [
		        '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',
		        'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b'
		      ],
		      [
		        'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',
		        '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51'
		      ],
		      [
		        'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',
		        '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45'
		      ],
		      [
		        'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',
		        'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120'
		      ],
		      [
		        '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',
		        '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84'
		      ],
		      [
		        '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',
		        '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d'
		      ],
		      [
		        '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',
		        'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d'
		      ],
		      [
		        '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',
		        '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8'
		      ],
		      [
		        'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',
		        '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8'
		      ],
		      [
		        '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',
		        '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac'
		      ],
		      [
		        '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',
		        'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f'
		      ],
		      [
		        '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',
		        '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962'
		      ],
		      [
		        'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',
		        '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907'
		      ],
		      [
		        '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',
		        'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec'
		      ],
		      [
		        'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',
		        'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d'
		      ],
		      [
		        'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',
		        '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414'
		      ],
		      [
		        '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',
		        'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd'
		      ],
		      [
		        '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',
		        'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0'
		      ],
		      [
		        'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',
		        '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811'
		      ],
		      [
		        'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',
		        '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1'
		      ],
		      [
		        'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',
		        '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c'
		      ],
		      [
		        '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',
		        'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73'
		      ],
		      [
		        '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',
		        '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd'
		      ],
		      [
		        'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',
		        'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405'
		      ],
		      [
		        '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',
		        'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589'
		      ],
		      [
		        '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',
		        '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e'
		      ],
		      [
		        '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',
		        '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27'
		      ],
		      [
		        'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',
		        'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1'
		      ],
		      [
		        '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',
		        '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482'
		      ],
		      [
		        '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',
		        '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945'
		      ],
		      [
		        'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',
		        '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573'
		      ],
		      [
		        'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',
		        'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82'
		      ]
		    ]
		  },
		  naf: {
		    wnd: 7,
		    points: [
		      [
		        'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',
		        '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672'
		      ],
		      [
		        '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',
		        'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6'
		      ],
		      [
		        '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',
		        '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da'
		      ],
		      [
		        'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',
		        'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37'
		      ],
		      [
		        '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',
		        'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b'
		      ],
		      [
		        'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',
		        'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81'
		      ],
		      [
		        'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',
		        '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58'
		      ],
		      [
		        'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',
		        '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77'
		      ],
		      [
		        '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',
		        '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a'
		      ],
		      [
		        '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',
		        '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c'
		      ],
		      [
		        '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',
		        '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67'
		      ],
		      [
		        '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',
		        '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402'
		      ],
		      [
		        'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',
		        'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55'
		      ],
		      [
		        'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',
		        '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482'
		      ],
		      [
		        '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',
		        'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82'
		      ],
		      [
		        '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',
		        'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396'
		      ],
		      [
		        '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',
		        '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49'
		      ],
		      [
		        '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',
		        '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf'
		      ],
		      [
		        '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',
		        '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a'
		      ],
		      [
		        '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',
		        'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7'
		      ],
		      [
		        'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',
		        'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933'
		      ],
		      [
		        '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',
		        '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a'
		      ],
		      [
		        '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',
		        '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6'
		      ],
		      [
		        'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',
		        'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37'
		      ],
		      [
		        '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',
		        '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e'
		      ],
		      [
		        'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',
		        'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6'
		      ],
		      [
		        'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',
		        'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476'
		      ],
		      [
		        '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',
		        '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40'
		      ],
		      [
		        '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',
		        '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61'
		      ],
		      [
		        '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',
		        '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683'
		      ],
		      [
		        'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',
		        '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5'
		      ],
		      [
		        '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',
		        '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b'
		      ],
		      [
		        'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',
		        '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417'
		      ],
		      [
		        '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',
		        'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868'
		      ],
		      [
		        '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',
		        'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a'
		      ],
		      [
		        'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',
		        'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6'
		      ],
		      [
		        '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',
		        '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996'
		      ],
		      [
		        '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',
		        'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e'
		      ],
		      [
		        'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',
		        'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d'
		      ],
		      [
		        '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',
		        '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2'
		      ],
		      [
		        '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',
		        'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e'
		      ],
		      [
		        '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',
		        '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437'
		      ],
		      [
		        '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',
		        'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311'
		      ],
		      [
		        'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',
		        '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4'
		      ],
		      [
		        '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',
		        '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575'
		      ],
		      [
		        '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',
		        'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d'
		      ],
		      [
		        '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',
		        'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d'
		      ],
		      [
		        'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',
		        'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629'
		      ],
		      [
		        'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',
		        'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06'
		      ],
		      [
		        '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',
		        '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374'
		      ],
		      [
		        '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',
		        '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee'
		      ],
		      [
		        'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',
		        '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1'
		      ],
		      [
		        'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',
		        'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b'
		      ],
		      [
		        '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',
		        '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661'
		      ],
		      [
		        '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',
		        '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6'
		      ],
		      [
		        'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',
		        '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e'
		      ],
		      [
		        '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',
		        '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d'
		      ],
		      [
		        'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',
		        'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc'
		      ],
		      [
		        '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',
		        'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4'
		      ],
		      [
		        '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',
		        '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c'
		      ],
		      [
		        'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',
		        '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b'
		      ],
		      [
		        'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',
		        '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913'
		      ],
		      [
		        '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',
		        '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154'
		      ],
		      [
		        '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',
		        '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865'
		      ],
		      [
		        '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',
		        'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc'
		      ],
		      [
		        '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',
		        'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224'
		      ],
		      [
		        '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',
		        '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e'
		      ],
		      [
		        '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',
		        '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6'
		      ],
		      [
		        '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',
		        '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511'
		      ],
		      [
		        '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',
		        'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b'
		      ],
		      [
		        'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',
		        'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2'
		      ],
		      [
		        '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',
		        'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c'
		      ],
		      [
		        'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',
		        '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3'
		      ],
		      [
		        'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',
		        '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d'
		      ],
		      [
		        'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',
		        '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700'
		      ],
		      [
		        'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',
		        '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4'
		      ],
		      [
		        '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',
		        'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196'
		      ],
		      [
		        '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',
		        '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4'
		      ],
		      [
		        '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',
		        'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257'
		      ],
		      [
		        'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',
		        'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13'
		      ],
		      [
		        'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',
		        '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096'
		      ],
		      [
		        'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',
		        'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38'
		      ],
		      [
		        'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',
		        '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f'
		      ],
		      [
		        '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',
		        '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448'
		      ],
		      [
		        'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',
		        '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a'
		      ],
		      [
		        'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',
		        '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4'
		      ],
		      [
		        '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',
		        '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437'
		      ],
		      [
		        '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',
		        'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7'
		      ],
		      [
		        'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',
		        '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d'
		      ],
		      [
		        'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',
		        '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a'
		      ],
		      [
		        'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',
		        '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54'
		      ],
		      [
		        '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',
		        '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77'
		      ],
		      [
		        'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',
		        'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517'
		      ],
		      [
		        '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',
		        'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10'
		      ],
		      [
		        'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',
		        'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125'
		      ],
		      [
		        'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',
		        '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e'
		      ],
		      [
		        '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',
		        'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1'
		      ],
		      [
		        'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',
		        '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2'
		      ],
		      [
		        'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',
		        '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423'
		      ],
		      [
		        'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',
		        '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8'
		      ],
		      [
		        '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',
		        'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758'
		      ],
		      [
		        '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',
		        'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375'
		      ],
		      [
		        'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',
		        '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d'
		      ],
		      [
		        '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',
		        'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec'
		      ],
		      [
		        '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',
		        '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0'
		      ],
		      [
		        '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',
		        'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c'
		      ],
		      [
		        'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',
		        'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4'
		      ],
		      [
		        '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',
		        'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f'
		      ],
		      [
		        '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',
		        '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649'
		      ],
		      [
		        '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',
		        'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826'
		      ],
		      [
		        '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',
		        '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5'
		      ],
		      [
		        'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',
		        'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87'
		      ],
		      [
		        '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',
		        '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b'
		      ],
		      [
		        'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',
		        '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc'
		      ],
		      [
		        '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',
		        '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c'
		      ],
		      [
		        'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',
		        'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f'
		      ],
		      [
		        'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',
		        '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a'
		      ],
		      [
		        'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',
		        'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46'
		      ],
		      [
		        '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',
		        'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f'
		      ],
		      [
		        '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',
		        '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03'
		      ],
		      [
		        '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',
		        'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08'
		      ],
		      [
		        '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',
		        '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8'
		      ],
		      [
		        '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',
		        '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373'
		      ],
		      [
		        '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',
		        'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3'
		      ],
		      [
		        '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',
		        '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8'
		      ],
		      [
		        '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',
		        '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1'
		      ],
		      [
		        '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',
		        '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9'
		      ]
		    ]
		  }
		};


	/***/ },
	/* 618 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var utils = exports;
		var BN = __webpack_require__(19);

		utils.assert = function assert(val, msg) {
		  if (!val)
		    throw new Error(msg || 'Assertion failed');
		};

		function toArray(msg, enc) {
		  if (Array.isArray(msg))
		    return msg.slice();
		  if (!msg)
		    return [];
		  var res = [];
		  if (typeof msg !== 'string') {
		    for (var i = 0; i < msg.length; i++)
		      res[i] = msg[i] | 0;
		    return res;
		  }
		  if (!enc) {
		    for (var i = 0; i < msg.length; i++) {
		      var c = msg.charCodeAt(i);
		      var hi = c >> 8;
		      var lo = c & 0xff;
		      if (hi)
		        res.push(hi, lo);
		      else
		        res.push(lo);
		    }
		  } else if (enc === 'hex') {
		    msg = msg.replace(/[^a-z0-9]+/ig, '');
		    if (msg.length % 2 !== 0)
		      msg = '0' + msg;
		    for (var i = 0; i < msg.length; i += 2)
		      res.push(parseInt(msg[i] + msg[i + 1], 16));
		  }
		  return res;
		}
		utils.toArray = toArray;

		function zero2(word) {
		  if (word.length === 1)
		    return '0' + word;
		  else
		    return word;
		}
		utils.zero2 = zero2;

		function toHex(msg) {
		  var res = '';
		  for (var i = 0; i < msg.length; i++)
		    res += zero2(msg[i].toString(16));
		  return res;
		}
		utils.toHex = toHex;

		utils.encode = function encode(arr, enc) {
		  if (enc === 'hex')
		    return toHex(arr);
		  else
		    return arr;
		};

		// Represent num in a w-NAF form
		function getNAF(num, w) {
		  var naf = [];
		  var ws = 1 << (w + 1);
		  var k = num.clone();
		  while (k.cmpn(1) >= 0) {
		    var z;
		    if (k.isOdd()) {
		      var mod = k.andln(ws - 1);
		      if (mod > (ws >> 1) - 1)
		        z = (ws >> 1) - mod;
		      else
		        z = mod;
		      k.isubn(z);
		    } else {
		      z = 0;
		    }
		    naf.push(z);

		    // Optimization, shift by word if possible
		    var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;
		    for (var i = 1; i < shift; i++)
		      naf.push(0);
		    k.iushrn(shift);
		  }

		  return naf;
		}
		utils.getNAF = getNAF;

		// Represent k1, k2 in a Joint Sparse Form
		function getJSF(k1, k2) {
		  var jsf = [
		    [],
		    []
		  ];

		  k1 = k1.clone();
		  k2 = k2.clone();
		  var d1 = 0;
		  var d2 = 0;
		  while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {

		    // First phase
		    var m14 = (k1.andln(3) + d1) & 3;
		    var m24 = (k2.andln(3) + d2) & 3;
		    if (m14 === 3)
		      m14 = -1;
		    if (m24 === 3)
		      m24 = -1;
		    var u1;
		    if ((m14 & 1) === 0) {
		      u1 = 0;
		    } else {
		      var m8 = (k1.andln(7) + d1) & 7;
		      if ((m8 === 3 || m8 === 5) && m24 === 2)
		        u1 = -m14;
		      else
		        u1 = m14;
		    }
		    jsf[0].push(u1);

		    var u2;
		    if ((m24 & 1) === 0) {
		      u2 = 0;
		    } else {
		      var m8 = (k2.andln(7) + d2) & 7;
		      if ((m8 === 3 || m8 === 5) && m14 === 2)
		        u2 = -m24;
		      else
		        u2 = m24;
		    }
		    jsf[1].push(u2);

		    // Second phase
		    if (2 * d1 === u1 + 1)
		      d1 = 1 - d1;
		    if (2 * d2 === u2 + 1)
		      d2 = 1 - d2;
		    k1.iushrn(1);
		    k2.iushrn(1);
		  }

		  return jsf;
		}
		utils.getJSF = getJSF;

		function cachedProperty(obj, computer) {
		  var name = computer.name;
		  var key = '_' + name;
		  obj.prototype[name] = function cachedProperty() {
		    return this[key] !== undefined ? this[key] :
		           this[key] = computer.call(this);
		  };
		}
		utils.cachedProperty = cachedProperty;

		function parseBytes(bytes) {
		  return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :
		                                     bytes;
		}
		utils.parseBytes = parseBytes;

		function intFromLE(bytes) {
		  return new BN(bytes, 'hex', 'le');
		}
		utils.intFromLE = intFromLE;



	/***/ },
	/* 619 */
	/***/ function(module, exports, __webpack_require__) {

		var once = __webpack_require__(125);

		var noop = function() {};

		var isRequest = function(stream) {
			return stream.setHeader && typeof stream.abort === 'function';
		};

		var isChildProcess = function(stream) {
			return stream.stdio && Array.isArray(stream.stdio) && stream.stdio.length === 3
		};

		var eos = function(stream, opts, callback) {
			if (typeof opts === 'function') return eos(stream, null, opts);
			if (!opts) opts = {};

			callback = once(callback || noop);

			var ws = stream._writableState;
			var rs = stream._readableState;
			var readable = opts.readable || (opts.readable !== false && stream.readable);
			var writable = opts.writable || (opts.writable !== false && stream.writable);

			var onlegacyfinish = function() {
				if (!stream.writable) onfinish();
			};

			var onfinish = function() {
				writable = false;
				if (!readable) callback();
			};

			var onend = function() {
				readable = false;
				if (!writable) callback();
			};

			var onexit = function(exitCode) {
				callback(exitCode ? new Error('exited with error code: ' + exitCode) : null);
			};

			var onclose = function() {
				if (readable && !(rs && rs.ended)) return callback(new Error('premature close'));
				if (writable && !(ws && ws.ended)) return callback(new Error('premature close'));
			};

			var onrequest = function() {
				stream.req.on('finish', onfinish);
			};

			if (isRequest(stream)) {
				stream.on('complete', onfinish);
				stream.on('abort', onclose);
				if (stream.req) onrequest();
				else stream.on('request', onrequest);
			} else if (writable && !ws) { // legacy streams
				stream.on('end', onlegacyfinish);
				stream.on('close', onlegacyfinish);
			}

			if (isChildProcess(stream)) stream.on('exit', onexit);

			stream.on('end', onend);
			stream.on('finish', onfinish);
			if (opts.error !== false) stream.on('error', callback);
			stream.on('close', onclose);

			return function() {
				stream.removeListener('complete', onfinish);
				stream.removeListener('abort', onclose);
				stream.removeListener('request', onrequest);
				if (stream.req) stream.req.removeListener('finish', onfinish);
				stream.removeListener('end', onlegacyfinish);
				stream.removeListener('close', onlegacyfinish);
				stream.removeListener('finish', onfinish);
				stream.removeListener('exit', onexit);
				stream.removeListener('end', onend);
				stream.removeListener('error', callback);
				stream.removeListener('close', onclose);
			};
		};

		module.exports = eos;

	/***/ },
	/* 620 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Readable = __webpack_require__(622).Readable
		var inherits = __webpack_require__(2)

		module.exports = from2

		from2.ctor = ctor
		from2.obj = obj

		var Proto = ctor()

		function toFunction(list) {
		  list = list.slice()
		  return function (_, cb) {
		    var err = null
		    var item = list.length ? list.shift() : null
		    if (item instanceof Error) {
		      err = item
		      item = null
		    }

		    cb(err, item)
		  }
		}

		function from2(opts, read) {
		  if (typeof opts !== 'object' || Array.isArray(opts)) {
		    read = opts
		    opts = {}
		  }

		  var rs = new Proto(opts)
		  rs._from = Array.isArray(read) ? toFunction(read) : read
		  return rs
		}

		function ctor(opts, read) {
		  if (typeof opts === 'function') {
		    read = opts
		    opts = {}
		  }

		  opts = defaults(opts)

		  inherits(Class, Readable)
		  function Class(override) {
		    if (!(this instanceof Class)) return new Class(override)
		    this._reading = false
		    this._callback = check
		    this.destroyed = false
		    Readable.call(this, override || opts)

		    var self = this
		    var hwm = this._readableState.highWaterMark

		    function check(err, data) {
		      if (self.destroyed) return
		      if (err) return self.destroy(err)
		      if (data === null) return self.push(null)
		      self._reading = false
		      if (self.push(data)) self._read(hwm)
		    }
		  }

		  Class.prototype._from = read
		  Class.prototype._read = function(size) {
		    if (this._reading || this.destroyed) return
		    this._reading = true
		    this._from(size, this._callback)
		  }

		  Class.prototype.destroy = function(err) {
		    if (this.destroyed) return
		    this.destroyed = true

		    var self = this
		    process.nextTick(function() {
		      if (err) self.emit('error', err)
		      self.emit('close')
		    })
		  }

		  return Class
		}

		function obj(opts, read) {
		  if (typeof opts === 'function' || Array.isArray(opts)) {
		    read = opts
		    opts = {}
		  }

		  opts = defaults(opts)
		  opts.objectMode = true
		  opts.highWaterMark = 16

		  return from2(opts, read)
		}

		function defaults(opts) {
		  opts = opts || {}
		  return opts
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 621 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(245);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 622 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(244);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(246);
		exports.Duplex = __webpack_require__(74);
		exports.Transform = __webpack_require__(245);
		exports.PassThrough = __webpack_require__(621);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 623 */
	/***/ function(module, exports, __webpack_require__) {

		var mkdirp = __webpack_require__(785)
		var LRU = __webpack_require__(684)
		var eos = __webpack_require__(619)
		var duplexify = __webpack_require__(601)
		var path = __webpack_require__(31)


		var noop = function() {}

		var join = function(root, dir) {
		  return path.join(root, path.resolve('/', dir).replace(/^[a-zA-Z]:/, ''))
		}

		var listen = function(stream, opts, cb) {
		  if (!cb) return stream
		  eos(stream, function(err) {
		    if (err) return cb(err)
		    cb(null, opts)
		  })
		  return stream
		}

		var BlobStore = function(opts) {
		  if (!(this instanceof BlobStore)) return new BlobStore(opts)
		  if (typeof opts === 'string') opts = {path:opts}

		  this.path = opts.path
		  this.cache = LRU(opts.cache || 100)
		}

		BlobStore.prototype.createWriteStream = function(opts, cb) {
		  if (typeof opts === 'string') opts = {key:opts}
		  if (opts.name && !opts.key) opts.key = opts.name

		  var key = join(this.path, opts.key)
		  var dir = path.dirname(key)
		  var cache = this.cache

		  if (cache.get(dir)) return listen(fs.createWriteStream(key, opts), opts, cb)

		  var proxy = listen(duplexify(), opts, cb)

		  proxy.setReadable(false)

		  mkdirp(dir, function(err) {
		    if (proxy.destroyed) return
		    if (err) return proxy.destroy(err)
		    cache.set(dir, true)
		    proxy.setWritable(fs.createWriteStream(key, opts))
		  })

		  return proxy
		}

		BlobStore.prototype.createReadStream = function(key, opts) {
		  if (key && typeof key === 'object') return this.createReadStream(key.key, key)
		  return fs.createReadStream(join(this.path, key), opts)
		}

		BlobStore.prototype.exists = function(opts, cb) {
		  if (typeof opts === 'string') opts = {key:opts}
		  var key = join(this.path, opts.key)
		  fs.stat(key, function(err, stat) {
		    if (err && err.code !== 'ENOENT') return cb(err)
		    cb(null, !!stat)
		  })
		}

		BlobStore.prototype.remove = function(opts, cb) {
		  if (typeof opts === 'string') opts = {key:opts}
		  if (!opts) opts = noop
		  var key = join(this.path, opts.key)
		  fs.unlink(key, function(err) {
		    if (err && err.code !== 'ENOENT') return cb(err)
		    cb()
		  })
		}

		module.exports = BlobStore


	/***/ },
	/* 624 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {module.exports = globSync
		globSync.GlobSync = GlobSync


		var minimatch = __webpack_require__(172)
		var Minimatch = minimatch.Minimatch
		var Glob = __webpack_require__(250).Glob
		var util = __webpack_require__(11)
		var path = __webpack_require__(31)
		var assert = __webpack_require__(34)
		var isAbsolute = __webpack_require__(175)
		var common = __webpack_require__(249)
		var alphasort = common.alphasort
		var alphasorti = common.alphasorti
		var setopts = common.setopts
		var ownProp = common.ownProp
		var childrenIgnored = common.childrenIgnored

		function globSync (pattern, options) {
		  if (typeof options === 'function' || arguments.length === 3)
		    throw new TypeError('callback provided to sync glob\n'+
		                        'See: https://github.com/isaacs/node-glob/issues/167')

		  return new GlobSync(pattern, options).found
		}

		function GlobSync (pattern, options) {
		  if (!pattern)
		    throw new Error('must provide pattern')

		  if (typeof options === 'function' || arguments.length === 3)
		    throw new TypeError('callback provided to sync glob\n'+
		                        'See: https://github.com/isaacs/node-glob/issues/167')

		  if (!(this instanceof GlobSync))
		    return new GlobSync(pattern, options)

		  setopts(this, pattern, options)

		  if (this.noprocess)
		    return this

		  var n = this.minimatch.set.length
		  this.matches = new Array(n)
		  for (var i = 0; i < n; i ++) {
		    this._process(this.minimatch.set[i], i, false)
		  }
		  this._finish()
		}

		GlobSync.prototype._finish = function () {
		  assert(this instanceof GlobSync)
		  if (this.realpath) {
		    var self = this
		    this.matches.forEach(function (matchset, index) {
		      var set = self.matches[index] = Object.create(null)
		      for (var p in matchset) {
		        try {
		          p = self._makeAbs(p)
		          var real = fs.realpathSync(p, self.realpathCache)
		          set[real] = true
		        } catch (er) {
		          if (er.syscall === 'stat')
		            set[self._makeAbs(p)] = true
		          else
		            throw er
		        }
		      }
		    })
		  }
		  common.finish(this)
		}


		GlobSync.prototype._process = function (pattern, index, inGlobStar) {
		  assert(this instanceof GlobSync)

		  // Get the first [n] parts of pattern that are all strings.
		  var n = 0
		  while (typeof pattern[n] === 'string') {
		    n ++
		  }
		  // now n is the index of the first one that is *not* a string.

		  // See if there's anything else
		  var prefix
		  switch (n) {
		    // if not, then this is rather simple
		    case pattern.length:
		      this._processSimple(pattern.join('/'), index)
		      return

		    case 0:
		      // pattern *starts* with some non-trivial item.
		      // going to readdir(cwd), but not include the prefix in matches.
		      prefix = null
		      break

		    default:
		      // pattern has some string bits in the front.
		      // whatever it starts with, whether that's 'absolute' like /foo/bar,
		      // or 'relative' like '../baz'
		      prefix = pattern.slice(0, n).join('/')
		      break
		  }

		  var remain = pattern.slice(n)

		  // get the list of entries.
		  var read
		  if (prefix === null)
		    read = '.'
		  else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {
		    if (!prefix || !isAbsolute(prefix))
		      prefix = '/' + prefix
		    read = prefix
		  } else
		    read = prefix

		  var abs = this._makeAbs(read)

		  //if ignored, skip processing
		  if (childrenIgnored(this, read))
		    return

		  var isGlobStar = remain[0] === minimatch.GLOBSTAR
		  if (isGlobStar)
		    this._processGlobStar(prefix, read, abs, remain, index, inGlobStar)
		  else
		    this._processReaddir(prefix, read, abs, remain, index, inGlobStar)
		}


		GlobSync.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar) {
		  var entries = this._readdir(abs, inGlobStar)

		  // if the abs isn't a dir, then nothing can match!
		  if (!entries)
		    return

		  // It will only match dot entries if it starts with a dot, or if
		  // dot is set.  Stuff like @(.foo|.bar) isn't allowed.
		  var pn = remain[0]
		  var negate = !!this.minimatch.negate
		  var rawGlob = pn._glob
		  var dotOk = this.dot || rawGlob.charAt(0) === '.'

		  var matchedEntries = []
		  for (var i = 0; i < entries.length; i++) {
		    var e = entries[i]
		    if (e.charAt(0) !== '.' || dotOk) {
		      var m
		      if (negate && !prefix) {
		        m = !e.match(pn)
		      } else {
		        m = e.match(pn)
		      }
		      if (m)
		        matchedEntries.push(e)
		    }
		  }

		  var len = matchedEntries.length
		  // If there are no matched entries, then nothing matches.
		  if (len === 0)
		    return

		  // if this is the last remaining pattern bit, then no need for
		  // an additional stat *unless* the user has specified mark or
		  // stat explicitly.  We know they exist, since readdir returned
		  // them.

		  if (remain.length === 1 && !this.mark && !this.stat) {
		    if (!this.matches[index])
		      this.matches[index] = Object.create(null)

		    for (var i = 0; i < len; i ++) {
		      var e = matchedEntries[i]
		      if (prefix) {
		        if (prefix.slice(-1) !== '/')
		          e = prefix + '/' + e
		        else
		          e = prefix + e
		      }

		      if (e.charAt(0) === '/' && !this.nomount) {
		        e = path.join(this.root, e)
		      }
		      this.matches[index][e] = true
		    }
		    // This was the last one, and no stats were needed
		    return
		  }

		  // now test all matched entries as stand-ins for that part
		  // of the pattern.
		  remain.shift()
		  for (var i = 0; i < len; i ++) {
		    var e = matchedEntries[i]
		    var newPattern
		    if (prefix)
		      newPattern = [prefix, e]
		    else
		      newPattern = [e]
		    this._process(newPattern.concat(remain), index, inGlobStar)
		  }
		}


		GlobSync.prototype._emitMatch = function (index, e) {
		  var abs = this._makeAbs(e)
		  if (this.mark)
		    e = this._mark(e)

		  if (this.matches[index][e])
		    return

		  if (this.nodir) {
		    var c = this.cache[this._makeAbs(e)]
		    if (c === 'DIR' || Array.isArray(c))
		      return
		  }

		  this.matches[index][e] = true
		  if (this.stat)
		    this._stat(e)
		}


		GlobSync.prototype._readdirInGlobStar = function (abs) {
		  // follow all symlinked directories forever
		  // just proceed as if this is a non-globstar situation
		  if (this.follow)
		    return this._readdir(abs, false)

		  var entries
		  var lstat
		  var stat
		  try {
		    lstat = fs.lstatSync(abs)
		  } catch (er) {
		    // lstat failed, doesn't exist
		    return null
		  }

		  var isSym = lstat.isSymbolicLink()
		  this.symlinks[abs] = isSym

		  // If it's not a symlink or a dir, then it's definitely a regular file.
		  // don't bother doing a readdir in that case.
		  if (!isSym && !lstat.isDirectory())
		    this.cache[abs] = 'FILE'
		  else
		    entries = this._readdir(abs, false)

		  return entries
		}

		GlobSync.prototype._readdir = function (abs, inGlobStar) {
		  var entries

		  if (inGlobStar && !ownProp(this.symlinks, abs))
		    return this._readdirInGlobStar(abs)

		  if (ownProp(this.cache, abs)) {
		    var c = this.cache[abs]
		    if (!c || c === 'FILE')
		      return null

		    if (Array.isArray(c))
		      return c
		  }

		  try {
		    return this._readdirEntries(abs, fs.readdirSync(abs))
		  } catch (er) {
		    this._readdirError(abs, er)
		    return null
		  }
		}

		GlobSync.prototype._readdirEntries = function (abs, entries) {
		  // if we haven't asked to stat everything, then just
		  // assume that everything in there exists, so we can avoid
		  // having to stat it a second time.
		  if (!this.mark && !this.stat) {
		    for (var i = 0; i < entries.length; i ++) {
		      var e = entries[i]
		      if (abs === '/')
		        e = abs + e
		      else
		        e = abs + '/' + e
		      this.cache[e] = true
		    }
		  }

		  this.cache[abs] = entries

		  // mark and cache dir-ness
		  return entries
		}

		GlobSync.prototype._readdirError = function (f, er) {
		  // handle errors, and cache the information
		  switch (er.code) {
		    case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205
		    case 'ENOTDIR': // totally normal. means it *does* exist.
		      var abs = this._makeAbs(f)
		      this.cache[abs] = 'FILE'
		      if (abs === this.cwdAbs) {
		        var error = new Error(er.code + ' invalid cwd ' + this.cwd)
		        error.path = this.cwd
		        error.code = er.code
		        throw error
		      }
		      break

		    case 'ENOENT': // not terribly unusual
		    case 'ELOOP':
		    case 'ENAMETOOLONG':
		    case 'UNKNOWN':
		      this.cache[this._makeAbs(f)] = false
		      break

		    default: // some unusual error.  Treat as failure.
		      this.cache[this._makeAbs(f)] = false
		      if (this.strict)
		        throw er
		      if (!this.silent)
		        console.error('glob error', er)
		      break
		  }
		}

		GlobSync.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar) {

		  var entries = this._readdir(abs, inGlobStar)

		  // no entries means not a dir, so it can never have matches
		  // foo.txt/** doesn't match foo.txt
		  if (!entries)
		    return

		  // test without the globstar, and with every child both below
		  // and replacing the globstar.
		  var remainWithoutGlobStar = remain.slice(1)
		  var gspref = prefix ? [ prefix ] : []
		  var noGlobStar = gspref.concat(remainWithoutGlobStar)

		  // the noGlobStar pattern exits the inGlobStar state
		  this._process(noGlobStar, index, false)

		  var len = entries.length
		  var isSym = this.symlinks[abs]

		  // If it's a symlink, and we're in a globstar, then stop
		  if (isSym && inGlobStar)
		    return

		  for (var i = 0; i < len; i++) {
		    var e = entries[i]
		    if (e.charAt(0) === '.' && !this.dot)
		      continue

		    // these two cases enter the inGlobStar state
		    var instead = gspref.concat(entries[i], remainWithoutGlobStar)
		    this._process(instead, index, true)

		    var below = gspref.concat(entries[i], remain)
		    this._process(below, index, true)
		  }
		}

		GlobSync.prototype._processSimple = function (prefix, index) {
		  // XXX review this.  Shouldn't it be doing the mounting etc
		  // before doing stat?  kinda weird?
		  var exists = this._stat(prefix)

		  if (!this.matches[index])
		    this.matches[index] = Object.create(null)

		  // If it doesn't exist, then just mark the lack of results
		  if (!exists)
		    return

		  if (prefix && isAbsolute(prefix) && !this.nomount) {
		    var trail = /[\/\\]$/.test(prefix)
		    if (prefix.charAt(0) === '/') {
		      prefix = path.join(this.root, prefix)
		    } else {
		      prefix = path.resolve(this.root, prefix)
		      if (trail)
		        prefix += '/'
		    }
		  }

		  if (process.platform === 'win32')
		    prefix = prefix.replace(/\\/g, '/')

		  // Mark this as a match
		  this.matches[index][prefix] = true
		}

		// Returns either 'DIR', 'FILE', or false
		GlobSync.prototype._stat = function (f) {
		  var abs = this._makeAbs(f)
		  var needDir = f.slice(-1) === '/'

		  if (f.length > this.maxLength)
		    return false

		  if (!this.stat && ownProp(this.cache, abs)) {
		    var c = this.cache[abs]

		    if (Array.isArray(c))
		      c = 'DIR'

		    // It exists, but maybe not how we need it
		    if (!needDir || c === 'DIR')
		      return c

		    if (needDir && c === 'FILE')
		      return false

		    // otherwise we have to stat, because maybe c=true
		    // if we know it exists, but not what it is.
		  }

		  var exists
		  var stat = this.statCache[abs]
		  if (!stat) {
		    var lstat
		    try {
		      lstat = fs.lstatSync(abs)
		    } catch (er) {
		      return false
		    }

		    if (lstat.isSymbolicLink()) {
		      try {
		        stat = fs.statSync(abs)
		      } catch (er) {
		        stat = lstat
		      }
		    } else {
		      stat = lstat
		    }
		  }

		  this.statCache[abs] = stat

		  var c = stat.isDirectory() ? 'DIR' : 'FILE'
		  this.cache[abs] = this.cache[abs] || c

		  if (needDir && c !== 'DIR')
		    return false

		  return c
		}

		GlobSync.prototype._mark = function (p) {
		  return common.mark(this, p)
		}

		GlobSync.prototype._makeAbs = function (f) {
		  return common.makeAbs(this, f)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 625 */
	/***/ function(module, exports, __webpack_require__) {

		var hash = __webpack_require__(62);
		var utils = hash.utils;
		var assert = utils.assert;

		function BlockHash() {
		  this.pending = null;
		  this.pendingTotal = 0;
		  this.blockSize = this.constructor.blockSize;
		  this.outSize = this.constructor.outSize;
		  this.hmacStrength = this.constructor.hmacStrength;
		  this.padLength = this.constructor.padLength / 8;
		  this.endian = 'big';

		  this._delta8 = this.blockSize / 8;
		  this._delta32 = this.blockSize / 32;
		}
		exports.BlockHash = BlockHash;

		BlockHash.prototype.update = function update(msg, enc) {
		  // Convert message to array, pad it, and join into 32bit blocks
		  msg = utils.toArray(msg, enc);
		  if (!this.pending)
		    this.pending = msg;
		  else
		    this.pending = this.pending.concat(msg);
		  this.pendingTotal += msg.length;

		  // Enough data, try updating
		  if (this.pending.length >= this._delta8) {
		    msg = this.pending;

		    // Process pending data in blocks
		    var r = msg.length % this._delta8;
		    this.pending = msg.slice(msg.length - r, msg.length);
		    if (this.pending.length === 0)
		      this.pending = null;

		    msg = utils.join32(msg, 0, msg.length - r, this.endian);
		    for (var i = 0; i < msg.length; i += this._delta32)
		      this._update(msg, i, i + this._delta32);
		  }

		  return this;
		};

		BlockHash.prototype.digest = function digest(enc) {
		  this.update(this._pad());
		  assert(this.pending === null);

		  return this._digest(enc);
		};

		BlockHash.prototype._pad = function pad() {
		  var len = this.pendingTotal;
		  var bytes = this._delta8;
		  var k = bytes - ((len + this.padLength) % bytes);
		  var res = new Array(k + this.padLength);
		  res[0] = 0x80;
		  for (var i = 1; i < k; i++)
		    res[i] = 0;

		  // Append length
		  len <<= 3;
		  if (this.endian === 'big') {
		    for (var t = 8; t < this.padLength; t++)
		      res[i++] = 0;

		    res[i++] = 0;
		    res[i++] = 0;
		    res[i++] = 0;
		    res[i++] = 0;
		    res[i++] = (len >>> 24) & 0xff;
		    res[i++] = (len >>> 16) & 0xff;
		    res[i++] = (len >>> 8) & 0xff;
		    res[i++] = len & 0xff;
		  } else {
		    res[i++] = len & 0xff;
		    res[i++] = (len >>> 8) & 0xff;
		    res[i++] = (len >>> 16) & 0xff;
		    res[i++] = (len >>> 24) & 0xff;
		    res[i++] = 0;
		    res[i++] = 0;
		    res[i++] = 0;
		    res[i++] = 0;

		    for (var t = 8; t < this.padLength; t++)
		      res[i++] = 0;
		  }

		  return res;
		};


	/***/ },
	/* 626 */
	/***/ function(module, exports, __webpack_require__) {

		var hmac = exports;

		var hash = __webpack_require__(62);
		var utils = hash.utils;
		var assert = utils.assert;

		function Hmac(hash, key, enc) {
		  if (!(this instanceof Hmac))
		    return new Hmac(hash, key, enc);
		  this.Hash = hash;
		  this.blockSize = hash.blockSize / 8;
		  this.outSize = hash.outSize / 8;
		  this.inner = null;
		  this.outer = null;

		  this._init(utils.toArray(key, enc));
		}
		module.exports = Hmac;

		Hmac.prototype._init = function init(key) {
		  // Shorten key, if needed
		  if (key.length > this.blockSize)
		    key = new this.Hash().update(key).digest();
		  assert(key.length <= this.blockSize);

		  // Add padding to key
		  for (var i = key.length; i < this.blockSize; i++)
		    key.push(0);

		  for (var i = 0; i < key.length; i++)
		    key[i] ^= 0x36;
		  this.inner = new this.Hash().update(key);

		  // 0x36 ^ 0x5c = 0x6a
		  for (var i = 0; i < key.length; i++)
		    key[i] ^= 0x6a;
		  this.outer = new this.Hash().update(key);
		};

		Hmac.prototype.update = function update(msg, enc) {
		  this.inner.update(msg, enc);
		  return this;
		};

		Hmac.prototype.digest = function digest(enc) {
		  this.outer.update(this.inner.digest());
		  return this.outer.digest(enc);
		};


	/***/ },
	/* 627 */
	/***/ function(module, exports, __webpack_require__) {

		var hash = __webpack_require__(62);
		var utils = hash.utils;

		var rotl32 = utils.rotl32;
		var sum32 = utils.sum32;
		var sum32_3 = utils.sum32_3;
		var sum32_4 = utils.sum32_4;
		var BlockHash = hash.common.BlockHash;

		function RIPEMD160() {
		  if (!(this instanceof RIPEMD160))
		    return new RIPEMD160();

		  BlockHash.call(this);

		  this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];
		  this.endian = 'little';
		}
		utils.inherits(RIPEMD160, BlockHash);
		exports.ripemd160 = RIPEMD160;

		RIPEMD160.blockSize = 512;
		RIPEMD160.outSize = 160;
		RIPEMD160.hmacStrength = 192;
		RIPEMD160.padLength = 64;

		RIPEMD160.prototype._update = function update(msg, start) {
		  var A = this.h[0];
		  var B = this.h[1];
		  var C = this.h[2];
		  var D = this.h[3];
		  var E = this.h[4];
		  var Ah = A;
		  var Bh = B;
		  var Ch = C;
		  var Dh = D;
		  var Eh = E;
		  for (var j = 0; j < 80; j++) {
		    var T = sum32(
		      rotl32(
		        sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),
		        s[j]),
		      E);
		    A = E;
		    E = D;
		    D = rotl32(C, 10);
		    C = B;
		    B = T;
		    T = sum32(
		      rotl32(
		        sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),
		        sh[j]),
		      Eh);
		    Ah = Eh;
		    Eh = Dh;
		    Dh = rotl32(Ch, 10);
		    Ch = Bh;
		    Bh = T;
		  }
		  T = sum32_3(this.h[1], C, Dh);
		  this.h[1] = sum32_3(this.h[2], D, Eh);
		  this.h[2] = sum32_3(this.h[3], E, Ah);
		  this.h[3] = sum32_3(this.h[4], A, Bh);
		  this.h[4] = sum32_3(this.h[0], B, Ch);
		  this.h[0] = T;
		};

		RIPEMD160.prototype._digest = function digest(enc) {
		  if (enc === 'hex')
		    return utils.toHex32(this.h, 'little');
		  else
		    return utils.split32(this.h, 'little');
		};

		function f(j, x, y, z) {
		  if (j <= 15)
		    return x ^ y ^ z;
		  else if (j <= 31)
		    return (x & y) | ((~x) & z);
		  else if (j <= 47)
		    return (x | (~y)) ^ z;
		  else if (j <= 63)
		    return (x & z) | (y & (~z));
		  else
		    return x ^ (y | (~z));
		}

		function K(j) {
		  if (j <= 15)
		    return 0x00000000;
		  else if (j <= 31)
		    return 0x5a827999;
		  else if (j <= 47)
		    return 0x6ed9eba1;
		  else if (j <= 63)
		    return 0x8f1bbcdc;
		  else
		    return 0xa953fd4e;
		}

		function Kh(j) {
		  if (j <= 15)
		    return 0x50a28be6;
		  else if (j <= 31)
		    return 0x5c4dd124;
		  else if (j <= 47)
		    return 0x6d703ef3;
		  else if (j <= 63)
		    return 0x7a6d76e9;
		  else
		    return 0x00000000;
		}

		var r = [
		  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 rh = [
		  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 s = [
		  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 sh = [
		  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
		];


	/***/ },
	/* 628 */
	/***/ function(module, exports, __webpack_require__) {

		var hash = __webpack_require__(62);
		var utils = hash.utils;
		var assert = utils.assert;

		var rotr32 = utils.rotr32;
		var rotl32 = utils.rotl32;
		var sum32 = utils.sum32;
		var sum32_4 = utils.sum32_4;
		var sum32_5 = utils.sum32_5;
		var rotr64_hi = utils.rotr64_hi;
		var rotr64_lo = utils.rotr64_lo;
		var shr64_hi = utils.shr64_hi;
		var shr64_lo = utils.shr64_lo;
		var sum64 = utils.sum64;
		var sum64_hi = utils.sum64_hi;
		var sum64_lo = utils.sum64_lo;
		var sum64_4_hi = utils.sum64_4_hi;
		var sum64_4_lo = utils.sum64_4_lo;
		var sum64_5_hi = utils.sum64_5_hi;
		var sum64_5_lo = utils.sum64_5_lo;
		var BlockHash = hash.common.BlockHash;

		var sha256_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 sha512_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 sha1_K = [
		  0x5A827999, 0x6ED9EBA1,
		  0x8F1BBCDC, 0xCA62C1D6
		];

		function SHA256() {
		  if (!(this instanceof SHA256))
		    return new SHA256();

		  BlockHash.call(this);
		  this.h = [ 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
		             0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 ];
		  this.k = sha256_K;
		  this.W = new Array(64);
		}
		utils.inherits(SHA256, BlockHash);
		exports.sha256 = SHA256;

		SHA256.blockSize = 512;
		SHA256.outSize = 256;
		SHA256.hmacStrength = 192;
		SHA256.padLength = 64;

		SHA256.prototype._update = function _update(msg, start) {
		  var W = this.W;

		  for (var i = 0; i < 16; i++)
		    W[i] = msg[start + i];
		  for (; i < W.length; i++)
		    W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);

		  var a = this.h[0];
		  var b = this.h[1];
		  var c = this.h[2];
		  var d = this.h[3];
		  var e = this.h[4];
		  var f = this.h[5];
		  var g = this.h[6];
		  var h = this.h[7];

		  assert(this.k.length === W.length);
		  for (var i = 0; i < W.length; i++) {
		    var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);
		    var T2 = sum32(s0_256(a), maj32(a, b, c));
		    h = g;
		    g = f;
		    f = e;
		    e = sum32(d, T1);
		    d = c;
		    c = b;
		    b = a;
		    a = sum32(T1, T2);
		  }

		  this.h[0] = sum32(this.h[0], a);
		  this.h[1] = sum32(this.h[1], b);
		  this.h[2] = sum32(this.h[2], c);
		  this.h[3] = sum32(this.h[3], d);
		  this.h[4] = sum32(this.h[4], e);
		  this.h[5] = sum32(this.h[5], f);
		  this.h[6] = sum32(this.h[6], g);
		  this.h[7] = sum32(this.h[7], h);
		};

		SHA256.prototype._digest = function digest(enc) {
		  if (enc === 'hex')
		    return utils.toHex32(this.h, 'big');
		  else
		    return utils.split32(this.h, 'big');
		};

		function SHA224() {
		  if (!(this instanceof SHA224))
		    return new SHA224();

		  SHA256.call(this);
		  this.h = [ 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,
		             0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];
		}
		utils.inherits(SHA224, SHA256);
		exports.sha224 = SHA224;

		SHA224.blockSize = 512;
		SHA224.outSize = 224;
		SHA224.hmacStrength = 192;
		SHA224.padLength = 64;

		SHA224.prototype._digest = function digest(enc) {
		  // Just truncate output
		  if (enc === 'hex')
		    return utils.toHex32(this.h.slice(0, 7), 'big');
		  else
		    return utils.split32(this.h.slice(0, 7), 'big');
		};

		function SHA512() {
		  if (!(this instanceof SHA512))
		    return new SHA512();

		  BlockHash.call(this);
		  this.h = [ 0x6a09e667, 0xf3bcc908,
		             0xbb67ae85, 0x84caa73b,
		             0x3c6ef372, 0xfe94f82b,
		             0xa54ff53a, 0x5f1d36f1,
		             0x510e527f, 0xade682d1,
		             0x9b05688c, 0x2b3e6c1f,
		             0x1f83d9ab, 0xfb41bd6b,
		             0x5be0cd19, 0x137e2179 ];
		  this.k = sha512_K;
		  this.W = new Array(160);
		}
		utils.inherits(SHA512, BlockHash);
		exports.sha512 = SHA512;

		SHA512.blockSize = 1024;
		SHA512.outSize = 512;
		SHA512.hmacStrength = 192;
		SHA512.padLength = 128;

		SHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {
		  var W = this.W;

		  // 32 x 32bit words
		  for (var i = 0; i < 32; i++)
		    W[i] = msg[start + i];
		  for (; i < W.length; i += 2) {
		    var c0_hi = g1_512_hi(W[i - 4], W[i - 3]);  // i - 2
		    var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);
		    var c1_hi = W[i - 14];  // i - 7
		    var c1_lo = W[i - 13];
		    var c2_hi = g0_512_hi(W[i - 30], W[i - 29]);  // i - 15
		    var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);
		    var c3_hi = W[i - 32];  // i - 16
		    var c3_lo = W[i - 31];

		    W[i] = sum64_4_hi(c0_hi, c0_lo,
		                      c1_hi, c1_lo,
		                      c2_hi, c2_lo,
		                      c3_hi, c3_lo);
		    W[i + 1] = sum64_4_lo(c0_hi, c0_lo,
		                          c1_hi, c1_lo,
		                          c2_hi, c2_lo,
		                          c3_hi, c3_lo);
		  }
		};

		SHA512.prototype._update = function _update(msg, start) {
		  this._prepareBlock(msg, start);

		  var W = this.W;

		  var ah = this.h[0];
		  var al = this.h[1];
		  var bh = this.h[2];
		  var bl = this.h[3];
		  var ch = this.h[4];
		  var cl = this.h[5];
		  var dh = this.h[6];
		  var dl = this.h[7];
		  var eh = this.h[8];
		  var el = this.h[9];
		  var fh = this.h[10];
		  var fl = this.h[11];
		  var gh = this.h[12];
		  var gl = this.h[13];
		  var hh = this.h[14];
		  var hl = this.h[15];

		  assert(this.k.length === W.length);
		  for (var i = 0; i < W.length; i += 2) {
		    var c0_hi = hh;
		    var c0_lo = hl;
		    var c1_hi = s1_512_hi(eh, el);
		    var c1_lo = s1_512_lo(eh, el);
		    var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);
		    var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);
		    var c3_hi = this.k[i];
		    var c3_lo = this.k[i + 1];
		    var c4_hi = W[i];
		    var c4_lo = W[i + 1];

		    var T1_hi = sum64_5_hi(c0_hi, c0_lo,
		                           c1_hi, c1_lo,
		                           c2_hi, c2_lo,
		                           c3_hi, c3_lo,
		                           c4_hi, c4_lo);
		    var T1_lo = sum64_5_lo(c0_hi, c0_lo,
		                           c1_hi, c1_lo,
		                           c2_hi, c2_lo,
		                           c3_hi, c3_lo,
		                           c4_hi, c4_lo);

		    var c0_hi = s0_512_hi(ah, al);
		    var c0_lo = s0_512_lo(ah, al);
		    var c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);
		    var c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);

		    var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);
		    var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);

		    hh = gh;
		    hl = gl;

		    gh = fh;
		    gl = fl;

		    fh = eh;
		    fl = el;

		    eh = sum64_hi(dh, dl, T1_hi, T1_lo);
		    el = sum64_lo(dl, dl, T1_hi, T1_lo);

		    dh = ch;
		    dl = cl;

		    ch = bh;
		    cl = bl;

		    bh = ah;
		    bl = al;

		    ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);
		    al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);
		  }

		  sum64(this.h, 0, ah, al);
		  sum64(this.h, 2, bh, bl);
		  sum64(this.h, 4, ch, cl);
		  sum64(this.h, 6, dh, dl);
		  sum64(this.h, 8, eh, el);
		  sum64(this.h, 10, fh, fl);
		  sum64(this.h, 12, gh, gl);
		  sum64(this.h, 14, hh, hl);
		};

		SHA512.prototype._digest = function digest(enc) {
		  if (enc === 'hex')
		    return utils.toHex32(this.h, 'big');
		  else
		    return utils.split32(this.h, 'big');
		};

		function SHA384() {
		  if (!(this instanceof SHA384))
		    return new SHA384();

		  SHA512.call(this);
		  this.h = [ 0xcbbb9d5d, 0xc1059ed8,
		             0x629a292a, 0x367cd507,
		             0x9159015a, 0x3070dd17,
		             0x152fecd8, 0xf70e5939,
		             0x67332667, 0xffc00b31,
		             0x8eb44a87, 0x68581511,
		             0xdb0c2e0d, 0x64f98fa7,
		             0x47b5481d, 0xbefa4fa4 ];
		}
		utils.inherits(SHA384, SHA512);
		exports.sha384 = SHA384;

		SHA384.blockSize = 1024;
		SHA384.outSize = 384;
		SHA384.hmacStrength = 192;
		SHA384.padLength = 128;

		SHA384.prototype._digest = function digest(enc) {
		  if (enc === 'hex')
		    return utils.toHex32(this.h.slice(0, 12), 'big');
		  else
		    return utils.split32(this.h.slice(0, 12), 'big');
		};

		function SHA1() {
		  if (!(this instanceof SHA1))
		    return new SHA1();

		  BlockHash.call(this);
		  this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe,
		             0x10325476, 0xc3d2e1f0 ];
		  this.W = new Array(80);
		}

		utils.inherits(SHA1, BlockHash);
		exports.sha1 = SHA1;

		SHA1.blockSize = 512;
		SHA1.outSize = 160;
		SHA1.hmacStrength = 80;
		SHA1.padLength = 64;

		SHA1.prototype._update = function _update(msg, start) {
		  var W = this.W;

		  for (var i = 0; i < 16; i++)
		    W[i] = msg[start + i];

		  for(; i < W.length; i++)
		    W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);

		  var a = this.h[0];
		  var b = this.h[1];
		  var c = this.h[2];
		  var d = this.h[3];
		  var e = this.h[4];

		  for (var i = 0; i < W.length; i++) {
		    var s = ~~(i / 20);
		    var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);
		    e = d;
		    d = c;
		    c = rotl32(b, 30);
		    b = a;
		    a = t;
		  }

		  this.h[0] = sum32(this.h[0], a);
		  this.h[1] = sum32(this.h[1], b);
		  this.h[2] = sum32(this.h[2], c);
		  this.h[3] = sum32(this.h[3], d);
		  this.h[4] = sum32(this.h[4], e);
		};

		SHA1.prototype._digest = function digest(enc) {
		  if (enc === 'hex')
		    return utils.toHex32(this.h, 'big');
		  else
		    return utils.split32(this.h, 'big');
		};

		function ch32(x, y, z) {
		  return (x & y) ^ ((~x) & z);
		}

		function maj32(x, y, z) {
		  return (x & y) ^ (x & z) ^ (y & z);
		}

		function p32(x, y, z) {
		  return x ^ y ^ z;
		}

		function s0_256(x) {
		  return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);
		}

		function s1_256(x) {
		  return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);
		}

		function g0_256(x) {
		  return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);
		}

		function g1_256(x) {
		  return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);
		}

		function ft_1(s, x, y, z) {
		  if (s === 0)
		    return ch32(x, y, z);
		  if (s === 1 || s === 3)
		    return p32(x, y, z);
		  if (s === 2)
		    return maj32(x, y, z);
		}

		function ch64_hi(xh, xl, yh, yl, zh, zl) {
		  var r = (xh & yh) ^ ((~xh) & zh);
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function ch64_lo(xh, xl, yh, yl, zh, zl) {
		  var r = (xl & yl) ^ ((~xl) & zl);
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function maj64_hi(xh, xl, yh, yl, zh, zl) {
		  var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function maj64_lo(xh, xl, yh, yl, zh, zl) {
		  var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function s0_512_hi(xh, xl) {
		  var c0_hi = rotr64_hi(xh, xl, 28);
		  var c1_hi = rotr64_hi(xl, xh, 2);  // 34
		  var c2_hi = rotr64_hi(xl, xh, 7);  // 39

		  var r = c0_hi ^ c1_hi ^ c2_hi;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function s0_512_lo(xh, xl) {
		  var c0_lo = rotr64_lo(xh, xl, 28);
		  var c1_lo = rotr64_lo(xl, xh, 2);  // 34
		  var c2_lo = rotr64_lo(xl, xh, 7);  // 39

		  var r = c0_lo ^ c1_lo ^ c2_lo;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function s1_512_hi(xh, xl) {
		  var c0_hi = rotr64_hi(xh, xl, 14);
		  var c1_hi = rotr64_hi(xh, xl, 18);
		  var c2_hi = rotr64_hi(xl, xh, 9);  // 41

		  var r = c0_hi ^ c1_hi ^ c2_hi;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function s1_512_lo(xh, xl) {
		  var c0_lo = rotr64_lo(xh, xl, 14);
		  var c1_lo = rotr64_lo(xh, xl, 18);
		  var c2_lo = rotr64_lo(xl, xh, 9);  // 41

		  var r = c0_lo ^ c1_lo ^ c2_lo;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function g0_512_hi(xh, xl) {
		  var c0_hi = rotr64_hi(xh, xl, 1);
		  var c1_hi = rotr64_hi(xh, xl, 8);
		  var c2_hi = shr64_hi(xh, xl, 7);

		  var r = c0_hi ^ c1_hi ^ c2_hi;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function g0_512_lo(xh, xl) {
		  var c0_lo = rotr64_lo(xh, xl, 1);
		  var c1_lo = rotr64_lo(xh, xl, 8);
		  var c2_lo = shr64_lo(xh, xl, 7);

		  var r = c0_lo ^ c1_lo ^ c2_lo;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function g1_512_hi(xh, xl) {
		  var c0_hi = rotr64_hi(xh, xl, 19);
		  var c1_hi = rotr64_hi(xl, xh, 29);  // 61
		  var c2_hi = shr64_hi(xh, xl, 6);

		  var r = c0_hi ^ c1_hi ^ c2_hi;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}

		function g1_512_lo(xh, xl) {
		  var c0_lo = rotr64_lo(xh, xl, 19);
		  var c1_lo = rotr64_lo(xl, xh, 29);  // 61
		  var c2_lo = shr64_lo(xh, xl, 6);

		  var r = c0_lo ^ c1_lo ^ c2_lo;
		  if (r < 0)
		    r += 0x100000000;
		  return r;
		}


	/***/ },
	/* 629 */
	/***/ function(module, exports, __webpack_require__) {

		var utils = exports;
		var inherits = __webpack_require__(2);

		function toArray(msg, enc) {
		  if (Array.isArray(msg))
		    return msg.slice();
		  if (!msg)
		    return [];
		  var res = [];
		  if (typeof msg === 'string') {
		    if (!enc) {
		      for (var i = 0; i < msg.length; i++) {
		        var c = msg.charCodeAt(i);
		        var hi = c >> 8;
		        var lo = c & 0xff;
		        if (hi)
		          res.push(hi, lo);
		        else
		          res.push(lo);
		      }
		    } else if (enc === 'hex') {
		      msg = msg.replace(/[^a-z0-9]+/ig, '');
		      if (msg.length % 2 !== 0)
		        msg = '0' + msg;
		      for (var i = 0; i < msg.length; i += 2)
		        res.push(parseInt(msg[i] + msg[i + 1], 16));
		    }
		  } else {
		    for (var i = 0; i < msg.length; i++)
		      res[i] = msg[i] | 0;
		  }
		  return res;
		}
		utils.toArray = toArray;

		function toHex(msg) {
		  var res = '';
		  for (var i = 0; i < msg.length; i++)
		    res += zero2(msg[i].toString(16));
		  return res;
		}
		utils.toHex = toHex;

		function htonl(w) {
		  var res = (w >>> 24) |
		            ((w >>> 8) & 0xff00) |
		            ((w << 8) & 0xff0000) |
		            ((w & 0xff) << 24);
		  return res >>> 0;
		}
		utils.htonl = htonl;

		function toHex32(msg, endian) {
		  var res = '';
		  for (var i = 0; i < msg.length; i++) {
		    var w = msg[i];
		    if (endian === 'little')
		      w = htonl(w);
		    res += zero8(w.toString(16));
		  }
		  return res;
		}
		utils.toHex32 = toHex32;

		function zero2(word) {
		  if (word.length === 1)
		    return '0' + word;
		  else
		    return word;
		}
		utils.zero2 = zero2;

		function zero8(word) {
		  if (word.length === 7)
		    return '0' + word;
		  else if (word.length === 6)
		    return '00' + word;
		  else if (word.length === 5)
		    return '000' + word;
		  else if (word.length === 4)
		    return '0000' + word;
		  else if (word.length === 3)
		    return '00000' + word;
		  else if (word.length === 2)
		    return '000000' + word;
		  else if (word.length === 1)
		    return '0000000' + word;
		  else
		    return word;
		}
		utils.zero8 = zero8;

		function join32(msg, start, end, endian) {
		  var len = end - start;
		  assert(len % 4 === 0);
		  var res = new Array(len / 4);
		  for (var i = 0, k = start; i < res.length; i++, k += 4) {
		    var w;
		    if (endian === 'big')
		      w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];
		    else
		      w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];
		    res[i] = w >>> 0;
		  }
		  return res;
		}
		utils.join32 = join32;

		function split32(msg, endian) {
		  var res = new Array(msg.length * 4);
		  for (var i = 0, k = 0; i < msg.length; i++, k += 4) {
		    var m = msg[i];
		    if (endian === 'big') {
		      res[k] = m >>> 24;
		      res[k + 1] = (m >>> 16) & 0xff;
		      res[k + 2] = (m >>> 8) & 0xff;
		      res[k + 3] = m & 0xff;
		    } else {
		      res[k + 3] = m >>> 24;
		      res[k + 2] = (m >>> 16) & 0xff;
		      res[k + 1] = (m >>> 8) & 0xff;
		      res[k] = m & 0xff;
		    }
		  }
		  return res;
		}
		utils.split32 = split32;

		function rotr32(w, b) {
		  return (w >>> b) | (w << (32 - b));
		}
		utils.rotr32 = rotr32;

		function rotl32(w, b) {
		  return (w << b) | (w >>> (32 - b));
		}
		utils.rotl32 = rotl32;

		function sum32(a, b) {
		  return (a + b) >>> 0;
		}
		utils.sum32 = sum32;

		function sum32_3(a, b, c) {
		  return (a + b + c) >>> 0;
		}
		utils.sum32_3 = sum32_3;

		function sum32_4(a, b, c, d) {
		  return (a + b + c + d) >>> 0;
		}
		utils.sum32_4 = sum32_4;

		function sum32_5(a, b, c, d, e) {
		  return (a + b + c + d + e) >>> 0;
		}
		utils.sum32_5 = sum32_5;

		function assert(cond, msg) {
		  if (!cond)
		    throw new Error(msg || 'Assertion failed');
		}
		utils.assert = assert;

		utils.inherits = inherits;

		function sum64(buf, pos, ah, al) {
		  var bh = buf[pos];
		  var bl = buf[pos + 1];

		  var lo = (al + bl) >>> 0;
		  var hi = (lo < al ? 1 : 0) + ah + bh;
		  buf[pos] = hi >>> 0;
		  buf[pos + 1] = lo;
		}
		exports.sum64 = sum64;

		function sum64_hi(ah, al, bh, bl) {
		  var lo = (al + bl) >>> 0;
		  var hi = (lo < al ? 1 : 0) + ah + bh;
		  return hi >>> 0;
		};
		exports.sum64_hi = sum64_hi;

		function sum64_lo(ah, al, bh, bl) {
		  var lo = al + bl;
		  return lo >>> 0;
		};
		exports.sum64_lo = sum64_lo;

		function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {
		  var carry = 0;
		  var lo = al;
		  lo = (lo + bl) >>> 0;
		  carry += lo < al ? 1 : 0;
		  lo = (lo + cl) >>> 0;
		  carry += lo < cl ? 1 : 0;
		  lo = (lo + dl) >>> 0;
		  carry += lo < dl ? 1 : 0;

		  var hi = ah + bh + ch + dh + carry;
		  return hi >>> 0;
		};
		exports.sum64_4_hi = sum64_4_hi;

		function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {
		  var lo = al + bl + cl + dl;
		  return lo >>> 0;
		};
		exports.sum64_4_lo = sum64_4_lo;

		function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {
		  var carry = 0;
		  var lo = al;
		  lo = (lo + bl) >>> 0;
		  carry += lo < al ? 1 : 0;
		  lo = (lo + cl) >>> 0;
		  carry += lo < cl ? 1 : 0;
		  lo = (lo + dl) >>> 0;
		  carry += lo < dl ? 1 : 0;
		  lo = (lo + el) >>> 0;
		  carry += lo < el ? 1 : 0;

		  var hi = ah + bh + ch + dh + eh + carry;
		  return hi >>> 0;
		};
		exports.sum64_5_hi = sum64_5_hi;

		function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {
		  var lo = al + bl + cl + dl + el;

		  return lo >>> 0;
		};
		exports.sum64_5_lo = sum64_5_lo;

		function rotr64_hi(ah, al, num) {
		  var r = (al << (32 - num)) | (ah >>> num);
		  return r >>> 0;
		};
		exports.rotr64_hi = rotr64_hi;

		function rotr64_lo(ah, al, num) {
		  var r = (ah << (32 - num)) | (al >>> num);
		  return r >>> 0;
		};
		exports.rotr64_lo = rotr64_lo;

		function shr64_hi(ah, al, num) {
		  return ah >>> num;
		};
		exports.shr64_hi = shr64_hi;

		function shr64_lo(ah, al, num) {
		  var r = (ah << (32 - num)) | (al >>> num);
		  return r >>> 0;
		};
		exports.shr64_lo = shr64_lo;


	/***/ },
	/* 630 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(631);


	/***/ },
	/* 631 */
	/***/ function(module, exports, __webpack_require__) {

		var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;// Generated by CoffeeScript 1.8.0
		(function() {
		  var Heap, defaultCmp, floor, heapify, heappop, heappush, heappushpop, heapreplace, insort, min, nlargest, nsmallest, updateItem, _siftdown, _siftup;

		  floor = Math.floor, min = Math.min;


		  /*
		  Default comparison function to be used
		   */

		  defaultCmp = function(x, y) {
		    if (x < y) {
		      return -1;
		    }
		    if (x > y) {
		      return 1;
		    }
		    return 0;
		  };


		  /*
		  Insert item x in list a, and keep it sorted assuming a is sorted.
		  
		  If x is already in a, insert it to the right of the rightmost x.
		  
		  Optional args lo (default 0) and hi (default a.length) bound the slice
		  of a to be searched.
		   */

		  insort = function(a, x, lo, hi, cmp) {
		    var mid;
		    if (lo == null) {
		      lo = 0;
		    }
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    if (lo < 0) {
		      throw new Error('lo must be non-negative');
		    }
		    if (hi == null) {
		      hi = a.length;
		    }
		    while (lo < hi) {
		      mid = floor((lo + hi) / 2);
		      if (cmp(x, a[mid]) < 0) {
		        hi = mid;
		      } else {
		        lo = mid + 1;
		      }
		    }
		    return ([].splice.apply(a, [lo, lo - lo].concat(x)), x);
		  };


		  /*
		  Push item onto heap, maintaining the heap invariant.
		   */

		  heappush = function(array, item, cmp) {
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    array.push(item);
		    return _siftdown(array, 0, array.length - 1, cmp);
		  };


		  /*
		  Pop the smallest item off the heap, maintaining the heap invariant.
		   */

		  heappop = function(array, cmp) {
		    var lastelt, returnitem;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    lastelt = array.pop();
		    if (array.length) {
		      returnitem = array[0];
		      array[0] = lastelt;
		      _siftup(array, 0, cmp);
		    } else {
		      returnitem = lastelt;
		    }
		    return returnitem;
		  };


		  /*
		  Pop and return the current smallest value, and add the new item.
		  
		  This is more efficient than heappop() followed by heappush(), and can be
		  more appropriate when using a fixed size heap. Note that the value
		  returned may be larger than item! That constrains reasonable use of
		  this routine unless written as part of a conditional replacement:
		      if item > array[0]
		        item = heapreplace(array, item)
		   */

		  heapreplace = function(array, item, cmp) {
		    var returnitem;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    returnitem = array[0];
		    array[0] = item;
		    _siftup(array, 0, cmp);
		    return returnitem;
		  };


		  /*
		  Fast version of a heappush followed by a heappop.
		   */

		  heappushpop = function(array, item, cmp) {
		    var _ref;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    if (array.length && cmp(array[0], item) < 0) {
		      _ref = [array[0], item], item = _ref[0], array[0] = _ref[1];
		      _siftup(array, 0, cmp);
		    }
		    return item;
		  };


		  /*
		  Transform list into a heap, in-place, in O(array.length) time.
		   */

		  heapify = function(array, cmp) {
		    var i, _i, _j, _len, _ref, _ref1, _results, _results1;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    _ref1 = (function() {
		      _results1 = [];
		      for (var _j = 0, _ref = floor(array.length / 2); 0 <= _ref ? _j < _ref : _j > _ref; 0 <= _ref ? _j++ : _j--){ _results1.push(_j); }
		      return _results1;
		    }).apply(this).reverse();
		    _results = [];
		    for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
		      i = _ref1[_i];
		      _results.push(_siftup(array, i, cmp));
		    }
		    return _results;
		  };


		  /*
		  Update the position of the given item in the heap.
		  This function should be called every time the item is being modified.
		   */

		  updateItem = function(array, item, cmp) {
		    var pos;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    pos = array.indexOf(item);
		    if (pos === -1) {
		      return;
		    }
		    _siftdown(array, 0, pos, cmp);
		    return _siftup(array, pos, cmp);
		  };


		  /*
		  Find the n largest elements in a dataset.
		   */

		  nlargest = function(array, n, cmp) {
		    var elem, result, _i, _len, _ref;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    result = array.slice(0, n);
		    if (!result.length) {
		      return result;
		    }
		    heapify(result, cmp);
		    _ref = array.slice(n);
		    for (_i = 0, _len = _ref.length; _i < _len; _i++) {
		      elem = _ref[_i];
		      heappushpop(result, elem, cmp);
		    }
		    return result.sort(cmp).reverse();
		  };


		  /*
		  Find the n smallest elements in a dataset.
		   */

		  nsmallest = function(array, n, cmp) {
		    var elem, i, los, result, _i, _j, _len, _ref, _ref1, _results;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    if (n * 10 <= array.length) {
		      result = array.slice(0, n).sort(cmp);
		      if (!result.length) {
		        return result;
		      }
		      los = result[result.length - 1];
		      _ref = array.slice(n);
		      for (_i = 0, _len = _ref.length; _i < _len; _i++) {
		        elem = _ref[_i];
		        if (cmp(elem, los) < 0) {
		          insort(result, elem, 0, null, cmp);
		          result.pop();
		          los = result[result.length - 1];
		        }
		      }
		      return result;
		    }
		    heapify(array, cmp);
		    _results = [];
		    for (i = _j = 0, _ref1 = min(n, array.length); 0 <= _ref1 ? _j < _ref1 : _j > _ref1; i = 0 <= _ref1 ? ++_j : --_j) {
		      _results.push(heappop(array, cmp));
		    }
		    return _results;
		  };

		  _siftdown = function(array, startpos, pos, cmp) {
		    var newitem, parent, parentpos;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    newitem = array[pos];
		    while (pos > startpos) {
		      parentpos = (pos - 1) >> 1;
		      parent = array[parentpos];
		      if (cmp(newitem, parent) < 0) {
		        array[pos] = parent;
		        pos = parentpos;
		        continue;
		      }
		      break;
		    }
		    return array[pos] = newitem;
		  };

		  _siftup = function(array, pos, cmp) {
		    var childpos, endpos, newitem, rightpos, startpos;
		    if (cmp == null) {
		      cmp = defaultCmp;
		    }
		    endpos = array.length;
		    startpos = pos;
		    newitem = array[pos];
		    childpos = 2 * pos + 1;
		    while (childpos < endpos) {
		      rightpos = childpos + 1;
		      if (rightpos < endpos && !(cmp(array[childpos], array[rightpos]) < 0)) {
		        childpos = rightpos;
		      }
		      array[pos] = array[childpos];
		      pos = childpos;
		      childpos = 2 * pos + 1;
		    }
		    array[pos] = newitem;
		    return _siftdown(array, startpos, pos, cmp);
		  };

		  Heap = (function() {
		    Heap.push = heappush;

		    Heap.pop = heappop;

		    Heap.replace = heapreplace;

		    Heap.pushpop = heappushpop;

		    Heap.heapify = heapify;

		    Heap.updateItem = updateItem;

		    Heap.nlargest = nlargest;

		    Heap.nsmallest = nsmallest;

		    function Heap(cmp) {
		      this.cmp = cmp != null ? cmp : defaultCmp;
		      this.nodes = [];
		    }

		    Heap.prototype.push = function(x) {
		      return heappush(this.nodes, x, this.cmp);
		    };

		    Heap.prototype.pop = function() {
		      return heappop(this.nodes, this.cmp);
		    };

		    Heap.prototype.peek = function() {
		      return this.nodes[0];
		    };

		    Heap.prototype.contains = function(x) {
		      return this.nodes.indexOf(x) !== -1;
		    };

		    Heap.prototype.replace = function(x) {
		      return heapreplace(this.nodes, x, this.cmp);
		    };

		    Heap.prototype.pushpop = function(x) {
		      return heappushpop(this.nodes, x, this.cmp);
		    };

		    Heap.prototype.heapify = function() {
		      return heapify(this.nodes, this.cmp);
		    };

		    Heap.prototype.updateItem = function(x) {
		      return updateItem(this.nodes, x, this.cmp);
		    };

		    Heap.prototype.clear = function() {
		      return this.nodes = [];
		    };

		    Heap.prototype.empty = function() {
		      return this.nodes.length === 0;
		    };

		    Heap.prototype.size = function() {
		      return this.nodes.length;
		    };

		    Heap.prototype.clone = function() {
		      var heap;
		      heap = new Heap();
		      heap.nodes = this.nodes.slice(0);
		      return heap;
		    };

		    Heap.prototype.toArray = function() {
		      return this.nodes.slice(0);
		    };

		    Heap.prototype.insert = Heap.prototype.push;

		    Heap.prototype.top = Heap.prototype.peek;

		    Heap.prototype.front = Heap.prototype.peek;

		    Heap.prototype.has = Heap.prototype.contains;

		    Heap.prototype.copy = Heap.prototype.clone;

		    return Heap;

		  })();

		  (function(root, factory) {
		    if (true) {
		      return !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_FACTORY__ = (factory), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
		    } else if (typeof exports === 'object') {
		      return module.exports = factory();
		    } else {
		      return root.Heap = factory();
		    }
		  })(this, function() {
		    return Heap;
		  });

		}).call(this);


	/***/ },
	/* 632 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global) {var hasOwn = Object.prototype.hasOwnProperty;

		/**
		 * A very simple polyfill for Map with limited functionality
		 * that only works for integer keys.
		 */
		function IntMap() {
		    this.map = {};
		    this.size = 0;
		}

		IntMap.prototype.set = function set(key, value) {
		    if (this.has(key)) {
		        this.map[key] = value;
		    }
		    else {
		        this.map[key] = value;
		        this.size++;
		    }
		    return this;
		};

		IntMap.prototype.get = function get(key) {
		    return this.map[key];
		};

		IntMap.prototype.delete = function intMapDelete(key) {
		    var deleted = this.has(key);
		    if (deleted) {
		        delete this.map[key];
		        this.size--;
		    }
		    return deleted;
		};

		IntMap.prototype.has = function has(key) {
		    return hasOwn.call(this.map, key);
		};

		IntMap.prototype.forEach = function forEach(f, thisArg) {
		    for (var key in this.map) {
		        f.call(thisArg, this.map[key], key, this);
		    }
		};

		if (global.Map === void 0) {
		    module.exports = IntMap;
		}
		else {
		    module.exports = global.Map;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 633 */
	/***/ function(module, exports) {

		function Queue() {
		    this._in = [];
		    this._out = [];
		    this.length = 0;
		}

		/*
		 * Enqueue all elements of a list in order. Equivalent to
		 *   list.forEach(queue.enqueue.bind(queue));
		 */
		Queue.prototype.enqueueAll = function enqueueList(list) {
		    this._in = this._in.concat(list);
		    this.length += list.length;
		};

		Queue.prototype.enqueue = function enqueue(item) {
		    this._in.push(item);
		    this.length++;
		};

		Queue.prototype.dequeue = function dequeue() {
		    if (this._out.length) {
		        this.length--;
		        return this._out.pop();
		    }
		    else if (this._in.length) {
		        this._out = this._in.reverse();
		        this._in = [];
		        this.length--;
		        return this._out.pop();
		    }
		    else {
		        return undefined;
		    }
		};

		Queue.prototype.clear = function clear() {
		    this._out = [];
		    this._in = [];
		    this.length = 0;
		};

		Queue.prototype.toArray = function toArray() {
		    var res = [];
		    res = res.concat(this._out);
		    res.reverse();
		    res = res.concat(this._in);
		    return res;
		};

		Queue.prototype.toString = function toString() {
		    return this.toArray().toString();
		};

		module.exports = Queue;


	/***/ },
	/* 634 */
	/***/ function(module, exports, __webpack_require__) {

		var hpack = __webpack_require__(75);
		var utils = hpack.utils;
		var encoder = hpack.encoder;
		var table = hpack.table;
		var assert = utils.assert;

		var inherits = __webpack_require__(2);
		var Duplex = __webpack_require__(255).Duplex;

		function Compressor(options) {
		  Duplex.call(this, {
		    writableObjectMode: true
		  });

		  this._encoder = null;
		  this._table = table.create(options.table);
		}
		inherits(Compressor, Duplex);
		module.exports = Compressor;

		Compressor.create = function create(options) {
		  return new Compressor(options);
		};

		Compressor.prototype._read = function _read() {
		  // We only push!
		};

		Compressor.prototype._write = function _write(data, enc, cb) {
		  assert(Array.isArray(data), 'Compressor.write() expects list of headers');

		  this._encoder = encoder.create();
		  for (var i = 0; i < data.length; i++)
		    this._encodeHeader(data[i]);

		  var data = this._encoder.render();
		  this._encoder = null;

		  cb(null);
		  for (var i = 0; i < data.length; i++)
		    this.push(data[i]);
		};

		Compressor.prototype.updateTableSize = function updateTableSize(size) {
		  this._table.updateSize(size);
		};

		Compressor.prototype.reset = function reset() {
		  var enc = encoder.create();
		  var size = this._table.size;

		  // indexed = 0
		  // incremental = 0
		  // update = 1
		  enc.encodeBits(1, 3);
		  enc.encodeInt(0);

		  // Evict everything
		  this.updateTableSize(0);

		  // indexed = 0
		  // incremental = 0
		  // update = 1
		  enc.encodeBits(1, 3);
		  enc.encodeInt(size);

		  // Revert size
		  this.updateTableSize(size);

		  var data = enc.render();
		  for (var i = 0; i < data.length; i++)
		    this.push(data[i]);
		};

		Compressor.prototype._encodeHeader = function _encodeHeader(header) {
		  if (header.neverIndex) {
		    var index = 0;
		    var neverIndex = 1;
		    var isIndexed = 0;
		    var isIncremental = 0;
		  } else {
		    var index = this._table.reverseLookup(header.name, header.value);
		    var isIndexed = index > 0;
		    var isIncremental = header.incremental !== false;
		    var neverIndex = 0;
		  }

		  this._encoder.encodeBit(isIndexed);
		  if (isIndexed) {
		    this._encoder.encodeInt(index);
		    return;
		  }

		  var name = utils.toArray(header.name);
		  var value = utils.toArray(header.value);

		  this._encoder.encodeBit(isIncremental);
		  if (isIncremental) {
		    this._table.add(header.name, header.value, name.length, value.length);
		  } else {
		    // Update = false
		    this._encoder.encodeBit(0);
		    this._encoder.encodeBit(neverIndex);
		  }

		  // index is negative for `name`-only headers
		  this._encoder.encodeInt(-index);
		  if (index === 0)
		    this._encoder.encodeStr(name, header.huffman !== false);
		  this._encoder.encodeStr(value, header.huffman !== false);
		};


	/***/ },
	/* 635 */
	/***/ function(module, exports, __webpack_require__) {

		var hpack = __webpack_require__(75);
		var utils = hpack.utils;
		var huffman = hpack.huffman.decode;
		var assert = utils.assert;

		var OffsetBuffer = __webpack_require__(124);

		function Decoder() {
		  this.buffer = new OffsetBuffer();
		  this.bitOffset = 0;

		  // Used internally in decodeStr
		  this._huffmanNode = null;
		}
		module.exports = Decoder;

		Decoder.create = function create() {
		  return new Decoder();
		};

		Decoder.prototype.isEmpty = function isEmpty() {
		  return this.buffer.isEmpty();
		};

		Decoder.prototype.push = function push(chunk) {
		  this.buffer.push(chunk);
		};

		Decoder.prototype.decodeBit = function decodeBit() {
		  // Need at least one octet
		  assert(this.buffer.has(1), 'Buffer too small for an int');

		  var octet;
		  var offset = this.bitOffset;

		  if (++this.bitOffset === 8) {
		    octet = this.buffer.readUInt8();
		    this.bitOffset = 0;
		  } else {
		    octet = this.buffer.peekUInt8();
		  }
		  return (octet >>> (7 - offset)) & 1;
		};

		// Just for testing
		Decoder.prototype.skipBits = function skipBits(n) {
		  this.bitOffset += n;
		  this.buffer.skip(this.bitOffset >> 3);
		  this.bitOffset &= 0x7;
		};

		Decoder.prototype.decodeInt = function decodeInt() {
		  // Need at least one octet
		  assert(this.buffer.has(1), 'Buffer too small for an int');

		  var prefix = 8 - this.bitOffset;

		  // We are going to end up octet-aligned
		  this.bitOffset = 0;

		  var max = (1 << prefix) - 1;
		  var octet = this.buffer.readUInt8() & max;

		  // Fast case - int fits into the prefix
		  if (octet !== max)
		    return octet;

		  // TODO(indutny): what about > 32bit numbers?
		  var res = 0;
		  var isLast = false;
		  var len = 0;
		  do {
		    octet = this.buffer.readUInt8();
		    isLast = (octet & 0x80) === 0;

		    res <<= 7;
		    res |= octet & 0x7f;
		    len++;
		  } while (!isLast);
		  assert(isLast, 'Incomplete data for multi-octet integer');
		  assert(len <= 4, 'Integer does not fit into 32 bits');

		  // Reverse bits
		  res = (res >>> 21) |
		        (((res >> 14) & 0x7f) << 7) |
		        (((res >> 7) & 0x7f) << 14) |
		        ((res & 0x7f) << 21);
		  res >>= (4 - len) * 7;

		  // Append prefix max
		  res += max;

		  return res;
		};

		Decoder.prototype.decodeHuffmanWord = function decodeHuffmanWord(input,
		                                                                 inputBits,
		                                                                 out) {
		  var root = huffman;
		  var node = this._huffmanNode;
		  var word = input;
		  var bits = inputBits;

		  for (; bits > 0; word &= (1 << bits) - 1) {
		    // Nudge the word bit length to match it
		    for (var i = Math.max(0, bits - 8); i < bits; i++) {
		      var subnode = node[word >>> i];
		      if (typeof subnode !== 'number') {
		        node = subnode;
		        bits = i;
		        break;
		      }

		      if (subnode === 0)
		        continue;

		      // Word bit length should match
		      if ((subnode >>> 9) !== bits - i) {
		        subnode = 0;
		        continue;
		      }

		      var octet = subnode & 0x1ff;
		      assert(octet !== 256, 'EOS in encoding');
		      out.push(octet);
		      node = root;

		      bits = i;
		      break;
		    }
		    if (subnode === 0)
		      break;
		  }
		  this._huffmanNode = node;

		  return bits;
		};

		Decoder.prototype.decodeStr = function decodeStr() {
		  var isHuffman = this.decodeBit();
		  var len = this.decodeInt();
		  assert(this.buffer.has(len), 'Not enough octets for string');

		  if (!isHuffman)
		    return this.buffer.take(len);

		  this._huffmanNode = huffman;

		  var out = [];

		  var word = 0;
		  var bits = 0;
		  var lastKey = 0;
		  for (var i = 0; i < len; i++) {
		    word <<= 8;
		    word |= this.buffer.readUInt8();
		    bits += 8;

		    bits = this.decodeHuffmanWord(word, bits, out);
		    lastKey = word >> bits;
		    word &= (1 << bits) - 1;
		  }
		  assert(this._huffmanNode === huffman, '8-bit EOS');
		  assert(word + 1 === (1 << bits), 'Final sequence is not EOS');

		  this._huffmanNode = null;

		  return out;
		};


	/***/ },
	/* 636 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var hpack = __webpack_require__(75);
		var utils = hpack.utils;
		var decoder = hpack.decoder;
		var table = hpack.table;
		var assert = utils.assert;

		var inherits = __webpack_require__(2);
		var Duplex = __webpack_require__(255).Duplex;

		function Decompressor(options) {
		  Duplex.call(this, {
		    readableObjectMode: true
		  });

		  this._decoder = decoder.create();
		  this._table = table.create(options.table);
		}
		inherits(Decompressor, Duplex);
		module.exports = Decompressor;

		Decompressor.create = function create(options) {
		  return new Decompressor(options);
		};

		Decompressor.prototype._read = function _read() {
		  // We only push!
		};

		Decompressor.prototype._write = function _write(data, enc, cb) {
		  this._decoder.push(data);

		  cb(null);
		};

		Decompressor.prototype.execute = function execute(cb) {
		  while (!this._decoder.isEmpty()) {
		    try {
		      this._execute();
		    } catch (err) {
		      if (cb)
		        return done(err);
		      else
		        return this.emit('error', err);
		    }
		  }

		  if (cb)
		    done(null);

		  function done(err) {
		    process.nextTick(function() {
		      cb(err);
		    });
		  }
		};

		Decompressor.prototype.updateTableSize = function updateTableSize(size) {
		  this._table.updateSize(size);
		};

		Decompressor.prototype._execute = function _execute() {
		  var isIndexed = this._decoder.decodeBit();
		  if (isIndexed)
		    return this._processIndexed();

		  var isIncremental = this._decoder.decodeBit();
		  var neverIndex = 0;
		  if (!isIncremental) {
		    var isUpdate = this._decoder.decodeBit();
		    if (isUpdate)
		      return this._processUpdate();

		    neverIndex = this._decoder.decodeBit();
		  }

		  this._processLiteral(isIncremental, neverIndex);
		};

		Decompressor.prototype._processIndexed = function _processIndexed() {
		  var index = this._decoder.decodeInt();

		  var lookup = this._table.lookup(index);
		  this.push({ name: lookup.name, value: lookup.value, neverIndex: false });
		};

		Decompressor.prototype._processLiteral = function _processLiteral(inc, never) {
		  var index = this._decoder.decodeInt();

		  var name;
		  var nameSize;

		  // Literal header-name too
		  if (index === 0) {
		    name = this._decoder.decodeStr();
		    nameSize = name.length;
		    name = utils.stringify(name);
		  } else {
		    var lookup = this._table.lookup(index);
		    nameSize = lookup.nameSize;
		    name = lookup.name;
		  }

		  var value = this._decoder.decodeStr();
		  var valueSize = value.length;
		  value = utils.stringify(value);

		  if (inc)
		    this._table.add(name, value, nameSize, valueSize);

		  this.push({ name: name, value: value, neverIndex: never !== 0});
		};

		Decompressor.prototype._processUpdate = function _processUpdate() {
		  var size = this._decoder.decodeInt();
		  this.updateTableSize(size);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 637 */
	/***/ function(module, exports, __webpack_require__) {

		var hpack = __webpack_require__(75);
		var utils = hpack.utils;
		var huffman = hpack.huffman.encode;
		var assert = utils.assert;

		var WBuf = __webpack_require__(181);

		function Encoder() {
		  this.buffer = new WBuf();
		  this.word = 0;
		  this.bitOffset = 0;
		}
		module.exports = Encoder;

		Encoder.create = function create() {
		  return new Encoder();
		};

		Encoder.prototype.render = function render() {
		  return this.buffer.render();
		};

		Encoder.prototype.encodeBit = function encodeBit(bit) {
		  var octet;

		  this.word <<= 1;
		  this.word |= bit;
		  this.bitOffset++;

		  if (this.bitOffset === 8) {
		    this.buffer.writeUInt8(this.word);
		    this.word = 0;
		    this.bitOffset = 0;
		  }
		};

		Encoder.prototype.encodeBits = function encodeBits(bits, len) {
		  var left = bits;
		  var leftLen = len;

		  while (leftLen > 0) {
		    var avail = Math.min(leftLen, 8 - this.bitOffset);
		    var toWrite = left >>> (leftLen - avail);

		    if (avail === 8) {
		      this.buffer.writeUInt8(toWrite);
		    } else {
		      this.word <<= avail;
		      this.word |= toWrite;
		      this.bitOffset += avail;
		      if (this.bitOffset === 8) {
		        this.buffer.writeUInt8(this.word);
		        this.word = 0;
		        this.bitOffset = 0;
		      }
		    }

		    leftLen -= avail;
		    left &= (1 << leftLen) - 1;
		  }
		};

		// Just for testing
		Encoder.prototype.skipBits = function skipBits(num) {
		  this.bitOffset += num;
		  this.buffer.skip(this.bitOffset >> 3);
		  this.bitOffset &= 0x7;
		};

		Encoder.prototype.encodeInt = function encodeInt(num) {
		  var prefix = 8 - this.bitOffset;

		  // We are going to end up octet-aligned
		  this.bitOffset = 0;

		  var max = (1 << prefix) - 1;

		  // Fast case - int fits into the prefix
		  if (num < max) {
		    this.buffer.writeUInt8((this.word << prefix) | num);
		    return octet;
		  }

		  var left = num - max;
		  this.buffer.writeUInt8((this.word << prefix) | max);
		  do {
		    var octet = left & 0x7f;
		    left >>= 7;
		    if (left !== 0)
		      octet |= 0x80;

		    this.buffer.writeUInt8(octet);
		  } while (left !== 0);
		};

		Encoder.prototype.encodeStr = function encodeStr(value, isHuffman) {
		  this.encodeBit(isHuffman ? 1 : 0);

		  if (!isHuffman) {
		    this.buffer.reserve(value.length + 1);
		    this.encodeInt(value.length);
		    for (var i = 0; i < value.length; i++)
		      this.buffer.writeUInt8(value[i]);
		    return;
		  }

		  var codes = [];
		  var len = 0;
		  var pad = 0;

		  for (var i = 0; i < value.length; i++) {
		    var code = huffman[value[i]];
		    codes.push(code);
		    len += code[0];
		  }
		  if (len % 8 !== 0)
		    pad = 8 - (len % 8);
		  len += pad;

		  this.buffer.reserve((len / 8) + 1);
		  this.encodeInt(len / 8);
		  for (var i = 0; i < codes.length; i++) {
		    var code = codes[i];
		    this.encodeBits(code[1], code[0]);
		  }

		  // Append padding
		  this.encodeBits(0xff >>> (8 - pad), pad);
		};


	/***/ },
	/* 638 */
	/***/ function(module, exports) {

		exports.decode =
		    [2608,2609,2610,2657,2659,2661,2665,2671,2675,2676,0,0,0,0,0,0,0,0,0,0,
		    3104,3109,3117,3118,3119,3123,3124,3125,3126,3127,3128,3129,3133,3137,3167,
		    3170,3172,3174,3175,3176,3180,3181,3182,3184,3186,3189,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    3642,3650,3651,3652,3653,3654,3655,3656,3657,3658,3659,3660,3661,3662,3663,
		    3664,3665,3666,3667,3668,3669,3670,3671,3673,3690,3691,3697,3702,3703,3704,
		    3705,3706,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4134,4138,4140,4155,4184,4186,[1057,
		    1058,1064,1065,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
		    [1087,0,1575,1579,1660,0,0,0,0,0,2083,2110,0,0,0,0,0,0,0,0,0,0,0,0,2560,
		    2596,2624,2651,2653,2686,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,3166,3197,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3644,
		    3680,3707,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[1628,1731,1744,0,0,0,2176,2178,
		    2179,2210,2232,2242,2272,2274,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2713,2721,2727,
		    2732,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0],[2736,2737,2739,2769,2776,2777,2787,2789,2790,0,0,0,0,0,0,0,0,0,
		    3201,3204,3205,3206,3208,3218,3226,3228,3232,3235,3236,3241,3242,3245,3250,
		    3253,3257,3258,3259,3261,3262,3268,3270,3300,3304,3305,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3585,
		    3719,3721,3722,3723,3724,3725,3727,3731,3733,3734,3735,3736,3739,3741,3742,
		    3749,3750,3752,3758,3759,3764,3766,3767,3772,3775,3781,3815,3823,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,4105,4238,4240,4241,4244,4255,4267,4302,4311,4321,4332,4333,[711,719,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[746,747,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[1216,1217,
		    1224,1225,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
		    [1226,1229,1234,1237,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0],[1242,1243,1262,1264,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0],[1266,1267,1279,0,0,0,1739,1740,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0],[1747,1748,1750,1757,1758,1759,1777,1780,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[1781,1782,1783,1784,1786,
		    1787,1788,1789,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[1790,0,
		    2050,2051,2052,2053,2054,2055,2056,2059,2060,2062,2063,2064,2065,2066,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[2067,2068,2069,2071,2072,2073,2074,2075,
		    2076,2077,2078,2079,2175,2268,2297,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3082,3085,3094,3328,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
		    0,0,0,0,0]]]];
		exports.encode =
		    [[13,8184],[23,8388568],[28,268435426],[28,268435427],[28,268435428],[28,
		    268435429],[28,268435430],[28,268435431],[28,268435432],[24,16777194],[30,
		    1073741820],[28,268435433],[28,268435434],[30,1073741821],[28,268435435],
		    [28,268435436],[28,268435437],[28,268435438],[28,268435439],[28,268435440],
		    [28,268435441],[28,268435442],[30,1073741822],[28,268435443],[28,
		    268435444],[28,268435445],[28,268435446],[28,268435447],[28,268435448],[28,
		    268435449],[28,268435450],[28,268435451],[6,20],[10,1016],[10,1017],[12,
		    4090],[13,8185],[6,21],[8,248],[11,2042],[10,1018],[10,1019],[8,249],[11,
		    2043],[8,250],[6,22],[6,23],[6,24],[5,0],[5,1],[5,2],[6,25],[6,26],[6,27],
		    [6,28],[6,29],[6,30],[6,31],[7,92],[8,251],[15,32764],[6,32],[12,4091],[10,
		    1020],[13,8186],[6,33],[7,93],[7,94],[7,95],[7,96],[7,97],[7,98],[7,99],[7,
		    100],[7,101],[7,102],[7,103],[7,104],[7,105],[7,106],[7,107],[7,108],[7,
		    109],[7,110],[7,111],[7,112],[7,113],[7,114],[8,252],[7,115],[8,253],[13,
		    8187],[19,524272],[13,8188],[14,16380],[6,34],[15,32765],[5,3],[6,35],[5,
		    4],[6,36],[5,5],[6,37],[6,38],[6,39],[5,6],[7,116],[7,117],[6,40],[6,41],
		    [6,42],[5,7],[6,43],[7,118],[6,44],[5,8],[5,9],[6,45],[7,119],[7,120],[7,
		    121],[7,122],[7,123],[15,32766],[11,2044],[14,16381],[13,8189],[28,
		    268435452],[20,1048550],[22,4194258],[20,1048551],[20,1048552],[22,
		    4194259],[22,4194260],[22,4194261],[23,8388569],[22,4194262],[23,8388570],
		    [23,8388571],[23,8388572],[23,8388573],[23,8388574],[24,16777195],[23,
		    8388575],[24,16777196],[24,16777197],[22,4194263],[23,8388576],[24,
		    16777198],[23,8388577],[23,8388578],[23,8388579],[23,8388580],[21,2097116],
		    [22,4194264],[23,8388581],[22,4194265],[23,8388582],[23,8388583],[24,
		    16777199],[22,4194266],[21,2097117],[20,1048553],[22,4194267],[22,4194268],
		    [23,8388584],[23,8388585],[21,2097118],[23,8388586],[22,4194269],[22,
		    4194270],[24,16777200],[21,2097119],[22,4194271],[23,8388587],[23,8388588],
		    [21,2097120],[21,2097121],[22,4194272],[21,2097122],[23,8388589],[22,
		    4194273],[23,8388590],[23,8388591],[20,1048554],[22,4194274],[22,4194275],
		    [22,4194276],[23,8388592],[22,4194277],[22,4194278],[23,8388593],[26,
		    67108832],[26,67108833],[20,1048555],[19,524273],[22,4194279],[23,8388594],
		    [22,4194280],[25,33554412],[26,67108834],[26,67108835],[26,67108836],[27,
		    134217694],[27,134217695],[26,67108837],[24,16777201],[25,33554413],[19,
		    524274],[21,2097123],[26,67108838],[27,134217696],[27,134217697],[26,
		    67108839],[27,134217698],[24,16777202],[21,2097124],[21,2097125],[26,
		    67108840],[26,67108841],[28,268435453],[27,134217699],[27,134217700],[27,
		    134217701],[20,1048556],[24,16777203],[20,1048557],[21,2097126],[22,
		    4194281],[21,2097127],[21,2097128],[23,8388595],[22,4194282],[22,4194283],
		    [25,33554414],[25,33554415],[24,16777204],[24,16777205],[26,67108842],[23,
		    8388596],[26,67108843],[27,134217702],[26,67108844],[26,67108845],[27,
		    134217703],[27,134217704],[27,134217705],[27,134217706],[27,134217707],[28,
		    268435454],[27,134217708],[27,134217709],[27,134217710],[27,134217711],[27,
		    134217712],[26,67108846],[30,1073741823]];


	/***/ },
	/* 639 */
	/***/ function(module, exports) {

		exports.table = [
		  {
		    "name": ":authority",
		    "value": "",
		    "nameSize": 10,
		    "totalSize": 42
		  },
		  {
		    "name": ":method",
		    "value": "GET",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":method",
		    "value": "POST",
		    "nameSize": 7,
		    "totalSize": 43
		  },
		  {
		    "name": ":path",
		    "value": "/",
		    "nameSize": 5,
		    "totalSize": 38
		  },
		  {
		    "name": ":path",
		    "value": "/index.html",
		    "nameSize": 5,
		    "totalSize": 48
		  },
		  {
		    "name": ":scheme",
		    "value": "http",
		    "nameSize": 7,
		    "totalSize": 43
		  },
		  {
		    "name": ":scheme",
		    "value": "https",
		    "nameSize": 7,
		    "totalSize": 44
		  },
		  {
		    "name": ":status",
		    "value": "200",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":status",
		    "value": "204",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":status",
		    "value": "206",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":status",
		    "value": "304",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":status",
		    "value": "400",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":status",
		    "value": "404",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": ":status",
		    "value": "500",
		    "nameSize": 7,
		    "totalSize": 42
		  },
		  {
		    "name": "accept-charset",
		    "value": "",
		    "nameSize": 14,
		    "totalSize": 46
		  },
		  {
		    "name": "accept-encoding",
		    "value": "gzip, deflate",
		    "nameSize": 15,
		    "totalSize": 60
		  },
		  {
		    "name": "accept-language",
		    "value": "",
		    "nameSize": 15,
		    "totalSize": 47
		  },
		  {
		    "name": "accept-ranges",
		    "value": "",
		    "nameSize": 13,
		    "totalSize": 45
		  },
		  {
		    "name": "accept",
		    "value": "",
		    "nameSize": 6,
		    "totalSize": 38
		  },
		  {
		    "name": "access-control-allow-origin",
		    "value": "",
		    "nameSize": 27,
		    "totalSize": 59
		  },
		  {
		    "name": "age",
		    "value": "",
		    "nameSize": 3,
		    "totalSize": 35
		  },
		  {
		    "name": "allow",
		    "value": "",
		    "nameSize": 5,
		    "totalSize": 37
		  },
		  {
		    "name": "authorization",
		    "value": "",
		    "nameSize": 13,
		    "totalSize": 45
		  },
		  {
		    "name": "cache-control",
		    "value": "",
		    "nameSize": 13,
		    "totalSize": 45
		  },
		  {
		    "name": "content-disposition",
		    "value": "",
		    "nameSize": 19,
		    "totalSize": 51
		  },
		  {
		    "name": "content-encoding",
		    "value": "",
		    "nameSize": 16,
		    "totalSize": 48
		  },
		  {
		    "name": "content-language",
		    "value": "",
		    "nameSize": 16,
		    "totalSize": 48
		  },
		  {
		    "name": "content-length",
		    "value": "",
		    "nameSize": 14,
		    "totalSize": 46
		  },
		  {
		    "name": "content-location",
		    "value": "",
		    "nameSize": 16,
		    "totalSize": 48
		  },
		  {
		    "name": "content-range",
		    "value": "",
		    "nameSize": 13,
		    "totalSize": 45
		  },
		  {
		    "name": "content-type",
		    "value": "",
		    "nameSize": 12,
		    "totalSize": 44
		  },
		  {
		    "name": "cookie",
		    "value": "",
		    "nameSize": 6,
		    "totalSize": 38
		  },
		  {
		    "name": "date",
		    "value": "",
		    "nameSize": 4,
		    "totalSize": 36
		  },
		  {
		    "name": "etag",
		    "value": "",
		    "nameSize": 4,
		    "totalSize": 36
		  },
		  {
		    "name": "expect",
		    "value": "",
		    "nameSize": 6,
		    "totalSize": 38
		  },
		  {
		    "name": "expires",
		    "value": "",
		    "nameSize": 7,
		    "totalSize": 39
		  },
		  {
		    "name": "from",
		    "value": "",
		    "nameSize": 4,
		    "totalSize": 36
		  },
		  {
		    "name": "host",
		    "value": "",
		    "nameSize": 4,
		    "totalSize": 36
		  },
		  {
		    "name": "if-match",
		    "value": "",
		    "nameSize": 8,
		    "totalSize": 40
		  },
		  {
		    "name": "if-modified-since",
		    "value": "",
		    "nameSize": 17,
		    "totalSize": 49
		  },
		  {
		    "name": "if-none-match",
		    "value": "",
		    "nameSize": 13,
		    "totalSize": 45
		  },
		  {
		    "name": "if-range",
		    "value": "",
		    "nameSize": 8,
		    "totalSize": 40
		  },
		  {
		    "name": "if-unmodified-since",
		    "value": "",
		    "nameSize": 19,
		    "totalSize": 51
		  },
		  {
		    "name": "last-modified",
		    "value": "",
		    "nameSize": 13,
		    "totalSize": 45
		  },
		  {
		    "name": "link",
		    "value": "",
		    "nameSize": 4,
		    "totalSize": 36
		  },
		  {
		    "name": "location",
		    "value": "",
		    "nameSize": 8,
		    "totalSize": 40
		  },
		  {
		    "name": "max-forwards",
		    "value": "",
		    "nameSize": 12,
		    "totalSize": 44
		  },
		  {
		    "name": "proxy-authenticate",
		    "value": "",
		    "nameSize": 18,
		    "totalSize": 50
		  },
		  {
		    "name": "proxy-authorization",
		    "value": "",
		    "nameSize": 19,
		    "totalSize": 51
		  },
		  {
		    "name": "range",
		    "value": "",
		    "nameSize": 5,
		    "totalSize": 37
		  },
		  {
		    "name": "referer",
		    "value": "",
		    "nameSize": 7,
		    "totalSize": 39
		  },
		  {
		    "name": "refresh",
		    "value": "",
		    "nameSize": 7,
		    "totalSize": 39
		  },
		  {
		    "name": "retry-after",
		    "value": "",
		    "nameSize": 11,
		    "totalSize": 43
		  },
		  {
		    "name": "server",
		    "value": "",
		    "nameSize": 6,
		    "totalSize": 38
		  },
		  {
		    "name": "set-cookie",
		    "value": "",
		    "nameSize": 10,
		    "totalSize": 42
		  },
		  {
		    "name": "strict-transport-security",
		    "value": "",
		    "nameSize": 25,
		    "totalSize": 57
		  },
		  {
		    "name": "transfer-encoding",
		    "value": "",
		    "nameSize": 17,
		    "totalSize": 49
		  },
		  {
		    "name": "user-agent",
		    "value": "",
		    "nameSize": 10,
		    "totalSize": 42
		  },
		  {
		    "name": "vary",
		    "value": "",
		    "nameSize": 4,
		    "totalSize": 36
		  },
		  {
		    "name": "via",
		    "value": "",
		    "nameSize": 3,
		    "totalSize": 35
		  },
		  {
		    "name": "www-authenticate",
		    "value": "",
		    "nameSize": 16,
		    "totalSize": 48
		  }
		];
		exports.map = {
		  ":authority": {
		    "index": 1,
		    "values": {
		      "": 1
		    }
		  },
		  ":method": {
		    "index": 2,
		    "values": {
		      "GET": 2,
		      "POST": 3
		    }
		  },
		  ":path": {
		    "index": 4,
		    "values": {
		      "/": 4,
		      "/index.html": 5
		    }
		  },
		  ":scheme": {
		    "index": 6,
		    "values": {
		      "http": 6,
		      "https": 7
		    }
		  },
		  ":status": {
		    "index": 8,
		    "values": {
		      "200": 8,
		      "204": 9,
		      "206": 10,
		      "304": 11,
		      "400": 12,
		      "404": 13,
		      "500": 14
		    }
		  },
		  "accept-charset": {
		    "index": 15,
		    "values": {
		      "": 15
		    }
		  },
		  "accept-encoding": {
		    "index": 16,
		    "values": {
		      "gzip, deflate": 16
		    }
		  },
		  "accept-language": {
		    "index": 17,
		    "values": {
		      "": 17
		    }
		  },
		  "accept-ranges": {
		    "index": 18,
		    "values": {
		      "": 18
		    }
		  },
		  "accept": {
		    "index": 19,
		    "values": {
		      "": 19
		    }
		  },
		  "access-control-allow-origin": {
		    "index": 20,
		    "values": {
		      "": 20
		    }
		  },
		  "age": {
		    "index": 21,
		    "values": {
		      "": 21
		    }
		  },
		  "allow": {
		    "index": 22,
		    "values": {
		      "": 22
		    }
		  },
		  "authorization": {
		    "index": 23,
		    "values": {
		      "": 23
		    }
		  },
		  "cache-control": {
		    "index": 24,
		    "values": {
		      "": 24
		    }
		  },
		  "content-disposition": {
		    "index": 25,
		    "values": {
		      "": 25
		    }
		  },
		  "content-encoding": {
		    "index": 26,
		    "values": {
		      "": 26
		    }
		  },
		  "content-language": {
		    "index": 27,
		    "values": {
		      "": 27
		    }
		  },
		  "content-length": {
		    "index": 28,
		    "values": {
		      "": 28
		    }
		  },
		  "content-location": {
		    "index": 29,
		    "values": {
		      "": 29
		    }
		  },
		  "content-range": {
		    "index": 30,
		    "values": {
		      "": 30
		    }
		  },
		  "content-type": {
		    "index": 31,
		    "values": {
		      "": 31
		    }
		  },
		  "cookie": {
		    "index": 32,
		    "values": {
		      "": 32
		    }
		  },
		  "date": {
		    "index": 33,
		    "values": {
		      "": 33
		    }
		  },
		  "etag": {
		    "index": 34,
		    "values": {
		      "": 34
		    }
		  },
		  "expect": {
		    "index": 35,
		    "values": {
		      "": 35
		    }
		  },
		  "expires": {
		    "index": 36,
		    "values": {
		      "": 36
		    }
		  },
		  "from": {
		    "index": 37,
		    "values": {
		      "": 37
		    }
		  },
		  "host": {
		    "index": 38,
		    "values": {
		      "": 38
		    }
		  },
		  "if-match": {
		    "index": 39,
		    "values": {
		      "": 39
		    }
		  },
		  "if-modified-since": {
		    "index": 40,
		    "values": {
		      "": 40
		    }
		  },
		  "if-none-match": {
		    "index": 41,
		    "values": {
		      "": 41
		    }
		  },
		  "if-range": {
		    "index": 42,
		    "values": {
		      "": 42
		    }
		  },
		  "if-unmodified-since": {
		    "index": 43,
		    "values": {
		      "": 43
		    }
		  },
		  "last-modified": {
		    "index": 44,
		    "values": {
		      "": 44
		    }
		  },
		  "link": {
		    "index": 45,
		    "values": {
		      "": 45
		    }
		  },
		  "location": {
		    "index": 46,
		    "values": {
		      "": 46
		    }
		  },
		  "max-forwards": {
		    "index": 47,
		    "values": {
		      "": 47
		    }
		  },
		  "proxy-authenticate": {
		    "index": 48,
		    "values": {
		      "": 48
		    }
		  },
		  "proxy-authorization": {
		    "index": 49,
		    "values": {
		      "": 49
		    }
		  },
		  "range": {
		    "index": 50,
		    "values": {
		      "": 50
		    }
		  },
		  "referer": {
		    "index": 51,
		    "values": {
		      "": 51
		    }
		  },
		  "refresh": {
		    "index": 52,
		    "values": {
		      "": 52
		    }
		  },
		  "retry-after": {
		    "index": 53,
		    "values": {
		      "": 53
		    }
		  },
		  "server": {
		    "index": 54,
		    "values": {
		      "": 54
		    }
		  },
		  "set-cookie": {
		    "index": 55,
		    "values": {
		      "": 55
		    }
		  },
		  "strict-transport-security": {
		    "index": 56,
		    "values": {
		      "": 56
		    }
		  },
		  "transfer-encoding": {
		    "index": 57,
		    "values": {
		      "": 57
		    }
		  },
		  "user-agent": {
		    "index": 58,
		    "values": {
		      "": 58
		    }
		  },
		  "vary": {
		    "index": 59,
		    "values": {
		      "": 59
		    }
		  },
		  "via": {
		    "index": 60,
		    "values": {
		      "": 60
		    }
		  },
		  "www-authenticate": {
		    "index": 61,
		    "values": {
		      "": 61
		    }
		  }
		};


	/***/ },
	/* 640 */
	/***/ function(module, exports, __webpack_require__) {

		var hpack = __webpack_require__(75);
		var utils = hpack.utils;
		var assert = utils.assert;

		function Table(options) {
		  this['static'] = hpack['static-table'];
		  this.dynamic = [];
		  this.size = 0;
		  this.maxSize = 0;
		  this.length = this['static'].table.length;
		  this.protocolMaxSize = options.maxSize;
		  this.maxSize = this.protocolMaxSize;
		  this.lookupDepth = options.lookupDepth || 32;
		}
		module.exports = Table;

		Table.create = function create(options) {
		  return new Table(options);
		};

		Table.prototype.lookup = function lookup(index) {
		  assert(index !== 0, 'Zero indexed field');
		  assert(index <= this.length, 'Indexed field OOB')

		  if (index <= this['static'].table.length)
		    return this['static'].table[index - 1];
		  else
		    return this.dynamic[this.length - index];
		};

		Table.prototype.reverseLookup = function reverseLookup(name, value) {
		  var staticEntry = this['static'].map[name];
		  if (staticEntry && staticEntry.values[value])
		    return staticEntry.values[value];

		  // Reverse search dynamic table (new items are at the end of it)
		  var limit = Math.max(0, this.dynamic.length - this.lookupDepth);
		  for (var i = this.dynamic.length - 1; i >= limit; i--) {
		    var entry = this.dynamic[i];
		    if (entry.name === name && entry.value === value)
		      return this.length - i;

		    if (entry.name === name) {
		      // Prefer smaller index
		      if (staticEntry)
		        break;
		      return -(this.length - i);
		    }
		  }

		  if (staticEntry)
		    return -staticEntry.index;

		  return 0;
		};

		Table.prototype.add = function add(name, value, nameSize, valueSize) {
		  var totalSize = nameSize + valueSize + 32;

		  this.dynamic.push({
		    name: name,
		    value: value,
		    nameSize: nameSize,
		    totalSize: totalSize
		  });
		  this.size += totalSize;
		  this.length++;

		  this.evict();
		};

		Table.prototype.evict = function evict() {
		  while (this.size > this.maxSize) {
		    var entry = this.dynamic.shift();
		    this.size -= entry.totalSize;
		    this.length--;
		  }
		  assert(this.size >= 0, 'Table size sanity check failed');
		};

		Table.prototype.updateSize = function updateSize(size) {
		  assert(size <= this.protocolMaxSize, 'Table size bigger than maximum');
		  this.maxSize = size;
		  this.evict();
		};


	/***/ },
	/* 641 */
	/***/ function(module, exports) {

		exports.assert = function assert(cond, text) {
		  if (!cond)
		    throw new Error(text);
		};

		exports.stringify = function stringify(arr) {
		  var res = '';
		  for (var i = 0; i < arr.length; i++)
		    res += String.fromCharCode(arr[i]);
		  return res;
		};

		exports.toArray = function toArray(str) {
		  var res = [];
		  for (var i = 0; i < str.length; i++) {
		    var c = str.charCodeAt(i);
		    var hi = c >>> 8;
		    var lo = c & 0xff;
		    if (hi)
		      res.push(hi, lo);
		    else
		      res.push(lo);
		  }
		  return res;
		};


	/***/ },
	/* 642 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(253);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 643 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict'

		var db = __webpack_require__(590)
		var isUndefined = __webpack_require__(261)
		var from = __webpack_require__(620)
		var toBuffer = __webpack_require__(778)
		var Transform = __webpack_require__(176).Transform
		var util = __webpack_require__(11)

		function noop () {}

		function Blobs (opts) {
		  if (!(this instanceof Blobs)) return new Blobs(opts)
		  this.opts = !isUndefined(opts) ? opts : {}
		  if (typeof opts === 'string') this.opts = { name: opts }
		  this.opts.name = !isUndefined(this.opts.name) ? this.opts.name : 'idb-plus-blob-store'

		  var schema = {}
		  schema[this.opts.name] = {}

		  var self = this

		  this._store = db.open({
		    server: self.opts.name,
		    version: 1,
		    schema: schema
		  }).then(function (server) {
		    return server[self.opts.name]
		  })
		}

		module.exports = Blobs

		Blobs.prototype.createWriteStream = function (opts, cb) {
		  if (typeof opts === 'function') opts = {}
		  if (typeof opts === 'string') opts = {key: opts}
		  if (opts.name && isUndefined(opts.key)) opts.key = opts.name
		  if (!cb) cb = noop

		  var self = this
		  var key = opts.key

		  if (isUndefined(key)) {
		    return cb(new Error('Missing key'))
		  }

		  var FlushableStream = function (options) {
		    Transform.call(this, options)
		    this._bufs = []
		    this._evilIsFlushing = false
		    this._evilFlushed = false
		  }

		  util.inherits(FlushableStream, Transform)

		  FlushableStream.prototype._transform = function (chunk, encoding, done) {
		    // coerce number arguments to strings, since Buffer(number) does
		    // uninitialized memory allocation
		    if (typeof buf === 'number') chunk = chunk.toString()

		    this._bufs.push(Buffer.isBuffer(chunk) ? chunk : new Buffer(chunk))
		    this.push(chunk)

		    if (done) done()
		  }

		  FlushableStream.prototype._flush = function (done) {
		    this._evilIsFlushing = true

		    var innerSelf = this
		    var finish = function (err) {
		      innerSelf._evilIsFlushing = false
		      innerSelf._evilFlushed = true
		      innerSelf.emit('_evilFlush')
		      if (done) done(err)
		    }

		    var data = this._bufs.slice()
		    var server
		    self._store
		      .then(function (s) {
		        server = s
		      })
		      .then(function () {
		        return server.get(key)
		      })
		      .then(function (data) {
		        if (data) return server.remove(key)
		      })
		      .then(function () {
		        return server.add({
		          key: key,
		          item: data
		        })
		      })
		      .then(function () {
		        cb(null, {
		          key: key,
		          size: data.length
		        })
		        finish()
		      })
		      .catch(finish)
		  }

		  FlushableStream.prototype.emit = function (event) {
		    var innerSelf = this
		    var args = arguments

		    var emit = function () {
		      Transform.prototype.emit.apply(innerSelf, args)
		    }

		    switch (event) {
		      case 'finish':
		        // Flush finished?
		        if (this._evilFlushed) {
		          // Flushing done
		          emit()
		        } else if (this._evilIsFlushing) {
		          // Flushing in process
		          return
		        } else {
		          // Start flushing
		          this._flush()
		        }
		        break
		      case '_evilFlush':
		        this.emit('finish')
		        break
		      default:
		        emit()
		    }
		  }

		  return new FlushableStream()
		}

		Blobs.prototype.createReadStream = function (opts) {
		  if (!opts) opts = {}
		  if (typeof opts === 'string') opts = {key: opts}
		  if (opts.name && isUndefined(opts.key)) opts.key = opts.name

		  var self = this
		  var key = opts.key

		  if (isUndefined(key)) {
		    throw new Error('Missing key')
		  }

		  var buf = null
		  var result = from(function (size, next) {
		    if (!buf) {
		      return self._store
		        .then(function (server) {
		          return server.get(key)
		        })
		        .then(function (result) {
		          if (!result) {
		            throw new Error('key not found: ' + key)
		          }
		          buf = result
		          var nextPart = buf.pop()
		          if (isUndefined(nextPart)) {
		            return next(null, new Buffer(0))
		          }
		          next(null, toBuffer(nextPart))
		        })
		        .catch(function (err) {
		          next(err)
		        })
		    }

		    if (buf.length === 0) {
		      return next(null, null)
		    }

		    next(null, toBuffer(buf.pop()))
		  })

		  result.resume()
		  return result
		}

		Blobs.prototype.exists = function (opts, cb) {
		  if (typeof opts === 'string') opts = {key: opts}
		  if (!cb) cb = noop

		  var key = !isUndefined(opts.key) ? opts.key : 'undefined'

		  this._store
		    .then(function (server) {
		      return server.get(key)
		    })
		    .then(function (result) {
		      if (result) return cb(null, true)
		      cb(null, false)
		    })
		    .catch(cb)
		}

		Blobs.prototype.remove = function (opts, cb) {
		  if (typeof opts === 'string') opts = {key: opts}
		  if (!cb) cb = noop

		  var key = !isUndefined(opts.key) ? opts.key : 'undefined'

		  this._store
		    .then(function (server) {
		      return server.remove(key)
		    })
		    .then(function () {
		      cb()
		    }, cb)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 644 */
	/***/ 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
		}


	/***/ },
	/* 645 */
	/***/ function(module, exports) {

		
		var indexOf = [].indexOf;

		module.exports = function(arr, obj){
		  if (indexOf) return arr.indexOf(obj);
		  for (var i = 0; i < arr.length; ++i) {
		    if (arr[i] === obj) return i;
		  }
		  return -1;
		};

	/***/ },
	/* 646 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var wrappy = __webpack_require__(290)
		var reqs = Object.create(null)
		var once = __webpack_require__(125)

		module.exports = wrappy(inflight)

		function inflight (key, cb) {
		  if (reqs[key]) {
		    reqs[key].push(cb)
		    return null
		  } else {
		    reqs[key] = [cb]
		    return makeres(key)
		  }
		}

		function makeres (key) {
		  return once(function RES () {
		    var cbs = reqs[key]
		    var len = cbs.length
		    var args = slice(arguments)
		    for (var i = 0; i < len; i++) {
		      cbs[i].apply(null, args)
		    }
		    if (cbs.length > len) {
		      // added more in the interim.
		      // de-zalgo, just in case, but don't call again.
		      cbs.splice(0, len)
		      process.nextTick(function () {
		        RES.apply(null, args)
		      })
		    } else {
		      delete reqs[key]
		    }
		  })
		}

		function slice (args) {
		  var length = args.length
		  var array = []

		  for (var i = 0; i < length; i++) array[i] = args[i]
		  return array
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 647 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var ip = exports;
		var Buffer = __webpack_require__(0).Buffer;
		var os = __webpack_require__(264);

		ip.toBuffer = function(ip, buff, offset) {
		  offset = ~~offset;

		  var result;

		  if (this.isV4Format(ip)) {
		    result = buff || new Buffer(offset + 4);
		    ip.split(/\./g).map(function(byte) {
		      result[offset++] = parseInt(byte, 10) & 0xff;
		    });
		  } else if (this.isV6Format(ip)) {
		    var sections = ip.split(':', 8);

		    var i;
		    for (i = 0; i < sections.length; i++) {
		      var isv4 = this.isV4Format(sections[i]);
		      var v4Buffer;

		      if (isv4) {
		        v4Buffer = this.toBuffer(sections[i]);
		        sections[i] = v4Buffer.slice(0, 2).toString('hex');
		      }

		      if (v4Buffer && ++i < 8) {
		        sections.splice(i, 0, v4Buffer.slice(2, 4).toString('hex'));
		      }
		    }

		    if (sections[0] === '') {
		      while (sections.length < 8) sections.unshift('0');
		    } else if (sections[sections.length - 1] === '') {
		      while (sections.length < 8) sections.push('0');
		    } else if (sections.length < 8) {
		      for (i = 0; i < sections.length && sections[i] !== ''; i++);
		      var argv = [ i, 1 ];
		      for (i = 9 - sections.length; i > 0; i--) {
		        argv.push('0');
		      }
		      sections.splice.apply(sections, argv);
		    }

		    result = buff || new Buffer(offset + 16);
		    for (i = 0; i < sections.length; i++) {
		      var word = parseInt(sections[i], 16);
		      result[offset++] = (word >> 8) & 0xff;
		      result[offset++] = word & 0xff;
		    }
		  }

		  if (!result) {
		    throw Error('Invalid ip address: ' + ip);
		  }

		  return result;
		};

		ip.toString = function(buff, offset, length) {
		  offset = ~~offset;
		  length = length || (buff.length - offset);

		  var result = [];
		  if (length === 4) {
		    // IPv4
		    for (var i = 0; i < length; i++) {
		      result.push(buff[offset + i]);
		    }
		    result = result.join('.');
		  } else if (length === 16) {
		    // IPv6
		    for (var i = 0; i < length; i += 2) {
		      result.push(buff.readUInt16BE(offset + i).toString(16));
		    }
		    result = result.join(':');
		    result = result.replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3');
		    result = result.replace(/:{3,4}/, '::');
		  }

		  return result;
		};

		var ipv4Regex = /^(\d{1,3}\.){3,3}\d{1,3}$/;
		var ipv6Regex =
		    /^(::)?(((\d{1,3}\.){3}(\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?$/i;

		ip.isV4Format = function(ip) {
		  return ipv4Regex.test(ip);
		};

		ip.isV6Format = function(ip) {
		  return ipv6Regex.test(ip);
		};
		function _normalizeFamily(family) {
		  return family ? family.toLowerCase() : 'ipv4';
		}

		ip.fromPrefixLen = function(prefixlen, family) {
		  if (prefixlen > 32) {
		    family = 'ipv6';
		  } else {
		    family = _normalizeFamily(family);
		  }

		  var len = 4;
		  if (family === 'ipv6') {
		    len = 16;
		  }
		  var buff = new Buffer(len);

		  for (var i = 0, n = buff.length; i < n; ++i) {
		    var bits = 8;
		    if (prefixlen < 8) {
		      bits = prefixlen;
		    }
		    prefixlen -= bits;

		    buff[i] = ~(0xff >> bits);
		  }

		  return ip.toString(buff);
		};

		ip.mask = function(addr, mask) {
		  addr = ip.toBuffer(addr);
		  mask = ip.toBuffer(mask);

		  var result = new Buffer(Math.max(addr.length, mask.length));

		  // Same protocol - do bitwise and
		  if (addr.length === mask.length) {
		    for (var i = 0; i < addr.length; i++) {
		      result[i] = addr[i] & mask[i];
		    }
		  } else if (mask.length === 4) {
		    // IPv6 address and IPv4 mask
		    // (Mask low bits)
		    for (var i = 0; i < mask.length; i++) {
		      result[i] = addr[addr.length - 4  + i] & mask[i];
		    }
		  } else {
		    // IPv6 mask and IPv4 addr
		    for (var i = 0; i < result.length - 6; i++) {
		      result[i] = 0;
		    }

		    // ::ffff:ipv4
		    result[10] = 0xff;
		    result[11] = 0xff;
		    for (var i = 0; i < addr.length; i++) {
		      result[i + 12] = addr[i] & mask[i + 12];
		    }
		  }

		  return ip.toString(result);
		};

		ip.cidr = function(cidrString) {
		  var cidrParts = cidrString.split('/');

		  var addr = cidrParts[0];
		  if (cidrParts.length !== 2)
		    throw new Error('invalid CIDR subnet: ' + addr);

		  var mask = ip.fromPrefixLen(parseInt(cidrParts[1], 10));

		  return ip.mask(addr, mask);
		};

		ip.subnet = function(addr, mask) {
		  var networkAddress = ip.toLong(ip.mask(addr, mask));

		  // Calculate the mask's length.
		  var maskBuffer = ip.toBuffer(mask);
		  var maskLength = 0;

		  for (var i = 0; i < maskBuffer.length; i++) {
		    if (maskBuffer[i] === 0xff) {
		      maskLength += 8;
		    } else {
		      var octet = maskBuffer[i] & 0xff;
		      while (octet) {
		        octet = (octet << 1) & 0xff;
		        maskLength++;
		      }
		    }
		  }

		  var numberOfAddresses = Math.pow(2, 32 - maskLength);

		  return {
		    networkAddress: ip.fromLong(networkAddress),
		    firstAddress: numberOfAddresses <= 2 ?
		                    ip.fromLong(networkAddress) :
		                    ip.fromLong(networkAddress + 1),
		    lastAddress: numberOfAddresses <= 2 ?
		                    ip.fromLong(networkAddress + numberOfAddresses - 1) :
		                    ip.fromLong(networkAddress + numberOfAddresses - 2),
		    broadcastAddress: ip.fromLong(networkAddress + numberOfAddresses - 1),
		    subnetMask: mask,
		    subnetMaskLength: maskLength,
		    numHosts: numberOfAddresses <= 2 ?
		                numberOfAddresses : numberOfAddresses - 2,
		    length: numberOfAddresses,
		    contains: function(other) {
		      return networkAddress === ip.toLong(ip.mask(other, mask));
		    }
		  };
		};

		ip.cidrSubnet = function(cidrString) {
		  var cidrParts = cidrString.split('/');

		  var addr = cidrParts[0];
		  if (cidrParts.length !== 2)
		    throw new Error('invalid CIDR subnet: ' + addr);

		  var mask = ip.fromPrefixLen(parseInt(cidrParts[1], 10));

		  return ip.subnet(addr, mask);
		};

		ip.not = function(addr) {
		  var buff = ip.toBuffer(addr);
		  for (var i = 0; i < buff.length; i++) {
		    buff[i] = 0xff ^ buff[i];
		  }
		  return ip.toString(buff);
		};

		ip.or = function(a, b) {
		  a = ip.toBuffer(a);
		  b = ip.toBuffer(b);

		  // same protocol
		  if (a.length === b.length) {
		    for (var i = 0; i < a.length; ++i) {
		      a[i] |= b[i];
		    }
		    return ip.toString(a);

		  // mixed protocols
		  } else {
		    var buff = a;
		    var other = b;
		    if (b.length > a.length) {
		      buff = b;
		      other = a;
		    }

		    var offset = buff.length - other.length;
		    for (var i = offset; i < buff.length; ++i) {
		      buff[i] |= other[i - offset];
		    }

		    return ip.toString(buff);
		  }
		};

		ip.isEqual = function(a, b) {
		  a = ip.toBuffer(a);
		  b = ip.toBuffer(b);

		  // Same protocol
		  if (a.length === b.length) {
		    for (var i = 0; i < a.length; i++) {
		      if (a[i] !== b[i]) return false;
		    }
		    return true;
		  }

		  // Swap
		  if (b.length === 4) {
		    var t = b;
		    b = a;
		    a = t;
		  }

		  // a - IPv4, b - IPv6
		  for (var i = 0; i < 10; i++) {
		    if (b[i] !== 0) return false;
		  }

		  var word = b.readUInt16BE(10);
		  if (word !== 0 && word !== 0xffff) return false;

		  for (var i = 0; i < 4; i++) {
		    if (a[i] !== b[i + 12]) return false;
		  }

		  return true;
		};

		ip.isPrivate = function(addr) {
		  return /^(::f{4}:)?10\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/i
		      .test(addr) ||
		    /^(::f{4}:)?192\.168\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) ||
		    /^(::f{4}:)?172\.(1[6-9]|2\d|30|31)\.([0-9]{1,3})\.([0-9]{1,3})$/i
		      .test(addr) ||
		    /^(::f{4}:)?127\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) ||
		    /^(::f{4}:)?169\.254\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) ||
		    /^f[cd][0-9a-f]{2}:/i.test(addr) ||
		    /^fe80:/i.test(addr) ||
		    /^::1$/.test(addr) ||
		    /^::$/.test(addr);
		};

		ip.isPublic = function(addr) {
		  return !ip.isPrivate(addr);
		};

		ip.isLoopback = function(addr) {
		  return /^(::f{4}:)?127\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})/
		      .test(addr) ||
		    /^fe80::1$/.test(addr) ||
		    /^::1$/.test(addr) ||
		    /^::$/.test(addr);
		};

		ip.loopback = function(family) {
		  //
		  // Default to `ipv4`
		  //
		  family = _normalizeFamily(family);

		  if (family !== 'ipv4' && family !== 'ipv6') {
		    throw new Error('family must be ipv4 or ipv6');
		  }

		  return family === 'ipv4' ? '127.0.0.1' : 'fe80::1';
		};

		//
		// ### function address (name, family)
		// #### @name {string|'public'|'private'} **Optional** Name or security
		//      of the network interface.
		// #### @family {ipv4|ipv6} **Optional** IP family of the address (defaults
		//      to ipv4).
		//
		// Returns the address for the network interface on the current system with
		// the specified `name`:
		//   * String: First `family` address of the interface.
		//             If not found see `undefined`.
		//   * 'public': the first public ip address of family.
		//   * 'private': the first private ip address of family.
		//   * undefined: First address with `ipv4` or loopback address `127.0.0.1`.
		//
		ip.address = function(name, family) {
		  var interfaces = os.networkInterfaces();
		  var all;

		  //
		  // Default to `ipv4`
		  //
		  family = _normalizeFamily(family);

		  //
		  // If a specific network interface has been named,
		  // return the address.
		  //
		  if (name && name !== 'private' && name !== 'public') {
		    var res = interfaces[name].filter(function(details) {
		      var itemFamily = details.family.toLowerCase();
		      return itemFamily === family;
		    });
		    if (res.length === 0)
		      return undefined;
		    return res[0].address;
		  }

		  var all = Object.keys(interfaces).map(function (nic) {
		    //
		    // Note: name will only be `public` or `private`
		    // when this is called.
		    //
		    var addresses = interfaces[nic].filter(function (details) {
		      details.family = details.family.toLowerCase();
		      if (details.family !== family || ip.isLoopback(details.address)) {
		        return false;
		      } else if (!name) {
		        return true;
		      }

		      return name === 'public' ? ip.isPrivate(details.address) :
		          ip.isPublic(details.address);
		    });

		    return addresses.length ? addresses[0].address : undefined;
		  }).filter(Boolean);

		  return !all.length ? ip.loopback(family) : all[0];
		};

		ip.toLong = function(ip) {
		  var ipl = 0;
		  ip.split('.').forEach(function(octet) {
		    ipl <<= 8;
		    ipl += parseInt(octet);
		  });
		  return(ipl >>> 0);
		};

		ip.fromLong = function(ipl) {
		  return ((ipl >>> 24) + '.' +
		      (ipl >> 16 & 255) + '.' +
		      (ipl >> 8 & 255) + '.' +
		      (ipl & 255) );
		};


	/***/ },
	/* 648 */
	/***/ function(module, exports) {

		"use strict";
		"use strict"
		function isProperty(str) {
		  return /^[$A-Z\_a-z\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0\u08a2-\u08ac\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0977\u0979-\u097f\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c33\u0c35-\u0c39\u0c3d\u0c58\u0c59\u0c60\u0c61\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d60\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f4\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f0\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191c\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19c1-\u19c7\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2119-\u211d\u2124\u2126\u2128\u212a-\u212d\u212f-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u2e2f\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309d-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fcc\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua697\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua78e\ua790-\ua793\ua7a0-\ua7aa\ua7f8-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa80-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uabc0-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc][$A-Z\_a-z\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0\u08a2-\u08ac\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0977\u0979-\u097f\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c33\u0c35-\u0c39\u0c3d\u0c58\u0c59\u0c60\u0c61\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d60\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f4\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f0\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191c\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19c1-\u19c7\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2119-\u211d\u2124\u2126\u2128\u212a-\u212d\u212f-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u2e2f\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309d-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fcc\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua697\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua78e\ua790-\ua793\ua7a0-\ua7aa\ua7f8-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa80-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uabc0-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc0-9\u0300-\u036f\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08e4-\u08fe\u0900-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c01-\u0c03\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c82\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d02\u0d03\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0eb9\u0ebb\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19b0-\u19c0\u19c8\u19c9\u19d0-\u19d9\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf2-\u1cf4\u1dc0-\u1de6\u1dfc-\u1dff\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c4\ua8d0-\ua8d9\ua8e0-\ua8f1\ua900-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe26\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f]*$/.test(str)
		}
		module.exports = isProperty

	/***/ },
	/* 649 */
	/***/ function(module, exports) {

		module.exports      = isTypedArray
		isTypedArray.strict = isStrictTypedArray
		isTypedArray.loose  = isLooseTypedArray

		var toString = Object.prototype.toString
		var names = {
		    '[object Int8Array]': true
		  , '[object Int16Array]': true
		  , '[object Int32Array]': true
		  , '[object Uint8Array]': true
		  , '[object Uint8ClampedArray]': true
		  , '[object Uint16Array]': true
		  , '[object Uint32Array]': true
		  , '[object Float32Array]': true
		  , '[object Float64Array]': true
		}

		function isTypedArray(arr) {
		  return (
		       isStrictTypedArray(arr)
		    || isLooseTypedArray(arr)
		  )
		}

		function isStrictTypedArray(arr) {
		  return (
		       arr instanceof Int8Array
		    || arr instanceof Int16Array
		    || arr instanceof Int32Array
		    || arr instanceof Uint8Array
		    || arr instanceof Uint8ClampedArray
		    || arr instanceof Uint16Array
		    || arr instanceof Uint32Array
		    || arr instanceof Float32Array
		    || arr instanceof Float64Array
		  )
		}

		function isLooseTypedArray(arr) {
		  return names[toString.call(arr)]
		}


	/***/ },
	/* 650 */
	/***/ function(module, exports) {

		module.exports = read

		var MSB = 0x80
		  , REST = 0x7F

		function read(buf, offset) {
		  var res    = 0
		    , offset = offset || 0
		    , shift  = 0
		    , counter = offset
		    , b
		    , l = buf.length
		  
		  do {
		    if(counter >= l) {
		      read.bytesRead = 0
		      return undefined
		    }
		    b = buf[counter++]
		    res += shift < 28
		      ? (b & REST) << shift
		      : (b & REST) * Math.pow(2, shift)
		    shift += 7
		  } while (b >= MSB)
		  
		  read.bytes = counter - offset
		  
		  return res
		}


	/***/ },
	/* 651 */
	/***/ function(module, exports) {

		module.exports = encode

		var MSB = 0x80
		  , REST = 0x7F
		  , MSBALL = ~REST
		  , INT = Math.pow(2, 31)

		function encode(num, out, offset) {
		  out = out || []
		  offset = offset || 0
		  var oldOffset = offset

		  while(num >= INT) {
		    out[offset++] = (num & 0xFF) | MSB
		    num /= 128
		  }
		  while(num & MSBALL) {
		    out[offset++] = (num & 0xFF) | MSB
		    num >>>= 7
		  }
		  out[offset] = num | 0
		  
		  encode.bytes = offset - oldOffset + 1
		  
		  return out
		}


	/***/ },
	/* 652 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = {
		    encode: __webpack_require__(651)
		  , decode: __webpack_require__(650)
		  , encodingLength: __webpack_require__(653)
		}


	/***/ },
	/* 653 */
	/***/ function(module, exports) {

		
		var N1 = Math.pow(2,  7)
		var N2 = Math.pow(2, 14)
		var N3 = Math.pow(2, 21)
		var N4 = Math.pow(2, 28)
		var N5 = Math.pow(2, 35)
		var N6 = Math.pow(2, 42)
		var N7 = Math.pow(2, 49)

		module.exports = function (value) {
		  return (
		    value < N1 ? 1
		  : value < N2 ? 2
		  : value < N3 ? 3
		  : value < N4 ? 4
		  : value < N5 ? 5
		  : value < N6 ? 6
		  : value < N7 ? 7
		  :              8
		  )
		}


	/***/ },
	/* 654 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Swarm = __webpack_require__(659);
		var Peer = __webpack_require__(128);
		var WS = __webpack_require__(661);
		var spdy = __webpack_require__(655);

		exports = module.exports;

		exports.Node = function Node(peerInfo) {
		  if (!(this instanceof Node)) {
		    return new Node(peerInfo);
		  }
		  if (!peerInfo) {
		    peerInfo = new Peer();
		  }

		  this.peerInfo = peerInfo;

		  // Swarm
		  this.swarm = new Swarm(peerInfo);
		  this.swarm.transport.add('ws', new WS());
		  this.swarm.connection.addStreamMuxer(spdy);
		  this.swarm.connection.reuse();

		  this.start = function (callback) {
		    // Yeah empty function, we can't actually do anything here, yet.
		    callback();
		  };

		  this.routing = null;
		  this.records = null;

		  this.dial = function () {
		    throw new Error('THIS WILL BE EQUIVALENT TO THE ROUTED HOST FEATURE, IT WILL FIGURE OUT EVERYTHING :D');
		  };
		};

	/***/ },
	/* 655 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var spdy = __webpack_require__(24);

		exports = module.exports = function (transport, isListener) {
		  var muxer = spdy.connection.create(transport, {
		    protocol: 'spdy',
		    isServer: isListener
		  });

		  muxer.start(3.1);

		  // method added to enable pure stream muxer feeling
		  muxer.newStream = function (callback) {
		    if (!callback) {
		      callback = noop;
		    }

		    return muxer.request({
		      method: 'POST',
		      path: '/',
		      headers: {}
		    }, callback);
		  };

		  // The rest of the API comes by default with SPDY
		  // muxer.on('stream', (stream) => {})
		  // muxer.on('close', () => {})
		  // muxer.on('error', (err) => {})
		  // muxer.end()

		  muxer.multicodec = exports.multicodec;
		  return muxer;
		};

		exports.multicodec = '/spdy/3.1.0';

		function noop() {}

	/***/ },
	/* 656 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var connHandler = __webpack_require__(168);
		var identify = __webpack_require__(658);

		module.exports = function connection(swarm) {
		  return {
		    addUpgrade: function addUpgrade() {},
		    addStreamMuxer: function addStreamMuxer(muxer) {
		      // for dialing
		      swarm.muxers[muxer.multicodec] = muxer;

		      // for listening
		      swarm.handle(muxer.multicodec, function (conn) {
		        var muxedConn = muxer(conn, true);

		        var peerIdForConn;

		        muxedConn.on('stream', function (conn) {
		          function gotId() {
		            if (peerIdForConn) {
		              conn.peerId = peerIdForConn;
		              connHandler(swarm.protocols, conn);
		            } else {
		              setTimeout(gotId, 100);
		            }
		          }

		          if (swarm.identify) {
		            return gotId();
		          }

		          connHandler(swarm.protocols, conn);
		        });

		        // if identify is enabled, attempt to do it for muxer reuse
		        if (swarm.identify) {
		          identify.exec(conn, muxedConn, swarm._peerInfo, function (err, pi) {
		            if (err) {
		              return console.log('Identify exec failed', err);
		            }

		            peerIdForConn = pi.id;
		            swarm.muxedConns[pi.id.toB58String()] = {};
		            swarm.muxedConns[pi.id.toB58String()].muxer = muxedConn;
		            swarm.muxedConns[pi.id.toB58String()].conn = conn; // to be able to extract addrs

		            swarm.emit('peer-mux-established', pi);

		            muxedConn.on('close', function () {
		              delete swarm.muxedConns[pi.id.toB58String()];
		              swarm.emit('peer-mux-closed', pi);
		            });
		          });
		        }
		      });
		    },
		    reuse: function reuse() {
		      swarm.identify = true;
		      swarm.handle(identify.multicodec, identify.handler(swarm._peerInfo, swarm));
		    }
		  };
		};

	/***/ },
	/* 657 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var multistream = __webpack_require__(174);
		var DuplexPassThrough = __webpack_require__(240);

		var connHandler = __webpack_require__(168);

		module.exports = function dial(swarm) {
		  return function (pi, protocol, callback) {
		    if (typeof protocol === 'function') {
		      callback = protocol;
		      protocol = null;
		    }

		    if (!callback) {
		      callback = function noop() {};
		    }

		    var pt = new DuplexPassThrough();

		    var b58Id = pi.id.toB58String();

		    if (!swarm.muxedConns[b58Id]) {
		      if (!swarm.conns[b58Id]) {
		        attemptDial(pi, function (err, conn) {
		          if (err) {
		            return callback(err);
		          }
		          gotWarmedUpConn(conn);
		        });
		      } else {
		        var conn = swarm.conns[b58Id];
		        swarm.conns[b58Id] = undefined;
		        gotWarmedUpConn(conn);
		      }
		    } else {
		      if (!protocol) {
		        return callback();
		      }
		      gotMuxer(swarm.muxedConns[b58Id].muxer);
		    }

		    return pt;

		    function gotWarmedUpConn(conn) {
		      attemptMuxerUpgrade(conn, function (err, muxer) {
		        if (!protocol) {
		          if (err) {
		            swarm.conns[b58Id] = conn;
		          }
		          return callback();
		        }

		        if (err) {
		          // couldn't upgrade to Muxer, it is ok
		          protocolHandshake(conn, protocol, callback);
		        } else {
		          gotMuxer(muxer);
		        }
		      });
		    }

		    function gotMuxer(muxer) {
		      openConnInMuxedConn(muxer, function (conn) {
		        protocolHandshake(conn, protocol, callback);
		      });
		    }

		    function attemptDial(pi, cb) {
		      var tKeys = swarm.availableTransports(pi);

		      if (tKeys.length === 0) {
		        return cb(new Error('No available tranport to dial to'));
		      }

		      nextTransport(tKeys.shift());

		      function nextTransport(key) {
		        var multiaddrs = pi.multiaddrs.slice();
		        swarm.transport.dial(key, multiaddrs, function (err, conn) {
		          if (err) {
		            if (tKeys.length === 0) {
		              return cb(new Error('Could not dial in any of the transports'));
		            }
		            return nextTransport(tKeys.shift());
		          }
		          cb(null, conn);
		        });
		      }
		    }

		    function attemptMuxerUpgrade(conn, cb) {
		      var muxers = Object.keys(swarm.muxers);
		      if (muxers.length === 0) {
		        return cb(new Error('no muxers available'));
		      }

		      // 1. try to handshake in one of the muxers available
		      // 2. if succeeds
		      //  - add the muxedConn to the list of muxedConns
		      //  - add incomming new streams to connHandler

		      nextMuxer(muxers.shift());

		      function nextMuxer(key) {
		        var msI = new multistream.Interactive();
		        msI.handle(conn, function () {
		          msI.select(key, function (err, conn) {
		            if (err) {
		              if (muxers.length === 0) {
		                cb(new Error('could not upgrade to stream muxing'));
		              } else {
		                nextMuxer(muxers.shift());
		              }
		              return;
		            }

		            var muxedConn = swarm.muxers[key](conn, false);
		            swarm.muxedConns[b58Id] = {};
		            swarm.muxedConns[b58Id].muxer = muxedConn;
		            swarm.muxedConns[b58Id].conn = conn;

		            swarm.emit('peer-mux-established', pi);

		            muxedConn.on('close', function () {
		              delete swarm.muxedConns[pi.id.toB58String()];
		              swarm.emit('peer-mux-closed', pi);
		            });

		            // in case identify is on
		            muxedConn.on('stream', function (conn) {
		              conn.peerId = pi.id;
		              connHandler(swarm.protocols, conn);
		            });

		            cb(null, muxedConn);
		          });
		        });
		      }
		    }

		    function openConnInMuxedConn(muxer, cb) {
		      cb(muxer.newStream());
		    }

		    function protocolHandshake(conn, protocol, cb) {
		      var msI = new multistream.Interactive();
		      msI.handle(conn, function () {
		        msI.select(protocol, function (err, conn) {
		          if (err) {
		            return callback(err);
		          }

		          pt.wrapStream(conn);
		          pt.peerId = pi.id;
		          callback(null, pt);
		        });
		      });
		    }
		  };
		};

	/***/ },
	/* 658 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {/*
		 * Identify is one of the protocols swarms speaks in order to
		 * broadcast and learn about the ip:port pairs a specific peer
		 * is available through and to know when a new stream muxer is
		 * established, so a conn can be reused
		 */

		'use strict';

		var multistream = __webpack_require__(174);

		var path = __webpack_require__(31);
		var Info = __webpack_require__(128);
		var Id = __webpack_require__(89);
		var multiaddr = __webpack_require__(120);

		var identity = Buffer("bWVzc2FnZSBJZGVudGlmeSB7CgogIC8vIHByb3RvY29sVmVyc2lvbiBkZXRlcm1pbmVzIGNvbXBhdGliaWxpdHkgYmV0d2VlbiBwZWVycwogIG9wdGlvbmFsIHN0cmluZyBwcm90b2NvbFZlcnNpb24gPSA1OyAvLyBlLmcuIGlwZnMvMS4wLjAKCiAgLy8gYWdlbnRWZXJzaW9uIGlzIGxpa2UgYSBVc2VyQWdlbnQgc3RyaW5nIGluIGJyb3dzZXJzLCBvciBjbGllbnQgdmVyc2lvbiBpbiBiaXR0b3JyZW50CiAgLy8gaW5jbHVkZXMgdGhlIGNsaWVudCBuYW1lIGFuZCBjbGllbnQuCiAgb3B0aW9uYWwgc3RyaW5nIGFnZW50VmVyc2lvbiA9IDY7IC8vIGUuZy4gZ28taXBmcy8wLjEuMAoKICAvLyBwdWJsaWNLZXkgaXMgdGhpcyBub2RlJ3MgcHVibGljIGtleSAod2hpY2ggYWxzbyBnaXZlcyBpdHMgbm9kZS5JRCkKICAvLyAtIG1heSBub3QgbmVlZCB0byBiZSBzZW50LCBhcyBzZWN1cmUgY2hhbm5lbCBpbXBsaWVzIGl0IGhhcyBiZWVuIHNlbnQuCiAgLy8gLSB0aGVuIGFnYWluLCBpZiB3ZSBjaGFuZ2UgLyBkaXNhYmxlIHNlY3VyZSBjaGFubmVsLCBtYXkgc3RpbGwgd2FudCBpdC4KICBvcHRpb25hbCBieXRlcyBwdWJsaWNLZXkgPSAxOwoKICAvLyBsaXN0ZW5BZGRycyBhcmUgdGhlIG11bHRpYWRkcnMgdGhlIHNlbmRlciBub2RlIGxpc3RlbnMgZm9yIG9wZW4gY29ubmVjdGlvbnMgb24KICByZXBlYXRlZCBieXRlcyBsaXN0ZW5BZGRycyA9IDI7CgogIC8vIG9zZXJ2ZWRBZGRyIGlzIHRoZSBtdWx0aWFkZHIgb2YgdGhlIHJlbW90ZSBlbmRwb2ludCB0aGF0IHRoZSBzZW5kZXIgbm9kZSBwZXJjZWl2ZXMKICAvLyB0aGlzIGlzIHVzZWZ1bCBpbmZvcm1hdGlvbiB0byBjb252ZXkgdG8gdGhlIG90aGVyIHNpZGUsIGFzIGl0IGhlbHBzIHRoZSByZW1vdGUgZW5kcG9pbnQKICAvLyBkZXRlcm1pbmUgd2hldGhlciBpdHMgY29ubmVjdGlvbiB0byB0aGUgbG9jYWwgcGVlciBnb2VzIHRocm91Z2ggTkFULgogIG9wdGlvbmFsIGJ5dGVzIG9ic2VydmVkQWRkciA9IDQ7CgogIC8vIChERVBSRUNBVEVEKSBwcm90b2NvbHMgYXJlIHRoZSBzZXJ2aWNlcyB0aGlzIG5vZGUgaXMgcnVubmluZwogIC8vIHJlcGVhdGVkIHN0cmluZyBwcm90b2NvbHMgPSAzOwp9Cg==","base64");

		var pbStream = __webpack_require__(714)(identity);

		exports = module.exports;
		exports.multicodec = '/ipfs/identify/1.0.0';

		exports.exec = function (rawConn, muxer, peerInfo, callback) {
		  // 1. open a stream
		  // 2. multistream into identify
		  // 3. send what I see from this other peer (extract fro conn)
		  // 4. receive what the other peer sees from me
		  // 4. callback with (err, peerInfo)

		  var conn = muxer.newStream();

		  var msI = new multistream.Interactive();
		  msI.handle(conn, function () {
		    msI.select(exports.multicodec, function (err, ds) {
		      if (err) {
		        return callback(err);
		      }

		      var pbs = pbStream();

		      pbs.on('identify', function (msg) {
		        if (msg.observedAddr.length > 0) {
		          peerInfo.multiaddr.addSafe(multiaddr(msg.observedAddr));
		        }

		        var peerId = Id.createFromPubKey(msg.publicKey);
		        var otherPeerInfo = new Info(peerId);
		        msg.listenAddrs.forEach(function (ma) {
		          otherPeerInfo.multiaddr.add(multiaddr(ma));
		        });

		        callback(null, otherPeerInfo);
		      });

		      var obsMultiaddr = rawConn.getObservedAddrs()[0];

		      pbs.identify({
		        protocolVersion: 'na',
		        agentVersion: 'na',
		        publicKey: peerInfo.id.pubKey,
		        listenAddrs: peerInfo.multiaddrs.map(function (mh) {
		          return mh.buffer;
		        }),
		        observedAddr: obsMultiaddr ? obsMultiaddr.buffer : new Buffer('')
		      });

		      pbs.pipe(ds).pipe(pbs);
		      pbs.finalize();
		    });
		  });
		};

		exports.handler = function (peerInfo, swarm) {
		  return function (conn) {
		    // 1. receive incoming observed info about me
		    // 2. update my own information (on peerInfo)
		    // 3. send back what I see from the other (get from swarm.muxedConns[incPeerID].conn.getObservedAddrs()
		    var pbs = pbStream();

		    pbs.on('identify', function (msg) {
		      if (msg.observedAddr.length > 0) {
		        peerInfo.multiaddr.addSafe(multiaddr(msg.observedAddr));
		      }

		      var peerId = Id.createFromPubKey(msg.publicKey);
		      var conn = swarm.muxedConns[peerId.toB58String()].conn;
		      var obsMultiaddr = conn.getObservedAddrs()[0];

		      pbs.identify({
		        protocolVersion: 'na',
		        agentVersion: 'na',
		        publicKey: peerInfo.id.pubKey,
		        listenAddrs: peerInfo.multiaddrs.map(function (ma) {
		          return ma.buffer;
		        }),
		        observedAddr: obsMultiaddr ? obsMultiaddr.buffer : new Buffer('')
		      });
		      pbs.finalize();
		    });
		    pbs.pipe(conn).pipe(pbs);
		  };
		};
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 659 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var util = __webpack_require__(11);
		var EE = __webpack_require__(7).EventEmitter;
		var parallel = __webpack_require__(278);
		var contains = __webpack_require__(260);

		var transport = __webpack_require__(660);
		var connection = __webpack_require__(656);
		var dial = __webpack_require__(657);

		exports = module.exports = Swarm;

		util.inherits(Swarm, EE);

		function Swarm(peerInfo) {
		  var _this = this;

		  if (!(this instanceof Swarm)) {
		    return new Swarm(peerInfo);
		  }

		  if (!peerInfo) {
		    throw new Error('You must provide a value for `peerInfo`');
		  }

		  this._peerInfo = peerInfo;

		  // transports --

		  // { key: transport }; e.g { tcp: <tcp> }
		  this.transports = {};

		  // connections --

		  // { peerIdB58: { conn: <conn> }}
		  this.conns = {};

		  // {
		  //   peerIdB58: {
		  //     muxer: <muxer>
		  //     conn: <transport socket> // to extract info required for the Identify Protocol
		  //   }
		  // }
		  this.muxedConns = {};

		  // { protocol: handler }
		  this.protocols = {};

		  // { muxerCodec: <muxer> } e.g { '/spdy/0.3.1': spdy }
		  this.muxers = {};

		  // is the Identify protocol enabled?
		  this.identify = false;

		  this.transport = transport(this);
		  this.connection = connection(this);

		  this.availableTransports = function (pi) {
		    var addrs = pi.multiaddrs;

		    // Only listen on transports we actually have addresses for
		    return Object.keys(_this.transports).filter(function (ts) {
		      // ipfs multiaddrs are not dialable so we drop them here
		      var dialable = addrs.map(function (addr) {
		        if (contains(addr.protoNames(), 'ipfs')) {
		          return addr.decapsulate('ipfs');
		        }
		        return addr;
		      });

		      return _this.transports[ts].filter(dialable).length > 0;
		    });
		  };

		  // higher level (public) API
		  this.dial = dial(this);

		  // Start listening on all available transports
		  this.listen = function (callback) {
		    parallel(_this.availableTransports(peerInfo).map(function (ts) {
		      return function (cb) {
		        // Listen on the given transport
		        _this.transport.listen(ts, {}, null, cb);
		      };
		    }), callback);
		  };

		  this.handle = function (protocol, handler) {
		    _this.protocols[protocol] = handler;
		  };

		  this.unhandle = function (protocol, handler) {
		    if (_this.protocols[protocol]) {
		      delete _this.protocols[protocol];
		    }
		  };

		  this.close = function (callback) {
		    Object.keys(_this.muxedConns).forEach(function (key) {
		      _this.muxedConns[key].muxer.end();
		    });

		    parallel(Object.keys(_this.transports).map(function (key) {
		      return function (cb) {
		        return _this.transports[key].close(cb);
		      };
		    }), callback);
		  };
		}

	/***/ },
	/* 660 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		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; };

		var contains = __webpack_require__(260);
		var DuplexPassThrough = __webpack_require__(240);

		var connHandler = __webpack_require__(168);

		module.exports = function (swarm) {
		  return {
		    add: function add(key, transport, options, callback) {
		      if (typeof options === 'function') {
		        callback = options;
		        options = {};
		      }
		      if (!callback) {
		        callback = noop;
		      }

		      if (swarm.transports[key]) {
		        throw new Error('There is already a transport with this key');
		      }
		      swarm.transports[key] = transport;
		      callback();
		    },
		    dial: function dial(key, multiaddrs, callback) {
		      var t = swarm.transports[key];

		      if (!Array.isArray(multiaddrs)) {
		        multiaddrs = [multiaddrs];
		      }

		      // a) filter the multiaddrs that are actually valid for this transport (use a func from the transport itself) (maybe even make the transport do that)
		      multiaddrs = dialables(t, multiaddrs);

		      // b) if multiaddrs.length = 1, return the conn from the
		      // transport, otherwise, create a passthrough
		      if (multiaddrs.length === 1) {
		        var _ret = function () {
		          var conn = t.dial(multiaddrs.shift(), { ready: function ready() {
		              var cb = callback;
		              callback = noop; // this is done to avoid connection drops as connect errors
		              cb(null, conn);
		            } });
		          conn.once('error', function () {
		            callback(new Error('failed to connect to every multiaddr'));
		          });
		          return {
		            v: conn
		          };
		        }();

		        if ((typeof _ret === 'undefined' ? 'undefined' : _typeof(_ret)) === "object") return _ret.v;
		      }

		      // c) multiaddrs should already be a filtered list
		      // specific for the transport we are using
		      var pt = new DuplexPassThrough();

		      next(multiaddrs.shift());
		      return pt;
		      function next(multiaddr) {
		        var conn = t.dial(multiaddr, { ready: function ready() {
		            pt.wrapStream(conn);
		            var cb = callback;
		            callback = noop; // this is done to avoid connection drops as connect errors
		            cb(null, pt);
		          } });

		        conn.once('error', function () {
		          if (multiaddrs.length === 0) {
		            return callback(new Error('failed to connect to every multiaddr'));
		          }
		          next(multiaddrs.shift());
		        });
		      }
		    },
		    listen: function listen(key, options, handler, callback) {
		      // if no callback is passed, we pass conns to connHandler
		      if (!handler) {
		        handler = connHandler.bind(null, swarm.protocols);
		      }

		      var multiaddrs = dialables(swarm.transports[key], swarm._peerInfo.multiaddrs);

		      swarm.transports[key].createListener(multiaddrs, handler, function (err, maUpdate) {
		        if (err) {
		          return callback(err);
		        }
		        if (maUpdate) {
		          // because we can listen on port 0...
		          swarm._peerInfo.multiaddr.replace(multiaddrs, maUpdate);
		        }

		        callback();
		      });
		    },
		    close: function close(key, callback) {
		      var transport = swarm.transports[key];

		      if (!transport) {
		        return callback(new Error('Trying to close non existing transport: ' + key));
		      }

		      transport.close(callback);
		    }
		  };
		};

		// transform given multiaddrs to a list of dialable addresses
		// for the given transport `tp`.
		function dialables(tp, multiaddrs) {
		  return tp.filter(multiaddrs.map(function (addr) {
		    // ipfs multiaddrs are not dialable so we drop them here
		    if (contains(addr.protoNames(), 'ipfs')) {
		      return addr.decapsulate('ipfs');
		    }

		    return addr;
		  }));
		}

		function noop() {}

	/***/ },
	/* 661 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var debug = __webpack_require__(17);
		var log = debug('libp2p:websockets');
		var SWS = __webpack_require__(747);
		var mafmt = __webpack_require__(685);
		var parallel = __webpack_require__(278);

		exports = module.exports = WebSockets;

		function WebSockets() {
		  if (!(this instanceof WebSockets)) {
		    return new WebSockets();
		  }

		  var listeners = [];

		  this.dial = function (multiaddr, options) {
		    if (!options) {
		      options = {};
		    }

		    options.ready = options.ready || function noop() {};
		    var maOpts = multiaddr.toOptions();
		    var conn = new SWS('ws://' + maOpts.host + ':' + maOpts.port);
		    conn.on('connect', options.ready);
		    conn.getObservedAddrs = function () {
		      return [multiaddr];
		    };
		    return conn;
		  };

		  this.createListener = function (multiaddrs, options, handler, callback) {
		    if (typeof options === 'function') {
		      callback = handler;
		      handler = options;
		      options = {};
		    }

		    if (!Array.isArray(multiaddrs)) {
		      multiaddrs = [multiaddrs];
		    }

		    var count = 0;

		    multiaddrs.forEach(function (m) {
		      var listener = SWS.createServer(function (conn) {
		        conn.getObservedAddrs = function () {
		          return []; // TODO think if it makes sense for WebSockets
		        };
		        handler(conn);
		      });

		      listener.listen(m.toOptions().port, function () {
		        if (++count === multiaddrs.length) {
		          callback();
		        }
		      });
		      listeners.push(listener);
		    });
		  };

		  this.close = function (callback) {
		    if (listeners.length === 0) {
		      log('Called close with no active listeners');
		      return callback();
		    }

		    parallel(listeners.map(function (listener) {
		      return function (cb) {
		        return listener.close(cb);
		      };
		    }), callback);
		  };

		  this.filter = function (multiaddrs) {
		    return multiaddrs.filter(function (ma) {
		      return mafmt.WebSockets.matches(ma);
		    });
		  };
		}

	/***/ },
	/* 662 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(setImmediate) {module.exports = function () {

		  var locked = {}

		  function _releaser (key, exec) {
		    return function (done) {
		      return function () {
		      _release(key, exec)
		      if (done) done.apply(null, arguments)
		      }
		    }
		  }

		  function _release (key, exec) {
		    var i = locked[key].indexOf(exec) //should usually be 0

		    if(!~i) return

		    locked[key].splice(i, 1)

		    //note, that the next locker isn't triggered until next tick,
		    //so it's always after the released callback
		    if(isLocked(key))
		      setImmediate(function () {
		        locked[key][0](_releaser(key, locked[key][0]))
		      })
		    else
		      delete locked[key]
		  }

		  function _lock(key, exec) {
		    if(isLocked(key))
		      return locked[key].push(exec), false
		    return locked[key] = [exec], true
		  }

		  function lock(key, exec) {
		    if(Array.isArray(key)) {
		      var keys = key.length, locks = []
		      var l = {}

		      function releaser (done) {
		        return function () {
		          var args = [].slice.call(arguments)
		          for(var key in l)
		            _release(key, l[key])
		          done.apply(this, args)
		        }
		      }

		      key.forEach(function (key) {
		        var n = 0

		        function ready () {
		          if(n++) return
		          if(!--keys)
		            //all the keys are ready!
		            exec(releaser)
		        }

		        l[key] = ready
		        if(_lock(key, ready)) ready()
		      })

		      return
		    }

		    if(_lock(key, exec))
		      exec(_releaser(key, exec))
		  }

		  function isLocked (key) {
		    return Array.isArray(locked[key]) ? !! locked[key].length : false
		  }

		  lock.isLocked = isLocked

		  return lock
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(21).setImmediate))

	/***/ },
	/* 663 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var baseCreate = __webpack_require__(257),
		    isObject = __webpack_require__(119),
		    setBindData = __webpack_require__(170),
		    slice = __webpack_require__(118);

		/**
		 * Used for `Array` method references.
		 *
		 * Normally `Array.prototype` would suffice, however, using an array literal
		 * avoids issues in Narwhal.
		 */
		var arrayRef = [];

		/** Native method shortcuts */
		var push = arrayRef.push;

		/**
		 * The base implementation of `_.bind` that creates the bound function and
		 * sets its meta data.
		 *
		 * @private
		 * @param {Array} bindData The bind data array.
		 * @returns {Function} Returns the new bound function.
		 */
		function baseBind(bindData) {
		  var func = bindData[0],
		      partialArgs = bindData[2],
		      thisArg = bindData[4];

		  function bound() {
		    // `Function#bind` spec
		    // http://es5.github.io/#x15.3.4.5
		    if (partialArgs) {
		      // avoid `arguments` object deoptimizations by using `slice` instead
		      // of `Array.prototype.slice.call` and not assigning `arguments` to a
		      // variable as a ternary expression
		      var args = slice(partialArgs);
		      push.apply(args, arguments);
		    }
		    // mimic the constructor's `return` behavior
		    // http://es5.github.io/#x13.2.2
		    if (this instanceof bound) {
		      // ensure `new bound` is an instance of `func`
		      var thisBinding = baseCreate(func.prototype),
		          result = func.apply(thisBinding, args || arguments);
		      return isObject(result) ? result : thisBinding;
		    }
		    return func.apply(thisArg, args || arguments);
		  }
		  setBindData(bound, bindData);
		  return bound;
		}

		module.exports = baseBind;


	/***/ },
	/* 664 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var bind = __webpack_require__(673),
		    identity = __webpack_require__(677),
		    setBindData = __webpack_require__(170),
		    support = __webpack_require__(683);

		/** Used to detected named functions */
		var reFuncName = /^\s*function[ \n\r\t]+\w/;

		/** Used to detect functions containing a `this` reference */
		var reThis = /\bthis\b/;

		/** Native method shortcuts */
		var fnToString = Function.prototype.toString;

		/**
		 * The base implementation of `_.createCallback` without support for creating
		 * "_.pluck" or "_.where" style callbacks.
		 *
		 * @private
		 * @param {*} [func=identity] The value to convert to a callback.
		 * @param {*} [thisArg] The `this` binding of the created callback.
		 * @param {number} [argCount] The number of arguments the callback accepts.
		 * @returns {Function} Returns a callback function.
		 */
		function baseCreateCallback(func, thisArg, argCount) {
		  if (typeof func != 'function') {
		    return identity;
		  }
		  // exit early for no `thisArg` or already bound by `Function#bind`
		  if (typeof thisArg == 'undefined' || !('prototype' in func)) {
		    return func;
		  }
		  var bindData = func.__bindData__;
		  if (typeof bindData == 'undefined') {
		    if (support.funcNames) {
		      bindData = !func.name;
		    }
		    bindData = bindData || !support.funcDecomp;
		    if (!bindData) {
		      var source = fnToString.call(func);
		      if (!support.funcNames) {
		        bindData = !reFuncName.test(source);
		      }
		      if (!bindData) {
		        // checks if `func` references the `this` keyword and stores the result
		        bindData = reThis.test(source);
		        setBindData(func, bindData);
		      }
		    }
		  }
		  // exit early if there are no `this` references or `func` is bound
		  if (bindData === false || (bindData !== true && bindData[1] & 1)) {
		    return func;
		  }
		  switch (argCount) {
		    case 1: return function(value) {
		      return func.call(thisArg, value);
		    };
		    case 2: return function(a, b) {
		      return func.call(thisArg, a, b);
		    };
		    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);
		    };
		  }
		  return bind(func, thisArg);
		}

		module.exports = baseCreateCallback;


	/***/ },
	/* 665 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var baseCreate = __webpack_require__(257),
		    isObject = __webpack_require__(119),
		    setBindData = __webpack_require__(170),
		    slice = __webpack_require__(118);

		/**
		 * Used for `Array` method references.
		 *
		 * Normally `Array.prototype` would suffice, however, using an array literal
		 * avoids issues in Narwhal.
		 */
		var arrayRef = [];

		/** Native method shortcuts */
		var push = arrayRef.push;

		/**
		 * The base implementation of `createWrapper` that creates the wrapper and
		 * sets its meta data.
		 *
		 * @private
		 * @param {Array} bindData The bind data array.
		 * @returns {Function} Returns the new function.
		 */
		function baseCreateWrapper(bindData) {
		  var func = bindData[0],
		      bitmask = bindData[1],
		      partialArgs = bindData[2],
		      partialRightArgs = bindData[3],
		      thisArg = bindData[4],
		      arity = bindData[5];

		  var isBind = bitmask & 1,
		      isBindKey = bitmask & 2,
		      isCurry = bitmask & 4,
		      isCurryBound = bitmask & 8,
		      key = func;

		  function bound() {
		    var thisBinding = isBind ? thisArg : this;
		    if (partialArgs) {
		      var args = slice(partialArgs);
		      push.apply(args, arguments);
		    }
		    if (partialRightArgs || isCurry) {
		      args || (args = slice(arguments));
		      if (partialRightArgs) {
		        push.apply(args, partialRightArgs);
		      }
		      if (isCurry && args.length < arity) {
		        bitmask |= 16 & ~32;
		        return baseCreateWrapper([func, (isCurryBound ? bitmask : bitmask & ~3), args, null, thisArg, arity]);
		      }
		    }
		    args || (args = arguments);
		    if (isBindKey) {
		      func = thisBinding[key];
		    }
		    if (this instanceof bound) {
		      thisBinding = baseCreate(func.prototype);
		      var result = func.apply(thisBinding, args);
		      return isObject(result) ? result : thisBinding;
		    }
		    return func.apply(thisBinding, args);
		  }
		  setBindData(bound, bindData);
		  return bound;
		}

		module.exports = baseCreateWrapper;


	/***/ },
	/* 666 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * lodash 4.0.1 (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <https://lodash.com/license>
		 */
		var baseEach = __webpack_require__(258);

		/**
		 * The base implementation of `_.filter` without support for iteratee shorthands.
		 *
		 * @private
		 * @param {Array|Object} collection The collection to iterate over.
		 * @param {Function} predicate The function invoked per iteration.
		 * @returns {Array} Returns the new filtered array.
		 */
		function baseFilter(collection, predicate) {
		  var result = [];
		  baseEach(collection, function(value, index, collection) {
		    if (predicate(value, index, collection)) {
		      result.push(value);
		    }
		  });
		  return result;
		}

		module.exports = baseFilter;


	/***/ },
	/* 667 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/**
		 * The base implementation of `_.indexOf` without support for binary searches
		 * or `fromIndex` constraints.
		 *
		 * @private
		 * @param {Array} array The array to search.
		 * @param {*} value The value to search for.
		 * @param {number} [fromIndex=0] The index to search from.
		 * @returns {number} Returns the index of the matched value or `-1`.
		 */
		function baseIndexOf(array, value, fromIndex) {
		  var index = (fromIndex || 0) - 1,
		      length = array ? array.length : 0;

		  while (++index < length) {
		    if (array[index] === value) {
		      return index;
		    }
		  }
		  return -1;
		}

		module.exports = baseIndexOf;


	/***/ },
	/* 668 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(module, global) {/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */

		/** Used as references for various `Number` constants. */
		var INFINITY = 1 / 0;

		/** `Object#toString` result references. */
		var symbolTag = '[object Symbol]';

		/** Used to determine if values are of the language type `Object`. */
		var objectTypes = {
		  'function': true,
		  'object': true
		};

		/** Detect free variable `exports`. */
		var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
		  ? exports
		  : undefined;

		/** Detect free variable `module`. */
		var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
		  ? module
		  : undefined;

		/** Detect free variable `global` from Node.js. */
		var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);

		/** Detect free variable `self`. */
		var freeSelf = checkGlobal(objectTypes[typeof self] && self);

		/** Detect free variable `window`. */
		var freeWindow = checkGlobal(objectTypes[typeof window] && window);

		/** Detect `this` as the global object. */
		var thisGlobal = checkGlobal(objectTypes[typeof this] && this);

		/**
		 * 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 !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
		    freeSelf || thisGlobal || Function('return this')();

		/**
		 * Checks if `value` is a global object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {null|Object} Returns `value` if it's a global object, else `null`.
		 */
		function checkGlobal(value) {
		  return (value && value.Object === Object) ? value : null;
		}

		/** Used for built-in method references. */
		var objectProto = Object.prototype;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/** Built-in value references. */
		var Symbol = root.Symbol;

		/** Used to convert symbols to primitives and strings. */
		var symbolProto = Symbol ? Symbol.prototype : undefined,
		    symbolToString = symbolProto ? symbolProto.toString : undefined;

		/**
		 * The base implementation of `_.toString` which doesn't convert nullish
		 * values to empty strings.
		 *
		 * @private
		 * @param {*} value The value to process.
		 * @returns {string} Returns the string.
		 */
		function baseToString(value) {
		  // Exit early for strings to avoid a performance hit in some environments.
		  if (typeof value == 'string') {
		    return value;
		  }
		  if (isSymbol(value)) {
		    return symbolToString ? symbolToString.call(value) : '';
		  }
		  var result = (value + '');
		  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
		}

		/**
		 * Checks if `value` is object-like. A value is object-like if it's not `null`
		 * and has a `typeof` result of "object".
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
		 * @example
		 *
		 * _.isObjectLike({});
		 * // => true
		 *
		 * _.isObjectLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isObjectLike(_.noop);
		 * // => false
		 *
		 * _.isObjectLike(null);
		 * // => false
		 */
		function isObjectLike(value) {
		  return !!value && typeof value == 'object';
		}

		/**
		 * Checks if `value` is classified as a `Symbol` primitive or object.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isSymbol(Symbol.iterator);
		 * // => true
		 *
		 * _.isSymbol('abc');
		 * // => false
		 */
		function isSymbol(value) {
		  return typeof value == 'symbol' ||
		    (isObjectLike(value) && objectToString.call(value) == symbolTag);
		}

		module.exports = baseToString;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(48)(module), __webpack_require__(18)))

	/***/ },
	/* 669 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var baseBind = __webpack_require__(663),
		    baseCreateWrapper = __webpack_require__(665),
		    isFunction = __webpack_require__(680),
		    slice = __webpack_require__(118);

		/**
		 * Used for `Array` method references.
		 *
		 * Normally `Array.prototype` would suffice, however, using an array literal
		 * avoids issues in Narwhal.
		 */
		var arrayRef = [];

		/** Native method shortcuts */
		var push = arrayRef.push,
		    unshift = arrayRef.unshift;

		/**
		 * Creates a function that, when called, either curries or invokes `func`
		 * with an 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 method flags to compose.
		 *  The bitmask may be composed of the following flags:
		 *  1 - `_.bind`
		 *  2 - `_.bindKey`
		 *  4 - `_.curry`
		 *  8 - `_.curry` (bound)
		 *  16 - `_.partial`
		 *  32 - `_.partialRight`
		 * @param {Array} [partialArgs] An array of arguments to prepend to those
		 *  provided to the new function.
		 * @param {Array} [partialRightArgs] An array of arguments to append to those
		 *  provided to the new function.
		 * @param {*} [thisArg] The `this` binding of `func`.
		 * @param {number} [arity] The arity of `func`.
		 * @returns {Function} Returns the new function.
		 */
		function createWrapper(func, bitmask, partialArgs, partialRightArgs, thisArg, arity) {
		  var isBind = bitmask & 1,
		      isBindKey = bitmask & 2,
		      isCurry = bitmask & 4,
		      isCurryBound = bitmask & 8,
		      isPartial = bitmask & 16,
		      isPartialRight = bitmask & 32;

		  if (!isBindKey && !isFunction(func)) {
		    throw new TypeError;
		  }
		  if (isPartial && !partialArgs.length) {
		    bitmask &= ~16;
		    isPartial = partialArgs = false;
		  }
		  if (isPartialRight && !partialRightArgs.length) {
		    bitmask &= ~32;
		    isPartialRight = partialRightArgs = false;
		  }
		  var bindData = func && func.__bindData__;
		  if (bindData && bindData !== true) {
		    // clone `bindData`
		    bindData = slice(bindData);
		    if (bindData[2]) {
		      bindData[2] = slice(bindData[2]);
		    }
		    if (bindData[3]) {
		      bindData[3] = slice(bindData[3]);
		    }
		    // set `thisBinding` is not previously bound
		    if (isBind && !(bindData[1] & 1)) {
		      bindData[4] = thisArg;
		    }
		    // set if previously bound but not currently (subsequent curried functions)
		    if (!isBind && bindData[1] & 1) {
		      bitmask |= 8;
		    }
		    // set curried arity if not yet set
		    if (isCurry && !(bindData[1] & 4)) {
		      bindData[5] = arity;
		    }
		    // append partial left arguments
		    if (isPartial) {
		      push.apply(bindData[2] || (bindData[2] = []), partialArgs);
		    }
		    // append partial right arguments
		    if (isPartialRight) {
		      unshift.apply(bindData[3] || (bindData[3] = []), partialRightArgs);
		    }
		    // merge flags
		    bindData[1] |= bitmask;
		    return createWrapper.apply(null, bindData);
		  }
		  // fast path for `_.bind`
		  var creater = (bitmask == 1 || bitmask === 17) ? baseBind : baseCreateWrapper;
		  return creater([func, bitmask, partialArgs, partialRightArgs, thisArg, arity]);
		}

		module.exports = createWrapper;


	/***/ },
	/* 670 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(module, global) {/**
		 * lodash 3.0.1 (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <https://lodash.com/license>
		 */

		/** Used to determine if values are of the language type `Object`. */
		var objectTypes = {
		  'function': true,
		  'object': true
		};

		/** Detect free variable `exports`. */
		var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
		  ? exports
		  : undefined;

		/** Detect free variable `module`. */
		var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
		  ? module
		  : undefined;

		/** Detect free variable `global` from Node.js. */
		var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);

		/** Detect free variable `self`. */
		var freeSelf = checkGlobal(objectTypes[typeof self] && self);

		/** Detect free variable `window`. */
		var freeWindow = checkGlobal(objectTypes[typeof window] && window);

		/** Detect `this` as the global object. */
		var thisGlobal = checkGlobal(objectTypes[typeof this] && this);

		/**
		 * 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 !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
		    freeSelf || thisGlobal || Function('return this')();

		/**
		 * Checks if `value` is a global object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {null|Object} Returns `value` if it's a global object, else `null`.
		 */
		function checkGlobal(value) {
		  return (value && value.Object === Object) ? value : null;
		}

		module.exports = root;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(48)(module), __webpack_require__(18)))

	/***/ },
	/* 671 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var objectTypes = __webpack_require__(169);

		/** Used for native method references */
		var objectProto = Object.prototype;

		/** Native method shortcuts */
		var hasOwnProperty = objectProto.hasOwnProperty;

		/**
		 * A fallback implementation of `Object.keys` which produces an array of the
		 * given object's own enumerable property names.
		 *
		 * @private
		 * @type Function
		 * @param {Object} object The object to inspect.
		 * @returns {Array} Returns an array of property names.
		 */
		var shimKeys = function(object) {
		  var index, iterable = object, result = [];
		  if (!iterable) return result;
		  if (!(objectTypes[typeof object])) return result;
		    for (index in iterable) {
		      if (hasOwnProperty.call(iterable, index)) {
		        result.push(index);
		      }
		    }
		  return result
		};

		module.exports = shimKeys;


	/***/ },
	/* 672 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(module, global) {/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */
		var baseToString = __webpack_require__(668);

		/** Used as the `TypeError` message for "Functions" methods. */
		var FUNC_ERROR_TEXT = 'Expected a function';

		/** Used to stand-in for `undefined` hash values. */
		var HASH_UNDEFINED = '__lodash_hash_undefined__';

		/** `Object#toString` result references. */
		var funcTag = '[object Function]',
		    genTag = '[object GeneratorFunction]';

		/** Used to match property names within property paths. */
		var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]/g;

		/**
		 * Used to match `RegExp`
		 * [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns).
		 */
		var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;

		/** Used to match backslashes in property paths. */
		var reEscapeChar = /\\(\\)?/g;

		/** Used to detect host constructors (Safari). */
		var reIsHostCtor = /^\[object .+?Constructor\]$/;

		/** Used to determine if values are of the language type `Object`. */
		var objectTypes = {
		  'function': true,
		  'object': true
		};

		/** Detect free variable `exports`. */
		var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
		  ? exports
		  : undefined;

		/** Detect free variable `module`. */
		var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
		  ? module
		  : undefined;

		/** Detect free variable `global` from Node.js. */
		var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);

		/** Detect free variable `self`. */
		var freeSelf = checkGlobal(objectTypes[typeof self] && self);

		/** Detect free variable `window`. */
		var freeWindow = checkGlobal(objectTypes[typeof window] && window);

		/** Detect `this` as the global object. */
		var thisGlobal = checkGlobal(objectTypes[typeof this] && this);

		/**
		 * 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 !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
		    freeSelf || thisGlobal || Function('return this')();

		/**
		 * Checks if `value` is a global object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {null|Object} Returns `value` if it's a global object, else `null`.
		 */
		function checkGlobal(value) {
		  return (value && value.Object === Object) ? value : null;
		}

		/**
		 * Checks if `value` is a host object in IE < 9.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
		 */
		function isHostObject(value) {
		  // Many host objects are `Object` objects that can coerce to strings
		  // despite having improperly defined `toString` methods.
		  var result = false;
		  if (value != null && typeof value.toString != 'function') {
		    try {
		      result = !!(value + '');
		    } catch (e) {}
		  }
		  return result;
		}

		/** Used for built-in method references. */
		var arrayProto = Array.prototype,
		    objectProto = Object.prototype;

		/** Used to resolve the decompiled source of functions. */
		var funcToString = Function.prototype.toString;

		/** Used to check objects for own properties. */
		var hasOwnProperty = objectProto.hasOwnProperty;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/** Used to detect if a method is native. */
		var reIsNative = RegExp('^' +
		  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
		  .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
		);

		/** Built-in value references. */
		var splice = arrayProto.splice;

		/* Built-in method references that are verified to be native. */
		var Map = getNative(root, 'Map'),
		    nativeCreate = getNative(Object, 'create');

		/**
		 * Creates a hash object.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function Hash(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the hash.
		 *
		 * @private
		 * @name clear
		 * @memberOf Hash
		 */
		function hashClear() {
		  this.__data__ = nativeCreate ? nativeCreate(null) : {};
		}

		/**
		 * Removes `key` and its value from the hash.
		 *
		 * @private
		 * @name delete
		 * @memberOf Hash
		 * @param {Object} hash The hash to modify.
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function hashDelete(key) {
		  return this.has(key) && delete this.__data__[key];
		}

		/**
		 * Gets the hash value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf Hash
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function hashGet(key) {
		  var data = this.__data__;
		  if (nativeCreate) {
		    var result = data[key];
		    return result === HASH_UNDEFINED ? undefined : result;
		  }
		  return hasOwnProperty.call(data, key) ? data[key] : undefined;
		}

		/**
		 * Checks if a hash value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf Hash
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function hashHas(key) {
		  var data = this.__data__;
		  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);
		}

		/**
		 * Sets the hash `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf Hash
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the hash instance.
		 */
		function hashSet(key, value) {
		  var data = this.__data__;
		  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;
		  return this;
		}

		// Add methods to `Hash`.
		Hash.prototype.clear = hashClear;
		Hash.prototype['delete'] = hashDelete;
		Hash.prototype.get = hashGet;
		Hash.prototype.has = hashHas;
		Hash.prototype.set = hashSet;

		/**
		 * Creates an list cache object.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function ListCache(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the list cache.
		 *
		 * @private
		 * @name clear
		 * @memberOf ListCache
		 */
		function listCacheClear() {
		  this.__data__ = [];
		}

		/**
		 * Removes `key` and its value from the list cache.
		 *
		 * @private
		 * @name delete
		 * @memberOf ListCache
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function listCacheDelete(key) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  if (index < 0) {
		    return false;
		  }
		  var lastIndex = data.length - 1;
		  if (index == lastIndex) {
		    data.pop();
		  } else {
		    splice.call(data, index, 1);
		  }
		  return true;
		}

		/**
		 * Gets the list cache value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf ListCache
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function listCacheGet(key) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  return index < 0 ? undefined : data[index][1];
		}

		/**
		 * Checks if a list cache value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf ListCache
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function listCacheHas(key) {
		  return assocIndexOf(this.__data__, key) > -1;
		}

		/**
		 * Sets the list cache `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf ListCache
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the list cache instance.
		 */
		function listCacheSet(key, value) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  if (index < 0) {
		    data.push([key, value]);
		  } else {
		    data[index][1] = value;
		  }
		  return this;
		}

		// Add methods to `ListCache`.
		ListCache.prototype.clear = listCacheClear;
		ListCache.prototype['delete'] = listCacheDelete;
		ListCache.prototype.get = listCacheGet;
		ListCache.prototype.has = listCacheHas;
		ListCache.prototype.set = listCacheSet;

		/**
		 * Creates a map cache object to store key-value pairs.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function MapCache(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the map.
		 *
		 * @private
		 * @name clear
		 * @memberOf MapCache
		 */
		function mapCacheClear() {
		  this.__data__ = {
		    'hash': new Hash,
		    'map': new (Map || ListCache),
		    'string': new Hash
		  };
		}

		/**
		 * Removes `key` and its value from the map.
		 *
		 * @private
		 * @name delete
		 * @memberOf MapCache
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function mapCacheDelete(key) {
		  return getMapData(this, key)['delete'](key);
		}

		/**
		 * Gets the map value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf MapCache
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function mapCacheGet(key) {
		  return getMapData(this, key).get(key);
		}

		/**
		 * Checks if a map value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf MapCache
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function mapCacheHas(key) {
		  return getMapData(this, key).has(key);
		}

		/**
		 * Sets the map `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf MapCache
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the map cache instance.
		 */
		function mapCacheSet(key, value) {
		  getMapData(this, key).set(key, value);
		  return this;
		}

		// Add methods to `MapCache`.
		MapCache.prototype.clear = mapCacheClear;
		MapCache.prototype['delete'] = mapCacheDelete;
		MapCache.prototype.get = mapCacheGet;
		MapCache.prototype.has = mapCacheHas;
		MapCache.prototype.set = mapCacheSet;

		/**
		 * Gets the index at which the `key` is found in `array` of key-value pairs.
		 *
		 * @private
		 * @param {Array} array The array to search.
		 * @param {*} key The key to search for.
		 * @returns {number} Returns the index of the matched value, else `-1`.
		 */
		function assocIndexOf(array, key) {
		  var length = array.length;
		  while (length--) {
		    if (eq(array[length][0], key)) {
		      return length;
		    }
		  }
		  return -1;
		}

		/**
		 * Gets the data for `map`.
		 *
		 * @private
		 * @param {Object} map The map to query.
		 * @param {string} key The reference key.
		 * @returns {*} Returns the map data.
		 */
		function getMapData(map, key) {
		  var data = map.__data__;
		  return isKeyable(key)
		    ? data[typeof key == 'string' ? 'string' : 'hash']
		    : data.map;
		}

		/**
		 * Gets the 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[key];
		  return isNative(value) ? value : undefined;
		}

		/**
		 * Checks if `value` is suitable for use as unique object key.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
		 */
		function isKeyable(value) {
		  var type = typeof value;
		  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
		    ? (value !== '__proto__')
		    : (value === null);
		}

		/**
		 * Converts `string` to a property path array.
		 *
		 * @private
		 * @param {string} string The string to convert.
		 * @returns {Array} Returns the property path array.
		 */
		var stringToPath = memoize(function(string) {
		  var result = [];
		  toString(string).replace(rePropName, function(match, number, quote, string) {
		    result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
		  });
		  return result;
		});

		/**
		 * Converts `func` to its source code.
		 *
		 * @private
		 * @param {Function} func The function to process.
		 * @returns {string} Returns the source code.
		 */
		function toSource(func) {
		  if (func != null) {
		    try {
		      return funcToString.call(func);
		    } catch (e) {}
		    try {
		      return (func + '');
		    } catch (e) {}
		  }
		  return '';
		}

		/**
		 * Creates a function that memoizes the result of `func`. If `resolver` is
		 * provided, it determines the cache key for storing the result based on the
		 * arguments provided to the memoized function. By default, the first argument
		 * provided to the memoized function is used as the map cache key. The `func`
		 * is invoked with the `this` binding of the memoized function.
		 *
		 * **Note:** The cache is exposed as the `cache` property on the memoized
		 * function. Its creation may be customized by replacing the `_.memoize.Cache`
		 * constructor with one whose instances implement the
		 * [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object)
		 * method interface of `delete`, `get`, `has`, and `set`.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Function
		 * @param {Function} func The function to have its output memoized.
		 * @param {Function} [resolver] The function to resolve the cache key.
		 * @returns {Function} Returns the new memoized function.
		 * @example
		 *
		 * var object = { 'a': 1, 'b': 2 };
		 * var other = { 'c': 3, 'd': 4 };
		 *
		 * var values = _.memoize(_.values);
		 * values(object);
		 * // => [1, 2]
		 *
		 * values(other);
		 * // => [3, 4]
		 *
		 * object.a = 2;
		 * values(object);
		 * // => [1, 2]
		 *
		 * // Modify the result cache.
		 * values.cache.set(object, ['a', 'b']);
		 * values(object);
		 * // => ['a', 'b']
		 *
		 * // Replace `_.memoize.Cache`.
		 * _.memoize.Cache = WeakMap;
		 */
		function memoize(func, resolver) {
		  if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
		    throw new TypeError(FUNC_ERROR_TEXT);
		  }
		  var memoized = function() {
		    var args = arguments,
		        key = resolver ? resolver.apply(this, args) : args[0],
		        cache = memoized.cache;

		    if (cache.has(key)) {
		      return cache.get(key);
		    }
		    var result = func.apply(this, args);
		    memoized.cache = cache.set(key, result);
		    return result;
		  };
		  memoized.cache = new (memoize.Cache || MapCache);
		  return memoized;
		}

		// Assign cache to `_.memoize`.
		memoize.Cache = MapCache;

		/**
		 * Performs a
		 * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
		 * comparison between two values to determine if they are equivalent.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to compare.
		 * @param {*} other The other value to compare.
		 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		 * @example
		 *
		 * var object = { 'user': 'fred' };
		 * var other = { 'user': 'fred' };
		 *
		 * _.eq(object, object);
		 * // => true
		 *
		 * _.eq(object, other);
		 * // => false
		 *
		 * _.eq('a', 'a');
		 * // => true
		 *
		 * _.eq('a', Object('a'));
		 * // => false
		 *
		 * _.eq(NaN, NaN);
		 * // => true
		 */
		function eq(value, other) {
		  return value === other || (value !== value && other !== other);
		}

		/**
		 * Checks if `value` is classified as a `Function` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is 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 Safari 8 which returns 'object' for typed array and weak map constructors,
		  // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		  var tag = isObject(value) ? objectToString.call(value) : '';
		  return tag == funcTag || tag == genTag;
		}

		/**
		 * Checks if `value` is the
		 * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
		 * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(_.noop);
		 * // => true
		 *
		 * _.isObject(null);
		 * // => false
		 */
		function isObject(value) {
		  var type = typeof value;
		  return !!value && (type == 'object' || type == 'function');
		}

		/**
		 * Checks if `value` is a native function.
		 *
		 * @static
		 * @memberOf _
		 * @since 3.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a native function,
		 *  else `false`.
		 * @example
		 *
		 * _.isNative(Array.prototype.push);
		 * // => true
		 *
		 * _.isNative(_);
		 * // => false
		 */
		function isNative(value) {
		  if (!isObject(value)) {
		    return false;
		  }
		  var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;
		  return pattern.test(toSource(value));
		}

		/**
		 * Converts `value` to a string. An empty string is returned for `null`
		 * and `undefined` values. The sign of `-0` is preserved.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to process.
		 * @returns {string} Returns the string.
		 * @example
		 *
		 * _.toString(null);
		 * // => ''
		 *
		 * _.toString(-0);
		 * // => '-0'
		 *
		 * _.toString([1, 2, 3]);
		 * // => '1,2,3'
		 */
		function toString(value) {
		  return value == null ? '' : baseToString(value);
		}

		module.exports = stringToPath;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(48)(module), __webpack_require__(18)))

	/***/ },
	/* 673 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var createWrapper = __webpack_require__(669),
		    slice = __webpack_require__(118);

		/**
		 * Creates a function that, when called, invokes `func` with the `this`
		 * binding of `thisArg` and prepends any additional `bind` arguments to those
		 * provided to the bound function.
		 *
		 * @static
		 * @memberOf _
		 * @category Functions
		 * @param {Function} func The function to bind.
		 * @param {*} [thisArg] The `this` binding of `func`.
		 * @param {...*} [arg] Arguments to be partially applied.
		 * @returns {Function} Returns the new bound function.
		 * @example
		 *
		 * var func = function(greeting) {
		 *   return greeting + ' ' + this.name;
		 * };
		 *
		 * func = _.bind(func, { 'name': 'fred' }, 'hi');
		 * func();
		 * // => 'hi fred'
		 */
		function bind(func, thisArg) {
		  return arguments.length > 2
		    ? createWrapper(func, 17, slice(arguments, 2), null, thisArg)
		    : createWrapper(func, 1, null, null, thisArg);
		}

		module.exports = bind;


	/***/ },
	/* 674 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */
		var baseFilter = __webpack_require__(666),
		    baseIteratee = __webpack_require__(259);

		/**
		 * A specialized version of `_.filter` for arrays without support for
		 * iteratee shorthands.
		 *
		 * @private
		 * @param {Array} array The array to iterate over.
		 * @param {Function} predicate The function invoked per iteration.
		 * @returns {Array} Returns the new filtered array.
		 */
		function arrayFilter(array, predicate) {
		  var index = -1,
		      length = array.length,
		      resIndex = 0,
		      result = [];

		  while (++index < length) {
		    var value = array[index];
		    if (predicate(value, index, array)) {
		      result[resIndex++] = value;
		    }
		  }
		  return result;
		}

		/**
		 * Iterates over elements of `collection`, returning an array of all elements
		 * `predicate` returns truthy for. The predicate is invoked with three
		 * arguments: (value, index|key, collection).
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Collection
		 * @param {Array|Object} collection The collection to iterate over.
		 * @param {Array|Function|Object|string} [predicate=_.identity]
		 *  The function invoked per iteration.
		 * @returns {Array} Returns the new filtered array.
		 * @see _.reject
		 * @example
		 *
		 * var users = [
		 *   { 'user': 'barney', 'age': 36, 'active': true },
		 *   { 'user': 'fred',   'age': 40, 'active': false }
		 * ];
		 *
		 * _.filter(users, function(o) { return !o.active; });
		 * // => objects for ['fred']
		 *
		 * // The `_.matches` iteratee shorthand.
		 * _.filter(users, { 'age': 36, 'active': true });
		 * // => objects for ['barney']
		 *
		 * // The `_.matchesProperty` iteratee shorthand.
		 * _.filter(users, ['active', false]);
		 * // => objects for ['fred']
		 *
		 * // The `_.property` iteratee shorthand.
		 * _.filter(users, 'active');
		 * // => objects for ['barney']
		 */
		function filter(collection, predicate) {
		  var func = isArray(collection) ? arrayFilter : baseFilter;
		  return func(collection, baseIteratee(predicate, 3));
		}

		/**
		 * Checks if `value` is classified as an `Array` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @type {Function}
		 * @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(document.body.children);
		 * // => false
		 *
		 * _.isArray('abc');
		 * // => false
		 *
		 * _.isArray(_.noop);
		 * // => false
		 */
		var isArray = Array.isArray;

		module.exports = filter;


	/***/ },
	/* 675 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var baseCreateCallback = __webpack_require__(664),
		    keys = __webpack_require__(676),
		    objectTypes = __webpack_require__(169);

		/**
		 * Iterates over own enumerable properties of an object, executing the callback
		 * for each property. The callback is bound to `thisArg` and invoked with three
		 * arguments; (value, key, object). Callbacks may exit iteration early by
		 * explicitly returning `false`.
		 *
		 * @static
		 * @memberOf _
		 * @type Function
		 * @category Objects
		 * @param {Object} object The object to iterate over.
		 * @param {Function} [callback=identity] The function called per iteration.
		 * @param {*} [thisArg] The `this` binding of `callback`.
		 * @returns {Object} Returns `object`.
		 * @example
		 *
		 * _.forOwn({ '0': 'zero', '1': 'one', 'length': 2 }, function(num, key) {
		 *   console.log(key);
		 * });
		 * // => logs '0', '1', and 'length' (property order is not guaranteed across environments)
		 */
		var forOwn = function(collection, callback, thisArg) {
		  var index, iterable = collection, result = iterable;
		  if (!iterable) return result;
		  if (!objectTypes[typeof iterable]) return result;
		  callback = callback && typeof thisArg == 'undefined' ? callback : baseCreateCallback(callback, thisArg, 3);
		    var ownIndex = -1,
		        ownProps = objectTypes[typeof iterable] && keys(iterable),
		        length = ownProps ? ownProps.length : 0;

		    while (++ownIndex < length) {
		      index = ownProps[ownIndex];
		      if (callback(iterable[index], index, collection) === false) return result;
		    }
		  return result
		};

		module.exports = forOwn;


	/***/ },
	/* 676 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var isNative = __webpack_require__(88),
		    isObject = __webpack_require__(119),
		    shimKeys = __webpack_require__(671);

		/* Native method shortcuts for methods with the same name as other `lodash` methods */
		var nativeKeys = isNative(nativeKeys = Object.keys) && nativeKeys;

		/**
		 * Creates an array composed of the own enumerable property names of an object.
		 *
		 * @static
		 * @memberOf _
		 * @category Objects
		 * @param {Object} object The object to inspect.
		 * @returns {Array} Returns an array of property names.
		 * @example
		 *
		 * _.keys({ 'one': 1, 'two': 2, 'three': 3 });
		 * // => ['one', 'two', 'three'] (property order is not guaranteed across environments)
		 */
		var keys = !nativeKeys ? shimKeys : function(object) {
		  if (!isObject(object)) {
		    return [];
		  }
		  return nativeKeys(object);
		};

		module.exports = keys;


	/***/ },
	/* 677 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/**
		 * This method returns the first argument provided to it.
		 *
		 * @static
		 * @memberOf _
		 * @category Utilities
		 * @param {*} value Any value.
		 * @returns {*} Returns `value`.
		 * @example
		 *
		 * var object = { 'name': 'fred' };
		 * _.identity(object) === object;
		 * // => true
		 */
		function identity(value) {
		  return value;
		}

		module.exports = identity;


	/***/ },
	/* 678 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var isNative = __webpack_require__(88);

		/** `Object#toString` result shortcuts */
		var arrayClass = '[object Array]';

		/** Used for native method references */
		var objectProto = Object.prototype;

		/** Used to resolve the internal [[Class]] of values */
		var toString = objectProto.toString;

		/* Native method shortcuts for methods with the same name as other `lodash` methods */
		var nativeIsArray = isNative(nativeIsArray = Array.isArray) && nativeIsArray;

		/**
		 * Checks if `value` is an array.
		 *
		 * @static
		 * @memberOf _
		 * @type Function
		 * @category Objects
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if the `value` is an array, else `false`.
		 * @example
		 *
		 * (function() { return _.isArray(arguments); })();
		 * // => false
		 *
		 * _.isArray([1, 2, 3]);
		 * // => true
		 */
		var isArray = nativeIsArray || function(value) {
		  return value && typeof value == 'object' && typeof value.length == 'number' &&
		    toString.call(value) == arrayClass || false;
		};

		module.exports = isArray;


	/***/ },
	/* 679 */
	/***/ function(module, exports, __webpack_require__) {

		/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */
		var keys = __webpack_require__(682),
		    root = __webpack_require__(670);

		/** Used as the size to enable large array optimizations. */
		var LARGE_ARRAY_SIZE = 200;

		/** Used to stand-in for `undefined` hash values. */
		var HASH_UNDEFINED = '__lodash_hash_undefined__';

		/** Used to compose bitmasks for comparison styles. */
		var UNORDERED_COMPARE_FLAG = 1,
		    PARTIAL_COMPARE_FLAG = 2;

		/** Used as references for various `Number` constants. */
		var MAX_SAFE_INTEGER = 9007199254740991;

		/** `Object#toString` result references. */
		var argsTag = '[object Arguments]',
		    arrayTag = '[object Array]',
		    boolTag = '[object Boolean]',
		    dateTag = '[object Date]',
		    errorTag = '[object Error]',
		    funcTag = '[object Function]',
		    genTag = '[object GeneratorFunction]',
		    mapTag = '[object Map]',
		    numberTag = '[object Number]',
		    objectTag = '[object Object]',
		    promiseTag = '[object Promise]',
		    regexpTag = '[object RegExp]',
		    setTag = '[object Set]',
		    stringTag = '[object String]',
		    symbolTag = '[object Symbol]',
		    weakMapTag = '[object WeakMap]';

		var arrayBufferTag = '[object ArrayBuffer]',
		    dataViewTag = '[object DataView]',
		    float32Tag = '[object Float32Array]',
		    float64Tag = '[object Float64Array]',
		    int8Tag = '[object Int8Array]',
		    int16Tag = '[object Int16Array]',
		    int32Tag = '[object Int32Array]',
		    uint8Tag = '[object Uint8Array]',
		    uint8ClampedTag = '[object Uint8ClampedArray]',
		    uint16Tag = '[object Uint16Array]',
		    uint32Tag = '[object Uint32Array]';

		/**
		 * Used to match `RegExp`
		 * [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns).
		 */
		var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;

		/** Used to detect host constructors (Safari). */
		var reIsHostCtor = /^\[object .+?Constructor\]$/;

		/** Used to identify `toStringTag` values of typed arrays. */
		var typedArrayTags = {};
		typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
		typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
		typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
		typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
		typedArrayTags[uint32Tag] = true;
		typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
		typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
		typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
		typedArrayTags[errorTag] = typedArrayTags[funcTag] =
		typedArrayTags[mapTag] = typedArrayTags[numberTag] =
		typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
		typedArrayTags[setTag] = typedArrayTags[stringTag] =
		typedArrayTags[weakMapTag] = false;

		/**
		 * A specialized version of `_.some` for arrays without support for iteratee
		 * shorthands.
		 *
		 * @private
		 * @param {Array} array The array to iterate over.
		 * @param {Function} predicate The function invoked per iteration.
		 * @returns {boolean} Returns `true` if any element passes the predicate check,
		 *  else `false`.
		 */
		function arraySome(array, predicate) {
		  var index = -1,
		      length = array.length;

		  while (++index < length) {
		    if (predicate(array[index], index, array)) {
		      return true;
		    }
		  }
		  return false;
		}

		/**
		 * Checks if `value` is a host object in IE < 9.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
		 */
		function isHostObject(value) {
		  // Many host objects are `Object` objects that can coerce to strings
		  // despite having improperly defined `toString` methods.
		  var result = false;
		  if (value != null && typeof value.toString != 'function') {
		    try {
		      result = !!(value + '');
		    } catch (e) {}
		  }
		  return result;
		}

		/**
		 * Converts `map` to its key-value pairs.
		 *
		 * @private
		 * @param {Object} map The map to convert.
		 * @returns {Array} Returns the key-value pairs.
		 */
		function mapToArray(map) {
		  var index = -1,
		      result = Array(map.size);

		  map.forEach(function(value, key) {
		    result[++index] = [key, value];
		  });
		  return result;
		}

		/**
		 * Converts `set` to an array of its values.
		 *
		 * @private
		 * @param {Object} set The set to convert.
		 * @returns {Array} Returns the values.
		 */
		function setToArray(set) {
		  var index = -1,
		      result = Array(set.size);

		  set.forEach(function(value) {
		    result[++index] = value;
		  });
		  return result;
		}

		/** Used for built-in method references. */
		var arrayProto = Array.prototype,
		    objectProto = Object.prototype;

		/** Used to resolve the decompiled source of functions. */
		var funcToString = Function.prototype.toString;

		/** Used to check objects for own properties. */
		var hasOwnProperty = objectProto.hasOwnProperty;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/** Used to detect if a method is native. */
		var reIsNative = RegExp('^' +
		  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
		  .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
		);

		/** Built-in value references. */
		var Symbol = root.Symbol,
		    Uint8Array = root.Uint8Array,
		    splice = arrayProto.splice;

		/* Built-in method references for those with the same name as other `lodash` methods. */
		var nativeGetPrototype = Object.getPrototypeOf;

		/* Built-in method references that are verified to be native. */
		var DataView = getNative(root, 'DataView'),
		    Map = getNative(root, 'Map'),
		    Promise = getNative(root, 'Promise'),
		    Set = getNative(root, 'Set'),
		    WeakMap = getNative(root, 'WeakMap'),
		    nativeCreate = getNative(Object, 'create');

		/** Used to detect maps, sets, and weakmaps. */
		var dataViewCtorString = toSource(DataView),
		    mapCtorString = toSource(Map),
		    promiseCtorString = toSource(Promise),
		    setCtorString = toSource(Set),
		    weakMapCtorString = toSource(WeakMap);

		/** Used to convert symbols to primitives and strings. */
		var symbolProto = Symbol ? Symbol.prototype : undefined,
		    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;

		/**
		 * Creates a hash object.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function Hash(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the hash.
		 *
		 * @private
		 * @name clear
		 * @memberOf Hash
		 */
		function hashClear() {
		  this.__data__ = nativeCreate ? nativeCreate(null) : {};
		}

		/**
		 * Removes `key` and its value from the hash.
		 *
		 * @private
		 * @name delete
		 * @memberOf Hash
		 * @param {Object} hash The hash to modify.
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function hashDelete(key) {
		  return this.has(key) && delete this.__data__[key];
		}

		/**
		 * Gets the hash value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf Hash
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function hashGet(key) {
		  var data = this.__data__;
		  if (nativeCreate) {
		    var result = data[key];
		    return result === HASH_UNDEFINED ? undefined : result;
		  }
		  return hasOwnProperty.call(data, key) ? data[key] : undefined;
		}

		/**
		 * Checks if a hash value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf Hash
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function hashHas(key) {
		  var data = this.__data__;
		  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);
		}

		/**
		 * Sets the hash `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf Hash
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the hash instance.
		 */
		function hashSet(key, value) {
		  var data = this.__data__;
		  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;
		  return this;
		}

		// Add methods to `Hash`.
		Hash.prototype.clear = hashClear;
		Hash.prototype['delete'] = hashDelete;
		Hash.prototype.get = hashGet;
		Hash.prototype.has = hashHas;
		Hash.prototype.set = hashSet;

		/**
		 * Creates an list cache object.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function ListCache(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the list cache.
		 *
		 * @private
		 * @name clear
		 * @memberOf ListCache
		 */
		function listCacheClear() {
		  this.__data__ = [];
		}

		/**
		 * Removes `key` and its value from the list cache.
		 *
		 * @private
		 * @name delete
		 * @memberOf ListCache
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function listCacheDelete(key) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  if (index < 0) {
		    return false;
		  }
		  var lastIndex = data.length - 1;
		  if (index == lastIndex) {
		    data.pop();
		  } else {
		    splice.call(data, index, 1);
		  }
		  return true;
		}

		/**
		 * Gets the list cache value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf ListCache
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function listCacheGet(key) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  return index < 0 ? undefined : data[index][1];
		}

		/**
		 * Checks if a list cache value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf ListCache
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function listCacheHas(key) {
		  return assocIndexOf(this.__data__, key) > -1;
		}

		/**
		 * Sets the list cache `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf ListCache
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the list cache instance.
		 */
		function listCacheSet(key, value) {
		  var data = this.__data__,
		      index = assocIndexOf(data, key);

		  if (index < 0) {
		    data.push([key, value]);
		  } else {
		    data[index][1] = value;
		  }
		  return this;
		}

		// Add methods to `ListCache`.
		ListCache.prototype.clear = listCacheClear;
		ListCache.prototype['delete'] = listCacheDelete;
		ListCache.prototype.get = listCacheGet;
		ListCache.prototype.has = listCacheHas;
		ListCache.prototype.set = listCacheSet;

		/**
		 * Creates a map cache object to store key-value pairs.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function MapCache(entries) {
		  var index = -1,
		      length = entries ? entries.length : 0;

		  this.clear();
		  while (++index < length) {
		    var entry = entries[index];
		    this.set(entry[0], entry[1]);
		  }
		}

		/**
		 * Removes all key-value entries from the map.
		 *
		 * @private
		 * @name clear
		 * @memberOf MapCache
		 */
		function mapCacheClear() {
		  this.__data__ = {
		    'hash': new Hash,
		    'map': new (Map || ListCache),
		    'string': new Hash
		  };
		}

		/**
		 * Removes `key` and its value from the map.
		 *
		 * @private
		 * @name delete
		 * @memberOf MapCache
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function mapCacheDelete(key) {
		  return getMapData(this, key)['delete'](key);
		}

		/**
		 * Gets the map value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf MapCache
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function mapCacheGet(key) {
		  return getMapData(this, key).get(key);
		}

		/**
		 * Checks if a map value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf MapCache
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function mapCacheHas(key) {
		  return getMapData(this, key).has(key);
		}

		/**
		 * Sets the map `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf MapCache
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the map cache instance.
		 */
		function mapCacheSet(key, value) {
		  getMapData(this, key).set(key, value);
		  return this;
		}

		// Add methods to `MapCache`.
		MapCache.prototype.clear = mapCacheClear;
		MapCache.prototype['delete'] = mapCacheDelete;
		MapCache.prototype.get = mapCacheGet;
		MapCache.prototype.has = mapCacheHas;
		MapCache.prototype.set = mapCacheSet;

		/**
		 *
		 * Creates an array cache object to store unique values.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [values] The values to cache.
		 */
		function SetCache(values) {
		  var index = -1,
		      length = values ? values.length : 0;

		  this.__data__ = new MapCache;
		  while (++index < length) {
		    this.add(values[index]);
		  }
		}

		/**
		 * Adds `value` to the array cache.
		 *
		 * @private
		 * @name add
		 * @memberOf SetCache
		 * @alias push
		 * @param {*} value The value to cache.
		 * @returns {Object} Returns the cache instance.
		 */
		function setCacheAdd(value) {
		  this.__data__.set(value, HASH_UNDEFINED);
		  return this;
		}

		/**
		 * Checks if `value` is in the array cache.
		 *
		 * @private
		 * @name has
		 * @memberOf SetCache
		 * @param {*} value The value to search for.
		 * @returns {number} Returns `true` if `value` is found, else `false`.
		 */
		function setCacheHas(value) {
		  return this.__data__.has(value);
		}

		// Add methods to `SetCache`.
		SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
		SetCache.prototype.has = setCacheHas;

		/**
		 * Creates a stack cache object to store key-value pairs.
		 *
		 * @private
		 * @constructor
		 * @param {Array} [entries] The key-value pairs to cache.
		 */
		function Stack(entries) {
		  this.__data__ = new ListCache(entries);
		}

		/**
		 * Removes all key-value entries from the stack.
		 *
		 * @private
		 * @name clear
		 * @memberOf Stack
		 */
		function stackClear() {
		  this.__data__ = new ListCache;
		}

		/**
		 * Removes `key` and its value from the stack.
		 *
		 * @private
		 * @name delete
		 * @memberOf Stack
		 * @param {string} key The key of the value to remove.
		 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
		 */
		function stackDelete(key) {
		  return this.__data__['delete'](key);
		}

		/**
		 * Gets the stack value for `key`.
		 *
		 * @private
		 * @name get
		 * @memberOf Stack
		 * @param {string} key The key of the value to get.
		 * @returns {*} Returns the entry value.
		 */
		function stackGet(key) {
		  return this.__data__.get(key);
		}

		/**
		 * Checks if a stack value for `key` exists.
		 *
		 * @private
		 * @name has
		 * @memberOf Stack
		 * @param {string} key The key of the entry to check.
		 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
		 */
		function stackHas(key) {
		  return this.__data__.has(key);
		}

		/**
		 * Sets the stack `key` to `value`.
		 *
		 * @private
		 * @name set
		 * @memberOf Stack
		 * @param {string} key The key of the value to set.
		 * @param {*} value The value to set.
		 * @returns {Object} Returns the stack cache instance.
		 */
		function stackSet(key, value) {
		  var cache = this.__data__;
		  if (cache instanceof ListCache && cache.__data__.length == LARGE_ARRAY_SIZE) {
		    cache = this.__data__ = new MapCache(cache.__data__);
		  }
		  cache.set(key, value);
		  return this;
		}

		// Add methods to `Stack`.
		Stack.prototype.clear = stackClear;
		Stack.prototype['delete'] = stackDelete;
		Stack.prototype.get = stackGet;
		Stack.prototype.has = stackHas;
		Stack.prototype.set = stackSet;

		/**
		 * Gets the index at which the `key` is found in `array` of key-value pairs.
		 *
		 * @private
		 * @param {Array} array The array to search.
		 * @param {*} key The key to search for.
		 * @returns {number} Returns the index of the matched value, else `-1`.
		 */
		function assocIndexOf(array, key) {
		  var length = array.length;
		  while (length--) {
		    if (eq(array[length][0], key)) {
		      return length;
		    }
		  }
		  return -1;
		}

		/**
		 * The base implementation of `_.has` without support for deep paths.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} key The key to check.
		 * @returns {boolean} Returns `true` if `key` exists, else `false`.
		 */
		function baseHas(object, key) {
		  // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`,
		  // that are composed entirely of index properties, return `false` for
		  // `hasOwnProperty` checks of them.
		  return hasOwnProperty.call(object, key) ||
		    (typeof object == 'object' && key in object && getPrototype(object) === null);
		}

		/**
		 * The base implementation of `_.isEqual` which supports partial comparisons
		 * and tracks traversed objects.
		 *
		 * @private
		 * @param {*} value The value to compare.
		 * @param {*} other The other value to compare.
		 * @param {Function} [customizer] The function to customize comparisons.
		 * @param {boolean} [bitmask] The bitmask of comparison flags.
		 *  The bitmask may be composed of the following flags:
		 *     1 - Unordered comparison
		 *     2 - Partial comparison
		 * @param {Object} [stack] Tracks traversed `value` and `other` objects.
		 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		 */
		function baseIsEqual(value, other, customizer, bitmask, stack) {
		  if (value === other) {
		    return true;
		  }
		  if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
		    return value !== value && other !== other;
		  }
		  return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack);
		}

		/**
		 * A specialized version of `baseIsEqual` for arrays and objects which performs
		 * deep comparisons and tracks traversed objects enabling objects with circular
		 * references to be compared.
		 *
		 * @private
		 * @param {Object} object The object to compare.
		 * @param {Object} other The other object to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} [customizer] The function to customize comparisons.
		 * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} [stack] Tracks traversed `object` and `other` objects.
		 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		 */
		function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) {
		  var objIsArr = isArray(object),
		      othIsArr = isArray(other),
		      objTag = arrayTag,
		      othTag = arrayTag;

		  if (!objIsArr) {
		    objTag = getTag(object);
		    objTag = objTag == argsTag ? objectTag : objTag;
		  }
		  if (!othIsArr) {
		    othTag = getTag(other);
		    othTag = othTag == argsTag ? objectTag : othTag;
		  }
		  var objIsObj = objTag == objectTag && !isHostObject(object),
		      othIsObj = othTag == objectTag && !isHostObject(other),
		      isSameTag = objTag == othTag;

		  if (isSameTag && !objIsObj) {
		    stack || (stack = new Stack);
		    return (objIsArr || isTypedArray(object))
		      ? equalArrays(object, other, equalFunc, customizer, bitmask, stack)
		      : equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack);
		  }
		  if (!(bitmask & PARTIAL_COMPARE_FLAG)) {
		    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
		        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');

		    if (objIsWrapped || othIsWrapped) {
		      var objUnwrapped = objIsWrapped ? object.value() : object,
		          othUnwrapped = othIsWrapped ? other.value() : other;

		      stack || (stack = new Stack);
		      return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack);
		    }
		  }
		  if (!isSameTag) {
		    return false;
		  }
		  stack || (stack = new Stack);
		  return equalObjects(object, other, equalFunc, customizer, bitmask, stack);
		}

		/**
		 * A specialized version of `baseIsEqualDeep` for arrays with support for
		 * partial deep comparisons.
		 *
		 * @private
		 * @param {Array} array The array to compare.
		 * @param {Array} other The other array to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} customizer The function to customize comparisons.
		 * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} stack Tracks traversed `array` and `other` objects.
		 * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
		 */
		function equalArrays(array, other, equalFunc, customizer, bitmask, stack) {
		  var isPartial = bitmask & PARTIAL_COMPARE_FLAG,
		      arrLength = array.length,
		      othLength = other.length;

		  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
		    return false;
		  }
		  // Assume cyclic values are equal.
		  var stacked = stack.get(array);
		  if (stacked) {
		    return stacked == other;
		  }
		  var index = -1,
		      result = true,
		      seen = (bitmask & UNORDERED_COMPARE_FLAG) ? new SetCache : undefined;

		  stack.set(array, other);

		  // Ignore non-index properties.
		  while (++index < arrLength) {
		    var arrValue = array[index],
		        othValue = other[index];

		    if (customizer) {
		      var compared = isPartial
		        ? customizer(othValue, arrValue, index, other, array, stack)
		        : customizer(arrValue, othValue, index, array, other, stack);
		    }
		    if (compared !== undefined) {
		      if (compared) {
		        continue;
		      }
		      result = false;
		      break;
		    }
		    // Recursively compare arrays (susceptible to call stack limits).
		    if (seen) {
		      if (!arraySome(other, function(othValue, othIndex) {
		            if (!seen.has(othIndex) &&
		                (arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack))) {
		              return seen.add(othIndex);
		            }
		          })) {
		        result = false;
		        break;
		      }
		    } else if (!(
		          arrValue === othValue ||
		            equalFunc(arrValue, othValue, customizer, bitmask, stack)
		        )) {
		      result = false;
		      break;
		    }
		  }
		  stack['delete'](array);
		  return result;
		}

		/**
		 * A specialized version of `baseIsEqualDeep` for comparing objects of
		 * the same `toStringTag`.
		 *
		 * **Note:** This function only supports comparing values with tags of
		 * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
		 *
		 * @private
		 * @param {Object} object The object to compare.
		 * @param {Object} other The other object to compare.
		 * @param {string} tag The `toStringTag` of the objects to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} customizer The function to customize comparisons.
		 * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} stack Tracks traversed `object` and `other` objects.
		 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		 */
		function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) {
		  switch (tag) {
		    case dataViewTag:
		      if ((object.byteLength != other.byteLength) ||
		          (object.byteOffset != other.byteOffset)) {
		        return false;
		      }
		      object = object.buffer;
		      other = other.buffer;

		    case arrayBufferTag:
		      if ((object.byteLength != other.byteLength) ||
		          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
		        return false;
		      }
		      return true;

		    case boolTag:
		    case dateTag:
		      // 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 objects,
		      // as equal. See http://www.ecma-international.org/ecma-262/6.0/#sec-regexp.prototype.tostring
		      // for more details.
		      return object == (other + '');

		    case mapTag:
		      var convert = mapToArray;

		    case setTag:
		      var isPartial = bitmask & PARTIAL_COMPARE_FLAG;
		      convert || (convert = setToArray);

		      if (object.size != other.size && !isPartial) {
		        return false;
		      }
		      // Assume cyclic values are equal.
		      var stacked = stack.get(object);
		      if (stacked) {
		        return stacked == other;
		      }
		      bitmask |= UNORDERED_COMPARE_FLAG;
		      stack.set(object, other);

		      // Recursively compare objects (susceptible to call stack limits).
		      return equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack);

		    case symbolTag:
		      if (symbolValueOf) {
		        return symbolValueOf.call(object) == symbolValueOf.call(other);
		      }
		  }
		  return false;
		}

		/**
		 * A specialized version of `baseIsEqualDeep` for objects with support for
		 * partial deep comparisons.
		 *
		 * @private
		 * @param {Object} object The object to compare.
		 * @param {Object} other The other object to compare.
		 * @param {Function} equalFunc The function to determine equivalents of values.
		 * @param {Function} customizer The function to customize comparisons.
		 * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
		 *  for more details.
		 * @param {Object} stack Tracks traversed `object` and `other` objects.
		 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
		 */
		function equalObjects(object, other, equalFunc, customizer, bitmask, stack) {
		  var isPartial = bitmask & PARTIAL_COMPARE_FLAG,
		      objProps = keys(object),
		      objLength = objProps.length,
		      othProps = keys(other),
		      othLength = othProps.length;

		  if (objLength != othLength && !isPartial) {
		    return false;
		  }
		  var index = objLength;
		  while (index--) {
		    var key = objProps[index];
		    if (!(isPartial ? key in other : baseHas(other, key))) {
		      return false;
		    }
		  }
		  // Assume cyclic values are equal.
		  var stacked = stack.get(object);
		  if (stacked) {
		    return stacked == other;
		  }
		  var result = true;
		  stack.set(object, other);

		  var skipCtor = isPartial;
		  while (++index < objLength) {
		    key = objProps[index];
		    var objValue = object[key],
		        othValue = other[key];

		    if (customizer) {
		      var compared = isPartial
		        ? customizer(othValue, objValue, key, other, object, stack)
		        : customizer(objValue, othValue, key, object, other, stack);
		    }
		    // Recursively compare objects (susceptible to call stack limits).
		    if (!(compared === undefined
		          ? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack))
		          : compared
		        )) {
		      result = false;
		      break;
		    }
		    skipCtor || (skipCtor = key == 'constructor');
		  }
		  if (result && !skipCtor) {
		    var objCtor = object.constructor,
		        othCtor = other.constructor;

		    // Non `Object` object instances with different constructors are not equal.
		    if (objCtor != othCtor &&
		        ('constructor' in object && 'constructor' in other) &&
		        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
		          typeof othCtor == 'function' && othCtor instanceof othCtor)) {
		      result = false;
		    }
		  }
		  stack['delete'](object);
		  return result;
		}

		/**
		 * Gets the data for `map`.
		 *
		 * @private
		 * @param {Object} map The map to query.
		 * @param {string} key The reference key.
		 * @returns {*} Returns the map data.
		 */
		function getMapData(map, key) {
		  var data = map.__data__;
		  return isKeyable(key)
		    ? data[typeof key == 'string' ? 'string' : 'hash']
		    : data.map;
		}

		/**
		 * Gets the 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[key];
		  return isNative(value) ? value : undefined;
		}

		/**
		 * Gets the `[[Prototype]]` of `value`.
		 *
		 * @private
		 * @param {*} value The value to query.
		 * @returns {null|Object} Returns the `[[Prototype]]`.
		 */
		function getPrototype(value) {
		  return nativeGetPrototype(Object(value));
		}

		/**
		 * Gets the `toStringTag` of `value`.
		 *
		 * @private
		 * @param {*} value The value to query.
		 * @returns {string} Returns the `toStringTag`.
		 */
		function getTag(value) {
		  return objectToString.call(value);
		}

		// Fallback for data views, maps, sets, and weak maps in IE 11,
		// for data views in Edge, and promises in Node.js.
		if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
		    (Map && getTag(new Map) != mapTag) ||
		    (Promise && getTag(Promise.resolve()) != promiseTag) ||
		    (Set && getTag(new Set) != setTag) ||
		    (WeakMap && getTag(new WeakMap) != weakMapTag)) {
		  getTag = function(value) {
		    var result = objectToString.call(value),
		        Ctor = result == objectTag ? value.constructor : undefined,
		        ctorString = Ctor ? toSource(Ctor) : undefined;

		    if (ctorString) {
		      switch (ctorString) {
		        case dataViewCtorString: return dataViewTag;
		        case mapCtorString: return mapTag;
		        case promiseCtorString: return promiseTag;
		        case setCtorString: return setTag;
		        case weakMapCtorString: return weakMapTag;
		      }
		    }
		    return result;
		  };
		}

		/**
		 * Checks if `value` is suitable for use as unique object key.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
		 */
		function isKeyable(value) {
		  var type = typeof value;
		  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
		    ? (value !== '__proto__')
		    : (value === null);
		}

		/**
		 * Converts `func` to its source code.
		 *
		 * @private
		 * @param {Function} func The function to process.
		 * @returns {string} Returns the source code.
		 */
		function toSource(func) {
		  if (func != null) {
		    try {
		      return funcToString.call(func);
		    } catch (e) {}
		    try {
		      return (func + '');
		    } catch (e) {}
		  }
		  return '';
		}

		/**
		 * Performs a
		 * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
		 * comparison between two values to determine if they are equivalent.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to compare.
		 * @param {*} other The other value to compare.
		 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
		 * @example
		 *
		 * var object = { 'user': 'fred' };
		 * var other = { 'user': 'fred' };
		 *
		 * _.eq(object, object);
		 * // => true
		 *
		 * _.eq(object, other);
		 * // => false
		 *
		 * _.eq('a', 'a');
		 * // => true
		 *
		 * _.eq('a', Object('a'));
		 * // => false
		 *
		 * _.eq(NaN, NaN);
		 * // => true
		 */
		function eq(value, other) {
		  return value === other || (value !== value && other !== other);
		}

		/**
		 * Checks if `value` is classified as an `Array` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @type {Function}
		 * @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(document.body.children);
		 * // => false
		 *
		 * _.isArray('abc');
		 * // => false
		 *
		 * _.isArray(_.noop);
		 * // => false
		 */
		var isArray = Array.isArray;

		/**
		 * Performs a deep comparison between two values to determine if they are
		 * equivalent.
		 *
		 * **Note:** This method supports comparing arrays, array buffers, booleans,
		 * date objects, error objects, maps, numbers, `Object` objects, regexes,
		 * sets, strings, symbols, and typed arrays. `Object` objects are compared
		 * by their own, not inherited, enumerable properties. Functions and DOM
		 * nodes are **not** supported.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to compare.
		 * @param {*} other The other value to compare.
		 * @returns {boolean} Returns `true` if the values are equivalent,
		 *  else `false`.
		 * @example
		 *
		 * var object = { 'user': 'fred' };
		 * var other = { 'user': 'fred' };
		 *
		 * _.isEqual(object, other);
		 * // => true
		 *
		 * object === other;
		 * // => false
		 */
		function isEqual(value, other) {
		  return baseIsEqual(value, other);
		}

		/**
		 * Checks if `value` is classified as a `Function` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is 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 Safari 8 which returns 'object' for typed array and weak map constructors,
		  // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		  var tag = isObject(value) ? objectToString.call(value) : '';
		  return tag == funcTag || tag == genTag;
		}

		/**
		 * Checks if `value` is a valid array-like length.
		 *
		 * **Note:** This function is loosely based on
		 * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a valid length,
		 *  else `false`.
		 * @example
		 *
		 * _.isLength(3);
		 * // => true
		 *
		 * _.isLength(Number.MIN_VALUE);
		 * // => false
		 *
		 * _.isLength(Infinity);
		 * // => false
		 *
		 * _.isLength('3');
		 * // => false
		 */
		function isLength(value) {
		  return typeof value == 'number' &&
		    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
		}

		/**
		 * Checks if `value` is the
		 * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
		 * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(_.noop);
		 * // => true
		 *
		 * _.isObject(null);
		 * // => false
		 */
		function isObject(value) {
		  var type = typeof value;
		  return !!value && (type == 'object' || type == 'function');
		}

		/**
		 * Checks if `value` is object-like. A value is object-like if it's not `null`
		 * and has a `typeof` result of "object".
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
		 * @example
		 *
		 * _.isObjectLike({});
		 * // => true
		 *
		 * _.isObjectLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isObjectLike(_.noop);
		 * // => false
		 *
		 * _.isObjectLike(null);
		 * // => false
		 */
		function isObjectLike(value) {
		  return !!value && typeof value == 'object';
		}

		/**
		 * Checks if `value` is a native function.
		 *
		 * @static
		 * @memberOf _
		 * @since 3.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a native function,
		 *  else `false`.
		 * @example
		 *
		 * _.isNative(Array.prototype.push);
		 * // => true
		 *
		 * _.isNative(_);
		 * // => false
		 */
		function isNative(value) {
		  if (!isObject(value)) {
		    return false;
		  }
		  var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;
		  return pattern.test(toSource(value));
		}

		/**
		 * Checks if `value` is classified as a typed array.
		 *
		 * @static
		 * @memberOf _
		 * @since 3.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isTypedArray(new Uint8Array);
		 * // => true
		 *
		 * _.isTypedArray([]);
		 * // => false
		 */
		function isTypedArray(value) {
		  return isObjectLike(value) &&
		    isLength(value.length) && !!typedArrayTags[objectToString.call(value)];
		}

		module.exports = isEqual;


	/***/ },
	/* 680 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/**
		 * Checks if `value` is a function.
		 *
		 * @static
		 * @memberOf _
		 * @category Objects
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if the `value` is a function, else `false`.
		 * @example
		 *
		 * _.isFunction(_);
		 * // => true
		 */
		function isFunction(value) {
		  return typeof value == 'function';
		}

		module.exports = isFunction;


	/***/ },
	/* 681 */
	/***/ function(module, exports) {

		/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */

		/** `Object#toString` result shortcuts */
		var stringClass = '[object String]';

		/** Used for native method references */
		var objectProto = Object.prototype;

		/** Used to resolve the internal [[Class]] of values */
		var toString = objectProto.toString;

		/**
		 * Checks if `value` is a string.
		 *
		 * @static
		 * @memberOf _
		 * @category Objects
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if the `value` is a string, else `false`.
		 * @example
		 *
		 * _.isString('fred');
		 * // => true
		 */
		function isString(value) {
		  return typeof value == 'string' ||
		    value && typeof value == 'object' && toString.call(value) == stringClass || false;
		}

		module.exports = isString;


	/***/ },
	/* 682 */
	/***/ function(module, exports) {

		/**
		 * lodash (Custom Build) <https://lodash.com/>
		 * Build: `lodash modularize exports="npm" -o ./`
		 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
		 * Released under MIT license <https://lodash.com/license>
		 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
		 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 */

		/** Used as references for various `Number` constants. */
		var MAX_SAFE_INTEGER = 9007199254740991;

		/** `Object#toString` result references. */
		var argsTag = '[object Arguments]',
		    funcTag = '[object Function]',
		    genTag = '[object GeneratorFunction]',
		    stringTag = '[object String]';

		/** Used to detect unsigned integer values. */
		var reIsUint = /^(?:0|[1-9]\d*)$/;

		/**
		 * The base implementation of `_.times` without support for iteratee shorthands
		 * or max array length checks.
		 *
		 * @private
		 * @param {number} n The number of times to invoke `iteratee`.
		 * @param {Function} iteratee The function invoked per iteration.
		 * @returns {Array} Returns the array of results.
		 */
		function baseTimes(n, iteratee) {
		  var index = -1,
		      result = Array(n);

		  while (++index < n) {
		    result[index] = iteratee(index);
		  }
		  return result;
		}

		/** Used for built-in method references. */
		var objectProto = Object.prototype;

		/** Used to check objects for own properties. */
		var hasOwnProperty = objectProto.hasOwnProperty;

		/**
		 * Used to resolve the
		 * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
		 * of values.
		 */
		var objectToString = objectProto.toString;

		/** Built-in value references. */
		var propertyIsEnumerable = objectProto.propertyIsEnumerable;

		/* Built-in method references for those with the same name as other `lodash` methods. */
		var nativeGetPrototype = Object.getPrototypeOf,
		    nativeKeys = Object.keys;

		/**
		 * The base implementation of `_.has` without support for deep paths.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @param {Array|string} key The key to check.
		 * @returns {boolean} Returns `true` if `key` exists, else `false`.
		 */
		function baseHas(object, key) {
		  // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`,
		  // that are composed entirely of index properties, return `false` for
		  // `hasOwnProperty` checks of them.
		  return hasOwnProperty.call(object, key) ||
		    (typeof object == 'object' && key in object && getPrototype(object) === null);
		}

		/**
		 * The base implementation of `_.keys` which doesn't skip the constructor
		 * property of prototypes or treat sparse arrays as dense.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the array of property names.
		 */
		function baseKeys(object) {
		  return nativeKeys(Object(object));
		}

		/**
		 * The base implementation of `_.property` without support for deep paths.
		 *
		 * @private
		 * @param {string} key The key of the property to get.
		 * @returns {Function} Returns the new accessor function.
		 */
		function baseProperty(key) {
		  return function(object) {
		    return object == null ? undefined : object[key];
		  };
		}

		/**
		 * 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 `[[Prototype]]` of `value`.
		 *
		 * @private
		 * @param {*} value The value to query.
		 * @returns {null|Object} Returns the `[[Prototype]]`.
		 */
		function getPrototype(value) {
		  return nativeGetPrototype(Object(value));
		}

		/**
		 * Creates an array of index keys for `object` values of arrays,
		 * `arguments` objects, and strings, otherwise `null` is returned.
		 *
		 * @private
		 * @param {Object} object The object to query.
		 * @returns {Array|null} Returns index keys, else `null`.
		 */
		function indexKeys(object) {
		  var length = object ? object.length : undefined;
		  if (isLength(length) &&
		      (isArray(object) || isString(object) || isArguments(object))) {
		    return baseTimes(length, String);
		  }
		  return null;
		}

		/**
		 * Checks if `value` is a valid array-like index.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
		 * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
		 */
		function isIndex(value, length) {
		  length = length == null ? MAX_SAFE_INTEGER : length;
		  return !!length &&
		    (typeof value == 'number' || reIsUint.test(value)) &&
		    (value > -1 && value % 1 == 0 && value < length);
		}

		/**
		 * Checks if `value` is likely a prototype object.
		 *
		 * @private
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
		 */
		function isPrototype(value) {
		  var Ctor = value && value.constructor,
		      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;

		  return value === proto;
		}

		/**
		 * Checks if `value` is likely an `arguments` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isArguments(function() { return arguments; }());
		 * // => true
		 *
		 * _.isArguments([1, 2, 3]);
		 * // => false
		 */
		function isArguments(value) {
		  // Safari 8.1 incorrectly makes `arguments.callee` enumerable in strict mode.
		  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&
		    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);
		}

		/**
		 * Checks if `value` is classified as an `Array` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @type {Function}
		 * @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(document.body.children);
		 * // => false
		 *
		 * _.isArray('abc');
		 * // => false
		 *
		 * _.isArray(_.noop);
		 * // => false
		 */
		var isArray = Array.isArray;

		/**
		 * Checks if `value` is array-like. A value is considered array-like if it's
		 * not a function and has a `value.length` that's an integer greater than or
		 * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
		 * @example
		 *
		 * _.isArrayLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLike(document.body.children);
		 * // => true
		 *
		 * _.isArrayLike('abc');
		 * // => true
		 *
		 * _.isArrayLike(_.noop);
		 * // => false
		 */
		function isArrayLike(value) {
		  return value != null && isLength(getLength(value)) && !isFunction(value);
		}

		/**
		 * This method is like `_.isArrayLike` except that it also checks if `value`
		 * is an object.
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an array-like object,
		 *  else `false`.
		 * @example
		 *
		 * _.isArrayLikeObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isArrayLikeObject(document.body.children);
		 * // => true
		 *
		 * _.isArrayLikeObject('abc');
		 * // => false
		 *
		 * _.isArrayLikeObject(_.noop);
		 * // => false
		 */
		function isArrayLikeObject(value) {
		  return isObjectLike(value) && isArrayLike(value);
		}

		/**
		 * Checks if `value` is classified as a `Function` object.
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @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 Safari 8 which returns 'object' for typed array and weak map constructors,
		  // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
		  var tag = isObject(value) ? objectToString.call(value) : '';
		  return tag == funcTag || tag == genTag;
		}

		/**
		 * Checks if `value` is a valid array-like length.
		 *
		 * **Note:** This function is loosely based on
		 * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is a valid length,
		 *  else `false`.
		 * @example
		 *
		 * _.isLength(3);
		 * // => true
		 *
		 * _.isLength(Number.MIN_VALUE);
		 * // => false
		 *
		 * _.isLength(Infinity);
		 * // => false
		 *
		 * _.isLength('3');
		 * // => false
		 */
		function isLength(value) {
		  return typeof value == 'number' &&
		    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
		}

		/**
		 * Checks if `value` is the
		 * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
		 * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
		 *
		 * @static
		 * @memberOf _
		 * @since 0.1.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is an object, else `false`.
		 * @example
		 *
		 * _.isObject({});
		 * // => true
		 *
		 * _.isObject([1, 2, 3]);
		 * // => true
		 *
		 * _.isObject(_.noop);
		 * // => true
		 *
		 * _.isObject(null);
		 * // => false
		 */
		function isObject(value) {
		  var type = typeof value;
		  return !!value && (type == 'object' || type == 'function');
		}

		/**
		 * Checks if `value` is object-like. A value is object-like if it's not `null`
		 * and has a `typeof` result of "object".
		 *
		 * @static
		 * @memberOf _
		 * @since 4.0.0
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
		 * @example
		 *
		 * _.isObjectLike({});
		 * // => true
		 *
		 * _.isObjectLike([1, 2, 3]);
		 * // => true
		 *
		 * _.isObjectLike(_.noop);
		 * // => false
		 *
		 * _.isObjectLike(null);
		 * // => false
		 */
		function isObjectLike(value) {
		  return !!value && typeof value == 'object';
		}

		/**
		 * Checks if `value` is classified as a `String` primitive or object.
		 *
		 * @static
		 * @since 0.1.0
		 * @memberOf _
		 * @category Lang
		 * @param {*} value The value to check.
		 * @returns {boolean} Returns `true` if `value` is correctly classified,
		 *  else `false`.
		 * @example
		 *
		 * _.isString('abc');
		 * // => true
		 *
		 * _.isString(1);
		 * // => false
		 */
		function isString(value) {
		  return typeof value == 'string' ||
		    (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);
		}

		/**
		 * 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
		 * @since 0.1.0
		 * @memberOf _
		 * @category Object
		 * @param {Object} object The object to query.
		 * @returns {Array} Returns the array of property names.
		 * @example
		 *
		 * function Foo() {
		 *   this.a = 1;
		 *   this.b = 2;
		 * }
		 *
		 * Foo.prototype.c = 3;
		 *
		 * _.keys(new Foo);
		 * // => ['a', 'b'] (iteration order is not guaranteed)
		 *
		 * _.keys('hi');
		 * // => ['0', '1']
		 */
		function keys(object) {
		  var isProto = isPrototype(object);
		  if (!(isProto || isArrayLike(object))) {
		    return baseKeys(object);
		  }
		  var indexes = indexKeys(object),
		      skipIndexes = !!indexes,
		      result = indexes || [],
		      length = result.length;

		  for (var key in object) {
		    if (baseHas(object, key) &&
		        !(skipIndexes && (key == 'length' || isIndex(key, length))) &&
		        !(isProto && key == 'constructor')) {
		      result.push(key);
		    }
		  }
		  return result;
		}

		module.exports = keys;


	/***/ },
	/* 683 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global) {/**
		 * Lo-Dash 2.4.1 (Custom Build) <http://lodash.com/>
		 * Build: `lodash modularize modern exports="npm" -o ./npm/`
		 * Copyright 2012-2013 The Dojo Foundation <http://dojofoundation.org/>
		 * Based on Underscore.js 1.5.2 <http://underscorejs.org/LICENSE>
		 * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
		 * Available under MIT license <http://lodash.com/license>
		 */
		var isNative = __webpack_require__(88);

		/** Used to detect functions containing a `this` reference */
		var reThis = /\bthis\b/;

		/**
		 * An object used to flag environments features.
		 *
		 * @static
		 * @memberOf _
		 * @type Object
		 */
		var support = {};

		/**
		 * Detect if functions can be decompiled by `Function#toString`
		 * (all but PS3 and older Opera mobile browsers & avoided in Windows 8 apps).
		 *
		 * @memberOf _.support
		 * @type boolean
		 */
		support.funcDecomp = !isNative(global.WinRTError) && reThis.test(function() { return this; });

		/**
		 * Detect if `Function#name` is supported (all but IE).
		 *
		 * @memberOf _.support
		 * @type boolean
		 */
		support.funcNames = typeof Function.name == 'string';

		module.exports = support;

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 684 */
	/***/ function(module, exports) {

		;(function () { // closure for web browsers

		if (typeof module === 'object' && module.exports) {
		  module.exports = LRUCache
		} else {
		  // just set the global for non-node platforms.
		  this.LRUCache = LRUCache
		}

		function hOP (obj, key) {
		  return Object.prototype.hasOwnProperty.call(obj, key)
		}

		function naiveLength () { return 1 }

		var didTypeWarning = false
		function typeCheckKey(key) {
		  if (!didTypeWarning && typeof key !== 'string' && typeof key !== 'number') {
		    didTypeWarning = true
		    console.error(new TypeError("LRU: key must be a string or number. Almost certainly a bug! " + typeof key).stack)
		  }
		}

		function LRUCache (options) {
		  if (!(this instanceof LRUCache))
		    return new LRUCache(options)

		  if (typeof options === 'number')
		    options = { max: options }

		  if (!options)
		    options = {}

		  this._max = options.max
		  // Kind of weird to have a default max of Infinity, but oh well.
		  if (!this._max || !(typeof this._max === "number") || this._max <= 0 )
		    this._max = Infinity

		  this._lengthCalculator = options.length || naiveLength
		  if (typeof this._lengthCalculator !== "function")
		    this._lengthCalculator = naiveLength

		  this._allowStale = options.stale || false
		  this._maxAge = options.maxAge || null
		  this._dispose = options.dispose
		  this.reset()
		}

		// resize the cache when the max changes.
		Object.defineProperty(LRUCache.prototype, "max",
		  { set : function (mL) {
		      if (!mL || !(typeof mL === "number") || mL <= 0 ) mL = Infinity
		      this._max = mL
		      if (this._length > this._max) trim(this)
		    }
		  , get : function () { return this._max }
		  , enumerable : true
		  })

		// resize the cache when the lengthCalculator changes.
		Object.defineProperty(LRUCache.prototype, "lengthCalculator",
		  { set : function (lC) {
		      if (typeof lC !== "function") {
		        this._lengthCalculator = naiveLength
		        this._length = this._itemCount
		        for (var key in this._cache) {
		          this._cache[key].length = 1
		        }
		      } else {
		        this._lengthCalculator = lC
		        this._length = 0
		        for (var key in this._cache) {
		          this._cache[key].length = this._lengthCalculator(this._cache[key].value)
		          this._length += this._cache[key].length
		        }
		      }

		      if (this._length > this._max) trim(this)
		    }
		  , get : function () { return this._lengthCalculator }
		  , enumerable : true
		  })

		Object.defineProperty(LRUCache.prototype, "length",
		  { get : function () { return this._length }
		  , enumerable : true
		  })


		Object.defineProperty(LRUCache.prototype, "itemCount",
		  { get : function () { return this._itemCount }
		  , enumerable : true
		  })

		LRUCache.prototype.forEach = function (fn, thisp) {
		  thisp = thisp || this
		  var i = 0
		  var itemCount = this._itemCount

		  for (var k = this._mru - 1; k >= 0 && i < itemCount; k--) if (this._lruList[k]) {
		    i++
		    var hit = this._lruList[k]
		    if (isStale(this, hit)) {
		      del(this, hit)
		      if (!this._allowStale) hit = undefined
		    }
		    if (hit) {
		      fn.call(thisp, hit.value, hit.key, this)
		    }
		  }
		}

		LRUCache.prototype.keys = function () {
		  var keys = new Array(this._itemCount)
		  var i = 0
		  for (var k = this._mru - 1; k >= 0 && i < this._itemCount; k--) if (this._lruList[k]) {
		    var hit = this._lruList[k]
		    keys[i++] = hit.key
		  }
		  return keys
		}

		LRUCache.prototype.values = function () {
		  var values = new Array(this._itemCount)
		  var i = 0
		  for (var k = this._mru - 1; k >= 0 && i < this._itemCount; k--) if (this._lruList[k]) {
		    var hit = this._lruList[k]
		    values[i++] = hit.value
		  }
		  return values
		}

		LRUCache.prototype.reset = function () {
		  if (this._dispose && this._cache) {
		    for (var k in this._cache) {
		      this._dispose(k, this._cache[k].value)
		    }
		  }

		  this._cache = Object.create(null) // hash of items by key
		  this._lruList = Object.create(null) // list of items in order of use recency
		  this._mru = 0 // most recently used
		  this._lru = 0 // least recently used
		  this._length = 0 // number of items in the list
		  this._itemCount = 0
		}

		LRUCache.prototype.dump = function () {
		  var arr = []
		  var i = 0

		  for (var k = this._mru - 1; k >= 0 && i < this._itemCount; k--) if (this._lruList[k]) {
		    var hit = this._lruList[k]
		    if (!isStale(this, hit)) {
		      //Do not store staled hits
		      ++i
		      arr.push({
		        k: hit.key,
		        v: hit.value,
		        e: hit.now + (hit.maxAge || 0)
		      });
		    }
		  }
		  //arr has the most read first
		  return arr
		}

		LRUCache.prototype.dumpLru = function () {
		  return this._lruList
		}

		LRUCache.prototype.set = function (key, value, maxAge) {
		  maxAge = maxAge || this._maxAge
		  typeCheckKey(key)

		  var now = maxAge ? Date.now() : 0
		  var len = this._lengthCalculator(value)

		  if (hOP(this._cache, key)) {
		    if (len > this._max) {
		      del(this, this._cache[key])
		      return false
		    }
		    // dispose of the old one before overwriting
		    if (this._dispose)
		      this._dispose(key, this._cache[key].value)

		    this._cache[key].now = now
		    this._cache[key].maxAge = maxAge
		    this._cache[key].value = value
		    this._length += (len - this._cache[key].length)
		    this._cache[key].length = len
		    this.get(key)

		    if (this._length > this._max)
		      trim(this)

		    return true
		  }

		  var hit = new Entry(key, value, this._mru++, len, now, maxAge)

		  // oversized objects fall out of cache automatically.
		  if (hit.length > this._max) {
		    if (this._dispose) this._dispose(key, value)
		    return false
		  }

		  this._length += hit.length
		  this._lruList[hit.lu] = this._cache[key] = hit
		  this._itemCount ++

		  if (this._length > this._max)
		    trim(this)

		  return true
		}

		LRUCache.prototype.has = function (key) {
		  typeCheckKey(key)
		  if (!hOP(this._cache, key)) return false
		  var hit = this._cache[key]
		  if (isStale(this, hit)) {
		    return false
		  }
		  return true
		}

		LRUCache.prototype.get = function (key) {
		  typeCheckKey(key)
		  return get(this, key, true)
		}

		LRUCache.prototype.peek = function (key) {
		  typeCheckKey(key)
		  return get(this, key, false)
		}

		LRUCache.prototype.pop = function () {
		  var hit = this._lruList[this._lru]
		  del(this, hit)
		  return hit || null
		}

		LRUCache.prototype.del = function (key) {
		  typeCheckKey(key)
		  del(this, this._cache[key])
		}

		LRUCache.prototype.load = function (arr) {
		  //reset the cache
		  this.reset();

		  var now = Date.now()
		  //A previous serialized cache has the most recent items first
		  for (var l = arr.length - 1; l >= 0; l-- ) {
		    var hit = arr[l]
		    typeCheckKey(hit.k)
		    var expiresAt = hit.e || 0
		    if (expiresAt === 0) {
		      //the item was created without expiration in a non aged cache
		      this.set(hit.k, hit.v)
		    } else {
		      var maxAge = expiresAt - now
		      //dont add already expired items
		      if (maxAge > 0) this.set(hit.k, hit.v, maxAge)
		    }
		  }
		}

		function get (self, key, doUse) {
		  typeCheckKey(key)
		  var hit = self._cache[key]
		  if (hit) {
		    if (isStale(self, hit)) {
		      del(self, hit)
		      if (!self._allowStale) hit = undefined
		    } else {
		      if (doUse) use(self, hit)
		    }
		    if (hit) hit = hit.value
		  }
		  return hit
		}

		function isStale(self, hit) {
		  if (!hit || (!hit.maxAge && !self._maxAge)) return false
		  var stale = false;
		  var diff = Date.now() - hit.now
		  if (hit.maxAge) {
		    stale = diff > hit.maxAge
		  } else {
		    stale = self._maxAge && (diff > self._maxAge)
		  }
		  return stale;
		}

		function use (self, hit) {
		  shiftLU(self, hit)
		  hit.lu = self._mru ++
		  self._lruList[hit.lu] = hit
		}

		function trim (self) {
		  while (self._lru < self._mru && self._length > self._max)
		    del(self, self._lruList[self._lru])
		}

		function shiftLU (self, hit) {
		  delete self._lruList[ hit.lu ]
		  while (self._lru < self._mru && !self._lruList[self._lru]) self._lru ++
		}

		function del (self, hit) {
		  if (hit) {
		    if (self._dispose) self._dispose(hit.key, hit.value)
		    self._length -= hit.length
		    self._itemCount --
		    delete self._cache[ hit.key ]
		    shiftLU(self, hit)
		  }
		}

		// classy, since V8 prefers predictable objects.
		function Entry (key, value, lu, length, now, maxAge) {
		  this.key = key
		  this.value = value
		  this.lu = lu
		  this.length = length
		  this.now = now
		  if (maxAge) this.maxAge = maxAge
		}

		})()


	/***/ },
	/* 685 */
	/***/ function(module, exports, __webpack_require__) {

		var multiaddr = __webpack_require__(120)

		var IP = or(base('ip4'), base('ip6'))
		var TCP = and(IP, base('tcp'))
		var UDP = and(IP, base('udp'))
		var UTP = and(UDP, base('utp'))
		var WebSockets = and(TCP, base('websockets'))
		var Reliable = or(TCP, UTP)
		var IPFS = and(Reliable, base('ipfs'))

		exports.IP = IP
		exports.TCP = TCP
		exports.UDP = UDP
		exports.UTP = UTP
		exports.WebSockets = WebSockets
		exports.Reliable = Reliable
		exports.IPFS = IPFS

		function and () {
		  var args = Array.from(arguments)

		  function matches (a) {
		    if (typeof a === 'string') {
		      a = multiaddr(a)
		    }
		    var out = partialMatch(a.protoNames())
		    if (out === null) {
		      return false
		    }
		    return out.length === 0
		  }

		  function partialMatch (a) {
		    if (a.length < args.length) {
		      return null
		    }

		    args.some(function (arg) {
		      a = arg.partialMatch(a)
		      if (a === null) {
		        return true
		      }
		    })

		    return a
		  }

		  return {
		    input: args,
		    matches: matches,
		    partialMatch: partialMatch
		  }
		}

		function or () {
		  var args = Array.from(arguments)

		  function matches (a) {
		    if (typeof a === 'string') {
		      a = multiaddr(a)
		    }
		    var out = partialMatch(a.protoNames())
		    if (out === null) {
		      return false
		    }
		    return out.length === 0
		  }

		  function partialMatch (a) {
		    var out = null
		    args.some(function (arg) {
		      var res = arg.partialMatch(a)
		      if (res) {
		        out = res
		        return true
		      }
		    })

		    return out
		  }

		  return {
		    toString: function () { return '{ ' + args.join(' ') + ' }' },
		    input: args,
		    matches: matches,
		    partialMatch: partialMatch
		  }
		}

		function base (n) {
		  var name = n
		  function matches (a) {
		    if (typeof a === 'string') {
		      a = multiaddr(a)
		    }

		    var pnames = a.protoNames()
		    if (pnames.length === 1 && pnames[0] === name) {
		      return true
		    }
		    return false
		  }

		  function partialMatch (protos) {
		    if (protos.length === 0) {
		      return null
		    }

		    if (protos[0] === name) {
		      return protos.slice(1)
		    }
		    return null
		  }

		  return {
		    toString: function () { return name },
		    matches: matches,
		    partialMatch: partialMatch
		  }
		}


	/***/ },
	/* 686 */
	/***/ function(module, exports) {

		/**
		 * Helpers.
		 */

		var s = 1000;
		var m = s * 60;
		var h = m * 60;
		var d = h * 24;
		var y = d * 365.25;

		/**
		 * Parse or format the given `val`.
		 *
		 * Options:
		 *
		 *  - `long` verbose formatting [false]
		 *
		 * @param {String|Number} val
		 * @param {Object} options
		 * @return {String|Number}
		 * @api public
		 */

		module.exports = function(val, options){
		  options = options || {};
		  if ('string' == typeof val) return parse(val);
		  return options.long
		    ? long(val)
		    : short(val);
		};

		/**
		 * Parse the given `str` and return milliseconds.
		 *
		 * @param {String} str
		 * @return {Number}
		 * @api private
		 */

		function parse(str) {
		  str = '' + str;
		  if (str.length > 10000) return;
		  var match = /^((?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(str);
		  if (!match) return;
		  var n = parseFloat(match[1]);
		  var type = (match[2] || 'ms').toLowerCase();
		  switch (type) {
		    case 'years':
		    case 'year':
		    case 'yrs':
		    case 'yr':
		    case 'y':
		      return n * y;
		    case 'days':
		    case 'day':
		    case 'd':
		      return n * d;
		    case 'hours':
		    case 'hour':
		    case 'hrs':
		    case 'hr':
		    case 'h':
		      return n * h;
		    case 'minutes':
		    case 'minute':
		    case 'mins':
		    case 'min':
		    case 'm':
		      return n * m;
		    case 'seconds':
		    case 'second':
		    case 'secs':
		    case 'sec':
		    case 's':
		      return n * s;
		    case 'milliseconds':
		    case 'millisecond':
		    case 'msecs':
		    case 'msec':
		    case 'ms':
		      return n;
		  }
		}

		/**
		 * Short format for `ms`.
		 *
		 * @param {Number} ms
		 * @return {String}
		 * @api private
		 */

		function short(ms) {
		  if (ms >= d) return Math.round(ms / d) + 'd';
		  if (ms >= h) return Math.round(ms / h) + 'h';
		  if (ms >= m) return Math.round(ms / m) + 'm';
		  if (ms >= s) return Math.round(ms / s) + 's';
		  return ms + 'ms';
		}

		/**
		 * Long format for `ms`.
		 *
		 * @param {Number} ms
		 * @return {String}
		 * @api private
		 */

		function long(ms) {
		  return plural(ms, d, 'day')
		    || plural(ms, h, 'hour')
		    || plural(ms, m, 'minute')
		    || plural(ms, s, 'second')
		    || ms + ' ms';
		}

		/**
		 * Pluralization helper.
		 */

		function plural(ms, n, name) {
		  if (ms < n) return;
		  if (ms < n * 1.5) return Math.floor(ms / n) + ' ' + name;
		  return Math.ceil(ms / n) + ' ' + name + 's';
		}


	/***/ },
	/* 687 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var map = __webpack_require__(171);
		var filter = __webpack_require__(674);
		var convert = __webpack_require__(688);
		var protocols = __webpack_require__(173);
		var varint = __webpack_require__(93);

		// export codec
		module.exports = {
		  stringToStringTuples: stringToStringTuples,
		  stringTuplesToString: stringTuplesToString,

		  tuplesToStringTuples: tuplesToStringTuples,
		  stringTuplesToTuples: stringTuplesToTuples,

		  bufferToTuples: bufferToTuples,
		  tuplesToBuffer: tuplesToBuffer,

		  bufferToString: bufferToString,
		  stringToBuffer: stringToBuffer,

		  fromString: fromString,
		  fromBuffer: fromBuffer,
		  validateBuffer: validateBuffer,
		  isValidBuffer: isValidBuffer,
		  cleanPath: cleanPath,

		  ParseError: ParseError,
		  protoFromTuple: protoFromTuple,

		  sizeForAddr: sizeForAddr
		};

		// string -> [[str name, str addr]... ]
		function stringToStringTuples(str) {
		  var tuples = [];
		  var parts = str.split('/').slice(1); // skip first empty elem
		  if (parts.length === 1 && parts[0] === '') {
		    return [];
		  }

		  for (var p = 0; p < parts.length; p++) {
		    var part = parts[p];
		    var proto = protocols(part);

		    if (proto.size === 0) {
		      tuples.push([part]);
		      continue;
		    }

		    p++; // advance addr part
		    if (p >= parts.length) {
		      throw ParseError('invalid address: ' + str);
		    }

		    tuples.push([part, parts[p]]);
		  }

		  return tuples;
		}

		// [[str name, str addr]... ] -> string
		function stringTuplesToString(tuples) {
		  var parts = [];
		  map(tuples, function (tup) {
		    var proto = protoFromTuple(tup);
		    parts.push(proto.name);
		    if (tup.length > 1) {
		      parts.push(tup[1]);
		    }
		  });

		  return '/' + parts.join('/');
		}

		// [[str name, str addr]... ] -> [[int code, Buffer]... ]
		function stringTuplesToTuples(tuples) {
		  return map(tuples, function (tup) {
		    if (!Array.isArray(tup)) {
		      tup = [tup];
		    }
		    var proto = protoFromTuple(tup);
		    if (tup.length > 1) {
		      return [proto.code, convert.toBuffer(proto.code, tup[1])];
		    }
		    return [proto.code];
		  });
		}

		// [[int code, Buffer]... ] -> [[str name, str addr]... ]
		function tuplesToStringTuples(tuples) {
		  return map(tuples, function (tup) {
		    var proto = protoFromTuple(tup);
		    if (tup.length > 1) {
		      return [proto.code, convert.toString(proto.code, tup[1])];
		    }
		    return [proto.code];
		  });
		}

		// [[int code, Buffer ]... ] -> Buffer
		function tuplesToBuffer(tuples) {
		  return fromBuffer(Buffer.concat(map(tuples, function (tup) {
		    var proto = protoFromTuple(tup);
		    var buf = new Buffer(varint.encode(proto.code));

		    if (tup.length > 1) {
		      buf = Buffer.concat([buf, tup[1]]); // add address buffer
		    }

		    return buf;
		  })));
		}

		function sizeForAddr(p, addr) {
		  if (p.size > 0) {
		    return p.size / 8;
		  } else if (p.size === 0) {
		    return 0;
		  } else {
		    var size = varint.decode(addr);
		    return size + varint.decode.bytes;
		  }
		}

		// Buffer -> [[int code, Buffer ]... ]
		function bufferToTuples(buf) {
		  var tuples = [];
		  var i = 0;
		  while (i < buf.length) {
		    var code = varint.decode(buf, i);
		    var n = varint.decode.bytes;

		    var p = protocols(code);

		    var size = sizeForAddr(p, buf.slice(i + n));

		    if (size === 0) {
		      tuples.push([code]);
		      i += n;
		      continue;
		    }

		    var addr = buf.slice(i + n, i + n + size);

		    i += size + n;

		    if (i > buf.length) {
		      // did not end _exactly_ at buffer.length
		      throw ParseError('Invalid address buffer: ' + buf.toString('hex'));
		    }

		    // ok, tuple seems good.
		    tuples.push([code, addr]);
		  }

		  return tuples;
		}

		// Buffer -> String
		function bufferToString(buf) {
		  var a = bufferToTuples(buf);
		  var b = tuplesToStringTuples(a);
		  return stringTuplesToString(b);
		}

		// String -> Buffer
		function stringToBuffer(str) {
		  str = cleanPath(str);
		  var a = stringToStringTuples(str);
		  var b = stringTuplesToTuples(a);
		  return tuplesToBuffer(b);
		}

		// String -> Buffer
		function fromString(str) {
		  return stringToBuffer(str);
		}

		// Buffer -> Buffer
		function fromBuffer(buf) {
		  var err = validateBuffer(buf);
		  if (err) throw err;
		  return new Buffer(buf); // copy
		}

		function validateBuffer(buf) {
		  try {
		    bufferToTuples(buf); // try to parse. will throw if breaks
		  } catch (err) {
		    return err;
		  }
		}

		function isValidBuffer(buf) {
		  return validateBuffer(buf) === undefined;
		}

		function cleanPath(str) {
		  return '/' + filter(str.trim().split('/')).join('/');
		}

		function ParseError(str) {
		  return new Error('Error parsing address: ' + str);
		}

		function protoFromTuple(tup) {
		  var proto = protocols(tup[0]);
		  return proto;
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 688 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var ip = __webpack_require__(647);
		var protocols = __webpack_require__(173);
		var bs58 = __webpack_require__(35);
		var varint = __webpack_require__(93);

		module.exports = Convert;

		// converts (serializes) addresses
		function Convert(proto, a) {
		  if (a instanceof Buffer) {
		    return Convert.toString(proto, a);
		  } else {
		    return Convert.toBuffer(proto, a);
		  }
		}

		Convert.toString = function convertToString(proto, buf) {
		  proto = protocols(proto);
		  switch (proto.code) {
		    case 4: // ipv4
		    case 41:
		      // ipv6
		      return ip.toString(buf);

		    case 6: // tcp
		    case 17: // udp
		    case 33: // dccp
		    case 132:
		      // sctp
		      return buf2port(buf);

		    case 421:
		      // ipfs
		      return buf2mh(buf);
		    default:
		      return buf.toString('hex'); // no clue. convert to hex
		  }
		};

		Convert.toBuffer = function convertToBuffer(proto, str) {
		  proto = protocols(proto);
		  switch (proto.code) {
		    case 4: // ipv4
		    case 41:
		      // ipv6
		      return ip.toBuffer(str);

		    case 6: // tcp
		    case 17: // udp
		    case 33: // dccp
		    case 132:
		      // sctp
		      return port2buf(parseInt(str, 10));

		    case 421:
		      // ipfs
		      return mh2buf(str);
		    default:
		      return new Buffer(str, 'hex'); // no clue. convert from hex
		  }
		};

		function port2buf(port) {
		  var buf = new Buffer(2);
		  buf.writeUInt16BE(port, 0);
		  return buf;
		}

		function buf2port(buf) {
		  return buf.readUInt16BE(0);
		}

		function mh2buf(hash) {
		  // the address is a varint prefixed multihash string representation
		  var mh = new Buffer(bs58.decode(hash));
		  var size = new Buffer(varint.encode(mh.length));
		  return Buffer.concat([size, mh]);
		}

		function buf2mh(buf) {
		  var size = varint.decode(buf);
		  var address = buf.slice(varint.decode.bytes);

		  if (address.length !== size) {
		    throw new Error('inconsistent lengths');
		  }

		  return bs58.encode(address);
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 689 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		exports.names = {
		  sha1: 0x11,
		  'sha2-256': 0x12,
		  'sha2-512': 0x13,
		  sha3: 0x14,
		  blake2b: 0x40,
		  blake2s: 0x41
		};

		exports.codes = {
		  0x11: 'sha1',
		  0x12: 'sha2-256',
		  0x13: 'sha2-512',
		  0x14: 'sha3',
		  0x40: 'blake2b',
		  0x41: 'blake2s'
		};

		exports.defaultLengths = {
		  0x11: 20,
		  0x12: 32,
		  0x13: 64,
		  0x14: 64,
		  0x40: 64,
		  0x41: 32
		};

	/***/ },
	/* 690 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var lpm = __webpack_require__(117);
		var PROTOCOLID = __webpack_require__(123);

		exports = module.exports = Broadcast;
		exports.createBroadcast = createBroadcast;

		function createBroadcast() {
		  return new Broadcast();
		}

		function Broadcast() {
		  var self = this;
		  if (!(self instanceof Broadcast)) {
		    throw new Error('Broadcast must be called with new, or used with Broadcast');
		  }

		  self.handle = function handle(duplexStream, callback) {
		    self.duplexStream = duplexStream;
		    lpm.write(self.duplexStream, new Buffer(PROTOCOLID + '\n'));
		  };

		  self.broadcast = function broadcast(protocol, callback) {
		    lpm.write(self.duplexStream, new Buffer(protocol + '\n'));
		    callback(self.duplexStream);
		  };
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 691 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var lpm = __webpack_require__(117);
		var PROTOCOLID = __webpack_require__(123);

		exports = module.exports = Interactive;
		exports.createInteractive = createInteractive;

		function createInteractive() {
		  return new Interactive();
		}

		function Interactive() {
		  var self = this;
		  if (!(self instanceof Interactive)) {
		    throw new Error('MultiStream must be called with new, or used with createMultiStream');
		  }

		  self.handle = handle;

		  function handle(duplexStream, callback) {
		    self.duplexStream = duplexStream;

		    lpm.read(duplexStream, function (msgBuffer) {
		      var msg = msgBuffer.toString().slice(0, -1);
		      if (msg === PROTOCOLID) {
		        lpm.write(duplexStream, new Buffer(PROTOCOLID + '\n')); // Sending the ACK
		        callback();
		      } else {
		        lpm.write(duplexStream, new Buffer('na' + '\n'));
		        // TODO: multistream/version not supported, propose a new one.
		        // So far we only have one version.
		      }
		    });
		  }

		  self.ls = function ls(callback) {
		    lpm.write(self.duplexStream, new Buffer('ls' + '\n'));
		    lpm.read(self.duplexStream, function (msgBuffer) {
		      callback(null, msgBuffer.toString().slice(0, -1));
		    });
		  };

		  self.select = function select(protocol, callback) {
		    lpm.write(self.duplexStream, new Buffer(protocol + '\n'));
		    lpm.read(self.duplexStream, function (msgBuffer) {
		      if (msgBuffer.toString().slice(0, -1) === protocol) {
		        return callback(null, self.duplexStream);
		      }
		      if (msgBuffer.toString().slice(0, -1) === 'na') {
		        return callback(new Error(protocol + ' not supported'));
		      }
		    });
		  };
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 692 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';

		var _keys = __webpack_require__(356);

		var _keys2 = _interopRequireDefault(_keys);

		var _stringify = __webpack_require__(355);

		var _stringify2 = _interopRequireDefault(_stringify);

		function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

		var lpm = __webpack_require__(117);
		var PROTOCOLID = __webpack_require__(123);

		exports = module.exports = Select;
		exports.createSelect = createSelect;

		function createSelect() {
		  return new Select();
		}

		function Select() {
		  if (!(this instanceof Select)) {
		    throw new Error('Select must be called with new, or used with createSelect');
		  }

		  var handlers = {};
		  // var compatible = false

		  this.addHandler = function (header, handlerFunc) {
		    handlers[header] = handlerFunc;
		  };

		  this.handle = handle;

		  function handle(duplexStream) {
		    lpm.write(duplexStream, new Buffer(PROTOCOLID + '\n'));
		    interactive();

		    function interactive() {
		      lpm.read(duplexStream, function (buffer) {
		        var msg = buffer.toString().slice(0, -1);

		        if (msg === PROTOCOLID) {
		          // ACK
		          return interactive();
		        }

		        if (msg === 'na') {
		          // If the client doesn't support our proposed multistream/version
		          // we will wait for it to propose another version. So far, there
		          // is only one version, so we will close the connection instead
		          return duplexStream.end();
		        }

		        if (msg === 'ls') {
		          lpm.write(duplexStream, new Buffer((0, _stringify2.default)((0, _keys2.default)(handlers)) + '\n'));
		          return interactive();
		        }

		        if (handlers[msg]) {
		          lpm.write(duplexStream, new Buffer(msg + '\n'));
		          return handlers[msg](duplexStream);
		        } else {
		          lpm.write(duplexStream, new Buffer('na' + '\n'));
		          return interactive();
		        }
		      });
		    }
		  }
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 693 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var lpm = __webpack_require__(117);
		var PROTOCOLID = __webpack_require__(123);

		exports = module.exports = Silent;
		exports.createSilent = createSilent;

		function createSilent() {
		  return new Silent();
		}

		function Silent() {
		  var self = this;
		  if (!(self instanceof Silent)) {
		    throw new Error('Silent must be called with new, or used with Silent');
		  }

		  self.handle = function handle(duplexStream, callback) {
		    self.duplexStream = duplexStream;
		    lpm.read(duplexStream, function (msgBuffer) {
		      var msg = msgBuffer.toString().slice(0, -1);

		      if (msg === PROTOCOLID) {
		        callback();
		      } else {
		        duplexStream.end();
		        callback(new Error('Received non supported MultiStream version ' + msg));
		      }
		    });
		  };

		  self.addHandler = function addHandler(protocol, callback) {
		    lpm.read(self.duplexStream, function (msgBuffer) {
		      var msg = msgBuffer.toString().slice(0, -1);
		      if (msg === protocol) {
		        return callback(null, self.duplexStream);
		      } else {
		        callback(new Error('Received non supported Protocol or Version: ' + msg));
		      }
		    });
		  };
		}

	/***/ },
	/* 694 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';


		module.exports = {

		  /* Allowed flush values; see deflate() and inflate() below for details */
		  Z_NO_FLUSH:         0,
		  Z_PARTIAL_FLUSH:    1,
		  Z_SYNC_FLUSH:       2,
		  Z_FULL_FLUSH:       3,
		  Z_FINISH:           4,
		  Z_BLOCK:            5,
		  Z_TREES:            6,

		  /* Return codes for the compression/decompression functions. Negative values
		  * are errors, positive values are used for special but normal events.
		  */
		  Z_OK:               0,
		  Z_STREAM_END:       1,
		  Z_NEED_DICT:        2,
		  Z_ERRNO:           -1,
		  Z_STREAM_ERROR:    -2,
		  Z_DATA_ERROR:      -3,
		  //Z_MEM_ERROR:     -4,
		  Z_BUF_ERROR:       -5,
		  //Z_VERSION_ERROR: -6,

		  /* compression levels */
		  Z_NO_COMPRESSION:         0,
		  Z_BEST_SPEED:             1,
		  Z_BEST_COMPRESSION:       9,
		  Z_DEFAULT_COMPRESSION:   -1,


		  Z_FILTERED:               1,
		  Z_HUFFMAN_ONLY:           2,
		  Z_RLE:                    3,
		  Z_FIXED:                  4,
		  Z_DEFAULT_STRATEGY:       0,

		  /* Possible values of the data_type field (though see inflate()) */
		  Z_BINARY:                 0,
		  Z_TEXT:                   1,
		  //Z_ASCII:                1, // = Z_TEXT (deprecated)
		  Z_UNKNOWN:                2,

		  /* The deflate compression method */
		  Z_DEFLATED:               8
		  //Z_NULL:                 null // Use -1 or null inline, depending on var type
		};


	/***/ },
	/* 695 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var utils   = __webpack_require__(126);
		var trees   = __webpack_require__(700);
		var adler32 = __webpack_require__(265);
		var crc32   = __webpack_require__(266);
		var msg     = __webpack_require__(699);

		/* Public constants ==========================================================*/
		/* ===========================================================================*/


		/* Allowed flush values; see deflate() and inflate() below for details */
		var Z_NO_FLUSH      = 0;
		var Z_PARTIAL_FLUSH = 1;
		//var Z_SYNC_FLUSH    = 2;
		var Z_FULL_FLUSH    = 3;
		var Z_FINISH        = 4;
		var Z_BLOCK         = 5;
		//var Z_TREES         = 6;


		/* Return codes for the compression/decompression functions. Negative values
		 * are errors, positive values are used for special but normal events.
		 */
		var Z_OK            = 0;
		var Z_STREAM_END    = 1;
		//var Z_NEED_DICT     = 2;
		//var Z_ERRNO         = -1;
		var Z_STREAM_ERROR  = -2;
		var Z_DATA_ERROR    = -3;
		//var Z_MEM_ERROR     = -4;
		var Z_BUF_ERROR     = -5;
		//var Z_VERSION_ERROR = -6;


		/* compression levels */
		//var Z_NO_COMPRESSION      = 0;
		//var Z_BEST_SPEED          = 1;
		//var Z_BEST_COMPRESSION    = 9;
		var Z_DEFAULT_COMPRESSION = -1;


		var Z_FILTERED            = 1;
		var Z_HUFFMAN_ONLY        = 2;
		var Z_RLE                 = 3;
		var Z_FIXED               = 4;
		var Z_DEFAULT_STRATEGY    = 0;

		/* Possible values of the data_type field (though see inflate()) */
		//var Z_BINARY              = 0;
		//var Z_TEXT                = 1;
		//var Z_ASCII               = 1; // = Z_TEXT
		var Z_UNKNOWN             = 2;


		/* The deflate compression method */
		var Z_DEFLATED  = 8;

		/*============================================================================*/


		var MAX_MEM_LEVEL = 9;
		/* Maximum value for memLevel in deflateInit2 */
		var MAX_WBITS = 15;
		/* 32K LZ77 window */
		var DEF_MEM_LEVEL = 8;


		var LENGTH_CODES  = 29;
		/* number of length codes, not counting the special END_BLOCK code */
		var LITERALS      = 256;
		/* number of literal bytes 0..255 */
		var L_CODES       = LITERALS + 1 + LENGTH_CODES;
		/* number of Literal or Length codes, including the END_BLOCK code */
		var D_CODES       = 30;
		/* number of distance codes */
		var BL_CODES      = 19;
		/* number of codes used to transfer the bit lengths */
		var HEAP_SIZE     = 2 * L_CODES + 1;
		/* maximum heap size */
		var MAX_BITS  = 15;
		/* All codes must not exceed MAX_BITS bits */

		var MIN_MATCH = 3;
		var MAX_MATCH = 258;
		var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);

		var PRESET_DICT = 0x20;

		var INIT_STATE = 42;
		var EXTRA_STATE = 69;
		var NAME_STATE = 73;
		var COMMENT_STATE = 91;
		var HCRC_STATE = 103;
		var BUSY_STATE = 113;
		var FINISH_STATE = 666;

		var BS_NEED_MORE      = 1; /* block not completed, need more input or more output */
		var BS_BLOCK_DONE     = 2; /* block flush performed */
		var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */
		var BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */

		var OS_CODE = 0x03; // Unix :) . Don't detect, use this default.

		function err(strm, errorCode) {
		  strm.msg = msg[errorCode];
		  return errorCode;
		}

		function rank(f) {
		  return ((f) << 1) - ((f) > 4 ? 9 : 0);
		}

		function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }


		/* =========================================================================
		 * Flush as much pending output as possible. All deflate() output goes
		 * through this function so some applications may wish to modify it
		 * to avoid allocating a large strm->output buffer and copying into it.
		 * (See also read_buf()).
		 */
		function flush_pending(strm) {
		  var s = strm.state;

		  //_tr_flush_bits(s);
		  var len = s.pending;
		  if (len > strm.avail_out) {
		    len = strm.avail_out;
		  }
		  if (len === 0) { return; }

		  utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
		  strm.next_out += len;
		  s.pending_out += len;
		  strm.total_out += len;
		  strm.avail_out -= len;
		  s.pending -= len;
		  if (s.pending === 0) {
		    s.pending_out = 0;
		  }
		}


		function flush_block_only(s, last) {
		  trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);
		  s.block_start = s.strstart;
		  flush_pending(s.strm);
		}


		function put_byte(s, b) {
		  s.pending_buf[s.pending++] = b;
		}


		/* =========================================================================
		 * Put a short in the pending buffer. The 16-bit value is put in MSB order.
		 * IN assertion: the stream state is correct and there is enough room in
		 * pending_buf.
		 */
		function putShortMSB(s, b) {
		//  put_byte(s, (Byte)(b >> 8));
		//  put_byte(s, (Byte)(b & 0xff));
		  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;
		  s.pending_buf[s.pending++] = b & 0xff;
		}


		/* ===========================================================================
		 * Read a new buffer from the current input stream, update the adler32
		 * and total number of bytes read.  All deflate() input goes through
		 * this function so some applications may wish to modify it to avoid
		 * allocating a large strm->input buffer and copying from it.
		 * (See also flush_pending()).
		 */
		function read_buf(strm, buf, start, size) {
		  var len = strm.avail_in;

		  if (len > size) { len = size; }
		  if (len === 0) { return 0; }

		  strm.avail_in -= len;

		  // zmemcpy(buf, strm->next_in, len);
		  utils.arraySet(buf, strm.input, strm.next_in, len, start);
		  if (strm.state.wrap === 1) {
		    strm.adler = adler32(strm.adler, buf, len, start);
		  }

		  else if (strm.state.wrap === 2) {
		    strm.adler = crc32(strm.adler, buf, len, start);
		  }

		  strm.next_in += len;
		  strm.total_in += len;

		  return len;
		}


		/* ===========================================================================
		 * Set match_start to the longest match starting at the given string and
		 * return its length. Matches shorter or equal to prev_length are discarded,
		 * in which case the result is equal to prev_length and match_start is
		 * garbage.
		 * IN assertions: cur_match is the head of the hash chain for the current
		 *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
		 * OUT assertion: the match length is not greater than s->lookahead.
		 */
		function longest_match(s, cur_match) {
		  var chain_length = s.max_chain_length;      /* max hash chain length */
		  var scan = s.strstart; /* current string */
		  var match;                       /* matched string */
		  var len;                           /* length of current match */
		  var best_len = s.prev_length;              /* best match length so far */
		  var nice_match = s.nice_match;             /* stop if match long enough */
		  var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?
		      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;

		  var _win = s.window; // shortcut

		  var wmask = s.w_mask;
		  var prev  = s.prev;

		  /* Stop when cur_match becomes <= limit. To simplify the code,
		   * we prevent matches with the string of window index 0.
		   */

		  var strend = s.strstart + MAX_MATCH;
		  var scan_end1  = _win[scan + best_len - 1];
		  var scan_end   = _win[scan + best_len];

		  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
		   * It is easy to get rid of this optimization if necessary.
		   */
		  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

		  /* Do not waste too much time if we already have a good match: */
		  if (s.prev_length >= s.good_match) {
		    chain_length >>= 2;
		  }
		  /* Do not look for matches beyond the end of the input. This is necessary
		   * to make deflate deterministic.
		   */
		  if (nice_match > s.lookahead) { nice_match = s.lookahead; }

		  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");

		  do {
		    // Assert(cur_match < s->strstart, "no future");
		    match = cur_match;

		    /* Skip to next match if the match length cannot increase
		     * or if the match length is less than 2.  Note that the checks below
		     * for insufficient lookahead only occur occasionally for performance
		     * reasons.  Therefore uninitialized memory will be accessed, and
		     * conditional jumps will be made that depend on those values.
		     * However the length of the match is limited to the lookahead, so
		     * the output of deflate is not affected by the uninitialized values.
		     */

		    if (_win[match + best_len]     !== scan_end  ||
		        _win[match + best_len - 1] !== scan_end1 ||
		        _win[match]                !== _win[scan] ||
		        _win[++match]              !== _win[scan + 1]) {
		      continue;
		    }

		    /* The check at best_len-1 can be removed because it will be made
		     * again later. (This heuristic is not always a win.)
		     * It is not necessary to compare scan[2] and match[2] since they
		     * are always equal when the other bytes match, given that
		     * the hash keys are equal and that HASH_BITS >= 8.
		     */
		    scan += 2;
		    match++;
		    // Assert(*scan == *match, "match[2]?");

		    /* We check for insufficient lookahead only every 8th comparison;
		     * the 256th check will be made at strstart+258.
		     */
		    do {
		      /*jshint noempty:false*/
		    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
		             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
		             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
		             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
		             scan < strend);

		    // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

		    len = MAX_MATCH - (strend - scan);
		    scan = strend - MAX_MATCH;

		    if (len > best_len) {
		      s.match_start = cur_match;
		      best_len = len;
		      if (len >= nice_match) {
		        break;
		      }
		      scan_end1  = _win[scan + best_len - 1];
		      scan_end   = _win[scan + best_len];
		    }
		  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);

		  if (best_len <= s.lookahead) {
		    return best_len;
		  }
		  return s.lookahead;
		}


		/* ===========================================================================
		 * Fill the window when the lookahead becomes insufficient.
		 * Updates strstart and lookahead.
		 *
		 * IN assertion: lookahead < MIN_LOOKAHEAD
		 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
		 *    At least one byte has been read, or avail_in == 0; reads are
		 *    performed for at least two bytes (required for the zip translate_eol
		 *    option -- not supported here).
		 */
		function fill_window(s) {
		  var _w_size = s.w_size;
		  var p, n, m, more, str;

		  //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");

		  do {
		    more = s.window_size - s.lookahead - s.strstart;

		    // JS ints have 32 bit, block below not needed
		    /* Deal with !@#$% 64K limit: */
		    //if (sizeof(int) <= 2) {
		    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
		    //        more = wsize;
		    //
		    //  } else if (more == (unsigned)(-1)) {
		    //        /* Very unlikely, but possible on 16 bit machine if
		    //         * strstart == 0 && lookahead == 1 (input done a byte at time)
		    //         */
		    //        more--;
		    //    }
		    //}


		    /* If the window is almost full and there is insufficient lookahead,
		     * move the upper half to the lower one to make room in the upper half.
		     */
		    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {

		      utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
		      s.match_start -= _w_size;
		      s.strstart -= _w_size;
		      /* we now have strstart >= MAX_DIST */
		      s.block_start -= _w_size;

		      /* Slide the hash table (could be avoided with 32 bit values
		       at the expense of memory usage). We slide even when level == 0
		       to keep the hash table consistent if we switch back to level > 0
		       later. (Using level 0 permanently is not an optimal usage of
		       zlib, so we don't care about this pathological case.)
		       */

		      n = s.hash_size;
		      p = n;
		      do {
		        m = s.head[--p];
		        s.head[p] = (m >= _w_size ? m - _w_size : 0);
		      } while (--n);

		      n = _w_size;
		      p = n;
		      do {
		        m = s.prev[--p];
		        s.prev[p] = (m >= _w_size ? m - _w_size : 0);
		        /* If n is not on any hash chain, prev[n] is garbage but
		         * its value will never be used.
		         */
		      } while (--n);

		      more += _w_size;
		    }
		    if (s.strm.avail_in === 0) {
		      break;
		    }

		    /* If there was no sliding:
		     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
		     *    more == window_size - lookahead - strstart
		     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
		     * => more >= window_size - 2*WSIZE + 2
		     * In the BIG_MEM or MMAP case (not yet supported),
		     *   window_size == input_size + MIN_LOOKAHEAD  &&
		     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
		     * Otherwise, window_size == 2*WSIZE so more >= 2.
		     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
		     */
		    //Assert(more >= 2, "more < 2");
		    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
		    s.lookahead += n;

		    /* Initialize the hash value now that we have some input: */
		    if (s.lookahead + s.insert >= MIN_MATCH) {
		      str = s.strstart - s.insert;
		      s.ins_h = s.window[str];

		      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */
		      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;
		//#if MIN_MATCH != 3
		//        Call update_hash() MIN_MATCH-3 more times
		//#endif
		      while (s.insert) {
		        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
		        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;

		        s.prev[str & s.w_mask] = s.head[s.ins_h];
		        s.head[s.ins_h] = str;
		        str++;
		        s.insert--;
		        if (s.lookahead + s.insert < MIN_MATCH) {
		          break;
		        }
		      }
		    }
		    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
		     * but this is not important since only literal bytes will be emitted.
		     */

		  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);

		  /* If the WIN_INIT bytes after the end of the current data have never been
		   * written, then zero those bytes in order to avoid memory check reports of
		   * the use of uninitialized (or uninitialised as Julian writes) bytes by
		   * the longest match routines.  Update the high water mark for the next
		   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match
		   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
		   */
		//  if (s.high_water < s.window_size) {
		//    var curr = s.strstart + s.lookahead;
		//    var init = 0;
		//
		//    if (s.high_water < curr) {
		//      /* Previous high water mark below current data -- zero WIN_INIT
		//       * bytes or up to end of window, whichever is less.
		//       */
		//      init = s.window_size - curr;
		//      if (init > WIN_INIT)
		//        init = WIN_INIT;
		//      zmemzero(s->window + curr, (unsigned)init);
		//      s->high_water = curr + init;
		//    }
		//    else if (s->high_water < (ulg)curr + WIN_INIT) {
		//      /* High water mark at or above current data, but below current data
		//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
		//       * to end of window, whichever is less.
		//       */
		//      init = (ulg)curr + WIN_INIT - s->high_water;
		//      if (init > s->window_size - s->high_water)
		//        init = s->window_size - s->high_water;
		//      zmemzero(s->window + s->high_water, (unsigned)init);
		//      s->high_water += init;
		//    }
		//  }
		//
		//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
		//    "not enough room for search");
		}

		/* ===========================================================================
		 * Copy without compression as much as possible from the input stream, return
		 * the current block state.
		 * This function does not insert new strings in the dictionary since
		 * uncompressible data is probably not useful. This function is used
		 * only for the level=0 compression option.
		 * NOTE: this function should be optimized to avoid extra copying from
		 * window to pending_buf.
		 */
		function deflate_stored(s, flush) {
		  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
		   * to pending_buf_size, and each stored block has a 5 byte header:
		   */
		  var max_block_size = 0xffff;

		  if (max_block_size > s.pending_buf_size - 5) {
		    max_block_size = s.pending_buf_size - 5;
		  }

		  /* Copy as much as possible from input to output: */
		  for (;;) {
		    /* Fill the window as much as possible: */
		    if (s.lookahead <= 1) {

		      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||
		      //  s->block_start >= (long)s->w_size, "slide too late");
		//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||
		//        s.block_start >= s.w_size)) {
		//        throw  new Error("slide too late");
		//      }

		      fill_window(s);
		      if (s.lookahead === 0 && flush === Z_NO_FLUSH) {
		        return BS_NEED_MORE;
		      }

		      if (s.lookahead === 0) {
		        break;
		      }
		      /* flush the current block */
		    }
		    //Assert(s->block_start >= 0L, "block gone");
		//    if (s.block_start < 0) throw new Error("block gone");

		    s.strstart += s.lookahead;
		    s.lookahead = 0;

		    /* Emit a stored block if pending_buf will be full: */
		    var max_start = s.block_start + max_block_size;

		    if (s.strstart === 0 || s.strstart >= max_start) {
		      /* strstart == 0 is possible when wraparound on 16-bit machine */
		      s.lookahead = s.strstart - max_start;
		      s.strstart = max_start;
		      /*** FLUSH_BLOCK(s, 0); ***/
		      flush_block_only(s, false);
		      if (s.strm.avail_out === 0) {
		        return BS_NEED_MORE;
		      }
		      /***/


		    }
		    /* Flush if we may have to slide, otherwise block_start may become
		     * negative and the data will be gone:
		     */
		    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {
		      /*** FLUSH_BLOCK(s, 0); ***/
		      flush_block_only(s, false);
		      if (s.strm.avail_out === 0) {
		        return BS_NEED_MORE;
		      }
		      /***/
		    }
		  }

		  s.insert = 0;

		  if (flush === Z_FINISH) {
		    /*** FLUSH_BLOCK(s, 1); ***/
		    flush_block_only(s, true);
		    if (s.strm.avail_out === 0) {
		      return BS_FINISH_STARTED;
		    }
		    /***/
		    return BS_FINISH_DONE;
		  }

		  if (s.strstart > s.block_start) {
		    /*** FLUSH_BLOCK(s, 0); ***/
		    flush_block_only(s, false);
		    if (s.strm.avail_out === 0) {
		      return BS_NEED_MORE;
		    }
		    /***/
		  }

		  return BS_NEED_MORE;
		}

		/* ===========================================================================
		 * Compress as much as possible from the input stream, return the current
		 * block state.
		 * This function does not perform lazy evaluation of matches and inserts
		 * new strings in the dictionary only for unmatched strings or for short
		 * matches. It is used only for the fast compression options.
		 */
		function deflate_fast(s, flush) {
		  var hash_head;        /* head of the hash chain */
		  var bflush;           /* set if current block must be flushed */

		  for (;;) {
		    /* Make sure that we always have enough lookahead, except
		     * at the end of the input file. We need MAX_MATCH bytes
		     * for the next match, plus MIN_MATCH bytes to insert the
		     * string following the next match.
		     */
		    if (s.lookahead < MIN_LOOKAHEAD) {
		      fill_window(s);
		      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
		        return BS_NEED_MORE;
		      }
		      if (s.lookahead === 0) {
		        break; /* flush the current block */
		      }
		    }

		    /* Insert the string window[strstart .. strstart+2] in the
		     * dictionary, and set hash_head to the head of the hash chain:
		     */
		    hash_head = 0/*NIL*/;
		    if (s.lookahead >= MIN_MATCH) {
		      /*** INSERT_STRING(s, s.strstart, hash_head); ***/
		      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
		      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
		      s.head[s.ins_h] = s.strstart;
		      /***/
		    }

		    /* Find the longest match, discarding those <= prev_length.
		     * At this point we have always match_length < MIN_MATCH
		     */
		    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {
		      /* To simplify the code, we prevent matches with the string
		       * of window index 0 (in particular we have to avoid a match
		       * of the string with itself at the start of the input file).
		       */
		      s.match_length = longest_match(s, hash_head);
		      /* longest_match() sets match_start */
		    }
		    if (s.match_length >= MIN_MATCH) {
		      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only

		      /*** _tr_tally_dist(s, s.strstart - s.match_start,
		                     s.match_length - MIN_MATCH, bflush); ***/
		      bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);

		      s.lookahead -= s.match_length;

		      /* Insert new strings in the hash table only if the match length
		       * is not too large. This saves time but degrades compression.
		       */
		      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
		        s.match_length--; /* string at strstart already in table */
		        do {
		          s.strstart++;
		          /*** INSERT_STRING(s, s.strstart, hash_head); ***/
		          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
		          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
		          s.head[s.ins_h] = s.strstart;
		          /***/
		          /* strstart never exceeds WSIZE-MAX_MATCH, so there are
		           * always MIN_MATCH bytes ahead.
		           */
		        } while (--s.match_length !== 0);
		        s.strstart++;
		      } else
		      {
		        s.strstart += s.match_length;
		        s.match_length = 0;
		        s.ins_h = s.window[s.strstart];
		        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */
		        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;

		//#if MIN_MATCH != 3
		//                Call UPDATE_HASH() MIN_MATCH-3 more times
		//#endif
		        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
		         * matter since it will be recomputed at next deflate call.
		         */
		      }
		    } else {
		      /* No match, output a literal byte */
		      //Tracevv((stderr,"%c", s.window[s.strstart]));
		      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
		      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);

		      s.lookahead--;
		      s.strstart++;
		    }
		    if (bflush) {
		      /*** FLUSH_BLOCK(s, 0); ***/
		      flush_block_only(s, false);
		      if (s.strm.avail_out === 0) {
		        return BS_NEED_MORE;
		      }
		      /***/
		    }
		  }
		  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);
		  if (flush === Z_FINISH) {
		    /*** FLUSH_BLOCK(s, 1); ***/
		    flush_block_only(s, true);
		    if (s.strm.avail_out === 0) {
		      return BS_FINISH_STARTED;
		    }
		    /***/
		    return BS_FINISH_DONE;
		  }
		  if (s.last_lit) {
		    /*** FLUSH_BLOCK(s, 0); ***/
		    flush_block_only(s, false);
		    if (s.strm.avail_out === 0) {
		      return BS_NEED_MORE;
		    }
		    /***/
		  }
		  return BS_BLOCK_DONE;
		}

		/* ===========================================================================
		 * Same as above, but achieves better compression. We use a lazy
		 * evaluation for matches: a match is finally adopted only if there is
		 * no better match at the next window position.
		 */
		function deflate_slow(s, flush) {
		  var hash_head;          /* head of hash chain */
		  var bflush;              /* set if current block must be flushed */

		  var max_insert;

		  /* Process the input block. */
		  for (;;) {
		    /* Make sure that we always have enough lookahead, except
		     * at the end of the input file. We need MAX_MATCH bytes
		     * for the next match, plus MIN_MATCH bytes to insert the
		     * string following the next match.
		     */
		    if (s.lookahead < MIN_LOOKAHEAD) {
		      fill_window(s);
		      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
		        return BS_NEED_MORE;
		      }
		      if (s.lookahead === 0) { break; } /* flush the current block */
		    }

		    /* Insert the string window[strstart .. strstart+2] in the
		     * dictionary, and set hash_head to the head of the hash chain:
		     */
		    hash_head = 0/*NIL*/;
		    if (s.lookahead >= MIN_MATCH) {
		      /*** INSERT_STRING(s, s.strstart, hash_head); ***/
		      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
		      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
		      s.head[s.ins_h] = s.strstart;
		      /***/
		    }

		    /* Find the longest match, discarding those <= prev_length.
		     */
		    s.prev_length = s.match_length;
		    s.prev_match = s.match_start;
		    s.match_length = MIN_MATCH - 1;

		    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&
		        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {
		      /* To simplify the code, we prevent matches with the string
		       * of window index 0 (in particular we have to avoid a match
		       * of the string with itself at the start of the input file).
		       */
		      s.match_length = longest_match(s, hash_head);
		      /* longest_match() sets match_start */

		      if (s.match_length <= 5 &&
		         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {

		        /* If prev_match is also MIN_MATCH, match_start is garbage
		         * but we will ignore the current match anyway.
		         */
		        s.match_length = MIN_MATCH - 1;
		      }
		    }
		    /* If there was a match at the previous step and the current
		     * match is not better, output the previous match:
		     */
		    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
		      max_insert = s.strstart + s.lookahead - MIN_MATCH;
		      /* Do not insert strings in hash table beyond this. */

		      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);

		      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,
		                     s.prev_length - MIN_MATCH, bflush);***/
		      bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);
		      /* Insert in hash table all strings up to the end of the match.
		       * strstart-1 and strstart are already inserted. If there is not
		       * enough lookahead, the last two strings are not inserted in
		       * the hash table.
		       */
		      s.lookahead -= s.prev_length - 1;
		      s.prev_length -= 2;
		      do {
		        if (++s.strstart <= max_insert) {
		          /*** INSERT_STRING(s, s.strstart, hash_head); ***/
		          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
		          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
		          s.head[s.ins_h] = s.strstart;
		          /***/
		        }
		      } while (--s.prev_length !== 0);
		      s.match_available = 0;
		      s.match_length = MIN_MATCH - 1;
		      s.strstart++;

		      if (bflush) {
		        /*** FLUSH_BLOCK(s, 0); ***/
		        flush_block_only(s, false);
		        if (s.strm.avail_out === 0) {
		          return BS_NEED_MORE;
		        }
		        /***/
		      }

		    } else if (s.match_available) {
		      /* If there was no match at the previous position, output a
		       * single literal. If there was a match but the current match
		       * is longer, truncate the previous match to a single literal.
		       */
		      //Tracevv((stderr,"%c", s->window[s->strstart-1]));
		      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
		      bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);

		      if (bflush) {
		        /*** FLUSH_BLOCK_ONLY(s, 0) ***/
		        flush_block_only(s, false);
		        /***/
		      }
		      s.strstart++;
		      s.lookahead--;
		      if (s.strm.avail_out === 0) {
		        return BS_NEED_MORE;
		      }
		    } else {
		      /* There is no previous match to compare with, wait for
		       * the next step to decide.
		       */
		      s.match_available = 1;
		      s.strstart++;
		      s.lookahead--;
		    }
		  }
		  //Assert (flush != Z_NO_FLUSH, "no flush?");
		  if (s.match_available) {
		    //Tracevv((stderr,"%c", s->window[s->strstart-1]));
		    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
		    bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);

		    s.match_available = 0;
		  }
		  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
		  if (flush === Z_FINISH) {
		    /*** FLUSH_BLOCK(s, 1); ***/
		    flush_block_only(s, true);
		    if (s.strm.avail_out === 0) {
		      return BS_FINISH_STARTED;
		    }
		    /***/
		    return BS_FINISH_DONE;
		  }
		  if (s.last_lit) {
		    /*** FLUSH_BLOCK(s, 0); ***/
		    flush_block_only(s, false);
		    if (s.strm.avail_out === 0) {
		      return BS_NEED_MORE;
		    }
		    /***/
		  }

		  return BS_BLOCK_DONE;
		}


		/* ===========================================================================
		 * For Z_RLE, simply look for runs of bytes, generate matches only of distance
		 * one.  Do not maintain a hash table.  (It will be regenerated if this run of
		 * deflate switches away from Z_RLE.)
		 */
		function deflate_rle(s, flush) {
		  var bflush;            /* set if current block must be flushed */
		  var prev;              /* byte at distance one to match */
		  var scan, strend;      /* scan goes up to strend for length of run */

		  var _win = s.window;

		  for (;;) {
		    /* Make sure that we always have enough lookahead, except
		     * at the end of the input file. We need MAX_MATCH bytes
		     * for the longest run, plus one for the unrolled loop.
		     */
		    if (s.lookahead <= MAX_MATCH) {
		      fill_window(s);
		      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {
		        return BS_NEED_MORE;
		      }
		      if (s.lookahead === 0) { break; } /* flush the current block */
		    }

		    /* See how many times the previous byte repeats */
		    s.match_length = 0;
		    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {
		      scan = s.strstart - 1;
		      prev = _win[scan];
		      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {
		        strend = s.strstart + MAX_MATCH;
		        do {
		          /*jshint noempty:false*/
		        } while (prev === _win[++scan] && prev === _win[++scan] &&
		                 prev === _win[++scan] && prev === _win[++scan] &&
		                 prev === _win[++scan] && prev === _win[++scan] &&
		                 prev === _win[++scan] && prev === _win[++scan] &&
		                 scan < strend);
		        s.match_length = MAX_MATCH - (strend - scan);
		        if (s.match_length > s.lookahead) {
		          s.match_length = s.lookahead;
		        }
		      }
		      //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan");
		    }

		    /* Emit match if have run of MIN_MATCH or longer, else emit literal */
		    if (s.match_length >= MIN_MATCH) {
		      //check_match(s, s.strstart, s.strstart - 1, s.match_length);

		      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/
		      bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);

		      s.lookahead -= s.match_length;
		      s.strstart += s.match_length;
		      s.match_length = 0;
		    } else {
		      /* No match, output a literal byte */
		      //Tracevv((stderr,"%c", s->window[s->strstart]));
		      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
		      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);

		      s.lookahead--;
		      s.strstart++;
		    }
		    if (bflush) {
		      /*** FLUSH_BLOCK(s, 0); ***/
		      flush_block_only(s, false);
		      if (s.strm.avail_out === 0) {
		        return BS_NEED_MORE;
		      }
		      /***/
		    }
		  }
		  s.insert = 0;
		  if (flush === Z_FINISH) {
		    /*** FLUSH_BLOCK(s, 1); ***/
		    flush_block_only(s, true);
		    if (s.strm.avail_out === 0) {
		      return BS_FINISH_STARTED;
		    }
		    /***/
		    return BS_FINISH_DONE;
		  }
		  if (s.last_lit) {
		    /*** FLUSH_BLOCK(s, 0); ***/
		    flush_block_only(s, false);
		    if (s.strm.avail_out === 0) {
		      return BS_NEED_MORE;
		    }
		    /***/
		  }
		  return BS_BLOCK_DONE;
		}

		/* ===========================================================================
		 * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.
		 * (It will be regenerated if this run of deflate switches away from Huffman.)
		 */
		function deflate_huff(s, flush) {
		  var bflush;             /* set if current block must be flushed */

		  for (;;) {
		    /* Make sure that we have a literal to write. */
		    if (s.lookahead === 0) {
		      fill_window(s);
		      if (s.lookahead === 0) {
		        if (flush === Z_NO_FLUSH) {
		          return BS_NEED_MORE;
		        }
		        break;      /* flush the current block */
		      }
		    }

		    /* Output a literal byte */
		    s.match_length = 0;
		    //Tracevv((stderr,"%c", s->window[s->strstart]));
		    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
		    bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
		    s.lookahead--;
		    s.strstart++;
		    if (bflush) {
		      /*** FLUSH_BLOCK(s, 0); ***/
		      flush_block_only(s, false);
		      if (s.strm.avail_out === 0) {
		        return BS_NEED_MORE;
		      }
		      /***/
		    }
		  }
		  s.insert = 0;
		  if (flush === Z_FINISH) {
		    /*** FLUSH_BLOCK(s, 1); ***/
		    flush_block_only(s, true);
		    if (s.strm.avail_out === 0) {
		      return BS_FINISH_STARTED;
		    }
		    /***/
		    return BS_FINISH_DONE;
		  }
		  if (s.last_lit) {
		    /*** FLUSH_BLOCK(s, 0); ***/
		    flush_block_only(s, false);
		    if (s.strm.avail_out === 0) {
		      return BS_NEED_MORE;
		    }
		    /***/
		  }
		  return BS_BLOCK_DONE;
		}

		/* Values for max_lazy_match, good_match and max_chain_length, depending on
		 * the desired pack level (0..9). The values given below have been tuned to
		 * exclude worst case performance for pathological files. Better values may be
		 * found for specific files.
		 */
		function Config(good_length, max_lazy, nice_length, max_chain, func) {
		  this.good_length = good_length;
		  this.max_lazy = max_lazy;
		  this.nice_length = nice_length;
		  this.max_chain = max_chain;
		  this.func = func;
		}

		var configuration_table;

		configuration_table = [
		  /*      good lazy nice chain */
		  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */
		  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */
		  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */
		  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */

		  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */
		  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */
		  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */
		  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */
		  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */
		  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */
		];


		/* ===========================================================================
		 * Initialize the "longest match" routines for a new zlib stream
		 */
		function lm_init(s) {
		  s.window_size = 2 * s.w_size;

		  /*** CLEAR_HASH(s); ***/
		  zero(s.head); // Fill with NIL (= 0);

		  /* Set the default configuration parameters:
		   */
		  s.max_lazy_match = configuration_table[s.level].max_lazy;
		  s.good_match = configuration_table[s.level].good_length;
		  s.nice_match = configuration_table[s.level].nice_length;
		  s.max_chain_length = configuration_table[s.level].max_chain;

		  s.strstart = 0;
		  s.block_start = 0;
		  s.lookahead = 0;
		  s.insert = 0;
		  s.match_length = s.prev_length = MIN_MATCH - 1;
		  s.match_available = 0;
		  s.ins_h = 0;
		}


		function DeflateState() {
		  this.strm = null;            /* pointer back to this zlib stream */
		  this.status = 0;            /* as the name implies */
		  this.pending_buf = null;      /* output still pending */
		  this.pending_buf_size = 0;  /* size of pending_buf */
		  this.pending_out = 0;       /* next pending byte to output to the stream */
		  this.pending = 0;           /* nb of bytes in the pending buffer */
		  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */
		  this.gzhead = null;         /* gzip header information to write */
		  this.gzindex = 0;           /* where in extra, name, or comment */
		  this.method = Z_DEFLATED; /* can only be DEFLATED */
		  this.last_flush = -1;   /* value of flush param for previous deflate call */

		  this.w_size = 0;  /* LZ77 window size (32K by default) */
		  this.w_bits = 0;  /* log2(w_size)  (8..16) */
		  this.w_mask = 0;  /* w_size - 1 */

		  this.window = null;
		  /* Sliding window. Input bytes are read into the second half of the window,
		   * and move to the first half later to keep a dictionary of at least wSize
		   * bytes. With this organization, matches are limited to a distance of
		   * wSize-MAX_MATCH bytes, but this ensures that IO is always
		   * performed with a length multiple of the block size.
		   */

		  this.window_size = 0;
		  /* Actual size of window: 2*wSize, except when the user input buffer
		   * is directly used as sliding window.
		   */

		  this.prev = null;
		  /* Link to older string with same hash index. To limit the size of this
		   * array to 64K, this link is maintained only for the last 32K strings.
		   * An index in this array is thus a window index modulo 32K.
		   */

		  this.head = null;   /* Heads of the hash chains or NIL. */

		  this.ins_h = 0;       /* hash index of string to be inserted */
		  this.hash_size = 0;   /* number of elements in hash table */
		  this.hash_bits = 0;   /* log2(hash_size) */
		  this.hash_mask = 0;   /* hash_size-1 */

		  this.hash_shift = 0;
		  /* Number of bits by which ins_h must be shifted at each input
		   * step. It must be such that after MIN_MATCH steps, the oldest
		   * byte no longer takes part in the hash key, that is:
		   *   hash_shift * MIN_MATCH >= hash_bits
		   */

		  this.block_start = 0;
		  /* Window position at the beginning of the current output block. Gets
		   * negative when the window is moved backwards.
		   */

		  this.match_length = 0;      /* length of best match */
		  this.prev_match = 0;        /* previous match */
		  this.match_available = 0;   /* set if previous match exists */
		  this.strstart = 0;          /* start of string to insert */
		  this.match_start = 0;       /* start of matching string */
		  this.lookahead = 0;         /* number of valid bytes ahead in window */

		  this.prev_length = 0;
		  /* Length of the best match at previous step. Matches not greater than this
		   * are discarded. This is used in the lazy match evaluation.
		   */

		  this.max_chain_length = 0;
		  /* To speed up deflation, hash chains are never searched beyond this
		   * length.  A higher limit improves compression ratio but degrades the
		   * speed.
		   */

		  this.max_lazy_match = 0;
		  /* Attempt to find a better match only when the current match is strictly
		   * smaller than this value. This mechanism is used only for compression
		   * levels >= 4.
		   */
		  // That's alias to max_lazy_match, don't use directly
		  //this.max_insert_length = 0;
		  /* Insert new strings in the hash table only if the match length is not
		   * greater than this length. This saves time but degrades compression.
		   * max_insert_length is used only for compression levels <= 3.
		   */

		  this.level = 0;     /* compression level (1..9) */
		  this.strategy = 0;  /* favor or force Huffman coding*/

		  this.good_match = 0;
		  /* Use a faster search when the previous match is longer than this */

		  this.nice_match = 0; /* Stop searching when current match exceeds this */

		              /* used by trees.c: */

		  /* Didn't use ct_data typedef below to suppress compiler warning */

		  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */
		  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
		  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */

		  // Use flat array of DOUBLE size, with interleaved fata,
		  // because JS does not support effective
		  this.dyn_ltree  = new utils.Buf16(HEAP_SIZE * 2);
		  this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);
		  this.bl_tree    = new utils.Buf16((2 * BL_CODES + 1) * 2);
		  zero(this.dyn_ltree);
		  zero(this.dyn_dtree);
		  zero(this.bl_tree);

		  this.l_desc   = null;         /* desc. for literal tree */
		  this.d_desc   = null;         /* desc. for distance tree */
		  this.bl_desc  = null;         /* desc. for bit length tree */

		  //ush bl_count[MAX_BITS+1];
		  this.bl_count = new utils.Buf16(MAX_BITS + 1);
		  /* number of codes at each bit length for an optimal tree */

		  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
		  this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */
		  zero(this.heap);

		  this.heap_len = 0;               /* number of elements in the heap */
		  this.heap_max = 0;               /* element of largest frequency */
		  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
		   * The same heap array is used to build all trees.
		   */

		  this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];
		  zero(this.depth);
		  /* Depth of each subtree used as tie breaker for trees of equal frequency
		   */

		  this.l_buf = 0;          /* buffer index for literals or lengths */

		  this.lit_bufsize = 0;
		  /* Size of match buffer for literals/lengths.  There are 4 reasons for
		   * limiting lit_bufsize to 64K:
		   *   - frequencies can be kept in 16 bit counters
		   *   - if compression is not successful for the first block, all input
		   *     data is still in the window so we can still emit a stored block even
		   *     when input comes from standard input.  (This can also be done for
		   *     all blocks if lit_bufsize is not greater than 32K.)
		   *   - if compression is not successful for a file smaller than 64K, we can
		   *     even emit a stored file instead of a stored block (saving 5 bytes).
		   *     This is applicable only for zip (not gzip or zlib).
		   *   - creating new Huffman trees less frequently may not provide fast
		   *     adaptation to changes in the input data statistics. (Take for
		   *     example a binary file with poorly compressible code followed by
		   *     a highly compressible string table.) Smaller buffer sizes give
		   *     fast adaptation but have of course the overhead of transmitting
		   *     trees more frequently.
		   *   - I can't count above 4
		   */

		  this.last_lit = 0;      /* running index in l_buf */

		  this.d_buf = 0;
		  /* Buffer index for distances. To simplify the code, d_buf and l_buf have
		   * the same number of elements. To use different lengths, an extra flag
		   * array would be necessary.
		   */

		  this.opt_len = 0;       /* bit length of current block with optimal trees */
		  this.static_len = 0;    /* bit length of current block with static trees */
		  this.matches = 0;       /* number of string matches in current block */
		  this.insert = 0;        /* bytes at end of window left to insert */


		  this.bi_buf = 0;
		  /* Output buffer. bits are inserted starting at the bottom (least
		   * significant bits).
		   */
		  this.bi_valid = 0;
		  /* Number of valid bits in bi_buf.  All bits above the last valid bit
		   * are always zero.
		   */

		  // Used for window memory init. We safely ignore it for JS. That makes
		  // sense only for pointers and memory check tools.
		  //this.high_water = 0;
		  /* High water mark offset in window for initialized bytes -- bytes above
		   * this are set to zero in order to avoid memory check warnings when
		   * longest match routines access bytes past the input.  This is then
		   * updated to the new high water mark.
		   */
		}


		function deflateResetKeep(strm) {
		  var s;

		  if (!strm || !strm.state) {
		    return err(strm, Z_STREAM_ERROR);
		  }

		  strm.total_in = strm.total_out = 0;
		  strm.data_type = Z_UNKNOWN;

		  s = strm.state;
		  s.pending = 0;
		  s.pending_out = 0;

		  if (s.wrap < 0) {
		    s.wrap = -s.wrap;
		    /* was made negative by deflate(..., Z_FINISH); */
		  }
		  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);
		  strm.adler = (s.wrap === 2) ?
		    0  // crc32(0, Z_NULL, 0)
		  :
		    1; // adler32(0, Z_NULL, 0)
		  s.last_flush = Z_NO_FLUSH;
		  trees._tr_init(s);
		  return Z_OK;
		}


		function deflateReset(strm) {
		  var ret = deflateResetKeep(strm);
		  if (ret === Z_OK) {
		    lm_init(strm.state);
		  }
		  return ret;
		}


		function deflateSetHeader(strm, head) {
		  if (!strm || !strm.state) { return Z_STREAM_ERROR; }
		  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }
		  strm.state.gzhead = head;
		  return Z_OK;
		}


		function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
		  if (!strm) { // === Z_NULL
		    return Z_STREAM_ERROR;
		  }
		  var wrap = 1;

		  if (level === Z_DEFAULT_COMPRESSION) {
		    level = 6;
		  }

		  if (windowBits < 0) { /* suppress zlib wrapper */
		    wrap = 0;
		    windowBits = -windowBits;
		  }

		  else if (windowBits > 15) {
		    wrap = 2;           /* write gzip wrapper instead */
		    windowBits -= 16;
		  }


		  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||
		    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
		    strategy < 0 || strategy > Z_FIXED) {
		    return err(strm, Z_STREAM_ERROR);
		  }


		  if (windowBits === 8) {
		    windowBits = 9;
		  }
		  /* until 256-byte window bug fixed */

		  var s = new DeflateState();

		  strm.state = s;
		  s.strm = strm;

		  s.wrap = wrap;
		  s.gzhead = null;
		  s.w_bits = windowBits;
		  s.w_size = 1 << s.w_bits;
		  s.w_mask = s.w_size - 1;

		  s.hash_bits = memLevel + 7;
		  s.hash_size = 1 << s.hash_bits;
		  s.hash_mask = s.hash_size - 1;
		  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);

		  s.window = new utils.Buf8(s.w_size * 2);
		  s.head = new utils.Buf16(s.hash_size);
		  s.prev = new utils.Buf16(s.w_size);

		  // Don't need mem init magic for JS.
		  //s.high_water = 0;  /* nothing written to s->window yet */

		  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */

		  s.pending_buf_size = s.lit_bufsize * 4;
		  s.pending_buf = new utils.Buf8(s.pending_buf_size);

		  s.d_buf = s.lit_bufsize >> 1;
		  s.l_buf = (1 + 2) * s.lit_bufsize;

		  s.level = level;
		  s.strategy = strategy;
		  s.method = method;

		  return deflateReset(strm);
		}

		function deflateInit(strm, level) {
		  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
		}


		function deflate(strm, flush) {
		  var old_flush, s;
		  var beg, val; // for gzip header write only

		  if (!strm || !strm.state ||
		    flush > Z_BLOCK || flush < 0) {
		    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
		  }

		  s = strm.state;

		  if (!strm.output ||
		      (!strm.input && strm.avail_in !== 0) ||
		      (s.status === FINISH_STATE && flush !== Z_FINISH)) {
		    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);
		  }

		  s.strm = strm; /* just in case */
		  old_flush = s.last_flush;
		  s.last_flush = flush;

		  /* Write the header */
		  if (s.status === INIT_STATE) {

		    if (s.wrap === 2) { // GZIP header
		      strm.adler = 0;  //crc32(0L, Z_NULL, 0);
		      put_byte(s, 31);
		      put_byte(s, 139);
		      put_byte(s, 8);
		      if (!s.gzhead) { // s->gzhead == Z_NULL
		        put_byte(s, 0);
		        put_byte(s, 0);
		        put_byte(s, 0);
		        put_byte(s, 0);
		        put_byte(s, 0);
		        put_byte(s, s.level === 9 ? 2 :
		                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
		                     4 : 0));
		        put_byte(s, OS_CODE);
		        s.status = BUSY_STATE;
		      }
		      else {
		        put_byte(s, (s.gzhead.text ? 1 : 0) +
		                    (s.gzhead.hcrc ? 2 : 0) +
		                    (!s.gzhead.extra ? 0 : 4) +
		                    (!s.gzhead.name ? 0 : 8) +
		                    (!s.gzhead.comment ? 0 : 16)
		                );
		        put_byte(s, s.gzhead.time & 0xff);
		        put_byte(s, (s.gzhead.time >> 8) & 0xff);
		        put_byte(s, (s.gzhead.time >> 16) & 0xff);
		        put_byte(s, (s.gzhead.time >> 24) & 0xff);
		        put_byte(s, s.level === 9 ? 2 :
		                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
		                     4 : 0));
		        put_byte(s, s.gzhead.os & 0xff);
		        if (s.gzhead.extra && s.gzhead.extra.length) {
		          put_byte(s, s.gzhead.extra.length & 0xff);
		          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);
		        }
		        if (s.gzhead.hcrc) {
		          strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
		        }
		        s.gzindex = 0;
		        s.status = EXTRA_STATE;
		      }
		    }
		    else // DEFLATE header
		    {
		      var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;
		      var level_flags = -1;

		      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
		        level_flags = 0;
		      } else if (s.level < 6) {
		        level_flags = 1;
		      } else if (s.level === 6) {
		        level_flags = 2;
		      } else {
		        level_flags = 3;
		      }
		      header |= (level_flags << 6);
		      if (s.strstart !== 0) { header |= PRESET_DICT; }
		      header += 31 - (header % 31);

		      s.status = BUSY_STATE;
		      putShortMSB(s, header);

		      /* Save the adler32 of the preset dictionary: */
		      if (s.strstart !== 0) {
		        putShortMSB(s, strm.adler >>> 16);
		        putShortMSB(s, strm.adler & 0xffff);
		      }
		      strm.adler = 1; // adler32(0L, Z_NULL, 0);
		    }
		  }

		//#ifdef GZIP
		  if (s.status === EXTRA_STATE) {
		    if (s.gzhead.extra/* != Z_NULL*/) {
		      beg = s.pending;  /* start of bytes to update crc */

		      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {
		        if (s.pending === s.pending_buf_size) {
		          if (s.gzhead.hcrc && s.pending > beg) {
		            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
		          }
		          flush_pending(strm);
		          beg = s.pending;
		          if (s.pending === s.pending_buf_size) {
		            break;
		          }
		        }
		        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);
		        s.gzindex++;
		      }
		      if (s.gzhead.hcrc && s.pending > beg) {
		        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
		      }
		      if (s.gzindex === s.gzhead.extra.length) {
		        s.gzindex = 0;
		        s.status = NAME_STATE;
		      }
		    }
		    else {
		      s.status = NAME_STATE;
		    }
		  }
		  if (s.status === NAME_STATE) {
		    if (s.gzhead.name/* != Z_NULL*/) {
		      beg = s.pending;  /* start of bytes to update crc */
		      //int val;

		      do {
		        if (s.pending === s.pending_buf_size) {
		          if (s.gzhead.hcrc && s.pending > beg) {
		            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
		          }
		          flush_pending(strm);
		          beg = s.pending;
		          if (s.pending === s.pending_buf_size) {
		            val = 1;
		            break;
		          }
		        }
		        // JS specific: little magic to add zero terminator to end of string
		        if (s.gzindex < s.gzhead.name.length) {
		          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;
		        } else {
		          val = 0;
		        }
		        put_byte(s, val);
		      } while (val !== 0);

		      if (s.gzhead.hcrc && s.pending > beg) {
		        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
		      }
		      if (val === 0) {
		        s.gzindex = 0;
		        s.status = COMMENT_STATE;
		      }
		    }
		    else {
		      s.status = COMMENT_STATE;
		    }
		  }
		  if (s.status === COMMENT_STATE) {
		    if (s.gzhead.comment/* != Z_NULL*/) {
		      beg = s.pending;  /* start of bytes to update crc */
		      //int val;

		      do {
		        if (s.pending === s.pending_buf_size) {
		          if (s.gzhead.hcrc && s.pending > beg) {
		            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
		          }
		          flush_pending(strm);
		          beg = s.pending;
		          if (s.pending === s.pending_buf_size) {
		            val = 1;
		            break;
		          }
		        }
		        // JS specific: little magic to add zero terminator to end of string
		        if (s.gzindex < s.gzhead.comment.length) {
		          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;
		        } else {
		          val = 0;
		        }
		        put_byte(s, val);
		      } while (val !== 0);

		      if (s.gzhead.hcrc && s.pending > beg) {
		        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
		      }
		      if (val === 0) {
		        s.status = HCRC_STATE;
		      }
		    }
		    else {
		      s.status = HCRC_STATE;
		    }
		  }
		  if (s.status === HCRC_STATE) {
		    if (s.gzhead.hcrc) {
		      if (s.pending + 2 > s.pending_buf_size) {
		        flush_pending(strm);
		      }
		      if (s.pending + 2 <= s.pending_buf_size) {
		        put_byte(s, strm.adler & 0xff);
		        put_byte(s, (strm.adler >> 8) & 0xff);
		        strm.adler = 0; //crc32(0L, Z_NULL, 0);
		        s.status = BUSY_STATE;
		      }
		    }
		    else {
		      s.status = BUSY_STATE;
		    }
		  }
		//#endif

		  /* Flush as much pending output as possible */
		  if (s.pending !== 0) {
		    flush_pending(strm);
		    if (strm.avail_out === 0) {
		      /* Since avail_out is 0, deflate will be called again with
		       * more output space, but possibly with both pending and
		       * avail_in equal to zero. There won't be anything to do,
		       * but this is not an error situation so make sure we
		       * return OK instead of BUF_ERROR at next call of deflate:
		       */
		      s.last_flush = -1;
		      return Z_OK;
		    }

		    /* Make sure there is something to do and avoid duplicate consecutive
		     * flushes. For repeated and useless calls with Z_FINISH, we keep
		     * returning Z_STREAM_END instead of Z_BUF_ERROR.
		     */
		  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&
		    flush !== Z_FINISH) {
		    return err(strm, Z_BUF_ERROR);
		  }

		  /* User must not provide more input after the first FINISH: */
		  if (s.status === FINISH_STATE && strm.avail_in !== 0) {
		    return err(strm, Z_BUF_ERROR);
		  }

		  /* Start a new block or continue the current one.
		   */
		  if (strm.avail_in !== 0 || s.lookahead !== 0 ||
		    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {
		    var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :
		      (s.strategy === Z_RLE ? deflate_rle(s, flush) :
		        configuration_table[s.level].func(s, flush));

		    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {
		      s.status = FINISH_STATE;
		    }
		    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {
		      if (strm.avail_out === 0) {
		        s.last_flush = -1;
		        /* avoid BUF_ERROR next call, see above */
		      }
		      return Z_OK;
		      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
		       * of deflate should use the same flush parameter to make sure
		       * that the flush is complete. So we don't have to output an
		       * empty block here, this will be done at next call. This also
		       * ensures that for a very small output buffer, we emit at most
		       * one empty block.
		       */
		    }
		    if (bstate === BS_BLOCK_DONE) {
		      if (flush === Z_PARTIAL_FLUSH) {
		        trees._tr_align(s);
		      }
		      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */

		        trees._tr_stored_block(s, 0, 0, false);
		        /* For a full flush, this empty block will be recognized
		         * as a special marker by inflate_sync().
		         */
		        if (flush === Z_FULL_FLUSH) {
		          /*** CLEAR_HASH(s); ***/             /* forget history */
		          zero(s.head); // Fill with NIL (= 0);

		          if (s.lookahead === 0) {
		            s.strstart = 0;
		            s.block_start = 0;
		            s.insert = 0;
		          }
		        }
		      }
		      flush_pending(strm);
		      if (strm.avail_out === 0) {
		        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */
		        return Z_OK;
		      }
		    }
		  }
		  //Assert(strm->avail_out > 0, "bug2");
		  //if (strm.avail_out <= 0) { throw new Error("bug2");}

		  if (flush !== Z_FINISH) { return Z_OK; }
		  if (s.wrap <= 0) { return Z_STREAM_END; }

		  /* Write the trailer */
		  if (s.wrap === 2) {
		    put_byte(s, strm.adler & 0xff);
		    put_byte(s, (strm.adler >> 8) & 0xff);
		    put_byte(s, (strm.adler >> 16) & 0xff);
		    put_byte(s, (strm.adler >> 24) & 0xff);
		    put_byte(s, strm.total_in & 0xff);
		    put_byte(s, (strm.total_in >> 8) & 0xff);
		    put_byte(s, (strm.total_in >> 16) & 0xff);
		    put_byte(s, (strm.total_in >> 24) & 0xff);
		  }
		  else
		  {
		    putShortMSB(s, strm.adler >>> 16);
		    putShortMSB(s, strm.adler & 0xffff);
		  }

		  flush_pending(strm);
		  /* If avail_out is zero, the application will call deflate again
		   * to flush the rest.
		   */
		  if (s.wrap > 0) { s.wrap = -s.wrap; }
		  /* write the trailer only once! */
		  return s.pending !== 0 ? Z_OK : Z_STREAM_END;
		}

		function deflateEnd(strm) {
		  var status;

		  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
		    return Z_STREAM_ERROR;
		  }

		  status = strm.state.status;
		  if (status !== INIT_STATE &&
		    status !== EXTRA_STATE &&
		    status !== NAME_STATE &&
		    status !== COMMENT_STATE &&
		    status !== HCRC_STATE &&
		    status !== BUSY_STATE &&
		    status !== FINISH_STATE
		  ) {
		    return err(strm, Z_STREAM_ERROR);
		  }

		  strm.state = null;

		  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
		}


		/* =========================================================================
		 * Initializes the compression dictionary from the given byte
		 * sequence without producing any compressed output.
		 */
		function deflateSetDictionary(strm, dictionary) {
		  var dictLength = dictionary.length;

		  var s;
		  var str, n;
		  var wrap;
		  var avail;
		  var next;
		  var input;
		  var tmpDict;

		  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
		    return Z_STREAM_ERROR;
		  }

		  s = strm.state;
		  wrap = s.wrap;

		  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {
		    return Z_STREAM_ERROR;
		  }

		  /* when using zlib wrappers, compute Adler-32 for provided dictionary */
		  if (wrap === 1) {
		    /* adler32(strm->adler, dictionary, dictLength); */
		    strm.adler = adler32(strm.adler, dictionary, dictLength, 0);
		  }

		  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */

		  /* if dictionary would fill window, just replace the history */
		  if (dictLength >= s.w_size) {
		    if (wrap === 0) {            /* already empty otherwise */
		      /*** CLEAR_HASH(s); ***/
		      zero(s.head); // Fill with NIL (= 0);
		      s.strstart = 0;
		      s.block_start = 0;
		      s.insert = 0;
		    }
		    /* use the tail */
		    // dictionary = dictionary.slice(dictLength - s.w_size);
		    tmpDict = new utils.Buf8(s.w_size);
		    utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);
		    dictionary = tmpDict;
		    dictLength = s.w_size;
		  }
		  /* insert dictionary into window and hash */
		  avail = strm.avail_in;
		  next = strm.next_in;
		  input = strm.input;
		  strm.avail_in = dictLength;
		  strm.next_in = 0;
		  strm.input = dictionary;
		  fill_window(s);
		  while (s.lookahead >= MIN_MATCH) {
		    str = s.strstart;
		    n = s.lookahead - (MIN_MATCH - 1);
		    do {
		      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
		      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;

		      s.prev[str & s.w_mask] = s.head[s.ins_h];

		      s.head[s.ins_h] = str;
		      str++;
		    } while (--n);
		    s.strstart = str;
		    s.lookahead = MIN_MATCH - 1;
		    fill_window(s);
		  }
		  s.strstart += s.lookahead;
		  s.block_start = s.strstart;
		  s.insert = s.lookahead;
		  s.lookahead = 0;
		  s.match_length = s.prev_length = MIN_MATCH - 1;
		  s.match_available = 0;
		  strm.next_in = next;
		  strm.input = input;
		  strm.avail_in = avail;
		  s.wrap = wrap;
		  return Z_OK;
		}


		exports.deflateInit = deflateInit;
		exports.deflateInit2 = deflateInit2;
		exports.deflateReset = deflateReset;
		exports.deflateResetKeep = deflateResetKeep;
		exports.deflateSetHeader = deflateSetHeader;
		exports.deflate = deflate;
		exports.deflateEnd = deflateEnd;
		exports.deflateSetDictionary = deflateSetDictionary;
		exports.deflateInfo = 'pako deflate (from Nodeca project)';

		/* Not implemented
		exports.deflateBound = deflateBound;
		exports.deflateCopy = deflateCopy;
		exports.deflateParams = deflateParams;
		exports.deflatePending = deflatePending;
		exports.deflatePrime = deflatePrime;
		exports.deflateTune = deflateTune;
		*/


	/***/ },
	/* 696 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		// See state defs from inflate.js
		var BAD = 30;       /* got a data error -- remain here until reset */
		var TYPE = 12;      /* i: waiting for type bits, including last-flag bit */

		/*
		   Decode literal, length, and distance codes and write out the resulting
		   literal and match bytes until either not enough input or output is
		   available, an end-of-block is encountered, or a data error is encountered.
		   When large enough input and output buffers are supplied to inflate(), for
		   example, a 16K input buffer and a 64K output buffer, more than 95% of the
		   inflate execution time is spent in this routine.

		   Entry assumptions:

		        state.mode === LEN
		        strm.avail_in >= 6
		        strm.avail_out >= 258
		        start >= strm.avail_out
		        state.bits < 8

		   On return, state.mode is one of:

		        LEN -- ran out of enough output space or enough available input
		        TYPE -- reached end of block code, inflate() to interpret next block
		        BAD -- error in block data

		   Notes:

		    - The maximum input bits used by a length/distance pair is 15 bits for the
		      length code, 5 bits for the length extra, 15 bits for the distance code,
		      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
		      Therefore if strm.avail_in >= 6, then there is enough input to avoid
		      checking for available input while decoding.

		    - The maximum bytes that a single length/distance pair can output is 258
		      bytes, which is the maximum length that can be coded.  inflate_fast()
		      requires strm.avail_out >= 258 for each loop to avoid checking for
		      output space.
		 */
		module.exports = function inflate_fast(strm, start) {
		  var state;
		  var _in;                    /* local strm.input */
		  var last;                   /* have enough input while in < last */
		  var _out;                   /* local strm.output */
		  var beg;                    /* inflate()'s initial strm.output */
		  var end;                    /* while out < end, enough space available */
		//#ifdef INFLATE_STRICT
		  var dmax;                   /* maximum distance from zlib header */
		//#endif
		  var wsize;                  /* window size or zero if not using window */
		  var whave;                  /* valid bytes in the window */
		  var wnext;                  /* window write index */
		  // Use `s_window` instead `window`, avoid conflict with instrumentation tools
		  var s_window;               /* allocated sliding window, if wsize != 0 */
		  var hold;                   /* local strm.hold */
		  var bits;                   /* local strm.bits */
		  var lcode;                  /* local strm.lencode */
		  var dcode;                  /* local strm.distcode */
		  var lmask;                  /* mask for first level of length codes */
		  var dmask;                  /* mask for first level of distance codes */
		  var here;                   /* retrieved table entry */
		  var op;                     /* code bits, operation, extra bits, or */
		                              /*  window position, window bytes to copy */
		  var len;                    /* match length, unused bytes */
		  var dist;                   /* match distance */
		  var from;                   /* where to copy match from */
		  var from_source;


		  var input, output; // JS specific, because we have no pointers

		  /* copy state to local variables */
		  state = strm.state;
		  //here = state.here;
		  _in = strm.next_in;
		  input = strm.input;
		  last = _in + (strm.avail_in - 5);
		  _out = strm.next_out;
		  output = strm.output;
		  beg = _out - (start - strm.avail_out);
		  end = _out + (strm.avail_out - 257);
		//#ifdef INFLATE_STRICT
		  dmax = state.dmax;
		//#endif
		  wsize = state.wsize;
		  whave = state.whave;
		  wnext = state.wnext;
		  s_window = state.window;
		  hold = state.hold;
		  bits = state.bits;
		  lcode = state.lencode;
		  dcode = state.distcode;
		  lmask = (1 << state.lenbits) - 1;
		  dmask = (1 << state.distbits) - 1;


		  /* decode literals and length/distances until end-of-block or not enough
		     input data or output space */

		  top:
		  do {
		    if (bits < 15) {
		      hold += input[_in++] << bits;
		      bits += 8;
		      hold += input[_in++] << bits;
		      bits += 8;
		    }

		    here = lcode[hold & lmask];

		    dolen:
		    for (;;) { // Goto emulation
		      op = here >>> 24/*here.bits*/;
		      hold >>>= op;
		      bits -= op;
		      op = (here >>> 16) & 0xff/*here.op*/;
		      if (op === 0) {                          /* literal */
		        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
		        //        "inflate:         literal '%c'\n" :
		        //        "inflate:         literal 0x%02x\n", here.val));
		        output[_out++] = here & 0xffff/*here.val*/;
		      }
		      else if (op & 16) {                     /* length base */
		        len = here & 0xffff/*here.val*/;
		        op &= 15;                           /* number of extra bits */
		        if (op) {
		          if (bits < op) {
		            hold += input[_in++] << bits;
		            bits += 8;
		          }
		          len += hold & ((1 << op) - 1);
		          hold >>>= op;
		          bits -= op;
		        }
		        //Tracevv((stderr, "inflate:         length %u\n", len));
		        if (bits < 15) {
		          hold += input[_in++] << bits;
		          bits += 8;
		          hold += input[_in++] << bits;
		          bits += 8;
		        }
		        here = dcode[hold & dmask];

		        dodist:
		        for (;;) { // goto emulation
		          op = here >>> 24/*here.bits*/;
		          hold >>>= op;
		          bits -= op;
		          op = (here >>> 16) & 0xff/*here.op*/;

		          if (op & 16) {                      /* distance base */
		            dist = here & 0xffff/*here.val*/;
		            op &= 15;                       /* number of extra bits */
		            if (bits < op) {
		              hold += input[_in++] << bits;
		              bits += 8;
		              if (bits < op) {
		                hold += input[_in++] << bits;
		                bits += 8;
		              }
		            }
		            dist += hold & ((1 << op) - 1);
		//#ifdef INFLATE_STRICT
		            if (dist > dmax) {
		              strm.msg = 'invalid distance too far back';
		              state.mode = BAD;
		              break top;
		            }
		//#endif
		            hold >>>= op;
		            bits -= op;
		            //Tracevv((stderr, "inflate:         distance %u\n", dist));
		            op = _out - beg;                /* max distance in output */
		            if (dist > op) {                /* see if copy from window */
		              op = dist - op;               /* distance back in window */
		              if (op > whave) {
		                if (state.sane) {
		                  strm.msg = 'invalid distance too far back';
		                  state.mode = BAD;
		                  break top;
		                }

		// (!) This block is disabled in zlib defailts,
		// don't enable it for binary compatibility
		//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
		//                if (len <= op - whave) {
		//                  do {
		//                    output[_out++] = 0;
		//                  } while (--len);
		//                  continue top;
		//                }
		//                len -= op - whave;
		//                do {
		//                  output[_out++] = 0;
		//                } while (--op > whave);
		//                if (op === 0) {
		//                  from = _out - dist;
		//                  do {
		//                    output[_out++] = output[from++];
		//                  } while (--len);
		//                  continue top;
		//                }
		//#endif
		              }
		              from = 0; // window index
		              from_source = s_window;
		              if (wnext === 0) {           /* very common case */
		                from += wsize - op;
		                if (op < len) {         /* some from window */
		                  len -= op;
		                  do {
		                    output[_out++] = s_window[from++];
		                  } while (--op);
		                  from = _out - dist;  /* rest from output */
		                  from_source = output;
		                }
		              }
		              else if (wnext < op) {      /* wrap around window */
		                from += wsize + wnext - op;
		                op -= wnext;
		                if (op < len) {         /* some from end of window */
		                  len -= op;
		                  do {
		                    output[_out++] = s_window[from++];
		                  } while (--op);
		                  from = 0;
		                  if (wnext < len) {  /* some from start of window */
		                    op = wnext;
		                    len -= op;
		                    do {
		                      output[_out++] = s_window[from++];
		                    } while (--op);
		                    from = _out - dist;      /* rest from output */
		                    from_source = output;
		                  }
		                }
		              }
		              else {                      /* contiguous in window */
		                from += wnext - op;
		                if (op < len) {         /* some from window */
		                  len -= op;
		                  do {
		                    output[_out++] = s_window[from++];
		                  } while (--op);
		                  from = _out - dist;  /* rest from output */
		                  from_source = output;
		                }
		              }
		              while (len > 2) {
		                output[_out++] = from_source[from++];
		                output[_out++] = from_source[from++];
		                output[_out++] = from_source[from++];
		                len -= 3;
		              }
		              if (len) {
		                output[_out++] = from_source[from++];
		                if (len > 1) {
		                  output[_out++] = from_source[from++];
		                }
		              }
		            }
		            else {
		              from = _out - dist;          /* copy direct from output */
		              do {                        /* minimum length is three */
		                output[_out++] = output[from++];
		                output[_out++] = output[from++];
		                output[_out++] = output[from++];
		                len -= 3;
		              } while (len > 2);
		              if (len) {
		                output[_out++] = output[from++];
		                if (len > 1) {
		                  output[_out++] = output[from++];
		                }
		              }
		            }
		          }
		          else if ((op & 64) === 0) {          /* 2nd level distance code */
		            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
		            continue dodist;
		          }
		          else {
		            strm.msg = 'invalid distance code';
		            state.mode = BAD;
		            break top;
		          }

		          break; // need to emulate goto via "continue"
		        }
		      }
		      else if ((op & 64) === 0) {              /* 2nd level length code */
		        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
		        continue dolen;
		      }
		      else if (op & 32) {                     /* end-of-block */
		        //Tracevv((stderr, "inflate:         end of block\n"));
		        state.mode = TYPE;
		        break top;
		      }
		      else {
		        strm.msg = 'invalid literal/length code';
		        state.mode = BAD;
		        break top;
		      }

		      break; // need to emulate goto via "continue"
		    }
		  } while (_in < last && _out < end);

		  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
		  len = bits >> 3;
		  _in -= len;
		  bits -= len << 3;
		  hold &= (1 << bits) - 1;

		  /* update state and return */
		  strm.next_in = _in;
		  strm.next_out = _out;
		  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
		  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
		  state.hold = hold;
		  state.bits = bits;
		  return;
		};


	/***/ },
	/* 697 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';


		var utils         = __webpack_require__(126);
		var adler32       = __webpack_require__(265);
		var crc32         = __webpack_require__(266);
		var inflate_fast  = __webpack_require__(696);
		var inflate_table = __webpack_require__(698);

		var CODES = 0;
		var LENS = 1;
		var DISTS = 2;

		/* Public constants ==========================================================*/
		/* ===========================================================================*/


		/* Allowed flush values; see deflate() and inflate() below for details */
		//var Z_NO_FLUSH      = 0;
		//var Z_PARTIAL_FLUSH = 1;
		//var Z_SYNC_FLUSH    = 2;
		//var Z_FULL_FLUSH    = 3;
		var Z_FINISH        = 4;
		var Z_BLOCK         = 5;
		var Z_TREES         = 6;


		/* Return codes for the compression/decompression functions. Negative values
		 * are errors, positive values are used for special but normal events.
		 */
		var Z_OK            = 0;
		var Z_STREAM_END    = 1;
		var Z_NEED_DICT     = 2;
		//var Z_ERRNO         = -1;
		var Z_STREAM_ERROR  = -2;
		var Z_DATA_ERROR    = -3;
		var Z_MEM_ERROR     = -4;
		var Z_BUF_ERROR     = -5;
		//var Z_VERSION_ERROR = -6;

		/* The deflate compression method */
		var Z_DEFLATED  = 8;


		/* STATES ====================================================================*/
		/* ===========================================================================*/


		var    HEAD = 1;       /* i: waiting for magic header */
		var    FLAGS = 2;      /* i: waiting for method and flags (gzip) */
		var    TIME = 3;       /* i: waiting for modification time (gzip) */
		var    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */
		var    EXLEN = 5;      /* i: waiting for extra length (gzip) */
		var    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */
		var    NAME = 7;       /* i: waiting for end of file name (gzip) */
		var    COMMENT = 8;    /* i: waiting for end of comment (gzip) */
		var    HCRC = 9;       /* i: waiting for header crc (gzip) */
		var    DICTID = 10;    /* i: waiting for dictionary check value */
		var    DICT = 11;      /* waiting for inflateSetDictionary() call */
		var        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */
		var        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */
		var        STORED = 14;    /* i: waiting for stored size (length and complement) */
		var        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */
		var        COPY = 16;      /* i/o: waiting for input or output to copy stored block */
		var        TABLE = 17;     /* i: waiting for dynamic block table lengths */
		var        LENLENS = 18;   /* i: waiting for code length code lengths */
		var        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */
		var            LEN_ = 20;      /* i: same as LEN below, but only first time in */
		var            LEN = 21;       /* i: waiting for length/lit/eob code */
		var            LENEXT = 22;    /* i: waiting for length extra bits */
		var            DIST = 23;      /* i: waiting for distance code */
		var            DISTEXT = 24;   /* i: waiting for distance extra bits */
		var            MATCH = 25;     /* o: waiting for output space to copy string */
		var            LIT = 26;       /* o: waiting for output space to write literal */
		var    CHECK = 27;     /* i: waiting for 32-bit check value */
		var    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */
		var    DONE = 29;      /* finished check, done -- remain here until reset */
		var    BAD = 30;       /* got a data error -- remain here until reset */
		var    MEM = 31;       /* got an inflate() memory error -- remain here until reset */
		var    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */

		/* ===========================================================================*/



		var ENOUGH_LENS = 852;
		var ENOUGH_DISTS = 592;
		//var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);

		var MAX_WBITS = 15;
		/* 32K LZ77 window */
		var DEF_WBITS = MAX_WBITS;


		function zswap32(q) {
		  return  (((q >>> 24) & 0xff) +
		          ((q >>> 8) & 0xff00) +
		          ((q & 0xff00) << 8) +
		          ((q & 0xff) << 24));
		}


		function InflateState() {
		  this.mode = 0;             /* current inflate mode */
		  this.last = false;          /* true if processing last block */
		  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */
		  this.havedict = false;      /* true if dictionary provided */
		  this.flags = 0;             /* gzip header method and flags (0 if zlib) */
		  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */
		  this.check = 0;             /* protected copy of check value */
		  this.total = 0;             /* protected copy of output count */
		  // TODO: may be {}
		  this.head = null;           /* where to save gzip header information */

		  /* sliding window */
		  this.wbits = 0;             /* log base 2 of requested window size */
		  this.wsize = 0;             /* window size or zero if not using window */
		  this.whave = 0;             /* valid bytes in the window */
		  this.wnext = 0;             /* window write index */
		  this.window = null;         /* allocated sliding window, if needed */

		  /* bit accumulator */
		  this.hold = 0;              /* input bit accumulator */
		  this.bits = 0;              /* number of bits in "in" */

		  /* for string and stored block copying */
		  this.length = 0;            /* literal or length of data to copy */
		  this.offset = 0;            /* distance back to copy string from */

		  /* for table and code decoding */
		  this.extra = 0;             /* extra bits needed */

		  /* fixed and dynamic code tables */
		  this.lencode = null;          /* starting table for length/literal codes */
		  this.distcode = null;         /* starting table for distance codes */
		  this.lenbits = 0;           /* index bits for lencode */
		  this.distbits = 0;          /* index bits for distcode */

		  /* dynamic table building */
		  this.ncode = 0;             /* number of code length code lengths */
		  this.nlen = 0;              /* number of length code lengths */
		  this.ndist = 0;             /* number of distance code lengths */
		  this.have = 0;              /* number of code lengths in lens[] */
		  this.next = null;              /* next available space in codes[] */

		  this.lens = new utils.Buf16(320); /* temporary storage for code lengths */
		  this.work = new utils.Buf16(288); /* work area for code table building */

		  /*
		   because we don't have pointers in js, we use lencode and distcode directly
		   as buffers so we don't need codes
		  */
		  //this.codes = new utils.Buf32(ENOUGH);       /* space for code tables */
		  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */
		  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */
		  this.sane = 0;                   /* if false, allow invalid distance too far */
		  this.back = 0;                   /* bits back of last unprocessed length/lit */
		  this.was = 0;                    /* initial length of match */
		}

		function inflateResetKeep(strm) {
		  var state;

		  if (!strm || !strm.state) { return Z_STREAM_ERROR; }
		  state = strm.state;
		  strm.total_in = strm.total_out = state.total = 0;
		  strm.msg = ''; /*Z_NULL*/
		  if (state.wrap) {       /* to support ill-conceived Java test suite */
		    strm.adler = state.wrap & 1;
		  }
		  state.mode = HEAD;
		  state.last = 0;
		  state.havedict = 0;
		  state.dmax = 32768;
		  state.head = null/*Z_NULL*/;
		  state.hold = 0;
		  state.bits = 0;
		  //state.lencode = state.distcode = state.next = state.codes;
		  state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);
		  state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);

		  state.sane = 1;
		  state.back = -1;
		  //Tracev((stderr, "inflate: reset\n"));
		  return Z_OK;
		}

		function inflateReset(strm) {
		  var state;

		  if (!strm || !strm.state) { return Z_STREAM_ERROR; }
		  state = strm.state;
		  state.wsize = 0;
		  state.whave = 0;
		  state.wnext = 0;
		  return inflateResetKeep(strm);

		}

		function inflateReset2(strm, windowBits) {
		  var wrap;
		  var state;

		  /* get the state */
		  if (!strm || !strm.state) { return Z_STREAM_ERROR; }
		  state = strm.state;

		  /* extract wrap request from windowBits parameter */
		  if (windowBits < 0) {
		    wrap = 0;
		    windowBits = -windowBits;
		  }
		  else {
		    wrap = (windowBits >> 4) + 1;
		    if (windowBits < 48) {
		      windowBits &= 15;
		    }
		  }

		  /* set number of window bits, free window if different */
		  if (windowBits && (windowBits < 8 || windowBits > 15)) {
		    return Z_STREAM_ERROR;
		  }
		  if (state.window !== null && state.wbits !== windowBits) {
		    state.window = null;
		  }

		  /* update state and reset the rest of it */
		  state.wrap = wrap;
		  state.wbits = windowBits;
		  return inflateReset(strm);
		}

		function inflateInit2(strm, windowBits) {
		  var ret;
		  var state;

		  if (!strm) { return Z_STREAM_ERROR; }
		  //strm.msg = Z_NULL;                 /* in case we return an error */

		  state = new InflateState();

		  //if (state === Z_NULL) return Z_MEM_ERROR;
		  //Tracev((stderr, "inflate: allocated\n"));
		  strm.state = state;
		  state.window = null/*Z_NULL*/;
		  ret = inflateReset2(strm, windowBits);
		  if (ret !== Z_OK) {
		    strm.state = null/*Z_NULL*/;
		  }
		  return ret;
		}

		function inflateInit(strm) {
		  return inflateInit2(strm, DEF_WBITS);
		}


		/*
		 Return state with length and distance decoding tables and index sizes set to
		 fixed code decoding.  Normally this returns fixed tables from inffixed.h.
		 If BUILDFIXED is defined, then instead this routine builds the tables the
		 first time it's called, and returns those tables the first time and
		 thereafter.  This reduces the size of the code by about 2K bytes, in
		 exchange for a little execution time.  However, BUILDFIXED should not be
		 used for threaded applications, since the rewriting of the tables and virgin
		 may not be thread-safe.
		 */
		var virgin = true;

		var lenfix, distfix; // We have no pointers in JS, so keep tables separate

		function fixedtables(state) {
		  /* build fixed huffman tables if first call (may not be thread safe) */
		  if (virgin) {
		    var sym;

		    lenfix = new utils.Buf32(512);
		    distfix = new utils.Buf32(32);

		    /* literal/length table */
		    sym = 0;
		    while (sym < 144) { state.lens[sym++] = 8; }
		    while (sym < 256) { state.lens[sym++] = 9; }
		    while (sym < 280) { state.lens[sym++] = 7; }
		    while (sym < 288) { state.lens[sym++] = 8; }

		    inflate_table(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });

		    /* distance table */
		    sym = 0;
		    while (sym < 32) { state.lens[sym++] = 5; }

		    inflate_table(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });

		    /* do this just once */
		    virgin = false;
		  }

		  state.lencode = lenfix;
		  state.lenbits = 9;
		  state.distcode = distfix;
		  state.distbits = 5;
		}


		/*
		 Update the window with the last wsize (normally 32K) bytes written before
		 returning.  If window does not exist yet, create it.  This is only called
		 when a window is already in use, or when output has been written during this
		 inflate call, but the end of the deflate stream has not been reached yet.
		 It is also called to create a window for dictionary data when a dictionary
		 is loaded.

		 Providing output buffers larger than 32K to inflate() should provide a speed
		 advantage, since only the last 32K of output is copied to the sliding window
		 upon return from inflate(), and since all distances after the first 32K of
		 output will fall in the output data, making match copies simpler and faster.
		 The advantage may be dependent on the size of the processor's data caches.
		 */
		function updatewindow(strm, src, end, copy) {
		  var dist;
		  var state = strm.state;

		  /* if it hasn't been done already, allocate space for the window */
		  if (state.window === null) {
		    state.wsize = 1 << state.wbits;
		    state.wnext = 0;
		    state.whave = 0;

		    state.window = new utils.Buf8(state.wsize);
		  }

		  /* copy state->wsize or less output bytes into the circular window */
		  if (copy >= state.wsize) {
		    utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);
		    state.wnext = 0;
		    state.whave = state.wsize;
		  }
		  else {
		    dist = state.wsize - state.wnext;
		    if (dist > copy) {
		      dist = copy;
		    }
		    //zmemcpy(state->window + state->wnext, end - copy, dist);
		    utils.arraySet(state.window, src, end - copy, dist, state.wnext);
		    copy -= dist;
		    if (copy) {
		      //zmemcpy(state->window, end - copy, copy);
		      utils.arraySet(state.window, src, end - copy, copy, 0);
		      state.wnext = copy;
		      state.whave = state.wsize;
		    }
		    else {
		      state.wnext += dist;
		      if (state.wnext === state.wsize) { state.wnext = 0; }
		      if (state.whave < state.wsize) { state.whave += dist; }
		    }
		  }
		  return 0;
		}

		function inflate(strm, flush) {
		  var state;
		  var input, output;          // input/output buffers
		  var next;                   /* next input INDEX */
		  var put;                    /* next output INDEX */
		  var have, left;             /* available input and output */
		  var hold;                   /* bit buffer */
		  var bits;                   /* bits in bit buffer */
		  var _in, _out;              /* save starting available input and output */
		  var copy;                   /* number of stored or match bytes to copy */
		  var from;                   /* where to copy match bytes from */
		  var from_source;
		  var here = 0;               /* current decoding table entry */
		  var here_bits, here_op, here_val; // paked "here" denormalized (JS specific)
		  //var last;                   /* parent table entry */
		  var last_bits, last_op, last_val; // paked "last" denormalized (JS specific)
		  var len;                    /* length to copy for repeats, bits to drop */
		  var ret;                    /* return code */
		  var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */
		  var opts;

		  var n; // temporary var for NEED_BITS

		  var order = /* permutation of code lengths */
		    [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];


		  if (!strm || !strm.state || !strm.output ||
		      (!strm.input && strm.avail_in !== 0)) {
		    return Z_STREAM_ERROR;
		  }

		  state = strm.state;
		  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */


		  //--- LOAD() ---
		  put = strm.next_out;
		  output = strm.output;
		  left = strm.avail_out;
		  next = strm.next_in;
		  input = strm.input;
		  have = strm.avail_in;
		  hold = state.hold;
		  bits = state.bits;
		  //---

		  _in = have;
		  _out = left;
		  ret = Z_OK;

		  inf_leave: // goto emulation
		  for (;;) {
		    switch (state.mode) {
		    case HEAD:
		      if (state.wrap === 0) {
		        state.mode = TYPEDO;
		        break;
		      }
		      //=== NEEDBITS(16);
		      while (bits < 16) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */
		        state.check = 0/*crc32(0L, Z_NULL, 0)*/;
		        //=== CRC2(state.check, hold);
		        hbuf[0] = hold & 0xff;
		        hbuf[1] = (hold >>> 8) & 0xff;
		        state.check = crc32(state.check, hbuf, 2, 0);
		        //===//

		        //=== INITBITS();
		        hold = 0;
		        bits = 0;
		        //===//
		        state.mode = FLAGS;
		        break;
		      }
		      state.flags = 0;           /* expect zlib header */
		      if (state.head) {
		        state.head.done = false;
		      }
		      if (!(state.wrap & 1) ||   /* check if zlib header allowed */
		        (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {
		        strm.msg = 'incorrect header check';
		        state.mode = BAD;
		        break;
		      }
		      if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {
		        strm.msg = 'unknown compression method';
		        state.mode = BAD;
		        break;
		      }
		      //--- DROPBITS(4) ---//
		      hold >>>= 4;
		      bits -= 4;
		      //---//
		      len = (hold & 0x0f)/*BITS(4)*/ + 8;
		      if (state.wbits === 0) {
		        state.wbits = len;
		      }
		      else if (len > state.wbits) {
		        strm.msg = 'invalid window size';
		        state.mode = BAD;
		        break;
		      }
		      state.dmax = 1 << len;
		      //Tracev((stderr, "inflate:   zlib header ok\n"));
		      strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
		      state.mode = hold & 0x200 ? DICTID : TYPE;
		      //=== INITBITS();
		      hold = 0;
		      bits = 0;
		      //===//
		      break;
		    case FLAGS:
		      //=== NEEDBITS(16); */
		      while (bits < 16) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      state.flags = hold;
		      if ((state.flags & 0xff) !== Z_DEFLATED) {
		        strm.msg = 'unknown compression method';
		        state.mode = BAD;
		        break;
		      }
		      if (state.flags & 0xe000) {
		        strm.msg = 'unknown header flags set';
		        state.mode = BAD;
		        break;
		      }
		      if (state.head) {
		        state.head.text = ((hold >> 8) & 1);
		      }
		      if (state.flags & 0x0200) {
		        //=== CRC2(state.check, hold);
		        hbuf[0] = hold & 0xff;
		        hbuf[1] = (hold >>> 8) & 0xff;
		        state.check = crc32(state.check, hbuf, 2, 0);
		        //===//
		      }
		      //=== INITBITS();
		      hold = 0;
		      bits = 0;
		      //===//
		      state.mode = TIME;
		      /* falls through */
		    case TIME:
		      //=== NEEDBITS(32); */
		      while (bits < 32) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      if (state.head) {
		        state.head.time = hold;
		      }
		      if (state.flags & 0x0200) {
		        //=== CRC4(state.check, hold)
		        hbuf[0] = hold & 0xff;
		        hbuf[1] = (hold >>> 8) & 0xff;
		        hbuf[2] = (hold >>> 16) & 0xff;
		        hbuf[3] = (hold >>> 24) & 0xff;
		        state.check = crc32(state.check, hbuf, 4, 0);
		        //===
		      }
		      //=== INITBITS();
		      hold = 0;
		      bits = 0;
		      //===//
		      state.mode = OS;
		      /* falls through */
		    case OS:
		      //=== NEEDBITS(16); */
		      while (bits < 16) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      if (state.head) {
		        state.head.xflags = (hold & 0xff);
		        state.head.os = (hold >> 8);
		      }
		      if (state.flags & 0x0200) {
		        //=== CRC2(state.check, hold);
		        hbuf[0] = hold & 0xff;
		        hbuf[1] = (hold >>> 8) & 0xff;
		        state.check = crc32(state.check, hbuf, 2, 0);
		        //===//
		      }
		      //=== INITBITS();
		      hold = 0;
		      bits = 0;
		      //===//
		      state.mode = EXLEN;
		      /* falls through */
		    case EXLEN:
		      if (state.flags & 0x0400) {
		        //=== NEEDBITS(16); */
		        while (bits < 16) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        state.length = hold;
		        if (state.head) {
		          state.head.extra_len = hold;
		        }
		        if (state.flags & 0x0200) {
		          //=== CRC2(state.check, hold);
		          hbuf[0] = hold & 0xff;
		          hbuf[1] = (hold >>> 8) & 0xff;
		          state.check = crc32(state.check, hbuf, 2, 0);
		          //===//
		        }
		        //=== INITBITS();
		        hold = 0;
		        bits = 0;
		        //===//
		      }
		      else if (state.head) {
		        state.head.extra = null/*Z_NULL*/;
		      }
		      state.mode = EXTRA;
		      /* falls through */
		    case EXTRA:
		      if (state.flags & 0x0400) {
		        copy = state.length;
		        if (copy > have) { copy = have; }
		        if (copy) {
		          if (state.head) {
		            len = state.head.extra_len - state.length;
		            if (!state.head.extra) {
		              // Use untyped array for more conveniend processing later
		              state.head.extra = new Array(state.head.extra_len);
		            }
		            utils.arraySet(
		              state.head.extra,
		              input,
		              next,
		              // extra field is limited to 65536 bytes
		              // - no need for additional size check
		              copy,
		              /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
		              len
		            );
		            //zmemcpy(state.head.extra + len, next,
		            //        len + copy > state.head.extra_max ?
		            //        state.head.extra_max - len : copy);
		          }
		          if (state.flags & 0x0200) {
		            state.check = crc32(state.check, input, copy, next);
		          }
		          have -= copy;
		          next += copy;
		          state.length -= copy;
		        }
		        if (state.length) { break inf_leave; }
		      }
		      state.length = 0;
		      state.mode = NAME;
		      /* falls through */
		    case NAME:
		      if (state.flags & 0x0800) {
		        if (have === 0) { break inf_leave; }
		        copy = 0;
		        do {
		          // TODO: 2 or 1 bytes?
		          len = input[next + copy++];
		          /* use constant limit because in js we should not preallocate memory */
		          if (state.head && len &&
		              (state.length < 65536 /*state.head.name_max*/)) {
		            state.head.name += String.fromCharCode(len);
		          }
		        } while (len && copy < have);

		        if (state.flags & 0x0200) {
		          state.check = crc32(state.check, input, copy, next);
		        }
		        have -= copy;
		        next += copy;
		        if (len) { break inf_leave; }
		      }
		      else if (state.head) {
		        state.head.name = null;
		      }
		      state.length = 0;
		      state.mode = COMMENT;
		      /* falls through */
		    case COMMENT:
		      if (state.flags & 0x1000) {
		        if (have === 0) { break inf_leave; }
		        copy = 0;
		        do {
		          len = input[next + copy++];
		          /* use constant limit because in js we should not preallocate memory */
		          if (state.head && len &&
		              (state.length < 65536 /*state.head.comm_max*/)) {
		            state.head.comment += String.fromCharCode(len);
		          }
		        } while (len && copy < have);
		        if (state.flags & 0x0200) {
		          state.check = crc32(state.check, input, copy, next);
		        }
		        have -= copy;
		        next += copy;
		        if (len) { break inf_leave; }
		      }
		      else if (state.head) {
		        state.head.comment = null;
		      }
		      state.mode = HCRC;
		      /* falls through */
		    case HCRC:
		      if (state.flags & 0x0200) {
		        //=== NEEDBITS(16); */
		        while (bits < 16) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        if (hold !== (state.check & 0xffff)) {
		          strm.msg = 'header crc mismatch';
		          state.mode = BAD;
		          break;
		        }
		        //=== INITBITS();
		        hold = 0;
		        bits = 0;
		        //===//
		      }
		      if (state.head) {
		        state.head.hcrc = ((state.flags >> 9) & 1);
		        state.head.done = true;
		      }
		      strm.adler = state.check = 0;
		      state.mode = TYPE;
		      break;
		    case DICTID:
		      //=== NEEDBITS(32); */
		      while (bits < 32) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      strm.adler = state.check = zswap32(hold);
		      //=== INITBITS();
		      hold = 0;
		      bits = 0;
		      //===//
		      state.mode = DICT;
		      /* falls through */
		    case DICT:
		      if (state.havedict === 0) {
		        //--- RESTORE() ---
		        strm.next_out = put;
		        strm.avail_out = left;
		        strm.next_in = next;
		        strm.avail_in = have;
		        state.hold = hold;
		        state.bits = bits;
		        //---
		        return Z_NEED_DICT;
		      }
		      strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
		      state.mode = TYPE;
		      /* falls through */
		    case TYPE:
		      if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }
		      /* falls through */
		    case TYPEDO:
		      if (state.last) {
		        //--- BYTEBITS() ---//
		        hold >>>= bits & 7;
		        bits -= bits & 7;
		        //---//
		        state.mode = CHECK;
		        break;
		      }
		      //=== NEEDBITS(3); */
		      while (bits < 3) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      state.last = (hold & 0x01)/*BITS(1)*/;
		      //--- DROPBITS(1) ---//
		      hold >>>= 1;
		      bits -= 1;
		      //---//

		      switch ((hold & 0x03)/*BITS(2)*/) {
		      case 0:                             /* stored block */
		        //Tracev((stderr, "inflate:     stored block%s\n",
		        //        state.last ? " (last)" : ""));
		        state.mode = STORED;
		        break;
		      case 1:                             /* fixed block */
		        fixedtables(state);
		        //Tracev((stderr, "inflate:     fixed codes block%s\n",
		        //        state.last ? " (last)" : ""));
		        state.mode = LEN_;             /* decode codes */
		        if (flush === Z_TREES) {
		          //--- DROPBITS(2) ---//
		          hold >>>= 2;
		          bits -= 2;
		          //---//
		          break inf_leave;
		        }
		        break;
		      case 2:                             /* dynamic block */
		        //Tracev((stderr, "inflate:     dynamic codes block%s\n",
		        //        state.last ? " (last)" : ""));
		        state.mode = TABLE;
		        break;
		      case 3:
		        strm.msg = 'invalid block type';
		        state.mode = BAD;
		      }
		      //--- DROPBITS(2) ---//
		      hold >>>= 2;
		      bits -= 2;
		      //---//
		      break;
		    case STORED:
		      //--- BYTEBITS() ---// /* go to byte boundary */
		      hold >>>= bits & 7;
		      bits -= bits & 7;
		      //---//
		      //=== NEEDBITS(32); */
		      while (bits < 32) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {
		        strm.msg = 'invalid stored block lengths';
		        state.mode = BAD;
		        break;
		      }
		      state.length = hold & 0xffff;
		      //Tracev((stderr, "inflate:       stored length %u\n",
		      //        state.length));
		      //=== INITBITS();
		      hold = 0;
		      bits = 0;
		      //===//
		      state.mode = COPY_;
		      if (flush === Z_TREES) { break inf_leave; }
		      /* falls through */
		    case COPY_:
		      state.mode = COPY;
		      /* falls through */
		    case COPY:
		      copy = state.length;
		      if (copy) {
		        if (copy > have) { copy = have; }
		        if (copy > left) { copy = left; }
		        if (copy === 0) { break inf_leave; }
		        //--- zmemcpy(put, next, copy); ---
		        utils.arraySet(output, input, next, copy, put);
		        //---//
		        have -= copy;
		        next += copy;
		        left -= copy;
		        put += copy;
		        state.length -= copy;
		        break;
		      }
		      //Tracev((stderr, "inflate:       stored end\n"));
		      state.mode = TYPE;
		      break;
		    case TABLE:
		      //=== NEEDBITS(14); */
		      while (bits < 14) {
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		      }
		      //===//
		      state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;
		      //--- DROPBITS(5) ---//
		      hold >>>= 5;
		      bits -= 5;
		      //---//
		      state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;
		      //--- DROPBITS(5) ---//
		      hold >>>= 5;
		      bits -= 5;
		      //---//
		      state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;
		      //--- DROPBITS(4) ---//
		      hold >>>= 4;
		      bits -= 4;
		      //---//
		//#ifndef PKZIP_BUG_WORKAROUND
		      if (state.nlen > 286 || state.ndist > 30) {
		        strm.msg = 'too many length or distance symbols';
		        state.mode = BAD;
		        break;
		      }
		//#endif
		      //Tracev((stderr, "inflate:       table sizes ok\n"));
		      state.have = 0;
		      state.mode = LENLENS;
		      /* falls through */
		    case LENLENS:
		      while (state.have < state.ncode) {
		        //=== NEEDBITS(3);
		        while (bits < 3) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);
		        //--- DROPBITS(3) ---//
		        hold >>>= 3;
		        bits -= 3;
		        //---//
		      }
		      while (state.have < 19) {
		        state.lens[order[state.have++]] = 0;
		      }
		      // We have separate tables & no pointers. 2 commented lines below not needed.
		      //state.next = state.codes;
		      //state.lencode = state.next;
		      // Switch to use dynamic table
		      state.lencode = state.lendyn;
		      state.lenbits = 7;

		      opts = { bits: state.lenbits };
		      ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
		      state.lenbits = opts.bits;

		      if (ret) {
		        strm.msg = 'invalid code lengths set';
		        state.mode = BAD;
		        break;
		      }
		      //Tracev((stderr, "inflate:       code lengths ok\n"));
		      state.have = 0;
		      state.mode = CODELENS;
		      /* falls through */
		    case CODELENS:
		      while (state.have < state.nlen + state.ndist) {
		        for (;;) {
		          here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/
		          here_bits = here >>> 24;
		          here_op = (here >>> 16) & 0xff;
		          here_val = here & 0xffff;

		          if ((here_bits) <= bits) { break; }
		          //--- PULLBYTE() ---//
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		          //---//
		        }
		        if (here_val < 16) {
		          //--- DROPBITS(here.bits) ---//
		          hold >>>= here_bits;
		          bits -= here_bits;
		          //---//
		          state.lens[state.have++] = here_val;
		        }
		        else {
		          if (here_val === 16) {
		            //=== NEEDBITS(here.bits + 2);
		            n = here_bits + 2;
		            while (bits < n) {
		              if (have === 0) { break inf_leave; }
		              have--;
		              hold += input[next++] << bits;
		              bits += 8;
		            }
		            //===//
		            //--- DROPBITS(here.bits) ---//
		            hold >>>= here_bits;
		            bits -= here_bits;
		            //---//
		            if (state.have === 0) {
		              strm.msg = 'invalid bit length repeat';
		              state.mode = BAD;
		              break;
		            }
		            len = state.lens[state.have - 1];
		            copy = 3 + (hold & 0x03);//BITS(2);
		            //--- DROPBITS(2) ---//
		            hold >>>= 2;
		            bits -= 2;
		            //---//
		          }
		          else if (here_val === 17) {
		            //=== NEEDBITS(here.bits + 3);
		            n = here_bits + 3;
		            while (bits < n) {
		              if (have === 0) { break inf_leave; }
		              have--;
		              hold += input[next++] << bits;
		              bits += 8;
		            }
		            //===//
		            //--- DROPBITS(here.bits) ---//
		            hold >>>= here_bits;
		            bits -= here_bits;
		            //---//
		            len = 0;
		            copy = 3 + (hold & 0x07);//BITS(3);
		            //--- DROPBITS(3) ---//
		            hold >>>= 3;
		            bits -= 3;
		            //---//
		          }
		          else {
		            //=== NEEDBITS(here.bits + 7);
		            n = here_bits + 7;
		            while (bits < n) {
		              if (have === 0) { break inf_leave; }
		              have--;
		              hold += input[next++] << bits;
		              bits += 8;
		            }
		            //===//
		            //--- DROPBITS(here.bits) ---//
		            hold >>>= here_bits;
		            bits -= here_bits;
		            //---//
		            len = 0;
		            copy = 11 + (hold & 0x7f);//BITS(7);
		            //--- DROPBITS(7) ---//
		            hold >>>= 7;
		            bits -= 7;
		            //---//
		          }
		          if (state.have + copy > state.nlen + state.ndist) {
		            strm.msg = 'invalid bit length repeat';
		            state.mode = BAD;
		            break;
		          }
		          while (copy--) {
		            state.lens[state.have++] = len;
		          }
		        }
		      }

		      /* handle error breaks in while */
		      if (state.mode === BAD) { break; }

		      /* check for end-of-block code (better have one) */
		      if (state.lens[256] === 0) {
		        strm.msg = 'invalid code -- missing end-of-block';
		        state.mode = BAD;
		        break;
		      }

		      /* build code tables -- note: do not change the lenbits or distbits
		         values here (9 and 6) without reading the comments in inftrees.h
		         concerning the ENOUGH constants, which depend on those values */
		      state.lenbits = 9;

		      opts = { bits: state.lenbits };
		      ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
		      // We have separate tables & no pointers. 2 commented lines below not needed.
		      // state.next_index = opts.table_index;
		      state.lenbits = opts.bits;
		      // state.lencode = state.next;

		      if (ret) {
		        strm.msg = 'invalid literal/lengths set';
		        state.mode = BAD;
		        break;
		      }

		      state.distbits = 6;
		      //state.distcode.copy(state.codes);
		      // Switch to use dynamic table
		      state.distcode = state.distdyn;
		      opts = { bits: state.distbits };
		      ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
		      // We have separate tables & no pointers. 2 commented lines below not needed.
		      // state.next_index = opts.table_index;
		      state.distbits = opts.bits;
		      // state.distcode = state.next;

		      if (ret) {
		        strm.msg = 'invalid distances set';
		        state.mode = BAD;
		        break;
		      }
		      //Tracev((stderr, 'inflate:       codes ok\n'));
		      state.mode = LEN_;
		      if (flush === Z_TREES) { break inf_leave; }
		      /* falls through */
		    case LEN_:
		      state.mode = LEN;
		      /* falls through */
		    case LEN:
		      if (have >= 6 && left >= 258) {
		        //--- RESTORE() ---
		        strm.next_out = put;
		        strm.avail_out = left;
		        strm.next_in = next;
		        strm.avail_in = have;
		        state.hold = hold;
		        state.bits = bits;
		        //---
		        inflate_fast(strm, _out);
		        //--- LOAD() ---
		        put = strm.next_out;
		        output = strm.output;
		        left = strm.avail_out;
		        next = strm.next_in;
		        input = strm.input;
		        have = strm.avail_in;
		        hold = state.hold;
		        bits = state.bits;
		        //---

		        if (state.mode === TYPE) {
		          state.back = -1;
		        }
		        break;
		      }
		      state.back = 0;
		      for (;;) {
		        here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/
		        here_bits = here >>> 24;
		        here_op = (here >>> 16) & 0xff;
		        here_val = here & 0xffff;

		        if (here_bits <= bits) { break; }
		        //--- PULLBYTE() ---//
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		        //---//
		      }
		      if (here_op && (here_op & 0xf0) === 0) {
		        last_bits = here_bits;
		        last_op = here_op;
		        last_val = here_val;
		        for (;;) {
		          here = state.lencode[last_val +
		                  ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];
		          here_bits = here >>> 24;
		          here_op = (here >>> 16) & 0xff;
		          here_val = here & 0xffff;

		          if ((last_bits + here_bits) <= bits) { break; }
		          //--- PULLBYTE() ---//
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		          //---//
		        }
		        //--- DROPBITS(last.bits) ---//
		        hold >>>= last_bits;
		        bits -= last_bits;
		        //---//
		        state.back += last_bits;
		      }
		      //--- DROPBITS(here.bits) ---//
		      hold >>>= here_bits;
		      bits -= here_bits;
		      //---//
		      state.back += here_bits;
		      state.length = here_val;
		      if (here_op === 0) {
		        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
		        //        "inflate:         literal '%c'\n" :
		        //        "inflate:         literal 0x%02x\n", here.val));
		        state.mode = LIT;
		        break;
		      }
		      if (here_op & 32) {
		        //Tracevv((stderr, "inflate:         end of block\n"));
		        state.back = -1;
		        state.mode = TYPE;
		        break;
		      }
		      if (here_op & 64) {
		        strm.msg = 'invalid literal/length code';
		        state.mode = BAD;
		        break;
		      }
		      state.extra = here_op & 15;
		      state.mode = LENEXT;
		      /* falls through */
		    case LENEXT:
		      if (state.extra) {
		        //=== NEEDBITS(state.extra);
		        n = state.extra;
		        while (bits < n) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;
		        //--- DROPBITS(state.extra) ---//
		        hold >>>= state.extra;
		        bits -= state.extra;
		        //---//
		        state.back += state.extra;
		      }
		      //Tracevv((stderr, "inflate:         length %u\n", state.length));
		      state.was = state.length;
		      state.mode = DIST;
		      /* falls through */
		    case DIST:
		      for (;;) {
		        here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/
		        here_bits = here >>> 24;
		        here_op = (here >>> 16) & 0xff;
		        here_val = here & 0xffff;

		        if ((here_bits) <= bits) { break; }
		        //--- PULLBYTE() ---//
		        if (have === 0) { break inf_leave; }
		        have--;
		        hold += input[next++] << bits;
		        bits += 8;
		        //---//
		      }
		      if ((here_op & 0xf0) === 0) {
		        last_bits = here_bits;
		        last_op = here_op;
		        last_val = here_val;
		        for (;;) {
		          here = state.distcode[last_val +
		                  ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];
		          here_bits = here >>> 24;
		          here_op = (here >>> 16) & 0xff;
		          here_val = here & 0xffff;

		          if ((last_bits + here_bits) <= bits) { break; }
		          //--- PULLBYTE() ---//
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		          //---//
		        }
		        //--- DROPBITS(last.bits) ---//
		        hold >>>= last_bits;
		        bits -= last_bits;
		        //---//
		        state.back += last_bits;
		      }
		      //--- DROPBITS(here.bits) ---//
		      hold >>>= here_bits;
		      bits -= here_bits;
		      //---//
		      state.back += here_bits;
		      if (here_op & 64) {
		        strm.msg = 'invalid distance code';
		        state.mode = BAD;
		        break;
		      }
		      state.offset = here_val;
		      state.extra = (here_op) & 15;
		      state.mode = DISTEXT;
		      /* falls through */
		    case DISTEXT:
		      if (state.extra) {
		        //=== NEEDBITS(state.extra);
		        n = state.extra;
		        while (bits < n) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;
		        //--- DROPBITS(state.extra) ---//
		        hold >>>= state.extra;
		        bits -= state.extra;
		        //---//
		        state.back += state.extra;
		      }
		//#ifdef INFLATE_STRICT
		      if (state.offset > state.dmax) {
		        strm.msg = 'invalid distance too far back';
		        state.mode = BAD;
		        break;
		      }
		//#endif
		      //Tracevv((stderr, "inflate:         distance %u\n", state.offset));
		      state.mode = MATCH;
		      /* falls through */
		    case MATCH:
		      if (left === 0) { break inf_leave; }
		      copy = _out - left;
		      if (state.offset > copy) {         /* copy from window */
		        copy = state.offset - copy;
		        if (copy > state.whave) {
		          if (state.sane) {
		            strm.msg = 'invalid distance too far back';
		            state.mode = BAD;
		            break;
		          }
		// (!) This block is disabled in zlib defailts,
		// don't enable it for binary compatibility
		//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
		//          Trace((stderr, "inflate.c too far\n"));
		//          copy -= state.whave;
		//          if (copy > state.length) { copy = state.length; }
		//          if (copy > left) { copy = left; }
		//          left -= copy;
		//          state.length -= copy;
		//          do {
		//            output[put++] = 0;
		//          } while (--copy);
		//          if (state.length === 0) { state.mode = LEN; }
		//          break;
		//#endif
		        }
		        if (copy > state.wnext) {
		          copy -= state.wnext;
		          from = state.wsize - copy;
		        }
		        else {
		          from = state.wnext - copy;
		        }
		        if (copy > state.length) { copy = state.length; }
		        from_source = state.window;
		      }
		      else {                              /* copy from output */
		        from_source = output;
		        from = put - state.offset;
		        copy = state.length;
		      }
		      if (copy > left) { copy = left; }
		      left -= copy;
		      state.length -= copy;
		      do {
		        output[put++] = from_source[from++];
		      } while (--copy);
		      if (state.length === 0) { state.mode = LEN; }
		      break;
		    case LIT:
		      if (left === 0) { break inf_leave; }
		      output[put++] = state.length;
		      left--;
		      state.mode = LEN;
		      break;
		    case CHECK:
		      if (state.wrap) {
		        //=== NEEDBITS(32);
		        while (bits < 32) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          // Use '|' insdead of '+' to make sure that result is signed
		          hold |= input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        _out -= left;
		        strm.total_out += _out;
		        state.total += _out;
		        if (_out) {
		          strm.adler = state.check =
		              /*UPDATE(state.check, put - _out, _out);*/
		              (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));

		        }
		        _out = left;
		        // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too
		        if ((state.flags ? hold : zswap32(hold)) !== state.check) {
		          strm.msg = 'incorrect data check';
		          state.mode = BAD;
		          break;
		        }
		        //=== INITBITS();
		        hold = 0;
		        bits = 0;
		        //===//
		        //Tracev((stderr, "inflate:   check matches trailer\n"));
		      }
		      state.mode = LENGTH;
		      /* falls through */
		    case LENGTH:
		      if (state.wrap && state.flags) {
		        //=== NEEDBITS(32);
		        while (bits < 32) {
		          if (have === 0) { break inf_leave; }
		          have--;
		          hold += input[next++] << bits;
		          bits += 8;
		        }
		        //===//
		        if (hold !== (state.total & 0xffffffff)) {
		          strm.msg = 'incorrect length check';
		          state.mode = BAD;
		          break;
		        }
		        //=== INITBITS();
		        hold = 0;
		        bits = 0;
		        //===//
		        //Tracev((stderr, "inflate:   length matches trailer\n"));
		      }
		      state.mode = DONE;
		      /* falls through */
		    case DONE:
		      ret = Z_STREAM_END;
		      break inf_leave;
		    case BAD:
		      ret = Z_DATA_ERROR;
		      break inf_leave;
		    case MEM:
		      return Z_MEM_ERROR;
		    case SYNC:
		      /* falls through */
		    default:
		      return Z_STREAM_ERROR;
		    }
		  }

		  // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave"

		  /*
		     Return from inflate(), updating the total counts and the check value.
		     If there was no progress during the inflate() call, return a buffer
		     error.  Call updatewindow() to create and/or update the window state.
		     Note: a memory error from inflate() is non-recoverable.
		   */

		  //--- RESTORE() ---
		  strm.next_out = put;
		  strm.avail_out = left;
		  strm.next_in = next;
		  strm.avail_in = have;
		  state.hold = hold;
		  state.bits = bits;
		  //---

		  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&
		                      (state.mode < CHECK || flush !== Z_FINISH))) {
		    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {
		      state.mode = MEM;
		      return Z_MEM_ERROR;
		    }
		  }
		  _in -= strm.avail_in;
		  _out -= strm.avail_out;
		  strm.total_in += _in;
		  strm.total_out += _out;
		  state.total += _out;
		  if (state.wrap && _out) {
		    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
		      (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));
		  }
		  strm.data_type = state.bits + (state.last ? 64 : 0) +
		                    (state.mode === TYPE ? 128 : 0) +
		                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
		  if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {
		    ret = Z_BUF_ERROR;
		  }
		  return ret;
		}

		function inflateEnd(strm) {

		  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {
		    return Z_STREAM_ERROR;
		  }

		  var state = strm.state;
		  if (state.window) {
		    state.window = null;
		  }
		  strm.state = null;
		  return Z_OK;
		}

		function inflateGetHeader(strm, head) {
		  var state;

		  /* check state */
		  if (!strm || !strm.state) { return Z_STREAM_ERROR; }
		  state = strm.state;
		  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }

		  /* save header structure */
		  state.head = head;
		  head.done = false;
		  return Z_OK;
		}

		function inflateSetDictionary(strm, dictionary) {
		  var dictLength = dictionary.length;

		  var state;
		  var dictid;
		  var ret;

		  /* check state */
		  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }
		  state = strm.state;

		  if (state.wrap !== 0 && state.mode !== DICT) {
		    return Z_STREAM_ERROR;
		  }

		  /* check for correct dictionary identifier */
		  if (state.mode === DICT) {
		    dictid = 1; /* adler32(0, null, 0)*/
		    /* dictid = adler32(dictid, dictionary, dictLength); */
		    dictid = adler32(dictid, dictionary, dictLength, 0);
		    if (dictid !== state.check) {
		      return Z_DATA_ERROR;
		    }
		  }
		  /* copy dictionary to window using updatewindow(), which will amend the
		   existing dictionary if appropriate */
		  ret = updatewindow(strm, dictionary, dictLength, dictLength);
		  if (ret) {
		    state.mode = MEM;
		    return Z_MEM_ERROR;
		  }
		  state.havedict = 1;
		  // Tracev((stderr, "inflate:   dictionary set\n"));
		  return Z_OK;
		}

		exports.inflateReset = inflateReset;
		exports.inflateReset2 = inflateReset2;
		exports.inflateResetKeep = inflateResetKeep;
		exports.inflateInit = inflateInit;
		exports.inflateInit2 = inflateInit2;
		exports.inflate = inflate;
		exports.inflateEnd = inflateEnd;
		exports.inflateGetHeader = inflateGetHeader;
		exports.inflateSetDictionary = inflateSetDictionary;
		exports.inflateInfo = 'pako inflate (from Nodeca project)';

		/* Not implemented
		exports.inflateCopy = inflateCopy;
		exports.inflateGetDictionary = inflateGetDictionary;
		exports.inflateMark = inflateMark;
		exports.inflatePrime = inflatePrime;
		exports.inflateSync = inflateSync;
		exports.inflateSyncPoint = inflateSyncPoint;
		exports.inflateUndermine = inflateUndermine;
		*/


	/***/ },
	/* 698 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';


		var utils = __webpack_require__(126);

		var MAXBITS = 15;
		var ENOUGH_LENS = 852;
		var ENOUGH_DISTS = 592;
		//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);

		var CODES = 0;
		var LENS = 1;
		var DISTS = 2;

		var lbase = [ /* Length codes 257..285 base */
		  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
		  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
		];

		var lext = [ /* Length codes 257..285 extra */
		  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
		  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
		];

		var dbase = [ /* Distance codes 0..29 base */
		  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
		  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
		  8193, 12289, 16385, 24577, 0, 0
		];

		var dext = [ /* Distance codes 0..29 extra */
		  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
		  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
		  28, 28, 29, 29, 64, 64
		];

		module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)
		{
		  var bits = opts.bits;
		      //here = opts.here; /* table entry for duplication */

		  var len = 0;               /* a code's length in bits */
		  var sym = 0;               /* index of code symbols */
		  var min = 0, max = 0;          /* minimum and maximum code lengths */
		  var root = 0;              /* number of index bits for root table */
		  var curr = 0;              /* number of index bits for current table */
		  var drop = 0;              /* code bits to drop for sub-table */
		  var left = 0;                   /* number of prefix codes available */
		  var used = 0;              /* code entries in table used */
		  var huff = 0;              /* Huffman code */
		  var incr;              /* for incrementing code, index */
		  var fill;              /* index for replicating entries */
		  var low;               /* low bits for current root entry */
		  var mask;              /* mask for low root bits */
		  var next;             /* next available space in table */
		  var base = null;     /* base value table to use */
		  var base_index = 0;
		//  var shoextra;    /* extra bits table to use */
		  var end;                    /* use base and extra for symbol > end */
		  var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */
		  var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */
		  var extra = null;
		  var extra_index = 0;

		  var here_bits, here_op, here_val;

		  /*
		   Process a set of code lengths to create a canonical Huffman code.  The
		   code lengths are lens[0..codes-1].  Each length corresponds to the
		   symbols 0..codes-1.  The Huffman code is generated by first sorting the
		   symbols by length from short to long, and retaining the symbol order
		   for codes with equal lengths.  Then the code starts with all zero bits
		   for the first code of the shortest length, and the codes are integer
		   increments for the same length, and zeros are appended as the length
		   increases.  For the deflate format, these bits are stored backwards
		   from their more natural integer increment ordering, and so when the
		   decoding tables are built in the large loop below, the integer codes
		   are incremented backwards.

		   This routine assumes, but does not check, that all of the entries in
		   lens[] are in the range 0..MAXBITS.  The caller must assure this.
		   1..MAXBITS is interpreted as that code length.  zero means that that
		   symbol does not occur in this code.

		   The codes are sorted by computing a count of codes for each length,
		   creating from that a table of starting indices for each length in the
		   sorted table, and then entering the symbols in order in the sorted
		   table.  The sorted table is work[], with that space being provided by
		   the caller.

		   The length counts are used for other purposes as well, i.e. finding
		   the minimum and maximum length codes, determining if there are any
		   codes at all, checking for a valid set of lengths, and looking ahead
		   at length counts to determine sub-table sizes when building the
		   decoding tables.
		   */

		  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
		  for (len = 0; len <= MAXBITS; len++) {
		    count[len] = 0;
		  }
		  for (sym = 0; sym < codes; sym++) {
		    count[lens[lens_index + sym]]++;
		  }

		  /* bound code lengths, force root to be within code lengths */
		  root = bits;
		  for (max = MAXBITS; max >= 1; max--) {
		    if (count[max] !== 0) { break; }
		  }
		  if (root > max) {
		    root = max;
		  }
		  if (max === 0) {                     /* no symbols to code at all */
		    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */
		    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;
		    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;
		    table[table_index++] = (1 << 24) | (64 << 16) | 0;


		    //table.op[opts.table_index] = 64;
		    //table.bits[opts.table_index] = 1;
		    //table.val[opts.table_index++] = 0;
		    table[table_index++] = (1 << 24) | (64 << 16) | 0;

		    opts.bits = 1;
		    return 0;     /* no symbols, but wait for decoding to report error */
		  }
		  for (min = 1; min < max; min++) {
		    if (count[min] !== 0) { break; }
		  }
		  if (root < min) {
		    root = min;
		  }

		  /* check for an over-subscribed or incomplete set of lengths */
		  left = 1;
		  for (len = 1; len <= MAXBITS; len++) {
		    left <<= 1;
		    left -= count[len];
		    if (left < 0) {
		      return -1;
		    }        /* over-subscribed */
		  }
		  if (left > 0 && (type === CODES || max !== 1)) {
		    return -1;                      /* incomplete set */
		  }

		  /* generate offsets into symbol table for each length for sorting */
		  offs[1] = 0;
		  for (len = 1; len < MAXBITS; len++) {
		    offs[len + 1] = offs[len] + count[len];
		  }

		  /* sort symbols by length, by symbol order within each length */
		  for (sym = 0; sym < codes; sym++) {
		    if (lens[lens_index + sym] !== 0) {
		      work[offs[lens[lens_index + sym]]++] = sym;
		    }
		  }

		  /*
		   Create and fill in decoding tables.  In this loop, the table being
		   filled is at next and has curr index bits.  The code being used is huff
		   with length len.  That code is converted to an index by dropping drop
		   bits off of the bottom.  For codes where len is less than drop + curr,
		   those top drop + curr - len bits are incremented through all values to
		   fill the table with replicated entries.

		   root is the number of index bits for the root table.  When len exceeds
		   root, sub-tables are created pointed to by the root entry with an index
		   of the low root bits of huff.  This is saved in low to check for when a
		   new sub-table should be started.  drop is zero when the root table is
		   being filled, and drop is root when sub-tables are being filled.

		   When a new sub-table is needed, it is necessary to look ahead in the
		   code lengths to determine what size sub-table is needed.  The length
		   counts are used for this, and so count[] is decremented as codes are
		   entered in the tables.

		   used keeps track of how many table entries have been allocated from the
		   provided *table space.  It is checked for LENS and DIST tables against
		   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
		   the initial root table size constants.  See the comments in inftrees.h
		   for more information.

		   sym increments through all symbols, and the loop terminates when
		   all codes of length max, i.e. all codes, have been processed.  This
		   routine permits incomplete codes, so another loop after this one fills
		   in the rest of the decoding tables with invalid code markers.
		   */

		  /* set up for code type */
		  // poor man optimization - use if-else instead of switch,
		  // to avoid deopts in old v8
		  if (type === CODES) {
		    base = extra = work;    /* dummy value--not used */
		    end = 19;

		  } else if (type === LENS) {
		    base = lbase;
		    base_index -= 257;
		    extra = lext;
		    extra_index -= 257;
		    end = 256;

		  } else {                    /* DISTS */
		    base = dbase;
		    extra = dext;
		    end = -1;
		  }

		  /* initialize opts for loop */
		  huff = 0;                   /* starting code */
		  sym = 0;                    /* starting code symbol */
		  len = min;                  /* starting code length */
		  next = table_index;              /* current table to fill in */
		  curr = root;                /* current table index bits */
		  drop = 0;                   /* current bits to drop from code for index */
		  low = -1;                   /* trigger new sub-table when len > root */
		  used = 1 << root;          /* use root table entries */
		  mask = used - 1;            /* mask for comparing low */

		  /* check available table space */
		  if ((type === LENS && used > ENOUGH_LENS) ||
		    (type === DISTS && used > ENOUGH_DISTS)) {
		    return 1;
		  }

		  var i = 0;
		  /* process all codes and make table entries */
		  for (;;) {
		    i++;
		    /* create table entry */
		    here_bits = len - drop;
		    if (work[sym] < end) {
		      here_op = 0;
		      here_val = work[sym];
		    }
		    else if (work[sym] > end) {
		      here_op = extra[extra_index + work[sym]];
		      here_val = base[base_index + work[sym]];
		    }
		    else {
		      here_op = 32 + 64;         /* end of block */
		      here_val = 0;
		    }

		    /* replicate for those indices with low len bits equal to huff */
		    incr = 1 << (len - drop);
		    fill = 1 << curr;
		    min = fill;                 /* save offset to next table */
		    do {
		      fill -= incr;
		      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;
		    } while (fill !== 0);

		    /* backwards increment the len-bit code huff */
		    incr = 1 << (len - 1);
		    while (huff & incr) {
		      incr >>= 1;
		    }
		    if (incr !== 0) {
		      huff &= incr - 1;
		      huff += incr;
		    } else {
		      huff = 0;
		    }

		    /* go to next symbol, update count, len */
		    sym++;
		    if (--count[len] === 0) {
		      if (len === max) { break; }
		      len = lens[lens_index + work[sym]];
		    }

		    /* create new sub-table if needed */
		    if (len > root && (huff & mask) !== low) {
		      /* if first time, transition to sub-tables */
		      if (drop === 0) {
		        drop = root;
		      }

		      /* increment past last table */
		      next += min;            /* here min is 1 << curr */

		      /* determine length of next table */
		      curr = len - drop;
		      left = 1 << curr;
		      while (curr + drop < max) {
		        left -= count[curr + drop];
		        if (left <= 0) { break; }
		        curr++;
		        left <<= 1;
		      }

		      /* check for enough space */
		      used += 1 << curr;
		      if ((type === LENS && used > ENOUGH_LENS) ||
		        (type === DISTS && used > ENOUGH_DISTS)) {
		        return 1;
		      }

		      /* point entry in root table to sub-table */
		      low = huff & mask;
		      /*table.op[low] = curr;
		      table.bits[low] = root;
		      table.val[low] = next - opts.table_index;*/
		      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;
		    }
		  }

		  /* fill in remaining table entry if code is incomplete (guaranteed to have
		   at most one remaining entry, since if the code is incomplete, the
		   maximum code length that was allowed to get this far is one bit) */
		  if (huff !== 0) {
		    //table.op[next + huff] = 64;            /* invalid code marker */
		    //table.bits[next + huff] = len - drop;
		    //table.val[next + huff] = 0;
		    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
		  }

		  /* set return parameters */
		  //opts.table_index += used;
		  opts.bits = root;
		  return 0;
		};


	/***/ },
	/* 699 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';

		module.exports = {
		  2:      'need dictionary',     /* Z_NEED_DICT       2  */
		  1:      'stream end',          /* Z_STREAM_END      1  */
		  0:      '',                    /* Z_OK              0  */
		  '-1':   'file error',          /* Z_ERRNO         (-1) */
		  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */
		  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */
		  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */
		  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */
		  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */
		};


	/***/ },
	/* 700 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';


		var utils = __webpack_require__(126);

		/* Public constants ==========================================================*/
		/* ===========================================================================*/


		//var Z_FILTERED          = 1;
		//var Z_HUFFMAN_ONLY      = 2;
		//var Z_RLE               = 3;
		var Z_FIXED               = 4;
		//var Z_DEFAULT_STRATEGY  = 0;

		/* Possible values of the data_type field (though see inflate()) */
		var Z_BINARY              = 0;
		var Z_TEXT                = 1;
		//var Z_ASCII             = 1; // = Z_TEXT
		var Z_UNKNOWN             = 2;

		/*============================================================================*/


		function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }

		// From zutil.h

		var STORED_BLOCK = 0;
		var STATIC_TREES = 1;
		var DYN_TREES    = 2;
		/* The three kinds of block type */

		var MIN_MATCH    = 3;
		var MAX_MATCH    = 258;
		/* The minimum and maximum match lengths */

		// From deflate.h
		/* ===========================================================================
		 * Internal compression state.
		 */

		var LENGTH_CODES  = 29;
		/* number of length codes, not counting the special END_BLOCK code */

		var LITERALS      = 256;
		/* number of literal bytes 0..255 */

		var L_CODES       = LITERALS + 1 + LENGTH_CODES;
		/* number of Literal or Length codes, including the END_BLOCK code */

		var D_CODES       = 30;
		/* number of distance codes */

		var BL_CODES      = 19;
		/* number of codes used to transfer the bit lengths */

		var HEAP_SIZE     = 2 * L_CODES + 1;
		/* maximum heap size */

		var MAX_BITS      = 15;
		/* All codes must not exceed MAX_BITS bits */

		var Buf_size      = 16;
		/* size of bit buffer in bi_buf */


		/* ===========================================================================
		 * Constants
		 */

		var MAX_BL_BITS = 7;
		/* Bit length codes must not exceed MAX_BL_BITS bits */

		var END_BLOCK   = 256;
		/* end of block literal code */

		var REP_3_6     = 16;
		/* repeat previous bit length 3-6 times (2 bits of repeat count) */

		var REPZ_3_10   = 17;
		/* repeat a zero length 3-10 times  (3 bits of repeat count) */

		var REPZ_11_138 = 18;
		/* repeat a zero length 11-138 times  (7 bits of repeat count) */

		/* eslint-disable comma-spacing,array-bracket-spacing */
		var extra_lbits =   /* extra bits for each length code */
		  [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];

		var extra_dbits =   /* extra bits for each distance code */
		  [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];

		var extra_blbits =  /* extra bits for each bit length code */
		  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];

		var bl_order =
		  [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];
		/* eslint-enable comma-spacing,array-bracket-spacing */

		/* The lengths of the bit length codes are sent in order of decreasing
		 * probability, to avoid transmitting the lengths for unused bit length codes.
		 */

		/* ===========================================================================
		 * Local data. These are initialized only once.
		 */

		// We pre-fill arrays with 0 to avoid uninitialized gaps

		var DIST_CODE_LEN = 512; /* see definition of array dist_code below */

		// !!!! Use flat array insdead of structure, Freq = i*2, Len = i*2+1
		var static_ltree  = new Array((L_CODES + 2) * 2);
		zero(static_ltree);
		/* The static literal tree. Since the bit lengths are imposed, there is no
		 * need for the L_CODES extra codes used during heap construction. However
		 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
		 * below).
		 */

		var static_dtree  = new Array(D_CODES * 2);
		zero(static_dtree);
		/* The static distance tree. (Actually a trivial tree since all codes use
		 * 5 bits.)
		 */

		var _dist_code    = new Array(DIST_CODE_LEN);
		zero(_dist_code);
		/* Distance codes. The first 256 values correspond to the distances
		 * 3 .. 258, the last 256 values correspond to the top 8 bits of
		 * the 15 bit distances.
		 */

		var _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);
		zero(_length_code);
		/* length code for each normalized match length (0 == MIN_MATCH) */

		var base_length   = new Array(LENGTH_CODES);
		zero(base_length);
		/* First normalized length for each code (0 = MIN_MATCH) */

		var base_dist     = new Array(D_CODES);
		zero(base_dist);
		/* First normalized distance for each code (0 = distance of 1) */


		function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {

		  this.static_tree  = static_tree;  /* static tree or NULL */
		  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */
		  this.extra_base   = extra_base;   /* base index for extra_bits */
		  this.elems        = elems;        /* max number of elements in the tree */
		  this.max_length   = max_length;   /* max bit length for the codes */

		  // show if `static_tree` has data or dummy - needed for monomorphic objects
		  this.has_stree    = static_tree && static_tree.length;
		}


		var static_l_desc;
		var static_d_desc;
		var static_bl_desc;


		function TreeDesc(dyn_tree, stat_desc) {
		  this.dyn_tree = dyn_tree;     /* the dynamic tree */
		  this.max_code = 0;            /* largest code with non zero frequency */
		  this.stat_desc = stat_desc;   /* the corresponding static tree */
		}



		function d_code(dist) {
		  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
		}


		/* ===========================================================================
		 * Output a short LSB first on the stream.
		 * IN assertion: there is enough room in pendingBuf.
		 */
		function put_short(s, w) {
		//    put_byte(s, (uch)((w) & 0xff));
		//    put_byte(s, (uch)((ush)(w) >> 8));
		  s.pending_buf[s.pending++] = (w) & 0xff;
		  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;
		}


		/* ===========================================================================
		 * Send a value on a given number of bits.
		 * IN assertion: length <= 16 and value fits in length bits.
		 */
		function send_bits(s, value, length) {
		  if (s.bi_valid > (Buf_size - length)) {
		    s.bi_buf |= (value << s.bi_valid) & 0xffff;
		    put_short(s, s.bi_buf);
		    s.bi_buf = value >> (Buf_size - s.bi_valid);
		    s.bi_valid += length - Buf_size;
		  } else {
		    s.bi_buf |= (value << s.bi_valid) & 0xffff;
		    s.bi_valid += length;
		  }
		}


		function send_code(s, c, tree) {
		  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);
		}


		/* ===========================================================================
		 * Reverse the first len bits of a code, using straightforward code (a faster
		 * method would use a table)
		 * IN assertion: 1 <= len <= 15
		 */
		function bi_reverse(code, len) {
		  var res = 0;
		  do {
		    res |= code & 1;
		    code >>>= 1;
		    res <<= 1;
		  } while (--len > 0);
		  return res >>> 1;
		}


		/* ===========================================================================
		 * Flush the bit buffer, keeping at most 7 bits in it.
		 */
		function bi_flush(s) {
		  if (s.bi_valid === 16) {
		    put_short(s, s.bi_buf);
		    s.bi_buf = 0;
		    s.bi_valid = 0;

		  } else if (s.bi_valid >= 8) {
		    s.pending_buf[s.pending++] = s.bi_buf & 0xff;
		    s.bi_buf >>= 8;
		    s.bi_valid -= 8;
		  }
		}


		/* ===========================================================================
		 * Compute the optimal bit lengths for a tree and update the total bit length
		 * for the current block.
		 * IN assertion: the fields freq and dad are set, heap[heap_max] and
		 *    above are the tree nodes sorted by increasing frequency.
		 * OUT assertions: the field len is set to the optimal bit length, the
		 *     array bl_count contains the frequencies for each bit length.
		 *     The length opt_len is updated; static_len is also updated if stree is
		 *     not null.
		 */
		function gen_bitlen(s, desc)
		//    deflate_state *s;
		//    tree_desc *desc;    /* the tree descriptor */
		{
		  var tree            = desc.dyn_tree;
		  var max_code        = desc.max_code;
		  var stree           = desc.stat_desc.static_tree;
		  var has_stree       = desc.stat_desc.has_stree;
		  var extra           = desc.stat_desc.extra_bits;
		  var base            = desc.stat_desc.extra_base;
		  var max_length      = desc.stat_desc.max_length;
		  var h;              /* heap index */
		  var n, m;           /* iterate over the tree elements */
		  var bits;           /* bit length */
		  var xbits;          /* extra bits */
		  var f;              /* frequency */
		  var overflow = 0;   /* number of elements with bit length too large */

		  for (bits = 0; bits <= MAX_BITS; bits++) {
		    s.bl_count[bits] = 0;
		  }

		  /* In a first pass, compute the optimal bit lengths (which may
		   * overflow in the case of the bit length tree).
		   */
		  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */

		  for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {
		    n = s.heap[h];
		    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
		    if (bits > max_length) {
		      bits = max_length;
		      overflow++;
		    }
		    tree[n * 2 + 1]/*.Len*/ = bits;
		    /* We overwrite tree[n].Dad which is no longer needed */

		    if (n > max_code) { continue; } /* not a leaf node */

		    s.bl_count[bits]++;
		    xbits = 0;
		    if (n >= base) {
		      xbits = extra[n - base];
		    }
		    f = tree[n * 2]/*.Freq*/;
		    s.opt_len += f * (bits + xbits);
		    if (has_stree) {
		      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);
		    }
		  }
		  if (overflow === 0) { return; }

		  // Trace((stderr,"\nbit length overflow\n"));
		  /* This happens for example on obj2 and pic of the Calgary corpus */

		  /* Find the first bit length which could increase: */
		  do {
		    bits = max_length - 1;
		    while (s.bl_count[bits] === 0) { bits--; }
		    s.bl_count[bits]--;      /* move one leaf down the tree */
		    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
		    s.bl_count[max_length]--;
		    /* The brother of the overflow item also moves one step up,
		     * but this does not affect bl_count[max_length]
		     */
		    overflow -= 2;
		  } while (overflow > 0);

		  /* Now recompute all bit lengths, scanning in increasing frequency.
		   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
		   * lengths instead of fixing only the wrong ones. This idea is taken
		   * from 'ar' written by Haruhiko Okumura.)
		   */
		  for (bits = max_length; bits !== 0; bits--) {
		    n = s.bl_count[bits];
		    while (n !== 0) {
		      m = s.heap[--h];
		      if (m > max_code) { continue; }
		      if (tree[m * 2 + 1]/*.Len*/ !== bits) {
		        // Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
		        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;
		        tree[m * 2 + 1]/*.Len*/ = bits;
		      }
		      n--;
		    }
		  }
		}


		/* ===========================================================================
		 * Generate the codes for a given tree and bit counts (which need not be
		 * optimal).
		 * IN assertion: the array bl_count contains the bit length statistics for
		 * the given tree and the field len is set for all tree elements.
		 * OUT assertion: the field code is set for all tree elements of non
		 *     zero code length.
		 */
		function gen_codes(tree, max_code, bl_count)
		//    ct_data *tree;             /* the tree to decorate */
		//    int max_code;              /* largest code with non zero frequency */
		//    ushf *bl_count;            /* number of codes at each bit length */
		{
		  var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */
		  var code = 0;              /* running code value */
		  var bits;                  /* bit index */
		  var n;                     /* code index */

		  /* The distribution counts are first used to generate the code values
		   * without bit reversal.
		   */
		  for (bits = 1; bits <= MAX_BITS; bits++) {
		    next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
		  }
		  /* Check that the bit counts in bl_count are consistent. The last code
		   * must be all ones.
		   */
		  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
		  //        "inconsistent bit counts");
		  //Tracev((stderr,"\ngen_codes: max_code %d ", max_code));

		  for (n = 0;  n <= max_code; n++) {
		    var len = tree[n * 2 + 1]/*.Len*/;
		    if (len === 0) { continue; }
		    /* Now reverse the bits */
		    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);

		    //Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
		    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
		  }
		}


		/* ===========================================================================
		 * Initialize the various 'constant' tables.
		 */
		function tr_static_init() {
		  var n;        /* iterates over tree elements */
		  var bits;     /* bit counter */
		  var length;   /* length value */
		  var code;     /* code value */
		  var dist;     /* distance index */
		  var bl_count = new Array(MAX_BITS + 1);
		  /* number of codes at each bit length for an optimal tree */

		  // do check in _tr_init()
		  //if (static_init_done) return;

		  /* For some embedded targets, global variables are not initialized: */
		/*#ifdef NO_INIT_GLOBAL_POINTERS
		  static_l_desc.static_tree = static_ltree;
		  static_l_desc.extra_bits = extra_lbits;
		  static_d_desc.static_tree = static_dtree;
		  static_d_desc.extra_bits = extra_dbits;
		  static_bl_desc.extra_bits = extra_blbits;
		#endif*/

		  /* Initialize the mapping length (0..255) -> length code (0..28) */
		  length = 0;
		  for (code = 0; code < LENGTH_CODES - 1; code++) {
		    base_length[code] = length;
		    for (n = 0; n < (1 << extra_lbits[code]); n++) {
		      _length_code[length++] = code;
		    }
		  }
		  //Assert (length == 256, "tr_static_init: length != 256");
		  /* Note that the length 255 (match length 258) can be represented
		   * in two different ways: code 284 + 5 bits or code 285, so we
		   * overwrite length_code[255] to use the best encoding:
		   */
		  _length_code[length - 1] = code;

		  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
		  dist = 0;
		  for (code = 0; code < 16; code++) {
		    base_dist[code] = dist;
		    for (n = 0; n < (1 << extra_dbits[code]); n++) {
		      _dist_code[dist++] = code;
		    }
		  }
		  //Assert (dist == 256, "tr_static_init: dist != 256");
		  dist >>= 7; /* from now on, all distances are divided by 128 */
		  for (; code < D_CODES; code++) {
		    base_dist[code] = dist << 7;
		    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
		      _dist_code[256 + dist++] = code;
		    }
		  }
		  //Assert (dist == 256, "tr_static_init: 256+dist != 512");

		  /* Construct the codes of the static literal tree */
		  for (bits = 0; bits <= MAX_BITS; bits++) {
		    bl_count[bits] = 0;
		  }

		  n = 0;
		  while (n <= 143) {
		    static_ltree[n * 2 + 1]/*.Len*/ = 8;
		    n++;
		    bl_count[8]++;
		  }
		  while (n <= 255) {
		    static_ltree[n * 2 + 1]/*.Len*/ = 9;
		    n++;
		    bl_count[9]++;
		  }
		  while (n <= 279) {
		    static_ltree[n * 2 + 1]/*.Len*/ = 7;
		    n++;
		    bl_count[7]++;
		  }
		  while (n <= 287) {
		    static_ltree[n * 2 + 1]/*.Len*/ = 8;
		    n++;
		    bl_count[8]++;
		  }
		  /* Codes 286 and 287 do not exist, but we must include them in the
		   * tree construction to get a canonical Huffman tree (longest code
		   * all ones)
		   */
		  gen_codes(static_ltree, L_CODES + 1, bl_count);

		  /* The static distance tree is trivial: */
		  for (n = 0; n < D_CODES; n++) {
		    static_dtree[n * 2 + 1]/*.Len*/ = 5;
		    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);
		  }

		  // Now data ready and we can init static trees
		  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);
		  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS);
		  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES, MAX_BL_BITS);

		  //static_init_done = true;
		}


		/* ===========================================================================
		 * Initialize a new block.
		 */
		function init_block(s) {
		  var n; /* iterates over tree elements */

		  /* Initialize the trees. */
		  for (n = 0; n < L_CODES;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }
		  for (n = 0; n < D_CODES;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }
		  for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }

		  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;
		  s.opt_len = s.static_len = 0;
		  s.last_lit = s.matches = 0;
		}


		/* ===========================================================================
		 * Flush the bit buffer and align the output on a byte boundary
		 */
		function bi_windup(s)
		{
		  if (s.bi_valid > 8) {
		    put_short(s, s.bi_buf);
		  } else if (s.bi_valid > 0) {
		    //put_byte(s, (Byte)s->bi_buf);
		    s.pending_buf[s.pending++] = s.bi_buf;
		  }
		  s.bi_buf = 0;
		  s.bi_valid = 0;
		}

		/* ===========================================================================
		 * Copy a stored block, storing first the length and its
		 * one's complement if requested.
		 */
		function copy_block(s, buf, len, header)
		//DeflateState *s;
		//charf    *buf;    /* the input data */
		//unsigned len;     /* its length */
		//int      header;  /* true if block header must be written */
		{
		  bi_windup(s);        /* align on byte boundary */

		  if (header) {
		    put_short(s, len);
		    put_short(s, ~len);
		  }
		//  while (len--) {
		//    put_byte(s, *buf++);
		//  }
		  utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
		  s.pending += len;
		}

		/* ===========================================================================
		 * Compares to subtrees, using the tree depth as tie breaker when
		 * the subtrees have equal frequency. This minimizes the worst case length.
		 */
		function smaller(tree, n, m, depth) {
		  var _n2 = n * 2;
		  var _m2 = m * 2;
		  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
		         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
		}

		/* ===========================================================================
		 * Restore the heap property by moving down the tree starting at node k,
		 * exchanging a node with the smallest of its two sons if necessary, stopping
		 * when the heap property is re-established (each father smaller than its
		 * two sons).
		 */
		function pqdownheap(s, tree, k)
		//    deflate_state *s;
		//    ct_data *tree;  /* the tree to restore */
		//    int k;               /* node to move down */
		{
		  var v = s.heap[k];
		  var j = k << 1;  /* left son of k */
		  while (j <= s.heap_len) {
		    /* Set j to the smallest of the two sons: */
		    if (j < s.heap_len &&
		      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
		      j++;
		    }
		    /* Exit if v is smaller than both sons */
		    if (smaller(tree, v, s.heap[j], s.depth)) { break; }

		    /* Exchange v with the smallest son */
		    s.heap[k] = s.heap[j];
		    k = j;

		    /* And continue down the tree, setting j to the left son of k */
		    j <<= 1;
		  }
		  s.heap[k] = v;
		}


		// inlined manually
		// var SMALLEST = 1;

		/* ===========================================================================
		 * Send the block data compressed using the given Huffman trees
		 */
		function compress_block(s, ltree, dtree)
		//    deflate_state *s;
		//    const ct_data *ltree; /* literal tree */
		//    const ct_data *dtree; /* distance tree */
		{
		  var dist;           /* distance of matched string */
		  var lc;             /* match length or unmatched char (if dist == 0) */
		  var lx = 0;         /* running index in l_buf */
		  var code;           /* the code to send */
		  var extra;          /* number of extra bits to send */

		  if (s.last_lit !== 0) {
		    do {
		      dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);
		      lc = s.pending_buf[s.l_buf + lx];
		      lx++;

		      if (dist === 0) {
		        send_code(s, lc, ltree); /* send a literal byte */
		        //Tracecv(isgraph(lc), (stderr," '%c' ", lc));
		      } else {
		        /* Here, lc is the match length - MIN_MATCH */
		        code = _length_code[lc];
		        send_code(s, code + LITERALS + 1, ltree); /* send the length code */
		        extra = extra_lbits[code];
		        if (extra !== 0) {
		          lc -= base_length[code];
		          send_bits(s, lc, extra);       /* send the extra length bits */
		        }
		        dist--; /* dist is now the match distance - 1 */
		        code = d_code(dist);
		        //Assert (code < D_CODES, "bad d_code");

		        send_code(s, code, dtree);       /* send the distance code */
		        extra = extra_dbits[code];
		        if (extra !== 0) {
		          dist -= base_dist[code];
		          send_bits(s, dist, extra);   /* send the extra distance bits */
		        }
		      } /* literal or match pair ? */

		      /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
		      //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
		      //       "pendingBuf overflow");

		    } while (lx < s.last_lit);
		  }

		  send_code(s, END_BLOCK, ltree);
		}


		/* ===========================================================================
		 * Construct one Huffman tree and assigns the code bit strings and lengths.
		 * Update the total bit length for the current block.
		 * IN assertion: the field freq is set for all tree elements.
		 * OUT assertions: the fields len and code are set to the optimal bit length
		 *     and corresponding code. The length opt_len is updated; static_len is
		 *     also updated if stree is not null. The field max_code is set.
		 */
		function build_tree(s, desc)
		//    deflate_state *s;
		//    tree_desc *desc; /* the tree descriptor */
		{
		  var tree     = desc.dyn_tree;
		  var stree    = desc.stat_desc.static_tree;
		  var has_stree = desc.stat_desc.has_stree;
		  var elems    = desc.stat_desc.elems;
		  var n, m;          /* iterate over heap elements */
		  var max_code = -1; /* largest code with non zero frequency */
		  var node;          /* new node being created */

		  /* Construct the initial heap, with least frequent element in
		   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
		   * heap[0] is not used.
		   */
		  s.heap_len = 0;
		  s.heap_max = HEAP_SIZE;

		  for (n = 0; n < elems; n++) {
		    if (tree[n * 2]/*.Freq*/ !== 0) {
		      s.heap[++s.heap_len] = max_code = n;
		      s.depth[n] = 0;

		    } else {
		      tree[n * 2 + 1]/*.Len*/ = 0;
		    }
		  }

		  /* The pkzip format requires that at least one distance code exists,
		   * and that at least one bit should be sent even if there is only one
		   * possible code. So to avoid special checks later on we force at least
		   * two codes of non zero frequency.
		   */
		  while (s.heap_len < 2) {
		    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
		    tree[node * 2]/*.Freq*/ = 1;
		    s.depth[node] = 0;
		    s.opt_len--;

		    if (has_stree) {
		      s.static_len -= stree[node * 2 + 1]/*.Len*/;
		    }
		    /* node is 0 or 1 so it does not have extra bits */
		  }
		  desc.max_code = max_code;

		  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
		   * establish sub-heaps of increasing lengths:
		   */
		  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }

		  /* Construct the Huffman tree by repeatedly combining the least two
		   * frequent nodes.
		   */
		  node = elems;              /* next internal node of the tree */
		  do {
		    //pqremove(s, tree, n);  /* n = node of least frequency */
		    /*** pqremove ***/
		    n = s.heap[1/*SMALLEST*/];
		    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];
		    pqdownheap(s, tree, 1/*SMALLEST*/);
		    /***/

		    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */

		    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
		    s.heap[--s.heap_max] = m;

		    /* Create a new node father of n and m */
		    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
		    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
		    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;

		    /* and insert the new node in the heap */
		    s.heap[1/*SMALLEST*/] = node++;
		    pqdownheap(s, tree, 1/*SMALLEST*/);

		  } while (s.heap_len >= 2);

		  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];

		  /* At this point, the fields freq and dad are set. We can now
		   * generate the bit lengths.
		   */
		  gen_bitlen(s, desc);

		  /* The field len is now set, we can generate the bit codes */
		  gen_codes(tree, max_code, s.bl_count);
		}


		/* ===========================================================================
		 * Scan a literal or distance tree to determine the frequencies of the codes
		 * in the bit length tree.
		 */
		function scan_tree(s, tree, max_code)
		//    deflate_state *s;
		//    ct_data *tree;   /* the tree to be scanned */
		//    int max_code;    /* and its largest code of non zero frequency */
		{
		  var n;                     /* iterates over all tree elements */
		  var prevlen = -1;          /* last emitted length */
		  var curlen;                /* length of current code */

		  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */

		  var count = 0;             /* repeat count of the current code */
		  var max_count = 7;         /* max repeat count */
		  var min_count = 4;         /* min repeat count */

		  if (nextlen === 0) {
		    max_count = 138;
		    min_count = 3;
		  }
		  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */

		  for (n = 0; n <= max_code; n++) {
		    curlen = nextlen;
		    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;

		    if (++count < max_count && curlen === nextlen) {
		      continue;

		    } else if (count < min_count) {
		      s.bl_tree[curlen * 2]/*.Freq*/ += count;

		    } else if (curlen !== 0) {

		      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }
		      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;

		    } else if (count <= 10) {
		      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;

		    } else {
		      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;
		    }

		    count = 0;
		    prevlen = curlen;

		    if (nextlen === 0) {
		      max_count = 138;
		      min_count = 3;

		    } else if (curlen === nextlen) {
		      max_count = 6;
		      min_count = 3;

		    } else {
		      max_count = 7;
		      min_count = 4;
		    }
		  }
		}


		/* ===========================================================================
		 * Send a literal or distance tree in compressed form, using the codes in
		 * bl_tree.
		 */
		function send_tree(s, tree, max_code)
		//    deflate_state *s;
		//    ct_data *tree; /* the tree to be scanned */
		//    int max_code;       /* and its largest code of non zero frequency */
		{
		  var n;                     /* iterates over all tree elements */
		  var prevlen = -1;          /* last emitted length */
		  var curlen;                /* length of current code */

		  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */

		  var count = 0;             /* repeat count of the current code */
		  var max_count = 7;         /* max repeat count */
		  var min_count = 4;         /* min repeat count */

		  /* tree[max_code+1].Len = -1; */  /* guard already set */
		  if (nextlen === 0) {
		    max_count = 138;
		    min_count = 3;
		  }

		  for (n = 0; n <= max_code; n++) {
		    curlen = nextlen;
		    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;

		    if (++count < max_count && curlen === nextlen) {
		      continue;

		    } else if (count < min_count) {
		      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);

		    } else if (curlen !== 0) {
		      if (curlen !== prevlen) {
		        send_code(s, curlen, s.bl_tree);
		        count--;
		      }
		      //Assert(count >= 3 && count <= 6, " 3_6?");
		      send_code(s, REP_3_6, s.bl_tree);
		      send_bits(s, count - 3, 2);

		    } else if (count <= 10) {
		      send_code(s, REPZ_3_10, s.bl_tree);
		      send_bits(s, count - 3, 3);

		    } else {
		      send_code(s, REPZ_11_138, s.bl_tree);
		      send_bits(s, count - 11, 7);
		    }

		    count = 0;
		    prevlen = curlen;
		    if (nextlen === 0) {
		      max_count = 138;
		      min_count = 3;

		    } else if (curlen === nextlen) {
		      max_count = 6;
		      min_count = 3;

		    } else {
		      max_count = 7;
		      min_count = 4;
		    }
		  }
		}


		/* ===========================================================================
		 * Construct the Huffman tree for the bit lengths and return the index in
		 * bl_order of the last bit length code to send.
		 */
		function build_bl_tree(s) {
		  var max_blindex;  /* index of last bit length code of non zero freq */

		  /* Determine the bit length frequencies for literal and distance trees */
		  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
		  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);

		  /* Build the bit length tree: */
		  build_tree(s, s.bl_desc);
		  /* opt_len now includes the length of the tree representations, except
		   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
		   */

		  /* Determine the number of bit length codes to send. The pkzip format
		   * requires that at least 4 bit length codes be sent. (appnote.txt says
		   * 3 but the actual value used is 4.)
		   */
		  for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
		    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {
		      break;
		    }
		  }
		  /* Update opt_len to include the bit length tree and counts */
		  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
		  //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
		  //        s->opt_len, s->static_len));

		  return max_blindex;
		}


		/* ===========================================================================
		 * Send the header for a block using dynamic Huffman trees: the counts, the
		 * lengths of the bit length codes, the literal tree and the distance tree.
		 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
		 */
		function send_all_trees(s, lcodes, dcodes, blcodes)
		//    deflate_state *s;
		//    int lcodes, dcodes, blcodes; /* number of codes for each tree */
		{
		  var rank;                    /* index in bl_order */

		  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
		  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
		  //        "too many codes");
		  //Tracev((stderr, "\nbl counts: "));
		  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */
		  send_bits(s, dcodes - 1,   5);
		  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */
		  for (rank = 0; rank < blcodes; rank++) {
		    //Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
		    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);
		  }
		  //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));

		  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */
		  //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));

		  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */
		  //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
		}


		/* ===========================================================================
		 * Check if the data type is TEXT or BINARY, using the following algorithm:
		 * - TEXT if the two conditions below are satisfied:
		 *    a) There are no non-portable control characters belonging to the
		 *       "black list" (0..6, 14..25, 28..31).
		 *    b) There is at least one printable character belonging to the
		 *       "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
		 * - BINARY otherwise.
		 * - The following partially-portable control characters form a
		 *   "gray list" that is ignored in this detection algorithm:
		 *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
		 * IN assertion: the fields Freq of dyn_ltree are set.
		 */
		function detect_data_type(s) {
		  /* black_mask is the bit mask of black-listed bytes
		   * set bits 0..6, 14..25, and 28..31
		   * 0xf3ffc07f = binary 11110011111111111100000001111111
		   */
		  var black_mask = 0xf3ffc07f;
		  var n;

		  /* Check for non-textual ("black-listed") bytes. */
		  for (n = 0; n <= 31; n++, black_mask >>>= 1) {
		    if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {
		      return Z_BINARY;
		    }
		  }

		  /* Check for textual ("white-listed") bytes. */
		  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||
		      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {
		    return Z_TEXT;
		  }
		  for (n = 32; n < LITERALS; n++) {
		    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {
		      return Z_TEXT;
		    }
		  }

		  /* There are no "black-listed" or "white-listed" bytes:
		   * this stream either is empty or has tolerated ("gray-listed") bytes only.
		   */
		  return Z_BINARY;
		}


		var static_init_done = false;

		/* ===========================================================================
		 * Initialize the tree data structures for a new zlib stream.
		 */
		function _tr_init(s)
		{

		  if (!static_init_done) {
		    tr_static_init();
		    static_init_done = true;
		  }

		  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);
		  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);
		  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);

		  s.bi_buf = 0;
		  s.bi_valid = 0;

		  /* Initialize the first block of the first file: */
		  init_block(s);
		}


		/* ===========================================================================
		 * Send a stored block
		 */
		function _tr_stored_block(s, buf, stored_len, last)
		//DeflateState *s;
		//charf *buf;       /* input block */
		//ulg stored_len;   /* length of input block */
		//int last;         /* one if this is the last block for a file */
		{
		  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */
		  copy_block(s, buf, stored_len, true); /* with header */
		}


		/* ===========================================================================
		 * Send one empty static block to give enough lookahead for inflate.
		 * This takes 10 bits, of which 7 may remain in the bit buffer.
		 */
		function _tr_align(s) {
		  send_bits(s, STATIC_TREES << 1, 3);
		  send_code(s, END_BLOCK, static_ltree);
		  bi_flush(s);
		}


		/* ===========================================================================
		 * Determine the best encoding for the current block: dynamic trees, static
		 * trees or store, and output the encoded block to the zip file.
		 */
		function _tr_flush_block(s, buf, stored_len, last)
		//DeflateState *s;
		//charf *buf;       /* input block, or NULL if too old */
		//ulg stored_len;   /* length of input block */
		//int last;         /* one if this is the last block for a file */
		{
		  var opt_lenb, static_lenb;  /* opt_len and static_len in bytes */
		  var max_blindex = 0;        /* index of last bit length code of non zero freq */

		  /* Build the Huffman trees unless a stored block is forced */
		  if (s.level > 0) {

		    /* Check if the file is binary or text */
		    if (s.strm.data_type === Z_UNKNOWN) {
		      s.strm.data_type = detect_data_type(s);
		    }

		    /* Construct the literal and distance trees */
		    build_tree(s, s.l_desc);
		    // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
		    //        s->static_len));

		    build_tree(s, s.d_desc);
		    // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
		    //        s->static_len));
		    /* At this point, opt_len and static_len are the total bit lengths of
		     * the compressed block data, excluding the tree representations.
		     */

		    /* Build the bit length tree for the above two trees, and get the index
		     * in bl_order of the last bit length code to send.
		     */
		    max_blindex = build_bl_tree(s);

		    /* Determine the best encoding. Compute the block lengths in bytes. */
		    opt_lenb = (s.opt_len + 3 + 7) >>> 3;
		    static_lenb = (s.static_len + 3 + 7) >>> 3;

		    // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
		    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
		    //        s->last_lit));

		    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }

		  } else {
		    // Assert(buf != (char*)0, "lost buf");
		    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
		  }

		  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {
		    /* 4: two words for the lengths */

		    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
		     * Otherwise we can't have processed more than WSIZE input bytes since
		     * the last block flush, because compression would have been
		     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
		     * transform a block into a stored block.
		     */
		    _tr_stored_block(s, buf, stored_len, last);

		  } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {

		    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);
		    compress_block(s, static_ltree, static_dtree);

		  } else {
		    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);
		    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);
		    compress_block(s, s.dyn_ltree, s.dyn_dtree);
		  }
		  // Assert (s->compressed_len == s->bits_sent, "bad compressed size");
		  /* The above check is made mod 2^32, for files larger than 512 MB
		   * and uLong implemented on 32 bits.
		   */
		  init_block(s);

		  if (last) {
		    bi_windup(s);
		  }
		  // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
		  //       s->compressed_len-7*last));
		}

		/* ===========================================================================
		 * Save the match info and tally the frequency counts. Return true if
		 * the current block must be flushed.
		 */
		function _tr_tally(s, dist, lc)
		//    deflate_state *s;
		//    unsigned dist;  /* distance of matched string */
		//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */
		{
		  //var out_length, in_length, dcode;

		  s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;
		  s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;

		  s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;
		  s.last_lit++;

		  if (dist === 0) {
		    /* lc is the unmatched char */
		    s.dyn_ltree[lc * 2]/*.Freq*/++;
		  } else {
		    s.matches++;
		    /* Here, lc is the match length - MIN_MATCH */
		    dist--;             /* dist = match distance - 1 */
		    //Assert((ush)dist < (ush)MAX_DIST(s) &&
		    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
		    //       (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");

		    s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;
		    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;
		  }

		// (!) This block is disabled in zlib defailts,
		// don't enable it for binary compatibility

		//#ifdef TRUNCATE_BLOCK
		//  /* Try to guess if it is profitable to stop the current block here */
		//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {
		//    /* Compute an upper bound for the compressed length */
		//    out_length = s.last_lit*8;
		//    in_length = s.strstart - s.block_start;
		//
		//    for (dcode = 0; dcode < D_CODES; dcode++) {
		//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);
		//    }
		//    out_length >>>= 3;
		//    //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
		//    //       s->last_lit, in_length, out_length,
		//    //       100L - out_length*100L/in_length));
		//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {
		//      return true;
		//    }
		//  }
		//#endif

		  return (s.last_lit === s.lit_bufsize - 1);
		  /* We avoid equality with lit_bufsize because of wraparound at 64K
		   * on 16 bit machines and because stored blocks are restricted to
		   * 64K-1 bytes.
		   */
		}

		exports._tr_init  = _tr_init;
		exports._tr_stored_block = _tr_stored_block;
		exports._tr_flush_block  = _tr_flush_block;
		exports._tr_tally = _tr_tally;
		exports._tr_align = _tr_align;


	/***/ },
	/* 701 */
	/***/ function(module, exports) {

		"use strict";
		'use strict';


		function ZStream() {
		  /* next input byte */
		  this.input = null; // JS specific, because we have no pointers
		  this.next_in = 0;
		  /* number of bytes available at input */
		  this.avail_in = 0;
		  /* total number of input bytes read so far */
		  this.total_in = 0;
		  /* next output byte should be put there */
		  this.output = null; // JS specific, because we have no pointers
		  this.next_out = 0;
		  /* remaining free space at output */
		  this.avail_out = 0;
		  /* total number of bytes output so far */
		  this.total_out = 0;
		  /* last error message, NULL if no error */
		  this.msg = ''/*Z_NULL*/;
		  /* not visible by applications */
		  this.state = null;
		  /* best guess about the data type: binary or text */
		  this.data_type = 2/*Z_UNKNOWN*/;
		  /* adler32 value of the uncompressed data */
		  this.adler = 0;
		}

		module.exports = ZStream;


	/***/ },
	/* 702 */
	/***/ function(module, exports, __webpack_require__) {

		// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js
		// Fedor, you are amazing.

		var asn1 = __webpack_require__(94)

		var RSAPrivateKey = asn1.define('RSAPrivateKey', function () {
		  this.seq().obj(
		    this.key('version').int(),
		    this.key('modulus').int(),
		    this.key('publicExponent').int(),
		    this.key('privateExponent').int(),
		    this.key('prime1').int(),
		    this.key('prime2').int(),
		    this.key('exponent1').int(),
		    this.key('exponent2').int(),
		    this.key('coefficient').int()
		  )
		})
		exports.RSAPrivateKey = RSAPrivateKey

		var RSAPublicKey = asn1.define('RSAPublicKey', function () {
		  this.seq().obj(
		    this.key('modulus').int(),
		    this.key('publicExponent').int()
		  )
		})
		exports.RSAPublicKey = RSAPublicKey

		var PublicKey = asn1.define('SubjectPublicKeyInfo', function () {
		  this.seq().obj(
		    this.key('algorithm').use(AlgorithmIdentifier),
		    this.key('subjectPublicKey').bitstr()
		  )
		})
		exports.PublicKey = PublicKey

		var AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () {
		  this.seq().obj(
		    this.key('algorithm').objid(),
		    this.key('none').null_().optional(),
		    this.key('curve').objid().optional(),
		    this.key('params').seq().obj(
		      this.key('p').int(),
		      this.key('q').int(),
		      this.key('g').int()
		    ).optional()
		  )
		})

		var PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () {
		  this.seq().obj(
		    this.key('version').int(),
		    this.key('algorithm').use(AlgorithmIdentifier),
		    this.key('subjectPrivateKey').octstr()
		  )
		})
		exports.PrivateKey = PrivateKeyInfo
		var EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () {
		  this.seq().obj(
		    this.key('algorithm').seq().obj(
		      this.key('id').objid(),
		      this.key('decrypt').seq().obj(
		        this.key('kde').seq().obj(
		          this.key('id').objid(),
		          this.key('kdeparams').seq().obj(
		            this.key('salt').octstr(),
		            this.key('iters').int()
		          )
		        ),
		        this.key('cipher').seq().obj(
		          this.key('algo').objid(),
		          this.key('iv').octstr()
		        )
		      )
		    ),
		    this.key('subjectPrivateKey').octstr()
		  )
		})

		exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo

		var DSAPrivateKey = asn1.define('DSAPrivateKey', function () {
		  this.seq().obj(
		    this.key('version').int(),
		    this.key('p').int(),
		    this.key('q').int(),
		    this.key('g').int(),
		    this.key('pub_key').int(),
		    this.key('priv_key').int()
		  )
		})
		exports.DSAPrivateKey = DSAPrivateKey

		exports.DSAparam = asn1.define('DSAparam', function () {
		  this.int()
		})
		var ECPrivateKey = asn1.define('ECPrivateKey', function () {
		  this.seq().obj(
		    this.key('version').int(),
		    this.key('privateKey').octstr(),
		    this.key('parameters').optional().explicit(0).use(ECParameters),
		    this.key('publicKey').optional().explicit(1).bitstr()
		  )
		})
		exports.ECPrivateKey = ECPrivateKey
		var ECParameters = asn1.define('ECParameters', function () {
		  this.choice({
		    namedCurve: this.objid()
		  })
		})

		exports.signature = asn1.define('signature', function () {
		  this.seq().obj(
		    this.key('r').int(),
		    this.key('s').int()
		  )
		})


	/***/ },
	/* 703 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {// adapted from https://github.com/apatil/pemstrip
		var findProc = /Proc-Type: 4,ENCRYPTED\r?\nDEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)\r?\n\r?\n([0-9A-z\n\r\+\/\=]+)\r?\n/m
		var startRegex = /^-----BEGIN (.*) KEY-----\r?\n/m
		var fullRegex = /^-----BEGIN (.*) KEY-----\r?\n([0-9A-z\n\r\+\/\=]+)\r?\n-----END \1 KEY-----$/m
		var evp = __webpack_require__(116)
		var ciphers = __webpack_require__(134)
		module.exports = function (okey, password) {
		  var key = okey.toString()
		  var match = key.match(findProc)
		  var decrypted
		  if (!match) {
		    var match2 = key.match(fullRegex)
		    decrypted = new Buffer(match2[2].replace(/\r?\n/g, ''), 'base64')
		  } else {
		    var suite = 'aes' + match[1]
		    var iv = new Buffer(match[2], 'hex')
		    var cipherText = new Buffer(match[3].replace(/\r?\n/g, ''), 'base64')
		    var cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key
		    var out = []
		    var cipher = ciphers.createDecipheriv(suite, cipherKey, iv)
		    out.push(cipher.update(cipherText))
		    out.push(cipher.final())
		    decrypted = Buffer.concat(out)
		  }
		  var tag = key.match(startRegex)[1] + ' KEY'
		  return {
		    tag: tag,
		    data: decrypted
		  }
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 704 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var bs58 = __webpack_require__(35);

		module.exports = PeerBook;

		function PeerBook() {
		  var _this = this;

		  if (!(this instanceof PeerBook)) {
		    return new PeerBook();
		  }

		  var peers = {};

		  this.put = function (peerInfo, replace) {
		    if (peers[peerInfo.id.toB58String()] && !replace) {
		      // peerInfo.replace merges by default
		      peers[peerInfo.id.toB58String()].multiaddr.replace([], peerInfo.multiaddrs);
		    }
		    peers[peerInfo.id.toB58String()] = peerInfo;
		  };

		  this.getAll = function () {
		    return peers;
		  };

		  this.getByB58String = function (b58String) {
		    var peerInfo = peers[b58String];
		    if (peerInfo) {
		      return peerInfo;
		    }
		    throw new Error('PeerInfo not found');
		  };

		  this.getByMultihash = function (multihash) {
		    var b58multihash = bs58.encode(multihash).toString();
		    return _this.getByB58String(b58multihash);
		  };

		  this.removeByB58String = function (b58String) {
		    if (peers[b58String]) {
		      delete peers[b58String];
		    }
		  };

		  this.removeByMultihash = function (multihash) {
		    var b58multihash = bs58.encode(multihash).toString();
		    _this.removeByB58String(b58multihash);
		  };

		  // TODO serialize PeerBook into MerkleDAG Objects
		}

	/***/ },
	/* 705 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process, setImmediate, module, Buffer) {var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;var require;(function(root, factory) {
		  if(true) {
		    !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_FACTORY__ = (factory), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
		  } else {
		    root.forge = factory();
		  }
		})(this, function() {
		/**
		 * @license almond 0.2.9 Copyright (c) 2011-2014, The Dojo Foundation All Rights Reserved.
		 * Available via the MIT or new BSD license.
		 * see: http://github.com/jrburke/almond for details
		 */
		//Going sloppy to avoid 'use strict' string cost, but strict practices should
		//be followed.
		/*jslint sloppy: true */
		/*global setTimeout: false */

		var requirejs, require, define;
		(function (undef) {
		    var main, req, makeMap, handlers,
		        defined = {},
		        waiting = {},
		        config = {},
		        defining = {},
		        hasOwn = Object.prototype.hasOwnProperty,
		        aps = [].slice,
		        jsSuffixRegExp = /\.js$/;

		    function hasProp(obj, prop) {
		        return hasOwn.call(obj, prop);
		    }

		    /**
		     * Given a relative module name, like ./something, normalize it to
		     * a real name that can be mapped to a path.
		     * @param {String} name the relative name
		     * @param {String} baseName a real name that the name arg is relative
		     * to.
		     * @returns {String} normalized name
		     */
		    function normalize(name, baseName) {
		        var nameParts, nameSegment, mapValue, foundMap, lastIndex,
		            foundI, foundStarMap, starI, i, j, part,
		            baseParts = baseName && baseName.split("/"),
		            map = config.map,
		            starMap = (map && map['*']) || {};

		        //Adjust any relative paths.
		        if (name && name.charAt(0) === ".") {
		            //If have a base name, try to normalize against it,
		            //otherwise, assume it is a top-level require that will
		            //be relative to baseUrl in the end.
		            if (baseName) {
		                //Convert baseName to array, and lop off the last part,
		                //so that . matches that "directory" and not name of the baseName's
		                //module. For instance, baseName of "one/two/three", maps to
		                //"one/two/three.js", but we want the directory, "one/two" for
		                //this normalization.
		                baseParts = baseParts.slice(0, baseParts.length - 1);
		                name = name.split('/');
		                lastIndex = name.length - 1;

		                // Node .js allowance:
		                if (config.nodeIdCompat && jsSuffixRegExp.test(name[lastIndex])) {
		                    name[lastIndex] = name[lastIndex].replace(jsSuffixRegExp, '');
		                }

		                name = baseParts.concat(name);

		                //start trimDots
		                for (i = 0; i < name.length; i += 1) {
		                    part = name[i];
		                    if (part === ".") {
		                        name.splice(i, 1);
		                        i -= 1;
		                    } else if (part === "..") {
		                        if (i === 1 && (name[2] === '..' || name[0] === '..')) {
		                            //End of the line. Keep at least one non-dot
		                            //path segment at the front so it can be mapped
		                            //correctly to disk. Otherwise, there is likely
		                            //no path mapping for a path starting with '..'.
		                            //This can still fail, but catches the most reasonable
		                            //uses of ..
		                            break;
		                        } else if (i > 0) {
		                            name.splice(i - 1, 2);
		                            i -= 2;
		                        }
		                    }
		                }
		                //end trimDots

		                name = name.join("/");
		            } else if (name.indexOf('./') === 0) {
		                // No baseName, so this is ID is resolved relative
		                // to baseUrl, pull off the leading dot.
		                name = name.substring(2);
		            }
		        }

		        //Apply map config if available.
		        if ((baseParts || starMap) && map) {
		            nameParts = name.split('/');

		            for (i = nameParts.length; i > 0; i -= 1) {
		                nameSegment = nameParts.slice(0, i).join("/");

		                if (baseParts) {
		                    //Find the longest baseName segment match in the config.
		                    //So, do joins on the biggest to smallest lengths of baseParts.
		                    for (j = baseParts.length; j > 0; j -= 1) {
		                        mapValue = map[baseParts.slice(0, j).join('/')];

		                        //baseName segment has  config, find if it has one for
		                        //this name.
		                        if (mapValue) {
		                            mapValue = mapValue[nameSegment];
		                            if (mapValue) {
		                                //Match, update name to the new value.
		                                foundMap = mapValue;
		                                foundI = i;
		                                break;
		                            }
		                        }
		                    }
		                }

		                if (foundMap) {
		                    break;
		                }

		                //Check for a star map match, but just hold on to it,
		                //if there is a shorter segment match later in a matching
		                //config, then favor over this star map.
		                if (!foundStarMap && starMap && starMap[nameSegment]) {
		                    foundStarMap = starMap[nameSegment];
		                    starI = i;
		                }
		            }

		            if (!foundMap && foundStarMap) {
		                foundMap = foundStarMap;
		                foundI = starI;
		            }

		            if (foundMap) {
		                nameParts.splice(0, foundI, foundMap);
		                name = nameParts.join('/');
		            }
		        }

		        return name;
		    }

		    function makeRequire(relName, forceSync) {
		        return function () {
		            //A version of a require function that passes a moduleName
		            //value for items that may need to
		            //look up paths relative to the moduleName
		            return req.apply(undef, aps.call(arguments, 0).concat([relName, forceSync]));
		        };
		    }

		    function makeNormalize(relName) {
		        return function (name) {
		            return normalize(name, relName);
		        };
		    }

		    function makeLoad(depName) {
		        return function (value) {
		            defined[depName] = value;
		        };
		    }

		    function callDep(name) {
		        if (hasProp(waiting, name)) {
		            var args = waiting[name];
		            delete waiting[name];
		            defining[name] = true;
		            main.apply(undef, args);
		        }

		        if (!hasProp(defined, name) && !hasProp(defining, name)) {
		            throw new Error('No ' + name);
		        }
		        return defined[name];
		    }

		    //Turns a plugin!resource to [plugin, resource]
		    //with the plugin being undefined if the name
		    //did not have a plugin prefix.
		    function splitPrefix(name) {
		        var prefix,
		            index = name ? name.indexOf('!') : -1;
		        if (index > -1) {
		            prefix = name.substring(0, index);
		            name = name.substring(index + 1, name.length);
		        }
		        return [prefix, name];
		    }

		    /**
		     * Makes a name map, normalizing the name, and using a plugin
		     * for normalization if necessary. Grabs a ref to plugin
		     * too, as an optimization.
		     */
		    makeMap = function (name, relName) {
		        var plugin,
		            parts = splitPrefix(name),
		            prefix = parts[0];

		        name = parts[1];

		        if (prefix) {
		            prefix = normalize(prefix, relName);
		            plugin = callDep(prefix);
		        }

		        //Normalize according
		        if (prefix) {
		            if (plugin && plugin.normalize) {
		                name = plugin.normalize(name, makeNormalize(relName));
		            } else {
		                name = normalize(name, relName);
		            }
		        } else {
		            name = normalize(name, relName);
		            parts = splitPrefix(name);
		            prefix = parts[0];
		            name = parts[1];
		            if (prefix) {
		                plugin = callDep(prefix);
		            }
		        }

		        //Using ridiculous property names for space reasons
		        return {
		            f: prefix ? prefix + '!' + name : name, //fullName
		            n: name,
		            pr: prefix,
		            p: plugin
		        };
		    };

		    function makeConfig(name) {
		        return function () {
		            return (config && config.config && config.config[name]) || {};
		        };
		    }

		    handlers = {
		        require: function (name) {
		            return makeRequire(name);
		        },
		        exports: function (name) {
		            var e = defined[name];
		            if (typeof e !== 'undefined') {
		                return e;
		            } else {
		                return (defined[name] = {});
		            }
		        },
		        module: function (name) {
		            return {
		                id: name,
		                uri: '',
		                exports: defined[name],
		                config: makeConfig(name)
		            };
		        }
		    };

		    main = function (name, deps, callback, relName) {
		        var cjsModule, depName, ret, map, i,
		            args = [],
		            callbackType = typeof callback,
		            usingExports;

		        //Use name if no relName
		        relName = relName || name;

		        //Call the callback to define the module, if necessary.
		        if (callbackType === 'undefined' || callbackType === 'function') {
		            //Pull out the defined dependencies and pass the ordered
		            //values to the callback.
		            //Default to [require, exports, module] if no deps
		            deps = !deps.length && callback.length ? ['require', 'exports', 'module'] : deps;
		            for (i = 0; i < deps.length; i += 1) {
		                map = makeMap(deps[i], relName);
		                depName = map.f;

		                //Fast path CommonJS standard dependencies.
		                if (depName === "require") {
		                    args[i] = handlers.require(name);
		                } else if (depName === "exports") {
		                    //CommonJS module spec 1.1
		                    args[i] = handlers.exports(name);
		                    usingExports = true;
		                } else if (depName === "module") {
		                    //CommonJS module spec 1.1
		                    cjsModule = args[i] = handlers.module(name);
		                } else if (hasProp(defined, depName) ||
		                           hasProp(waiting, depName) ||
		                           hasProp(defining, depName)) {
		                    args[i] = callDep(depName);
		                } else if (map.p) {
		                    map.p.load(map.n, makeRequire(relName, true), makeLoad(depName), {});
		                    args[i] = defined[depName];
		                } else {
		                    throw new Error(name + ' missing ' + depName);
		                }
		            }

		            ret = callback ? callback.apply(defined[name], args) : undefined;

		            if (name) {
		                //If setting exports via "module" is in play,
		                //favor that over return value and exports. After that,
		                //favor a non-undefined return value over exports use.
		                if (cjsModule && cjsModule.exports !== undef &&
		                        cjsModule.exports !== defined[name]) {
		                    defined[name] = cjsModule.exports;
		                } else if (ret !== undef || !usingExports) {
		                    //Use the return value from the function.
		                    defined[name] = ret;
		                }
		            }
		        } else if (name) {
		            //May just be an object definition for the module. Only
		            //worry about defining if have a module name.
		            defined[name] = callback;
		        }
		    };

		    requirejs = require = req = function (deps, callback, relName, forceSync, alt) {
		        if (typeof deps === "string") {
		            if (handlers[deps]) {
		                //callback in this case is really relName
		                return handlers[deps](callback);
		            }
		            //Just return the module wanted. In this scenario, the
		            //deps arg is the module name, and second arg (if passed)
		            //is just the relName.
		            //Normalize module name, if it contains . or ..
		            return callDep(makeMap(deps, callback).f);
		        } else if (!deps.splice) {
		            //deps is a config object, not an array.
		            config = deps;
		            if (config.deps) {
		                req(config.deps, config.callback);
		            }
		            if (!callback) {
		                return;
		            }

		            if (callback.splice) {
		                //callback is an array, which means it is a dependency list.
		                //Adjust args if there are dependencies
		                deps = callback;
		                callback = relName;
		                relName = null;
		            } else {
		                deps = undef;
		            }
		        }

		        //Support require(['a'])
		        callback = callback || function () {};

		        //If relName is a function, it is an errback handler,
		        //so remove it.
		        if (typeof relName === 'function') {
		            relName = forceSync;
		            forceSync = alt;
		        }

		        //Simulate async callback;
		        if (forceSync) {
		            main(undef, deps, callback, relName);
		        } else {
		            //Using a non-zero value because of concern for what old browsers
		            //do, and latest browsers "upgrade" to 4 if lower value is used:
		            //http://www.whatwg.org/specs/web-apps/current-work/multipage/timers.html#dom-windowtimers-settimeout:
		            //If want a value immediately, use require('id') instead -- something
		            //that works in almond on the global level, but not guaranteed and
		            //unlikely to work in other AMD implementations.
		            setTimeout(function () {
		                main(undef, deps, callback, relName);
		            }, 4);
		        }

		        return req;
		    };

		    /**
		     * Just drops the config on the floor, but returns req in case
		     * the config return value is used.
		     */
		    req.config = function (cfg) {
		        return req(cfg);
		    };

		    /**
		     * Expose module registry for debugging and tooling
		     */
		    requirejs._defined = defined;

		    define = function (name, deps, callback) {

		        //This module may not have dependencies
		        if (!deps.splice) {
		            //deps is not an array, so probably means
		            //an object literal or factory function for
		            //the value. Adjust args.
		            callback = deps;
		            deps = [];
		        }

		        if (!hasProp(defined, name) && !hasProp(waiting, name)) {
		            waiting[name] = [name, deps, callback];
		        }
		    };

		    define.amd = {
		        jQuery: true
		    };
		}());

		define("node_modules/almond/almond", function(){});

		/**
		 * Utility functions for web applications.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* Utilities API */
		var util = forge.util = forge.util || {};

		// define setImmediate and nextTick
		(function() {
		  // use native nextTick
		  if(typeof process !== 'undefined' && process.nextTick) {
		    util.nextTick = process.nextTick;
		    if(typeof setImmediate === 'function') {
		      util.setImmediate = setImmediate;
		    } else {
		      // polyfill setImmediate with nextTick, older versions of node
		      // (those w/o setImmediate) won't totally starve IO
		      util.setImmediate = util.nextTick;
		    }
		    return;
		  }

		  // polyfill nextTick with native setImmediate
		  if(typeof setImmediate === 'function') {
		    util.setImmediate = setImmediate;
		    util.nextTick = function(callback) {
		      return setImmediate(callback);
		    };
		    return;
		  }

		  /* Note: A polyfill upgrade pattern is used here to allow combining
		  polyfills. For example, MutationObserver is fast, but blocks UI updates,
		  so it needs to allow UI updates periodically, so it falls back on
		  postMessage or setTimeout. */

		  // polyfill with setTimeout
		  util.setImmediate = function(callback) {
		    setTimeout(callback, 0);
		  };

		  // upgrade polyfill to use postMessage
		  if(typeof window !== 'undefined' &&
		    typeof window.postMessage === 'function') {
		    var msg = 'forge.setImmediate';
		    var callbacks = [];
		    util.setImmediate = function(callback) {
		      callbacks.push(callback);
		      // only send message when one hasn't been sent in
		      // the current turn of the event loop
		      if(callbacks.length === 1) {
		        window.postMessage(msg, '*');
		      }
		    };
		    function handler(event) {
		      if(event.source === window && event.data === msg) {
		        event.stopPropagation();
		        var copy = callbacks.slice();
		        callbacks.length = 0;
		        copy.forEach(function(callback) {
		          callback();
		        });
		      }
		    }
		    window.addEventListener('message', handler, true);
		  }

		  // upgrade polyfill to use MutationObserver
		  if(typeof MutationObserver !== 'undefined') {
		    // polyfill with MutationObserver
		    var now = Date.now();
		    var attr = true;
		    var div = document.createElement('div');
		    var callbacks = [];
		    new MutationObserver(function() {
		      var copy = callbacks.slice();
		      callbacks.length = 0;
		      copy.forEach(function(callback) {
		        callback();
		      });
		    }).observe(div, {attributes: true});
		    var oldSetImmediate = util.setImmediate;
		    util.setImmediate = function(callback) {
		      if(Date.now() - now > 15) {
		        now = Date.now();
		        oldSetImmediate(callback);
		      } else {
		        callbacks.push(callback);
		        // only trigger observer when it hasn't been triggered in
		        // the current turn of the event loop
		        if(callbacks.length === 1) {
		          div.setAttribute('a', attr = !attr);
		        }
		      }
		    };
		  }

		  util.nextTick = util.setImmediate;
		})();

		// define isArray
		util.isArray = Array.isArray || function(x) {
		  return Object.prototype.toString.call(x) === '[object Array]';
		};

		// define isArrayBuffer
		util.isArrayBuffer = function(x) {
		  return typeof ArrayBuffer !== 'undefined' && x instanceof ArrayBuffer;
		};

		// define isArrayBufferView
		util.isArrayBufferView = function(x) {
		  return x && util.isArrayBuffer(x.buffer) && x.byteLength !== undefined;
		};

		// TODO: set ByteBuffer to best available backing
		util.ByteBuffer = ByteStringBuffer;

		/** Buffer w/BinaryString backing */

		/**
		 * Constructor for a binary string backed byte buffer.
		 *
		 * @param [b] the bytes to wrap (either encoded as string, one byte per
		 *          character, or as an ArrayBuffer or Typed Array).
		 */
		function ByteStringBuffer(b) {
		  // TODO: update to match DataBuffer API

		  // the data in this buffer
		  this.data = '';
		  // the pointer for reading from this buffer
		  this.read = 0;

		  if(typeof b === 'string') {
		    this.data = b;
		  } else if(util.isArrayBuffer(b) || util.isArrayBufferView(b)) {
		    // convert native buffer to forge buffer
		    // FIXME: support native buffers internally instead
		    var arr = new Uint8Array(b);
		    try {
		      this.data = String.fromCharCode.apply(null, arr);
		    } catch(e) {
		      for(var i = 0; i < arr.length; ++i) {
		        this.putByte(arr[i]);
		      }
		    }
		  } else if(b instanceof ByteStringBuffer ||
		    (typeof b === 'object' && typeof b.data === 'string' &&
		    typeof b.read === 'number')) {
		    // copy existing buffer
		    this.data = b.data;
		    this.read = b.read;
		  }

		  // used for v8 optimization
		  this._constructedStringLength = 0;
		}
		util.ByteStringBuffer = ByteStringBuffer;

		/* Note: This is an optimization for V8-based browsers. When V8 concatenates
		  a string, the strings are only joined logically using a "cons string" or
		  "constructed/concatenated string". These containers keep references to one
		  another and can result in very large memory usage. For example, if a 2MB
		  string is constructed by concatenating 4 bytes together at a time, the
		  memory usage will be ~44MB; so ~22x increase. The strings are only joined
		  together when an operation requiring their joining takes place, such as
		  substr(). This function is called when adding data to this buffer to ensure
		  these types of strings are periodically joined to reduce the memory
		  footprint. */
		var _MAX_CONSTRUCTED_STRING_LENGTH = 4096;
		util.ByteStringBuffer.prototype._optimizeConstructedString = function(x) {
		  this._constructedStringLength += x;
		  if(this._constructedStringLength > _MAX_CONSTRUCTED_STRING_LENGTH) {
		    // this substr() should cause the constructed string to join
		    this.data.substr(0, 1);
		    this._constructedStringLength = 0;
		  }
		};

		/**
		 * Gets the number of bytes in this buffer.
		 *
		 * @return the number of bytes in this buffer.
		 */
		util.ByteStringBuffer.prototype.length = function() {
		  return this.data.length - this.read;
		};

		/**
		 * Gets whether or not this buffer is empty.
		 *
		 * @return true if this buffer is empty, false if not.
		 */
		util.ByteStringBuffer.prototype.isEmpty = function() {
		  return this.length() <= 0;
		};

		/**
		 * Puts a byte in this buffer.
		 *
		 * @param b the byte to put.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putByte = function(b) {
		  return this.putBytes(String.fromCharCode(b));
		};

		/**
		 * Puts a byte in this buffer N times.
		 *
		 * @param b the byte to put.
		 * @param n the number of bytes of value b to put.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.fillWithByte = function(b, n) {
		  b = String.fromCharCode(b);
		  var d = this.data;
		  while(n > 0) {
		    if(n & 1) {
		      d += b;
		    }
		    n >>>= 1;
		    if(n > 0) {
		      b += b;
		    }
		  }
		  this.data = d;
		  this._optimizeConstructedString(n);
		  return this;
		};

		/**
		 * Puts bytes in this buffer.
		 *
		 * @param bytes the bytes (as a UTF-8 encoded string) to put.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putBytes = function(bytes) {
		  this.data += bytes;
		  this._optimizeConstructedString(bytes.length);
		  return this;
		};

		/**
		 * Puts a UTF-16 encoded string into this buffer.
		 *
		 * @param str the string to put.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putString = function(str) {
		  return this.putBytes(util.encodeUtf8(str));
		};

		/**
		 * Puts a 16-bit integer in this buffer in big-endian order.
		 *
		 * @param i the 16-bit integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt16 = function(i) {
		  return this.putBytes(
		    String.fromCharCode(i >> 8 & 0xFF) +
		    String.fromCharCode(i & 0xFF));
		};

		/**
		 * Puts a 24-bit integer in this buffer in big-endian order.
		 *
		 * @param i the 24-bit integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt24 = function(i) {
		  return this.putBytes(
		    String.fromCharCode(i >> 16 & 0xFF) +
		    String.fromCharCode(i >> 8 & 0xFF) +
		    String.fromCharCode(i & 0xFF));
		};

		/**
		 * Puts a 32-bit integer in this buffer in big-endian order.
		 *
		 * @param i the 32-bit integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt32 = function(i) {
		  return this.putBytes(
		    String.fromCharCode(i >> 24 & 0xFF) +
		    String.fromCharCode(i >> 16 & 0xFF) +
		    String.fromCharCode(i >> 8 & 0xFF) +
		    String.fromCharCode(i & 0xFF));
		};

		/**
		 * Puts a 16-bit integer in this buffer in little-endian order.
		 *
		 * @param i the 16-bit integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt16Le = function(i) {
		  return this.putBytes(
		    String.fromCharCode(i & 0xFF) +
		    String.fromCharCode(i >> 8 & 0xFF));
		};

		/**
		 * Puts a 24-bit integer in this buffer in little-endian order.
		 *
		 * @param i the 24-bit integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt24Le = function(i) {
		  return this.putBytes(
		    String.fromCharCode(i & 0xFF) +
		    String.fromCharCode(i >> 8 & 0xFF) +
		    String.fromCharCode(i >> 16 & 0xFF));
		};

		/**
		 * Puts a 32-bit integer in this buffer in little-endian order.
		 *
		 * @param i the 32-bit integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt32Le = function(i) {
		  return this.putBytes(
		    String.fromCharCode(i & 0xFF) +
		    String.fromCharCode(i >> 8 & 0xFF) +
		    String.fromCharCode(i >> 16 & 0xFF) +
		    String.fromCharCode(i >> 24 & 0xFF));
		};

		/**
		 * Puts an n-bit integer in this buffer in big-endian order.
		 *
		 * @param i the n-bit integer.
		 * @param n the number of bits in the integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putInt = function(i, n) {
		  var bytes = '';
		  do {
		    n -= 8;
		    bytes += String.fromCharCode((i >> n) & 0xFF);
		  } while(n > 0);
		  return this.putBytes(bytes);
		};

		/**
		 * Puts a signed n-bit integer in this buffer in big-endian order. Two's
		 * complement representation is used.
		 *
		 * @param i the n-bit integer.
		 * @param n the number of bits in the integer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putSignedInt = function(i, n) {
		  if(i < 0) {
		    i += 2 << (n - 1);
		  }
		  return this.putInt(i, n);
		};

		/**
		 * Puts the given buffer into this buffer.
		 *
		 * @param buffer the buffer to put into this one.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.putBuffer = function(buffer) {
		  return this.putBytes(buffer.getBytes());
		};

		/**
		 * Gets a byte from this buffer and advances the read pointer by 1.
		 *
		 * @return the byte.
		 */
		util.ByteStringBuffer.prototype.getByte = function() {
		  return this.data.charCodeAt(this.read++);
		};

		/**
		 * Gets a uint16 from this buffer in big-endian order and advances the read
		 * pointer by 2.
		 *
		 * @return the uint16.
		 */
		util.ByteStringBuffer.prototype.getInt16 = function() {
		  var rval = (
		    this.data.charCodeAt(this.read) << 8 ^
		    this.data.charCodeAt(this.read + 1));
		  this.read += 2;
		  return rval;
		};

		/**
		 * Gets a uint24 from this buffer in big-endian order and advances the read
		 * pointer by 3.
		 *
		 * @return the uint24.
		 */
		util.ByteStringBuffer.prototype.getInt24 = function() {
		  var rval = (
		    this.data.charCodeAt(this.read) << 16 ^
		    this.data.charCodeAt(this.read + 1) << 8 ^
		    this.data.charCodeAt(this.read + 2));
		  this.read += 3;
		  return rval;
		};

		/**
		 * Gets a uint32 from this buffer in big-endian order and advances the read
		 * pointer by 4.
		 *
		 * @return the word.
		 */
		util.ByteStringBuffer.prototype.getInt32 = function() {
		  var rval = (
		    this.data.charCodeAt(this.read) << 24 ^
		    this.data.charCodeAt(this.read + 1) << 16 ^
		    this.data.charCodeAt(this.read + 2) << 8 ^
		    this.data.charCodeAt(this.read + 3));
		  this.read += 4;
		  return rval;
		};

		/**
		 * Gets a uint16 from this buffer in little-endian order and advances the read
		 * pointer by 2.
		 *
		 * @return the uint16.
		 */
		util.ByteStringBuffer.prototype.getInt16Le = function() {
		  var rval = (
		    this.data.charCodeAt(this.read) ^
		    this.data.charCodeAt(this.read + 1) << 8);
		  this.read += 2;
		  return rval;
		};

		/**
		 * Gets a uint24 from this buffer in little-endian order and advances the read
		 * pointer by 3.
		 *
		 * @return the uint24.
		 */
		util.ByteStringBuffer.prototype.getInt24Le = function() {
		  var rval = (
		    this.data.charCodeAt(this.read) ^
		    this.data.charCodeAt(this.read + 1) << 8 ^
		    this.data.charCodeAt(this.read + 2) << 16);
		  this.read += 3;
		  return rval;
		};

		/**
		 * Gets a uint32 from this buffer in little-endian order and advances the read
		 * pointer by 4.
		 *
		 * @return the word.
		 */
		util.ByteStringBuffer.prototype.getInt32Le = function() {
		  var rval = (
		    this.data.charCodeAt(this.read) ^
		    this.data.charCodeAt(this.read + 1) << 8 ^
		    this.data.charCodeAt(this.read + 2) << 16 ^
		    this.data.charCodeAt(this.read + 3) << 24);
		  this.read += 4;
		  return rval;
		};

		/**
		 * Gets an n-bit integer from this buffer in big-endian order and advances the
		 * read pointer by n/8.
		 *
		 * @param n the number of bits in the integer.
		 *
		 * @return the integer.
		 */
		util.ByteStringBuffer.prototype.getInt = function(n) {
		  var rval = 0;
		  do {
		    rval = (rval << 8) + this.data.charCodeAt(this.read++);
		    n -= 8;
		  } while(n > 0);
		  return rval;
		};

		/**
		 * Gets a signed n-bit integer from this buffer in big-endian order, using
		 * two's complement, and advances the read pointer by n/8.
		 *
		 * @param n the number of bits in the integer.
		 *
		 * @return the integer.
		 */
		util.ByteStringBuffer.prototype.getSignedInt = function(n) {
		  var x = this.getInt(n);
		  var max = 2 << (n - 2);
		  if(x >= max) {
		    x -= max << 1;
		  }
		  return x;
		};

		/**
		 * Reads bytes out into a UTF-8 string and clears them from the buffer.
		 *
		 * @param count the number of bytes to read, undefined or null for all.
		 *
		 * @return a UTF-8 string of bytes.
		 */
		util.ByteStringBuffer.prototype.getBytes = function(count) {
		  var rval;
		  if(count) {
		    // read count bytes
		    count = Math.min(this.length(), count);
		    rval = this.data.slice(this.read, this.read + count);
		    this.read += count;
		  } else if(count === 0) {
		    rval = '';
		  } else {
		    // read all bytes, optimize to only copy when needed
		    rval = (this.read === 0) ? this.data : this.data.slice(this.read);
		    this.clear();
		  }
		  return rval;
		};

		/**
		 * Gets a UTF-8 encoded string of the bytes from this buffer without modifying
		 * the read pointer.
		 *
		 * @param count the number of bytes to get, omit to get all.
		 *
		 * @return a string full of UTF-8 encoded characters.
		 */
		util.ByteStringBuffer.prototype.bytes = function(count) {
		  return (typeof(count) === 'undefined' ?
		    this.data.slice(this.read) :
		    this.data.slice(this.read, this.read + count));
		};

		/**
		 * Gets a byte at the given index without modifying the read pointer.
		 *
		 * @param i the byte index.
		 *
		 * @return the byte.
		 */
		util.ByteStringBuffer.prototype.at = function(i) {
		  return this.data.charCodeAt(this.read + i);
		};

		/**
		 * Puts a byte at the given index without modifying the read pointer.
		 *
		 * @param i the byte index.
		 * @param b the byte to put.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.setAt = function(i, b) {
		  this.data = this.data.substr(0, this.read + i) +
		    String.fromCharCode(b) +
		    this.data.substr(this.read + i + 1);
		  return this;
		};

		/**
		 * Gets the last byte without modifying the read pointer.
		 *
		 * @return the last byte.
		 */
		util.ByteStringBuffer.prototype.last = function() {
		  return this.data.charCodeAt(this.data.length - 1);
		};

		/**
		 * Creates a copy of this buffer.
		 *
		 * @return the copy.
		 */
		util.ByteStringBuffer.prototype.copy = function() {
		  var c = util.createBuffer(this.data);
		  c.read = this.read;
		  return c;
		};

		/**
		 * Compacts this buffer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.compact = function() {
		  if(this.read > 0) {
		    this.data = this.data.slice(this.read);
		    this.read = 0;
		  }
		  return this;
		};

		/**
		 * Clears this buffer.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.clear = function() {
		  this.data = '';
		  this.read = 0;
		  return this;
		};

		/**
		 * Shortens this buffer by triming bytes off of the end of this buffer.
		 *
		 * @param count the number of bytes to trim off.
		 *
		 * @return this buffer.
		 */
		util.ByteStringBuffer.prototype.truncate = function(count) {
		  var len = Math.max(0, this.length() - count);
		  this.data = this.data.substr(this.read, len);
		  this.read = 0;
		  return this;
		};

		/**
		 * Converts this buffer to a hexadecimal string.
		 *
		 * @return a hexadecimal string.
		 */
		util.ByteStringBuffer.prototype.toHex = function() {
		  var rval = '';
		  for(var i = this.read; i < this.data.length; ++i) {
		    var b = this.data.charCodeAt(i);
		    if(b < 16) {
		      rval += '0';
		    }
		    rval += b.toString(16);
		  }
		  return rval;
		};

		/**
		 * Converts this buffer to a UTF-16 string (standard JavaScript string).
		 *
		 * @return a UTF-16 string.
		 */
		util.ByteStringBuffer.prototype.toString = function() {
		  return util.decodeUtf8(this.bytes());
		};

		/** End Buffer w/BinaryString backing */


		/** Buffer w/UInt8Array backing */

		/**
		 * FIXME: Experimental. Do not use yet.
		 *
		 * Constructor for an ArrayBuffer-backed byte buffer.
		 *
		 * The buffer may be constructed from a string, an ArrayBuffer, DataView, or a
		 * TypedArray.
		 *
		 * If a string is given, its encoding should be provided as an option,
		 * otherwise it will default to 'binary'. A 'binary' string is encoded such
		 * that each character is one byte in length and size.
		 *
		 * If an ArrayBuffer, DataView, or TypedArray is given, it will be used
		 * *directly* without any copying. Note that, if a write to the buffer requires
		 * more space, the buffer will allocate a new backing ArrayBuffer to
		 * accommodate. The starting read and write offsets for the buffer may be
		 * given as options.
		 *
		 * @param [b] the initial bytes for this buffer.
		 * @param options the options to use:
		 *          [readOffset] the starting read offset to use (default: 0).
		 *          [writeOffset] the starting write offset to use (default: the
		 *            length of the first parameter).
		 *          [growSize] the minimum amount, in bytes, to grow the buffer by to
		 *            accommodate writes (default: 1024).
		 *          [encoding] the encoding ('binary', 'utf8', 'utf16', 'hex') for the
		 *            first parameter, if it is a string (default: 'binary').
		 */
		function DataBuffer(b, options) {
		  // default options
		  options = options || {};

		  // pointers for read from/write to buffer
		  this.read = options.readOffset || 0;
		  this.growSize = options.growSize || 1024;

		  var isArrayBuffer = util.isArrayBuffer(b);
		  var isArrayBufferView = util.isArrayBufferView(b);
		  if(isArrayBuffer || isArrayBufferView) {
		    // use ArrayBuffer directly
		    if(isArrayBuffer) {
		      this.data = new DataView(b);
		    } else {
		      // TODO: adjust read/write offset based on the type of view
		      // or specify that this must be done in the options ... that the
		      // offsets are byte-based
		      this.data = new DataView(b.buffer, b.byteOffset, b.byteLength);
		    }
		    this.write = ('writeOffset' in options ?
		      options.writeOffset : this.data.byteLength);
		    return;
		  }

		  // initialize to empty array buffer and add any given bytes using putBytes
		  this.data = new DataView(new ArrayBuffer(0));
		  this.write = 0;

		  if(b !== null && b !== undefined) {
		    this.putBytes(b);
		  }

		  if('writeOffset' in options) {
		    this.write = options.writeOffset;
		  }
		}
		util.DataBuffer = DataBuffer;

		/**
		 * Gets the number of bytes in this buffer.
		 *
		 * @return the number of bytes in this buffer.
		 */
		util.DataBuffer.prototype.length = function() {
		  return this.write - this.read;
		};

		/**
		 * Gets whether or not this buffer is empty.
		 *
		 * @return true if this buffer is empty, false if not.
		 */
		util.DataBuffer.prototype.isEmpty = function() {
		  return this.length() <= 0;
		};

		/**
		 * Ensures this buffer has enough empty space to accommodate the given number
		 * of bytes. An optional parameter may be given that indicates a minimum
		 * amount to grow the buffer if necessary. If the parameter is not given,
		 * the buffer will be grown by some previously-specified default amount
		 * or heuristic.
		 *
		 * @param amount the number of bytes to accommodate.
		 * @param [growSize] the minimum amount, in bytes, to grow the buffer by if
		 *          necessary.
		 */
		util.DataBuffer.prototype.accommodate = function(amount, growSize) {
		  if(this.length() >= amount) {
		    return this;
		  }
		  growSize = Math.max(growSize || this.growSize, amount);

		  // grow buffer
		  var src = new Uint8Array(
		    this.data.buffer, this.data.byteOffset, this.data.byteLength);
		  var dst = new Uint8Array(this.length() + growSize);
		  dst.set(src);
		  this.data = new DataView(dst.buffer);

		  return this;
		};

		/**
		 * Puts a byte in this buffer.
		 *
		 * @param b the byte to put.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putByte = function(b) {
		  this.accommodate(1);
		  this.data.setUint8(this.write++, b);
		  return this;
		};

		/**
		 * Puts a byte in this buffer N times.
		 *
		 * @param b the byte to put.
		 * @param n the number of bytes of value b to put.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.fillWithByte = function(b, n) {
		  this.accommodate(n);
		  for(var i = 0; i < n; ++i) {
		    this.data.setUint8(b);
		  }
		  return this;
		};

		/**
		 * Puts bytes in this buffer. The bytes may be given as a string, an
		 * ArrayBuffer, a DataView, or a TypedArray.
		 *
		 * @param bytes the bytes to put.
		 * @param [encoding] the encoding for the first parameter ('binary', 'utf8',
		 *          'utf16', 'hex'), if it is a string (default: 'binary').
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putBytes = function(bytes, encoding) {
		  if(util.isArrayBufferView(bytes)) {
		    var src = new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);
		    var len = src.byteLength - src.byteOffset;
		    this.accommodate(len);
		    var dst = new Uint8Array(this.data.buffer, this.write);
		    dst.set(src);
		    this.write += len;
		    return this;
		  }

		  if(util.isArrayBuffer(bytes)) {
		    var src = new Uint8Array(bytes);
		    this.accommodate(src.byteLength);
		    var dst = new Uint8Array(this.data.buffer);
		    dst.set(src, this.write);
		    this.write += src.byteLength;
		    return this;
		  }

		  // bytes is a util.DataBuffer or equivalent
		  if(bytes instanceof util.DataBuffer ||
		    (typeof bytes === 'object' &&
		    typeof bytes.read === 'number' && typeof bytes.write === 'number' &&
		    util.isArrayBufferView(bytes.data))) {
		    var src = new Uint8Array(bytes.data.byteLength, bytes.read, bytes.length());
		    this.accommodate(src.byteLength);
		    var dst = new Uint8Array(bytes.data.byteLength, this.write);
		    dst.set(src);
		    this.write += src.byteLength;
		    return this;
		  }

		  if(bytes instanceof util.ByteStringBuffer) {
		    // copy binary string and process as the same as a string parameter below
		    bytes = bytes.data;
		    encoding = 'binary';
		  }

		  // string conversion
		  encoding = encoding || 'binary';
		  if(typeof bytes === 'string') {
		    var view;

		    // decode from string
		    if(encoding === 'hex') {
		      this.accommodate(Math.ceil(bytes.length / 2));
		      view = new Uint8Array(this.data.buffer, this.write);
		      this.write += util.binary.hex.decode(bytes, view, this.write);
		      return this;
		    }
		    if(encoding === 'base64') {
		      this.accommodate(Math.ceil(bytes.length / 4) * 3);
		      view = new Uint8Array(this.data.buffer, this.write);
		      this.write += util.binary.base64.decode(bytes, view, this.write);
		      return this;
		    }

		    // encode text as UTF-8 bytes
		    if(encoding === 'utf8') {
		      // encode as UTF-8 then decode string as raw binary
		      bytes = util.encodeUtf8(bytes);
		      encoding = 'binary';
		    }

		    // decode string as raw binary
		    if(encoding === 'binary' || encoding === 'raw') {
		      // one byte per character
		      this.accommodate(bytes.length);
		      view = new Uint8Array(this.data.buffer, this.write);
		      this.write += util.binary.raw.decode(view);
		      return this;
		    }

		    // encode text as UTF-16 bytes
		    if(encoding === 'utf16') {
		      // two bytes per character
		      this.accommodate(bytes.length * 2);
		      view = new Uint16Array(this.data.buffer, this.write);
		      this.write += util.text.utf16.encode(view);
		      return this;
		    }

		    throw new Error('Invalid encoding: ' + encoding);
		  }

		  throw Error('Invalid parameter: ' + bytes);
		};

		/**
		 * Puts the given buffer into this buffer.
		 *
		 * @param buffer the buffer to put into this one.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putBuffer = function(buffer) {
		  this.putBytes(buffer);
		  buffer.clear();
		  return this;
		};

		/**
		 * Puts a string into this buffer.
		 *
		 * @param str the string to put.
		 * @param [encoding] the encoding for the string (default: 'utf16').
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putString = function(str) {
		  return this.putBytes(str, 'utf16');
		};

		/**
		 * Puts a 16-bit integer in this buffer in big-endian order.
		 *
		 * @param i the 16-bit integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt16 = function(i) {
		  this.accommodate(2);
		  this.data.setInt16(this.write, i);
		  this.write += 2;
		  return this;
		};

		/**
		 * Puts a 24-bit integer in this buffer in big-endian order.
		 *
		 * @param i the 24-bit integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt24 = function(i) {
		  this.accommodate(3);
		  this.data.setInt16(this.write, i >> 8 & 0xFFFF);
		  this.data.setInt8(this.write, i >> 16 & 0xFF);
		  this.write += 3;
		  return this;
		};

		/**
		 * Puts a 32-bit integer in this buffer in big-endian order.
		 *
		 * @param i the 32-bit integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt32 = function(i) {
		  this.accommodate(4);
		  this.data.setInt32(this.write, i);
		  this.write += 4;
		  return this;
		};

		/**
		 * Puts a 16-bit integer in this buffer in little-endian order.
		 *
		 * @param i the 16-bit integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt16Le = function(i) {
		  this.accommodate(2);
		  this.data.setInt16(this.write, i, true);
		  this.write += 2;
		  return this;
		};

		/**
		 * Puts a 24-bit integer in this buffer in little-endian order.
		 *
		 * @param i the 24-bit integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt24Le = function(i) {
		  this.accommodate(3);
		  this.data.setInt8(this.write, i >> 16 & 0xFF);
		  this.data.setInt16(this.write, i >> 8 & 0xFFFF, true);
		  this.write += 3;
		  return this;
		};

		/**
		 * Puts a 32-bit integer in this buffer in little-endian order.
		 *
		 * @param i the 32-bit integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt32Le = function(i) {
		  this.accommodate(4);
		  this.data.setInt32(this.write, i, true);
		  this.write += 4;
		  return this;
		};

		/**
		 * Puts an n-bit integer in this buffer in big-endian order.
		 *
		 * @param i the n-bit integer.
		 * @param n the number of bits in the integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putInt = function(i, n) {
		  this.accommodate(n / 8);
		  do {
		    n -= 8;
		    this.data.setInt8(this.write++, (i >> n) & 0xFF);
		  } while(n > 0);
		  return this;
		};

		/**
		 * Puts a signed n-bit integer in this buffer in big-endian order. Two's
		 * complement representation is used.
		 *
		 * @param i the n-bit integer.
		 * @param n the number of bits in the integer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.putSignedInt = function(i, n) {
		  this.accommodate(n / 8);
		  if(i < 0) {
		    i += 2 << (n - 1);
		  }
		  return this.putInt(i, n);
		};

		/**
		 * Gets a byte from this buffer and advances the read pointer by 1.
		 *
		 * @return the byte.
		 */
		util.DataBuffer.prototype.getByte = function() {
		  return this.data.getInt8(this.read++);
		};

		/**
		 * Gets a uint16 from this buffer in big-endian order and advances the read
		 * pointer by 2.
		 *
		 * @return the uint16.
		 */
		util.DataBuffer.prototype.getInt16 = function() {
		  var rval = this.data.getInt16(this.read);
		  this.read += 2;
		  return rval;
		};

		/**
		 * Gets a uint24 from this buffer in big-endian order and advances the read
		 * pointer by 3.
		 *
		 * @return the uint24.
		 */
		util.DataBuffer.prototype.getInt24 = function() {
		  var rval = (
		    this.data.getInt16(this.read) << 8 ^
		    this.data.getInt8(this.read + 2));
		  this.read += 3;
		  return rval;
		};

		/**
		 * Gets a uint32 from this buffer in big-endian order and advances the read
		 * pointer by 4.
		 *
		 * @return the word.
		 */
		util.DataBuffer.prototype.getInt32 = function() {
		  var rval = this.data.getInt32(this.read);
		  this.read += 4;
		  return rval;
		};

		/**
		 * Gets a uint16 from this buffer in little-endian order and advances the read
		 * pointer by 2.
		 *
		 * @return the uint16.
		 */
		util.DataBuffer.prototype.getInt16Le = function() {
		  var rval = this.data.getInt16(this.read, true);
		  this.read += 2;
		  return rval;
		};

		/**
		 * Gets a uint24 from this buffer in little-endian order and advances the read
		 * pointer by 3.
		 *
		 * @return the uint24.
		 */
		util.DataBuffer.prototype.getInt24Le = function() {
		  var rval = (
		    this.data.getInt8(this.read) ^
		    this.data.getInt16(this.read + 1, true) << 8);
		  this.read += 3;
		  return rval;
		};

		/**
		 * Gets a uint32 from this buffer in little-endian order and advances the read
		 * pointer by 4.
		 *
		 * @return the word.
		 */
		util.DataBuffer.prototype.getInt32Le = function() {
		  var rval = this.data.getInt32(this.read, true);
		  this.read += 4;
		  return rval;
		};

		/**
		 * Gets an n-bit integer from this buffer in big-endian order and advances the
		 * read pointer by n/8.
		 *
		 * @param n the number of bits in the integer.
		 *
		 * @return the integer.
		 */
		util.DataBuffer.prototype.getInt = function(n) {
		  var rval = 0;
		  do {
		    rval = (rval << 8) + this.data.getInt8(this.read++);
		    n -= 8;
		  } while(n > 0);
		  return rval;
		};

		/**
		 * Gets a signed n-bit integer from this buffer in big-endian order, using
		 * two's complement, and advances the read pointer by n/8.
		 *
		 * @param n the number of bits in the integer.
		 *
		 * @return the integer.
		 */
		util.DataBuffer.prototype.getSignedInt = function(n) {
		  var x = this.getInt(n);
		  var max = 2 << (n - 2);
		  if(x >= max) {
		    x -= max << 1;
		  }
		  return x;
		};

		/**
		 * Reads bytes out into a UTF-8 string and clears them from the buffer.
		 *
		 * @param count the number of bytes to read, undefined or null for all.
		 *
		 * @return a UTF-8 string of bytes.
		 */
		util.DataBuffer.prototype.getBytes = function(count) {
		  // TODO: deprecate this method, it is poorly named and
		  // this.toString('binary') replaces it
		  // add a toTypedArray()/toArrayBuffer() function
		  var rval;
		  if(count) {
		    // read count bytes
		    count = Math.min(this.length(), count);
		    rval = this.data.slice(this.read, this.read + count);
		    this.read += count;
		  } else if(count === 0) {
		    rval = '';
		  } else {
		    // read all bytes, optimize to only copy when needed
		    rval = (this.read === 0) ? this.data : this.data.slice(this.read);
		    this.clear();
		  }
		  return rval;
		};

		/**
		 * Gets a UTF-8 encoded string of the bytes from this buffer without modifying
		 * the read pointer.
		 *
		 * @param count the number of bytes to get, omit to get all.
		 *
		 * @return a string full of UTF-8 encoded characters.
		 */
		util.DataBuffer.prototype.bytes = function(count) {
		  // TODO: deprecate this method, it is poorly named, add "getString()"
		  return (typeof(count) === 'undefined' ?
		    this.data.slice(this.read) :
		    this.data.slice(this.read, this.read + count));
		};

		/**
		 * Gets a byte at the given index without modifying the read pointer.
		 *
		 * @param i the byte index.
		 *
		 * @return the byte.
		 */
		util.DataBuffer.prototype.at = function(i) {
		  return this.data.getUint8(this.read + i);
		};

		/**
		 * Puts a byte at the given index without modifying the read pointer.
		 *
		 * @param i the byte index.
		 * @param b the byte to put.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.setAt = function(i, b) {
		  this.data.setUint8(i, b);
		  return this;
		};

		/**
		 * Gets the last byte without modifying the read pointer.
		 *
		 * @return the last byte.
		 */
		util.DataBuffer.prototype.last = function() {
		  return this.data.getUint8(this.write - 1);
		};

		/**
		 * Creates a copy of this buffer.
		 *
		 * @return the copy.
		 */
		util.DataBuffer.prototype.copy = function() {
		  return new util.DataBuffer(this);
		};

		/**
		 * Compacts this buffer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.compact = function() {
		  if(this.read > 0) {
		    var src = new Uint8Array(this.data.buffer, this.read);
		    var dst = new Uint8Array(src.byteLength);
		    dst.set(src);
		    this.data = new DataView(dst);
		    this.write -= this.read;
		    this.read = 0;
		  }
		  return this;
		};

		/**
		 * Clears this buffer.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.clear = function() {
		  this.data = new DataView(new ArrayBuffer(0));
		  this.read = this.write = 0;
		  return this;
		};

		/**
		 * Shortens this buffer by triming bytes off of the end of this buffer.
		 *
		 * @param count the number of bytes to trim off.
		 *
		 * @return this buffer.
		 */
		util.DataBuffer.prototype.truncate = function(count) {
		  this.write = Math.max(0, this.length() - count);
		  this.read = Math.min(this.read, this.write);
		  return this;
		};

		/**
		 * Converts this buffer to a hexadecimal string.
		 *
		 * @return a hexadecimal string.
		 */
		util.DataBuffer.prototype.toHex = function() {
		  var rval = '';
		  for(var i = this.read; i < this.data.byteLength; ++i) {
		    var b = this.data.getUint8(i);
		    if(b < 16) {
		      rval += '0';
		    }
		    rval += b.toString(16);
		  }
		  return rval;
		};

		/**
		 * Converts this buffer to a string, using the given encoding. If no
		 * encoding is given, 'utf8' (UTF-8) is used.
		 *
		 * @param [encoding] the encoding to use: 'binary', 'utf8', 'utf16', 'hex',
		 *          'base64' (default: 'utf8').
		 *
		 * @return a string representation of the bytes in this buffer.
		 */
		util.DataBuffer.prototype.toString = function(encoding) {
		  var view = new Uint8Array(this.data, this.read, this.length());
		  encoding = encoding || 'utf8';

		  // encode to string
		  if(encoding === 'binary' || encoding === 'raw') {
		    return util.binary.raw.encode(view);
		  }
		  if(encoding === 'hex') {
		    return util.binary.hex.encode(view);
		  }
		  if(encoding === 'base64') {
		    return util.binary.base64.encode(view);
		  }

		  // decode to text
		  if(encoding === 'utf8') {
		    return util.text.utf8.decode(view);
		  }
		  if(encoding === 'utf16') {
		    return util.text.utf16.decode(view);
		  }

		  throw new Error('Invalid encoding: ' + encoding);
		};

		/** End Buffer w/UInt8Array backing */


		/**
		 * Creates a buffer that stores bytes. A value may be given to put into the
		 * buffer that is either a string of bytes or a UTF-16 string that will
		 * be encoded using UTF-8 (to do the latter, specify 'utf8' as the encoding).
		 *
		 * @param [input] the bytes to wrap (as a string) or a UTF-16 string to encode
		 *          as UTF-8.
		 * @param [encoding] (default: 'raw', other: 'utf8').
		 */
		util.createBuffer = function(input, encoding) {
		  // TODO: deprecate, use new ByteBuffer() instead
		  encoding = encoding || 'raw';
		  if(input !== undefined && encoding === 'utf8') {
		    input = util.encodeUtf8(input);
		  }
		  return new util.ByteBuffer(input);
		};

		/**
		 * Fills a string with a particular value. If you want the string to be a byte
		 * string, pass in String.fromCharCode(theByte).
		 *
		 * @param c the character to fill the string with, use String.fromCharCode
		 *          to fill the string with a byte value.
		 * @param n the number of characters of value c to fill with.
		 *
		 * @return the filled string.
		 */
		util.fillString = function(c, n) {
		  var s = '';
		  while(n > 0) {
		    if(n & 1) {
		      s += c;
		    }
		    n >>>= 1;
		    if(n > 0) {
		      c += c;
		    }
		  }
		  return s;
		};

		/**
		 * Performs a per byte XOR between two byte strings and returns the result as a
		 * string of bytes.
		 *
		 * @param s1 first string of bytes.
		 * @param s2 second string of bytes.
		 * @param n the number of bytes to XOR.
		 *
		 * @return the XOR'd result.
		 */
		util.xorBytes = function(s1, s2, n) {
		  var s3 = '';
		  var b = '';
		  var t = '';
		  var i = 0;
		  var c = 0;
		  for(; n > 0; --n, ++i) {
		    b = s1.charCodeAt(i) ^ s2.charCodeAt(i);
		    if(c >= 10) {
		      s3 += t;
		      t = '';
		      c = 0;
		    }
		    t += String.fromCharCode(b);
		    ++c;
		  }
		  s3 += t;
		  return s3;
		};

		/**
		 * Converts a hex string into a 'binary' encoded string of bytes.
		 *
		 * @param hex the hexadecimal string to convert.
		 *
		 * @return the binary-encoded string of bytes.
		 */
		util.hexToBytes = function(hex) {
		  // TODO: deprecate: "Deprecated. Use util.binary.hex.decode instead."
		  var rval = '';
		  var i = 0;
		  if(hex.length & 1 == 1) {
		    // odd number of characters, convert first character alone
		    i = 1;
		    rval += String.fromCharCode(parseInt(hex[0], 16));
		  }
		  // convert 2 characters (1 byte) at a time
		  for(; i < hex.length; i += 2) {
		    rval += String.fromCharCode(parseInt(hex.substr(i, 2), 16));
		  }
		  return rval;
		};

		/**
		 * Converts a 'binary' encoded string of bytes to hex.
		 *
		 * @param bytes the byte string to convert.
		 *
		 * @return the string of hexadecimal characters.
		 */
		util.bytesToHex = function(bytes) {
		  // TODO: deprecate: "Deprecated. Use util.binary.hex.encode instead."
		  return util.createBuffer(bytes).toHex();
		};

		/**
		 * Converts an 32-bit integer to 4-big-endian byte string.
		 *
		 * @param i the integer.
		 *
		 * @return the byte string.
		 */
		util.int32ToBytes = function(i) {
		  return (
		    String.fromCharCode(i >> 24 & 0xFF) +
		    String.fromCharCode(i >> 16 & 0xFF) +
		    String.fromCharCode(i >> 8 & 0xFF) +
		    String.fromCharCode(i & 0xFF));
		};

		// base64 characters, reverse mapping
		var _base64 =
		  'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
		var _base64Idx = [
		/*43 -43 = 0*/
		/*'+',  1,  2,  3,'/' */
		   62, -1, -1, -1, 63,

		/*'0','1','2','3','4','5','6','7','8','9' */
		   52, 53, 54, 55, 56, 57, 58, 59, 60, 61,

		/*15, 16, 17,'=', 19, 20, 21 */
		  -1, -1, -1, 64, -1, -1, -1,

		/*65 - 43 = 22*/
		/*'A','B','C','D','E','F','G','H','I','J','K','L','M', */
		   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12,

		/*'N','O','P','Q','R','S','T','U','V','W','X','Y','Z' */
		   13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,

		/*91 - 43 = 48 */
		/*48, 49, 50, 51, 52, 53 */
		  -1, -1, -1, -1, -1, -1,

		/*97 - 43 = 54*/
		/*'a','b','c','d','e','f','g','h','i','j','k','l','m' */
		   26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38,

		/*'n','o','p','q','r','s','t','u','v','w','x','y','z' */
		   39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51
		];

		/**
		 * Base64 encodes a 'binary' encoded string of bytes.
		 *
		 * @param input the binary encoded string of bytes to base64-encode.
		 * @param maxline the maximum number of encoded characters per line to use,
		 *          defaults to none.
		 *
		 * @return the base64-encoded output.
		 */
		util.encode64 = function(input, maxline) {
		  // TODO: deprecate: "Deprecated. Use util.binary.base64.encode instead."
		  var line = '';
		  var output = '';
		  var chr1, chr2, chr3;
		  var i = 0;
		  while(i < input.length) {
		    chr1 = input.charCodeAt(i++);
		    chr2 = input.charCodeAt(i++);
		    chr3 = input.charCodeAt(i++);

		    // encode 4 character group
		    line += _base64.charAt(chr1 >> 2);
		    line += _base64.charAt(((chr1 & 3) << 4) | (chr2 >> 4));
		    if(isNaN(chr2)) {
		      line += '==';
		    } else {
		      line += _base64.charAt(((chr2 & 15) << 2) | (chr3 >> 6));
		      line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);
		    }

		    if(maxline && line.length > maxline) {
		      output += line.substr(0, maxline) + '\r\n';
		      line = line.substr(maxline);
		    }
		  }
		  output += line;
		  return output;
		};

		/**
		 * Base64 decodes a string into a 'binary' encoded string of bytes.
		 *
		 * @param input the base64-encoded input.
		 *
		 * @return the binary encoded string.
		 */
		util.decode64 = function(input) {
		  // TODO: deprecate: "Deprecated. Use util.binary.base64.decode instead."

		  // remove all non-base64 characters
		  input = input.replace(/[^A-Za-z0-9\+\/\=]/g, '');

		  var output = '';
		  var enc1, enc2, enc3, enc4;
		  var i = 0;

		  while(i < input.length) {
		    enc1 = _base64Idx[input.charCodeAt(i++) - 43];
		    enc2 = _base64Idx[input.charCodeAt(i++) - 43];
		    enc3 = _base64Idx[input.charCodeAt(i++) - 43];
		    enc4 = _base64Idx[input.charCodeAt(i++) - 43];

		    output += String.fromCharCode((enc1 << 2) | (enc2 >> 4));
		    if(enc3 !== 64) {
		      // decoded at least 2 bytes
		      output += String.fromCharCode(((enc2 & 15) << 4) | (enc3 >> 2));
		      if(enc4 !== 64) {
		        // decoded 3 bytes
		        output += String.fromCharCode(((enc3 & 3) << 6) | enc4);
		      }
		    }
		  }

		  return output;
		};

		/**
		 * UTF-8 encodes the given UTF-16 encoded string (a standard JavaScript
		 * string). Non-ASCII characters will be encoded as multiple bytes according
		 * to UTF-8.
		 *
		 * @param str the string to encode.
		 *
		 * @return the UTF-8 encoded string.
		 */
		util.encodeUtf8 = function(str) {
		  return unescape(encodeURIComponent(str));
		};

		/**
		 * Decodes a UTF-8 encoded string into a UTF-16 string.
		 *
		 * @param str the string to decode.
		 *
		 * @return the UTF-16 encoded string (standard JavaScript string).
		 */
		util.decodeUtf8 = function(str) {
		  return decodeURIComponent(escape(str));
		};

		// binary encoding/decoding tools
		// FIXME: Experimental. Do not use yet.
		util.binary = {
		  raw: {},
		  hex: {},
		  base64: {}
		};

		/**
		 * Encodes a Uint8Array as a binary-encoded string. This encoding uses
		 * a value between 0 and 255 for each character.
		 *
		 * @param bytes the Uint8Array to encode.
		 *
		 * @return the binary-encoded string.
		 */
		util.binary.raw.encode = function(bytes) {
		  return String.fromCharCode.apply(null, bytes);
		};

		/**
		 * Decodes a binary-encoded string to a Uint8Array. This encoding uses
		 * a value between 0 and 255 for each character.
		 *
		 * @param str the binary-encoded string to decode.
		 * @param [output] an optional Uint8Array to write the output to; if it
		 *          is too small, an exception will be thrown.
		 * @param [offset] the start offset for writing to the output (default: 0).
		 *
		 * @return the Uint8Array or the number of bytes written if output was given.
		 */
		util.binary.raw.decode = function(str, output, offset) {
		  var out = output;
		  if(!out) {
		    out = new Uint8Array(str.length);
		  }
		  offset = offset || 0;
		  var j = offset;
		  for(var i = 0; i < str.length; ++i) {
		    out[j++] = str.charCodeAt(i);
		  }
		  return output ? (j - offset) : out;
		};

		/**
		 * Encodes a 'binary' string, ArrayBuffer, DataView, TypedArray, or
		 * ByteBuffer as a string of hexadecimal characters.
		 *
		 * @param bytes the bytes to convert.
		 *
		 * @return the string of hexadecimal characters.
		 */
		util.binary.hex.encode = util.bytesToHex;

		/**
		 * Decodes a hex-encoded string to a Uint8Array.
		 *
		 * @param hex the hexadecimal string to convert.
		 * @param [output] an optional Uint8Array to write the output to; if it
		 *          is too small, an exception will be thrown.
		 * @param [offset] the start offset for writing to the output (default: 0).
		 *
		 * @return the Uint8Array or the number of bytes written if output was given.
		 */
		util.binary.hex.decode = function(hex, output, offset) {
		  var out = output;
		  if(!out) {
		    out = new Uint8Array(Math.ceil(hex.length / 2));
		  }
		  offset = offset || 0;
		  var i = 0, j = offset;
		  if(hex.length & 1) {
		    // odd number of characters, convert first character alone
		    i = 1;
		    out[j++] = parseInt(hex[0], 16);
		  }
		  // convert 2 characters (1 byte) at a time
		  for(; i < hex.length; i += 2) {
		    out[j++] = parseInt(hex.substr(i, 2), 16);
		  }
		  return output ? (j - offset) : out;
		};

		/**
		 * Base64-encodes a Uint8Array.
		 *
		 * @param input the Uint8Array to encode.
		 * @param maxline the maximum number of encoded characters per line to use,
		 *          defaults to none.
		 *
		 * @return the base64-encoded output string.
		 */
		util.binary.base64.encode = function(input, maxline) {
		  var line = '';
		  var output = '';
		  var chr1, chr2, chr3;
		  var i = 0;
		  while(i < input.byteLength) {
		    chr1 = input[i++];
		    chr2 = input[i++];
		    chr3 = input[i++];

		    // encode 4 character group
		    line += _base64.charAt(chr1 >> 2);
		    line += _base64.charAt(((chr1 & 3) << 4) | (chr2 >> 4));
		    if(isNaN(chr2)) {
		      line += '==';
		    } else {
		      line += _base64.charAt(((chr2 & 15) << 2) | (chr3 >> 6));
		      line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);
		    }

		    if(maxline && line.length > maxline) {
		      output += line.substr(0, maxline) + '\r\n';
		      line = line.substr(maxline);
		    }
		  }
		  output += line;
		  return output;
		};

		/**
		 * Decodes a base64-encoded string to a Uint8Array.
		 *
		 * @param input the base64-encoded input string.
		 * @param [output] an optional Uint8Array to write the output to; if it
		 *          is too small, an exception will be thrown.
		 * @param [offset] the start offset for writing to the output (default: 0).
		 *
		 * @return the Uint8Array or the number of bytes written if output was given.
		 */
		util.binary.base64.decode = function(input, output, offset) {
		  var out = output;
		  if(!out) {
		    out = new Uint8Array(Math.ceil(input.length / 4) * 3);
		  }

		  // remove all non-base64 characters
		  input = input.replace(/[^A-Za-z0-9\+\/\=]/g, '');

		  offset = offset || 0;
		  var enc1, enc2, enc3, enc4;
		  var i = 0, j = offset;

		  while(i < input.length) {
		    enc1 = _base64Idx[input.charCodeAt(i++) - 43];
		    enc2 = _base64Idx[input.charCodeAt(i++) - 43];
		    enc3 = _base64Idx[input.charCodeAt(i++) - 43];
		    enc4 = _base64Idx[input.charCodeAt(i++) - 43];

		    out[j++] = (enc1 << 2) | (enc2 >> 4);
		    if(enc3 !== 64) {
		      // decoded at least 2 bytes
		      out[j++] = ((enc2 & 15) << 4) | (enc3 >> 2);
		      if(enc4 !== 64) {
		        // decoded 3 bytes
		        out[j++] = ((enc3 & 3) << 6) | enc4;
		      }
		    }
		  }

		  // make sure result is the exact decoded length
		  return output ?
		         (j - offset) :
		         out.subarray(0, j);
		};

		// text encoding/decoding tools
		// FIXME: Experimental. Do not use yet.
		util.text = {
		  utf8: {},
		  utf16: {}
		};

		/**
		 * Encodes the given string as UTF-8 in a Uint8Array.
		 *
		 * @param str the string to encode.
		 * @param [output] an optional Uint8Array to write the output to; if it
		 *          is too small, an exception will be thrown.
		 * @param [offset] the start offset for writing to the output (default: 0).
		 *
		 * @return the Uint8Array or the number of bytes written if output was given.
		 */
		util.text.utf8.encode = function(str, output, offset) {
		  str = util.encodeUtf8(str);
		  var out = output;
		  if(!out) {
		    out = new Uint8Array(str.length);
		  }
		  offset = offset || 0;
		  var j = offset;
		  for(var i = 0; i < str.length; ++i) {
		    out[j++] = str.charCodeAt(i);
		  }
		  return output ? (j - offset) : out;
		};

		/**
		 * Decodes the UTF-8 contents from a Uint8Array.
		 *
		 * @param bytes the Uint8Array to decode.
		 *
		 * @return the resulting string.
		 */
		util.text.utf8.decode = function(bytes) {
		  return util.decodeUtf8(String.fromCharCode.apply(null, bytes));
		};

		/**
		 * Encodes the given string as UTF-16 in a Uint8Array.
		 *
		 * @param str the string to encode.
		 * @param [output] an optional Uint8Array to write the output to; if it
		 *          is too small, an exception will be thrown.
		 * @param [offset] the start offset for writing to the output (default: 0).
		 *
		 * @return the Uint8Array or the number of bytes written if output was given.
		 */
		util.text.utf16.encode = function(str, output, offset) {
		  var out = output;
		  if(!out) {
		    out = new Uint8Array(str.length * 2);
		  }
		  var view = new Uint16Array(out.buffer);
		  offset = offset || 0;
		  var j = offset;
		  var k = offset;
		  for(var i = 0; i < str.length; ++i) {
		    view[k++] = str.charCodeAt(i);
		    j += 2;
		  }
		  return output ? (j - offset) : out;
		};

		/**
		 * Decodes the UTF-16 contents from a Uint8Array.
		 *
		 * @param bytes the Uint8Array to decode.
		 *
		 * @return the resulting string.
		 */
		util.text.utf16.decode = function(bytes) {
		  return String.fromCharCode.apply(null, new Uint16Array(bytes.buffer));
		};

		/**
		 * Deflates the given data using a flash interface.
		 *
		 * @param api the flash interface.
		 * @param bytes the data.
		 * @param raw true to return only raw deflate data, false to include zlib
		 *          header and trailer.
		 *
		 * @return the deflated data as a string.
		 */
		util.deflate = function(api, bytes, raw) {
		  bytes = util.decode64(api.deflate(util.encode64(bytes)).rval);

		  // strip zlib header and trailer if necessary
		  if(raw) {
		    // zlib header is 2 bytes (CMF,FLG) where FLG indicates that
		    // there is a 4-byte DICT (alder-32) block before the data if
		    // its 5th bit is set
		    var start = 2;
		    var flg = bytes.charCodeAt(1);
		    if(flg & 0x20) {
		      start = 6;
		    }
		    // zlib trailer is 4 bytes of adler-32
		    bytes = bytes.substring(start, bytes.length - 4);
		  }

		  return bytes;
		};

		/**
		 * Inflates the given data using a flash interface.
		 *
		 * @param api the flash interface.
		 * @param bytes the data.
		 * @param raw true if the incoming data has no zlib header or trailer and is
		 *          raw DEFLATE data.
		 *
		 * @return the inflated data as a string, null on error.
		 */
		util.inflate = function(api, bytes, raw) {
		  // TODO: add zlib header and trailer if necessary/possible
		  var rval = api.inflate(util.encode64(bytes)).rval;
		  return (rval === null) ? null : util.decode64(rval);
		};

		/**
		 * Sets a storage object.
		 *
		 * @param api the storage interface.
		 * @param id the storage ID to use.
		 * @param obj the storage object, null to remove.
		 */
		var _setStorageObject = function(api, id, obj) {
		  if(!api) {
		    throw new Error('WebStorage not available.');
		  }

		  var rval;
		  if(obj === null) {
		    rval = api.removeItem(id);
		  } else {
		    // json-encode and base64-encode object
		    obj = util.encode64(JSON.stringify(obj));
		    rval = api.setItem(id, obj);
		  }

		  // handle potential flash error
		  if(typeof(rval) !== 'undefined' && rval.rval !== true) {
		    var error = new Error(rval.error.message);
		    error.id = rval.error.id;
		    error.name = rval.error.name;
		    throw error;
		  }
		};

		/**
		 * Gets a storage object.
		 *
		 * @param api the storage interface.
		 * @param id the storage ID to use.
		 *
		 * @return the storage object entry or null if none exists.
		 */
		var _getStorageObject = function(api, id) {
		  if(!api) {
		    throw new Error('WebStorage not available.');
		  }

		  // get the existing entry
		  var rval = api.getItem(id);

		  /* Note: We check api.init because we can't do (api == localStorage)
		    on IE because of "Class doesn't support Automation" exception. Only
		    the flash api has an init method so this works too, but we need a
		    better solution in the future. */

		  // flash returns item wrapped in an object, handle special case
		  if(api.init) {
		    if(rval.rval === null) {
		      if(rval.error) {
		        var error = new Error(rval.error.message);
		        error.id = rval.error.id;
		        error.name = rval.error.name;
		        throw error;
		      }
		      // no error, but also no item
		      rval = null;
		    } else {
		      rval = rval.rval;
		    }
		  }

		  // handle decoding
		  if(rval !== null) {
		    // base64-decode and json-decode data
		    rval = JSON.parse(util.decode64(rval));
		  }

		  return rval;
		};

		/**
		 * Stores an item in local storage.
		 *
		 * @param api the storage interface.
		 * @param id the storage ID to use.
		 * @param key the key for the item.
		 * @param data the data for the item (any javascript object/primitive).
		 */
		var _setItem = function(api, id, key, data) {
		  // get storage object
		  var obj = _getStorageObject(api, id);
		  if(obj === null) {
		    // create a new storage object
		    obj = {};
		  }
		  // update key
		  obj[key] = data;

		  // set storage object
		  _setStorageObject(api, id, obj);
		};

		/**
		 * Gets an item from local storage.
		 *
		 * @param api the storage interface.
		 * @param id the storage ID to use.
		 * @param key the key for the item.
		 *
		 * @return the item.
		 */
		var _getItem = function(api, id, key) {
		  // get storage object
		  var rval = _getStorageObject(api, id);
		  if(rval !== null) {
		    // return data at key
		    rval = (key in rval) ? rval[key] : null;
		  }

		  return rval;
		};

		/**
		 * Removes an item from local storage.
		 *
		 * @param api the storage interface.
		 * @param id the storage ID to use.
		 * @param key the key for the item.
		 */
		var _removeItem = function(api, id, key) {
		  // get storage object
		  var obj = _getStorageObject(api, id);
		  if(obj !== null && key in obj) {
		    // remove key
		    delete obj[key];

		    // see if entry has no keys remaining
		    var empty = true;
		    for(var prop in obj) {
		      empty = false;
		      break;
		    }
		    if(empty) {
		      // remove entry entirely if no keys are left
		      obj = null;
		    }

		    // set storage object
		    _setStorageObject(api, id, obj);
		  }
		};

		/**
		 * Clears the local disk storage identified by the given ID.
		 *
		 * @param api the storage interface.
		 * @param id the storage ID to use.
		 */
		var _clearItems = function(api, id) {
		  _setStorageObject(api, id, null);
		};

		/**
		 * Calls a storage function.
		 *
		 * @param func the function to call.
		 * @param args the arguments for the function.
		 * @param location the location argument.
		 *
		 * @return the return value from the function.
		 */
		var _callStorageFunction = function(func, args, location) {
		  var rval = null;

		  // default storage types
		  if(typeof(location) === 'undefined') {
		    location = ['web', 'flash'];
		  }

		  // apply storage types in order of preference
		  var type;
		  var done = false;
		  var exception = null;
		  for(var idx in location) {
		    type = location[idx];
		    try {
		      if(type === 'flash' || type === 'both') {
		        if(args[0] === null) {
		          throw new Error('Flash local storage not available.');
		        }
		        rval = func.apply(this, args);
		        done = (type === 'flash');
		      }
		      if(type === 'web' || type === 'both') {
		        args[0] = localStorage;
		        rval = func.apply(this, args);
		        done = true;
		      }
		    } catch(ex) {
		      exception = ex;
		    }
		    if(done) {
		      break;
		    }
		  }

		  if(!done) {
		    throw exception;
		  }

		  return rval;
		};

		/**
		 * Stores an item on local disk.
		 *
		 * The available types of local storage include 'flash', 'web', and 'both'.
		 *
		 * The type 'flash' refers to flash local storage (SharedObject). In order
		 * to use flash local storage, the 'api' parameter must be valid. The type
		 * 'web' refers to WebStorage, if supported by the browser. The type 'both'
		 * refers to storing using both 'flash' and 'web', not just one or the
		 * other.
		 *
		 * The location array should list the storage types to use in order of
		 * preference:
		 *
		 * ['flash']: flash only storage
		 * ['web']: web only storage
		 * ['both']: try to store in both
		 * ['flash','web']: store in flash first, but if not available, 'web'
		 * ['web','flash']: store in web first, but if not available, 'flash'
		 *
		 * The location array defaults to: ['web', 'flash']
		 *
		 * @param api the flash interface, null to use only WebStorage.
		 * @param id the storage ID to use.
		 * @param key the key for the item.
		 * @param data the data for the item (any javascript object/primitive).
		 * @param location an array with the preferred types of storage to use.
		 */
		util.setItem = function(api, id, key, data, location) {
		  _callStorageFunction(_setItem, arguments, location);
		};

		/**
		 * Gets an item on local disk.
		 *
		 * Set setItem() for details on storage types.
		 *
		 * @param api the flash interface, null to use only WebStorage.
		 * @param id the storage ID to use.
		 * @param key the key for the item.
		 * @param location an array with the preferred types of storage to use.
		 *
		 * @return the item.
		 */
		util.getItem = function(api, id, key, location) {
		  return _callStorageFunction(_getItem, arguments, location);
		};

		/**
		 * Removes an item on local disk.
		 *
		 * Set setItem() for details on storage types.
		 *
		 * @param api the flash interface.
		 * @param id the storage ID to use.
		 * @param key the key for the item.
		 * @param location an array with the preferred types of storage to use.
		 */
		util.removeItem = function(api, id, key, location) {
		  _callStorageFunction(_removeItem, arguments, location);
		};

		/**
		 * Clears the local disk storage identified by the given ID.
		 *
		 * Set setItem() for details on storage types.
		 *
		 * @param api the flash interface if flash is available.
		 * @param id the storage ID to use.
		 * @param location an array with the preferred types of storage to use.
		 */
		util.clearItems = function(api, id, location) {
		  _callStorageFunction(_clearItems, arguments, location);
		};

		/**
		 * Parses the scheme, host, and port from an http(s) url.
		 *
		 * @param str the url string.
		 *
		 * @return the parsed url object or null if the url is invalid.
		 */
		util.parseUrl = function(str) {
		  // FIXME: this regex looks a bit broken
		  var regex = /^(https?):\/\/([^:&^\/]*):?(\d*)(.*)$/g;
		  regex.lastIndex = 0;
		  var m = regex.exec(str);
		  var url = (m === null) ? null : {
		    full: str,
		    scheme: m[1],
		    host: m[2],
		    port: m[3],
		    path: m[4]
		  };
		  if(url) {
		    url.fullHost = url.host;
		    if(url.port) {
		      if(url.port !== 80 && url.scheme === 'http') {
		        url.fullHost += ':' + url.port;
		      } else if(url.port !== 443 && url.scheme === 'https') {
		        url.fullHost += ':' + url.port;
		      }
		    } else if(url.scheme === 'http') {
		      url.port = 80;
		    } else if(url.scheme === 'https') {
		      url.port = 443;
		    }
		    url.full = url.scheme + '://' + url.fullHost;
		  }
		  return url;
		};

		/* Storage for query variables */
		var _queryVariables = null;

		/**
		 * Returns the window location query variables. Query is parsed on the first
		 * call and the same object is returned on subsequent calls. The mapping
		 * is from keys to an array of values. Parameters without values will have
		 * an object key set but no value added to the value array. Values are
		 * unescaped.
		 *
		 * ...?k1=v1&k2=v2:
		 * {
		 *   "k1": ["v1"],
		 *   "k2": ["v2"]
		 * }
		 *
		 * ...?k1=v1&k1=v2:
		 * {
		 *   "k1": ["v1", "v2"]
		 * }
		 *
		 * ...?k1=v1&k2:
		 * {
		 *   "k1": ["v1"],
		 *   "k2": []
		 * }
		 *
		 * ...?k1=v1&k1:
		 * {
		 *   "k1": ["v1"]
		 * }
		 *
		 * ...?k1&k1:
		 * {
		 *   "k1": []
		 * }
		 *
		 * @param query the query string to parse (optional, default to cached
		 *          results from parsing window location search query).
		 *
		 * @return object mapping keys to variables.
		 */
		util.getQueryVariables = function(query) {
		  var parse = function(q) {
		    var rval = {};
		    var kvpairs = q.split('&');
		    for(var i = 0; i < kvpairs.length; i++) {
		      var pos = kvpairs[i].indexOf('=');
		      var key;
		      var val;
		      if(pos > 0) {
		        key = kvpairs[i].substring(0, pos);
		        val = kvpairs[i].substring(pos + 1);
		      } else {
		        key = kvpairs[i];
		        val = null;
		      }
		      if(!(key in rval)) {
		        rval[key] = [];
		      }
		      // disallow overriding object prototype keys
		      if(!(key in Object.prototype) && val !== null) {
		        rval[key].push(unescape(val));
		      }
		    }
		    return rval;
		  };

		   var rval;
		   if(typeof(query) === 'undefined') {
		     // set cached variables if needed
		     if(_queryVariables === null) {
		       if(typeof(window) !== 'undefined' && window.location && window.location.search) {
		          // parse window search query
		          _queryVariables = parse(window.location.search.substring(1));
		       } else {
		          // no query variables available
		          _queryVariables = {};
		       }
		     }
		     rval = _queryVariables;
		   } else {
		     // parse given query
		     rval = parse(query);
		   }
		   return rval;
		};

		/**
		 * Parses a fragment into a path and query. This method will take a URI
		 * fragment and break it up as if it were the main URI. For example:
		 *    /bar/baz?a=1&b=2
		 * results in:
		 *    {
		 *       path: ["bar", "baz"],
		 *       query: {"k1": ["v1"], "k2": ["v2"]}
		 *    }
		 *
		 * @return object with a path array and query object.
		 */
		util.parseFragment = function(fragment) {
		  // default to whole fragment
		  var fp = fragment;
		  var fq = '';
		  // split into path and query if possible at the first '?'
		  var pos = fragment.indexOf('?');
		  if(pos > 0) {
		    fp = fragment.substring(0, pos);
		    fq = fragment.substring(pos + 1);
		  }
		  // split path based on '/' and ignore first element if empty
		  var path = fp.split('/');
		  if(path.length > 0 && path[0] === '') {
		    path.shift();
		  }
		  // convert query into object
		  var query = (fq === '') ? {} : util.getQueryVariables(fq);

		  return {
		    pathString: fp,
		    queryString: fq,
		    path: path,
		    query: query
		  };
		};

		/**
		 * Makes a request out of a URI-like request string. This is intended to
		 * be used where a fragment id (after a URI '#') is parsed as a URI with
		 * path and query parts. The string should have a path beginning and
		 * delimited by '/' and optional query parameters following a '?'. The
		 * query should be a standard URL set of key value pairs delimited by
		 * '&'. For backwards compatibility the initial '/' on the path is not
		 * required. The request object has the following API, (fully described
		 * in the method code):
		 *    {
		 *       path: <the path string part>.
		 *       query: <the query string part>,
		 *       getPath(i): get part or all of the split path array,
		 *       getQuery(k, i): get part or all of a query key array,
		 *       getQueryLast(k, _default): get last element of a query key array.
		 *    }
		 *
		 * @return object with request parameters.
		 */
		util.makeRequest = function(reqString) {
		  var frag = util.parseFragment(reqString);
		  var req = {
		    // full path string
		    path: frag.pathString,
		    // full query string
		    query: frag.queryString,
		    /**
		     * Get path or element in path.
		     *
		     * @param i optional path index.
		     *
		     * @return path or part of path if i provided.
		     */
		    getPath: function(i) {
		      return (typeof(i) === 'undefined') ? frag.path : frag.path[i];
		    },
		    /**
		     * Get query, values for a key, or value for a key index.
		     *
		     * @param k optional query key.
		     * @param i optional query key index.
		     *
		     * @return query, values for a key, or value for a key index.
		     */
		    getQuery: function(k, i) {
		      var rval;
		      if(typeof(k) === 'undefined') {
		        rval = frag.query;
		      } else {
		        rval = frag.query[k];
		        if(rval && typeof(i) !== 'undefined') {
		           rval = rval[i];
		        }
		      }
		      return rval;
		    },
		    getQueryLast: function(k, _default) {
		      var rval;
		      var vals = req.getQuery(k);
		      if(vals) {
		        rval = vals[vals.length - 1];
		      } else {
		        rval = _default;
		      }
		      return rval;
		    }
		  };
		  return req;
		};

		/**
		 * Makes a URI out of a path, an object with query parameters, and a
		 * fragment. Uses jQuery.param() internally for query string creation.
		 * If the path is an array, it will be joined with '/'.
		 *
		 * @param path string path or array of strings.
		 * @param query object with query parameters. (optional)
		 * @param fragment fragment string. (optional)
		 *
		 * @return string object with request parameters.
		 */
		util.makeLink = function(path, query, fragment) {
		  // join path parts if needed
		  path = jQuery.isArray(path) ? path.join('/') : path;

		  var qstr = jQuery.param(query || {});
		  fragment = fragment || '';
		  return path +
		    ((qstr.length > 0) ? ('?' + qstr) : '') +
		    ((fragment.length > 0) ? ('#' + fragment) : '');
		};

		/**
		 * Follows a path of keys deep into an object hierarchy and set a value.
		 * If a key does not exist or it's value is not an object, create an
		 * object in it's place. This can be destructive to a object tree if
		 * leaf nodes are given as non-final path keys.
		 * Used to avoid exceptions from missing parts of the path.
		 *
		 * @param object the starting object.
		 * @param keys an array of string keys.
		 * @param value the value to set.
		 */
		util.setPath = function(object, keys, value) {
		  // need to start at an object
		  if(typeof(object) === 'object' && object !== null) {
		    var i = 0;
		    var len = keys.length;
		    while(i < len) {
		      var next = keys[i++];
		      if(i == len) {
		        // last
		        object[next] = value;
		      } else {
		        // more
		        var hasNext = (next in object);
		        if(!hasNext ||
		          (hasNext && typeof(object[next]) !== 'object') ||
		          (hasNext && object[next] === null)) {
		          object[next] = {};
		        }
		        object = object[next];
		      }
		    }
		  }
		};

		/**
		 * Follows a path of keys deep into an object hierarchy and return a value.
		 * If a key does not exist, create an object in it's place.
		 * Used to avoid exceptions from missing parts of the path.
		 *
		 * @param object the starting object.
		 * @param keys an array of string keys.
		 * @param _default value to return if path not found.
		 *
		 * @return the value at the path if found, else default if given, else
		 *         undefined.
		 */
		util.getPath = function(object, keys, _default) {
		  var i = 0;
		  var len = keys.length;
		  var hasNext = true;
		  while(hasNext && i < len &&
		    typeof(object) === 'object' && object !== null) {
		    var next = keys[i++];
		    hasNext = next in object;
		    if(hasNext) {
		      object = object[next];
		    }
		  }
		  return (hasNext ? object : _default);
		};

		/**
		 * Follow a path of keys deep into an object hierarchy and delete the
		 * last one. If a key does not exist, do nothing.
		 * Used to avoid exceptions from missing parts of the path.
		 *
		 * @param object the starting object.
		 * @param keys an array of string keys.
		 */
		util.deletePath = function(object, keys) {
		  // need to start at an object
		  if(typeof(object) === 'object' && object !== null) {
		    var i = 0;
		    var len = keys.length;
		    while(i < len) {
		      var next = keys[i++];
		      if(i == len) {
		        // last
		        delete object[next];
		      } else {
		        // more
		        if(!(next in object) ||
		          (typeof(object[next]) !== 'object') ||
		          (object[next] === null)) {
		           break;
		        }
		        object = object[next];
		      }
		    }
		  }
		};

		/**
		 * Check if an object is empty.
		 *
		 * Taken from:
		 * http://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object-from-json/679937#679937
		 *
		 * @param object the object to check.
		 */
		util.isEmpty = function(obj) {
		  for(var prop in obj) {
		    if(obj.hasOwnProperty(prop)) {
		      return false;
		    }
		  }
		  return true;
		};

		/**
		 * Format with simple printf-style interpolation.
		 *
		 * %%: literal '%'
		 * %s,%o: convert next argument into a string.
		 *
		 * @param format the string to format.
		 * @param ... arguments to interpolate into the format string.
		 */
		util.format = function(format) {
		  var re = /%./g;
		  // current match
		  var match;
		  // current part
		  var part;
		  // current arg index
		  var argi = 0;
		  // collected parts to recombine later
		  var parts = [];
		  // last index found
		  var last = 0;
		  // loop while matches remain
		  while((match = re.exec(format))) {
		    part = format.substring(last, re.lastIndex - 2);
		    // don't add empty strings (ie, parts between %s%s)
		    if(part.length > 0) {
		      parts.push(part);
		    }
		    last = re.lastIndex;
		    // switch on % code
		    var code = match[0][1];
		    switch(code) {
		    case 's':
		    case 'o':
		      // check if enough arguments were given
		      if(argi < arguments.length) {
		        parts.push(arguments[argi++ + 1]);
		      } else {
		        parts.push('<?>');
		      }
		      break;
		    // FIXME: do proper formating for numbers, etc
		    //case 'f':
		    //case 'd':
		    case '%':
		      parts.push('%');
		      break;
		    default:
		      parts.push('<%' + code + '?>');
		    }
		  }
		  // add trailing part of format string
		  parts.push(format.substring(last));
		  return parts.join('');
		};

		/**
		 * Formats a number.
		 *
		 * http://snipplr.com/view/5945/javascript-numberformat--ported-from-php/
		 */
		util.formatNumber = function(number, decimals, dec_point, thousands_sep) {
		  // http://kevin.vanzonneveld.net
		  // +   original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)
		  // +   improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
		  // +     bugfix by: Michael White (http://crestidg.com)
		  // +     bugfix by: Benjamin Lupton
		  // +     bugfix by: Allan Jensen (http://www.winternet.no)
		  // +    revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)
		  // *     example 1: number_format(1234.5678, 2, '.', '');
		  // *     returns 1: 1234.57

		  var n = number, c = isNaN(decimals = Math.abs(decimals)) ? 2 : decimals;
		  var d = dec_point === undefined ? ',' : dec_point;
		  var t = thousands_sep === undefined ?
		   '.' : thousands_sep, s = n < 0 ? '-' : '';
		  var i = parseInt((n = Math.abs(+n || 0).toFixed(c)), 10) + '';
		  var j = (i.length > 3) ? i.length % 3 : 0;
		  return s + (j ? i.substr(0, j) + t : '') +
		    i.substr(j).replace(/(\d{3})(?=\d)/g, '$1' + t) +
		    (c ? d + Math.abs(n - i).toFixed(c).slice(2) : '');
		};

		/**
		 * Formats a byte size.
		 *
		 * http://snipplr.com/view/5949/format-humanize-file-byte-size-presentation-in-javascript/
		 */
		util.formatSize = function(size) {
		  if(size >= 1073741824) {
		    size = util.formatNumber(size / 1073741824, 2, '.', '') + ' GiB';
		  } else if(size >= 1048576) {
		    size = util.formatNumber(size / 1048576, 2, '.', '') + ' MiB';
		  } else if(size >= 1024) {
		    size = util.formatNumber(size / 1024, 0) + ' KiB';
		  } else {
		    size = util.formatNumber(size, 0) + ' bytes';
		  }
		  return size;
		};

		/**
		 * Converts an IPv4 or IPv6 string representation into bytes (in network order).
		 *
		 * @param ip the IPv4 or IPv6 address to convert.
		 *
		 * @return the 4-byte IPv6 or 16-byte IPv6 address or null if the address can't
		 *         be parsed.
		 */
		util.bytesFromIP = function(ip) {
		  if(ip.indexOf('.') !== -1) {
		    return util.bytesFromIPv4(ip);
		  }
		  if(ip.indexOf(':') !== -1) {
		    return util.bytesFromIPv6(ip);
		  }
		  return null;
		};

		/**
		 * Converts an IPv4 string representation into bytes (in network order).
		 *
		 * @param ip the IPv4 address to convert.
		 *
		 * @return the 4-byte address or null if the address can't be parsed.
		 */
		util.bytesFromIPv4 = function(ip) {
		  ip = ip.split('.');
		  if(ip.length !== 4) {
		    return null;
		  }
		  var b = util.createBuffer();
		  for(var i = 0; i < ip.length; ++i) {
		    var num = parseInt(ip[i], 10);
		    if(isNaN(num)) {
		      return null;
		    }
		    b.putByte(num);
		  }
		  return b.getBytes();
		};

		/**
		 * Converts an IPv6 string representation into bytes (in network order).
		 *
		 * @param ip the IPv6 address to convert.
		 *
		 * @return the 16-byte address or null if the address can't be parsed.
		 */
		util.bytesFromIPv6 = function(ip) {
		  var blanks = 0;
		  ip = ip.split(':').filter(function(e) {
		    if(e.length === 0) ++blanks;
		    return true;
		  });
		  var zeros = (8 - ip.length + blanks) * 2;
		  var b = util.createBuffer();
		  for(var i = 0; i < 8; ++i) {
		    if(!ip[i] || ip[i].length === 0) {
		      b.fillWithByte(0, zeros);
		      zeros = 0;
		      continue;
		    }
		    var bytes = util.hexToBytes(ip[i]);
		    if(bytes.length < 2) {
		      b.putByte(0);
		    }
		    b.putBytes(bytes);
		  }
		  return b.getBytes();
		};

		/**
		 * Converts 4-bytes into an IPv4 string representation or 16-bytes into
		 * an IPv6 string representation. The bytes must be in network order.
		 *
		 * @param bytes the bytes to convert.
		 *
		 * @return the IPv4 or IPv6 string representation if 4 or 16 bytes,
		 *         respectively, are given, otherwise null.
		 */
		util.bytesToIP = function(bytes) {
		  if(bytes.length === 4) {
		    return util.bytesToIPv4(bytes);
		  }
		  if(bytes.length === 16) {
		    return util.bytesToIPv6(bytes);
		  }
		  return null;
		};

		/**
		 * Converts 4-bytes into an IPv4 string representation. The bytes must be
		 * in network order.
		 *
		 * @param bytes the bytes to convert.
		 *
		 * @return the IPv4 string representation or null for an invalid # of bytes.
		 */
		util.bytesToIPv4 = function(bytes) {
		  if(bytes.length !== 4) {
		    return null;
		  }
		  var ip = [];
		  for(var i = 0; i < bytes.length; ++i) {
		    ip.push(bytes.charCodeAt(i));
		  }
		  return ip.join('.');
		};

		/**
		 * Converts 16-bytes into an IPv16 string representation. The bytes must be
		 * in network order.
		 *
		 * @param bytes the bytes to convert.
		 *
		 * @return the IPv16 string representation or null for an invalid # of bytes.
		 */
		util.bytesToIPv6 = function(bytes) {
		  if(bytes.length !== 16) {
		    return null;
		  }
		  var ip = [];
		  var zeroGroups = [];
		  var zeroMaxGroup = 0;
		  for(var i = 0; i < bytes.length; i += 2) {
		    var hex = util.bytesToHex(bytes[i] + bytes[i + 1]);
		    // canonicalize zero representation
		    while(hex[0] === '0' && hex !== '0') {
		      hex = hex.substr(1);
		    }
		    if(hex === '0') {
		      var last = zeroGroups[zeroGroups.length - 1];
		      var idx = ip.length;
		      if(!last || idx !== last.end + 1) {
		        zeroGroups.push({start: idx, end: idx});
		      } else {
		        last.end = idx;
		        if((last.end - last.start) >
		          (zeroGroups[zeroMaxGroup].end - zeroGroups[zeroMaxGroup].start)) {
		          zeroMaxGroup = zeroGroups.length - 1;
		        }
		      }
		    }
		    ip.push(hex);
		  }
		  if(zeroGroups.length > 0) {
		    var group = zeroGroups[zeroMaxGroup];
		    // only shorten group of length > 0
		    if(group.end - group.start > 0) {
		      ip.splice(group.start, group.end - group.start + 1, '');
		      if(group.start === 0) {
		        ip.unshift('');
		      }
		      if(group.end === 7) {
		        ip.push('');
		      }
		    }
		  }
		  return ip.join(':');
		};

		/**
		 * Estimates the number of processes that can be run concurrently. If
		 * creating Web Workers, keep in mind that the main JavaScript process needs
		 * its own core.
		 *
		 * @param options the options to use:
		 *          update true to force an update (not use the cached value).
		 * @param callback(err, max) called once the operation completes.
		 */
		util.estimateCores = function(options, callback) {
		  if(typeof options === 'function') {
		    callback = options;
		    options = {};
		  }
		  options = options || {};
		  if('cores' in util && !options.update) {
		    return callback(null, util.cores);
		  }
		  if(typeof navigator !== 'undefined' &&
		    'hardwareConcurrency' in navigator &&
		    navigator.hardwareConcurrency > 0) {
		    util.cores = navigator.hardwareConcurrency;
		    return callback(null, util.cores);
		  }
		  if(typeof Worker === 'undefined') {
		    // workers not available
		    util.cores = 1;
		    return callback(null, util.cores);
		  }
		  if(typeof Blob === 'undefined') {
		    // can't estimate, default to 2
		    util.cores = 2;
		    return callback(null, util.cores);
		  }

		  // create worker concurrency estimation code as blob
		  var blobUrl = URL.createObjectURL(new Blob(['(',
		    function() {
		      self.addEventListener('message', function(e) {
		        // run worker for 4 ms
		        var st = Date.now();
		        var et = st + 4;
		        while(Date.now() < et);
		        self.postMessage({st: st, et: et});
		      });
		    }.toString(),
		  ')()'], {type: 'application/javascript'}));

		  // take 5 samples using 16 workers
		  sample([], 5, 16);

		  function sample(max, samples, numWorkers) {
		    if(samples === 0) {
		      // get overlap average
		      var avg = Math.floor(max.reduce(function(avg, x) {
		        return avg + x;
		      }, 0) / max.length);
		      util.cores = Math.max(1, avg);
		      URL.revokeObjectURL(blobUrl);
		      return callback(null, util.cores);
		    }
		    map(numWorkers, function(err, results) {
		      max.push(reduce(numWorkers, results));
		      sample(max, samples - 1, numWorkers);
		    });
		  }

		  function map(numWorkers, callback) {
		    var workers = [];
		    var results = [];
		    for(var i = 0; i < numWorkers; ++i) {
		      var worker = new Worker(blobUrl);
		      worker.addEventListener('message', function(e) {
		        results.push(e.data);
		        if(results.length === numWorkers) {
		          for(var i = 0; i < numWorkers; ++i) {
		            workers[i].terminate();
		          }
		          callback(null, results);
		        }
		      });
		      workers.push(worker);
		    }
		    for(var i = 0; i < numWorkers; ++i) {
		      workers[i].postMessage(i);
		    }
		  }

		  function reduce(numWorkers, results) {
		    // find overlapping time windows
		    var overlaps = [];
		    for(var n = 0; n < numWorkers; ++n) {
		      var r1 = results[n];
		      var overlap = overlaps[n] = [];
		      for(var i = 0; i < numWorkers; ++i) {
		        if(n === i) {
		          continue;
		        }
		        var r2 = results[i];
		        if((r1.st > r2.st && r1.st < r2.et) ||
		          (r2.st > r1.st && r2.st < r1.et)) {
		          overlap.push(i);
		        }
		      }
		    }
		    // get maximum overlaps ... don't include overlapping worker itself
		    // as the main JS process was also being scheduled during the work and
		    // would have to be subtracted from the estimate anyway
		    return overlaps.reduce(function(max, overlap) {
		      return Math.max(max, overlap.length);
		    }, 0);
		  }
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'util';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/util',['require', 'module'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Cipher base API.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.cipher = forge.cipher || {};

		// registered algorithms
		forge.cipher.algorithms = forge.cipher.algorithms || {};

		/**
		 * Creates a cipher object that can be used to encrypt data using the given
		 * algorithm and key. The algorithm may be provided as a string value for a
		 * previously registered algorithm or it may be given as a cipher algorithm
		 * API object.
		 *
		 * @param algorithm the algorithm to use, either a string or an algorithm API
		 *          object.
		 * @param key the key to use, as a binary-encoded string of bytes or a
		 *          byte buffer.
		 *
		 * @return the cipher.
		 */
		forge.cipher.createCipher = function(algorithm, key) {
		  var api = algorithm;
		  if(typeof api === 'string') {
		    api = forge.cipher.getAlgorithm(api);
		    if(api) {
		      api = api();
		    }
		  }
		  if(!api) {
		    throw new Error('Unsupported algorithm: ' + algorithm);
		  }

		  // assume block cipher
		  return new forge.cipher.BlockCipher({
		    algorithm: api,
		    key: key,
		    decrypt: false
		  });
		};

		/**
		 * Creates a decipher object that can be used to decrypt data using the given
		 * algorithm and key. The algorithm may be provided as a string value for a
		 * previously registered algorithm or it may be given as a cipher algorithm
		 * API object.
		 *
		 * @param algorithm the algorithm to use, either a string or an algorithm API
		 *          object.
		 * @param key the key to use, as a binary-encoded string of bytes or a
		 *          byte buffer.
		 *
		 * @return the cipher.
		 */
		forge.cipher.createDecipher = function(algorithm, key) {
		  var api = algorithm;
		  if(typeof api === 'string') {
		    api = forge.cipher.getAlgorithm(api);
		    if(api) {
		      api = api();
		    }
		  }
		  if(!api) {
		    throw new Error('Unsupported algorithm: ' + algorithm);
		  }

		  // assume block cipher
		  return new forge.cipher.BlockCipher({
		    algorithm: api,
		    key: key,
		    decrypt: true
		  });
		};

		/**
		 * Registers an algorithm by name. If the name was already registered, the
		 * algorithm API object will be overwritten.
		 *
		 * @param name the name of the algorithm.
		 * @param algorithm the algorithm API object.
		 */
		forge.cipher.registerAlgorithm = function(name, algorithm) {
		  name = name.toUpperCase();
		  forge.cipher.algorithms[name] = algorithm;
		};

		/**
		 * Gets a registered algorithm by name.
		 *
		 * @param name the name of the algorithm.
		 *
		 * @return the algorithm, if found, null if not.
		 */
		forge.cipher.getAlgorithm = function(name) {
		  name = name.toUpperCase();
		  if(name in forge.cipher.algorithms) {
		    return forge.cipher.algorithms[name];
		  }
		  return null;
		};

		var BlockCipher = forge.cipher.BlockCipher = function(options) {
		  this.algorithm = options.algorithm;
		  this.mode = this.algorithm.mode;
		  this.blockSize = this.mode.blockSize;
		  this._finish = false;
		  this._input = null;
		  this.output = null;
		  this._op = options.decrypt ? this.mode.decrypt : this.mode.encrypt;
		  this._decrypt = options.decrypt;
		  this.algorithm.initialize(options);
		};

		/**
		 * Starts or restarts the encryption or decryption process, whichever
		 * was previously configured.
		 *
		 * For non-GCM mode, the IV may be a binary-encoded string of bytes, an array
		 * of bytes, a byte buffer, or an array of 32-bit integers. If the IV is in
		 * bytes, then it must be Nb (16) bytes in length. If the IV is given in as
		 * 32-bit integers, then it must be 4 integers long.
		 *
		 * Note: an IV is not required or used in ECB mode.
		 *
		 * For GCM-mode, the IV must be given as a binary-encoded string of bytes or
		 * a byte buffer. The number of bytes should be 12 (96 bits) as recommended
		 * by NIST SP-800-38D but another length may be given.
		 *
		 * @param options the options to use:
		 *          iv the initialization vector to use as a binary-encoded string of
		 *            bytes, null to reuse the last ciphered block from a previous
		 *            update() (this "residue" method is for legacy support only).
		 *          additionalData additional authentication data as a binary-encoded
		 *            string of bytes, for 'GCM' mode, (default: none).
		 *          tagLength desired length of authentication tag, in bits, for
		 *            'GCM' mode (0-128, default: 128).
		 *          tag the authentication tag to check if decrypting, as a
		 *             binary-encoded string of bytes.
		 *          output the output the buffer to write to, null to create one.
		 */
		BlockCipher.prototype.start = function(options) {
		  options = options || {};
		  var opts = {};
		  for(var key in options) {
		    opts[key] = options[key];
		  }
		  opts.decrypt = this._decrypt;
		  this._finish = false;
		  this._input = forge.util.createBuffer();
		  this.output = options.output || forge.util.createBuffer();
		  this.mode.start(opts);
		};

		/**
		 * Updates the next block according to the cipher mode.
		 *
		 * @param input the buffer to read from.
		 */
		BlockCipher.prototype.update = function(input) {
		  if(input) {
		    // input given, so empty it into the input buffer
		    this._input.putBuffer(input);
		  }

		  // do cipher operation until it needs more input and not finished
		  while(!this._op.call(this.mode, this._input, this.output, this._finish) &&
		    !this._finish) {}

		  // free consumed memory from input buffer
		  this._input.compact();
		};

		/**
		 * Finishes encrypting or decrypting.
		 *
		 * @param pad a padding function to use in CBC mode, null for default,
		 *          signature(blockSize, buffer, decrypt).
		 *
		 * @return true if successful, false on error.
		 */
		BlockCipher.prototype.finish = function(pad) {
		  // backwards-compatibility w/deprecated padding API
		  // Note: will overwrite padding functions even after another start() call
		  if(pad && (this.mode.name === 'ECB' || this.mode.name === 'CBC')) {
		    this.mode.pad = function(input) {
		      return pad(this.blockSize, input, false);
		    };
		    this.mode.unpad = function(output) {
		      return pad(this.blockSize, output, true);
		    };
		  }

		  // build options for padding and afterFinish functions
		  var options = {};
		  options.decrypt = this._decrypt;

		  // get # of bytes that won't fill a block
		  options.overflow = this._input.length() % this.blockSize;

		  if(!this._decrypt && this.mode.pad) {
		    if(!this.mode.pad(this._input, options)) {
		      return false;
		    }
		  }

		  // do final update
		  this._finish = true;
		  this.update();

		  if(this._decrypt && this.mode.unpad) {
		    if(!this.mode.unpad(this.output, options)) {
		      return false;
		    }
		  }

		  if(this.mode.afterFinish) {
		    if(!this.mode.afterFinish(this.output, options)) {
		      return false;
		    }
		  }

		  return true;
		};


		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'cipher';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/cipher',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Supported cipher modes.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.cipher = forge.cipher || {};

		// supported cipher modes
		var modes = forge.cipher.modes = forge.cipher.modes || {};


		/** Electronic codebook (ECB) (Don't use this; it's not secure) **/

		modes.ecb = function(options) {
		  options = options || {};
		  this.name = 'ECB';
		  this.cipher = options.cipher;
		  this.blockSize = options.blockSize || 16;
		  this._ints = this.blockSize / 4;
		  this._inBlock = new Array(this._ints);
		  this._outBlock = new Array(this._ints);
		};

		modes.ecb.prototype.start = function(options) {};

		modes.ecb.prototype.encrypt = function(input, output, finish) {
		  // not enough input to encrypt
		  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {
		    return true;
		  }

		  // get next block
		  for(var i = 0; i < this._ints; ++i) {
		    this._inBlock[i] = input.getInt32();
		  }

		  // encrypt block
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // write output
		  for(var i = 0; i < this._ints; ++i) {
		    output.putInt32(this._outBlock[i]);
		  }
		};

		modes.ecb.prototype.decrypt = function(input, output, finish) {
		  // not enough input to decrypt
		  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {
		    return true;
		  }

		  // get next block
		  for(var i = 0; i < this._ints; ++i) {
		    this._inBlock[i] = input.getInt32();
		  }

		  // decrypt block
		  this.cipher.decrypt(this._inBlock, this._outBlock);

		  // write output
		  for(var i = 0; i < this._ints; ++i) {
		    output.putInt32(this._outBlock[i]);
		  }
		};

		modes.ecb.prototype.pad = function(input, options) {
		  // add PKCS#7 padding to block (each pad byte is the
		  // value of the number of pad bytes)
		  var padding = (input.length() === this.blockSize ?
		    this.blockSize : (this.blockSize - input.length()));
		  input.fillWithByte(padding, padding);
		  return true;
		};

		modes.ecb.prototype.unpad = function(output, options) {
		  // check for error: input data not a multiple of blockSize
		  if(options.overflow > 0) {
		    return false;
		  }

		  // ensure padding byte count is valid
		  var len = output.length();
		  var count = output.at(len - 1);
		  if(count > (this.blockSize << 2)) {
		    return false;
		  }

		  // trim off padding bytes
		  output.truncate(count);
		  return true;
		};


		/** Cipher-block Chaining (CBC) **/

		modes.cbc = function(options) {
		  options = options || {};
		  this.name = 'CBC';
		  this.cipher = options.cipher;
		  this.blockSize = options.blockSize || 16;
		  this._ints = this.blockSize / 4;
		  this._inBlock = new Array(this._ints);
		  this._outBlock = new Array(this._ints);
		};

		modes.cbc.prototype.start = function(options) {
		  // Note: legacy support for using IV residue (has security flaws)
		  // if IV is null, reuse block from previous processing
		  if(options.iv === null) {
		    // must have a previous block
		    if(!this._prev) {
		      throw new Error('Invalid IV parameter.');
		    }
		    this._iv = this._prev.slice(0);
		  } else if(!('iv' in options)) {
		    throw new Error('Invalid IV parameter.');
		  } else {
		    // save IV as "previous" block
		    this._iv = transformIV(options.iv);
		    this._prev = this._iv.slice(0);
		  }
		};

		modes.cbc.prototype.encrypt = function(input, output, finish) {
		  // not enough input to encrypt
		  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {
		    return true;
		  }

		  // get next block
		  // CBC XOR's IV (or previous block) with plaintext
		  for(var i = 0; i < this._ints; ++i) {
		    this._inBlock[i] = this._prev[i] ^ input.getInt32();
		  }

		  // encrypt block
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // write output, save previous block
		  for(var i = 0; i < this._ints; ++i) {
		    output.putInt32(this._outBlock[i]);
		  }
		  this._prev = this._outBlock;
		};

		modes.cbc.prototype.decrypt = function(input, output, finish) {
		  // not enough input to decrypt
		  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {
		    return true;
		  }

		  // get next block
		  for(var i = 0; i < this._ints; ++i) {
		    this._inBlock[i] = input.getInt32();
		  }

		  // decrypt block
		  this.cipher.decrypt(this._inBlock, this._outBlock);

		  // write output, save previous ciphered block
		  // CBC XOR's IV (or previous block) with ciphertext
		  for(var i = 0; i < this._ints; ++i) {
		    output.putInt32(this._prev[i] ^ this._outBlock[i]);
		  }
		  this._prev = this._inBlock.slice(0);
		};

		modes.cbc.prototype.pad = function(input, options) {
		  // add PKCS#7 padding to block (each pad byte is the
		  // value of the number of pad bytes)
		  var padding = (input.length() === this.blockSize ?
		    this.blockSize : (this.blockSize - input.length()));
		  input.fillWithByte(padding, padding);
		  return true;
		};

		modes.cbc.prototype.unpad = function(output, options) {
		  // check for error: input data not a multiple of blockSize
		  if(options.overflow > 0) {
		    return false;
		  }

		  // ensure padding byte count is valid
		  var len = output.length();
		  var count = output.at(len - 1);
		  if(count > (this.blockSize << 2)) {
		    return false;
		  }

		  // trim off padding bytes
		  output.truncate(count);
		  return true;
		};


		/** Cipher feedback (CFB) **/

		modes.cfb = function(options) {
		  options = options || {};
		  this.name = 'CFB';
		  this.cipher = options.cipher;
		  this.blockSize = options.blockSize || 16;
		  this._ints = this.blockSize / 4;
		  this._inBlock = null;
		  this._outBlock = new Array(this._ints);
		  this._partialBlock = new Array(this._ints);
		  this._partialOutput = forge.util.createBuffer();
		  this._partialBytes = 0;
		};

		modes.cfb.prototype.start = function(options) {
		  if(!('iv' in options)) {
		    throw new Error('Invalid IV parameter.');
		  }
		  // use IV as first input
		  this._iv = transformIV(options.iv);
		  this._inBlock = this._iv.slice(0);
		  this._partialBytes = 0;
		};

		modes.cfb.prototype.encrypt = function(input, output, finish) {
		  // not enough input to encrypt
		  var inputLength = input.length();
		  if(inputLength === 0) {
		    return true;
		  }

		  // encrypt block
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // handle full block
		  if(this._partialBytes === 0 && inputLength >= this.blockSize) {
		    // XOR input with output, write input as output
		    for(var i = 0; i < this._ints; ++i) {
		      this._inBlock[i] = input.getInt32() ^ this._outBlock[i];
		      output.putInt32(this._inBlock[i]);
		    }
		    return;
		  }

		  // handle partial block
		  var partialBytes = (this.blockSize - inputLength) % this.blockSize;
		  if(partialBytes > 0) {
		    partialBytes = this.blockSize - partialBytes;
		  }

		  // XOR input with output, write input as partial output
		  this._partialOutput.clear();
		  for(var i = 0; i < this._ints; ++i) {
		    this._partialBlock[i] = input.getInt32() ^ this._outBlock[i];
		    this._partialOutput.putInt32(this._partialBlock[i]);
		  }

		  if(partialBytes > 0) {
		    // block still incomplete, restore input buffer
		    input.read -= this.blockSize;
		  } else {
		    // block complete, update input block
		    for(var i = 0; i < this._ints; ++i) {
		      this._inBlock[i] = this._partialBlock[i];
		    }
		  }

		  // skip any previous partial bytes
		  if(this._partialBytes > 0) {
		    this._partialOutput.getBytes(this._partialBytes);
		  }

		  if(partialBytes > 0 && !finish) {
		    output.putBytes(this._partialOutput.getBytes(
		      partialBytes - this._partialBytes));
		    this._partialBytes = partialBytes;
		    return true;
		  }

		  output.putBytes(this._partialOutput.getBytes(
		    inputLength - this._partialBytes));
		  this._partialBytes = 0;
		};

		modes.cfb.prototype.decrypt = function(input, output, finish) {
		  // not enough input to decrypt
		  var inputLength = input.length();
		  if(inputLength === 0) {
		    return true;
		  }

		  // encrypt block (CFB always uses encryption mode)
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // handle full block
		  if(this._partialBytes === 0 && inputLength >= this.blockSize) {
		    // XOR input with output, write input as output
		    for(var i = 0; i < this._ints; ++i) {
		      this._inBlock[i] = input.getInt32();
		      output.putInt32(this._inBlock[i] ^ this._outBlock[i]);
		    }
		    return;
		  }

		  // handle partial block
		  var partialBytes = (this.blockSize - inputLength) % this.blockSize;
		  if(partialBytes > 0) {
		    partialBytes = this.blockSize - partialBytes;
		  }

		  // XOR input with output, write input as partial output
		  this._partialOutput.clear();
		  for(var i = 0; i < this._ints; ++i) {
		    this._partialBlock[i] = input.getInt32();
		    this._partialOutput.putInt32(this._partialBlock[i] ^ this._outBlock[i]);
		  }

		  if(partialBytes > 0) {
		    // block still incomplete, restore input buffer
		    input.read -= this.blockSize;
		  } else {
		    // block complete, update input block
		    for(var i = 0; i < this._ints; ++i) {
		      this._inBlock[i] = this._partialBlock[i];
		    }
		  }

		  // skip any previous partial bytes
		  if(this._partialBytes > 0) {
		    this._partialOutput.getBytes(this._partialBytes);
		  }

		  if(partialBytes > 0 && !finish) {
		    output.putBytes(this._partialOutput.getBytes(
		      partialBytes - this._partialBytes));
		    this._partialBytes = partialBytes;
		    return true;
		  }

		  output.putBytes(this._partialOutput.getBytes(
		    inputLength - this._partialBytes));
		  this._partialBytes = 0;
		};

		/** Output feedback (OFB) **/

		modes.ofb = function(options) {
		  options = options || {};
		  this.name = 'OFB';
		  this.cipher = options.cipher;
		  this.blockSize = options.blockSize || 16;
		  this._ints = this.blockSize / 4;
		  this._inBlock = null;
		  this._outBlock = new Array(this._ints);
		  this._partialOutput = forge.util.createBuffer();
		  this._partialBytes = 0;
		};

		modes.ofb.prototype.start = function(options) {
		  if(!('iv' in options)) {
		    throw new Error('Invalid IV parameter.');
		  }
		  // use IV as first input
		  this._iv = transformIV(options.iv);
		  this._inBlock = this._iv.slice(0);
		  this._partialBytes = 0;
		};

		modes.ofb.prototype.encrypt = function(input, output, finish) {
		  // not enough input to encrypt
		  var inputLength = input.length();
		  if(input.length() === 0) {
		    return true;
		  }

		  // encrypt block (OFB always uses encryption mode)
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // handle full block
		  if(this._partialBytes === 0 && inputLength >= this.blockSize) {
		    // XOR input with output and update next input
		    for(var i = 0; i < this._ints; ++i) {
		      output.putInt32(input.getInt32() ^ this._outBlock[i]);
		      this._inBlock[i] = this._outBlock[i];
		    }
		    return;
		  }

		  // handle partial block
		  var partialBytes = (this.blockSize - inputLength) % this.blockSize;
		  if(partialBytes > 0) {
		    partialBytes = this.blockSize - partialBytes;
		  }

		  // XOR input with output
		  this._partialOutput.clear();
		  for(var i = 0; i < this._ints; ++i) {
		    this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);
		  }

		  if(partialBytes > 0) {
		    // block still incomplete, restore input buffer
		    input.read -= this.blockSize;
		  } else {
		    // block complete, update input block
		    for(var i = 0; i < this._ints; ++i) {
		      this._inBlock[i] = this._outBlock[i];
		    }
		  }

		  // skip any previous partial bytes
		  if(this._partialBytes > 0) {
		    this._partialOutput.getBytes(this._partialBytes);
		  }

		  if(partialBytes > 0 && !finish) {
		    output.putBytes(this._partialOutput.getBytes(
		      partialBytes - this._partialBytes));
		    this._partialBytes = partialBytes;
		    return true;
		  }

		  output.putBytes(this._partialOutput.getBytes(
		    inputLength - this._partialBytes));
		  this._partialBytes = 0;
		};

		modes.ofb.prototype.decrypt = modes.ofb.prototype.encrypt;


		/** Counter (CTR) **/

		modes.ctr = function(options) {
		  options = options || {};
		  this.name = 'CTR';
		  this.cipher = options.cipher;
		  this.blockSize = options.blockSize || 16;
		  this._ints = this.blockSize / 4;
		  this._inBlock = null;
		  this._outBlock = new Array(this._ints);
		  this._partialOutput = forge.util.createBuffer();
		  this._partialBytes = 0;
		};

		modes.ctr.prototype.start = function(options) {
		  if(!('iv' in options)) {
		    throw new Error('Invalid IV parameter.');
		  }
		  // use IV as first input
		  this._iv = transformIV(options.iv);
		  this._inBlock = this._iv.slice(0);
		  this._partialBytes = 0;
		};

		modes.ctr.prototype.encrypt = function(input, output, finish) {
		  // not enough input to encrypt
		  var inputLength = input.length();
		  if(inputLength === 0) {
		    return true;
		  }

		  // encrypt block (CTR always uses encryption mode)
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // handle full block
		  if(this._partialBytes === 0 && inputLength >= this.blockSize) {
		    // XOR input with output
		    for(var i = 0; i < this._ints; ++i) {
		      output.putInt32(input.getInt32() ^ this._outBlock[i]);
		    }
		  } else {
		    // handle partial block
		    var partialBytes = (this.blockSize - inputLength) % this.blockSize;
		    if(partialBytes > 0) {
		      partialBytes = this.blockSize - partialBytes;
		    }

		    // XOR input with output
		    this._partialOutput.clear();
		    for(var i = 0; i < this._ints; ++i) {
		      this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);
		    }

		    if(partialBytes > 0) {
		      // block still incomplete, restore input buffer
		      input.read -= this.blockSize;
		    }

		    // skip any previous partial bytes
		    if(this._partialBytes > 0) {
		      this._partialOutput.getBytes(this._partialBytes);
		    }

		    if(partialBytes > 0 && !finish) {
		      output.putBytes(this._partialOutput.getBytes(
		        partialBytes - this._partialBytes));
		      this._partialBytes = partialBytes;
		      return true;
		    }

		    output.putBytes(this._partialOutput.getBytes(
		      inputLength - this._partialBytes));
		    this._partialBytes = 0;
		  }

		  // block complete, increment counter (input block)
		  inc32(this._inBlock);
		};

		modes.ctr.prototype.decrypt = modes.ctr.prototype.encrypt;


		/** Galois/Counter Mode (GCM) **/

		modes.gcm = function(options) {
		  options = options || {};
		  this.name = 'GCM';
		  this.cipher = options.cipher;
		  this.blockSize = options.blockSize || 16;
		  this._ints = this.blockSize / 4;
		  this._inBlock = new Array(this._ints);
		  this._outBlock = new Array(this._ints);
		  this._partialOutput = forge.util.createBuffer();
		  this._partialBytes = 0;

		  // R is actually this value concatenated with 120 more zero bits, but
		  // we only XOR against R so the other zeros have no effect -- we just
		  // apply this value to the first integer in a block
		  this._R = 0xE1000000;
		};

		modes.gcm.prototype.start = function(options) {
		  if(!('iv' in options)) {
		    throw new Error('Invalid IV parameter.');
		  }
		  // ensure IV is a byte buffer
		  var iv = forge.util.createBuffer(options.iv);

		  // no ciphered data processed yet
		  this._cipherLength = 0;

		  // default additional data is none
		  var additionalData;
		  if('additionalData' in options) {
		    additionalData = forge.util.createBuffer(options.additionalData);
		  } else {
		    additionalData = forge.util.createBuffer();
		  }

		  // default tag length is 128 bits
		  if('tagLength' in options) {
		    this._tagLength = options.tagLength;
		  } else {
		    this._tagLength = 128;
		  }

		  // if tag is given, ensure tag matches tag length
		  this._tag = null;
		  if(options.decrypt) {
		    // save tag to check later
		    this._tag = forge.util.createBuffer(options.tag).getBytes();
		    if(this._tag.length !== (this._tagLength / 8)) {
		      throw new Error('Authentication tag does not match tag length.');
		    }
		  }

		  // create tmp storage for hash calculation
		  this._hashBlock = new Array(this._ints);

		  // no tag generated yet
		  this.tag = null;

		  // generate hash subkey
		  // (apply block cipher to "zero" block)
		  this._hashSubkey = new Array(this._ints);
		  this.cipher.encrypt([0, 0, 0, 0], this._hashSubkey);

		  // generate table M
		  // use 4-bit tables (32 component decomposition of a 16 byte value)
		  // 8-bit tables take more space and are known to have security
		  // vulnerabilities (in native implementations)
		  this.componentBits = 4;
		  this._m = this.generateHashTable(this._hashSubkey, this.componentBits);

		  // Note: support IV length different from 96 bits? (only supporting
		  // 96 bits is recommended by NIST SP-800-38D)
		  // generate J_0
		  var ivLength = iv.length();
		  if(ivLength === 12) {
		    // 96-bit IV
		    this._j0 = [iv.getInt32(), iv.getInt32(), iv.getInt32(), 1];
		  } else {
		    // IV is NOT 96-bits
		    this._j0 = [0, 0, 0, 0];
		    while(iv.length() > 0) {
		      this._j0 = this.ghash(
		        this._hashSubkey, this._j0,
		        [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]);
		    }
		    this._j0 = this.ghash(
		      this._hashSubkey, this._j0, [0, 0].concat(from64To32(ivLength * 8)));
		  }

		  // generate ICB (initial counter block)
		  this._inBlock = this._j0.slice(0);
		  inc32(this._inBlock);
		  this._partialBytes = 0;

		  // consume authentication data
		  additionalData = forge.util.createBuffer(additionalData);
		  // save additional data length as a BE 64-bit number
		  this._aDataLength = from64To32(additionalData.length() * 8);
		  // pad additional data to 128 bit (16 byte) block size
		  var overflow = additionalData.length() % this.blockSize;
		  if(overflow) {
		    additionalData.fillWithByte(0, this.blockSize - overflow);
		  }
		  this._s = [0, 0, 0, 0];
		  while(additionalData.length() > 0) {
		    this._s = this.ghash(this._hashSubkey, this._s, [
		      additionalData.getInt32(),
		      additionalData.getInt32(),
		      additionalData.getInt32(),
		      additionalData.getInt32()
		    ]);
		  }
		};

		modes.gcm.prototype.encrypt = function(input, output, finish) {
		  // not enough input to encrypt
		  var inputLength = input.length();
		  if(inputLength === 0) {
		    return true;
		  }

		  // encrypt block
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // handle full block
		  if(this._partialBytes === 0 && inputLength >= this.blockSize) {
		    // XOR input with output
		    for(var i = 0; i < this._ints; ++i) {
		      output.putInt32(this._outBlock[i] ^= input.getInt32());
		    }
		    this._cipherLength += this.blockSize;
		  } else {
		    // handle partial block
		    var partialBytes = (this.blockSize - inputLength) % this.blockSize;
		    if(partialBytes > 0) {
		      partialBytes = this.blockSize - partialBytes;
		    }

		    // XOR input with output
		    this._partialOutput.clear();
		    for(var i = 0; i < this._ints; ++i) {
		      this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);
		    }

		    if(partialBytes === 0 || finish) {
		      // handle overflow prior to hashing
		      if(finish) {
		        // get block overflow
		        var overflow = inputLength % this.blockSize;
		        this._cipherLength += overflow;
		        // truncate for hash function
		        this._partialOutput.truncate(this.blockSize - overflow);
		      } else {
		        this._cipherLength += this.blockSize;
		      }

		      // get output block for hashing
		      for(var i = 0; i < this._ints; ++i) {
		        this._outBlock[i] = this._partialOutput.getInt32();
		      }
		      this._partialOutput.read -= this.blockSize;
		    }

		    // skip any previous partial bytes
		    if(this._partialBytes > 0) {
		      this._partialOutput.getBytes(this._partialBytes);
		    }

		    if(partialBytes > 0 && !finish) {
		      // block still incomplete, restore input buffer, get partial output,
		      // and return early
		      input.read -= this.blockSize;
		      output.putBytes(this._partialOutput.getBytes(
		        partialBytes - this._partialBytes));
		      this._partialBytes = partialBytes;
		      return true;
		    }

		    output.putBytes(this._partialOutput.getBytes(
		      inputLength - this._partialBytes));
		    this._partialBytes = 0;
		  }

		  // update hash block S
		  this._s = this.ghash(this._hashSubkey, this._s, this._outBlock);

		  // increment counter (input block)
		  inc32(this._inBlock);
		};

		modes.gcm.prototype.decrypt = function(input, output, finish) {
		  // not enough input to decrypt
		  var inputLength = input.length();
		  if(inputLength < this.blockSize && !(finish && inputLength > 0)) {
		    return true;
		  }

		  // encrypt block (GCM always uses encryption mode)
		  this.cipher.encrypt(this._inBlock, this._outBlock);

		  // increment counter (input block)
		  inc32(this._inBlock);

		  // update hash block S
		  this._hashBlock[0] = input.getInt32();
		  this._hashBlock[1] = input.getInt32();
		  this._hashBlock[2] = input.getInt32();
		  this._hashBlock[3] = input.getInt32();
		  this._s = this.ghash(this._hashSubkey, this._s, this._hashBlock);

		  // XOR hash input with output
		  for(var i = 0; i < this._ints; ++i) {
		    output.putInt32(this._outBlock[i] ^ this._hashBlock[i]);
		  }

		  // increment cipher data length
		  if(inputLength < this.blockSize) {
		    this._cipherLength += inputLength % this.blockSize;
		  } else {
		    this._cipherLength += this.blockSize;
		  }
		};

		modes.gcm.prototype.afterFinish = function(output, options) {
		  var rval = true;

		  // handle overflow
		  if(options.decrypt && options.overflow) {
		    output.truncate(this.blockSize - options.overflow);
		  }

		  // handle authentication tag
		  this.tag = forge.util.createBuffer();

		  // concatenate additional data length with cipher length
		  var lengths = this._aDataLength.concat(from64To32(this._cipherLength * 8));

		  // include lengths in hash
		  this._s = this.ghash(this._hashSubkey, this._s, lengths);

		  // do GCTR(J_0, S)
		  var tag = [];
		  this.cipher.encrypt(this._j0, tag);
		  for(var i = 0; i < this._ints; ++i) {
		    this.tag.putInt32(this._s[i] ^ tag[i]);
		  }

		  // trim tag to length
		  this.tag.truncate(this.tag.length() % (this._tagLength / 8));

		  // check authentication tag
		  if(options.decrypt && this.tag.bytes() !== this._tag) {
		    rval = false;
		  }

		  return rval;
		};

		/**
		 * See NIST SP-800-38D 6.3 (Algorithm 1). This function performs Galois
		 * field multiplication. The field, GF(2^128), is defined by the polynomial:
		 *
		 * x^128 + x^7 + x^2 + x + 1
		 *
		 * Which is represented in little-endian binary form as: 11100001 (0xe1). When
		 * the value of a coefficient is 1, a bit is set. The value R, is the
		 * concatenation of this value and 120 zero bits, yielding a 128-bit value
		 * which matches the block size.
		 *
		 * This function will multiply two elements (vectors of bytes), X and Y, in
		 * the field GF(2^128). The result is initialized to zero. For each bit of
		 * X (out of 128), x_i, if x_i is set, then the result is multiplied (XOR'd)
		 * by the current value of Y. For each bit, the value of Y will be raised by
		 * a power of x (multiplied by the polynomial x). This can be achieved by
		 * shifting Y once to the right. If the current value of Y, prior to being
		 * multiplied by x, has 0 as its LSB, then it is a 127th degree polynomial.
		 * Otherwise, we must divide by R after shifting to find the remainder.
		 *
		 * @param x the first block to multiply by the second.
		 * @param y the second block to multiply by the first.
		 *
		 * @return the block result of the multiplication.
		 */
		modes.gcm.prototype.multiply = function(x, y) {
		  var z_i = [0, 0, 0, 0];
		  var v_i = y.slice(0);

		  // calculate Z_128 (block has 128 bits)
		  for(var i = 0; i < 128; ++i) {
		    // if x_i is 0, Z_{i+1} = Z_i (unchanged)
		    // else Z_{i+1} = Z_i ^ V_i
		    // get x_i by finding 32-bit int position, then left shift 1 by remainder
		    var x_i = x[(i / 32) | 0] & (1 << (31 - i % 32));
		    if(x_i) {
		      z_i[0] ^= v_i[0];
		      z_i[1] ^= v_i[1];
		      z_i[2] ^= v_i[2];
		      z_i[3] ^= v_i[3];
		    }

		    // if LSB(V_i) is 1, V_i = V_i >> 1
		    // else V_i = (V_i >> 1) ^ R
		    this.pow(v_i, v_i);
		  }

		  return z_i;
		};

		modes.gcm.prototype.pow = function(x, out) {
		  // if LSB(x) is 1, x = x >>> 1
		  // else x = (x >>> 1) ^ R
		  var lsb = x[3] & 1;

		  // always do x >>> 1:
		  // starting with the rightmost integer, shift each integer to the right
		  // one bit, pulling in the bit from the integer to the left as its top
		  // most bit (do this for the last 3 integers)
		  for(var i = 3; i > 0; --i) {
		    out[i] = (x[i] >>> 1) | ((x[i - 1] & 1) << 31);
		  }
		  // shift the first integer normally
		  out[0] = x[0] >>> 1;

		  // if lsb was not set, then polynomial had a degree of 127 and doesn't
		  // need to divided; otherwise, XOR with R to find the remainder; we only
		  // need to XOR the first integer since R technically ends w/120 zero bits
		  if(lsb) {
		    out[0] ^= this._R;
		  }
		};

		modes.gcm.prototype.tableMultiply = function(x) {
		  // assumes 4-bit tables are used
		  var z = [0, 0, 0, 0];
		  for(var i = 0; i < 32; ++i) {
		    var idx = (i / 8) | 0;
		    var x_i = (x[idx] >>> ((7 - (i % 8)) * 4)) & 0xF;
		    var ah = this._m[i][x_i];
		    z[0] ^= ah[0];
		    z[1] ^= ah[1];
		    z[2] ^= ah[2];
		    z[3] ^= ah[3];
		  }
		  return z;
		};

		/**
		 * A continuing version of the GHASH algorithm that operates on a single
		 * block. The hash block, last hash value (Ym) and the new block to hash
		 * are given.
		 *
		 * @param h the hash block.
		 * @param y the previous value for Ym, use [0, 0, 0, 0] for a new hash.
		 * @param x the block to hash.
		 *
		 * @return the hashed value (Ym).
		 */
		modes.gcm.prototype.ghash = function(h, y, x) {
		  y[0] ^= x[0];
		  y[1] ^= x[1];
		  y[2] ^= x[2];
		  y[3] ^= x[3];
		  return this.tableMultiply(y);
		  //return this.multiply(y, h);
		};

		/**
		 * Precomputes a table for multiplying against the hash subkey. This
		 * mechanism provides a substantial speed increase over multiplication
		 * performed without a table. The table-based multiplication this table is
		 * for solves X * H by multiplying each component of X by H and then
		 * composing the results together using XOR.
		 *
		 * This function can be used to generate tables with different bit sizes
		 * for the components, however, this implementation assumes there are
		 * 32 components of X (which is a 16 byte vector), therefore each component
		 * takes 4-bits (so the table is constructed with bits=4).
		 *
		 * @param h the hash subkey.
		 * @param bits the bit size for a component.
		 */
		modes.gcm.prototype.generateHashTable = function(h, bits) {
		  // TODO: There are further optimizations that would use only the
		  // first table M_0 (or some variant) along with a remainder table;
		  // this can be explored in the future
		  var multiplier = 8 / bits;
		  var perInt = 4 * multiplier;
		  var size = 16 * multiplier;
		  var m = new Array(size);
		  for(var i = 0; i < size; ++i) {
		    var tmp = [0, 0, 0, 0];
		    var idx = (i / perInt) | 0;
		    var shft = ((perInt - 1 - (i % perInt)) * bits);
		    tmp[idx] = (1 << (bits - 1)) << shft;
		    m[i] = this.generateSubHashTable(this.multiply(tmp, h), bits);
		  }
		  return m;
		};

		/**
		 * Generates a table for multiplying against the hash subkey for one
		 * particular component (out of all possible component values).
		 *
		 * @param mid the pre-multiplied value for the middle key of the table.
		 * @param bits the bit size for a component.
		 */
		modes.gcm.prototype.generateSubHashTable = function(mid, bits) {
		  // compute the table quickly by minimizing the number of
		  // POW operations -- they only need to be performed for powers of 2,
		  // all other entries can be composed from those powers using XOR
		  var size = 1 << bits;
		  var half = size >>> 1;
		  var m = new Array(size);
		  m[half] = mid.slice(0);
		  var i = half >>> 1;
		  while(i > 0) {
		    // raise m0[2 * i] and store in m0[i]
		    this.pow(m[2 * i], m[i] = []);
		    i >>= 1;
		  }
		  i = 2;
		  while(i < half) {
		    for(var j = 1; j < i; ++j) {
		      var m_i = m[i];
		      var m_j = m[j];
		      m[i + j] = [
		        m_i[0] ^ m_j[0],
		        m_i[1] ^ m_j[1],
		        m_i[2] ^ m_j[2],
		        m_i[3] ^ m_j[3]
		      ];
		    }
		    i *= 2;
		  }
		  m[0] = [0, 0, 0, 0];
		  /* Note: We could avoid storing these by doing composition during multiply
		  calculate top half using composition by speed is preferred. */
		  for(i = half + 1; i < size; ++i) {
		    var c = m[i ^ half];
		    m[i] = [mid[0] ^ c[0], mid[1] ^ c[1], mid[2] ^ c[2], mid[3] ^ c[3]];
		  }
		  return m;
		};


		/** Utility functions */

		function transformIV(iv) {
		  if(typeof iv === 'string') {
		    // convert iv string into byte buffer
		    iv = forge.util.createBuffer(iv);
		  }

		  if(forge.util.isArray(iv) && iv.length > 4) {
		    // convert iv byte array into byte buffer
		    var tmp = iv;
		    iv = forge.util.createBuffer();
		    for(var i = 0; i < tmp.length; ++i) {
		      iv.putByte(tmp[i]);
		    }
		  }
		  if(!forge.util.isArray(iv)) {
		    // convert iv byte buffer into 32-bit integer array
		    iv = [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()];
		  }

		  return iv;
		}

		function inc32(block) {
		  // increment last 32 bits of block only
		  block[block.length - 1] = (block[block.length - 1] + 1) & 0xFFFFFFFF;
		}

		function from64To32(num) {
		  // convert 64-bit number to two BE Int32s
		  return [(num / 0x100000000) | 0, num & 0xFFFFFFFF];
		}


		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'cipherModes';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/cipherModes',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Advanced Encryption Standard (AES) implementation.
		 *
		 * This implementation is based on the public domain library 'jscrypto' which
		 * was written by:
		 *
		 * Emily Stark (estark@stanford.edu)
		 * Mike Hamburg (mhamburg@stanford.edu)
		 * Dan Boneh (dabo@cs.stanford.edu)
		 *
		 * Parts of this code are based on the OpenSSL implementation of AES:
		 * http://www.openssl.org
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* AES API */
		forge.aes = forge.aes || {};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var cipher = forge.cipher.createCipher('AES-<mode>', key);
		 * cipher.start({iv: iv});
		 *
		 * Creates an AES cipher object to encrypt data using the given symmetric key.
		 * The output will be stored in the 'output' member of the returned cipher.
		 *
		 * The key and iv may be given as a string of bytes, an array of bytes,
		 * a byte buffer, or an array of 32-bit words.
		 *
		 * @param key the symmetric key to use.
		 * @param iv the initialization vector to use.
		 * @param output the buffer to write to, null to create one.
		 * @param mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		forge.aes.startEncrypting = function(key, iv, output, mode) {
		  var cipher = _createCipher({
		    key: key,
		    output: output,
		    decrypt: false,
		    mode: mode
		  });
		  cipher.start(iv);
		  return cipher;
		};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var cipher = forge.cipher.createCipher('AES-<mode>', key);
		 *
		 * Creates an AES cipher object to encrypt data using the given symmetric key.
		 *
		 * The key may be given as a string of bytes, an array of bytes, a
		 * byte buffer, or an array of 32-bit words.
		 *
		 * @param key the symmetric key to use.
		 * @param mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		forge.aes.createEncryptionCipher = function(key, mode) {
		  return _createCipher({
		    key: key,
		    output: null,
		    decrypt: false,
		    mode: mode
		  });
		};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var decipher = forge.cipher.createDecipher('AES-<mode>', key);
		 * decipher.start({iv: iv});
		 *
		 * Creates an AES cipher object to decrypt data using the given symmetric key.
		 * The output will be stored in the 'output' member of the returned cipher.
		 *
		 * The key and iv may be given as a string of bytes, an array of bytes,
		 * a byte buffer, or an array of 32-bit words.
		 *
		 * @param key the symmetric key to use.
		 * @param iv the initialization vector to use.
		 * @param output the buffer to write to, null to create one.
		 * @param mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		forge.aes.startDecrypting = function(key, iv, output, mode) {
		  var cipher = _createCipher({
		    key: key,
		    output: output,
		    decrypt: true,
		    mode: mode
		  });
		  cipher.start(iv);
		  return cipher;
		};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var decipher = forge.cipher.createDecipher('AES-<mode>', key);
		 *
		 * Creates an AES cipher object to decrypt data using the given symmetric key.
		 *
		 * The key may be given as a string of bytes, an array of bytes, a
		 * byte buffer, or an array of 32-bit words.
		 *
		 * @param key the symmetric key to use.
		 * @param mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		forge.aes.createDecryptionCipher = function(key, mode) {
		  return _createCipher({
		    key: key,
		    output: null,
		    decrypt: true,
		    mode: mode
		  });
		};

		/**
		 * Creates a new AES cipher algorithm object.
		 *
		 * @param name the name of the algorithm.
		 * @param mode the mode factory function.
		 *
		 * @return the AES algorithm object.
		 */
		forge.aes.Algorithm = function(name, mode) {
		  if(!init) {
		    initialize();
		  }
		  var self = this;
		  self.name = name;
		  self.mode = new mode({
		    blockSize: 16,
		    cipher: {
		      encrypt: function(inBlock, outBlock) {
		        return _updateBlock(self._w, inBlock, outBlock, false);
		      },
		      decrypt: function(inBlock, outBlock) {
		        return _updateBlock(self._w, inBlock, outBlock, true);
		      }
		    }
		  });
		  self._init = false;
		};

		/**
		 * Initializes this AES algorithm by expanding its key.
		 *
		 * @param options the options to use.
		 *          key the key to use with this algorithm.
		 *          decrypt true if the algorithm should be initialized for decryption,
		 *            false for encryption.
		 */
		forge.aes.Algorithm.prototype.initialize = function(options) {
		  if(this._init) {
		    return;
		  }

		  var key = options.key;
		  var tmp;

		  /* Note: The key may be a string of bytes, an array of bytes, a byte
		    buffer, or an array of 32-bit integers. If the key is in bytes, then
		    it must be 16, 24, or 32 bytes in length. If it is in 32-bit
		    integers, it must be 4, 6, or 8 integers long. */

		  if(typeof key === 'string' &&
		    (key.length === 16 || key.length === 24 || key.length === 32)) {
		    // convert key string into byte buffer
		    key = forge.util.createBuffer(key);
		  } else if(forge.util.isArray(key) &&
		    (key.length === 16 || key.length === 24 || key.length === 32)) {
		    // convert key integer array into byte buffer
		    tmp = key;
		    key = forge.util.createBuffer();
		    for(var i = 0; i < tmp.length; ++i) {
		      key.putByte(tmp[i]);
		    }
		  }

		  // convert key byte buffer into 32-bit integer array
		  if(!forge.util.isArray(key)) {
		    tmp = key;
		    key = [];

		    // key lengths of 16, 24, 32 bytes allowed
		    var len = tmp.length();
		    if(len === 16 || len === 24 || len === 32) {
		      len = len >>> 2;
		      for(var i = 0; i < len; ++i) {
		        key.push(tmp.getInt32());
		      }
		    }
		  }

		  // key must be an array of 32-bit integers by now
		  if(!forge.util.isArray(key) ||
		    !(key.length === 4 || key.length === 6 || key.length === 8)) {
		    throw new Error('Invalid key parameter.');
		  }

		  // encryption operation is always used for these modes
		  var mode = this.mode.name;
		  var encryptOp = (['CFB', 'OFB', 'CTR', 'GCM'].indexOf(mode) !== -1);

		  // do key expansion
		  this._w = _expandKey(key, options.decrypt && !encryptOp);
		  this._init = true;
		};

		/**
		 * Expands a key. Typically only used for testing.
		 *
		 * @param key the symmetric key to expand, as an array of 32-bit words.
		 * @param decrypt true to expand for decryption, false for encryption.
		 *
		 * @return the expanded key.
		 */
		forge.aes._expandKey = function(key, decrypt) {
		  if(!init) {
		    initialize();
		  }
		  return _expandKey(key, decrypt);
		};

		/**
		 * Updates a single block. Typically only used for testing.
		 *
		 * @param w the expanded key to use.
		 * @param input an array of block-size 32-bit words.
		 * @param output an array of block-size 32-bit words.
		 * @param decrypt true to decrypt, false to encrypt.
		 */
		forge.aes._updateBlock = _updateBlock;


		/** Register AES algorithms **/

		registerAlgorithm('AES-ECB', forge.cipher.modes.ecb);
		registerAlgorithm('AES-CBC', forge.cipher.modes.cbc);
		registerAlgorithm('AES-CFB', forge.cipher.modes.cfb);
		registerAlgorithm('AES-OFB', forge.cipher.modes.ofb);
		registerAlgorithm('AES-CTR', forge.cipher.modes.ctr);
		registerAlgorithm('AES-GCM', forge.cipher.modes.gcm);

		function registerAlgorithm(name, mode) {
		  var factory = function() {
		    return new forge.aes.Algorithm(name, mode);
		  };
		  forge.cipher.registerAlgorithm(name, factory);
		}


		/** AES implementation **/

		var init = false; // not yet initialized
		var Nb = 4;       // number of words comprising the state (AES = 4)
		var sbox;         // non-linear substitution table used in key expansion
		var isbox;        // inversion of sbox
		var rcon;         // round constant word array
		var mix;          // mix-columns table
		var imix;         // inverse mix-columns table

		/**
		 * Performs initialization, ie: precomputes tables to optimize for speed.
		 *
		 * One way to understand how AES works is to imagine that 'addition' and
		 * 'multiplication' are interfaces that require certain mathematical
		 * properties to hold true (ie: they are associative) but they might have
		 * different implementations and produce different kinds of results ...
		 * provided that their mathematical properties remain true. AES defines
		 * its own methods of addition and multiplication but keeps some important
		 * properties the same, ie: associativity and distributivity. The
		 * explanation below tries to shed some light on how AES defines addition
		 * and multiplication of bytes and 32-bit words in order to perform its
		 * encryption and decryption algorithms.
		 *
		 * The basics:
		 *
		 * The AES algorithm views bytes as binary representations of polynomials
		 * that have either 1 or 0 as the coefficients. It defines the addition
		 * or subtraction of two bytes as the XOR operation. It also defines the
		 * multiplication of two bytes as a finite field referred to as GF(2^8)
		 * (Note: 'GF' means "Galois Field" which is a field that contains a finite
		 * number of elements so GF(2^8) has 256 elements).
		 *
		 * This means that any two bytes can be represented as binary polynomials;
		 * when they multiplied together and modularly reduced by an irreducible
		 * polynomial of the 8th degree, the results are the field GF(2^8). The
		 * specific irreducible polynomial that AES uses in hexadecimal is 0x11b.
		 * This multiplication is associative with 0x01 as the identity:
		 *
		 * (b * 0x01 = GF(b, 0x01) = b).
		 *
		 * The operation GF(b, 0x02) can be performed at the byte level by left
		 * shifting b once and then XOR'ing it (to perform the modular reduction)
		 * with 0x11b if b is >= 128. Repeated application of the multiplication
		 * of 0x02 can be used to implement the multiplication of any two bytes.
		 *
		 * For instance, multiplying 0x57 and 0x13, denoted as GF(0x57, 0x13), can
		 * be performed by factoring 0x13 into 0x01, 0x02, and 0x10. Then these
		 * factors can each be multiplied by 0x57 and then added together. To do
		 * the multiplication, values for 0x57 multiplied by each of these 3 factors
		 * can be precomputed and stored in a table. To add them, the values from
		 * the table are XOR'd together.
		 *
		 * AES also defines addition and multiplication of words, that is 4-byte
		 * numbers represented as polynomials of 3 degrees where the coefficients
		 * are the values of the bytes.
		 *
		 * The word [a0, a1, a2, a3] is a polynomial a3x^3 + a2x^2 + a1x + a0.
		 *
		 * Addition is performed by XOR'ing like powers of x. Multiplication
		 * is performed in two steps, the first is an algebriac expansion as
		 * you would do normally (where addition is XOR). But the result is
		 * a polynomial larger than 3 degrees and thus it cannot fit in a word. So
		 * next the result is modularly reduced by an AES-specific polynomial of
		 * degree 4 which will always produce a polynomial of less than 4 degrees
		 * such that it will fit in a word. In AES, this polynomial is x^4 + 1.
		 *
		 * The modular product of two polynomials 'a' and 'b' is thus:
		 *
		 * d(x) = d3x^3 + d2x^2 + d1x + d0
		 * with
		 * d0 = GF(a0, b0) ^ GF(a3, b1) ^ GF(a2, b2) ^ GF(a1, b3)
		 * d1 = GF(a1, b0) ^ GF(a0, b1) ^ GF(a3, b2) ^ GF(a2, b3)
		 * d2 = GF(a2, b0) ^ GF(a1, b1) ^ GF(a0, b2) ^ GF(a3, b3)
		 * d3 = GF(a3, b0) ^ GF(a2, b1) ^ GF(a1, b2) ^ GF(a0, b3)
		 *
		 * As a matrix:
		 *
		 * [d0] = [a0 a3 a2 a1][b0]
		 * [d1]   [a1 a0 a3 a2][b1]
		 * [d2]   [a2 a1 a0 a3][b2]
		 * [d3]   [a3 a2 a1 a0][b3]
		 *
		 * Special polynomials defined by AES (0x02 == {02}):
		 * a(x)    = {03}x^3 + {01}x^2 + {01}x + {02}
		 * a^-1(x) = {0b}x^3 + {0d}x^2 + {09}x + {0e}.
		 *
		 * These polynomials are used in the MixColumns() and InverseMixColumns()
		 * operations, respectively, to cause each element in the state to affect
		 * the output (referred to as diffusing).
		 *
		 * RotWord() uses: a0 = a1 = a2 = {00} and a3 = {01}, which is the
		 * polynomial x3.
		 *
		 * The ShiftRows() method modifies the last 3 rows in the state (where
		 * the state is 4 words with 4 bytes per word) by shifting bytes cyclically.
		 * The 1st byte in the second row is moved to the end of the row. The 1st
		 * and 2nd bytes in the third row are moved to the end of the row. The 1st,
		 * 2nd, and 3rd bytes are moved in the fourth row.
		 *
		 * More details on how AES arithmetic works:
		 *
		 * In the polynomial representation of binary numbers, XOR performs addition
		 * and subtraction and multiplication in GF(2^8) denoted as GF(a, b)
		 * corresponds with the multiplication of polynomials modulo an irreducible
		 * polynomial of degree 8. In other words, for AES, GF(a, b) will multiply
		 * polynomial 'a' with polynomial 'b' and then do a modular reduction by
		 * an AES-specific irreducible polynomial of degree 8.
		 *
		 * A polynomial is irreducible if its only divisors are one and itself. For
		 * the AES algorithm, this irreducible polynomial is:
		 *
		 * m(x) = x^8 + x^4 + x^3 + x + 1,
		 *
		 * or {01}{1b} in hexadecimal notation, where each coefficient is a bit:
		 * 100011011 = 283 = 0x11b.
		 *
		 * For example, GF(0x57, 0x83) = 0xc1 because
		 *
		 * 0x57 = 87  = 01010111 = x^6 + x^4 + x^2 + x + 1
		 * 0x85 = 131 = 10000101 = x^7 + x + 1
		 *
		 * (x^6 + x^4 + x^2 + x + 1) * (x^7 + x + 1)
		 * =  x^13 + x^11 + x^9 + x^8 + x^7 +
		 *    x^7 + x^5 + x^3 + x^2 + x +
		 *    x^6 + x^4 + x^2 + x + 1
		 * =  x^13 + x^11 + x^9 + x^8 + x^6 + x^5 + x^4 + x^3 + 1 = y
		 *    y modulo (x^8 + x^4 + x^3 + x + 1)
		 * =  x^7 + x^6 + 1.
		 *
		 * The modular reduction by m(x) guarantees the result will be a binary
		 * polynomial of less than degree 8, so that it can fit in a byte.
		 *
		 * The operation to multiply a binary polynomial b with x (the polynomial
		 * x in binary representation is 00000010) is:
		 *
		 * b_7x^8 + b_6x^7 + b_5x^6 + b_4x^5 + b_3x^4 + b_2x^3 + b_1x^2 + b_0x^1
		 *
		 * To get GF(b, x) we must reduce that by m(x). If b_7 is 0 (that is the
		 * most significant bit is 0 in b) then the result is already reduced. If
		 * it is 1, then we can reduce it by subtracting m(x) via an XOR.
		 *
		 * It follows that multiplication by x (00000010 or 0x02) can be implemented
		 * by performing a left shift followed by a conditional bitwise XOR with
		 * 0x1b. This operation on bytes is denoted by xtime(). Multiplication by
		 * higher powers of x can be implemented by repeated application of xtime().
		 *
		 * By adding intermediate results, multiplication by any constant can be
		 * implemented. For instance:
		 *
		 * GF(0x57, 0x13) = 0xfe because:
		 *
		 * xtime(b) = (b & 128) ? (b << 1 ^ 0x11b) : (b << 1)
		 *
		 * Note: We XOR with 0x11b instead of 0x1b because in javascript our
		 * datatype for b can be larger than 1 byte, so a left shift will not
		 * automatically eliminate bits that overflow a byte ... by XOR'ing the
		 * overflow bit with 1 (the extra one from 0x11b) we zero it out.
		 *
		 * GF(0x57, 0x02) = xtime(0x57) = 0xae
		 * GF(0x57, 0x04) = xtime(0xae) = 0x47
		 * GF(0x57, 0x08) = xtime(0x47) = 0x8e
		 * GF(0x57, 0x10) = xtime(0x8e) = 0x07
		 *
		 * GF(0x57, 0x13) = GF(0x57, (0x01 ^ 0x02 ^ 0x10))
		 *
		 * And by the distributive property (since XOR is addition and GF() is
		 * multiplication):
		 *
		 * = GF(0x57, 0x01) ^ GF(0x57, 0x02) ^ GF(0x57, 0x10)
		 * = 0x57 ^ 0xae ^ 0x07
		 * = 0xfe.
		 */
		function initialize() {
		  init = true;

		  /* Populate the Rcon table. These are the values given by
		    [x^(i-1),{00},{00},{00}] where x^(i-1) are powers of x (and x = 0x02)
		    in the field of GF(2^8), where i starts at 1.

		    rcon[0] = [0x00, 0x00, 0x00, 0x00]
		    rcon[1] = [0x01, 0x00, 0x00, 0x00] 2^(1-1) = 2^0 = 1
		    rcon[2] = [0x02, 0x00, 0x00, 0x00] 2^(2-1) = 2^1 = 2
		    ...
		    rcon[9]  = [0x1B, 0x00, 0x00, 0x00] 2^(9-1)  = 2^8 = 0x1B
		    rcon[10] = [0x36, 0x00, 0x00, 0x00] 2^(10-1) = 2^9 = 0x36

		    We only store the first byte because it is the only one used.
		  */
		  rcon = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1B, 0x36];

		  // compute xtime table which maps i onto GF(i, 0x02)
		  var xtime = new Array(256);
		  for(var i = 0; i < 128; ++i) {
		    xtime[i] = i << 1;
		    xtime[i + 128] = (i + 128) << 1 ^ 0x11B;
		  }

		  // compute all other tables
		  sbox = new Array(256);
		  isbox = new Array(256);
		  mix = new Array(4);
		  imix = new Array(4);
		  for(var i = 0; i < 4; ++i) {
		    mix[i] = new Array(256);
		    imix[i] = new Array(256);
		  }
		  var e = 0, ei = 0, e2, e4, e8, sx, sx2, me, ime;
		  for(var i = 0; i < 256; ++i) {
		    /* We need to generate the SubBytes() sbox and isbox tables so that
		      we can perform byte substitutions. This requires us to traverse
		      all of the elements in GF, find their multiplicative inverses,
		      and apply to each the following affine transformation:

		      bi' = bi ^ b(i + 4) mod 8 ^ b(i + 5) mod 8 ^ b(i + 6) mod 8 ^
		            b(i + 7) mod 8 ^ ci
		      for 0 <= i < 8, where bi is the ith bit of the byte, and ci is the
		      ith bit of a byte c with the value {63} or {01100011}.

		      It is possible to traverse every possible value in a Galois field
		      using what is referred to as a 'generator'. There are many
		      generators (128 out of 256): 3,5,6,9,11,82 to name a few. To fully
		      traverse GF we iterate 255 times, multiplying by our generator
		      each time.

		      On each iteration we can determine the multiplicative inverse for
		      the current element.

		      Suppose there is an element in GF 'e'. For a given generator 'g',
		      e = g^x. The multiplicative inverse of e is g^(255 - x). It turns
		      out that if use the inverse of a generator as another generator
		      it will produce all of the corresponding multiplicative inverses
		      at the same time. For this reason, we choose 5 as our inverse
		      generator because it only requires 2 multiplies and 1 add and its
		      inverse, 82, requires relatively few operations as well.

		      In order to apply the affine transformation, the multiplicative
		      inverse 'ei' of 'e' can be repeatedly XOR'd (4 times) with a
		      bit-cycling of 'ei'. To do this 'ei' is first stored in 's' and
		      'x'. Then 's' is left shifted and the high bit of 's' is made the
		      low bit. The resulting value is stored in 's'. Then 'x' is XOR'd
		      with 's' and stored in 'x'. On each subsequent iteration the same
		      operation is performed. When 4 iterations are complete, 'x' is
		      XOR'd with 'c' (0x63) and the transformed value is stored in 'x'.
		      For example:

		      s = 01000001
		      x = 01000001

		      iteration 1: s = 10000010, x ^= s
		      iteration 2: s = 00000101, x ^= s
		      iteration 3: s = 00001010, x ^= s
		      iteration 4: s = 00010100, x ^= s
		      x ^= 0x63

		      This can be done with a loop where s = (s << 1) | (s >> 7). However,
		      it can also be done by using a single 16-bit (in this case 32-bit)
		      number 'sx'. Since XOR is an associative operation, we can set 'sx'
		      to 'ei' and then XOR it with 'sx' left-shifted 1,2,3, and 4 times.
		      The most significant bits will flow into the high 8 bit positions
		      and be correctly XOR'd with one another. All that remains will be
		      to cycle the high 8 bits by XOR'ing them all with the lower 8 bits
		      afterwards.

		      At the same time we're populating sbox and isbox we can precompute
		      the multiplication we'll need to do to do MixColumns() later.
		    */

		    // apply affine transformation
		    sx = ei ^ (ei << 1) ^ (ei << 2) ^ (ei << 3) ^ (ei << 4);
		    sx = (sx >> 8) ^ (sx & 255) ^ 0x63;

		    // update tables
		    sbox[e] = sx;
		    isbox[sx] = e;

		    /* Mixing columns is done using matrix multiplication. The columns
		      that are to be mixed are each a single word in the current state.
		      The state has Nb columns (4 columns). Therefore each column is a
		      4 byte word. So to mix the columns in a single column 'c' where
		      its rows are r0, r1, r2, and r3, we use the following matrix
		      multiplication:

		      [2 3 1 1]*[r0,c]=[r'0,c]
		      [1 2 3 1] [r1,c] [r'1,c]
		      [1 1 2 3] [r2,c] [r'2,c]
		      [3 1 1 2] [r3,c] [r'3,c]

		      r0, r1, r2, and r3 are each 1 byte of one of the words in the
		      state (a column). To do matrix multiplication for each mixed
		      column c' we multiply the corresponding row from the left matrix
		      with the corresponding column from the right matrix. In total, we
		      get 4 equations:

		      r0,c' = 2*r0,c + 3*r1,c + 1*r2,c + 1*r3,c
		      r1,c' = 1*r0,c + 2*r1,c + 3*r2,c + 1*r3,c
		      r2,c' = 1*r0,c + 1*r1,c + 2*r2,c + 3*r3,c
		      r3,c' = 3*r0,c + 1*r1,c + 1*r2,c + 2*r3,c

		      As usual, the multiplication is as previously defined and the
		      addition is XOR. In order to optimize mixing columns we can store
		      the multiplication results in tables. If you think of the whole
		      column as a word (it might help to visualize by mentally rotating
		      the equations above by counterclockwise 90 degrees) then you can
		      see that it would be useful to map the multiplications performed on
		      each byte (r0, r1, r2, r3) onto a word as well. For instance, we
		      could map 2*r0,1*r0,1*r0,3*r0 onto a word by storing 2*r0 in the
		      highest 8 bits and 3*r0 in the lowest 8 bits (with the other two
		      respectively in the middle). This means that a table can be
		      constructed that uses r0 as an index to the word. We can do the
		      same with r1, r2, and r3, creating a total of 4 tables.

		      To construct a full c', we can just look up each byte of c in
		      their respective tables and XOR the results together.

		      Also, to build each table we only have to calculate the word
		      for 2,1,1,3 for every byte ... which we can do on each iteration
		      of this loop since we will iterate over every byte. After we have
		      calculated 2,1,1,3 we can get the results for the other tables
		      by cycling the byte at the end to the beginning. For instance
		      we can take the result of table 2,1,1,3 and produce table 3,2,1,1
		      by moving the right most byte to the left most position just like
		      how you can imagine the 3 moved out of 2,1,1,3 and to the front
		      to produce 3,2,1,1.

		      There is another optimization in that the same multiples of
		      the current element we need in order to advance our generator
		      to the next iteration can be reused in performing the 2,1,1,3
		      calculation. We also calculate the inverse mix column tables,
		      with e,9,d,b being the inverse of 2,1,1,3.

		      When we're done, and we need to actually mix columns, the first
		      byte of each state word should be put through mix[0] (2,1,1,3),
		      the second through mix[1] (3,2,1,1) and so forth. Then they should
		      be XOR'd together to produce the fully mixed column.
		    */

		    // calculate mix and imix table values
		    sx2 = xtime[sx];
		    e2 = xtime[e];
		    e4 = xtime[e2];
		    e8 = xtime[e4];
		    me =
		      (sx2 << 24) ^  // 2
		      (sx << 16) ^   // 1
		      (sx << 8) ^    // 1
		      (sx ^ sx2);    // 3
		    ime =
		      (e2 ^ e4 ^ e8) << 24 ^  // E (14)
		      (e ^ e8) << 16 ^        // 9
		      (e ^ e4 ^ e8) << 8 ^    // D (13)
		      (e ^ e2 ^ e8);          // B (11)
		    // produce each of the mix tables by rotating the 2,1,1,3 value
		    for(var n = 0; n < 4; ++n) {
		      mix[n][e] = me;
		      imix[n][sx] = ime;
		      // cycle the right most byte to the left most position
		      // ie: 2,1,1,3 becomes 3,2,1,1
		      me = me << 24 | me >>> 8;
		      ime = ime << 24 | ime >>> 8;
		    }

		    // get next element and inverse
		    if(e === 0) {
		      // 1 is the inverse of 1
		      e = ei = 1;
		    } else {
		      // e = 2e + 2*2*2*(10e)) = multiply e by 82 (chosen generator)
		      // ei = ei + 2*2*ei = multiply ei by 5 (inverse generator)
		      e = e2 ^ xtime[xtime[xtime[e2 ^ e8]]];
		      ei ^= xtime[xtime[ei]];
		    }
		  }
		}

		/**
		 * Generates a key schedule using the AES key expansion algorithm.
		 *
		 * The AES algorithm takes the Cipher Key, K, and performs a Key Expansion
		 * routine to generate a key schedule. The Key Expansion generates a total
		 * of Nb*(Nr + 1) words: the algorithm requires an initial set of Nb words,
		 * and each of the Nr rounds requires Nb words of key data. The resulting
		 * key schedule consists of a linear array of 4-byte words, denoted [wi ],
		 * with i in the range 0 ≤ i < Nb(Nr + 1).
		 *
		 * KeyExpansion(byte key[4*Nk], word w[Nb*(Nr+1)], Nk)
		 * AES-128 (Nb=4, Nk=4, Nr=10)
		 * AES-192 (Nb=4, Nk=6, Nr=12)
		 * AES-256 (Nb=4, Nk=8, Nr=14)
		 * Note: Nr=Nk+6.
		 *
		 * Nb is the number of columns (32-bit words) comprising the State (or
		 * number of bytes in a block). For AES, Nb=4.
		 *
		 * @param key the key to schedule (as an array of 32-bit words).
		 * @param decrypt true to modify the key schedule to decrypt, false not to.
		 *
		 * @return the generated key schedule.
		 */
		function _expandKey(key, decrypt) {
		  // copy the key's words to initialize the key schedule
		  var w = key.slice(0);

		  /* RotWord() will rotate a word, moving the first byte to the last
		    byte's position (shifting the other bytes left).

		    We will be getting the value of Rcon at i / Nk. 'i' will iterate
		    from Nk to (Nb * Nr+1). Nk = 4 (4 byte key), Nb = 4 (4 words in
		    a block), Nr = Nk + 6 (10). Therefore 'i' will iterate from
		    4 to 44 (exclusive). Each time we iterate 4 times, i / Nk will
		    increase by 1. We use a counter iNk to keep track of this.
		   */

		  // go through the rounds expanding the key
		  var temp, iNk = 1;
		  var Nk = w.length;
		  var Nr1 = Nk + 6 + 1;
		  var end = Nb * Nr1;
		  for(var i = Nk; i < end; ++i) {
		    temp = w[i - 1];
		    if(i % Nk === 0) {
		      // temp = SubWord(RotWord(temp)) ^ Rcon[i / Nk]
		      temp =
		        sbox[temp >>> 16 & 255] << 24 ^
		        sbox[temp >>> 8 & 255] << 16 ^
		        sbox[temp & 255] << 8 ^
		        sbox[temp >>> 24] ^ (rcon[iNk] << 24);
		      iNk++;
		    } else if(Nk > 6 && (i % Nk === 4)) {
		      // temp = SubWord(temp)
		      temp =
		        sbox[temp >>> 24] << 24 ^
		        sbox[temp >>> 16 & 255] << 16 ^
		        sbox[temp >>> 8 & 255] << 8 ^
		        sbox[temp & 255];
		    }
		    w[i] = w[i - Nk] ^ temp;
		  }

		   /* When we are updating a cipher block we always use the code path for
		     encryption whether we are decrypting or not (to shorten code and
		     simplify the generation of look up tables). However, because there
		     are differences in the decryption algorithm, other than just swapping
		     in different look up tables, we must transform our key schedule to
		     account for these changes:

		     1. The decryption algorithm gets its key rounds in reverse order.
		     2. The decryption algorithm adds the round key before mixing columns
		       instead of afterwards.

		     We don't need to modify our key schedule to handle the first case,
		     we can just traverse the key schedule in reverse order when decrypting.

		     The second case requires a little work.

		     The tables we built for performing rounds will take an input and then
		     perform SubBytes() and MixColumns() or, for the decrypt version,
		     InvSubBytes() and InvMixColumns(). But the decrypt algorithm requires
		     us to AddRoundKey() before InvMixColumns(). This means we'll need to
		     apply some transformations to the round key to inverse-mix its columns
		     so they'll be correct for moving AddRoundKey() to after the state has
		     had its columns inverse-mixed.

		     To inverse-mix the columns of the state when we're decrypting we use a
		     lookup table that will apply InvSubBytes() and InvMixColumns() at the
		     same time. However, the round key's bytes are not inverse-substituted
		     in the decryption algorithm. To get around this problem, we can first
		     substitute the bytes in the round key so that when we apply the
		     transformation via the InvSubBytes()+InvMixColumns() table, it will
		     undo our substitution leaving us with the original value that we
		     want -- and then inverse-mix that value.

		     This change will correctly alter our key schedule so that we can XOR
		     each round key with our already transformed decryption state. This
		     allows us to use the same code path as the encryption algorithm.

		     We make one more change to the decryption key. Since the decryption
		     algorithm runs in reverse from the encryption algorithm, we reverse
		     the order of the round keys to avoid having to iterate over the key
		     schedule backwards when running the encryption algorithm later in
		     decryption mode. In addition to reversing the order of the round keys,
		     we also swap each round key's 2nd and 4th rows. See the comments
		     section where rounds are performed for more details about why this is
		     done. These changes are done inline with the other substitution
		     described above.
		  */
		  if(decrypt) {
		    var tmp;
		    var m0 = imix[0];
		    var m1 = imix[1];
		    var m2 = imix[2];
		    var m3 = imix[3];
		    var wnew = w.slice(0);
		    end = w.length;
		    for(var i = 0, wi = end - Nb; i < end; i += Nb, wi -= Nb) {
		      // do not sub the first or last round key (round keys are Nb
		      // words) as no column mixing is performed before they are added,
		      // but do change the key order
		      if(i === 0 || i === (end - Nb)) {
		        wnew[i] = w[wi];
		        wnew[i + 1] = w[wi + 3];
		        wnew[i + 2] = w[wi + 2];
		        wnew[i + 3] = w[wi + 1];
		      } else {
		        // substitute each round key byte because the inverse-mix
		        // table will inverse-substitute it (effectively cancel the
		        // substitution because round key bytes aren't sub'd in
		        // decryption mode) and swap indexes 3 and 1
		        for(var n = 0; n < Nb; ++n) {
		          tmp = w[wi + n];
		          wnew[i + (3&-n)] =
		            m0[sbox[tmp >>> 24]] ^
		            m1[sbox[tmp >>> 16 & 255]] ^
		            m2[sbox[tmp >>> 8 & 255]] ^
		            m3[sbox[tmp & 255]];
		        }
		      }
		    }
		    w = wnew;
		  }

		  return w;
		}

		/**
		 * Updates a single block (16 bytes) using AES. The update will either
		 * encrypt or decrypt the block.
		 *
		 * @param w the key schedule.
		 * @param input the input block (an array of 32-bit words).
		 * @param output the updated output block.
		 * @param decrypt true to decrypt the block, false to encrypt it.
		 */
		function _updateBlock(w, input, output, decrypt) {
		  /*
		  Cipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)])
		  begin
		    byte state[4,Nb]
		    state = in
		    AddRoundKey(state, w[0, Nb-1])
		    for round = 1 step 1 to Nr–1
		      SubBytes(state)
		      ShiftRows(state)
		      MixColumns(state)
		      AddRoundKey(state, w[round*Nb, (round+1)*Nb-1])
		    end for
		    SubBytes(state)
		    ShiftRows(state)
		    AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])
		    out = state
		  end

		  InvCipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)])
		  begin
		    byte state[4,Nb]
		    state = in
		    AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])
		    for round = Nr-1 step -1 downto 1
		      InvShiftRows(state)
		      InvSubBytes(state)
		      AddRoundKey(state, w[round*Nb, (round+1)*Nb-1])
		      InvMixColumns(state)
		    end for
		    InvShiftRows(state)
		    InvSubBytes(state)
		    AddRoundKey(state, w[0, Nb-1])
		    out = state
		  end
		  */

		  // Encrypt: AddRoundKey(state, w[0, Nb-1])
		  // Decrypt: AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])
		  var Nr = w.length / 4 - 1;
		  var m0, m1, m2, m3, sub;
		  if(decrypt) {
		    m0 = imix[0];
		    m1 = imix[1];
		    m2 = imix[2];
		    m3 = imix[3];
		    sub = isbox;
		  } else {
		    m0 = mix[0];
		    m1 = mix[1];
		    m2 = mix[2];
		    m3 = mix[3];
		    sub = sbox;
		  }
		  var a, b, c, d, a2, b2, c2;
		  a = input[0] ^ w[0];
		  b = input[decrypt ? 3 : 1] ^ w[1];
		  c = input[2] ^ w[2];
		  d = input[decrypt ? 1 : 3] ^ w[3];
		  var i = 3;

		  /* In order to share code we follow the encryption algorithm when both
		    encrypting and decrypting. To account for the changes required in the
		    decryption algorithm, we use different lookup tables when decrypting
		    and use a modified key schedule to account for the difference in the
		    order of transformations applied when performing rounds. We also get
		    key rounds in reverse order (relative to encryption). */
		  for(var round = 1; round < Nr; ++round) {
		    /* As described above, we'll be using table lookups to perform the
		      column mixing. Each column is stored as a word in the state (the
		      array 'input' has one column as a word at each index). In order to
		      mix a column, we perform these transformations on each row in c,
		      which is 1 byte in each word. The new column for c0 is c'0:

		               m0      m1      m2      m3
		      r0,c'0 = 2*r0,c0 + 3*r1,c0 + 1*r2,c0 + 1*r3,c0
		      r1,c'0 = 1*r0,c0 + 2*r1,c0 + 3*r2,c0 + 1*r3,c0
		      r2,c'0 = 1*r0,c0 + 1*r1,c0 + 2*r2,c0 + 3*r3,c0
		      r3,c'0 = 3*r0,c0 + 1*r1,c0 + 1*r2,c0 + 2*r3,c0

		      So using mix tables where c0 is a word with r0 being its upper
		      8 bits and r3 being its lower 8 bits:

		      m0[c0 >> 24] will yield this word: [2*r0,1*r0,1*r0,3*r0]
		      ...
		      m3[c0 & 255] will yield this word: [1*r3,1*r3,3*r3,2*r3]

		      Therefore to mix the columns in each word in the state we
		      do the following (& 255 omitted for brevity):
		      c'0,r0 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]
		      c'0,r1 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]
		      c'0,r2 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]
		      c'0,r3 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]

		      However, before mixing, the algorithm requires us to perform
		      ShiftRows(). The ShiftRows() transformation cyclically shifts the
		      last 3 rows of the state over different offsets. The first row
		      (r = 0) is not shifted.

		      s'_r,c = s_r,(c + shift(r, Nb) mod Nb
		      for 0 < r < 4 and 0 <= c < Nb and
		      shift(1, 4) = 1
		      shift(2, 4) = 2
		      shift(3, 4) = 3.

		      This causes the first byte in r = 1 to be moved to the end of
		      the row, the first 2 bytes in r = 2 to be moved to the end of
		      the row, the first 3 bytes in r = 3 to be moved to the end of
		      the row:

		      r1: [c0 c1 c2 c3] => [c1 c2 c3 c0]
		      r2: [c0 c1 c2 c3]    [c2 c3 c0 c1]
		      r3: [c0 c1 c2 c3]    [c3 c0 c1 c2]

		      We can make these substitutions inline with our column mixing to
		      generate an updated set of equations to produce each word in the
		      state (note the columns have changed positions):

		      c0 c1 c2 c3 => c0 c1 c2 c3
		      c0 c1 c2 c3    c1 c2 c3 c0  (cycled 1 byte)
		      c0 c1 c2 c3    c2 c3 c0 c1  (cycled 2 bytes)
		      c0 c1 c2 c3    c3 c0 c1 c2  (cycled 3 bytes)

		      Therefore:

		      c'0 = 2*r0,c0 + 3*r1,c1 + 1*r2,c2 + 1*r3,c3
		      c'0 = 1*r0,c0 + 2*r1,c1 + 3*r2,c2 + 1*r3,c3
		      c'0 = 1*r0,c0 + 1*r1,c1 + 2*r2,c2 + 3*r3,c3
		      c'0 = 3*r0,c0 + 1*r1,c1 + 1*r2,c2 + 2*r3,c3

		      c'1 = 2*r0,c1 + 3*r1,c2 + 1*r2,c3 + 1*r3,c0
		      c'1 = 1*r0,c1 + 2*r1,c2 + 3*r2,c3 + 1*r3,c0
		      c'1 = 1*r0,c1 + 1*r1,c2 + 2*r2,c3 + 3*r3,c0
		      c'1 = 3*r0,c1 + 1*r1,c2 + 1*r2,c3 + 2*r3,c0

		      ... and so forth for c'2 and c'3. The important distinction is
		      that the columns are cycling, with c0 being used with the m0
		      map when calculating c0, but c1 being used with the m0 map when
		      calculating c1 ... and so forth.

		      When performing the inverse we transform the mirror image and
		      skip the bottom row, instead of the top one, and move upwards:

		      c3 c2 c1 c0 => c0 c3 c2 c1  (cycled 3 bytes) *same as encryption
		      c3 c2 c1 c0    c1 c0 c3 c2  (cycled 2 bytes)
		      c3 c2 c1 c0    c2 c1 c0 c3  (cycled 1 byte)  *same as encryption
		      c3 c2 c1 c0    c3 c2 c1 c0

		      If you compare the resulting matrices for ShiftRows()+MixColumns()
		      and for InvShiftRows()+InvMixColumns() the 2nd and 4th columns are
		      different (in encrypt mode vs. decrypt mode). So in order to use
		      the same code to handle both encryption and decryption, we will
		      need to do some mapping.

		      If in encryption mode we let a=c0, b=c1, c=c2, d=c3, and r<N> be
		      a row number in the state, then the resulting matrix in encryption
		      mode for applying the above transformations would be:

		      r1: a b c d
		      r2: b c d a
		      r3: c d a b
		      r4: d a b c

		      If we did the same in decryption mode we would get:

		      r1: a d c b
		      r2: b a d c
		      r3: c b a d
		      r4: d c b a

		      If instead we swap d and b (set b=c3 and d=c1), then we get:

		      r1: a b c d
		      r2: d a b c
		      r3: c d a b
		      r4: b c d a

		      Now the 1st and 3rd rows are the same as the encryption matrix. All
		      we need to do then to make the mapping exactly the same is to swap
		      the 2nd and 4th rows when in decryption mode. To do this without
		      having to do it on each iteration, we swapped the 2nd and 4th rows
		      in the decryption key schedule. We also have to do the swap above
		      when we first pull in the input and when we set the final output. */
		    a2 =
		      m0[a >>> 24] ^
		      m1[b >>> 16 & 255] ^
		      m2[c >>> 8 & 255] ^
		      m3[d & 255] ^ w[++i];
		    b2 =
		      m0[b >>> 24] ^
		      m1[c >>> 16 & 255] ^
		      m2[d >>> 8 & 255] ^
		      m3[a & 255] ^ w[++i];
		    c2 =
		      m0[c >>> 24] ^
		      m1[d >>> 16 & 255] ^
		      m2[a >>> 8 & 255] ^
		      m3[b & 255] ^ w[++i];
		    d =
		      m0[d >>> 24] ^
		      m1[a >>> 16 & 255] ^
		      m2[b >>> 8 & 255] ^
		      m3[c & 255] ^ w[++i];
		    a = a2;
		    b = b2;
		    c = c2;
		  }

		  /*
		    Encrypt:
		    SubBytes(state)
		    ShiftRows(state)
		    AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])

		    Decrypt:
		    InvShiftRows(state)
		    InvSubBytes(state)
		    AddRoundKey(state, w[0, Nb-1])
		   */
		   // Note: rows are shifted inline
		  output[0] =
		    (sub[a >>> 24] << 24) ^
		    (sub[b >>> 16 & 255] << 16) ^
		    (sub[c >>> 8 & 255] << 8) ^
		    (sub[d & 255]) ^ w[++i];
		  output[decrypt ? 3 : 1] =
		    (sub[b >>> 24] << 24) ^
		    (sub[c >>> 16 & 255] << 16) ^
		    (sub[d >>> 8 & 255] << 8) ^
		    (sub[a & 255]) ^ w[++i];
		  output[2] =
		    (sub[c >>> 24] << 24) ^
		    (sub[d >>> 16 & 255] << 16) ^
		    (sub[a >>> 8 & 255] << 8) ^
		    (sub[b & 255]) ^ w[++i];
		  output[decrypt ? 1 : 3] =
		    (sub[d >>> 24] << 24) ^
		    (sub[a >>> 16 & 255] << 16) ^
		    (sub[b >>> 8 & 255] << 8) ^
		    (sub[c & 255]) ^ w[++i];
		}

		/**
		 * Deprecated. Instead, use:
		 *
		 * forge.cipher.createCipher('AES-<mode>', key);
		 * forge.cipher.createDecipher('AES-<mode>', key);
		 *
		 * Creates a deprecated AES cipher object. This object's mode will default to
		 * CBC (cipher-block-chaining).
		 *
		 * The key and iv may be given as a string of bytes, an array of bytes, a
		 * byte buffer, or an array of 32-bit words.
		 *
		 * @param options the options to use.
		 *          key the symmetric key to use.
		 *          output the buffer to write to.
		 *          decrypt true for decryption, false for encryption.
		 *          mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		function _createCipher(options) {
		  options = options || {};
		  var mode = (options.mode || 'CBC').toUpperCase();
		  var algorithm = 'AES-' + mode;

		  var cipher;
		  if(options.decrypt) {
		    cipher = forge.cipher.createDecipher(algorithm, options.key);
		  } else {
		    cipher = forge.cipher.createCipher(algorithm, options.key);
		  }

		  // backwards compatible start API
		  var start = cipher.start;
		  cipher.start = function(iv, options) {
		    // backwards compatibility: support second arg as output buffer
		    var output = null;
		    if(options instanceof forge.util.ByteBuffer) {
		      output = options;
		      options = {};
		    }
		    options = options || {};
		    options.output = output;
		    options.iv = iv;
		    start.call(cipher, options);
		  };

		  return cipher;
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'aes';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define(
		  'js/aes',['require', 'module', './cipher', './cipherModes', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Object IDs for ASN.1.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2013 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.pki = forge.pki || {};
		var oids = forge.pki.oids = forge.oids = forge.oids || {};

		// algorithm OIDs
		oids['1.2.840.113549.1.1.1'] = 'rsaEncryption';
		oids['rsaEncryption'] = '1.2.840.113549.1.1.1';
		// Note: md2 & md4 not implemented
		//oids['1.2.840.113549.1.1.2'] = 'md2WithRSAEncryption';
		//oids['md2WithRSAEncryption'] = '1.2.840.113549.1.1.2';
		//oids['1.2.840.113549.1.1.3'] = 'md4WithRSAEncryption';
		//oids['md4WithRSAEncryption'] = '1.2.840.113549.1.1.3';
		oids['1.2.840.113549.1.1.4'] = 'md5WithRSAEncryption';
		oids['md5WithRSAEncryption'] = '1.2.840.113549.1.1.4';
		oids['1.2.840.113549.1.1.5'] = 'sha1WithRSAEncryption';
		oids['sha1WithRSAEncryption'] = '1.2.840.113549.1.1.5';
		oids['1.2.840.113549.1.1.7'] = 'RSAES-OAEP';
		oids['RSAES-OAEP'] = '1.2.840.113549.1.1.7';
		oids['1.2.840.113549.1.1.8'] = 'mgf1';
		oids['mgf1'] = '1.2.840.113549.1.1.8';
		oids['1.2.840.113549.1.1.9'] = 'pSpecified';
		oids['pSpecified'] = '1.2.840.113549.1.1.9';
		oids['1.2.840.113549.1.1.10'] = 'RSASSA-PSS';
		oids['RSASSA-PSS'] = '1.2.840.113549.1.1.10';
		oids['1.2.840.113549.1.1.11'] = 'sha256WithRSAEncryption';
		oids['sha256WithRSAEncryption'] = '1.2.840.113549.1.1.11';
		oids['1.2.840.113549.1.1.12'] = 'sha384WithRSAEncryption';
		oids['sha384WithRSAEncryption'] = '1.2.840.113549.1.1.12';
		oids['1.2.840.113549.1.1.13'] = 'sha512WithRSAEncryption';
		oids['sha512WithRSAEncryption'] = '1.2.840.113549.1.1.13';

		oids['1.3.14.3.2.7'] = 'desCBC';
		oids['desCBC'] = '1.3.14.3.2.7';

		oids['1.3.14.3.2.26'] = 'sha1';
		oids['sha1'] = '1.3.14.3.2.26';
		oids['2.16.840.1.101.3.4.2.1'] = 'sha256';
		oids['sha256'] = '2.16.840.1.101.3.4.2.1';
		oids['2.16.840.1.101.3.4.2.2'] = 'sha384';
		oids['sha384'] = '2.16.840.1.101.3.4.2.2';
		oids['2.16.840.1.101.3.4.2.3'] = 'sha512';
		oids['sha512'] = '2.16.840.1.101.3.4.2.3';
		oids['1.2.840.113549.2.5'] = 'md5';
		oids['md5'] = '1.2.840.113549.2.5';

		// pkcs#7 content types
		oids['1.2.840.113549.1.7.1'] = 'data';
		oids['data'] = '1.2.840.113549.1.7.1';
		oids['1.2.840.113549.1.7.2'] = 'signedData';
		oids['signedData'] = '1.2.840.113549.1.7.2';
		oids['1.2.840.113549.1.7.3'] = 'envelopedData';
		oids['envelopedData'] = '1.2.840.113549.1.7.3';
		oids['1.2.840.113549.1.7.4'] = 'signedAndEnvelopedData';
		oids['signedAndEnvelopedData'] = '1.2.840.113549.1.7.4';
		oids['1.2.840.113549.1.7.5'] = 'digestedData';
		oids['digestedData'] = '1.2.840.113549.1.7.5';
		oids['1.2.840.113549.1.7.6'] = 'encryptedData';
		oids['encryptedData'] = '1.2.840.113549.1.7.6';

		// pkcs#9 oids
		oids['1.2.840.113549.1.9.1'] = 'emailAddress';
		oids['emailAddress'] = '1.2.840.113549.1.9.1';
		oids['1.2.840.113549.1.9.2'] = 'unstructuredName';
		oids['unstructuredName'] = '1.2.840.113549.1.9.2';
		oids['1.2.840.113549.1.9.3'] = 'contentType';
		oids['contentType'] = '1.2.840.113549.1.9.3';
		oids['1.2.840.113549.1.9.4'] = 'messageDigest';
		oids['messageDigest'] = '1.2.840.113549.1.9.4';
		oids['1.2.840.113549.1.9.5'] = 'signingTime';
		oids['signingTime'] = '1.2.840.113549.1.9.5';
		oids['1.2.840.113549.1.9.6'] = 'counterSignature';
		oids['counterSignature'] = '1.2.840.113549.1.9.6';
		oids['1.2.840.113549.1.9.7'] = 'challengePassword';
		oids['challengePassword'] = '1.2.840.113549.1.9.7';
		oids['1.2.840.113549.1.9.8'] = 'unstructuredAddress';
		oids['unstructuredAddress'] = '1.2.840.113549.1.9.8';
		oids['1.2.840.113549.1.9.14'] = 'extensionRequest';
		oids['extensionRequest'] = '1.2.840.113549.1.9.14';

		oids['1.2.840.113549.1.9.20'] = 'friendlyName';
		oids['friendlyName'] = '1.2.840.113549.1.9.20';
		oids['1.2.840.113549.1.9.21'] = 'localKeyId';
		oids['localKeyId'] = '1.2.840.113549.1.9.21';
		oids['1.2.840.113549.1.9.22.1'] = 'x509Certificate';
		oids['x509Certificate'] = '1.2.840.113549.1.9.22.1';

		// pkcs#12 safe bags
		oids['1.2.840.113549.1.12.10.1.1'] = 'keyBag';
		oids['keyBag'] = '1.2.840.113549.1.12.10.1.1';
		oids['1.2.840.113549.1.12.10.1.2'] = 'pkcs8ShroudedKeyBag';
		oids['pkcs8ShroudedKeyBag'] = '1.2.840.113549.1.12.10.1.2';
		oids['1.2.840.113549.1.12.10.1.3'] = 'certBag';
		oids['certBag'] = '1.2.840.113549.1.12.10.1.3';
		oids['1.2.840.113549.1.12.10.1.4'] = 'crlBag';
		oids['crlBag'] = '1.2.840.113549.1.12.10.1.4';
		oids['1.2.840.113549.1.12.10.1.5'] = 'secretBag';
		oids['secretBag'] = '1.2.840.113549.1.12.10.1.5';
		oids['1.2.840.113549.1.12.10.1.6'] = 'safeContentsBag';
		oids['safeContentsBag'] = '1.2.840.113549.1.12.10.1.6';

		// password-based-encryption for pkcs#12
		oids['1.2.840.113549.1.5.13'] = 'pkcs5PBES2';
		oids['pkcs5PBES2'] = '1.2.840.113549.1.5.13';
		oids['1.2.840.113549.1.5.12'] = 'pkcs5PBKDF2';
		oids['pkcs5PBKDF2'] = '1.2.840.113549.1.5.12';

		oids['1.2.840.113549.1.12.1.1'] = 'pbeWithSHAAnd128BitRC4';
		oids['pbeWithSHAAnd128BitRC4'] = '1.2.840.113549.1.12.1.1';
		oids['1.2.840.113549.1.12.1.2'] = 'pbeWithSHAAnd40BitRC4';
		oids['pbeWithSHAAnd40BitRC4'] = '1.2.840.113549.1.12.1.2';
		oids['1.2.840.113549.1.12.1.3'] = 'pbeWithSHAAnd3-KeyTripleDES-CBC';
		oids['pbeWithSHAAnd3-KeyTripleDES-CBC'] = '1.2.840.113549.1.12.1.3';
		oids['1.2.840.113549.1.12.1.4'] = 'pbeWithSHAAnd2-KeyTripleDES-CBC';
		oids['pbeWithSHAAnd2-KeyTripleDES-CBC'] = '1.2.840.113549.1.12.1.4';
		oids['1.2.840.113549.1.12.1.5'] = 'pbeWithSHAAnd128BitRC2-CBC';
		oids['pbeWithSHAAnd128BitRC2-CBC'] = '1.2.840.113549.1.12.1.5';
		oids['1.2.840.113549.1.12.1.6'] = 'pbewithSHAAnd40BitRC2-CBC';
		oids['pbewithSHAAnd40BitRC2-CBC'] = '1.2.840.113549.1.12.1.6';

		// symmetric key algorithm oids
		oids['1.2.840.113549.3.7'] = 'des-EDE3-CBC';
		oids['des-EDE3-CBC'] = '1.2.840.113549.3.7';
		oids['2.16.840.1.101.3.4.1.2'] = 'aes128-CBC';
		oids['aes128-CBC'] = '2.16.840.1.101.3.4.1.2';
		oids['2.16.840.1.101.3.4.1.22'] = 'aes192-CBC';
		oids['aes192-CBC'] = '2.16.840.1.101.3.4.1.22';
		oids['2.16.840.1.101.3.4.1.42'] = 'aes256-CBC';
		oids['aes256-CBC'] = '2.16.840.1.101.3.4.1.42';

		// certificate issuer/subject OIDs
		oids['2.5.4.3'] = 'commonName';
		oids['commonName'] = '2.5.4.3';
		oids['2.5.4.5'] = 'serialName';
		oids['serialName'] = '2.5.4.5';
		oids['2.5.4.6'] = 'countryName';
		oids['countryName'] = '2.5.4.6';
		oids['2.5.4.7'] = 'localityName';
		oids['localityName'] = '2.5.4.7';
		oids['2.5.4.8'] = 'stateOrProvinceName';
		oids['stateOrProvinceName'] = '2.5.4.8';
		oids['2.5.4.10'] = 'organizationName';
		oids['organizationName'] = '2.5.4.10';
		oids['2.5.4.11'] = 'organizationalUnitName';
		oids['organizationalUnitName'] = '2.5.4.11';

		// X.509 extension OIDs
		oids['2.16.840.1.113730.1.1'] = 'nsCertType';
		oids['nsCertType'] = '2.16.840.1.113730.1.1';
		oids['2.5.29.1'] = 'authorityKeyIdentifier'; // deprecated, use .35
		oids['2.5.29.2'] = 'keyAttributes'; // obsolete use .37 or .15
		oids['2.5.29.3'] = 'certificatePolicies'; // deprecated, use .32
		oids['2.5.29.4'] = 'keyUsageRestriction'; // obsolete use .37 or .15
		oids['2.5.29.5'] = 'policyMapping'; // deprecated use .33
		oids['2.5.29.6'] = 'subtreesConstraint'; // obsolete use .30
		oids['2.5.29.7'] = 'subjectAltName'; // deprecated use .17
		oids['2.5.29.8'] = 'issuerAltName'; // deprecated use .18
		oids['2.5.29.9'] = 'subjectDirectoryAttributes';
		oids['2.5.29.10'] = 'basicConstraints'; // deprecated use .19
		oids['2.5.29.11'] = 'nameConstraints'; // deprecated use .30
		oids['2.5.29.12'] = 'policyConstraints'; // deprecated use .36
		oids['2.5.29.13'] = 'basicConstraints'; // deprecated use .19
		oids['2.5.29.14'] = 'subjectKeyIdentifier';
		oids['subjectKeyIdentifier'] = '2.5.29.14';
		oids['2.5.29.15'] = 'keyUsage';
		oids['keyUsage'] = '2.5.29.15';
		oids['2.5.29.16'] = 'privateKeyUsagePeriod';
		oids['2.5.29.17'] = 'subjectAltName';
		oids['subjectAltName'] = '2.5.29.17';
		oids['2.5.29.18'] = 'issuerAltName';
		oids['issuerAltName'] = '2.5.29.18';
		oids['2.5.29.19'] = 'basicConstraints';
		oids['basicConstraints'] = '2.5.29.19';
		oids['2.5.29.20'] = 'cRLNumber';
		oids['2.5.29.21'] = 'cRLReason';
		oids['2.5.29.22'] = 'expirationDate';
		oids['2.5.29.23'] = 'instructionCode';
		oids['2.5.29.24'] = 'invalidityDate';
		oids['2.5.29.25'] = 'cRLDistributionPoints'; // deprecated use .31
		oids['2.5.29.26'] = 'issuingDistributionPoint'; // deprecated use .28
		oids['2.5.29.27'] = 'deltaCRLIndicator';
		oids['2.5.29.28'] = 'issuingDistributionPoint';
		oids['2.5.29.29'] = 'certificateIssuer';
		oids['2.5.29.30'] = 'nameConstraints';
		oids['2.5.29.31'] = 'cRLDistributionPoints';
		oids['2.5.29.32'] = 'certificatePolicies';
		oids['2.5.29.33'] = 'policyMappings';
		oids['2.5.29.34'] = 'policyConstraints'; // deprecated use .36
		oids['2.5.29.35'] = 'authorityKeyIdentifier';
		oids['2.5.29.36'] = 'policyConstraints';
		oids['2.5.29.37'] = 'extKeyUsage';
		oids['extKeyUsage'] = '2.5.29.37';
		oids['2.5.29.46'] = 'freshestCRL';
		oids['2.5.29.54'] = 'inhibitAnyPolicy';

		// extKeyUsage purposes
		oids['1.3.6.1.5.5.7.3.1'] = 'serverAuth';
		oids['serverAuth'] = '1.3.6.1.5.5.7.3.1';
		oids['1.3.6.1.5.5.7.3.2'] = 'clientAuth';
		oids['clientAuth'] = '1.3.6.1.5.5.7.3.2';
		oids['1.3.6.1.5.5.7.3.3'] = 'codeSigning';
		oids['codeSigning'] = '1.3.6.1.5.5.7.3.3';
		oids['1.3.6.1.5.5.7.3.4'] = 'emailProtection';
		oids['emailProtection'] = '1.3.6.1.5.5.7.3.4';
		oids['1.3.6.1.5.5.7.3.8'] = 'timeStamping';
		oids['timeStamping'] = '1.3.6.1.5.5.7.3.8';

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'oids';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/oids',['require', 'module'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of Abstract Syntax Notation Number One.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2015 Digital Bazaar, Inc.
		 *
		 * An API for storing data using the Abstract Syntax Notation Number One
		 * format using DER (Distinguished Encoding Rules) encoding. This encoding is
		 * commonly used to store data for PKI, i.e. X.509 Certificates, and this
		 * implementation exists for that purpose.
		 *
		 * Abstract Syntax Notation Number One (ASN.1) is used to define the abstract
		 * syntax of information without restricting the way the information is encoded
		 * for transmission. It provides a standard that allows for open systems
		 * communication. ASN.1 defines the syntax of information data and a number of
		 * simple data types as well as a notation for describing them and specifying
		 * values for them.
		 *
		 * The RSA algorithm creates public and private keys that are often stored in
		 * X.509 or PKCS#X formats -- which use ASN.1 (encoded in DER format). This
		 * class provides the most basic functionality required to store and load DSA
		 * keys that are encoded according to ASN.1.
		 *
		 * The most common binary encodings for ASN.1 are BER (Basic Encoding Rules)
		 * and DER (Distinguished Encoding Rules). DER is just a subset of BER that
		 * has stricter requirements for how data must be encoded.
		 *
		 * Each ASN.1 structure has a tag (a byte identifying the ASN.1 structure type)
		 * and a byte array for the value of this ASN1 structure which may be data or a
		 * list of ASN.1 structures.
		 *
		 * Each ASN.1 structure using BER is (Tag-Length-Value):
		 *
		 * | byte 0 | bytes X | bytes Y |
		 * |--------|---------|----------
		 * |  tag   | length  |  value  |
		 *
		 * ASN.1 allows for tags to be of "High-tag-number form" which allows a tag to
		 * be two or more octets, but that is not supported by this class. A tag is
		 * only 1 byte. Bits 1-5 give the tag number (ie the data type within a
		 * particular 'class'), 6 indicates whether or not the ASN.1 value is
		 * constructed from other ASN.1 values, and bits 7 and 8 give the 'class'. If
		 * bits 7 and 8 are both zero, the class is UNIVERSAL. If only bit 7 is set,
		 * then the class is APPLICATION. If only bit 8 is set, then the class is
		 * CONTEXT_SPECIFIC. If both bits 7 and 8 are set, then the class is PRIVATE.
		 * The tag numbers for the data types for the class UNIVERSAL are listed below:
		 *
		 * UNIVERSAL 0 Reserved for use by the encoding rules
		 * UNIVERSAL 1 Boolean type
		 * UNIVERSAL 2 Integer type
		 * UNIVERSAL 3 Bitstring type
		 * UNIVERSAL 4 Octetstring type
		 * UNIVERSAL 5 Null type
		 * UNIVERSAL 6 Object identifier type
		 * UNIVERSAL 7 Object descriptor type
		 * UNIVERSAL 8 External type and Instance-of type
		 * UNIVERSAL 9 Real type
		 * UNIVERSAL 10 Enumerated type
		 * UNIVERSAL 11 Embedded-pdv type
		 * UNIVERSAL 12 UTF8String type
		 * UNIVERSAL 13 Relative object identifier type
		 * UNIVERSAL 14-15 Reserved for future editions
		 * UNIVERSAL 16 Sequence and Sequence-of types
		 * UNIVERSAL 17 Set and Set-of types
		 * UNIVERSAL 18-22, 25-30 Character string types
		 * UNIVERSAL 23-24 Time types
		 *
		 * The length of an ASN.1 structure is specified after the tag identifier.
		 * There is a definite form and an indefinite form. The indefinite form may
		 * be used if the encoding is constructed and not all immediately available.
		 * The indefinite form is encoded using a length byte with only the 8th bit
		 * set. The end of the constructed object is marked using end-of-contents
		 * octets (two zero bytes).
		 *
		 * The definite form looks like this:
		 *
		 * The length may take up 1 or more bytes, it depends on the length of the
		 * value of the ASN.1 structure. DER encoding requires that if the ASN.1
		 * structure has a value that has a length greater than 127, more than 1 byte
		 * will be used to store its length, otherwise just one byte will be used.
		 * This is strict.
		 *
		 * In the case that the length of the ASN.1 value is less than 127, 1 octet
		 * (byte) is used to store the "short form" length. The 8th bit has a value of
		 * 0 indicating the length is "short form" and not "long form" and bits 7-1
		 * give the length of the data. (The 8th bit is the left-most, most significant
		 * bit: also known as big endian or network format).
		 *
		 * In the case that the length of the ASN.1 value is greater than 127, 2 to
		 * 127 octets (bytes) are used to store the "long form" length. The first
		 * byte's 8th bit is set to 1 to indicate the length is "long form." Bits 7-1
		 * give the number of additional octets. All following octets are in base 256
		 * with the most significant digit first (typical big-endian binary unsigned
		 * integer storage). So, for instance, if the length of a value was 257, the
		 * first byte would be set to:
		 *
		 * 10000010 = 130 = 0x82.
		 *
		 * This indicates there are 2 octets (base 256) for the length. The second and
		 * third bytes (the octets just mentioned) would store the length in base 256:
		 *
		 * octet 2: 00000001 = 1 * 256^1 = 256
		 * octet 3: 00000001 = 1 * 256^0 = 1
		 * total = 257
		 *
		 * The algorithm for converting a js integer value of 257 to base-256 is:
		 *
		 * var value = 257;
		 * var bytes = [];
		 * bytes[0] = (value >>> 8) & 0xFF; // most significant byte first
		 * bytes[1] = value & 0xFF;        // least significant byte last
		 *
		 * On the ASN.1 UNIVERSAL Object Identifier (OID) type:
		 *
		 * An OID can be written like: "value1.value2.value3...valueN"
		 *
		 * The DER encoding rules:
		 *
		 * The first byte has the value 40 * value1 + value2.
		 * The following bytes, if any, encode the remaining values. Each value is
		 * encoded in base 128, most significant digit first (big endian), with as
		 * few digits as possible, and the most significant bit of each byte set
		 * to 1 except the last in each value's encoding. For example: Given the
		 * OID "1.2.840.113549", its DER encoding is (remember each byte except the
		 * last one in each encoding is OR'd with 0x80):
		 *
		 * byte 1: 40 * 1 + 2 = 42 = 0x2A.
		 * bytes 2-3: 128 * 6 + 72 = 840 = 6 72 = 6 72 = 0x0648 = 0x8648
		 * bytes 4-6: 16384 * 6 + 128 * 119 + 13 = 6 119 13 = 0x06770D = 0x86F70D
		 *
		 * The final value is: 0x2A864886F70D.
		 * The full OID (including ASN.1 tag and length of 6 bytes) is:
		 * 0x06062A864886F70D
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* ASN.1 API */
		var asn1 = forge.asn1 = forge.asn1 || {};

		/**
		 * ASN.1 classes.
		 */
		asn1.Class = {
		  UNIVERSAL:        0x00,
		  APPLICATION:      0x40,
		  CONTEXT_SPECIFIC: 0x80,
		  PRIVATE:          0xC0
		};

		/**
		 * ASN.1 types. Not all types are supported by this implementation, only
		 * those necessary to implement a simple PKI are implemented.
		 */
		asn1.Type = {
		  NONE:             0,
		  BOOLEAN:          1,
		  INTEGER:          2,
		  BITSTRING:        3,
		  OCTETSTRING:      4,
		  NULL:             5,
		  OID:              6,
		  ODESC:            7,
		  EXTERNAL:         8,
		  REAL:             9,
		  ENUMERATED:      10,
		  EMBEDDED:        11,
		  UTF8:            12,
		  ROID:            13,
		  SEQUENCE:        16,
		  SET:             17,
		  PRINTABLESTRING: 19,
		  IA5STRING:       22,
		  UTCTIME:         23,
		  GENERALIZEDTIME: 24,
		  BMPSTRING:       30
		};

		/**
		 * Creates a new asn1 object.
		 *
		 * @param tagClass the tag class for the object.
		 * @param type the data type (tag number) for the object.
		 * @param constructed true if the asn1 object is in constructed form.
		 * @param value the value for the object, if it is not constructed.
		 *
		 * @return the asn1 object.
		 */
		asn1.create = function(tagClass, type, constructed, value) {
		  /* An asn1 object has a tagClass, a type, a constructed flag, and a
		    value. The value's type depends on the constructed flag. If
		    constructed, it will contain a list of other asn1 objects. If not,
		    it will contain the ASN.1 value as an array of bytes formatted
		    according to the ASN.1 data type. */

		  // remove undefined values
		  if(forge.util.isArray(value)) {
		    var tmp = [];
		    for(var i = 0; i < value.length; ++i) {
		      if(value[i] !== undefined) {
		        tmp.push(value[i]);
		      }
		    }
		    value = tmp;
		  }

		  return {
		    tagClass: tagClass,
		    type: type,
		    constructed: constructed,
		    composed: constructed || forge.util.isArray(value),
		    value: value
		  };
		};

		/**
		 * Gets the length of a BER-encoded ASN.1 value.
		 *
		 * In case the length is not specified, undefined is returned.
		 *
		 * @param b the BER-encoded ASN.1 byte buffer, starting with the first
		 *          length byte.
		 *
		 * @return the length of the BER-encoded ASN.1 value or undefined.
		 */
		var _getValueLength = asn1.getBerValueLength = function(b) {
		  // TODO: move this function and related DER/BER functions to a der.js
		  // file; better abstract ASN.1 away from der/ber.
		  var b2 = b.getByte();
		  if(b2 === 0x80) {
		    return undefined;
		  }

		  // see if the length is "short form" or "long form" (bit 8 set)
		  var length;
		  var longForm = b2 & 0x80;
		  if(!longForm) {
		    // length is just the first byte
		    length = b2;
		  } else {
		    // the number of bytes the length is specified in bits 7 through 1
		    // and each length byte is in big-endian base-256
		    length = b.getInt((b2 & 0x7F) << 3);
		  }
		  return length;
		};

		/**
		 * Parses an asn1 object from a byte buffer in DER format.
		 *
		 * @param bytes the byte buffer to parse from.
		 * @param strict true to be strict when checking value lengths, false to
		 *          allow truncated values (default: true).
		 *
		 * @return the parsed asn1 object.
		 */
		asn1.fromDer = function(bytes, strict) {
		  if(strict === undefined) {
		    strict = true;
		  }

		  // wrap in buffer if needed
		  if(typeof bytes === 'string') {
		    bytes = forge.util.createBuffer(bytes);
		  }

		  // minimum length for ASN.1 DER structure is 2
		  if(bytes.length() < 2) {
		    var error = new Error('Too few bytes to parse DER.');
		    error.bytes = bytes.length();
		    throw error;
		  }

		  // get the first byte
		  var b1 = bytes.getByte();

		  // get the tag class
		  var tagClass = (b1 & 0xC0);

		  // get the type (bits 1-5)
		  var type = b1 & 0x1F;

		  // get the value length
		  var length = _getValueLength(bytes);

		  // ensure there are enough bytes to get the value
		  if(bytes.length() < length) {
		    if(strict) {
		      var error = new Error('Too few bytes to read ASN.1 value.');
		      error.detail = bytes.length() + ' < ' + length;
		      throw error;
		    }
		    // Note: be lenient with truncated values
		    length = bytes.length();
		  }

		  // prepare to get value
		  var value;

		  // constructed flag is bit 6 (32 = 0x20) of the first byte
		  var constructed = ((b1 & 0x20) === 0x20);

		  // determine if the value is composed of other ASN.1 objects (if its
		  // constructed it will be and if its a BITSTRING it may be)
		  var composed = constructed;
		  if(!composed && tagClass === asn1.Class.UNIVERSAL &&
		    type === asn1.Type.BITSTRING && length > 1) {
		    /* The first octet gives the number of bits by which the length of the
		      bit string is less than the next multiple of eight (this is called
		      the "number of unused bits").

		      The second and following octets give the value of the bit string
		      converted to an octet string. */
		    // if there are no unused bits, maybe the bitstring holds ASN.1 objs
		    var read = bytes.read;
		    var unused = bytes.getByte();
		    if(unused === 0) {
		      // if the first byte indicates UNIVERSAL or CONTEXT_SPECIFIC,
		      // and the length is valid, assume we've got an ASN.1 object
		      b1 = bytes.getByte();
		      var tc = (b1 & 0xC0);
		      if(tc === asn1.Class.UNIVERSAL || tc === asn1.Class.CONTEXT_SPECIFIC) {
		        try {
		          var len = _getValueLength(bytes);
		          composed = (len === length - (bytes.read - read));
		          if(composed) {
		            // adjust read/length to account for unused bits byte
		            ++read;
		            --length;
		          }
		        } catch(ex) {}
		      }
		    }
		    // restore read pointer
		    bytes.read = read;
		  }

		  if(composed) {
		    // parse child asn1 objects from the value
		    value = [];
		    if(length === undefined) {
		      // asn1 object of indefinite length, read until end tag
		      for(;;) {
		        if(bytes.bytes(2) === String.fromCharCode(0, 0)) {
		          bytes.getBytes(2);
		          break;
		        }
		        value.push(asn1.fromDer(bytes, strict));
		      }
		    } else {
		      // parsing asn1 object of definite length
		      var start = bytes.length();
		      while(length > 0) {
		        value.push(asn1.fromDer(bytes, strict));
		        length -= start - bytes.length();
		        start = bytes.length();
		      }
		    }
		  } else {
		    // asn1 not composed, get raw value
		    // TODO: do DER to OID conversion and vice-versa in .toDer?

		    if(length === undefined) {
		      if(strict) {
		        throw new Error('Non-constructed ASN.1 object of indefinite length.');
		      }
		      // be lenient and use remaining bytes
		      length = bytes.length();
		    }

		    if(type === asn1.Type.BMPSTRING) {
		      value = '';
		      for(var i = 0; i < length; i += 2) {
		        value += String.fromCharCode(bytes.getInt16());
		      }
		    } else {
		      value = bytes.getBytes(length);
		    }
		  }

		  // create and return asn1 object
		  return asn1.create(tagClass, type, constructed, value);
		};

		/**
		 * Converts the given asn1 object to a buffer of bytes in DER format.
		 *
		 * @param asn1 the asn1 object to convert to bytes.
		 *
		 * @return the buffer of bytes.
		 */
		asn1.toDer = function(obj) {
		  var bytes = forge.util.createBuffer();

		  // build the first byte
		  var b1 = obj.tagClass | obj.type;

		  // for storing the ASN.1 value
		  var value = forge.util.createBuffer();

		  // if composed, use each child asn1 object's DER bytes as value
		  if(obj.composed) {
		    // turn on 6th bit (0x20 = 32) to indicate asn1 is constructed
		    // from other asn1 objects
		    if(obj.constructed) {
		      b1 |= 0x20;
		    } else {
		      // type is a bit string, add unused bits of 0x00
		      value.putByte(0x00);
		    }

		    // add all of the child DER bytes together
		    for(var i = 0; i < obj.value.length; ++i) {
		      if(obj.value[i] !== undefined) {
		        value.putBuffer(asn1.toDer(obj.value[i]));
		      }
		    }
		  } else {
		    // use asn1.value directly
		    if(obj.type === asn1.Type.BMPSTRING) {
		      for(var i = 0; i < obj.value.length; ++i) {
		        value.putInt16(obj.value.charCodeAt(i));
		      }
		    } else {
		      value.putBytes(obj.value);
		    }
		  }

		  // add tag byte
		  bytes.putByte(b1);

		  // use "short form" encoding
		  if(value.length() <= 127) {
		    // one byte describes the length
		    // bit 8 = 0 and bits 7-1 = length
		    bytes.putByte(value.length() & 0x7F);
		  } else {
		    // use "long form" encoding
		    // 2 to 127 bytes describe the length
		    // first byte: bit 8 = 1 and bits 7-1 = # of additional bytes
		    // other bytes: length in base 256, big-endian
		    var len = value.length();
		    var lenBytes = '';
		    do {
		      lenBytes += String.fromCharCode(len & 0xFF);
		      len = len >>> 8;
		    } while(len > 0);

		    // set first byte to # bytes used to store the length and turn on
		    // bit 8 to indicate long-form length is used
		    bytes.putByte(lenBytes.length | 0x80);

		    // concatenate length bytes in reverse since they were generated
		    // little endian and we need big endian
		    for(var i = lenBytes.length - 1; i >= 0; --i) {
		      bytes.putByte(lenBytes.charCodeAt(i));
		    }
		  }

		  // concatenate value bytes
		  bytes.putBuffer(value);
		  return bytes;
		};

		/**
		 * Converts an OID dot-separated string to a byte buffer. The byte buffer
		 * contains only the DER-encoded value, not any tag or length bytes.
		 *
		 * @param oid the OID dot-separated string.
		 *
		 * @return the byte buffer.
		 */
		asn1.oidToDer = function(oid) {
		  // split OID into individual values
		  var values = oid.split('.');
		  var bytes = forge.util.createBuffer();

		  // first byte is 40 * value1 + value2
		  bytes.putByte(40 * parseInt(values[0], 10) + parseInt(values[1], 10));
		  // other bytes are each value in base 128 with 8th bit set except for
		  // the last byte for each value
		  var last, valueBytes, value, b;
		  for(var i = 2; i < values.length; ++i) {
		    // produce value bytes in reverse because we don't know how many
		    // bytes it will take to store the value
		    last = true;
		    valueBytes = [];
		    value = parseInt(values[i], 10);
		    do {
		      b = value & 0x7F;
		      value = value >>> 7;
		      // if value is not last, then turn on 8th bit
		      if(!last) {
		        b |= 0x80;
		      }
		      valueBytes.push(b);
		      last = false;
		    } while(value > 0);

		    // add value bytes in reverse (needs to be in big endian)
		    for(var n = valueBytes.length - 1; n >= 0; --n) {
		      bytes.putByte(valueBytes[n]);
		    }
		  }

		  return bytes;
		};

		/**
		 * Converts a DER-encoded byte buffer to an OID dot-separated string. The
		 * byte buffer should contain only the DER-encoded value, not any tag or
		 * length bytes.
		 *
		 * @param bytes the byte buffer.
		 *
		 * @return the OID dot-separated string.
		 */
		asn1.derToOid = function(bytes) {
		  var oid;

		  // wrap in buffer if needed
		  if(typeof bytes === 'string') {
		    bytes = forge.util.createBuffer(bytes);
		  }

		  // first byte is 40 * value1 + value2
		  var b = bytes.getByte();
		  oid = Math.floor(b / 40) + '.' + (b % 40);

		  // other bytes are each value in base 128 with 8th bit set except for
		  // the last byte for each value
		  var value = 0;
		  while(bytes.length() > 0) {
		    b = bytes.getByte();
		    value = value << 7;
		    // not the last byte for the value
		    if(b & 0x80) {
		      value += b & 0x7F;
		    } else {
		      // last byte
		      oid += '.' + (value + b);
		      value = 0;
		    }
		  }

		  return oid;
		};

		/**
		 * Converts a UTCTime value to a date.
		 *
		 * Note: GeneralizedTime has 4 digits for the year and is used for X.509
		 * dates passed 2049. Parsing that structure hasn't been implemented yet.
		 *
		 * @param utc the UTCTime value to convert.
		 *
		 * @return the date.
		 */
		asn1.utcTimeToDate = function(utc) {
		  /* The following formats can be used:

		    YYMMDDhhmmZ
		    YYMMDDhhmm+hh'mm'
		    YYMMDDhhmm-hh'mm'
		    YYMMDDhhmmssZ
		    YYMMDDhhmmss+hh'mm'
		    YYMMDDhhmmss-hh'mm'

		    Where:

		    YY is the least significant two digits of the year
		    MM is the month (01 to 12)
		    DD is the day (01 to 31)
		    hh is the hour (00 to 23)
		    mm are the minutes (00 to 59)
		    ss are the seconds (00 to 59)
		    Z indicates that local time is GMT, + indicates that local time is
		    later than GMT, and - indicates that local time is earlier than GMT
		    hh' is the absolute value of the offset from GMT in hours
		    mm' is the absolute value of the offset from GMT in minutes */
		  var date = new Date();

		  // if YY >= 50 use 19xx, if YY < 50 use 20xx
		  var year = parseInt(utc.substr(0, 2), 10);
		  year = (year >= 50) ? 1900 + year : 2000 + year;
		  var MM = parseInt(utc.substr(2, 2), 10) - 1; // use 0-11 for month
		  var DD = parseInt(utc.substr(4, 2), 10);
		  var hh = parseInt(utc.substr(6, 2), 10);
		  var mm = parseInt(utc.substr(8, 2), 10);
		  var ss = 0;

		  // not just YYMMDDhhmmZ
		  if(utc.length > 11) {
		    // get character after minutes
		    var c = utc.charAt(10);
		    var end = 10;

		    // see if seconds are present
		    if(c !== '+' && c !== '-') {
		      // get seconds
		      ss = parseInt(utc.substr(10, 2), 10);
		      end += 2;
		    }
		  }

		  // update date
		  date.setUTCFullYear(year, MM, DD);
		  date.setUTCHours(hh, mm, ss, 0);

		  if(end) {
		    // get +/- after end of time
		    c = utc.charAt(end);
		    if(c === '+' || c === '-') {
		      // get hours+minutes offset
		      var hhoffset = parseInt(utc.substr(end + 1, 2), 10);
		      var mmoffset = parseInt(utc.substr(end + 4, 2), 10);

		      // calculate offset in milliseconds
		      var offset = hhoffset * 60 + mmoffset;
		      offset *= 60000;

		      // apply offset
		      if(c === '+') {
		        date.setTime(+date - offset);
		      } else {
		        date.setTime(+date + offset);
		      }
		    }
		  }

		  return date;
		};

		/**
		 * Converts a GeneralizedTime value to a date.
		 *
		 * @param gentime the GeneralizedTime value to convert.
		 *
		 * @return the date.
		 */
		asn1.generalizedTimeToDate = function(gentime) {
		  /* The following formats can be used:

		    YYYYMMDDHHMMSS
		    YYYYMMDDHHMMSS.fff
		    YYYYMMDDHHMMSSZ
		    YYYYMMDDHHMMSS.fffZ
		    YYYYMMDDHHMMSS+hh'mm'
		    YYYYMMDDHHMMSS.fff+hh'mm'
		    YYYYMMDDHHMMSS-hh'mm'
		    YYYYMMDDHHMMSS.fff-hh'mm'

		    Where:

		    YYYY is the year
		    MM is the month (01 to 12)
		    DD is the day (01 to 31)
		    hh is the hour (00 to 23)
		    mm are the minutes (00 to 59)
		    ss are the seconds (00 to 59)
		    .fff is the second fraction, accurate to three decimal places
		    Z indicates that local time is GMT, + indicates that local time is
		    later than GMT, and - indicates that local time is earlier than GMT
		    hh' is the absolute value of the offset from GMT in hours
		    mm' is the absolute value of the offset from GMT in minutes */
		  var date = new Date();

		  var YYYY = parseInt(gentime.substr(0, 4), 10);
		  var MM = parseInt(gentime.substr(4, 2), 10) - 1; // use 0-11 for month
		  var DD = parseInt(gentime.substr(6, 2), 10);
		  var hh = parseInt(gentime.substr(8, 2), 10);
		  var mm = parseInt(gentime.substr(10, 2), 10);
		  var ss = parseInt(gentime.substr(12, 2), 10);
		  var fff = 0;
		  var offset = 0;
		  var isUTC = false;

		  if(gentime.charAt(gentime.length - 1) === 'Z') {
		    isUTC = true;
		  }

		  var end = gentime.length - 5, c = gentime.charAt(end);
		  if(c === '+' || c === '-') {
		    // get hours+minutes offset
		    var hhoffset = parseInt(gentime.substr(end + 1, 2), 10);
		    var mmoffset = parseInt(gentime.substr(end + 4, 2), 10);

		    // calculate offset in milliseconds
		    offset = hhoffset * 60 + mmoffset;
		    offset *= 60000;

		    // apply offset
		    if(c === '+') {
		      offset *= -1;
		    }

		    isUTC = true;
		  }

		  // check for second fraction
		  if(gentime.charAt(14) === '.') {
		    fff = parseFloat(gentime.substr(14), 10) * 1000;
		  }

		  if(isUTC) {
		    date.setUTCFullYear(YYYY, MM, DD);
		    date.setUTCHours(hh, mm, ss, fff);

		    // apply offset
		    date.setTime(+date + offset);
		  } else {
		    date.setFullYear(YYYY, MM, DD);
		    date.setHours(hh, mm, ss, fff);
		  }

		  return date;
		};

		/**
		 * Converts a date to a UTCTime value.
		 *
		 * Note: GeneralizedTime has 4 digits for the year and is used for X.509
		 * dates passed 2049. Converting to a GeneralizedTime hasn't been
		 * implemented yet.
		 *
		 * @param date the date to convert.
		 *
		 * @return the UTCTime value.
		 */
		asn1.dateToUtcTime = function(date) {
		  // TODO: validate; currently assumes proper format
		  if(typeof date === 'string') {
		    return date;
		  }

		  var rval = '';

		  // create format YYMMDDhhmmssZ
		  var format = [];
		  format.push(('' + date.getUTCFullYear()).substr(2));
		  format.push('' + (date.getUTCMonth() + 1));
		  format.push('' + date.getUTCDate());
		  format.push('' + date.getUTCHours());
		  format.push('' + date.getUTCMinutes());
		  format.push('' + date.getUTCSeconds());

		  // ensure 2 digits are used for each format entry
		  for(var i = 0; i < format.length; ++i) {
		    if(format[i].length < 2) {
		      rval += '0';
		    }
		    rval += format[i];
		  }
		  rval += 'Z';

		  return rval;
		};

		/**
		 * Converts a date to a GeneralizedTime value.
		 *
		 * @param date the date to convert.
		 *
		 * @return the GeneralizedTime value as a string.
		 */
		asn1.dateToGeneralizedTime = function(date) {
		  // TODO: validate; currently assumes proper format
		  if(typeof date === 'string') {
		    return date;
		  }

		  var rval = '';

		  // create format YYYYMMDDHHMMSSZ
		  var format = [];
		  format.push('' + date.getUTCFullYear());
		  format.push('' + (date.getUTCMonth() + 1));
		  format.push('' + date.getUTCDate());
		  format.push('' + date.getUTCHours());
		  format.push('' + date.getUTCMinutes());
		  format.push('' + date.getUTCSeconds());

		  // ensure 2 digits are used for each format entry
		  for(var i = 0; i < format.length; ++i) {
		    if(format[i].length < 2) {
		      rval += '0';
		    }
		    rval += format[i];
		  }
		  rval += 'Z';

		  return rval;
		};

		/**
		 * Converts a javascript integer to a DER-encoded byte buffer to be used
		 * as the value for an INTEGER type.
		 *
		 * @param x the integer.
		 *
		 * @return the byte buffer.
		 */
		asn1.integerToDer = function(x) {
		  var rval = forge.util.createBuffer();
		  if(x >= -0x80 && x < 0x80) {
		    return rval.putSignedInt(x, 8);
		  }
		  if(x >= -0x8000 && x < 0x8000) {
		    return rval.putSignedInt(x, 16);
		  }
		  if(x >= -0x800000 && x < 0x800000) {
		    return rval.putSignedInt(x, 24);
		  }
		  if(x >= -0x80000000 && x < 0x80000000) {
		    return rval.putSignedInt(x, 32);
		  }
		  var error = new Error('Integer too large; max is 32-bits.');
		  error.integer = x;
		  throw error;
		};

		/**
		 * Converts a DER-encoded byte buffer to a javascript integer. This is
		 * typically used to decode the value of an INTEGER type.
		 *
		 * @param bytes the byte buffer.
		 *
		 * @return the integer.
		 */
		asn1.derToInteger = function(bytes) {
		  // wrap in buffer if needed
		  if(typeof bytes === 'string') {
		    bytes = forge.util.createBuffer(bytes);
		  }

		  var n = bytes.length() * 8;
		  if(n > 32) {
		    throw new Error('Integer too large; max is 32-bits.');
		  }
		  return bytes.getSignedInt(n);
		};

		/**
		 * Validates the that given ASN.1 object is at least a super set of the
		 * given ASN.1 structure. Only tag classes and types are checked. An
		 * optional map may also be provided to capture ASN.1 values while the
		 * structure is checked.
		 *
		 * To capture an ASN.1 value, set an object in the validator's 'capture'
		 * parameter to the key to use in the capture map. To capture the full
		 * ASN.1 object, specify 'captureAsn1'.
		 *
		 * Objects in the validator may set a field 'optional' to true to indicate
		 * that it isn't necessary to pass validation.
		 *
		 * @param obj the ASN.1 object to validate.
		 * @param v the ASN.1 structure validator.
		 * @param capture an optional map to capture values in.
		 * @param errors an optional array for storing validation errors.
		 *
		 * @return true on success, false on failure.
		 */
		asn1.validate = function(obj, v, capture, errors) {
		  var rval = false;

		  // ensure tag class and type are the same if specified
		  if((obj.tagClass === v.tagClass || typeof(v.tagClass) === 'undefined') &&
		    (obj.type === v.type || typeof(v.type) === 'undefined')) {
		    // ensure constructed flag is the same if specified
		    if(obj.constructed === v.constructed ||
		      typeof(v.constructed) === 'undefined') {
		      rval = true;

		      // handle sub values
		      if(v.value && forge.util.isArray(v.value)) {
		        var j = 0;
		        for(var i = 0; rval && i < v.value.length; ++i) {
		          rval = v.value[i].optional || false;
		          if(obj.value[j]) {
		            rval = asn1.validate(obj.value[j], v.value[i], capture, errors);
		            if(rval) {
		              ++j;
		            } else if(v.value[i].optional) {
		              rval = true;
		            }
		          }
		          if(!rval && errors) {
		            errors.push(
		              '[' + v.name + '] ' +
		              'Tag class "' + v.tagClass + '", type "' +
		              v.type + '" expected value length "' +
		              v.value.length + '", got "' +
		              obj.value.length + '"');
		          }
		        }
		      }

		      if(rval && capture) {
		        if(v.capture) {
		          capture[v.capture] = obj.value;
		        }
		        if(v.captureAsn1) {
		          capture[v.captureAsn1] = obj;
		        }
		      }
		    } else if(errors) {
		      errors.push(
		        '[' + v.name + '] ' +
		        'Expected constructed "' + v.constructed + '", got "' +
		        obj.constructed + '"');
		    }
		  } else if(errors) {
		    if(obj.tagClass !== v.tagClass) {
		      errors.push(
		        '[' + v.name + '] ' +
		        'Expected tag class "' + v.tagClass + '", got "' +
		        obj.tagClass + '"');
		    }
		    if(obj.type !== v.type) {
		      errors.push(
		        '[' + v.name + '] ' +
		        'Expected type "' + v.type + '", got "' + obj.type + '"');
		    }
		  }
		  return rval;
		};

		// regex for testing for non-latin characters
		var _nonLatinRegex = /[^\\u0000-\\u00ff]/;

		/**
		 * Pretty prints an ASN.1 object to a string.
		 *
		 * @param obj the object to write out.
		 * @param level the level in the tree.
		 * @param indentation the indentation to use.
		 *
		 * @return the string.
		 */
		asn1.prettyPrint = function(obj, level, indentation) {
		  var rval = '';

		  // set default level and indentation
		  level = level || 0;
		  indentation = indentation || 2;

		  // start new line for deep levels
		  if(level > 0) {
		    rval += '\n';
		  }

		  // create indent
		  var indent = '';
		  for(var i = 0; i < level * indentation; ++i) {
		    indent += ' ';
		  }

		  // print class:type
		  rval += indent + 'Tag: ';
		  switch(obj.tagClass) {
		  case asn1.Class.UNIVERSAL:
		    rval += 'Universal:';
		    break;
		  case asn1.Class.APPLICATION:
		    rval += 'Application:';
		    break;
		  case asn1.Class.CONTEXT_SPECIFIC:
		    rval += 'Context-Specific:';
		    break;
		  case asn1.Class.PRIVATE:
		    rval += 'Private:';
		    break;
		  }

		  if(obj.tagClass === asn1.Class.UNIVERSAL) {
		    rval += obj.type;

		    // known types
		    switch(obj.type) {
		    case asn1.Type.NONE:
		      rval += ' (None)';
		      break;
		    case asn1.Type.BOOLEAN:
		      rval += ' (Boolean)';
		      break;
		    case asn1.Type.BITSTRING:
		      rval += ' (Bit string)';
		      break;
		    case asn1.Type.INTEGER:
		      rval += ' (Integer)';
		      break;
		    case asn1.Type.OCTETSTRING:
		      rval += ' (Octet string)';
		      break;
		    case asn1.Type.NULL:
		      rval += ' (Null)';
		      break;
		    case asn1.Type.OID:
		      rval += ' (Object Identifier)';
		      break;
		    case asn1.Type.ODESC:
		      rval += ' (Object Descriptor)';
		      break;
		    case asn1.Type.EXTERNAL:
		      rval += ' (External or Instance of)';
		      break;
		    case asn1.Type.REAL:
		      rval += ' (Real)';
		      break;
		    case asn1.Type.ENUMERATED:
		      rval += ' (Enumerated)';
		      break;
		    case asn1.Type.EMBEDDED:
		      rval += ' (Embedded PDV)';
		      break;
		    case asn1.Type.UTF8:
		      rval += ' (UTF8)';
		      break;
		    case asn1.Type.ROID:
		      rval += ' (Relative Object Identifier)';
		      break;
		    case asn1.Type.SEQUENCE:
		      rval += ' (Sequence)';
		      break;
		    case asn1.Type.SET:
		      rval += ' (Set)';
		      break;
		    case asn1.Type.PRINTABLESTRING:
		      rval += ' (Printable String)';
		      break;
		    case asn1.Type.IA5String:
		      rval += ' (IA5String (ASCII))';
		      break;
		    case asn1.Type.UTCTIME:
		      rval += ' (UTC time)';
		      break;
		    case asn1.Type.GENERALIZEDTIME:
		      rval += ' (Generalized time)';
		      break;
		    case asn1.Type.BMPSTRING:
		      rval += ' (BMP String)';
		      break;
		    }
		  } else {
		    rval += obj.type;
		  }

		  rval += '\n';
		  rval += indent + 'Constructed: ' + obj.constructed + '\n';

		  if(obj.composed) {
		    var subvalues = 0;
		    var sub = '';
		    for(var i = 0; i < obj.value.length; ++i) {
		      if(obj.value[i] !== undefined) {
		        subvalues += 1;
		        sub += asn1.prettyPrint(obj.value[i], level + 1, indentation);
		        if((i + 1) < obj.value.length) {
		          sub += ',';
		        }
		      }
		    }
		    rval += indent + 'Sub values: ' + subvalues + sub;
		  } else {
		    rval += indent + 'Value: ';
		    if(obj.type === asn1.Type.OID) {
		      var oid = asn1.derToOid(obj.value);
		      rval += oid;
		      if(forge.pki && forge.pki.oids) {
		        if(oid in forge.pki.oids) {
		          rval += ' (' + forge.pki.oids[oid] + ') ';
		        }
		      }
		    }
		    if(obj.type === asn1.Type.INTEGER) {
		      try {
		        rval += asn1.derToInteger(obj.value);
		      } catch(ex) {
		        rval += '0x' + forge.util.bytesToHex(obj.value);
		      }
		    } else if(obj.type === asn1.Type.OCTETSTRING) {
		      if(!_nonLatinRegex.test(obj.value)) {
		        rval += '(' + obj.value + ') ';
		      }
		      rval += '0x' + forge.util.bytesToHex(obj.value);
		    } else if(obj.type === asn1.Type.UTF8) {
		      rval += forge.util.decodeUtf8(obj.value);
		    } else if(obj.type === asn1.Type.PRINTABLESTRING ||
		      obj.type === asn1.Type.IA5String) {
		      rval += obj.value;
		    } else if(_nonLatinRegex.test(obj.value)) {
		      rval += '0x' + forge.util.bytesToHex(obj.value);
		    } else if(obj.value.length === 0) {
		      rval += '[null]';
		    } else {
		      rval += obj.value;
		    }
		  }

		  return rval;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'asn1';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/asn1',['require', 'module', './util', './oids'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Message Digest Algorithm 5 with 128-bit digest (MD5) implementation.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var md5 = forge.md5 = forge.md5 || {};
		forge.md = forge.md || {};
		forge.md.algorithms = forge.md.algorithms || {};
		forge.md.md5 = forge.md.algorithms.md5 = md5;

		/**
		 * Creates an MD5 message digest object.
		 *
		 * @return a message digest object.
		 */
		md5.create = function() {
		  // do initialization as necessary
		  if(!_initialized) {
		    _init();
		  }

		  // MD5 state contains four 32-bit integers
		  var _state = null;

		  // input buffer
		  var _input = forge.util.createBuffer();

		  // used for word storage
		  var _w = new Array(16);

		  // message digest object
		  var md = {
		    algorithm: 'md5',
		    blockLength: 64,
		    digestLength: 16,
		    // 56-bit length of message so far (does not including padding)
		    messageLength: 0,
		    // true message length
		    fullMessageLength: null,
		    // size of message length in bytes
		    messageLengthSize: 8
		  };

		  /**
		   * Starts the digest.
		   *
		   * @return this digest object.
		   */
		  md.start = function() {
		    // up to 56-bit message length for convenience
		    md.messageLength = 0;

		    // full message length (set md.messageLength64 for backwards-compatibility)
		    md.fullMessageLength = md.messageLength64 = [];
		    var int32s = md.messageLengthSize / 4;
		    for(var i = 0; i < int32s; ++i) {
		      md.fullMessageLength.push(0);
		    }
		    _input = forge.util.createBuffer();
		    _state = {
		      h0: 0x67452301,
		      h1: 0xEFCDAB89,
		      h2: 0x98BADCFE,
		      h3: 0x10325476
		    };
		    return md;
		  };
		  // start digest automatically for first time
		  md.start();

		  /**
		   * Updates the digest with the given message input. The given input can
		   * treated as raw input (no encoding will be applied) or an encoding of
		   * 'utf8' maybe given to encode the input using UTF-8.
		   *
		   * @param msg the message input to update with.
		   * @param encoding the encoding to use (default: 'raw', other: 'utf8').
		   *
		   * @return this digest object.
		   */
		  md.update = function(msg, encoding) {
		    if(encoding === 'utf8') {
		      msg = forge.util.encodeUtf8(msg);
		    }

		    // update message length
		    var len = msg.length;
		    md.messageLength += len;
		    len = [(len / 0x100000000) >>> 0, len >>> 0];
		    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
		      md.fullMessageLength[i] += len[1];
		      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);
		      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
		      len[0] = ((len[1] / 0x100000000) >>> 0);
		    }

		    // add bytes to input buffer
		    _input.putBytes(msg);

		    // process bytes
		    _update(_state, _w, _input);

		    // compact input buffer every 2K or if empty
		    if(_input.read > 2048 || _input.length() === 0) {
		      _input.compact();
		    }

		    return md;
		  };

		  /**
		   * Produces the digest.
		   *
		   * @return a byte buffer containing the digest value.
		   */
		  md.digest = function() {
		    /* Note: Here we copy the remaining bytes in the input buffer and
		    add the appropriate MD5 padding. Then we do the final update
		    on a copy of the state so that if the user wants to get
		    intermediate digests they can do so. */

		    /* Determine the number of bytes that must be added to the message
		    to ensure its length is congruent to 448 mod 512. In other words,
		    the data to be digested must be a multiple of 512 bits (or 128 bytes).
		    This data includes the message, some padding, and the length of the
		    message. Since the length of the message will be encoded as 8 bytes (64
		    bits), that means that the last segment of the data must have 56 bytes
		    (448 bits) of message and padding. Therefore, the length of the message
		    plus the padding must be congruent to 448 mod 512 because
		    512 - 128 = 448.

		    In order to fill up the message length it must be filled with
		    padding that begins with 1 bit followed by all 0 bits. Padding
		    must *always* be present, so if the message length is already
		    congruent to 448 mod 512, then 512 padding bits must be added. */

		    var finalBlock = forge.util.createBuffer();
		    finalBlock.putBytes(_input.bytes());

		    // compute remaining size to be digested (include message length size)
		    var remaining = (
		      md.fullMessageLength[md.fullMessageLength.length - 1] +
		      md.messageLengthSize);

		    // add padding for overflow blockSize - overflow
		    // _padding starts with 1 byte with first bit is set (byte value 128), then
		    // there may be up to (blockSize - 1) other pad bytes
		    var overflow = remaining & (md.blockLength - 1);
		    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));

		    // serialize message length in bits in little-endian order; since length
		    // is stored in bytes we multiply by 8 and add carry
		    var bits, carry = 0;
		    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
		      bits = md.fullMessageLength[i] * 8 + carry;
		      carry = (bits / 0x100000000) >>> 0;
		      finalBlock.putInt32Le(bits >>> 0);
		    }

		    var s2 = {
		      h0: _state.h0,
		      h1: _state.h1,
		      h2: _state.h2,
		      h3: _state.h3
		    };
		    _update(s2, _w, finalBlock);
		    var rval = forge.util.createBuffer();
		    rval.putInt32Le(s2.h0);
		    rval.putInt32Le(s2.h1);
		    rval.putInt32Le(s2.h2);
		    rval.putInt32Le(s2.h3);
		    return rval;
		  };

		  return md;
		};

		// padding, constant tables for calculating md5
		var _padding = null;
		var _g = null;
		var _r = null;
		var _k = null;
		var _initialized = false;

		/**
		 * Initializes the constant tables.
		 */
		function _init() {
		  // create padding
		  _padding = String.fromCharCode(128);
		  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);

		  // g values
		  _g = [
		    0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
		    1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12,
		    5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2,
		    0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9];

		  // rounds table
		  _r = [
		    7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,
		    5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,
		    4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,
		    6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21];

		  // get the result of abs(sin(i + 1)) as a 32-bit integer
		  _k = new Array(64);
		  for(var i = 0; i < 64; ++i) {
		    _k[i] = Math.floor(Math.abs(Math.sin(i + 1)) * 0x100000000);
		  }

		  // now initialized
		  _initialized = true;
		}

		/**
		 * Updates an MD5 state with the given byte buffer.
		 *
		 * @param s the MD5 state to update.
		 * @param w the array to use to store words.
		 * @param bytes the byte buffer to update with.
		 */
		function _update(s, w, bytes) {
		  // consume 512 bit (64 byte) chunks
		  var t, a, b, c, d, f, r, i;
		  var len = bytes.length();
		  while(len >= 64) {
		    // initialize hash value for this chunk
		    a = s.h0;
		    b = s.h1;
		    c = s.h2;
		    d = s.h3;

		    // round 1
		    for(i = 0; i < 16; ++i) {
		      w[i] = bytes.getInt32Le();
		      f = d ^ (b & (c ^ d));
		      t = (a + f + _k[i] + w[i]);
		      r = _r[i];
		      a = d;
		      d = c;
		      c = b;
		      b += (t << r) | (t >>> (32 - r));
		    }
		    // round 2
		    for(; i < 32; ++i) {
		      f = c ^ (d & (b ^ c));
		      t = (a + f + _k[i] + w[_g[i]]);
		      r = _r[i];
		      a = d;
		      d = c;
		      c = b;
		      b += (t << r) | (t >>> (32 - r));
		    }
		    // round 3
		    for(; i < 48; ++i) {
		      f = b ^ c ^ d;
		      t = (a + f + _k[i] + w[_g[i]]);
		      r = _r[i];
		      a = d;
		      d = c;
		      c = b;
		      b += (t << r) | (t >>> (32 - r));
		    }
		    // round 4
		    for(; i < 64; ++i) {
		      f = c ^ (b | ~d);
		      t = (a + f + _k[i] + w[_g[i]]);
		      r = _r[i];
		      a = d;
		      d = c;
		      c = b;
		      b += (t << r) | (t >>> (32 - r));
		    }

		    // update hash state
		    s.h0 = (s.h0 + a) | 0;
		    s.h1 = (s.h1 + b) | 0;
		    s.h2 = (s.h2 + c) | 0;
		    s.h3 = (s.h3 + d) | 0;

		    len -= 64;
		  }
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'md5';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/md5',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Secure Hash Algorithm with 160-bit digest (SHA-1) implementation.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2015 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var sha1 = forge.sha1 = forge.sha1 || {};
		forge.md = forge.md || {};
		forge.md.algorithms = forge.md.algorithms || {};
		forge.md.sha1 = forge.md.algorithms.sha1 = sha1;

		/**
		 * Creates a SHA-1 message digest object.
		 *
		 * @return a message digest object.
		 */
		sha1.create = function() {
		  // do initialization as necessary
		  if(!_initialized) {
		    _init();
		  }

		  // SHA-1 state contains five 32-bit integers
		  var _state = null;

		  // input buffer
		  var _input = forge.util.createBuffer();

		  // used for word storage
		  var _w = new Array(80);

		  // message digest object
		  var md = {
		    algorithm: 'sha1',
		    blockLength: 64,
		    digestLength: 20,
		    // 56-bit length of message so far (does not including padding)
		    messageLength: 0,
		    // true message length
		    fullMessageLength: null,
		    // size of message length in bytes
		    messageLengthSize: 8
		  };

		  /**
		   * Starts the digest.
		   *
		   * @return this digest object.
		   */
		  md.start = function() {
		    // up to 56-bit message length for convenience
		    md.messageLength = 0;

		    // full message length (set md.messageLength64 for backwards-compatibility)
		    md.fullMessageLength = md.messageLength64 = [];
		    var int32s = md.messageLengthSize / 4;
		    for(var i = 0; i < int32s; ++i) {
		      md.fullMessageLength.push(0);
		    }
		    _input = forge.util.createBuffer();
		    _state = {
		      h0: 0x67452301,
		      h1: 0xEFCDAB89,
		      h2: 0x98BADCFE,
		      h3: 0x10325476,
		      h4: 0xC3D2E1F0
		    };
		    return md;
		  };
		  // start digest automatically for first time
		  md.start();

		  /**
		   * Updates the digest with the given message input. The given input can
		   * treated as raw input (no encoding will be applied) or an encoding of
		   * 'utf8' maybe given to encode the input using UTF-8.
		   *
		   * @param msg the message input to update with.
		   * @param encoding the encoding to use (default: 'raw', other: 'utf8').
		   *
		   * @return this digest object.
		   */
		  md.update = function(msg, encoding) {
		    if(encoding === 'utf8') {
		      msg = forge.util.encodeUtf8(msg);
		    }

		    // update message length
		    var len = msg.length;
		    md.messageLength += len;
		    len = [(len / 0x100000000) >>> 0, len >>> 0];
		    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
		      md.fullMessageLength[i] += len[1];
		      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);
		      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
		      len[0] = ((len[1] / 0x100000000) >>> 0);
		    }

		    // add bytes to input buffer
		    _input.putBytes(msg);

		    // process bytes
		    _update(_state, _w, _input);

		    // compact input buffer every 2K or if empty
		    if(_input.read > 2048 || _input.length() === 0) {
		      _input.compact();
		    }

		    return md;
		  };

		   /**
		    * Produces the digest.
		    *
		    * @return a byte buffer containing the digest value.
		    */
		   md.digest = function() {
		    /* Note: Here we copy the remaining bytes in the input buffer and
		    add the appropriate SHA-1 padding. Then we do the final update
		    on a copy of the state so that if the user wants to get
		    intermediate digests they can do so. */

		    /* Determine the number of bytes that must be added to the message
		    to ensure its length is congruent to 448 mod 512. In other words,
		    the data to be digested must be a multiple of 512 bits (or 128 bytes).
		    This data includes the message, some padding, and the length of the
		    message. Since the length of the message will be encoded as 8 bytes (64
		    bits), that means that the last segment of the data must have 56 bytes
		    (448 bits) of message and padding. Therefore, the length of the message
		    plus the padding must be congruent to 448 mod 512 because
		    512 - 128 = 448.

		    In order to fill up the message length it must be filled with
		    padding that begins with 1 bit followed by all 0 bits. Padding
		    must *always* be present, so if the message length is already
		    congruent to 448 mod 512, then 512 padding bits must be added. */

		    var finalBlock = forge.util.createBuffer();
		    finalBlock.putBytes(_input.bytes());

		    // compute remaining size to be digested (include message length size)
		    var remaining = (
		      md.fullMessageLength[md.fullMessageLength.length - 1] +
		      md.messageLengthSize);

		    // add padding for overflow blockSize - overflow
		    // _padding starts with 1 byte with first bit is set (byte value 128), then
		    // there may be up to (blockSize - 1) other pad bytes
		    var overflow = remaining & (md.blockLength - 1);
		    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));

		    // serialize message length in bits in big-endian order; since length
		    // is stored in bytes we multiply by 8 and add carry from next int
		    var messageLength = forge.util.createBuffer();
		    var next, carry;
		    var bits = md.fullMessageLength[0] * 8;
		    for(var i = 0; i < md.fullMessageLength.length; ++i) {
		      next = md.fullMessageLength[i + 1] * 8;
		      carry = (next / 0x100000000) >>> 0;
		      bits += carry;
		      finalBlock.putInt32(bits >>> 0);
		      bits = next;
		    }

		    var s2 = {
		      h0: _state.h0,
		      h1: _state.h1,
		      h2: _state.h2,
		      h3: _state.h3,
		      h4: _state.h4
		    };
		    _update(s2, _w, finalBlock);
		    var rval = forge.util.createBuffer();
		    rval.putInt32(s2.h0);
		    rval.putInt32(s2.h1);
		    rval.putInt32(s2.h2);
		    rval.putInt32(s2.h3);
		    rval.putInt32(s2.h4);
		    return rval;
		  };

		  return md;
		};

		// sha-1 padding bytes not initialized yet
		var _padding = null;
		var _initialized = false;

		/**
		 * Initializes the constant tables.
		 */
		function _init() {
		  // create padding
		  _padding = String.fromCharCode(128);
		  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);

		  // now initialized
		  _initialized = true;
		}

		/**
		 * Updates a SHA-1 state with the given byte buffer.
		 *
		 * @param s the SHA-1 state to update.
		 * @param w the array to use to store words.
		 * @param bytes the byte buffer to update with.
		 */
		function _update(s, w, bytes) {
		  // consume 512 bit (64 byte) chunks
		  var t, a, b, c, d, e, f, i;
		  var len = bytes.length();
		  while(len >= 64) {
		    // the w array will be populated with sixteen 32-bit big-endian words
		    // and then extended into 80 32-bit words according to SHA-1 algorithm
		    // and for 32-79 using Max Locktyukhin's optimization

		    // initialize hash value for this chunk
		    a = s.h0;
		    b = s.h1;
		    c = s.h2;
		    d = s.h3;
		    e = s.h4;

		    // round 1
		    for(i = 0; i < 16; ++i) {
		      t = bytes.getInt32();
		      w[i] = t;
		      f = d ^ (b & (c ^ d));
		      t = ((a << 5) | (a >>> 27)) + f + e + 0x5A827999 + t;
		      e = d;
		      d = c;
		      c = (b << 30) | (b >>> 2);
		      b = a;
		      a = t;
		    }
		    for(; i < 20; ++i) {
		      t = (w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);
		      t = (t << 1) | (t >>> 31);
		      w[i] = t;
		      f = d ^ (b & (c ^ d));
		      t = ((a << 5) | (a >>> 27)) + f + e + 0x5A827999 + t;
		      e = d;
		      d = c;
		      c = (b << 30) | (b >>> 2);
		      b = a;
		      a = t;
		    }
		    // round 2
		    for(; i < 32; ++i) {
		      t = (w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);
		      t = (t << 1) | (t >>> 31);
		      w[i] = t;
		      f = b ^ c ^ d;
		      t = ((a << 5) | (a >>> 27)) + f + e + 0x6ED9EBA1 + t;
		      e = d;
		      d = c;
		      c = (b << 30) | (b >>> 2);
		      b = a;
		      a = t;
		    }
		    for(; i < 40; ++i) {
		      t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);
		      t = (t << 2) | (t >>> 30);
		      w[i] = t;
		      f = b ^ c ^ d;
		      t = ((a << 5) | (a >>> 27)) + f + e + 0x6ED9EBA1 + t;
		      e = d;
		      d = c;
		      c = (b << 30) | (b >>> 2);
		      b = a;
		      a = t;
		    }
		    // round 3
		    for(; i < 60; ++i) {
		      t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);
		      t = (t << 2) | (t >>> 30);
		      w[i] = t;
		      f = (b & c) | (d & (b ^ c));
		      t = ((a << 5) | (a >>> 27)) + f + e + 0x8F1BBCDC + t;
		      e = d;
		      d = c;
		      c = (b << 30) | (b >>> 2);
		      b = a;
		      a = t;
		    }
		    // round 4
		    for(; i < 80; ++i) {
		      t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);
		      t = (t << 2) | (t >>> 30);
		      w[i] = t;
		      f = b ^ c ^ d;
		      t = ((a << 5) | (a >>> 27)) + f + e + 0xCA62C1D6 + t;
		      e = d;
		      d = c;
		      c = (b << 30) | (b >>> 2);
		      b = a;
		      a = t;
		    }

		    // update hash state
		    s.h0 = (s.h0 + a) | 0;
		    s.h1 = (s.h1 + b) | 0;
		    s.h2 = (s.h2 + c) | 0;
		    s.h3 = (s.h3 + d) | 0;
		    s.h4 = (s.h4 + e) | 0;

		    len -= 64;
		  }
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'sha1';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/sha1',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Secure Hash Algorithm with 256-bit digest (SHA-256) implementation.
		 *
		 * See FIPS 180-2 for details.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2015 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var sha256 = forge.sha256 = forge.sha256 || {};
		forge.md = forge.md || {};
		forge.md.algorithms = forge.md.algorithms || {};
		forge.md.sha256 = forge.md.algorithms.sha256 = sha256;

		/**
		 * Creates a SHA-256 message digest object.
		 *
		 * @return a message digest object.
		 */
		sha256.create = function() {
		  // do initialization as necessary
		  if(!_initialized) {
		    _init();
		  }

		  // SHA-256 state contains eight 32-bit integers
		  var _state = null;

		  // input buffer
		  var _input = forge.util.createBuffer();

		  // used for word storage
		  var _w = new Array(64);

		  // message digest object
		  var md = {
		    algorithm: 'sha256',
		    blockLength: 64,
		    digestLength: 32,
		    // 56-bit length of message so far (does not including padding)
		    messageLength: 0,
		    // true message length
		    fullMessageLength: null,
		    // size of message length in bytes
		    messageLengthSize: 8
		  };

		  /**
		   * Starts the digest.
		   *
		   * @return this digest object.
		   */
		  md.start = function() {
		    // up to 56-bit message length for convenience
		    md.messageLength = 0;

		    // full message length (set md.messageLength64 for backwards-compatibility)
		    md.fullMessageLength = md.messageLength64 = [];
		    var int32s = md.messageLengthSize / 4;
		    for(var i = 0; i < int32s; ++i) {
		      md.fullMessageLength.push(0);
		    }
		    _input = forge.util.createBuffer();
		    _state = {
		      h0: 0x6A09E667,
		      h1: 0xBB67AE85,
		      h2: 0x3C6EF372,
		      h3: 0xA54FF53A,
		      h4: 0x510E527F,
		      h5: 0x9B05688C,
		      h6: 0x1F83D9AB,
		      h7: 0x5BE0CD19
		    };
		    return md;
		  };
		  // start digest automatically for first time
		  md.start();

		  /**
		   * Updates the digest with the given message input. The given input can
		   * treated as raw input (no encoding will be applied) or an encoding of
		   * 'utf8' maybe given to encode the input using UTF-8.
		   *
		   * @param msg the message input to update with.
		   * @param encoding the encoding to use (default: 'raw', other: 'utf8').
		   *
		   * @return this digest object.
		   */
		  md.update = function(msg, encoding) {
		    if(encoding === 'utf8') {
		      msg = forge.util.encodeUtf8(msg);
		    }

		    // update message length
		    var len = msg.length;
		    md.messageLength += len;
		    len = [(len / 0x100000000) >>> 0, len >>> 0];
		    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
		      md.fullMessageLength[i] += len[1];
		      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);
		      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
		      len[0] = ((len[1] / 0x100000000) >>> 0);
		    }

		    // add bytes to input buffer
		    _input.putBytes(msg);

		    // process bytes
		    _update(_state, _w, _input);

		    // compact input buffer every 2K or if empty
		    if(_input.read > 2048 || _input.length() === 0) {
		      _input.compact();
		    }

		    return md;
		  };

		  /**
		   * Produces the digest.
		   *
		   * @return a byte buffer containing the digest value.
		   */
		  md.digest = function() {
		    /* Note: Here we copy the remaining bytes in the input buffer and
		    add the appropriate SHA-256 padding. Then we do the final update
		    on a copy of the state so that if the user wants to get
		    intermediate digests they can do so. */

		    /* Determine the number of bytes that must be added to the message
		    to ensure its length is congruent to 448 mod 512. In other words,
		    the data to be digested must be a multiple of 512 bits (or 128 bytes).
		    This data includes the message, some padding, and the length of the
		    message. Since the length of the message will be encoded as 8 bytes (64
		    bits), that means that the last segment of the data must have 56 bytes
		    (448 bits) of message and padding. Therefore, the length of the message
		    plus the padding must be congruent to 448 mod 512 because
		    512 - 128 = 448.

		    In order to fill up the message length it must be filled with
		    padding that begins with 1 bit followed by all 0 bits. Padding
		    must *always* be present, so if the message length is already
		    congruent to 448 mod 512, then 512 padding bits must be added. */

		    var finalBlock = forge.util.createBuffer();
		    finalBlock.putBytes(_input.bytes());

		    // compute remaining size to be digested (include message length size)
		    var remaining = (
		      md.fullMessageLength[md.fullMessageLength.length - 1] +
		      md.messageLengthSize);

		    // add padding for overflow blockSize - overflow
		    // _padding starts with 1 byte with first bit is set (byte value 128), then
		    // there may be up to (blockSize - 1) other pad bytes
		    var overflow = remaining & (md.blockLength - 1);
		    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));

		    // serialize message length in bits in big-endian order; since length
		    // is stored in bytes we multiply by 8 and add carry from next int
		    var messageLength = forge.util.createBuffer();
		    var next, carry;
		    var bits = md.fullMessageLength[0] * 8;
		    for(var i = 0; i < md.fullMessageLength.length; ++i) {
		      next = md.fullMessageLength[i + 1] * 8;
		      carry = (next / 0x100000000) >>> 0;
		      bits += carry;
		      finalBlock.putInt32(bits >>> 0);
		      bits = next;
		    }

		    var s2 = {
		      h0: _state.h0,
		      h1: _state.h1,
		      h2: _state.h2,
		      h3: _state.h3,
		      h4: _state.h4,
		      h5: _state.h5,
		      h6: _state.h6,
		      h7: _state.h7
		    };
		    _update(s2, _w, finalBlock);
		    var rval = forge.util.createBuffer();
		    rval.putInt32(s2.h0);
		    rval.putInt32(s2.h1);
		    rval.putInt32(s2.h2);
		    rval.putInt32(s2.h3);
		    rval.putInt32(s2.h4);
		    rval.putInt32(s2.h5);
		    rval.putInt32(s2.h6);
		    rval.putInt32(s2.h7);
		    return rval;
		  };

		  return md;
		};

		// sha-256 padding bytes not initialized yet
		var _padding = null;
		var _initialized = false;

		// table of constants
		var _k = null;

		/**
		 * Initializes the constant tables.
		 */
		function _init() {
		  // create padding
		  _padding = String.fromCharCode(128);
		  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);

		  // create K table for SHA-256
		  _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];

		  // now initialized
		  _initialized = true;
		}

		/**
		 * Updates a SHA-256 state with the given byte buffer.
		 *
		 * @param s the SHA-256 state to update.
		 * @param w the array to use to store words.
		 * @param bytes the byte buffer to update with.
		 */
		function _update(s, w, bytes) {
		  // consume 512 bit (64 byte) chunks
		  var t1, t2, s0, s1, ch, maj, i, a, b, c, d, e, f, g, h;
		  var len = bytes.length();
		  while(len >= 64) {
		    // the w array will be populated with sixteen 32-bit big-endian words
		    // and then extended into 64 32-bit words according to SHA-256
		    for(i = 0; i < 16; ++i) {
		      w[i] = bytes.getInt32();
		    }
		    for(; i < 64; ++i) {
		      // XOR word 2 words ago rot right 17, rot right 19, shft right 10
		      t1 = w[i - 2];
		      t1 =
		        ((t1 >>> 17) | (t1 << 15)) ^
		        ((t1 >>> 19) | (t1 << 13)) ^
		        (t1 >>> 10);
		      // XOR word 15 words ago rot right 7, rot right 18, shft right 3
		      t2 = w[i - 15];
		      t2 =
		        ((t2 >>> 7) | (t2 << 25)) ^
		        ((t2 >>> 18) | (t2 << 14)) ^
		        (t2 >>> 3);
		      // sum(t1, word 7 ago, t2, word 16 ago) modulo 2^32
		      w[i] = (t1 + w[i - 7] + t2 + w[i - 16]) | 0;
		    }

		    // initialize hash value for this chunk
		    a = s.h0;
		    b = s.h1;
		    c = s.h2;
		    d = s.h3;
		    e = s.h4;
		    f = s.h5;
		    g = s.h6;
		    h = s.h7;

		    // round function
		    for(i = 0; i < 64; ++i) {
		      // Sum1(e)
		      s1 =
		        ((e >>> 6) | (e << 26)) ^
		        ((e >>> 11) | (e << 21)) ^
		        ((e >>> 25) | (e << 7));
		      // Ch(e, f, g) (optimized the same way as SHA-1)
		      ch = g ^ (e & (f ^ g));
		      // Sum0(a)
		      s0 =
		        ((a >>> 2) | (a << 30)) ^
		        ((a >>> 13) | (a << 19)) ^
		        ((a >>> 22) | (a << 10));
		      // Maj(a, b, c) (optimized the same way as SHA-1)
		      maj = (a & b) | (c & (a ^ b));

		      // main algorithm
		      t1 = h + s1 + ch + _k[i] + w[i];
		      t2 = s0 + maj;
		      h = g;
		      g = f;
		      f = e;
		      e = (d + t1) | 0;
		      d = c;
		      c = b;
		      b = a;
		      a = (t1 + t2) | 0;
		    }

		    // update hash state
		    s.h0 = (s.h0 + a) | 0;
		    s.h1 = (s.h1 + b) | 0;
		    s.h2 = (s.h2 + c) | 0;
		    s.h3 = (s.h3 + d) | 0;
		    s.h4 = (s.h4 + e) | 0;
		    s.h5 = (s.h5 + f) | 0;
		    s.h6 = (s.h6 + g) | 0;
		    s.h7 = (s.h7 + h) | 0;
		    len -= 64;
		  }
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'sha256';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/sha256',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Secure Hash Algorithm with a 1024-bit block size implementation.
		 *
		 * This includes: SHA-512, SHA-384, SHA-512/224, and SHA-512/256. For
		 * SHA-256 (block size 512 bits), see sha256.js.
		 *
		 * See FIPS 180-4 for details.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2014-2015 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var sha512 = forge.sha512 = forge.sha512 || {};
		forge.md = forge.md || {};
		forge.md.algorithms = forge.md.algorithms || {};

		// SHA-512
		forge.md.sha512 = forge.md.algorithms.sha512 = sha512;

		// SHA-384
		var sha384 = forge.sha384 = forge.sha512.sha384 = forge.sha512.sha384 || {};
		sha384.create = function() {
		  return sha512.create('SHA-384');
		};
		forge.md.sha384 = forge.md.algorithms.sha384 = sha384;

		// SHA-512/256
		forge.sha512.sha256 = forge.sha512.sha256 || {
		  create: function() {
		    return sha512.create('SHA-512/256');
		  }
		};
		forge.md['sha512/256'] = forge.md.algorithms['sha512/256'] =
		  forge.sha512.sha256;

		// SHA-512/224
		forge.sha512.sha224 = forge.sha512.sha224 || {
		  create: function() {
		    return sha512.create('SHA-512/224');
		  }
		};
		forge.md['sha512/224'] = forge.md.algorithms['sha512/224'] =
		  forge.sha512.sha224;

		/**
		 * Creates a SHA-2 message digest object.
		 *
		 * @param algorithm the algorithm to use (SHA-512, SHA-384, SHA-512/224,
		 *          SHA-512/256).
		 *
		 * @return a message digest object.
		 */
		sha512.create = function(algorithm) {
		  // do initialization as necessary
		  if(!_initialized) {
		    _init();
		  }

		  if(typeof algorithm === 'undefined') {
		    algorithm = 'SHA-512';
		  }

		  if(!(algorithm in _states)) {
		    throw new Error('Invalid SHA-512 algorithm: ' + algorithm);
		  }

		  // SHA-512 state contains eight 64-bit integers (each as two 32-bit ints)
		  var _state = _states[algorithm];
		  var _h = null;

		  // input buffer
		  var _input = forge.util.createBuffer();

		  // used for 64-bit word storage
		  var _w = new Array(80);
		  for(var wi = 0; wi < 80; ++wi) {
		    _w[wi] = new Array(2);
		  }

		  // message digest object
		  var md = {
		    // SHA-512 => sha512
		    algorithm: algorithm.replace('-', '').toLowerCase(),
		    blockLength: 128,
		    digestLength: 64,
		    // 56-bit length of message so far (does not including padding)
		    messageLength: 0,
		    // true message length
		    fullMessageLength: null,
		    // size of message length in bytes
		    messageLengthSize: 16
		  };

		  /**
		   * Starts the digest.
		   *
		   * @return this digest object.
		   */
		  md.start = function() {
		    // up to 56-bit message length for convenience
		    md.messageLength = 0;

		    // full message length (set md.messageLength128 for backwards-compatibility)
		    md.fullMessageLength = md.messageLength128 = [];
		    var int32s = md.messageLengthSize / 4;
		    for(var i = 0; i < int32s; ++i) {
		      md.fullMessageLength.push(0);
		    }
		    _input = forge.util.createBuffer();
		    _h = new Array(_state.length);
		    for(var i = 0; i < _state.length; ++i) {
		      _h[i] = _state[i].slice(0);
		    }
		    return md;
		  };
		  // start digest automatically for first time
		  md.start();

		  /**
		   * Updates the digest with the given message input. The given input can
		   * treated as raw input (no encoding will be applied) or an encoding of
		   * 'utf8' maybe given to encode the input using UTF-8.
		   *
		   * @param msg the message input to update with.
		   * @param encoding the encoding to use (default: 'raw', other: 'utf8').
		   *
		   * @return this digest object.
		   */
		  md.update = function(msg, encoding) {
		    if(encoding === 'utf8') {
		      msg = forge.util.encodeUtf8(msg);
		    }

		    // update message length
		    var len = msg.length;
		    md.messageLength += len;
		    len = [(len / 0x100000000) >>> 0, len >>> 0];
		    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
		      md.fullMessageLength[i] += len[1];
		      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);
		      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
		      len[0] = ((len[1] / 0x100000000) >>> 0);
		    }

		    // add bytes to input buffer
		    _input.putBytes(msg);

		    // process bytes
		    _update(_h, _w, _input);

		    // compact input buffer every 2K or if empty
		    if(_input.read > 2048 || _input.length() === 0) {
		      _input.compact();
		    }

		    return md;
		  };

		  /**
		   * Produces the digest.
		   *
		   * @return a byte buffer containing the digest value.
		   */
		  md.digest = function() {
		    /* Note: Here we copy the remaining bytes in the input buffer and
		    add the appropriate SHA-512 padding. Then we do the final update
		    on a copy of the state so that if the user wants to get
		    intermediate digests they can do so. */

		    /* Determine the number of bytes that must be added to the message
		    to ensure its length is congruent to 896 mod 1024. In other words,
		    the data to be digested must be a multiple of 1024 bits (or 128 bytes).
		    This data includes the message, some padding, and the length of the
		    message. Since the length of the message will be encoded as 16 bytes (128
		    bits), that means that the last segment of the data must have 112 bytes
		    (896 bits) of message and padding. Therefore, the length of the message
		    plus the padding must be congruent to 896 mod 1024 because
		    1024 - 128 = 896.

		    In order to fill up the message length it must be filled with
		    padding that begins with 1 bit followed by all 0 bits. Padding
		    must *always* be present, so if the message length is already
		    congruent to 896 mod 1024, then 1024 padding bits must be added. */

		    var finalBlock = forge.util.createBuffer();
		    finalBlock.putBytes(_input.bytes());

		    // compute remaining size to be digested (include message length size)
		    var remaining = (
		      md.fullMessageLength[md.fullMessageLength.length - 1] +
		      md.messageLengthSize);

		    // add padding for overflow blockSize - overflow
		    // _padding starts with 1 byte with first bit is set (byte value 128), then
		    // there may be up to (blockSize - 1) other pad bytes
		    var overflow = remaining & (md.blockLength - 1);
		    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));

		    // serialize message length in bits in big-endian order; since length
		    // is stored in bytes we multiply by 8 and add carry from next int
		    var messageLength = forge.util.createBuffer();
		    var next, carry;
		    var bits = md.fullMessageLength[0] * 8;
		    for(var i = 0; i < md.fullMessageLength.length; ++i) {
		      next = md.fullMessageLength[i + 1] * 8;
		      carry = (next / 0x100000000) >>> 0;
		      bits += carry;
		      finalBlock.putInt32(bits >>> 0);
		      bits = next;
		    }

		    var h = new Array(_h.length);
		    for(var i = 0; i < _h.length; ++i) {
		      h[i] = _h[i].slice(0);
		    }
		    _update(h, _w, finalBlock);
		    var rval = forge.util.createBuffer();
		    var hlen;
		    if(algorithm === 'SHA-512') {
		      hlen = h.length;
		    } else if(algorithm === 'SHA-384') {
		      hlen = h.length - 2;
		    } else {
		      hlen = h.length - 4;
		    }
		    for(var i = 0; i < hlen; ++i) {
		      rval.putInt32(h[i][0]);
		      if(i !== hlen - 1 || algorithm !== 'SHA-512/224') {
		        rval.putInt32(h[i][1]);
		      }
		    }
		    return rval;
		  };

		  return md;
		};

		// sha-512 padding bytes not initialized yet
		var _padding = null;
		var _initialized = false;

		// table of constants
		var _k = null;

		// initial hash states
		var _states = null;

		/**
		 * Initializes the constant tables.
		 */
		function _init() {
		  // create padding
		  _padding = String.fromCharCode(128);
		  _padding += forge.util.fillString(String.fromCharCode(0x00), 128);

		  // create K table for SHA-512
		  _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]
		  ];

		  // initial hash states
		  _states = {};
		  _states['SHA-512'] = [
		    [0x6a09e667, 0xf3bcc908],
		    [0xbb67ae85, 0x84caa73b],
		    [0x3c6ef372, 0xfe94f82b],
		    [0xa54ff53a, 0x5f1d36f1],
		    [0x510e527f, 0xade682d1],
		    [0x9b05688c, 0x2b3e6c1f],
		    [0x1f83d9ab, 0xfb41bd6b],
		    [0x5be0cd19, 0x137e2179]
		  ];
		  _states['SHA-384'] = [
		    [0xcbbb9d5d, 0xc1059ed8],
		    [0x629a292a, 0x367cd507],
		    [0x9159015a, 0x3070dd17],
		    [0x152fecd8, 0xf70e5939],
		    [0x67332667, 0xffc00b31],
		    [0x8eb44a87, 0x68581511],
		    [0xdb0c2e0d, 0x64f98fa7],
		    [0x47b5481d, 0xbefa4fa4]
		  ];
		  _states['SHA-512/256'] = [
		    [0x22312194, 0xFC2BF72C],
		    [0x9F555FA3, 0xC84C64C2],
		    [0x2393B86B, 0x6F53B151],
		    [0x96387719, 0x5940EABD],
		    [0x96283EE2, 0xA88EFFE3],
		    [0xBE5E1E25, 0x53863992],
		    [0x2B0199FC, 0x2C85B8AA],
		    [0x0EB72DDC, 0x81C52CA2]
		  ];
		  _states['SHA-512/224'] = [
		    [0x8C3D37C8, 0x19544DA2],
		    [0x73E19966, 0x89DCD4D6],
		    [0x1DFAB7AE, 0x32FF9C82],
		    [0x679DD514, 0x582F9FCF],
		    [0x0F6D2B69, 0x7BD44DA8],
		    [0x77E36F73, 0x04C48942],
		    [0x3F9D85A8, 0x6A1D36C8],
		    [0x1112E6AD, 0x91D692A1]
		  ];

		  // now initialized
		  _initialized = true;
		}

		/**
		 * Updates a SHA-512 state with the given byte buffer.
		 *
		 * @param s the SHA-512 state to update.
		 * @param w the array to use to store words.
		 * @param bytes the byte buffer to update with.
		 */
		function _update(s, w, bytes) {
		  // consume 512 bit (128 byte) chunks
		  var t1_hi, t1_lo;
		  var t2_hi, t2_lo;
		  var s0_hi, s0_lo;
		  var s1_hi, s1_lo;
		  var ch_hi, ch_lo;
		  var maj_hi, maj_lo;
		  var a_hi, a_lo;
		  var b_hi, b_lo;
		  var c_hi, c_lo;
		  var d_hi, d_lo;
		  var e_hi, e_lo;
		  var f_hi, f_lo;
		  var g_hi, g_lo;
		  var h_hi, h_lo;
		  var i, hi, lo, w2, w7, w15, w16;
		  var len = bytes.length();
		  while(len >= 128) {
		    // the w array will be populated with sixteen 64-bit big-endian words
		    // and then extended into 64 64-bit words according to SHA-512
		    for(i = 0; i < 16; ++i) {
		      w[i][0] = bytes.getInt32() >>> 0;
		      w[i][1] = bytes.getInt32() >>> 0;
		    }
		    for(; i < 80; ++i) {
		      // for word 2 words ago: ROTR 19(x) ^ ROTR 61(x) ^ SHR 6(x)
		      w2 = w[i - 2];
		      hi = w2[0];
		      lo = w2[1];

		      // high bits
		      t1_hi = (
		        ((hi >>> 19) | (lo << 13)) ^ // ROTR 19
		        ((lo >>> 29) | (hi << 3)) ^ // ROTR 61/(swap + ROTR 29)
		        (hi >>> 6)) >>> 0; // SHR 6
		      // low bits
		      t1_lo = (
		        ((hi << 13) | (lo >>> 19)) ^ // ROTR 19
		        ((lo << 3) | (hi >>> 29)) ^ // ROTR 61/(swap + ROTR 29)
		        ((hi << 26) | (lo >>> 6))) >>> 0; // SHR 6

		      // for word 15 words ago: ROTR 1(x) ^ ROTR 8(x) ^ SHR 7(x)
		      w15 = w[i - 15];
		      hi = w15[0];
		      lo = w15[1];

		      // high bits
		      t2_hi = (
		        ((hi >>> 1) | (lo << 31)) ^ // ROTR 1
		        ((hi >>> 8) | (lo << 24)) ^ // ROTR 8
		        (hi >>> 7)) >>> 0; // SHR 7
		      // low bits
		      t2_lo = (
		        ((hi << 31) | (lo >>> 1)) ^ // ROTR 1
		        ((hi << 24) | (lo >>> 8)) ^ // ROTR 8
		        ((hi << 25) | (lo >>> 7))) >>> 0; // SHR 7

		      // sum(t1, word 7 ago, t2, word 16 ago) modulo 2^64 (carry lo overflow)
		      w7 = w[i - 7];
		      w16 = w[i - 16];
		      lo = (t1_lo + w7[1] + t2_lo + w16[1]);
		      w[i][0] = (t1_hi + w7[0] + t2_hi + w16[0] +
		        ((lo / 0x100000000) >>> 0)) >>> 0;
		      w[i][1] = lo >>> 0;
		    }

		    // initialize hash value for this chunk
		    a_hi = s[0][0];
		    a_lo = s[0][1];
		    b_hi = s[1][0];
		    b_lo = s[1][1];
		    c_hi = s[2][0];
		    c_lo = s[2][1];
		    d_hi = s[3][0];
		    d_lo = s[3][1];
		    e_hi = s[4][0];
		    e_lo = s[4][1];
		    f_hi = s[5][0];
		    f_lo = s[5][1];
		    g_hi = s[6][0];
		    g_lo = s[6][1];
		    h_hi = s[7][0];
		    h_lo = s[7][1];

		    // round function
		    for(i = 0; i < 80; ++i) {
		      // Sum1(e) = ROTR 14(e) ^ ROTR 18(e) ^ ROTR 41(e)
		      s1_hi = (
		        ((e_hi >>> 14) | (e_lo << 18)) ^ // ROTR 14
		        ((e_hi >>> 18) | (e_lo << 14)) ^ // ROTR 18
		        ((e_lo >>> 9) | (e_hi << 23))) >>> 0; // ROTR 41/(swap + ROTR 9)
		      s1_lo = (
		        ((e_hi << 18) | (e_lo >>> 14)) ^ // ROTR 14
		        ((e_hi << 14) | (e_lo >>> 18)) ^ // ROTR 18
		        ((e_lo << 23) | (e_hi >>> 9))) >>> 0; // ROTR 41/(swap + ROTR 9)

		      // Ch(e, f, g) (optimized the same way as SHA-1)
		      ch_hi = (g_hi ^ (e_hi & (f_hi ^ g_hi))) >>> 0;
		      ch_lo = (g_lo ^ (e_lo & (f_lo ^ g_lo))) >>> 0;

		      // Sum0(a) = ROTR 28(a) ^ ROTR 34(a) ^ ROTR 39(a)
		      s0_hi = (
		        ((a_hi >>> 28) | (a_lo << 4)) ^ // ROTR 28
		        ((a_lo >>> 2) | (a_hi << 30)) ^ // ROTR 34/(swap + ROTR 2)
		        ((a_lo >>> 7) | (a_hi << 25))) >>> 0; // ROTR 39/(swap + ROTR 7)
		      s0_lo = (
		        ((a_hi << 4) | (a_lo >>> 28)) ^ // ROTR 28
		        ((a_lo << 30) | (a_hi >>> 2)) ^ // ROTR 34/(swap + ROTR 2)
		        ((a_lo << 25) | (a_hi >>> 7))) >>> 0; // ROTR 39/(swap + ROTR 7)

		      // Maj(a, b, c) (optimized the same way as SHA-1)
		      maj_hi = ((a_hi & b_hi) | (c_hi & (a_hi ^ b_hi))) >>> 0;
		      maj_lo = ((a_lo & b_lo) | (c_lo & (a_lo ^ b_lo))) >>> 0;

		      // main algorithm
		      // t1 = (h + s1 + ch + _k[i] + _w[i]) modulo 2^64 (carry lo overflow)
		      lo = (h_lo + s1_lo + ch_lo + _k[i][1] + w[i][1]);
		      t1_hi = (h_hi + s1_hi + ch_hi + _k[i][0] + w[i][0] +
		        ((lo / 0x100000000) >>> 0)) >>> 0;
		      t1_lo = lo >>> 0;

		      // t2 = s0 + maj modulo 2^64 (carry lo overflow)
		      lo = s0_lo + maj_lo;
		      t2_hi = (s0_hi + maj_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		      t2_lo = lo >>> 0;

		      h_hi = g_hi;
		      h_lo = g_lo;

		      g_hi = f_hi;
		      g_lo = f_lo;

		      f_hi = e_hi;
		      f_lo = e_lo;

		      // e = (d + t1) modulo 2^64 (carry lo overflow)
		      lo = d_lo + t1_lo;
		      e_hi = (d_hi + t1_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		      e_lo = lo >>> 0;

		      d_hi = c_hi;
		      d_lo = c_lo;

		      c_hi = b_hi;
		      c_lo = b_lo;

		      b_hi = a_hi;
		      b_lo = a_lo;

		      // a = (t1 + t2) modulo 2^64 (carry lo overflow)
		      lo = t1_lo + t2_lo;
		      a_hi = (t1_hi + t2_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		      a_lo = lo >>> 0;
		    }

		    // update hash state (additional modulo 2^64)
		    lo = s[0][1] + a_lo;
		    s[0][0] = (s[0][0] + a_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[0][1] = lo >>> 0;

		    lo = s[1][1] + b_lo;
		    s[1][0] = (s[1][0] + b_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[1][1] = lo >>> 0;

		    lo = s[2][1] + c_lo;
		    s[2][0] = (s[2][0] + c_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[2][1] = lo >>> 0;

		    lo = s[3][1] + d_lo;
		    s[3][0] = (s[3][0] + d_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[3][1] = lo >>> 0;

		    lo = s[4][1] + e_lo;
		    s[4][0] = (s[4][0] + e_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[4][1] = lo >>> 0;

		    lo = s[5][1] + f_lo;
		    s[5][0] = (s[5][0] + f_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[5][1] = lo >>> 0;

		    lo = s[6][1] + g_lo;
		    s[6][0] = (s[6][0] + g_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[6][1] = lo >>> 0;

		    lo = s[7][1] + h_lo;
		    s[7][0] = (s[7][0] + h_hi + ((lo / 0x100000000) >>> 0)) >>> 0;
		    s[7][1] = lo >>> 0;

		    len -= 128;
		  }
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'sha512';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/sha512',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Node.js module for Forge message digests.
		 *
		 * @author Dave Longley
		 *
		 * Copyright 2011-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.md = forge.md || {};
		forge.md.algorithms = {
		  md5: forge.md5,
		  sha1: forge.sha1,
		  sha256: forge.sha256
		};
		forge.md.md5 = forge.md5;
		forge.md.sha1 = forge.sha1;
		forge.md.sha256 = forge.sha256;

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'md';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define(
		  'js/md',['require', 'module', './md5', './sha1', './sha256', './sha512'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Hash-based Message Authentication Code implementation. Requires a message
		 * digest object that can be obtained, for example, from forge.md.sha1 or
		 * forge.md.md5.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2012 Digital Bazaar, Inc. All rights reserved.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* HMAC API */
		var hmac = forge.hmac = forge.hmac || {};

		/**
		 * Creates an HMAC object that uses the given message digest object.
		 *
		 * @return an HMAC object.
		 */
		hmac.create = function() {
		  // the hmac key to use
		  var _key = null;

		  // the message digest to use
		  var _md = null;

		  // the inner padding
		  var _ipadding = null;

		  // the outer padding
		  var _opadding = null;

		  // hmac context
		  var ctx = {};

		  /**
		   * Starts or restarts the HMAC with the given key and message digest.
		   *
		   * @param md the message digest to use, null to reuse the previous one,
		   *           a string to use builtin 'sha1', 'md5', 'sha256'.
		   * @param key the key to use as a string, array of bytes, byte buffer,
		   *           or null to reuse the previous key.
		   */
		  ctx.start = function(md, key) {
		    if(md !== null) {
		      if(typeof md === 'string') {
		        // create builtin message digest
		        md = md.toLowerCase();
		        if(md in forge.md.algorithms) {
		          _md = forge.md.algorithms[md].create();
		        } else {
		          throw new Error('Unknown hash algorithm "' + md + '"');
		        }
		      } else {
		        // store message digest
		        _md = md;
		      }
		    }

		    if(key === null) {
		      // reuse previous key
		      key = _key;
		    } else {
		      if(typeof key === 'string') {
		        // convert string into byte buffer
		        key = forge.util.createBuffer(key);
		      } else if(forge.util.isArray(key)) {
		        // convert byte array into byte buffer
		        var tmp = key;
		        key = forge.util.createBuffer();
		        for(var i = 0; i < tmp.length; ++i) {
		          key.putByte(tmp[i]);
		        }
		      }

		      // if key is longer than blocksize, hash it
		      var keylen = key.length();
		      if(keylen > _md.blockLength) {
		        _md.start();
		        _md.update(key.bytes());
		        key = _md.digest();
		      }

		      // mix key into inner and outer padding
		      // ipadding = [0x36 * blocksize] ^ key
		      // opadding = [0x5C * blocksize] ^ key
		      _ipadding = forge.util.createBuffer();
		      _opadding = forge.util.createBuffer();
		      keylen = key.length();
		      for(var i = 0; i < keylen; ++i) {
		        var tmp = key.at(i);
		        _ipadding.putByte(0x36 ^ tmp);
		        _opadding.putByte(0x5C ^ tmp);
		      }

		      // if key is shorter than blocksize, add additional padding
		      if(keylen < _md.blockLength) {
		        var tmp = _md.blockLength - keylen;
		        for(var i = 0; i < tmp; ++i) {
		          _ipadding.putByte(0x36);
		          _opadding.putByte(0x5C);
		        }
		      }
		      _key = key;
		      _ipadding = _ipadding.bytes();
		      _opadding = _opadding.bytes();
		    }

		    // digest is done like so: hash(opadding | hash(ipadding | message))

		    // prepare to do inner hash
		    // hash(ipadding | message)
		    _md.start();
		    _md.update(_ipadding);
		  };

		  /**
		   * Updates the HMAC with the given message bytes.
		   *
		   * @param bytes the bytes to update with.
		   */
		  ctx.update = function(bytes) {
		    _md.update(bytes);
		  };

		  /**
		   * Produces the Message Authentication Code (MAC).
		   *
		   * @return a byte buffer containing the digest value.
		   */
		  ctx.getMac = function() {
		    // digest is done like so: hash(opadding | hash(ipadding | message))
		    // here we do the outer hashing
		    var inner = _md.digest().bytes();
		    _md.start();
		    _md.update(_opadding);
		    _md.update(inner);
		    return _md.digest();
		  };
		  // alias for getMac
		  ctx.digest = ctx.getMac;

		  return ctx;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'hmac';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/hmac',['require', 'module', './md', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of basic PEM (Privacy Enhanced Mail) algorithms.
		 *
		 * See: RFC 1421.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2013-2014 Digital Bazaar, Inc.
		 *
		 * A Forge PEM object has the following fields:
		 *
		 * type: identifies the type of message (eg: "RSA PRIVATE KEY").
		 *
		 * procType: identifies the type of processing performed on the message,
		 *   it has two subfields: version and type, eg: 4,ENCRYPTED.
		 *
		 * contentDomain: identifies the type of content in the message, typically
		 *   only uses the value: "RFC822".
		 *
		 * dekInfo: identifies the message encryption algorithm and mode and includes
		 *   any parameters for the algorithm, it has two subfields: algorithm and
		 *   parameters, eg: DES-CBC,F8143EDE5960C597.
		 *
		 * headers: contains all other PEM encapsulated headers -- where order is
		 *   significant (for pairing data like recipient ID + key info).
		 *
		 * body: the binary-encoded body.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for pem API
		var pem = forge.pem = forge.pem || {};

		/**
		 * Encodes (serializes) the given PEM object.
		 *
		 * @param msg the PEM message object to encode.
		 * @param options the options to use:
		 *          maxline the maximum characters per line for the body, (default: 64).
		 *
		 * @return the PEM-formatted string.
		 */
		pem.encode = function(msg, options) {
		  options = options || {};
		  var rval = '-----BEGIN ' + msg.type + '-----\r\n';

		  // encode special headers
		  var header;
		  if(msg.procType) {
		    header = {
		      name: 'Proc-Type',
		      values: [String(msg.procType.version), msg.procType.type]
		    };
		    rval += foldHeader(header);
		  }
		  if(msg.contentDomain) {
		    header = {name: 'Content-Domain', values: [msg.contentDomain]};
		    rval += foldHeader(header);
		  }
		  if(msg.dekInfo) {
		    header = {name: 'DEK-Info', values: [msg.dekInfo.algorithm]};
		    if(msg.dekInfo.parameters) {
		      header.values.push(msg.dekInfo.parameters);
		    }
		    rval += foldHeader(header);
		  }

		  if(msg.headers) {
		    // encode all other headers
		    for(var i = 0; i < msg.headers.length; ++i) {
		      rval += foldHeader(msg.headers[i]);
		    }
		  }

		  // terminate header
		  if(msg.procType) {
		    rval += '\r\n';
		  }

		  // add body
		  rval += forge.util.encode64(msg.body, options.maxline || 64) + '\r\n';

		  rval += '-----END ' + msg.type + '-----\r\n';
		  return rval;
		};

		/**
		 * Decodes (deserializes) all PEM messages found in the given string.
		 *
		 * @param str the PEM-formatted string to decode.
		 *
		 * @return the PEM message objects in an array.
		 */
		pem.decode = function(str) {
		  var rval = [];

		  // split string into PEM messages (be lenient w/EOF on BEGIN line)
		  var rMessage = /\s*-----BEGIN ([A-Z0-9- ]+)-----\r?\n?([\x21-\x7e\s]+?(?:\r?\n\r?\n))?([:A-Za-z0-9+\/=\s]+?)-----END \1-----/g;
		  var rHeader = /([\x21-\x7e]+):\s*([\x21-\x7e\s^:]+)/;
		  var rCRLF = /\r?\n/;
		  var match;
		  while(true) {
		    match = rMessage.exec(str);
		    if(!match) {
		      break;
		    }

		    var msg = {
		      type: match[1],
		      procType: null,
		      contentDomain: null,
		      dekInfo: null,
		      headers: [],
		      body: forge.util.decode64(match[3])
		    };
		    rval.push(msg);

		    // no headers
		    if(!match[2]) {
		      continue;
		    }

		    // parse headers
		    var lines = match[2].split(rCRLF);
		    var li = 0;
		    while(match && li < lines.length) {
		      // get line, trim any rhs whitespace
		      var line = lines[li].replace(/\s+$/, '');

		      // RFC2822 unfold any following folded lines
		      for(var nl = li + 1; nl < lines.length; ++nl) {
		        var next = lines[nl];
		        if(!/\s/.test(next[0])) {
		          break;
		        }
		        line += next;
		        li = nl;
		      }

		      // parse header
		      match = line.match(rHeader);
		      if(match) {
		        var header = {name: match[1], values: []};
		        var values = match[2].split(',');
		        for(var vi = 0; vi < values.length; ++vi) {
		          header.values.push(ltrim(values[vi]));
		        }

		        // Proc-Type must be the first header
		        if(!msg.procType) {
		          if(header.name !== 'Proc-Type') {
		            throw new Error('Invalid PEM formatted message. The first ' +
		              'encapsulated header must be "Proc-Type".');
		          } else if(header.values.length !== 2) {
		            throw new Error('Invalid PEM formatted message. The "Proc-Type" ' +
		              'header must have two subfields.');
		          }
		          msg.procType = {version: values[0], type: values[1]};
		        } else if(!msg.contentDomain && header.name === 'Content-Domain') {
		          // special-case Content-Domain
		          msg.contentDomain = values[0] || '';
		        } else if(!msg.dekInfo && header.name === 'DEK-Info') {
		          // special-case DEK-Info
		          if(header.values.length === 0) {
		            throw new Error('Invalid PEM formatted message. The "DEK-Info" ' +
		              'header must have at least one subfield.');
		          }
		          msg.dekInfo = {algorithm: values[0], parameters: values[1] || null};
		        } else {
		          msg.headers.push(header);
		        }
		      }

		      ++li;
		    }

		    if(msg.procType === 'ENCRYPTED' && !msg.dekInfo) {
		      throw new Error('Invalid PEM formatted message. The "DEK-Info" ' +
		        'header must be present if "Proc-Type" is "ENCRYPTED".');
		    }
		  }

		  if(rval.length === 0) {
		    throw new Error('Invalid PEM formatted message.');
		  }

		  return rval;
		};

		function foldHeader(header) {
		  var rval = header.name + ': ';

		  // ensure values with CRLF are folded
		  var values = [];
		  var insertSpace = function(match, $1) {
		    return ' ' + $1;
		  };
		  for(var i = 0; i < header.values.length; ++i) {
		    values.push(header.values[i].replace(/^(\S+\r\n)/, insertSpace));
		  }
		  rval += values.join(',') + '\r\n';

		  // do folding
		  var length = 0;
		  var candidate = -1;
		  for(var i = 0; i < rval.length; ++i, ++length) {
		    if(length > 65 && candidate !== -1) {
		      var insert = rval[candidate];
		      if(insert === ',') {
		        ++candidate;
		        rval = rval.substr(0, candidate) + '\r\n ' + rval.substr(candidate);
		      } else {
		        rval = rval.substr(0, candidate) +
		          '\r\n' + insert + rval.substr(candidate + 1);
		      }
		      length = (i - candidate - 1);
		      candidate = -1;
		      ++i;
		    } else if(rval[i] === ' ' || rval[i] === '\t' || rval[i] === ',') {
		      candidate = i;
		    }
		  }

		  return rval;
		}

		function ltrim(str) {
		  return str.replace(/^\s+/, '');
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pem';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pem',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * DES (Data Encryption Standard) implementation.
		 *
		 * This implementation supports DES as well as 3DES-EDE in ECB and CBC mode.
		 * It is based on the BSD-licensed implementation by Paul Tero:
		 *
		 * Paul Tero, July 2001
		 * http://www.tero.co.uk/des/
		 *
		 * Optimised for performance with large blocks by Michael Hayworth, November 2001
		 * http://www.netdealing.com
		 *
		 * THIS SOFTWARE IS PROVIDED "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 AUTHOR 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.
		 *
		 * @author Stefan Siegl
		 * @author Dave Longley
		 *
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 * Copyright (c) 2012-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* DES API */
		forge.des = forge.des || {};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var cipher = forge.cipher.createCipher('DES-<mode>', key);
		 * cipher.start({iv: iv});
		 *
		 * Creates an DES cipher object to encrypt data using the given symmetric key.
		 * The output will be stored in the 'output' member of the returned cipher.
		 *
		 * The key and iv may be given as binary-encoded strings of bytes or
		 * byte buffers.
		 *
		 * @param key the symmetric key to use (64 or 192 bits).
		 * @param iv the initialization vector to use.
		 * @param output the buffer to write to, null to create one.
		 * @param mode the cipher mode to use (default: 'CBC' if IV is
		 *          given, 'ECB' if null).
		 *
		 * @return the cipher.
		 */
		forge.des.startEncrypting = function(key, iv, output, mode) {
		  var cipher = _createCipher({
		    key: key,
		    output: output,
		    decrypt: false,
		    mode: mode || (iv === null ? 'ECB' : 'CBC')
		  });
		  cipher.start(iv);
		  return cipher;
		};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var cipher = forge.cipher.createCipher('DES-<mode>', key);
		 *
		 * Creates an DES cipher object to encrypt data using the given symmetric key.
		 *
		 * The key may be given as a binary-encoded string of bytes or a byte buffer.
		 *
		 * @param key the symmetric key to use (64 or 192 bits).
		 * @param mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		forge.des.createEncryptionCipher = function(key, mode) {
		  return _createCipher({
		    key: key,
		    output: null,
		    decrypt: false,
		    mode: mode
		  });
		};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var decipher = forge.cipher.createDecipher('DES-<mode>', key);
		 * decipher.start({iv: iv});
		 *
		 * Creates an DES cipher object to decrypt data using the given symmetric key.
		 * The output will be stored in the 'output' member of the returned cipher.
		 *
		 * The key and iv may be given as binary-encoded strings of bytes or
		 * byte buffers.
		 *
		 * @param key the symmetric key to use (64 or 192 bits).
		 * @param iv the initialization vector to use.
		 * @param output the buffer to write to, null to create one.
		 * @param mode the cipher mode to use (default: 'CBC' if IV is
		 *          given, 'ECB' if null).
		 *
		 * @return the cipher.
		 */
		forge.des.startDecrypting = function(key, iv, output, mode) {
		  var cipher = _createCipher({
		    key: key,
		    output: output,
		    decrypt: true,
		    mode: mode || (iv === null ? 'ECB' : 'CBC')
		  });
		  cipher.start(iv);
		  return cipher;
		};

		/**
		 * Deprecated. Instead, use:
		 *
		 * var decipher = forge.cipher.createDecipher('DES-<mode>', key);
		 *
		 * Creates an DES cipher object to decrypt data using the given symmetric key.
		 *
		 * The key may be given as a binary-encoded string of bytes or a byte buffer.
		 *
		 * @param key the symmetric key to use (64 or 192 bits).
		 * @param mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		forge.des.createDecryptionCipher = function(key, mode) {
		  return _createCipher({
		    key: key,
		    output: null,
		    decrypt: true,
		    mode: mode
		  });
		};

		/**
		 * Creates a new DES cipher algorithm object.
		 *
		 * @param name the name of the algorithm.
		 * @param mode the mode factory function.
		 *
		 * @return the DES algorithm object.
		 */
		forge.des.Algorithm = function(name, mode) {
		  var self = this;
		  self.name = name;
		  self.mode = new mode({
		    blockSize: 8,
		    cipher: {
		      encrypt: function(inBlock, outBlock) {
		        return _updateBlock(self._keys, inBlock, outBlock, false);
		      },
		      decrypt: function(inBlock, outBlock) {
		        return _updateBlock(self._keys, inBlock, outBlock, true);
		      }
		    }
		  });
		  self._init = false;
		};

		/**
		 * Initializes this DES algorithm by expanding its key.
		 *
		 * @param options the options to use.
		 *          key the key to use with this algorithm.
		 *          decrypt true if the algorithm should be initialized for decryption,
		 *            false for encryption.
		 */
		forge.des.Algorithm.prototype.initialize = function(options) {
		  if(this._init) {
		    return;
		  }

		  var key = forge.util.createBuffer(options.key);
		  if(this.name.indexOf('3DES') === 0) {
		    if(key.length() !== 24) {
		      throw new Error('Invalid Triple-DES key size: ' + key.length() * 8);
		    }
		  }

		  // do key expansion to 16 or 48 subkeys (single or triple DES)
		  this._keys = _createKeys(key);
		  this._init = true;
		};


		/** Register DES algorithms **/

		registerAlgorithm('DES-ECB', forge.cipher.modes.ecb);
		registerAlgorithm('DES-CBC', forge.cipher.modes.cbc);
		registerAlgorithm('DES-CFB', forge.cipher.modes.cfb);
		registerAlgorithm('DES-OFB', forge.cipher.modes.ofb);
		registerAlgorithm('DES-CTR', forge.cipher.modes.ctr);

		registerAlgorithm('3DES-ECB', forge.cipher.modes.ecb);
		registerAlgorithm('3DES-CBC', forge.cipher.modes.cbc);
		registerAlgorithm('3DES-CFB', forge.cipher.modes.cfb);
		registerAlgorithm('3DES-OFB', forge.cipher.modes.ofb);
		registerAlgorithm('3DES-CTR', forge.cipher.modes.ctr);

		function registerAlgorithm(name, mode) {
		  var factory = function() {
		    return new forge.des.Algorithm(name, mode);
		  };
		  forge.cipher.registerAlgorithm(name, factory);
		}


		/** DES implementation **/

		var spfunction1 = [0x1010400,0,0x10000,0x1010404,0x1010004,0x10404,0x4,0x10000,0x400,0x1010400,0x1010404,0x400,0x1000404,0x1010004,0x1000000,0x4,0x404,0x1000400,0x1000400,0x10400,0x10400,0x1010000,0x1010000,0x1000404,0x10004,0x1000004,0x1000004,0x10004,0,0x404,0x10404,0x1000000,0x10000,0x1010404,0x4,0x1010000,0x1010400,0x1000000,0x1000000,0x400,0x1010004,0x10000,0x10400,0x1000004,0x400,0x4,0x1000404,0x10404,0x1010404,0x10004,0x1010000,0x1000404,0x1000004,0x404,0x10404,0x1010400,0x404,0x1000400,0x1000400,0,0x10004,0x10400,0,0x1010004];
		var spfunction2 = [-0x7fef7fe0,-0x7fff8000,0x8000,0x108020,0x100000,0x20,-0x7fefffe0,-0x7fff7fe0,-0x7fffffe0,-0x7fef7fe0,-0x7fef8000,-0x80000000,-0x7fff8000,0x100000,0x20,-0x7fefffe0,0x108000,0x100020,-0x7fff7fe0,0,-0x80000000,0x8000,0x108020,-0x7ff00000,0x100020,-0x7fffffe0,0,0x108000,0x8020,-0x7fef8000,-0x7ff00000,0x8020,0,0x108020,-0x7fefffe0,0x100000,-0x7fff7fe0,-0x7ff00000,-0x7fef8000,0x8000,-0x7ff00000,-0x7fff8000,0x20,-0x7fef7fe0,0x108020,0x20,0x8000,-0x80000000,0x8020,-0x7fef8000,0x100000,-0x7fffffe0,0x100020,-0x7fff7fe0,-0x7fffffe0,0x100020,0x108000,0,-0x7fff8000,0x8020,-0x80000000,-0x7fefffe0,-0x7fef7fe0,0x108000];
		var spfunction3 = [0x208,0x8020200,0,0x8020008,0x8000200,0,0x20208,0x8000200,0x20008,0x8000008,0x8000008,0x20000,0x8020208,0x20008,0x8020000,0x208,0x8000000,0x8,0x8020200,0x200,0x20200,0x8020000,0x8020008,0x20208,0x8000208,0x20200,0x20000,0x8000208,0x8,0x8020208,0x200,0x8000000,0x8020200,0x8000000,0x20008,0x208,0x20000,0x8020200,0x8000200,0,0x200,0x20008,0x8020208,0x8000200,0x8000008,0x200,0,0x8020008,0x8000208,0x20000,0x8000000,0x8020208,0x8,0x20208,0x20200,0x8000008,0x8020000,0x8000208,0x208,0x8020000,0x20208,0x8,0x8020008,0x20200];
		var spfunction4 = [0x802001,0x2081,0x2081,0x80,0x802080,0x800081,0x800001,0x2001,0,0x802000,0x802000,0x802081,0x81,0,0x800080,0x800001,0x1,0x2000,0x800000,0x802001,0x80,0x800000,0x2001,0x2080,0x800081,0x1,0x2080,0x800080,0x2000,0x802080,0x802081,0x81,0x800080,0x800001,0x802000,0x802081,0x81,0,0,0x802000,0x2080,0x800080,0x800081,0x1,0x802001,0x2081,0x2081,0x80,0x802081,0x81,0x1,0x2000,0x800001,0x2001,0x802080,0x800081,0x2001,0x2080,0x800000,0x802001,0x80,0x800000,0x2000,0x802080];
		var spfunction5 = [0x100,0x2080100,0x2080000,0x42000100,0x80000,0x100,0x40000000,0x2080000,0x40080100,0x80000,0x2000100,0x40080100,0x42000100,0x42080000,0x80100,0x40000000,0x2000000,0x40080000,0x40080000,0,0x40000100,0x42080100,0x42080100,0x2000100,0x42080000,0x40000100,0,0x42000000,0x2080100,0x2000000,0x42000000,0x80100,0x80000,0x42000100,0x100,0x2000000,0x40000000,0x2080000,0x42000100,0x40080100,0x2000100,0x40000000,0x42080000,0x2080100,0x40080100,0x100,0x2000000,0x42080000,0x42080100,0x80100,0x42000000,0x42080100,0x2080000,0,0x40080000,0x42000000,0x80100,0x2000100,0x40000100,0x80000,0,0x40080000,0x2080100,0x40000100];
		var spfunction6 = [0x20000010,0x20400000,0x4000,0x20404010,0x20400000,0x10,0x20404010,0x400000,0x20004000,0x404010,0x400000,0x20000010,0x400010,0x20004000,0x20000000,0x4010,0,0x400010,0x20004010,0x4000,0x404000,0x20004010,0x10,0x20400010,0x20400010,0,0x404010,0x20404000,0x4010,0x404000,0x20404000,0x20000000,0x20004000,0x10,0x20400010,0x404000,0x20404010,0x400000,0x4010,0x20000010,0x400000,0x20004000,0x20000000,0x4010,0x20000010,0x20404010,0x404000,0x20400000,0x404010,0x20404000,0,0x20400010,0x10,0x4000,0x20400000,0x404010,0x4000,0x400010,0x20004010,0,0x20404000,0x20000000,0x400010,0x20004010];
		var spfunction7 = [0x200000,0x4200002,0x4000802,0,0x800,0x4000802,0x200802,0x4200800,0x4200802,0x200000,0,0x4000002,0x2,0x4000000,0x4200002,0x802,0x4000800,0x200802,0x200002,0x4000800,0x4000002,0x4200000,0x4200800,0x200002,0x4200000,0x800,0x802,0x4200802,0x200800,0x2,0x4000000,0x200800,0x4000000,0x200800,0x200000,0x4000802,0x4000802,0x4200002,0x4200002,0x2,0x200002,0x4000000,0x4000800,0x200000,0x4200800,0x802,0x200802,0x4200800,0x802,0x4000002,0x4200802,0x4200000,0x200800,0,0x2,0x4200802,0,0x200802,0x4200000,0x800,0x4000002,0x4000800,0x800,0x200002];
		var spfunction8 = [0x10001040,0x1000,0x40000,0x10041040,0x10000000,0x10001040,0x40,0x10000000,0x40040,0x10040000,0x10041040,0x41000,0x10041000,0x41040,0x1000,0x40,0x10040000,0x10000040,0x10001000,0x1040,0x41000,0x40040,0x10040040,0x10041000,0x1040,0,0,0x10040040,0x10000040,0x10001000,0x41040,0x40000,0x41040,0x40000,0x10041000,0x1000,0x40,0x10040040,0x1000,0x41040,0x10001000,0x40,0x10000040,0x10040000,0x10040040,0x10000000,0x40000,0x10001040,0,0x10041040,0x40040,0x10000040,0x10040000,0x10001000,0x10001040,0,0x10041040,0x41000,0x41000,0x1040,0x1040,0x40040,0x10000000,0x10041000];

		/**
		 * Create necessary sub keys.
		 *
		 * @param key the 64-bit or 192-bit key.
		 *
		 * @return the expanded keys.
		 */
		function _createKeys(key) {
		  var pc2bytes0  = [0,0x4,0x20000000,0x20000004,0x10000,0x10004,0x20010000,0x20010004,0x200,0x204,0x20000200,0x20000204,0x10200,0x10204,0x20010200,0x20010204],
		      pc2bytes1  = [0,0x1,0x100000,0x100001,0x4000000,0x4000001,0x4100000,0x4100001,0x100,0x101,0x100100,0x100101,0x4000100,0x4000101,0x4100100,0x4100101],
		      pc2bytes2  = [0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808,0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808],
		      pc2bytes3  = [0,0x200000,0x8000000,0x8200000,0x2000,0x202000,0x8002000,0x8202000,0x20000,0x220000,0x8020000,0x8220000,0x22000,0x222000,0x8022000,0x8222000],
		      pc2bytes4  = [0,0x40000,0x10,0x40010,0,0x40000,0x10,0x40010,0x1000,0x41000,0x1010,0x41010,0x1000,0x41000,0x1010,0x41010],
		      pc2bytes5  = [0,0x400,0x20,0x420,0,0x400,0x20,0x420,0x2000000,0x2000400,0x2000020,0x2000420,0x2000000,0x2000400,0x2000020,0x2000420],
		      pc2bytes6  = [0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002,0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002],
		      pc2bytes7  = [0,0x10000,0x800,0x10800,0x20000000,0x20010000,0x20000800,0x20010800,0x20000,0x30000,0x20800,0x30800,0x20020000,0x20030000,0x20020800,0x20030800],
		      pc2bytes8  = [0,0x40000,0,0x40000,0x2,0x40002,0x2,0x40002,0x2000000,0x2040000,0x2000000,0x2040000,0x2000002,0x2040002,0x2000002,0x2040002],
		      pc2bytes9  = [0,0x10000000,0x8,0x10000008,0,0x10000000,0x8,0x10000008,0x400,0x10000400,0x408,0x10000408,0x400,0x10000400,0x408,0x10000408],
		      pc2bytes10 = [0,0x20,0,0x20,0x100000,0x100020,0x100000,0x100020,0x2000,0x2020,0x2000,0x2020,0x102000,0x102020,0x102000,0x102020],
		      pc2bytes11 = [0,0x1000000,0x200,0x1000200,0x200000,0x1200000,0x200200,0x1200200,0x4000000,0x5000000,0x4000200,0x5000200,0x4200000,0x5200000,0x4200200,0x5200200],
		      pc2bytes12 = [0,0x1000,0x8000000,0x8001000,0x80000,0x81000,0x8080000,0x8081000,0x10,0x1010,0x8000010,0x8001010,0x80010,0x81010,0x8080010,0x8081010],
		      pc2bytes13 = [0,0x4,0x100,0x104,0,0x4,0x100,0x104,0x1,0x5,0x101,0x105,0x1,0x5,0x101,0x105];

		  // how many iterations (1 for des, 3 for triple des)
		  // changed by Paul 16/6/2007 to use Triple DES for 9+ byte keys
		  var iterations = key.length() > 8 ? 3 : 1;

		  // stores the return keys
		  var keys = [];

		  // now define the left shifts which need to be done
		  var shifts = [0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0];

		  var n = 0, tmp;
		  for(var j = 0; j < iterations; j ++) {
		    var left = key.getInt32();
		    var right = key.getInt32();

		    tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;
		    right ^= tmp;
		    left ^= (tmp << 4);

		    tmp = ((right >>> -16) ^ left) & 0x0000ffff;
		    left ^= tmp;
		    right ^= (tmp << -16);

		    tmp = ((left >>> 2) ^ right) & 0x33333333;
		    right ^= tmp;
		    left ^= (tmp << 2);

		    tmp = ((right >>> -16) ^ left) & 0x0000ffff;
		    left ^= tmp;
		    right ^= (tmp << -16);

		    tmp = ((left >>> 1) ^ right) & 0x55555555;
		    right ^= tmp;
		    left ^= (tmp << 1);

		    tmp = ((right >>> 8) ^ left) & 0x00ff00ff;
		    left ^= tmp;
		    right ^= (tmp << 8);

		    tmp = ((left >>> 1) ^ right) & 0x55555555;
		    right ^= tmp;
		    left ^= (tmp << 1);

		    // right needs to be shifted and OR'd with last four bits of left
		    tmp = (left << 8) | ((right >>> 20) & 0x000000f0);

		    // left needs to be put upside down
		    left = ((right << 24) | ((right << 8) & 0xff0000) |
		      ((right >>> 8) & 0xff00) | ((right >>> 24) & 0xf0));
		    right = tmp;

		    // now go through and perform these shifts on the left and right keys
		    for(var i = 0; i < shifts.length; ++i) {
		      //shift the keys either one or two bits to the left
		      if(shifts[i]) {
		        left = (left << 2) | (left >>> 26);
		        right = (right << 2) | (right >>> 26);
		      } else {
		        left = (left << 1) | (left >>> 27);
		        right = (right << 1) | (right >>> 27);
		      }
		      left &= -0xf;
		      right &= -0xf;

		      // now apply PC-2, in such a way that E is easier when encrypting or
		      // decrypting this conversion will look like PC-2 except only the last 6
		      // bits of each byte are used rather than 48 consecutive bits and the
		      // order of lines will be according to how the S selection functions will
		      // be applied: S2, S4, S6, S8, S1, S3, S5, S7
		      var lefttmp = (
		        pc2bytes0[left >>> 28] | pc2bytes1[(left >>> 24) & 0xf] |
		        pc2bytes2[(left >>> 20) & 0xf] | pc2bytes3[(left >>> 16) & 0xf] |
		        pc2bytes4[(left >>> 12) & 0xf] | pc2bytes5[(left >>> 8) & 0xf] |
		        pc2bytes6[(left >>> 4) & 0xf]);
		      var righttmp = (
		        pc2bytes7[right >>> 28] | pc2bytes8[(right >>> 24) & 0xf] |
		        pc2bytes9[(right >>> 20) & 0xf] | pc2bytes10[(right >>> 16) & 0xf] |
		        pc2bytes11[(right >>> 12) & 0xf] | pc2bytes12[(right >>> 8) & 0xf] |
		        pc2bytes13[(right >>> 4) & 0xf]);
		      tmp = ((righttmp >>> 16) ^ lefttmp) & 0x0000ffff;
		      keys[n++] = lefttmp ^ tmp;
		      keys[n++] = righttmp ^ (tmp << 16);
		    }
		  }

		  return keys;
		}

		/**
		 * Updates a single block (1 byte) using DES. The update will either
		 * encrypt or decrypt the block.
		 *
		 * @param keys the expanded keys.
		 * @param input the input block (an array of 32-bit words).
		 * @param output the updated output block.
		 * @param decrypt true to decrypt the block, false to encrypt it.
		 */
		function _updateBlock(keys, input, output, decrypt) {
		  // set up loops for single or triple DES
		  var iterations = keys.length === 32 ? 3 : 9;
		  var looping;
		  if(iterations === 3) {
		    looping = decrypt ? [30, -2, -2] : [0, 32, 2];
		  } else {
		    looping = (decrypt ?
		      [94, 62, -2, 32, 64, 2, 30, -2, -2] :
		      [0, 32, 2, 62, 30, -2, 64, 96, 2]);
		  }

		  var tmp;

		  var left = input[0];
		  var right = input[1];

		  // first each 64 bit chunk of the message must be permuted according to IP
		  tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;
		  right ^= tmp;
		  left ^= (tmp << 4);

		  tmp = ((left >>> 16) ^ right) & 0x0000ffff;
		  right ^= tmp;
		  left ^= (tmp << 16);

		  tmp = ((right >>> 2) ^ left) & 0x33333333;
		  left ^= tmp;
		  right ^= (tmp << 2);

		  tmp = ((right >>> 8) ^ left) & 0x00ff00ff;
		  left ^= tmp;
		  right ^= (tmp << 8);

		  tmp = ((left >>> 1) ^ right) & 0x55555555;
		  right ^= tmp;
		  left ^= (tmp << 1);

		  // rotate left 1 bit
		  left = ((left << 1) | (left >>> 31));
		  right = ((right << 1) | (right >>> 31));

		  for(var j = 0; j < iterations; j += 3) {
		    var endloop = looping[j + 1];
		    var loopinc = looping[j + 2];

		    // now go through and perform the encryption or decryption
		    for(var i = looping[j]; i != endloop; i += loopinc) {
		      var right1 = right ^ keys[i];
		      var right2 = ((right >>> 4) | (right << 28)) ^ keys[i + 1];

		      // passing these bytes through the S selection functions
		      tmp = left;
		      left = right;
		      right = tmp ^ (
		        spfunction2[(right1 >>> 24) & 0x3f] |
		        spfunction4[(right1 >>> 16) & 0x3f] |
		        spfunction6[(right1 >>>  8) & 0x3f] |
		        spfunction8[right1 & 0x3f] |
		        spfunction1[(right2 >>> 24) & 0x3f] |
		        spfunction3[(right2 >>> 16) & 0x3f] |
		        spfunction5[(right2 >>>  8) & 0x3f] |
		        spfunction7[right2 & 0x3f]);
		    }
		    // unreverse left and right
		    tmp = left;
		    left = right;
		    right = tmp;
		  }

		  // rotate right 1 bit
		  left = ((left >>> 1) | (left << 31));
		  right = ((right >>> 1) | (right << 31));

		  // now perform IP-1, which is IP in the opposite direction
		  tmp = ((left >>> 1) ^ right) & 0x55555555;
		  right ^= tmp;
		  left ^= (tmp << 1);

		  tmp = ((right >>> 8) ^ left) & 0x00ff00ff;
		  left ^= tmp;
		  right ^= (tmp << 8);

		  tmp = ((right >>> 2) ^ left) & 0x33333333;
		  left ^= tmp;
		  right ^= (tmp << 2);

		  tmp = ((left >>> 16) ^ right) & 0x0000ffff;
		  right ^= tmp;
		  left ^= (tmp << 16);

		  tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;
		  right ^= tmp;
		  left ^= (tmp << 4);

		  output[0] = left;
		  output[1] = right;
		}

		/**
		 * Deprecated. Instead, use:
		 *
		 * forge.cipher.createCipher('DES-<mode>', key);
		 * forge.cipher.createDecipher('DES-<mode>', key);
		 *
		 * Creates a deprecated DES cipher object. This object's mode will default to
		 * CBC (cipher-block-chaining).
		 *
		 * The key may be given as a binary-encoded string of bytes or a byte buffer.
		 *
		 * @param options the options to use.
		 *          key the symmetric key to use (64 or 192 bits).
		 *          output the buffer to write to.
		 *          decrypt true for decryption, false for encryption.
		 *          mode the cipher mode to use (default: 'CBC').
		 *
		 * @return the cipher.
		 */
		function _createCipher(options) {
		  options = options || {};
		  var mode = (options.mode || 'CBC').toUpperCase();
		  var algorithm = 'DES-' + mode;

		  var cipher;
		  if(options.decrypt) {
		    cipher = forge.cipher.createDecipher(algorithm, options.key);
		  } else {
		    cipher = forge.cipher.createCipher(algorithm, options.key);
		  }

		  // backwards compatible start API
		  var start = cipher.start;
		  cipher.start = function(iv, options) {
		    // backwards compatibility: support second arg as output buffer
		    var output = null;
		    if(options instanceof forge.util.ByteBuffer) {
		      output = options;
		      options = {};
		    }
		    options = options || {};
		    options.output = output;
		    options.iv = iv;
		    start.call(cipher, options);
		  };

		  return cipher;
		}


		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'des';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define(
		  'js/des',['require', 'module', './cipher', './cipherModes', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Password-Based Key-Derivation Function #2 implementation.
		 *
		 * See RFC 2898 for details.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2013 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var pkcs5 = forge.pkcs5 = forge.pkcs5 || {};

		var _nodejs = (
		  typeof process !== 'undefined' && process.versions && process.versions.node);
		var crypto;
		if(_nodejs && !forge.disableNativeCode) {
		  crypto = require('crypto');
		}

		/**
		 * Derives a key from a password.
		 *
		 * @param p the password as a binary-encoded string of bytes.
		 * @param s the salt as a binary-encoded string of bytes.
		 * @param c the iteration count, a positive integer.
		 * @param dkLen the intended length, in bytes, of the derived key,
		 *          (max: 2^32 - 1) * hash length of the PRF.
		 * @param [md] the message digest (or algorithm identifier as a string) to use
		 *          in the PRF, defaults to SHA-1.
		 * @param [callback(err, key)] presence triggers asynchronous version, called
		 *          once the operation completes.
		 *
		 * @return the derived key, as a binary-encoded string of bytes, for the
		 *           synchronous version (if no callback is specified).
		 */
		forge.pbkdf2 = pkcs5.pbkdf2 = function(p, s, c, dkLen, md, callback) {
		  if(typeof md === 'function') {
		    callback = md;
		    md = null;
		  }

		  // use native implementation if possible and not disabled, note that
		  // some node versions only support SHA-1, others allow digest to be changed
		  if(_nodejs && !forge.disableNativeCode && crypto.pbkdf2 &&
		    (md === null || typeof md !== 'object') &&
		    (crypto.pbkdf2Sync.length > 4 || (!md || md === 'sha1'))) {
		    if(typeof md !== 'string') {
		      // default prf to SHA-1
		      md = 'sha1';
		    }
		    s = new Buffer(s, 'binary');
		    if(!callback) {
		      if(crypto.pbkdf2Sync.length === 4) {
		        return crypto.pbkdf2Sync(p, s, c, dkLen).toString('binary');
		      }
		      return crypto.pbkdf2Sync(p, s, c, dkLen, md).toString('binary');
		    }
		    if(crypto.pbkdf2Sync.length === 4) {
		      return crypto.pbkdf2(p, s, c, dkLen, function(err, key) {
		        if(err) {
		          return callback(err);
		        }
		        callback(null, key.toString('binary'));
		      });
		    }
		    return crypto.pbkdf2(p, s, c, dkLen, md, function(err, key) {
		      if(err) {
		        return callback(err);
		      }
		      callback(null, key.toString('binary'));
		    });
		  }

		  if(typeof md === 'undefined' || md === null) {
		    // default prf to SHA-1
		    md = forge.md.sha1.create();
		  }
		  if(typeof md === 'string') {
		    if(!(md in forge.md.algorithms)) {
		      throw new Error('Unknown hash algorithm: ' + md);
		    }
		    md = forge.md[md].create();
		  }

		  var hLen = md.digestLength;

		  /* 1. If dkLen > (2^32 - 1) * hLen, output "derived key too long" and
		    stop. */
		  if(dkLen > (0xFFFFFFFF * hLen)) {
		    var err = new Error('Derived key is too long.');
		    if(callback) {
		      return callback(err);
		    }
		    throw err;
		  }

		  /* 2. Let len be the number of hLen-octet blocks in the derived key,
		    rounding up, and let r be the number of octets in the last
		    block:

		    len = CEIL(dkLen / hLen),
		    r = dkLen - (len - 1) * hLen. */
		  var len = Math.ceil(dkLen / hLen);
		  var r = dkLen - (len - 1) * hLen;

		  /* 3. For each block of the derived key apply the function F defined
		    below to the password P, the salt S, the iteration count c, and
		    the block index to compute the block:

		    T_1 = F(P, S, c, 1),
		    T_2 = F(P, S, c, 2),
		    ...
		    T_len = F(P, S, c, len),

		    where the function F is defined as the exclusive-or sum of the
		    first c iterates of the underlying pseudorandom function PRF
		    applied to the password P and the concatenation of the salt S
		    and the block index i:

		    F(P, S, c, i) = u_1 XOR u_2 XOR ... XOR u_c

		    where

		    u_1 = PRF(P, S || INT(i)),
		    u_2 = PRF(P, u_1),
		    ...
		    u_c = PRF(P, u_{c-1}).

		    Here, INT(i) is a four-octet encoding of the integer i, most
		    significant octet first. */
		  var prf = forge.hmac.create();
		  prf.start(md, p);
		  var dk = '';
		  var xor, u_c, u_c1;

		  // sync version
		  if(!callback) {
		    for(var i = 1; i <= len; ++i) {
		      // PRF(P, S || INT(i)) (first iteration)
		      prf.start(null, null);
		      prf.update(s);
		      prf.update(forge.util.int32ToBytes(i));
		      xor = u_c1 = prf.digest().getBytes();

		      // PRF(P, u_{c-1}) (other iterations)
		      for(var j = 2; j <= c; ++j) {
		        prf.start(null, null);
		        prf.update(u_c1);
		        u_c = prf.digest().getBytes();
		        // F(p, s, c, i)
		        xor = forge.util.xorBytes(xor, u_c, hLen);
		        u_c1 = u_c;
		      }

		      /* 4. Concatenate the blocks and extract the first dkLen octets to
		        produce a derived key DK:

		        DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */
		      dk += (i < len) ? xor : xor.substr(0, r);
		    }
		    /* 5. Output the derived key DK. */
		    return dk;
		  }

		  // async version
		  var i = 1, j;
		  function outer() {
		    if(i > len) {
		      // done
		      return callback(null, dk);
		    }

		    // PRF(P, S || INT(i)) (first iteration)
		    prf.start(null, null);
		    prf.update(s);
		    prf.update(forge.util.int32ToBytes(i));
		    xor = u_c1 = prf.digest().getBytes();

		    // PRF(P, u_{c-1}) (other iterations)
		    j = 2;
		    inner();
		  }

		  function inner() {
		    if(j <= c) {
		      prf.start(null, null);
		      prf.update(u_c1);
		      u_c = prf.digest().getBytes();
		      // F(p, s, c, i)
		      xor = forge.util.xorBytes(xor, u_c, hLen);
		      u_c1 = u_c;
		      ++j;
		      return forge.util.setImmediate(inner);
		    }

		    /* 4. Concatenate the blocks and extract the first dkLen octets to
		      produce a derived key DK:

		      DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */
		    dk += (i < len) ? xor : xor.substr(0, r);

		    ++i;
		    outer();
		  }

		  outer();
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pbkdf2';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pbkdf2',['require', 'module', './hmac', './md', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * A javascript implementation of a cryptographically-secure
		 * Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed
		 * here though the use of SHA-256 is not enforced; when generating an
		 * a PRNG context, the hashing algorithm and block cipher used for
		 * the generator are specified via a plugin.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var _nodejs = (
		  typeof process !== 'undefined' && process.versions && process.versions.node);
		var _crypto = null;
		if(!forge.disableNativeCode && _nodejs && !process.versions['node-webkit']) {
		  _crypto = require('crypto');
		}

		/* PRNG API */
		var prng = forge.prng = forge.prng || {};

		/**
		 * Creates a new PRNG context.
		 *
		 * A PRNG plugin must be passed in that will provide:
		 *
		 * 1. A function that initializes the key and seed of a PRNG context. It
		 *   will be given a 16 byte key and a 16 byte seed. Any key expansion
		 *   or transformation of the seed from a byte string into an array of
		 *   integers (or similar) should be performed.
		 * 2. The cryptographic function used by the generator. It takes a key and
		 *   a seed.
		 * 3. A seed increment function. It takes the seed and returns seed + 1.
		 * 4. An api to create a message digest.
		 *
		 * For an example, see random.js.
		 *
		 * @param plugin the PRNG plugin to use.
		 */
		prng.create = function(plugin) {
		  var ctx = {
		    plugin: plugin,
		    key: null,
		    seed: null,
		    time: null,
		    // number of reseeds so far
		    reseeds: 0,
		    // amount of data generated so far
		    generated: 0
		  };

		  // create 32 entropy pools (each is a message digest)
		  var md = plugin.md;
		  var pools = new Array(32);
		  for(var i = 0; i < 32; ++i) {
		    pools[i] = md.create();
		  }
		  ctx.pools = pools;

		  // entropy pools are written to cyclically, starting at index 0
		  ctx.pool = 0;

		  /**
		   * Generates random bytes. The bytes may be generated synchronously or
		   * asynchronously. Web workers must use the asynchronous interface or
		   * else the behavior is undefined.
		   *
		   * @param count the number of random bytes to generate.
		   * @param [callback(err, bytes)] called once the operation completes.
		   *
		   * @return count random bytes as a string.
		   */
		  ctx.generate = function(count, callback) {
		    // do synchronously
		    if(!callback) {
		      return ctx.generateSync(count);
		    }

		    // simple generator using counter-based CBC
		    var cipher = ctx.plugin.cipher;
		    var increment = ctx.plugin.increment;
		    var formatKey = ctx.plugin.formatKey;
		    var formatSeed = ctx.plugin.formatSeed;
		    var b = forge.util.createBuffer();

		    // reset key for every request
		    ctx.key = null;

		    generate();

		    function generate(err) {
		      if(err) {
		        return callback(err);
		      }

		      // sufficient bytes generated
		      if(b.length() >= count) {
		        return callback(null, b.getBytes(count));
		      }

		      // if amount of data generated is greater than 1 MiB, trigger reseed
		      if(ctx.generated > 0xfffff) {
		        ctx.key = null;
		      }

		      if(ctx.key === null) {
		        // prevent stack overflow
		        return forge.util.nextTick(function() {
		          _reseed(generate);
		        });
		      }

		      // generate the random bytes
		      var bytes = cipher(ctx.key, ctx.seed);
		      ctx.generated += bytes.length;
		      b.putBytes(bytes);

		      // generate bytes for a new key and seed
		      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
		      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));

		      forge.util.setImmediate(generate);
		    }
		  };

		  /**
		   * Generates random bytes synchronously.
		   *
		   * @param count the number of random bytes to generate.
		   *
		   * @return count random bytes as a string.
		   */
		  ctx.generateSync = function(count) {
		    // simple generator using counter-based CBC
		    var cipher = ctx.plugin.cipher;
		    var increment = ctx.plugin.increment;
		    var formatKey = ctx.plugin.formatKey;
		    var formatSeed = ctx.plugin.formatSeed;

		    // reset key for every request
		    ctx.key = null;

		    var b = forge.util.createBuffer();
		    while(b.length() < count) {
		      // if amount of data generated is greater than 1 MiB, trigger reseed
		      if(ctx.generated > 0xfffff) {
		        ctx.key = null;
		      }

		      if(ctx.key === null) {
		        _reseedSync();
		      }

		      // generate the random bytes
		      var bytes = cipher(ctx.key, ctx.seed);
		      ctx.generated += bytes.length;
		      b.putBytes(bytes);

		      // generate bytes for a new key and seed
		      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
		      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
		    }

		    return b.getBytes(count);
		  };

		  /**
		   * Private function that asynchronously reseeds a generator.
		   *
		   * @param callback(err) called once the operation completes.
		   */
		  function _reseed(callback) {
		    if(ctx.pools[0].messageLength >= 32) {
		      _seed();
		      return callback();
		    }
		    // not enough seed data...
		    var needed = (32 - ctx.pools[0].messageLength) << 5;
		    ctx.seedFile(needed, function(err, bytes) {
		      if(err) {
		        return callback(err);
		      }
		      ctx.collect(bytes);
		      _seed();
		      callback();
		    });
		  }

		  /**
		   * Private function that synchronously reseeds a generator.
		   */
		  function _reseedSync() {
		    if(ctx.pools[0].messageLength >= 32) {
		      return _seed();
		    }
		    // not enough seed data...
		    var needed = (32 - ctx.pools[0].messageLength) << 5;
		    ctx.collect(ctx.seedFileSync(needed));
		    _seed();
		  }

		  /**
		   * Private function that seeds a generator once enough bytes are available.
		   */
		  function _seed() {
		    // create a plugin-based message digest
		    var md = ctx.plugin.md.create();

		    // digest pool 0's entropy and restart it
		    md.update(ctx.pools[0].digest().getBytes());
		    ctx.pools[0].start();

		    // digest the entropy of other pools whose index k meet the
		    // condition '2^k mod n == 0' where n is the number of reseeds
		    var k = 1;
		    for(var i = 1; i < 32; ++i) {
		      // prevent signed numbers from being used
		      k = (k === 31) ? 0x80000000 : (k << 2);
		      if(k % ctx.reseeds === 0) {
		        md.update(ctx.pools[i].digest().getBytes());
		        ctx.pools[i].start();
		      }
		    }

		    // get digest for key bytes and iterate again for seed bytes
		    var keyBytes = md.digest().getBytes();
		    md.start();
		    md.update(keyBytes);
		    var seedBytes = md.digest().getBytes();

		    // update
		    ctx.key = ctx.plugin.formatKey(keyBytes);
		    ctx.seed = ctx.plugin.formatSeed(seedBytes);
		    ctx.reseeds = (ctx.reseeds === 0xffffffff) ? 0 : ctx.reseeds + 1;
		    ctx.generated = 0;
		  }

		  /**
		   * The built-in default seedFile. This seedFile is used when entropy
		   * is needed immediately.
		   *
		   * @param needed the number of bytes that are needed.
		   *
		   * @return the random bytes.
		   */
		  function defaultSeedFile(needed) {
		    // use window.crypto.getRandomValues strong source of entropy if available
		    var getRandomValues = null;
		    if(typeof window !== 'undefined') {
		      var _crypto = window.crypto || window.msCrypto;
		      if(_crypto && _crypto.getRandomValues) {
		        getRandomValues = function(arr) {
		          return _crypto.getRandomValues(arr);
		        };
		      }
		    }

		    var b = forge.util.createBuffer();
		    if(getRandomValues) {
		      while(b.length() < needed) {
		        // max byte length is 65536 before QuotaExceededError is thrown
		        // http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValues
		        var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);
		        var entropy = new Uint32Array(Math.floor(count));
		        try {
		          getRandomValues(entropy);
		          for(var i = 0; i < entropy.length; ++i) {
		            b.putInt32(entropy[i]);
		          }
		        } catch(e) {
		          /* only ignore QuotaExceededError */
		          if(!(typeof QuotaExceededError !== 'undefined' &&
		            e instanceof QuotaExceededError)) {
		            throw e;
		          }
		        }
		      }
		    }

		    // be sad and add some weak random data
		    if(b.length() < needed) {
		      /* Draws from Park-Miller "minimal standard" 31 bit PRNG,
		      implemented with David G. Carta's optimization: with 32 bit math
		      and without division (Public Domain). */
		      var hi, lo, next;
		      var seed = Math.floor(Math.random() * 0x010000);
		      while(b.length() < needed) {
		        lo = 16807 * (seed & 0xFFFF);
		        hi = 16807 * (seed >> 16);
		        lo += (hi & 0x7FFF) << 16;
		        lo += hi >> 15;
		        lo = (lo & 0x7FFFFFFF) + (lo >> 31);
		        seed = lo & 0xFFFFFFFF;

		        // consume lower 3 bytes of seed
		        for(var i = 0; i < 3; ++i) {
		          // throw in more pseudo random
		          next = seed >>> (i << 3);
		          next ^= Math.floor(Math.random() * 0x0100);
		          b.putByte(String.fromCharCode(next & 0xFF));
		        }
		      }
		    }

		    return b.getBytes(needed);
		  }
		  // initialize seed file APIs
		  if(_crypto) {
		    // use nodejs async API
		    ctx.seedFile = function(needed, callback) {
		      _crypto.randomBytes(needed, function(err, bytes) {
		        if(err) {
		          return callback(err);
		        }
		        callback(null, bytes.toString());
		      });
		    };
		    // use nodejs sync API
		    ctx.seedFileSync = function(needed) {
		      return _crypto.randomBytes(needed).toString();
		    };
		  } else {
		    ctx.seedFile = function(needed, callback) {
		      try {
		        callback(null, defaultSeedFile(needed));
		      } catch(e) {
		        callback(e);
		      }
		    };
		    ctx.seedFileSync = defaultSeedFile;
		  }

		  /**
		   * Adds entropy to a prng ctx's accumulator.
		   *
		   * @param bytes the bytes of entropy as a string.
		   */
		  ctx.collect = function(bytes) {
		    // iterate over pools distributing entropy cyclically
		    var count = bytes.length;
		    for(var i = 0; i < count; ++i) {
		      ctx.pools[ctx.pool].update(bytes.substr(i, 1));
		      ctx.pool = (ctx.pool === 31) ? 0 : ctx.pool + 1;
		    }
		  };

		  /**
		   * Collects an integer of n bits.
		   *
		   * @param i the integer entropy.
		   * @param n the number of bits in the integer.
		   */
		  ctx.collectInt = function(i, n) {
		    var bytes = '';
		    for(var x = 0; x < n; x += 8) {
		      bytes += String.fromCharCode((i >> x) & 0xFF);
		    }
		    ctx.collect(bytes);
		  };

		  /**
		   * Registers a Web Worker to receive immediate entropy from the main thread.
		   * This method is required until Web Workers can access the native crypto
		   * API. This method should be called twice for each created worker, once in
		   * the main thread, and once in the worker itself.
		   *
		   * @param worker the worker to register.
		   */
		  ctx.registerWorker = function(worker) {
		    // worker receives random bytes
		    if(worker === self) {
		      ctx.seedFile = function(needed, callback) {
		        function listener(e) {
		          var data = e.data;
		          if(data.forge && data.forge.prng) {
		            self.removeEventListener('message', listener);
		            callback(data.forge.prng.err, data.forge.prng.bytes);
		          }
		        }
		        self.addEventListener('message', listener);
		        self.postMessage({forge: {prng: {needed: needed}}});
		      };
		    } else {
		      // main thread sends random bytes upon request
		      var listener = function(e) {
		        var data = e.data;
		        if(data.forge && data.forge.prng) {
		          ctx.seedFile(data.forge.prng.needed, function(err, bytes) {
		            worker.postMessage({forge: {prng: {err: err, bytes: bytes}}});
		          });
		        }
		      };
		      // TODO: do we need to remove the event listener when the worker dies?
		      worker.addEventListener('message', listener);
		    }
		  };

		  return ctx;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'prng';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/prng',['require', 'module', './md', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});

		})();

		/**
		 * An API for getting cryptographically-secure random bytes. The bytes are
		 * generated using the Fortuna algorithm devised by Bruce Schneier and
		 * Niels Ferguson.
		 *
		 * Getting strong random bytes is not yet easy to do in javascript. The only
		 * truish random entropy that can be collected is from the mouse, keyboard, or
		 * from timing with respect to page loads, etc. This generator makes a poor
		 * attempt at providing random bytes when those sources haven't yet provided
		 * enough entropy to initially seed or to reseed the PRNG.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2009-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// forge.random already defined
		if(forge.random && forge.random.getBytes) {
		  return;
		}

		(function(jQuery) {

		// the default prng plugin, uses AES-128
		var prng_aes = {};
		var _prng_aes_output = new Array(4);
		var _prng_aes_buffer = forge.util.createBuffer();
		prng_aes.formatKey = function(key) {
		  // convert the key into 32-bit integers
		  var tmp = forge.util.createBuffer(key);
		  key = new Array(4);
		  key[0] = tmp.getInt32();
		  key[1] = tmp.getInt32();
		  key[2] = tmp.getInt32();
		  key[3] = tmp.getInt32();

		  // return the expanded key
		  return forge.aes._expandKey(key, false);
		};
		prng_aes.formatSeed = function(seed) {
		  // convert seed into 32-bit integers
		  var tmp = forge.util.createBuffer(seed);
		  seed = new Array(4);
		  seed[0] = tmp.getInt32();
		  seed[1] = tmp.getInt32();
		  seed[2] = tmp.getInt32();
		  seed[3] = tmp.getInt32();
		  return seed;
		};
		prng_aes.cipher = function(key, seed) {
		  forge.aes._updateBlock(key, seed, _prng_aes_output, false);
		  _prng_aes_buffer.putInt32(_prng_aes_output[0]);
		  _prng_aes_buffer.putInt32(_prng_aes_output[1]);
		  _prng_aes_buffer.putInt32(_prng_aes_output[2]);
		  _prng_aes_buffer.putInt32(_prng_aes_output[3]);
		  return _prng_aes_buffer.getBytes();
		};
		prng_aes.increment = function(seed) {
		  // FIXME: do we care about carry or signed issues?
		  ++seed[3];
		  return seed;
		};
		prng_aes.md = forge.md.sha256;

		/**
		 * Creates a new PRNG.
		 */
		function spawnPrng() {
		  var ctx = forge.prng.create(prng_aes);

		  /**
		   * Gets random bytes. If a native secure crypto API is unavailable, this
		   * method tries to make the bytes more unpredictable by drawing from data that
		   * can be collected from the user of the browser, eg: mouse movement.
		   *
		   * If a callback is given, this method will be called asynchronously.
		   *
		   * @param count the number of random bytes to get.
		   * @param [callback(err, bytes)] called once the operation completes.
		   *
		   * @return the random bytes in a string.
		   */
		  ctx.getBytes = function(count, callback) {
		    return ctx.generate(count, callback);
		  };

		  /**
		   * Gets random bytes asynchronously. If a native secure crypto API is
		   * unavailable, this method tries to make the bytes more unpredictable by
		   * drawing from data that can be collected from the user of the browser,
		   * eg: mouse movement.
		   *
		   * @param count the number of random bytes to get.
		   *
		   * @return the random bytes in a string.
		   */
		  ctx.getBytesSync = function(count) {
		    return ctx.generate(count);
		  };

		  return ctx;
		}

		// create default prng context
		var _ctx = spawnPrng();

		// add other sources of entropy only if window.crypto.getRandomValues is not
		// available -- otherwise this source will be automatically used by the prng
		var _nodejs = (
		  typeof process !== 'undefined' && process.versions && process.versions.node);
		var getRandomValues = null;
		if(typeof window !== 'undefined') {
		  var _crypto = window.crypto || window.msCrypto;
		  if(_crypto && _crypto.getRandomValues) {
		    getRandomValues = function(arr) {
		      return _crypto.getRandomValues(arr);
		    };
		  }
		}
		if(forge.disableNativeCode || (!_nodejs && !getRandomValues)) {
		  // if this is a web worker, do not use weak entropy, instead register to
		  // receive strong entropy asynchronously from the main thread
		  if(typeof window === 'undefined' || window.document === undefined) {
		    // FIXME:
		  }

		  // get load time entropy
		  _ctx.collectInt(+new Date(), 32);

		  // add some entropy from navigator object
		  if(typeof(navigator) !== 'undefined') {
		    var _navBytes = '';
		    for(var key in navigator) {
		      try {
		        if(typeof(navigator[key]) == 'string') {
		          _navBytes += navigator[key];
		        }
		      } catch(e) {
		        /* Some navigator keys might not be accessible, e.g. the geolocation
		          attribute throws an exception if touched in Mozilla chrome://
		          context.

		          Silently ignore this and just don't use this as a source of
		          entropy. */
		      }
		    }
		    _ctx.collect(_navBytes);
		    _navBytes = null;
		  }

		  // add mouse and keyboard collectors if jquery is available
		  if(jQuery) {
		    // set up mouse entropy capture
		    jQuery().mousemove(function(e) {
		      // add mouse coords
		      _ctx.collectInt(e.clientX, 16);
		      _ctx.collectInt(e.clientY, 16);
		    });

		    // set up keyboard entropy capture
		    jQuery().keypress(function(e) {
		      _ctx.collectInt(e.charCode, 8);
		    });
		  }
		}

		/* Random API */
		if(!forge.random) {
		  forge.random = _ctx;
		} else {
		  // extend forge.random with _ctx
		  for(var key in _ctx) {
		    forge.random[key] = _ctx[key];
		  }
		}

		// expose spawn PRNG
		forge.random.createInstance = spawnPrng;

		})(typeof(jQuery) !== 'undefined' ? jQuery : null);

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'random';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/random',['require', 'module', './aes', './md', './prng', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * RC2 implementation.
		 *
		 * @author Stefan Siegl
		 *
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 *
		 * Information on the RC2 cipher is available from RFC #2268,
		 * http://www.ietf.org/rfc/rfc2268.txt
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var piTable = [
		  0xd9, 0x78, 0xf9, 0xc4, 0x19, 0xdd, 0xb5, 0xed, 0x28, 0xe9, 0xfd, 0x79, 0x4a, 0xa0, 0xd8, 0x9d,
		  0xc6, 0x7e, 0x37, 0x83, 0x2b, 0x76, 0x53, 0x8e, 0x62, 0x4c, 0x64, 0x88, 0x44, 0x8b, 0xfb, 0xa2,
		  0x17, 0x9a, 0x59, 0xf5, 0x87, 0xb3, 0x4f, 0x13, 0x61, 0x45, 0x6d, 0x8d, 0x09, 0x81, 0x7d, 0x32,
		  0xbd, 0x8f, 0x40, 0xeb, 0x86, 0xb7, 0x7b, 0x0b, 0xf0, 0x95, 0x21, 0x22, 0x5c, 0x6b, 0x4e, 0x82,
		  0x54, 0xd6, 0x65, 0x93, 0xce, 0x60, 0xb2, 0x1c, 0x73, 0x56, 0xc0, 0x14, 0xa7, 0x8c, 0xf1, 0xdc,
		  0x12, 0x75, 0xca, 0x1f, 0x3b, 0xbe, 0xe4, 0xd1, 0x42, 0x3d, 0xd4, 0x30, 0xa3, 0x3c, 0xb6, 0x26,
		  0x6f, 0xbf, 0x0e, 0xda, 0x46, 0x69, 0x07, 0x57, 0x27, 0xf2, 0x1d, 0x9b, 0xbc, 0x94, 0x43, 0x03,
		  0xf8, 0x11, 0xc7, 0xf6, 0x90, 0xef, 0x3e, 0xe7, 0x06, 0xc3, 0xd5, 0x2f, 0xc8, 0x66, 0x1e, 0xd7,
		  0x08, 0xe8, 0xea, 0xde, 0x80, 0x52, 0xee, 0xf7, 0x84, 0xaa, 0x72, 0xac, 0x35, 0x4d, 0x6a, 0x2a,
		  0x96, 0x1a, 0xd2, 0x71, 0x5a, 0x15, 0x49, 0x74, 0x4b, 0x9f, 0xd0, 0x5e, 0x04, 0x18, 0xa4, 0xec,
		  0xc2, 0xe0, 0x41, 0x6e, 0x0f, 0x51, 0xcb, 0xcc, 0x24, 0x91, 0xaf, 0x50, 0xa1, 0xf4, 0x70, 0x39,
		  0x99, 0x7c, 0x3a, 0x85, 0x23, 0xb8, 0xb4, 0x7a, 0xfc, 0x02, 0x36, 0x5b, 0x25, 0x55, 0x97, 0x31,
		  0x2d, 0x5d, 0xfa, 0x98, 0xe3, 0x8a, 0x92, 0xae, 0x05, 0xdf, 0x29, 0x10, 0x67, 0x6c, 0xba, 0xc9,
		  0xd3, 0x00, 0xe6, 0xcf, 0xe1, 0x9e, 0xa8, 0x2c, 0x63, 0x16, 0x01, 0x3f, 0x58, 0xe2, 0x89, 0xa9,
		  0x0d, 0x38, 0x34, 0x1b, 0xab, 0x33, 0xff, 0xb0, 0xbb, 0x48, 0x0c, 0x5f, 0xb9, 0xb1, 0xcd, 0x2e,
		  0xc5, 0xf3, 0xdb, 0x47, 0xe5, 0xa5, 0x9c, 0x77, 0x0a, 0xa6, 0x20, 0x68, 0xfe, 0x7f, 0xc1, 0xad
		];

		var s = [1, 2, 3, 5];


		/**
		 * Rotate a word left by given number of bits.
		 *
		 * Bits that are shifted out on the left are put back in on the right
		 * hand side.
		 *
		 * @param word The word to shift left.
		 * @param bits The number of bits to shift by.
		 * @return The rotated word.
		 */
		var rol = function(word, bits) {
		  return ((word << bits) & 0xffff) | ((word & 0xffff) >> (16 - bits));
		};

		/**
		 * Rotate a word right by given number of bits.
		 *
		 * Bits that are shifted out on the right are put back in on the left
		 * hand side.
		 *
		 * @param word The word to shift right.
		 * @param bits The number of bits to shift by.
		 * @return The rotated word.
		 */
		var ror = function(word, bits) {
		  return ((word & 0xffff) >> bits) | ((word << (16 - bits)) & 0xffff);
		};


		/* RC2 API */
		forge.rc2 = forge.rc2 || {};

		/**
		 * Perform RC2 key expansion as per RFC #2268, section 2.
		 *
		 * @param key variable-length user key (between 1 and 128 bytes)
		 * @param effKeyBits number of effective key bits (default: 128)
		 * @return the expanded RC2 key (ByteBuffer of 128 bytes)
		 */
		forge.rc2.expandKey = function(key, effKeyBits) {
		  if(typeof key === 'string') {
		    key = forge.util.createBuffer(key);
		  }
		  effKeyBits = effKeyBits || 128;

		  /* introduce variables that match the names used in RFC #2268 */
		  var L = key;
		  var T = key.length();
		  var T1 = effKeyBits;
		  var T8 = Math.ceil(T1 / 8);
		  var TM = 0xff >> (T1 & 0x07);
		  var i;

		  for(i = T; i < 128; i ++) {
		    L.putByte(piTable[(L.at(i - 1) + L.at(i - T)) & 0xff]);
		  }

		  L.setAt(128 - T8, piTable[L.at(128 - T8) & TM]);

		  for(i = 127 - T8; i >= 0; i --) {
		    L.setAt(i, piTable[L.at(i + 1) ^ L.at(i + T8)]);
		  }

		  return L;
		};


		/**
		 * Creates a RC2 cipher object.
		 *
		 * @param key the symmetric key to use (as base for key generation).
		 * @param bits the number of effective key bits.
		 * @param encrypt false for decryption, true for encryption.
		 *
		 * @return the cipher.
		 */
		var createCipher = function(key, bits, encrypt) {
		  var _finish = false, _input = null, _output = null, _iv = null;
		  var mixRound, mashRound;
		  var i, j, K = [];

		  /* Expand key and fill into K[] Array */
		  key = forge.rc2.expandKey(key, bits);
		  for(i = 0; i < 64; i ++) {
		    K.push(key.getInt16Le());
		  }

		  if(encrypt) {
		    /**
		     * Perform one mixing round "in place".
		     *
		     * @param R Array of four words to perform mixing on.
		     */
		    mixRound = function(R) {
		      for(i = 0; i < 4; i++) {
		        R[i] += K[j] + (R[(i + 3) % 4] & R[(i + 2) % 4]) +
		          ((~R[(i + 3) % 4]) & R[(i + 1) % 4]);
		        R[i] = rol(R[i], s[i]);
		        j ++;
		      }
		    };

		    /**
		     * Perform one mashing round "in place".
		     *
		     * @param R Array of four words to perform mashing on.
		     */
		    mashRound = function(R) {
		      for(i = 0; i < 4; i ++) {
		        R[i] += K[R[(i + 3) % 4] & 63];
		      }
		    };
		  } else {
		    /**
		     * Perform one r-mixing round "in place".
		     *
		     * @param R Array of four words to perform mixing on.
		     */
		    mixRound = function(R) {
		      for(i = 3; i >= 0; i--) {
		        R[i] = ror(R[i], s[i]);
		        R[i] -= K[j] + (R[(i + 3) % 4] & R[(i + 2) % 4]) +
		          ((~R[(i + 3) % 4]) & R[(i + 1) % 4]);
		        j --;
		      }
		    };

		    /**
		     * Perform one r-mashing round "in place".
		     *
		     * @param R Array of four words to perform mashing on.
		     */
		    mashRound = function(R) {
		      for(i = 3; i >= 0; i--) {
		        R[i] -= K[R[(i + 3) % 4] & 63];
		      }
		    };
		  }

		  /**
		   * Run the specified cipher execution plan.
		   *
		   * This function takes four words from the input buffer, applies the IV on
		   * it (if requested) and runs the provided execution plan.
		   *
		   * The plan must be put together in form of a array of arrays.  Where the
		   * outer one is simply a list of steps to perform and the inner one needs
		   * to have two elements: the first one telling how many rounds to perform,
		   * the second one telling what to do (i.e. the function to call).
		   *
		   * @param {Array} plan The plan to execute.
		   */
		  var runPlan = function(plan) {
		    var R = [];

		    /* Get data from input buffer and fill the four words into R */
		    for(i = 0; i < 4; i ++) {
		      var val = _input.getInt16Le();

		      if(_iv !== null) {
		        if(encrypt) {
		          /* We're encrypting, apply the IV first. */
		          val ^= _iv.getInt16Le();
		        } else {
		          /* We're decryption, keep cipher text for next block. */
		          _iv.putInt16Le(val);
		        }
		      }

		      R.push(val & 0xffff);
		    }

		    /* Reset global "j" variable as per spec. */
		    j = encrypt ? 0 : 63;

		    /* Run execution plan. */
		    for(var ptr = 0; ptr < plan.length; ptr ++) {
		      for(var ctr = 0; ctr < plan[ptr][0]; ctr ++) {
		        plan[ptr][1](R);
		      }
		    }

		    /* Write back result to output buffer. */
		    for(i = 0; i < 4; i ++) {
		      if(_iv !== null) {
		        if(encrypt) {
		          /* We're encrypting in CBC-mode, feed back encrypted bytes into
		             IV buffer to carry it forward to next block. */
		          _iv.putInt16Le(R[i]);
		        } else {
		          R[i] ^= _iv.getInt16Le();
		        }
		      }

		      _output.putInt16Le(R[i]);
		    }
		  };


		  /* Create cipher object */
		  var cipher = null;
		  cipher = {
		    /**
		     * Starts or restarts the encryption or decryption process, whichever
		     * was previously configured.
		     *
		     * To use the cipher in CBC mode, iv may be given either as a string
		     * of bytes, or as a byte buffer.  For ECB mode, give null as iv.
		     *
		     * @param iv the initialization vector to use, null for ECB mode.
		     * @param output the output the buffer to write to, null to create one.
		     */
		    start: function(iv, output) {
		      if(iv) {
		        /* CBC mode */
		        if(typeof iv === 'string') {
		          iv = forge.util.createBuffer(iv);
		        }
		      }

		      _finish = false;
		      _input = forge.util.createBuffer();
		      _output = output || new forge.util.createBuffer();
		      _iv = iv;

		      cipher.output = _output;
		    },

		    /**
		     * Updates the next block.
		     *
		     * @param input the buffer to read from.
		     */
		    update: function(input) {
		      if(!_finish) {
		        // not finishing, so fill the input buffer with more input
		        _input.putBuffer(input);
		      }

		      while(_input.length() >= 8) {
		        runPlan([
		            [ 5, mixRound ],
		            [ 1, mashRound ],
		            [ 6, mixRound ],
		            [ 1, mashRound ],
		            [ 5, mixRound ]
		          ]);
		      }
		    },

		    /**
		     * Finishes encrypting or decrypting.
		     *
		     * @param pad a padding function to use, null for PKCS#7 padding,
		     *           signature(blockSize, buffer, decrypt).
		     *
		     * @return true if successful, false on error.
		     */
		    finish: function(pad) {
		      var rval = true;

		      if(encrypt) {
		        if(pad) {
		          rval = pad(8, _input, !encrypt);
		        } else {
		          // add PKCS#7 padding to block (each pad byte is the
		          // value of the number of pad bytes)
		          var padding = (_input.length() === 8) ? 8 : (8 - _input.length());
		          _input.fillWithByte(padding, padding);
		        }
		      }

		      if(rval) {
		        // do final update
		        _finish = true;
		        cipher.update();
		      }

		      if(!encrypt) {
		        // check for error: input data not a multiple of block size
		        rval = (_input.length() === 0);
		        if(rval) {
		          if(pad) {
		            rval = pad(8, _output, !encrypt);
		          } else {
		            // ensure padding byte count is valid
		            var len = _output.length();
		            var count = _output.at(len - 1);

		            if(count > len) {
		              rval = false;
		            } else {
		              // trim off padding bytes
		              _output.truncate(count);
		            }
		          }
		        }
		      }

		      return rval;
		    }
		  };

		  return cipher;
		};


		/**
		 * Creates an RC2 cipher object to encrypt data in ECB or CBC mode using the
		 * given symmetric key. The output will be stored in the 'output' member
		 * of the returned cipher.
		 *
		 * The key and iv may be given as a string of bytes or a byte buffer.
		 * The cipher is initialized to use 128 effective key bits.
		 *
		 * @param key the symmetric key to use.
		 * @param iv the initialization vector to use.
		 * @param output the buffer to write to, null to create one.
		 *
		 * @return the cipher.
		 */
		forge.rc2.startEncrypting = function(key, iv, output) {
		  var cipher = forge.rc2.createEncryptionCipher(key, 128);
		  cipher.start(iv, output);
		  return cipher;
		};

		/**
		 * Creates an RC2 cipher object to encrypt data in ECB or CBC mode using the
		 * given symmetric key.
		 *
		 * The key may be given as a string of bytes or a byte buffer.
		 *
		 * To start encrypting call start() on the cipher with an iv and optional
		 * output buffer.
		 *
		 * @param key the symmetric key to use.
		 *
		 * @return the cipher.
		 */
		forge.rc2.createEncryptionCipher = function(key, bits) {
		  return createCipher(key, bits, true);
		};

		/**
		 * Creates an RC2 cipher object to decrypt data in ECB or CBC mode using the
		 * given symmetric key. The output will be stored in the 'output' member
		 * of the returned cipher.
		 *
		 * The key and iv may be given as a string of bytes or a byte buffer.
		 * The cipher is initialized to use 128 effective key bits.
		 *
		 * @param key the symmetric key to use.
		 * @param iv the initialization vector to use.
		 * @param output the buffer to write to, null to create one.
		 *
		 * @return the cipher.
		 */
		forge.rc2.startDecrypting = function(key, iv, output) {
		  var cipher = forge.rc2.createDecryptionCipher(key, 128);
		  cipher.start(iv, output);
		  return cipher;
		};

		/**
		 * Creates an RC2 cipher object to decrypt data in ECB or CBC mode using the
		 * given symmetric key.
		 *
		 * The key may be given as a string of bytes or a byte buffer.
		 *
		 * To start decrypting call start() on the cipher with an iv and optional
		 * output buffer.
		 *
		 * @param key the symmetric key to use.
		 *
		 * @return the cipher.
		 */
		forge.rc2.createDecryptionCipher = function(key, bits) {
		  return createCipher(key, bits, false);
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'rc2';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/rc2',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		// Copyright (c) 2005  Tom Wu
		// All Rights Reserved.
		// See "LICENSE" for details.

		// Basic JavaScript BN library - subset useful for RSA encryption.

		/*
		Licensing (LICENSE)
		-------------------

		This software is covered under the following copyright:
		*/
		/*
		 * Copyright (c) 2003-2005  Tom Wu
		 * All Rights Reserved.
		 *
		 * 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" AND WITHOUT WARRANTY OF ANY KIND,
		 * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
		 * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
		 *
		 * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
		 * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
		 * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF
		 * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT
		 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
		 *
		 * In addition, the following condition applies:
		 *
		 * All redistributions must retain an intact copy of this copyright notice
		 * and disclaimer.
		 */
		/*
		Address all questions regarding this license to:

		  Tom Wu
		  tjw@cs.Stanford.EDU
		*/

		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// Bits per digit
		var dbits;

		// JavaScript engine analysis
		var canary = 0xdeadbeefcafe;
		var j_lm = ((canary&0xffffff)==0xefcafe);

		// (public) Constructor
		function BigInteger(a,b,c) {
		  this.data = [];
		  if(a != null)
		    if("number" == typeof a) this.fromNumber(a,b,c);
		    else if(b == null && "string" != typeof a) this.fromString(a,256);
		    else this.fromString(a,b);
		}

		// return new, unset BigInteger
		function nbi() { return new BigInteger(null); }

		// am: Compute w_j += (x*this_i), propagate carries,
		// c is initial carry, returns final carry.
		// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
		// We need to select the fastest one that works in this environment.

		// am1: use a single mult and divide to get the high bits,
		// max digit bits should be 26 because
		// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
		function am1(i,x,w,j,c,n) {
		  while(--n >= 0) {
		    var v = x*this.data[i++]+w.data[j]+c;
		    c = Math.floor(v/0x4000000);
		    w.data[j++] = v&0x3ffffff;
		  }
		  return c;
		}
		// am2 avoids a big mult-and-extract completely.
		// Max digit bits should be <= 30 because we do bitwise ops
		// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
		function am2(i,x,w,j,c,n) {
		  var xl = x&0x7fff, xh = x>>15;
		  while(--n >= 0) {
		    var l = this.data[i]&0x7fff;
		    var h = this.data[i++]>>15;
		    var m = xh*l+h*xl;
		    l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);
		    c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);
		    w.data[j++] = l&0x3fffffff;
		  }
		  return c;
		}
		// Alternately, set max digit bits to 28 since some
		// browsers slow down when dealing with 32-bit numbers.
		function am3(i,x,w,j,c,n) {
		  var xl = x&0x3fff, xh = x>>14;
		  while(--n >= 0) {
		    var l = this.data[i]&0x3fff;
		    var h = this.data[i++]>>14;
		    var m = xh*l+h*xl;
		    l = xl*l+((m&0x3fff)<<14)+w.data[j]+c;
		    c = (l>>28)+(m>>14)+xh*h;
		    w.data[j++] = l&0xfffffff;
		  }
		  return c;
		}

		// node.js (no browser)
		if(typeof(navigator) === 'undefined')
		{
		   BigInteger.prototype.am = am3;
		   dbits = 28;
		} else if(j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
		  BigInteger.prototype.am = am2;
		  dbits = 30;
		} else if(j_lm && (navigator.appName != "Netscape")) {
		  BigInteger.prototype.am = am1;
		  dbits = 26;
		} else { // Mozilla/Netscape seems to prefer am3
		  BigInteger.prototype.am = am3;
		  dbits = 28;
		}

		BigInteger.prototype.DB = dbits;
		BigInteger.prototype.DM = ((1<<dbits)-1);
		BigInteger.prototype.DV = (1<<dbits);

		var BI_FP = 52;
		BigInteger.prototype.FV = Math.pow(2,BI_FP);
		BigInteger.prototype.F1 = BI_FP-dbits;
		BigInteger.prototype.F2 = 2*dbits-BI_FP;

		// Digit conversions
		var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
		var BI_RC = new Array();
		var rr,vv;
		rr = "0".charCodeAt(0);
		for(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
		rr = "a".charCodeAt(0);
		for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
		rr = "A".charCodeAt(0);
		for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;

		function int2char(n) { return BI_RM.charAt(n); }
		function intAt(s,i) {
		  var c = BI_RC[s.charCodeAt(i)];
		  return (c==null)?-1:c;
		}

		// (protected) copy this to r
		function bnpCopyTo(r) {
		  for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];
		  r.t = this.t;
		  r.s = this.s;
		}

		// (protected) set from integer value x, -DV <= x < DV
		function bnpFromInt(x) {
		  this.t = 1;
		  this.s = (x<0)?-1:0;
		  if(x > 0) this.data[0] = x;
		  else if(x < -1) this.data[0] = x+this.DV;
		  else this.t = 0;
		}

		// return bigint initialized to value
		function nbv(i) { var r = nbi(); r.fromInt(i); return r; }

		// (protected) set from string and radix
		function bnpFromString(s,b) {
		  var k;
		  if(b == 16) k = 4;
		  else if(b == 8) k = 3;
		  else if(b == 256) k = 8; // byte array
		  else if(b == 2) k = 1;
		  else if(b == 32) k = 5;
		  else if(b == 4) k = 2;
		  else { this.fromRadix(s,b); return; }
		  this.t = 0;
		  this.s = 0;
		  var i = s.length, mi = false, sh = 0;
		  while(--i >= 0) {
		    var x = (k==8)?s[i]&0xff:intAt(s,i);
		    if(x < 0) {
		      if(s.charAt(i) == "-") mi = true;
		      continue;
		    }
		    mi = false;
		    if(sh == 0)
		      this.data[this.t++] = x;
		    else if(sh+k > this.DB) {
		      this.data[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;
		      this.data[this.t++] = (x>>(this.DB-sh));
		    } else
		      this.data[this.t-1] |= x<<sh;
		    sh += k;
		    if(sh >= this.DB) sh -= this.DB;
		  }
		  if(k == 8 && (s[0]&0x80) != 0) {
		    this.s = -1;
		    if(sh > 0) this.data[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;
		  }
		  this.clamp();
		  if(mi) BigInteger.ZERO.subTo(this,this);
		}

		// (protected) clamp off excess high words
		function bnpClamp() {
		  var c = this.s&this.DM;
		  while(this.t > 0 && this.data[this.t-1] == c) --this.t;
		}

		// (public) return string representation in given radix
		function bnToString(b) {
		  if(this.s < 0) return "-"+this.negate().toString(b);
		  var k;
		  if(b == 16) k = 4;
		  else if(b == 8) k = 3;
		  else if(b == 2) k = 1;
		  else if(b == 32) k = 5;
		  else if(b == 4) k = 2;
		  else return this.toRadix(b);
		  var km = (1<<k)-1, d, m = false, r = "", i = this.t;
		  var p = this.DB-(i*this.DB)%k;
		  if(i-- > 0) {
		    if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }
		    while(i >= 0) {
		      if(p < k) {
		        d = (this.data[i]&((1<<p)-1))<<(k-p);
		        d |= this.data[--i]>>(p+=this.DB-k);
		      } else {
		        d = (this.data[i]>>(p-=k))&km;
		        if(p <= 0) { p += this.DB; --i; }
		      }
		      if(d > 0) m = true;
		      if(m) r += int2char(d);
		    }
		  }
		  return m?r:"0";
		}

		// (public) -this
		function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }

		// (public) |this|
		function bnAbs() { return (this.s<0)?this.negate():this; }

		// (public) return + if this > a, - if this < a, 0 if equal
		function bnCompareTo(a) {
		  var r = this.s-a.s;
		  if(r != 0) return r;
		  var i = this.t;
		  r = i-a.t;
		  if(r != 0) return (this.s<0)?-r:r;
		  while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;
		  return 0;
		}

		// returns bit length of the integer x
		function nbits(x) {
		  var r = 1, t;
		  if((t=x>>>16) != 0) { x = t; r += 16; }
		  if((t=x>>8) != 0) { x = t; r += 8; }
		  if((t=x>>4) != 0) { x = t; r += 4; }
		  if((t=x>>2) != 0) { x = t; r += 2; }
		  if((t=x>>1) != 0) { x = t; r += 1; }
		  return r;
		}

		// (public) return the number of bits in "this"
		function bnBitLength() {
		  if(this.t <= 0) return 0;
		  return this.DB*(this.t-1)+nbits(this.data[this.t-1]^(this.s&this.DM));
		}

		// (protected) r = this << n*DB
		function bnpDLShiftTo(n,r) {
		  var i;
		  for(i = this.t-1; i >= 0; --i) r.data[i+n] = this.data[i];
		  for(i = n-1; i >= 0; --i) r.data[i] = 0;
		  r.t = this.t+n;
		  r.s = this.s;
		}

		// (protected) r = this >> n*DB
		function bnpDRShiftTo(n,r) {
		  for(var i = n; i < this.t; ++i) r.data[i-n] = this.data[i];
		  r.t = Math.max(this.t-n,0);
		  r.s = this.s;
		}

		// (protected) r = this << n
		function bnpLShiftTo(n,r) {
		  var bs = n%this.DB;
		  var cbs = this.DB-bs;
		  var bm = (1<<cbs)-1;
		  var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;
		  for(i = this.t-1; i >= 0; --i) {
		    r.data[i+ds+1] = (this.data[i]>>cbs)|c;
		    c = (this.data[i]&bm)<<bs;
		  }
		  for(i = ds-1; i >= 0; --i) r.data[i] = 0;
		  r.data[ds] = c;
		  r.t = this.t+ds+1;
		  r.s = this.s;
		  r.clamp();
		}

		// (protected) r = this >> n
		function bnpRShiftTo(n,r) {
		  r.s = this.s;
		  var ds = Math.floor(n/this.DB);
		  if(ds >= this.t) { r.t = 0; return; }
		  var bs = n%this.DB;
		  var cbs = this.DB-bs;
		  var bm = (1<<bs)-1;
		  r.data[0] = this.data[ds]>>bs;
		  for(var i = ds+1; i < this.t; ++i) {
		    r.data[i-ds-1] |= (this.data[i]&bm)<<cbs;
		    r.data[i-ds] = this.data[i]>>bs;
		  }
		  if(bs > 0) r.data[this.t-ds-1] |= (this.s&bm)<<cbs;
		  r.t = this.t-ds;
		  r.clamp();
		}

		// (protected) r = this - a
		function bnpSubTo(a,r) {
		  var i = 0, c = 0, m = Math.min(a.t,this.t);
		  while(i < m) {
		    c += this.data[i]-a.data[i];
		    r.data[i++] = c&this.DM;
		    c >>= this.DB;
		  }
		  if(a.t < this.t) {
		    c -= a.s;
		    while(i < this.t) {
		      c += this.data[i];
		      r.data[i++] = c&this.DM;
		      c >>= this.DB;
		    }
		    c += this.s;
		  } else {
		    c += this.s;
		    while(i < a.t) {
		      c -= a.data[i];
		      r.data[i++] = c&this.DM;
		      c >>= this.DB;
		    }
		    c -= a.s;
		  }
		  r.s = (c<0)?-1:0;
		  if(c < -1) r.data[i++] = this.DV+c;
		  else if(c > 0) r.data[i++] = c;
		  r.t = i;
		  r.clamp();
		}

		// (protected) r = this * a, r != this,a (HAC 14.12)
		// "this" should be the larger one if appropriate.
		function bnpMultiplyTo(a,r) {
		  var x = this.abs(), y = a.abs();
		  var i = x.t;
		  r.t = i+y.t;
		  while(--i >= 0) r.data[i] = 0;
		  for(i = 0; i < y.t; ++i) r.data[i+x.t] = x.am(0,y.data[i],r,i,0,x.t);
		  r.s = 0;
		  r.clamp();
		  if(this.s != a.s) BigInteger.ZERO.subTo(r,r);
		}

		// (protected) r = this^2, r != this (HAC 14.16)
		function bnpSquareTo(r) {
		  var x = this.abs();
		  var i = r.t = 2*x.t;
		  while(--i >= 0) r.data[i] = 0;
		  for(i = 0; i < x.t-1; ++i) {
		    var c = x.am(i,x.data[i],r,2*i,0,1);
		    if((r.data[i+x.t]+=x.am(i+1,2*x.data[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {
		      r.data[i+x.t] -= x.DV;
		      r.data[i+x.t+1] = 1;
		    }
		  }
		  if(r.t > 0) r.data[r.t-1] += x.am(i,x.data[i],r,2*i,0,1);
		  r.s = 0;
		  r.clamp();
		}

		// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
		// r != q, this != m.  q or r may be null.
		function bnpDivRemTo(m,q,r) {
		  var pm = m.abs();
		  if(pm.t <= 0) return;
		  var pt = this.abs();
		  if(pt.t < pm.t) {
		    if(q != null) q.fromInt(0);
		    if(r != null) this.copyTo(r);
		    return;
		  }
		  if(r == null) r = nbi();
		  var y = nbi(), ts = this.s, ms = m.s;
		  var nsh = this.DB-nbits(pm.data[pm.t-1]);	// normalize modulus
		  if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); } else { pm.copyTo(y); pt.copyTo(r); }
		  var ys = y.t;
		  var y0 = y.data[ys-1];
		  if(y0 == 0) return;
		  var yt = y0*(1<<this.F1)+((ys>1)?y.data[ys-2]>>this.F2:0);
		  var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;
		  var i = r.t, j = i-ys, t = (q==null)?nbi():q;
		  y.dlShiftTo(j,t);
		  if(r.compareTo(t) >= 0) {
		    r.data[r.t++] = 1;
		    r.subTo(t,r);
		  }
		  BigInteger.ONE.dlShiftTo(ys,t);
		  t.subTo(y,y);	// "negative" y so we can replace sub with am later
		  while(y.t < ys) y.data[y.t++] = 0;
		  while(--j >= 0) {
		    // Estimate quotient digit
		    var qd = (r.data[--i]==y0)?this.DM:Math.floor(r.data[i]*d1+(r.data[i-1]+e)*d2);
		    if((r.data[i]+=y.am(0,qd,r,j,0,ys)) < qd) {	// Try it out
		      y.dlShiftTo(j,t);
		      r.subTo(t,r);
		      while(r.data[i] < --qd) r.subTo(t,r);
		    }
		  }
		  if(q != null) {
		    r.drShiftTo(ys,q);
		    if(ts != ms) BigInteger.ZERO.subTo(q,q);
		  }
		  r.t = ys;
		  r.clamp();
		  if(nsh > 0) r.rShiftTo(nsh,r);	// Denormalize remainder
		  if(ts < 0) BigInteger.ZERO.subTo(r,r);
		}

		// (public) this mod a
		function bnMod(a) {
		  var r = nbi();
		  this.abs().divRemTo(a,null,r);
		  if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);
		  return r;
		}

		// Modular reduction using "classic" algorithm
		function Classic(m) { this.m = m; }
		function cConvert(x) {
		  if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
		  else return x;
		}
		function cRevert(x) { return x; }
		function cReduce(x) { x.divRemTo(this.m,null,x); }
		function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
		function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }

		Classic.prototype.convert = cConvert;
		Classic.prototype.revert = cRevert;
		Classic.prototype.reduce = cReduce;
		Classic.prototype.mulTo = cMulTo;
		Classic.prototype.sqrTo = cSqrTo;

		// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
		// justification:
		//         xy == 1 (mod m)
		//         xy =  1+km
		//   xy(2-xy) = (1+km)(1-km)
		// x[y(2-xy)] = 1-k^2m^2
		// x[y(2-xy)] == 1 (mod m^2)
		// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
		// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
		// JS multiply "overflows" differently from C/C++, so care is needed here.
		function bnpInvDigit() {
		  if(this.t < 1) return 0;
		  var x = this.data[0];
		  if((x&1) == 0) return 0;
		  var y = x&3;		// y == 1/x mod 2^2
		  y = (y*(2-(x&0xf)*y))&0xf;	// y == 1/x mod 2^4
		  y = (y*(2-(x&0xff)*y))&0xff;	// y == 1/x mod 2^8
		  y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;	// y == 1/x mod 2^16
		  // last step - calculate inverse mod DV directly;
		  // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
		  y = (y*(2-x*y%this.DV))%this.DV;		// y == 1/x mod 2^dbits
		  // we really want the negative inverse, and -DV < y < DV
		  return (y>0)?this.DV-y:-y;
		}

		// Montgomery reduction
		function Montgomery(m) {
		  this.m = m;
		  this.mp = m.invDigit();
		  this.mpl = this.mp&0x7fff;
		  this.mph = this.mp>>15;
		  this.um = (1<<(m.DB-15))-1;
		  this.mt2 = 2*m.t;
		}

		// xR mod m
		function montConvert(x) {
		  var r = nbi();
		  x.abs().dlShiftTo(this.m.t,r);
		  r.divRemTo(this.m,null,r);
		  if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);
		  return r;
		}

		// x/R mod m
		function montRevert(x) {
		  var r = nbi();
		  x.copyTo(r);
		  this.reduce(r);
		  return r;
		}

		// x = x/R mod m (HAC 14.32)
		function montReduce(x) {
		  while(x.t <= this.mt2)	// pad x so am has enough room later
		    x.data[x.t++] = 0;
		  for(var i = 0; i < this.m.t; ++i) {
		    // faster way of calculating u0 = x.data[i]*mp mod DV
		    var j = x.data[i]&0x7fff;
		    var u0 = (j*this.mpl+(((j*this.mph+(x.data[i]>>15)*this.mpl)&this.um)<<15))&x.DM;
		    // use am to combine the multiply-shift-add into one call
		    j = i+this.m.t;
		    x.data[j] += this.m.am(0,u0,x,i,0,this.m.t);
		    // propagate carry
		    while(x.data[j] >= x.DV) { x.data[j] -= x.DV; x.data[++j]++; }
		  }
		  x.clamp();
		  x.drShiftTo(this.m.t,x);
		  if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
		}

		// r = "x^2/R mod m"; x != r
		function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }

		// r = "xy/R mod m"; x,y != r
		function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }

		Montgomery.prototype.convert = montConvert;
		Montgomery.prototype.revert = montRevert;
		Montgomery.prototype.reduce = montReduce;
		Montgomery.prototype.mulTo = montMulTo;
		Montgomery.prototype.sqrTo = montSqrTo;

		// (protected) true iff this is even
		function bnpIsEven() { return ((this.t>0)?(this.data[0]&1):this.s) == 0; }

		// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
		function bnpExp(e,z) {
		  if(e > 0xffffffff || e < 1) return BigInteger.ONE;
		  var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;
		  g.copyTo(r);
		  while(--i >= 0) {
		    z.sqrTo(r,r2);
		    if((e&(1<<i)) > 0) z.mulTo(r2,g,r);
		    else { var t = r; r = r2; r2 = t; }
		  }
		  return z.revert(r);
		}

		// (public) this^e % m, 0 <= e < 2^32
		function bnModPowInt(e,m) {
		  var z;
		  if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);
		  return this.exp(e,z);
		}

		// protected
		BigInteger.prototype.copyTo = bnpCopyTo;
		BigInteger.prototype.fromInt = bnpFromInt;
		BigInteger.prototype.fromString = bnpFromString;
		BigInteger.prototype.clamp = bnpClamp;
		BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
		BigInteger.prototype.drShiftTo = bnpDRShiftTo;
		BigInteger.prototype.lShiftTo = bnpLShiftTo;
		BigInteger.prototype.rShiftTo = bnpRShiftTo;
		BigInteger.prototype.subTo = bnpSubTo;
		BigInteger.prototype.multiplyTo = bnpMultiplyTo;
		BigInteger.prototype.squareTo = bnpSquareTo;
		BigInteger.prototype.divRemTo = bnpDivRemTo;
		BigInteger.prototype.invDigit = bnpInvDigit;
		BigInteger.prototype.isEven = bnpIsEven;
		BigInteger.prototype.exp = bnpExp;

		// public
		BigInteger.prototype.toString = bnToString;
		BigInteger.prototype.negate = bnNegate;
		BigInteger.prototype.abs = bnAbs;
		BigInteger.prototype.compareTo = bnCompareTo;
		BigInteger.prototype.bitLength = bnBitLength;
		BigInteger.prototype.mod = bnMod;
		BigInteger.prototype.modPowInt = bnModPowInt;

		// "constants"
		BigInteger.ZERO = nbv(0);
		BigInteger.ONE = nbv(1);

		// jsbn2 lib

		//Copyright (c) 2005-2009  Tom Wu
		//All Rights Reserved.
		//See "LICENSE" for details (See jsbn.js for LICENSE).

		//Extended JavaScript BN functions, required for RSA private ops.

		//Version 1.1: new BigInteger("0", 10) returns "proper" zero

		//(public)
		function bnClone() { var r = nbi(); this.copyTo(r); return r; }

		//(public) return value as integer
		function bnIntValue() {
		if(this.s < 0) {
		 if(this.t == 1) return this.data[0]-this.DV;
		 else if(this.t == 0) return -1;
		} else if(this.t == 1) return this.data[0];
		else if(this.t == 0) return 0;
		// assumes 16 < DB < 32
		return ((this.data[1]&((1<<(32-this.DB))-1))<<this.DB)|this.data[0];
		}

		//(public) return value as byte
		function bnByteValue() { return (this.t==0)?this.s:(this.data[0]<<24)>>24; }

		//(public) return value as short (assumes DB>=16)
		function bnShortValue() { return (this.t==0)?this.s:(this.data[0]<<16)>>16; }

		//(protected) return x s.t. r^x < DV
		function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }

		//(public) 0 if this == 0, 1 if this > 0
		function bnSigNum() {
		if(this.s < 0) return -1;
		else if(this.t <= 0 || (this.t == 1 && this.data[0] <= 0)) return 0;
		else return 1;
		}

		//(protected) convert to radix string
		function bnpToRadix(b) {
		if(b == null) b = 10;
		if(this.signum() == 0 || b < 2 || b > 36) return "0";
		var cs = this.chunkSize(b);
		var a = Math.pow(b,cs);
		var d = nbv(a), y = nbi(), z = nbi(), r = "";
		this.divRemTo(d,y,z);
		while(y.signum() > 0) {
		 r = (a+z.intValue()).toString(b).substr(1) + r;
		 y.divRemTo(d,y,z);
		}
		return z.intValue().toString(b) + r;
		}

		//(protected) convert from radix string
		function bnpFromRadix(s,b) {
		this.fromInt(0);
		if(b == null) b = 10;
		var cs = this.chunkSize(b);
		var d = Math.pow(b,cs), mi = false, j = 0, w = 0;
		for(var i = 0; i < s.length; ++i) {
		 var x = intAt(s,i);
		 if(x < 0) {
		   if(s.charAt(i) == "-" && this.signum() == 0) mi = true;
		   continue;
		 }
		 w = b*w+x;
		 if(++j >= cs) {
		   this.dMultiply(d);
		   this.dAddOffset(w,0);
		   j = 0;
		   w = 0;
		 }
		}
		if(j > 0) {
		 this.dMultiply(Math.pow(b,j));
		 this.dAddOffset(w,0);
		}
		if(mi) BigInteger.ZERO.subTo(this,this);
		}

		//(protected) alternate constructor
		function bnpFromNumber(a,b,c) {
		if("number" == typeof b) {
		 // new BigInteger(int,int,RNG)
		 if(a < 2) this.fromInt(1);
		 else {
		   this.fromNumber(a,c);
		   if(!this.testBit(a-1))  // force MSB set
		     this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);
		   if(this.isEven()) this.dAddOffset(1,0); // force odd
		   while(!this.isProbablePrime(b)) {
		     this.dAddOffset(2,0);
		     if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);
		   }
		 }
		} else {
		 // new BigInteger(int,RNG)
		 var x = new Array(), t = a&7;
		 x.length = (a>>3)+1;
		 b.nextBytes(x);
		 if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;
		 this.fromString(x,256);
		}
		}

		//(public) convert to bigendian byte array
		function bnToByteArray() {
		var i = this.t, r = new Array();
		r[0] = this.s;
		var p = this.DB-(i*this.DB)%8, d, k = 0;
		if(i-- > 0) {
		 if(p < this.DB && (d = this.data[i]>>p) != (this.s&this.DM)>>p)
		   r[k++] = d|(this.s<<(this.DB-p));
		 while(i >= 0) {
		   if(p < 8) {
		     d = (this.data[i]&((1<<p)-1))<<(8-p);
		     d |= this.data[--i]>>(p+=this.DB-8);
		   } else {
		     d = (this.data[i]>>(p-=8))&0xff;
		     if(p <= 0) { p += this.DB; --i; }
		   }
		   if((d&0x80) != 0) d |= -256;
		   if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;
		   if(k > 0 || d != this.s) r[k++] = d;
		 }
		}
		return r;
		}

		function bnEquals(a) { return(this.compareTo(a)==0); }
		function bnMin(a) { return(this.compareTo(a)<0)?this:a; }
		function bnMax(a) { return(this.compareTo(a)>0)?this:a; }

		//(protected) r = this op a (bitwise)
		function bnpBitwiseTo(a,op,r) {
		var i, f, m = Math.min(a.t,this.t);
		for(i = 0; i < m; ++i) r.data[i] = op(this.data[i],a.data[i]);
		if(a.t < this.t) {
		 f = a.s&this.DM;
		 for(i = m; i < this.t; ++i) r.data[i] = op(this.data[i],f);
		 r.t = this.t;
		} else {
		 f = this.s&this.DM;
		 for(i = m; i < a.t; ++i) r.data[i] = op(f,a.data[i]);
		 r.t = a.t;
		}
		r.s = op(this.s,a.s);
		r.clamp();
		}

		//(public) this & a
		function op_and(x,y) { return x&y; }
		function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }

		//(public) this | a
		function op_or(x,y) { return x|y; }
		function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }

		//(public) this ^ a
		function op_xor(x,y) { return x^y; }
		function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }

		//(public) this & ~a
		function op_andnot(x,y) { return x&~y; }
		function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }

		//(public) ~this
		function bnNot() {
		var r = nbi();
		for(var i = 0; i < this.t; ++i) r.data[i] = this.DM&~this.data[i];
		r.t = this.t;
		r.s = ~this.s;
		return r;
		}

		//(public) this << n
		function bnShiftLeft(n) {
		var r = nbi();
		if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);
		return r;
		}

		//(public) this >> n
		function bnShiftRight(n) {
		var r = nbi();
		if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);
		return r;
		}

		//return index of lowest 1-bit in x, x < 2^31
		function lbit(x) {
		if(x == 0) return -1;
		var r = 0;
		if((x&0xffff) == 0) { x >>= 16; r += 16; }
		if((x&0xff) == 0) { x >>= 8; r += 8; }
		if((x&0xf) == 0) { x >>= 4; r += 4; }
		if((x&3) == 0) { x >>= 2; r += 2; }
		if((x&1) == 0) ++r;
		return r;
		}

		//(public) returns index of lowest 1-bit (or -1 if none)
		function bnGetLowestSetBit() {
		for(var i = 0; i < this.t; ++i)
		 if(this.data[i] != 0) return i*this.DB+lbit(this.data[i]);
		if(this.s < 0) return this.t*this.DB;
		return -1;
		}

		//return number of 1 bits in x
		function cbit(x) {
		var r = 0;
		while(x != 0) { x &= x-1; ++r; }
		return r;
		}

		//(public) return number of set bits
		function bnBitCount() {
		var r = 0, x = this.s&this.DM;
		for(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);
		return r;
		}

		//(public) true iff nth bit is set
		function bnTestBit(n) {
		var j = Math.floor(n/this.DB);
		if(j >= this.t) return(this.s!=0);
		return((this.data[j]&(1<<(n%this.DB)))!=0);
		}

		//(protected) this op (1<<n)
		function bnpChangeBit(n,op) {
		var r = BigInteger.ONE.shiftLeft(n);
		this.bitwiseTo(r,op,r);
		return r;
		}

		//(public) this | (1<<n)
		function bnSetBit(n) { return this.changeBit(n,op_or); }

		//(public) this & ~(1<<n)
		function bnClearBit(n) { return this.changeBit(n,op_andnot); }

		//(public) this ^ (1<<n)
		function bnFlipBit(n) { return this.changeBit(n,op_xor); }

		//(protected) r = this + a
		function bnpAddTo(a,r) {
		var i = 0, c = 0, m = Math.min(a.t,this.t);
		while(i < m) {
		 c += this.data[i]+a.data[i];
		 r.data[i++] = c&this.DM;
		 c >>= this.DB;
		}
		if(a.t < this.t) {
		 c += a.s;
		 while(i < this.t) {
		   c += this.data[i];
		   r.data[i++] = c&this.DM;
		   c >>= this.DB;
		 }
		 c += this.s;
		} else {
		 c += this.s;
		 while(i < a.t) {
		   c += a.data[i];
		   r.data[i++] = c&this.DM;
		   c >>= this.DB;
		 }
		 c += a.s;
		}
		r.s = (c<0)?-1:0;
		if(c > 0) r.data[i++] = c;
		else if(c < -1) r.data[i++] = this.DV+c;
		r.t = i;
		r.clamp();
		}

		//(public) this + a
		function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }

		//(public) this - a
		function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }

		//(public) this * a
		function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }

		//(public) this / a
		function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }

		//(public) this % a
		function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }

		//(public) [this/a,this%a]
		function bnDivideAndRemainder(a) {
		var q = nbi(), r = nbi();
		this.divRemTo(a,q,r);
		return new Array(q,r);
		}

		//(protected) this *= n, this >= 0, 1 < n < DV
		function bnpDMultiply(n) {
		this.data[this.t] = this.am(0,n-1,this,0,0,this.t);
		++this.t;
		this.clamp();
		}

		//(protected) this += n << w words, this >= 0
		function bnpDAddOffset(n,w) {
		if(n == 0) return;
		while(this.t <= w) this.data[this.t++] = 0;
		this.data[w] += n;
		while(this.data[w] >= this.DV) {
		 this.data[w] -= this.DV;
		 if(++w >= this.t) this.data[this.t++] = 0;
		 ++this.data[w];
		}
		}

		//A "null" reducer
		function NullExp() {}
		function nNop(x) { return x; }
		function nMulTo(x,y,r) { x.multiplyTo(y,r); }
		function nSqrTo(x,r) { x.squareTo(r); }

		NullExp.prototype.convert = nNop;
		NullExp.prototype.revert = nNop;
		NullExp.prototype.mulTo = nMulTo;
		NullExp.prototype.sqrTo = nSqrTo;

		//(public) this^e
		function bnPow(e) { return this.exp(e,new NullExp()); }

		//(protected) r = lower n words of "this * a", a.t <= n
		//"this" should be the larger one if appropriate.
		function bnpMultiplyLowerTo(a,n,r) {
		var i = Math.min(this.t+a.t,n);
		r.s = 0; // assumes a,this >= 0
		r.t = i;
		while(i > 0) r.data[--i] = 0;
		var j;
		for(j = r.t-this.t; i < j; ++i) r.data[i+this.t] = this.am(0,a.data[i],r,i,0,this.t);
		for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a.data[i],r,i,0,n-i);
		r.clamp();
		}

		//(protected) r = "this * a" without lower n words, n > 0
		//"this" should be the larger one if appropriate.
		function bnpMultiplyUpperTo(a,n,r) {
		--n;
		var i = r.t = this.t+a.t-n;
		r.s = 0; // assumes a,this >= 0
		while(--i >= 0) r.data[i] = 0;
		for(i = Math.max(n-this.t,0); i < a.t; ++i)
		 r.data[this.t+i-n] = this.am(n-i,a.data[i],r,0,0,this.t+i-n);
		r.clamp();
		r.drShiftTo(1,r);
		}

		//Barrett modular reduction
		function Barrett(m) {
		// setup Barrett
		this.r2 = nbi();
		this.q3 = nbi();
		BigInteger.ONE.dlShiftTo(2*m.t,this.r2);
		this.mu = this.r2.divide(m);
		this.m = m;
		}

		function barrettConvert(x) {
		if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);
		else if(x.compareTo(this.m) < 0) return x;
		else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
		}

		function barrettRevert(x) { return x; }

		//x = x mod m (HAC 14.42)
		function barrettReduce(x) {
		x.drShiftTo(this.m.t-1,this.r2);
		if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }
		this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);
		this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);
		while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);
		x.subTo(this.r2,x);
		while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
		}

		//r = x^2 mod m; x != r
		function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }

		//r = x*y mod m; x,y != r
		function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }

		Barrett.prototype.convert = barrettConvert;
		Barrett.prototype.revert = barrettRevert;
		Barrett.prototype.reduce = barrettReduce;
		Barrett.prototype.mulTo = barrettMulTo;
		Barrett.prototype.sqrTo = barrettSqrTo;

		//(public) this^e % m (HAC 14.85)
		function bnModPow(e,m) {
		var i = e.bitLength(), k, r = nbv(1), z;
		if(i <= 0) return r;
		else if(i < 18) k = 1;
		else if(i < 48) k = 3;
		else if(i < 144) k = 4;
		else if(i < 768) k = 5;
		else k = 6;
		if(i < 8)
		 z = new Classic(m);
		else if(m.isEven())
		 z = new Barrett(m);
		else
		 z = new Montgomery(m);

		// precomputation
		var g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;
		g[1] = z.convert(this);
		if(k > 1) {
		 var g2 = nbi();
		 z.sqrTo(g[1],g2);
		 while(n <= km) {
		   g[n] = nbi();
		   z.mulTo(g2,g[n-2],g[n]);
		   n += 2;
		 }
		}

		var j = e.t-1, w, is1 = true, r2 = nbi(), t;
		i = nbits(e.data[j])-1;
		while(j >= 0) {
		 if(i >= k1) w = (e.data[j]>>(i-k1))&km;
		 else {
		   w = (e.data[j]&((1<<(i+1))-1))<<(k1-i);
		   if(j > 0) w |= e.data[j-1]>>(this.DB+i-k1);
		 }

		 n = k;
		 while((w&1) == 0) { w >>= 1; --n; }
		 if((i -= n) < 0) { i += this.DB; --j; }
		 if(is1) {  // ret == 1, don't bother squaring or multiplying it
		   g[w].copyTo(r);
		   is1 = false;
		 } else {
		   while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }
		   if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }
		   z.mulTo(r2,g[w],r);
		 }

		 while(j >= 0 && (e.data[j]&(1<<i)) == 0) {
		   z.sqrTo(r,r2); t = r; r = r2; r2 = t;
		   if(--i < 0) { i = this.DB-1; --j; }
		 }
		}
		return z.revert(r);
		}

		//(public) gcd(this,a) (HAC 14.54)
		function bnGCD(a) {
		var x = (this.s<0)?this.negate():this.clone();
		var y = (a.s<0)?a.negate():a.clone();
		if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }
		var i = x.getLowestSetBit(), g = y.getLowestSetBit();
		if(g < 0) return x;
		if(i < g) g = i;
		if(g > 0) {
		 x.rShiftTo(g,x);
		 y.rShiftTo(g,y);
		}
		while(x.signum() > 0) {
		 if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);
		 if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);
		 if(x.compareTo(y) >= 0) {
		   x.subTo(y,x);
		   x.rShiftTo(1,x);
		 } else {
		   y.subTo(x,y);
		   y.rShiftTo(1,y);
		 }
		}
		if(g > 0) y.lShiftTo(g,y);
		return y;
		}

		//(protected) this % n, n < 2^26
		function bnpModInt(n) {
		if(n <= 0) return 0;
		var d = this.DV%n, r = (this.s<0)?n-1:0;
		if(this.t > 0)
		 if(d == 0) r = this.data[0]%n;
		 else for(var i = this.t-1; i >= 0; --i) r = (d*r+this.data[i])%n;
		return r;
		}

		//(public) 1/this % m (HAC 14.61)
		function bnModInverse(m) {
		var ac = m.isEven();
		if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
		var u = m.clone(), v = this.clone();
		var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);
		while(u.signum() != 0) {
		 while(u.isEven()) {
		   u.rShiftTo(1,u);
		   if(ac) {
		     if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }
		     a.rShiftTo(1,a);
		   } else if(!b.isEven()) b.subTo(m,b);
		   b.rShiftTo(1,b);
		 }
		 while(v.isEven()) {
		   v.rShiftTo(1,v);
		   if(ac) {
		     if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }
		     c.rShiftTo(1,c);
		   } else if(!d.isEven()) d.subTo(m,d);
		   d.rShiftTo(1,d);
		 }
		 if(u.compareTo(v) >= 0) {
		   u.subTo(v,u);
		   if(ac) a.subTo(c,a);
		   b.subTo(d,b);
		 } else {
		   v.subTo(u,v);
		   if(ac) c.subTo(a,c);
		   d.subTo(b,d);
		 }
		}
		if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
		if(d.compareTo(m) >= 0) return d.subtract(m);
		if(d.signum() < 0) d.addTo(m,d); else return d;
		if(d.signum() < 0) return d.add(m); else return d;
		}

		var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509];
		var lplim = (1<<26)/lowprimes[lowprimes.length-1];

		//(public) test primality with certainty >= 1-.5^t
		function bnIsProbablePrime(t) {
		var i, x = this.abs();
		if(x.t == 1 && x.data[0] <= lowprimes[lowprimes.length-1]) {
		 for(i = 0; i < lowprimes.length; ++i)
		   if(x.data[0] == lowprimes[i]) return true;
		 return false;
		}
		if(x.isEven()) return false;
		i = 1;
		while(i < lowprimes.length) {
		 var m = lowprimes[i], j = i+1;
		 while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];
		 m = x.modInt(m);
		 while(i < j) if(m%lowprimes[i++] == 0) return false;
		}
		return x.millerRabin(t);
		}

		//(protected) true if probably prime (HAC 4.24, Miller-Rabin)
		function bnpMillerRabin(t) {
		var n1 = this.subtract(BigInteger.ONE);
		var k = n1.getLowestSetBit();
		if(k <= 0) return false;
		var r = n1.shiftRight(k);
		var prng = bnGetPrng();
		var a;
		for(var i = 0; i < t; ++i) {
		 // select witness 'a' at random from between 1 and n1
		 do {
		   a = new BigInteger(this.bitLength(), prng);
		 }
		 while(a.compareTo(BigInteger.ONE) <= 0 || a.compareTo(n1) >= 0);
		 var y = a.modPow(r,this);
		 if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
		   var j = 1;
		   while(j++ < k && y.compareTo(n1) != 0) {
		     y = y.modPowInt(2,this);
		     if(y.compareTo(BigInteger.ONE) == 0) return false;
		   }
		   if(y.compareTo(n1) != 0) return false;
		 }
		}
		return true;
		}

		// get pseudo random number generator
		function bnGetPrng() {
		  // create prng with api that matches BigInteger secure random
		  return {
		    // x is an array to fill with bytes
		    nextBytes: function(x) {
		      for(var i = 0; i < x.length; ++i) {
		        x[i] = Math.floor(Math.random() * 0x0100);
		      }
		    }
		  };
		}

		//protected
		BigInteger.prototype.chunkSize = bnpChunkSize;
		BigInteger.prototype.toRadix = bnpToRadix;
		BigInteger.prototype.fromRadix = bnpFromRadix;
		BigInteger.prototype.fromNumber = bnpFromNumber;
		BigInteger.prototype.bitwiseTo = bnpBitwiseTo;
		BigInteger.prototype.changeBit = bnpChangeBit;
		BigInteger.prototype.addTo = bnpAddTo;
		BigInteger.prototype.dMultiply = bnpDMultiply;
		BigInteger.prototype.dAddOffset = bnpDAddOffset;
		BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;
		BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;
		BigInteger.prototype.modInt = bnpModInt;
		BigInteger.prototype.millerRabin = bnpMillerRabin;

		//public
		BigInteger.prototype.clone = bnClone;
		BigInteger.prototype.intValue = bnIntValue;
		BigInteger.prototype.byteValue = bnByteValue;
		BigInteger.prototype.shortValue = bnShortValue;
		BigInteger.prototype.signum = bnSigNum;
		BigInteger.prototype.toByteArray = bnToByteArray;
		BigInteger.prototype.equals = bnEquals;
		BigInteger.prototype.min = bnMin;
		BigInteger.prototype.max = bnMax;
		BigInteger.prototype.and = bnAnd;
		BigInteger.prototype.or = bnOr;
		BigInteger.prototype.xor = bnXor;
		BigInteger.prototype.andNot = bnAndNot;
		BigInteger.prototype.not = bnNot;
		BigInteger.prototype.shiftLeft = bnShiftLeft;
		BigInteger.prototype.shiftRight = bnShiftRight;
		BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;
		BigInteger.prototype.bitCount = bnBitCount;
		BigInteger.prototype.testBit = bnTestBit;
		BigInteger.prototype.setBit = bnSetBit;
		BigInteger.prototype.clearBit = bnClearBit;
		BigInteger.prototype.flipBit = bnFlipBit;
		BigInteger.prototype.add = bnAdd;
		BigInteger.prototype.subtract = bnSubtract;
		BigInteger.prototype.multiply = bnMultiply;
		BigInteger.prototype.divide = bnDivide;
		BigInteger.prototype.remainder = bnRemainder;
		BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;
		BigInteger.prototype.modPow = bnModPow;
		BigInteger.prototype.modInverse = bnModInverse;
		BigInteger.prototype.pow = bnPow;
		BigInteger.prototype.gcd = bnGCD;
		BigInteger.prototype.isProbablePrime = bnIsProbablePrime;

		//BigInteger interfaces not implemented in jsbn:

		//BigInteger(int signum, byte[] magnitude)
		//double doubleValue()
		//float floatValue()
		//int hashCode()
		//long longValue()
		//static BigInteger valueOf(long val)

		forge.jsbn = forge.jsbn || {};
		forge.jsbn.BigInteger = BigInteger;

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'jsbn';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/jsbn',['require', 'module'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Partial implementation of PKCS#1 v2.2: RSA-OEAP
		 *
		 * Modified but based on the following MIT and BSD licensed code:
		 *
		 * https://github.com/kjur/jsjws/blob/master/rsa.js:
		 *
		 * The 'jsjws'(JSON Web Signature JavaScript Library) License
		 *
		 * Copyright (c) 2012 Kenji Urushima
		 *
		 * 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.
		 *
		 * http://webrsa.cvs.sourceforge.net/viewvc/webrsa/Client/RSAES-OAEP.js?content-type=text%2Fplain:
		 *
		 * RSAES-OAEP.js
		 * $Id: RSAES-OAEP.js,v 1.1.1.1 2003/03/19 15:37:20 ellispritchard Exp $
		 * JavaScript Implementation of PKCS #1 v2.1 RSA CRYPTOGRAPHY STANDARD (RSA Laboratories, June 14, 2002)
		 * Copyright (C) Ellis Pritchard, Guardian Unlimited 2003.
		 * Contact: ellis@nukinetics.com
		 * Distributed under the BSD License.
		 *
		 * Official documentation: http://www.rsa.com/rsalabs/node.asp?id=2125
		 *
		 * @author Evan Jones (http://evanjones.ca/)
		 * @author Dave Longley
		 *
		 * Copyright (c) 2013-2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for PKCS#1 API
		var pkcs1 = forge.pkcs1 = forge.pkcs1 || {};

		/**
		 * Encode the given RSAES-OAEP message (M) using key, with optional label (L)
		 * and seed.
		 *
		 * This method does not perform RSA encryption, it only encodes the message
		 * using RSAES-OAEP.
		 *
		 * @param key the RSA key to use.
		 * @param message the message to encode.
		 * @param options the options to use:
		 *          label an optional label to use.
		 *          seed the seed to use.
		 *          md the message digest object to use, undefined for SHA-1.
		 *          mgf1 optional mgf1 parameters:
		 *            md the message digest object to use for MGF1.
		 *
		 * @return the encoded message bytes.
		 */
		pkcs1.encode_rsa_oaep = function(key, message, options) {
		  // parse arguments
		  var label;
		  var seed;
		  var md;
		  var mgf1Md;
		  // legacy args (label, seed, md)
		  if(typeof options === 'string') {
		    label = options;
		    seed = arguments[3] || undefined;
		    md = arguments[4] || undefined;
		  } else if(options) {
		    label = options.label || undefined;
		    seed = options.seed || undefined;
		    md = options.md || undefined;
		    if(options.mgf1 && options.mgf1.md) {
		      mgf1Md = options.mgf1.md;
		    }
		  }

		  // default OAEP to SHA-1 message digest
		  if(!md) {
		    md = forge.md.sha1.create();
		  } else {
		    md.start();
		  }

		  // default MGF-1 to same as OAEP
		  if(!mgf1Md) {
		    mgf1Md = md;
		  }

		  // compute length in bytes and check output
		  var keyLength = Math.ceil(key.n.bitLength() / 8);
		  var maxLength = keyLength - 2 * md.digestLength - 2;
		  if(message.length > maxLength) {
		    var error = new Error('RSAES-OAEP input message length is too long.');
		    error.length = message.length;
		    error.maxLength = maxLength;
		    throw error;
		  }

		  if(!label) {
		    label = '';
		  }
		  md.update(label, 'raw');
		  var lHash = md.digest();

		  var PS = '';
		  var PS_length = maxLength - message.length;
		  for (var i = 0; i < PS_length; i++) {
		    PS += '\x00';
		  }

		  var DB = lHash.getBytes() + PS + '\x01' + message;

		  if(!seed) {
		    seed = forge.random.getBytes(md.digestLength);
		  } else if(seed.length !== md.digestLength) {
		    var error = new Error('Invalid RSAES-OAEP seed. The seed length must ' +
		      'match the digest length.')
		    error.seedLength = seed.length;
		    error.digestLength = md.digestLength;
		    throw error;
		  }

		  var dbMask = rsa_mgf1(seed, keyLength - md.digestLength - 1, mgf1Md);
		  var maskedDB = forge.util.xorBytes(DB, dbMask, DB.length);

		  var seedMask = rsa_mgf1(maskedDB, md.digestLength, mgf1Md);
		  var maskedSeed = forge.util.xorBytes(seed, seedMask, seed.length);

		  // return encoded message
		  return '\x00' + maskedSeed + maskedDB;
		};

		/**
		 * Decode the given RSAES-OAEP encoded message (EM) using key, with optional
		 * label (L).
		 *
		 * This method does not perform RSA decryption, it only decodes the message
		 * using RSAES-OAEP.
		 *
		 * @param key the RSA key to use.
		 * @param em the encoded message to decode.
		 * @param options the options to use:
		 *          label an optional label to use.
		 *          md the message digest object to use for OAEP, undefined for SHA-1.
		 *          mgf1 optional mgf1 parameters:
		 *            md the message digest object to use for MGF1.
		 *
		 * @return the decoded message bytes.
		 */
		pkcs1.decode_rsa_oaep = function(key, em, options) {
		  // parse args
		  var label;
		  var md;
		  var mgf1Md;
		  // legacy args
		  if(typeof options === 'string') {
		    label = options;
		    md = arguments[3] || undefined;
		  } else if(options) {
		    label = options.label || undefined;
		    md = options.md || undefined;
		    if(options.mgf1 && options.mgf1.md) {
		      mgf1Md = options.mgf1.md;
		    }
		  }

		  // compute length in bytes
		  var keyLength = Math.ceil(key.n.bitLength() / 8);

		  if(em.length !== keyLength) {
		    var error = new Error('RSAES-OAEP encoded message length is invalid.');
		    error.length = em.length;
		    error.expectedLength = keyLength;
		    throw error;
		  }

		  // default OAEP to SHA-1 message digest
		  if(md === undefined) {
		    md = forge.md.sha1.create();
		  } else {
		    md.start();
		  }

		  // default MGF-1 to same as OAEP
		  if(!mgf1Md) {
		    mgf1Md = md;
		  }

		  if(keyLength < 2 * md.digestLength + 2) {
		    throw new Error('RSAES-OAEP key is too short for the hash function.');
		  }

		  if(!label) {
		    label = '';
		  }
		  md.update(label, 'raw');
		  var lHash = md.digest().getBytes();

		  // split the message into its parts
		  var y = em.charAt(0);
		  var maskedSeed = em.substring(1, md.digestLength + 1);
		  var maskedDB = em.substring(1 + md.digestLength);

		  var seedMask = rsa_mgf1(maskedDB, md.digestLength, mgf1Md);
		  var seed = forge.util.xorBytes(maskedSeed, seedMask, maskedSeed.length);

		  var dbMask = rsa_mgf1(seed, keyLength - md.digestLength - 1, mgf1Md);
		  var db = forge.util.xorBytes(maskedDB, dbMask, maskedDB.length);

		  var lHashPrime = db.substring(0, md.digestLength);

		  // constant time check that all values match what is expected
		  var error = (y !== '\x00');

		  // constant time check lHash vs lHashPrime
		  for(var i = 0; i < md.digestLength; ++i) {
		    error |= (lHash.charAt(i) !== lHashPrime.charAt(i));
		  }

		  // "constant time" find the 0x1 byte separating the padding (zeros) from the
		  // message
		  // TODO: It must be possible to do this in a better/smarter way?
		  var in_ps = 1;
		  var index = md.digestLength;
		  for(var j = md.digestLength; j < db.length; j++) {
		    var code = db.charCodeAt(j);

		    var is_0 = (code & 0x1) ^ 0x1;

		    // non-zero if not 0 or 1 in the ps section
		    var error_mask = in_ps ? 0xfffe : 0x0000;
		    error |= (code & error_mask);

		    // latch in_ps to zero after we find 0x1
		    in_ps = in_ps & is_0;
		    index += in_ps;
		  }

		  if(error || db.charCodeAt(index) !== 0x1) {
		    throw new Error('Invalid RSAES-OAEP padding.');
		  }

		  return db.substring(index + 1);
		};

		function rsa_mgf1(seed, maskLength, hash) {
		  // default to SHA-1 message digest
		  if(!hash) {
		    hash = forge.md.sha1.create();
		  }
		  var t = '';
		  var count = Math.ceil(maskLength / hash.digestLength);
		  for(var i = 0; i < count; ++i) {
		    var c = String.fromCharCode(
		      (i >> 24) & 0xFF, (i >> 16) & 0xFF, (i >> 8) & 0xFF, i & 0xFF);
		    hash.start();
		    hash.update(seed + c);
		    t += hash.digest().getBytes();
		  }
		  return t.substring(0, maskLength);
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pkcs1';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pkcs1',['require', 'module', './util', './random', './sha1'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Prime number generation API.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// forge.prime already defined
		if(forge.prime) {
		  return;
		}

		/* PRIME API */
		var prime = forge.prime = forge.prime || {};

		var BigInteger = forge.jsbn.BigInteger;

		// primes are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29
		var GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];
		var THIRTY = new BigInteger(null);
		THIRTY.fromInt(30);
		var op_or = function(x, y) {return x|y;};

		/**
		 * Generates a random probable prime with the given number of bits.
		 *
		 * Alternative algorithms can be specified by name as a string or as an
		 * object with custom options like so:
		 *
		 * {
		 *   name: 'PRIMEINC',
		 *   options: {
		 *     maxBlockTime: <the maximum amount of time to block the main
		 *       thread before allowing I/O other JS to run>,
		 *     millerRabinTests: <the number of miller-rabin tests to run>,
		 *     workerScript: <the worker script URL>,
		 *     workers: <the number of web workers (if supported) to use,
		 *       -1 to use estimated cores minus one>.
		 *     workLoad: the size of the work load, ie: number of possible prime
		 *       numbers for each web worker to check per work assignment,
		 *       (default: 100).
		 *   }
		 * }
		 *
		 * @param bits the number of bits for the prime number.
		 * @param options the options to use.
		 *          [algorithm] the algorithm to use (default: 'PRIMEINC').
		 *          [prng] a custom crypto-secure pseudo-random number generator to use,
		 *            that must define "getBytesSync".
		 *
		 * @return callback(err, num) called once the operation completes.
		 */
		prime.generateProbablePrime = function(bits, options, callback) {
		  if(typeof options === 'function') {
		    callback = options;
		    options = {};
		  }
		  options = options || {};

		  // default to PRIMEINC algorithm
		  var algorithm = options.algorithm || 'PRIMEINC';
		  if(typeof algorithm === 'string') {
		    algorithm = {name: algorithm};
		  }
		  algorithm.options = algorithm.options || {};

		  // create prng with api that matches BigInteger secure random
		  var prng = options.prng || forge.random;
		  var rng = {
		    // x is an array to fill with bytes
		    nextBytes: function(x) {
		      var b = prng.getBytesSync(x.length);
		      for(var i = 0; i < x.length; ++i) {
		        x[i] = b.charCodeAt(i);
		      }
		    }
		  };

		  if(algorithm.name === 'PRIMEINC') {
		    return primeincFindPrime(bits, rng, algorithm.options, callback);
		  }

		  throw new Error('Invalid prime generation algorithm: ' + algorithm.name);
		};

		function primeincFindPrime(bits, rng, options, callback) {
		  if('workers' in options) {
		    return primeincFindPrimeWithWorkers(bits, rng, options, callback);
		  }
		  return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
		}

		function primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {
		  // initialize random number
		  var num = generateRandom(bits, rng);

		  /* Note: All primes are of the form 30k+i for i < 30 and gcd(30, i)=1. The
		  number we are given is always aligned at 30k + 1. Each time the number is
		  determined not to be prime we add to get to the next 'i', eg: if the number
		  was at 30k + 1 we add 6. */
		  var deltaIdx = 0;

		  // get required number of MR tests
		  var mrTests = getMillerRabinTests(num.bitLength());
		  if('millerRabinTests' in options) {
		    mrTests = options.millerRabinTests;
		  }

		  // find prime nearest to 'num' for maxBlockTime ms
		  // 10 ms gives 5ms of leeway for other calculations before dropping
		  // below 60fps (1000/60 == 16.67), but in reality, the number will
		  // likely be higher due to an 'atomic' big int modPow
		  var maxBlockTime = 10;
		  if('maxBlockTime' in options) {
		    maxBlockTime = options.maxBlockTime;
		  }
		  var start = +new Date();
		  do {
		    // overflow, regenerate random number
		    if(num.bitLength() > bits) {
		      num = generateRandom(bits, rng);
		    }
		    // do primality test
		    if(num.isProbablePrime(mrTests)) {
		      return callback(null, num);
		    }
		    // get next potential prime
		    num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);
		  } while(maxBlockTime < 0 || (+new Date() - start < maxBlockTime));

		  // keep trying (setImmediate would be better here)
		  forge.util.setImmediate(function() {
		    primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
		  });
		}

		function primeincFindPrimeWithWorkers(bits, rng, options, callback) {
		  // web workers unavailable
		  if(typeof Worker === 'undefined') {
		    return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
		  }

		  // initialize random number
		  var num = generateRandom(bits, rng);

		  // use web workers to generate keys
		  var numWorkers = options.workers;
		  var workLoad = options.workLoad || 100;
		  var range = workLoad * 30 / 8;
		  var workerScript = options.workerScript || 'forge/prime.worker.js';
		  if(numWorkers === -1) {
		    return forge.util.estimateCores(function(err, cores) {
		      if(err) {
		        // default to 2
		        cores = 2;
		      }
		      numWorkers = cores - 1;
		      generate();
		    });
		  }
		  generate();

		  function generate() {
		    // require at least 1 worker
		    numWorkers = Math.max(1, numWorkers);

		    // TODO: consider optimizing by starting workers outside getPrime() ...
		    // note that in order to clean up they will have to be made internally
		    // asynchronous which may actually be slower

		    // start workers immediately
		    var workers = [];
		    for(var i = 0; i < numWorkers; ++i) {
		      // FIXME: fix path or use blob URLs
		      workers[i] = new Worker(workerScript);
		    }
		    var running = numWorkers;

		    // listen for requests from workers and assign ranges to find prime
		    for(var i = 0; i < numWorkers; ++i) {
		      workers[i].addEventListener('message', workerMessage);
		    }

		    /* Note: The distribution of random numbers is unknown. Therefore, each
		    web worker is continuously allocated a range of numbers to check for a
		    random number until one is found.

		    Every 30 numbers will be checked just 8 times, because prime numbers
		    have the form:

		    30k+i, for i < 30 and gcd(30, i)=1 (there are 8 values of i for this)

		    Therefore, if we want a web worker to run N checks before asking for
		    a new range of numbers, each range must contain N*30/8 numbers.

		    For 100 checks (workLoad), this is a range of 375. */

		    var found = false;
		    function workerMessage(e) {
		      // ignore message, prime already found
		      if(found) {
		        return;
		      }

		      --running;
		      var data = e.data;
		      if(data.found) {
		        // terminate all workers
		        for(var i = 0; i < workers.length; ++i) {
		          workers[i].terminate();
		        }
		        found = true;
		        return callback(null, new BigInteger(data.prime, 16));
		      }

		      // overflow, regenerate random number
		      if(num.bitLength() > bits) {
		        num = generateRandom(bits, rng);
		      }

		      // assign new range to check
		      var hex = num.toString(16);

		      // start prime search
		      e.target.postMessage({
		        hex: hex,
		        workLoad: workLoad
		      });

		      num.dAddOffset(range, 0);
		    }
		  }
		}

		/**
		 * Generates a random number using the given number of bits and RNG.
		 *
		 * @param bits the number of bits for the number.
		 * @param rng the random number generator to use.
		 *
		 * @return the random number.
		 */
		function generateRandom(bits, rng) {
		  var num = new BigInteger(bits, rng);
		  // force MSB set
		  var bits1 = bits - 1;
		  if(!num.testBit(bits1)) {
		    num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);
		  }
		  // align number on 30k+1 boundary
		  num.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);
		  return num;
		}

		/**
		 * Returns the required number of Miller-Rabin tests to generate a
		 * prime with an error probability of (1/2)^80.
		 *
		 * See Handbook of Applied Cryptography Chapter 4, Table 4.4.
		 *
		 * @param bits the bit size.
		 *
		 * @return the required number of iterations.
		 */
		function getMillerRabinTests(bits) {
		  if(bits <= 100) return 27;
		  if(bits <= 150) return 18;
		  if(bits <= 200) return 15;
		  if(bits <= 250) return 12;
		  if(bits <= 300) return 9;
		  if(bits <= 350) return 8;
		  if(bits <= 400) return 7;
		  if(bits <= 500) return 6;
		  if(bits <= 600) return 5;
		  if(bits <= 800) return 4;
		  if(bits <= 1250) return 3;
		  return 2;
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'prime';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/prime',['require', 'module', './util', './jsbn', './random'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});

		})();

		/**
		 * Javascript implementation of basic RSA algorithms.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 *
		 * The only algorithm currently supported for PKI is RSA.
		 *
		 * An RSA key is often stored in ASN.1 DER format. The SubjectPublicKeyInfo
		 * ASN.1 structure is composed of an algorithm of type AlgorithmIdentifier
		 * and a subjectPublicKey of type bit string.
		 *
		 * The AlgorithmIdentifier contains an Object Identifier (OID) and parameters
		 * for the algorithm, if any. In the case of RSA, there aren't any.
		 *
		 * SubjectPublicKeyInfo ::= SEQUENCE {
		 *   algorithm AlgorithmIdentifier,
		 *   subjectPublicKey BIT STRING
		 * }
		 *
		 * AlgorithmIdentifer ::= SEQUENCE {
		 *   algorithm OBJECT IDENTIFIER,
		 *   parameters ANY DEFINED BY algorithm OPTIONAL
		 * }
		 *
		 * For an RSA public key, the subjectPublicKey is:
		 *
		 * RSAPublicKey ::= SEQUENCE {
		 *   modulus            INTEGER,    -- n
		 *   publicExponent     INTEGER     -- e
		 * }
		 *
		 * PrivateKeyInfo ::= SEQUENCE {
		 *   version                   Version,
		 *   privateKeyAlgorithm       PrivateKeyAlgorithmIdentifier,
		 *   privateKey                PrivateKey,
		 *   attributes           [0]  IMPLICIT Attributes OPTIONAL
		 * }
		 *
		 * Version ::= INTEGER
		 * PrivateKeyAlgorithmIdentifier ::= AlgorithmIdentifier
		 * PrivateKey ::= OCTET STRING
		 * Attributes ::= SET OF Attribute
		 *
		 * An RSA private key as the following structure:
		 *
		 * RSAPrivateKey ::= SEQUENCE {
		 *   version Version,
		 *   modulus INTEGER, -- n
		 *   publicExponent INTEGER, -- e
		 *   privateExponent INTEGER, -- d
		 *   prime1 INTEGER, -- p
		 *   prime2 INTEGER, -- q
		 *   exponent1 INTEGER, -- d mod (p-1)
		 *   exponent2 INTEGER, -- d mod (q-1)
		 *   coefficient INTEGER -- (inverse of q) mod p
		 * }
		 *
		 * Version ::= INTEGER
		 *
		 * The OID for the RSA key algorithm is: 1.2.840.113549.1.1.1
		 */
		(function() {
		function initModule(forge) {
		/* ########## Begin module implementation ########## */

		if(typeof BigInteger === 'undefined') {
		  var BigInteger = forge.jsbn.BigInteger;
		}

		// shortcut for asn.1 API
		var asn1 = forge.asn1;

		/*
		 * RSA encryption and decryption, see RFC 2313.
		 */
		forge.pki = forge.pki || {};
		forge.pki.rsa = forge.rsa = forge.rsa || {};
		var pki = forge.pki;

		// for finding primes, which are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29
		var GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];

		// validator for a PrivateKeyInfo structure
		var privateKeyValidator = {
		  // PrivateKeyInfo
		  name: 'PrivateKeyInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    // Version (INTEGER)
		    name: 'PrivateKeyInfo.version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyVersion'
		  }, {
		    // privateKeyAlgorithm
		    name: 'PrivateKeyInfo.privateKeyAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'AlgorithmIdentifier.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'privateKeyOid'
		    }]
		  }, {
		    // PrivateKey
		    name: 'PrivateKeyInfo',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OCTETSTRING,
		    constructed: false,
		    capture: 'privateKey'
		  }]
		};

		// validator for an RSA private key
		var rsaPrivateKeyValidator = {
		  // RSAPrivateKey
		  name: 'RSAPrivateKey',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    // Version (INTEGER)
		    name: 'RSAPrivateKey.version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyVersion'
		  }, {
		    // modulus (n)
		    name: 'RSAPrivateKey.modulus',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyModulus'
		  }, {
		    // publicExponent (e)
		    name: 'RSAPrivateKey.publicExponent',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyPublicExponent'
		  }, {
		    // privateExponent (d)
		    name: 'RSAPrivateKey.privateExponent',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyPrivateExponent'
		  }, {
		    // prime1 (p)
		    name: 'RSAPrivateKey.prime1',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyPrime1'
		  }, {
		    // prime2 (q)
		    name: 'RSAPrivateKey.prime2',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyPrime2'
		  }, {
		    // exponent1 (d mod (p-1))
		    name: 'RSAPrivateKey.exponent1',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyExponent1'
		  }, {
		    // exponent2 (d mod (q-1))
		    name: 'RSAPrivateKey.exponent2',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyExponent2'
		  }, {
		    // coefficient ((inverse of q) mod p)
		    name: 'RSAPrivateKey.coefficient',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'privateKeyCoefficient'
		  }]
		};

		// validator for an RSA public key
		var rsaPublicKeyValidator = {
		  // RSAPublicKey
		  name: 'RSAPublicKey',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    // modulus (n)
		    name: 'RSAPublicKey.modulus',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'publicKeyModulus'
		  }, {
		    // publicExponent (e)
		    name: 'RSAPublicKey.exponent',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'publicKeyExponent'
		  }]
		};

		// validator for an SubjectPublicKeyInfo structure
		// Note: Currently only works with an RSA public key
		var publicKeyValidator = forge.pki.rsa.publicKeyValidator = {
		  name: 'SubjectPublicKeyInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  captureAsn1: 'subjectPublicKeyInfo',
		  value: [{
		    name: 'SubjectPublicKeyInfo.AlgorithmIdentifier',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'AlgorithmIdentifier.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'publicKeyOid'
		    }]
		  }, {
		    // subjectPublicKey
		    name: 'SubjectPublicKeyInfo.subjectPublicKey',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.BITSTRING,
		    constructed: false,
		    value: [{
		      // RSAPublicKey
		      name: 'SubjectPublicKeyInfo.subjectPublicKey.RSAPublicKey',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      optional: true,
		      captureAsn1: 'rsaPublicKey'
		    }]
		  }]
		};

		/**
		 * Wrap digest in DigestInfo object.
		 *
		 * This function implements EMSA-PKCS1-v1_5-ENCODE as per RFC 3447.
		 *
		 * DigestInfo ::= SEQUENCE {
		 *   digestAlgorithm DigestAlgorithmIdentifier,
		 *   digest Digest
		 * }
		 *
		 * DigestAlgorithmIdentifier ::= AlgorithmIdentifier
		 * Digest ::= OCTET STRING
		 *
		 * @param md the message digest object with the hash to sign.
		 *
		 * @return the encoded message (ready for RSA encrytion)
		 */
		var emsaPkcs1v15encode = function(md) {
		  // get the oid for the algorithm
		  var oid;
		  if(md.algorithm in pki.oids) {
		    oid = pki.oids[md.algorithm];
		  } else {
		    var error = new Error('Unknown message digest algorithm.');
		    error.algorithm = md.algorithm;
		    throw error;
		  }
		  var oidBytes = asn1.oidToDer(oid).getBytes();

		  // create the digest info
		  var digestInfo = asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);
		  var digestAlgorithm = asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);
		  digestAlgorithm.value.push(asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.OID, false, oidBytes));
		  digestAlgorithm.value.push(asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.NULL, false, ''));
		  var digest = asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING,
		    false, md.digest().getBytes());
		  digestInfo.value.push(digestAlgorithm);
		  digestInfo.value.push(digest);

		  // encode digest info
		  return asn1.toDer(digestInfo).getBytes();
		};

		/**
		 * Performs x^c mod n (RSA encryption or decryption operation).
		 *
		 * @param x the number to raise and mod.
		 * @param key the key to use.
		 * @param pub true if the key is public, false if private.
		 *
		 * @return the result of x^c mod n.
		 */
		var _modPow = function(x, key, pub) {
		  if(pub) {
		    return x.modPow(key.e, key.n);
		  }

		  if(!key.p || !key.q) {
		    // allow calculation without CRT params (slow)
		    return x.modPow(key.d, key.n);
		  }

		  // pre-compute dP, dQ, and qInv if necessary
		  if(!key.dP) {
		    key.dP = key.d.mod(key.p.subtract(BigInteger.ONE));
		  }
		  if(!key.dQ) {
		    key.dQ = key.d.mod(key.q.subtract(BigInteger.ONE));
		  }
		  if(!key.qInv) {
		    key.qInv = key.q.modInverse(key.p);
		  }

		  /* Chinese remainder theorem (CRT) states:

		    Suppose n1, n2, ..., nk are positive integers which are pairwise
		    coprime (n1 and n2 have no common factors other than 1). For any
		    integers x1, x2, ..., xk there exists an integer x solving the
		    system of simultaneous congruences (where ~= means modularly
		    congruent so a ~= b mod n means a mod n = b mod n):

		    x ~= x1 mod n1
		    x ~= x2 mod n2
		    ...
		    x ~= xk mod nk

		    This system of congruences has a single simultaneous solution x
		    between 0 and n - 1. Furthermore, each xk solution and x itself
		    is congruent modulo the product n = n1*n2*...*nk.
		    So x1 mod n = x2 mod n = xk mod n = x mod n.

		    The single simultaneous solution x can be solved with the following
		    equation:

		    x = sum(xi*ri*si) mod n where ri = n/ni and si = ri^-1 mod ni.

		    Where x is less than n, xi = x mod ni.

		    For RSA we are only concerned with k = 2. The modulus n = pq, where
		    p and q are coprime. The RSA decryption algorithm is:

		    y = x^d mod n

		    Given the above:

		    x1 = x^d mod p
		    r1 = n/p = q
		    s1 = q^-1 mod p
		    x2 = x^d mod q
		    r2 = n/q = p
		    s2 = p^-1 mod q

		    So y = (x1r1s1 + x2r2s2) mod n
		         = ((x^d mod p)q(q^-1 mod p) + (x^d mod q)p(p^-1 mod q)) mod n

		    According to Fermat's Little Theorem, if the modulus P is prime,
		    for any integer A not evenly divisible by P, A^(P-1) ~= 1 mod P.
		    Since A is not divisible by P it follows that if:
		    N ~= M mod (P - 1), then A^N mod P = A^M mod P. Therefore:

		    A^N mod P = A^(M mod (P - 1)) mod P. (The latter takes less effort
		    to calculate). In order to calculate x^d mod p more quickly the
		    exponent d mod (p - 1) is stored in the RSA private key (the same
		    is done for x^d mod q). These values are referred to as dP and dQ
		    respectively. Therefore we now have:

		    y = ((x^dP mod p)q(q^-1 mod p) + (x^dQ mod q)p(p^-1 mod q)) mod n

		    Since we'll be reducing x^dP by modulo p (same for q) we can also
		    reduce x by p (and q respectively) before hand. Therefore, let

		    xp = ((x mod p)^dP mod p), and
		    xq = ((x mod q)^dQ mod q), yielding:

		    y = (xp*q*(q^-1 mod p) + xq*p*(p^-1 mod q)) mod n

		    This can be further reduced to a simple algorithm that only
		    requires 1 inverse (the q inverse is used) to be used and stored.
		    The algorithm is called Garner's algorithm. If qInv is the
		    inverse of q, we simply calculate:

		    y = (qInv*(xp - xq) mod p) * q + xq

		    However, there are two further complications. First, we need to
		    ensure that xp > xq to prevent signed BigIntegers from being used
		    so we add p until this is true (since we will be mod'ing with
		    p anyway). Then, there is a known timing attack on algorithms
		    using the CRT. To mitigate this risk, "cryptographic blinding"
		    should be used. This requires simply generating a random number r
		    between 0 and n-1 and its inverse and multiplying x by r^e before
		    calculating y and then multiplying y by r^-1 afterwards. Note that
		    r must be coprime with n (gcd(r, n) === 1) in order to have an
		    inverse.
		  */

		  // cryptographic blinding
		  var r;
		  do {
		    r = new BigInteger(
		      forge.util.bytesToHex(forge.random.getBytes(key.n.bitLength() / 8)),
		      16);
		  } while(r.compareTo(key.n) >= 0 || !r.gcd(key.n).equals(BigInteger.ONE));
		  x = x.multiply(r.modPow(key.e, key.n)).mod(key.n);

		  // calculate xp and xq
		  var xp = x.mod(key.p).modPow(key.dP, key.p);
		  var xq = x.mod(key.q).modPow(key.dQ, key.q);

		  // xp must be larger than xq to avoid signed bit usage
		  while(xp.compareTo(xq) < 0) {
		    xp = xp.add(key.p);
		  }

		  // do last step
		  var y = xp.subtract(xq)
		    .multiply(key.qInv).mod(key.p)
		    .multiply(key.q).add(xq);

		  // remove effect of random for cryptographic blinding
		  y = y.multiply(r.modInverse(key.n)).mod(key.n);

		  return y;
		};

		/**
		 * NOTE: THIS METHOD IS DEPRECATED, use 'sign' on a private key object or
		 * 'encrypt' on a public key object instead.
		 *
		 * Performs RSA encryption.
		 *
		 * The parameter bt controls whether to put padding bytes before the
		 * message passed in. Set bt to either true or false to disable padding
		 * completely (in order to handle e.g. EMSA-PSS encoding seperately before),
		 * signaling whether the encryption operation is a public key operation
		 * (i.e. encrypting data) or not, i.e. private key operation (data signing).
		 *
		 * For PKCS#1 v1.5 padding pass in the block type to use, i.e. either 0x01
		 * (for signing) or 0x02 (for encryption). The key operation mode (private
		 * or public) is derived from this flag in that case).
		 *
		 * @param m the message to encrypt as a byte string.
		 * @param key the RSA key to use.
		 * @param bt for PKCS#1 v1.5 padding, the block type to use
		 *   (0x01 for private key, 0x02 for public),
		 *   to disable padding: true = public key, false = private key.
		 *
		 * @return the encrypted bytes as a string.
		 */
		pki.rsa.encrypt = function(m, key, bt) {
		  var pub = bt;
		  var eb;

		  // get the length of the modulus in bytes
		  var k = Math.ceil(key.n.bitLength() / 8);

		  if(bt !== false && bt !== true) {
		    // legacy, default to PKCS#1 v1.5 padding
		    pub = (bt === 0x02);
		    eb = _encodePkcs1_v1_5(m, key, bt);
		  } else {
		    eb = forge.util.createBuffer();
		    eb.putBytes(m);
		  }

		  // load encryption block as big integer 'x'
		  // FIXME: hex conversion inefficient, get BigInteger w/byte strings
		  var x = new BigInteger(eb.toHex(), 16);

		  // do RSA encryption
		  var y = _modPow(x, key, pub);

		  // convert y into the encrypted data byte string, if y is shorter in
		  // bytes than k, then prepend zero bytes to fill up ed
		  // FIXME: hex conversion inefficient, get BigInteger w/byte strings
		  var yhex = y.toString(16);
		  var ed = forge.util.createBuffer();
		  var zeros = k - Math.ceil(yhex.length / 2);
		  while(zeros > 0) {
		    ed.putByte(0x00);
		    --zeros;
		  }
		  ed.putBytes(forge.util.hexToBytes(yhex));
		  return ed.getBytes();
		};

		/**
		 * NOTE: THIS METHOD IS DEPRECATED, use 'decrypt' on a private key object or
		 * 'verify' on a public key object instead.
		 *
		 * Performs RSA decryption.
		 *
		 * The parameter ml controls whether to apply PKCS#1 v1.5 padding
		 * or not.  Set ml = false to disable padding removal completely
		 * (in order to handle e.g. EMSA-PSS later on) and simply pass back
		 * the RSA encryption block.
		 *
		 * @param ed the encrypted data to decrypt in as a byte string.
		 * @param key the RSA key to use.
		 * @param pub true for a public key operation, false for private.
		 * @param ml the message length, if known, false to disable padding.
		 *
		 * @return the decrypted message as a byte string.
		 */
		pki.rsa.decrypt = function(ed, key, pub, ml) {
		  // get the length of the modulus in bytes
		  var k = Math.ceil(key.n.bitLength() / 8);

		  // error if the length of the encrypted data ED is not k
		  if(ed.length !== k) {
		    var error = new Error('Encrypted message length is invalid.');
		    error.length = ed.length;
		    error.expected = k;
		    throw error;
		  }

		  // convert encrypted data into a big integer
		  // FIXME: hex conversion inefficient, get BigInteger w/byte strings
		  var y = new BigInteger(forge.util.createBuffer(ed).toHex(), 16);

		  // y must be less than the modulus or it wasn't the result of
		  // a previous mod operation (encryption) using that modulus
		  if(y.compareTo(key.n) >= 0) {
		    throw new Error('Encrypted message is invalid.');
		  }

		  // do RSA decryption
		  var x = _modPow(y, key, pub);

		  // create the encryption block, if x is shorter in bytes than k, then
		  // prepend zero bytes to fill up eb
		  // FIXME: hex conversion inefficient, get BigInteger w/byte strings
		  var xhex = x.toString(16);
		  var eb = forge.util.createBuffer();
		  var zeros = k - Math.ceil(xhex.length / 2);
		  while(zeros > 0) {
		    eb.putByte(0x00);
		    --zeros;
		  }
		  eb.putBytes(forge.util.hexToBytes(xhex));

		  if(ml !== false) {
		    // legacy, default to PKCS#1 v1.5 padding
		    return _decodePkcs1_v1_5(eb.getBytes(), key, pub);
		  }

		  // return message
		  return eb.getBytes();
		};

		/**
		 * Creates an RSA key-pair generation state object. It is used to allow
		 * key-generation to be performed in steps. It also allows for a UI to
		 * display progress updates.
		 *
		 * @param bits the size for the private key in bits, defaults to 2048.
		 * @param e the public exponent to use, defaults to 65537 (0x10001).
		 * @param [options] the options to use.
		 *          prng a custom crypto-secure pseudo-random number generator to use,
		 *            that must define "getBytesSync".
		 *          algorithm the algorithm to use (default: 'PRIMEINC').
		 *
		 * @return the state object to use to generate the key-pair.
		 */
		pki.rsa.createKeyPairGenerationState = function(bits, e, options) {
		  // TODO: migrate step-based prime generation code to forge.prime

		  // set default bits
		  if(typeof(bits) === 'string') {
		    bits = parseInt(bits, 10);
		  }
		  bits = bits || 2048;

		  // create prng with api that matches BigInteger secure random
		  options = options || {};
		  var prng = options.prng || forge.random;
		  var rng = {
		    // x is an array to fill with bytes
		    nextBytes: function(x) {
		      var b = prng.getBytesSync(x.length);
		      for(var i = 0; i < x.length; ++i) {
		        x[i] = b.charCodeAt(i);
		      }
		    }
		  };

		  var algorithm = options.algorithm || 'PRIMEINC';

		  // create PRIMEINC algorithm state
		  var rval;
		  if(algorithm === 'PRIMEINC') {
		    rval = {
		      algorithm: algorithm,
		      state: 0,
		      bits: bits,
		      rng: rng,
		      eInt: e || 65537,
		      e: new BigInteger(null),
		      p: null,
		      q: null,
		      qBits: bits >> 1,
		      pBits: bits - (bits >> 1),
		      pqState: 0,
		      num: null,
		      keys: null
		    };
		    rval.e.fromInt(rval.eInt);
		  } else {
		    throw new Error('Invalid key generation algorithm: ' + algorithm);
		  }

		  return rval;
		};

		/**
		 * Attempts to runs the key-generation algorithm for at most n seconds
		 * (approximately) using the given state. When key-generation has completed,
		 * the keys will be stored in state.keys.
		 *
		 * To use this function to update a UI while generating a key or to prevent
		 * causing browser lockups/warnings, set "n" to a value other than 0. A
		 * simple pattern for generating a key and showing a progress indicator is:
		 *
		 * var state = pki.rsa.createKeyPairGenerationState(2048);
		 * var step = function() {
		 *   // step key-generation, run algorithm for 100 ms, repeat
		 *   if(!forge.pki.rsa.stepKeyPairGenerationState(state, 100)) {
		 *     setTimeout(step, 1);
		 *   } else {
		 *     // key-generation complete
		 *     // TODO: turn off progress indicator here
		 *     // TODO: use the generated key-pair in "state.keys"
		 *   }
		 * };
		 * // TODO: turn on progress indicator here
		 * setTimeout(step, 0);
		 *
		 * @param state the state to use.
		 * @param n the maximum number of milliseconds to run the algorithm for, 0
		 *          to run the algorithm to completion.
		 *
		 * @return true if the key-generation completed, false if not.
		 */
		pki.rsa.stepKeyPairGenerationState = function(state, n) {
		  // set default algorithm if not set
		  if(!('algorithm' in state)) {
		    state.algorithm = 'PRIMEINC';
		  }

		  // TODO: migrate step-based prime generation code to forge.prime
		  // TODO: abstract as PRIMEINC algorithm

		  // do key generation (based on Tom Wu's rsa.js, see jsbn.js license)
		  // with some minor optimizations and designed to run in steps

		  // local state vars
		  var THIRTY = new BigInteger(null);
		  THIRTY.fromInt(30);
		  var deltaIdx = 0;
		  var op_or = function(x,y) { return x|y; };

		  // keep stepping until time limit is reached or done
		  var t1 = +new Date();
		  var t2;
		  var total = 0;
		  while(state.keys === null && (n <= 0 || total < n)) {
		    // generate p or q
		    if(state.state === 0) {
		      /* Note: All primes are of the form:

		        30k+i, for i < 30 and gcd(30, i)=1, where there are 8 values for i

		        When we generate a random number, we always align it at 30k + 1. Each
		        time the number is determined not to be prime we add to get to the
		        next 'i', eg: if the number was at 30k + 1 we add 6. */
		      var bits = (state.p === null) ? state.pBits : state.qBits;
		      var bits1 = bits - 1;

		      // get a random number
		      if(state.pqState === 0) {
		        state.num = new BigInteger(bits, state.rng);
		        // force MSB set
		        if(!state.num.testBit(bits1)) {
		          state.num.bitwiseTo(
		            BigInteger.ONE.shiftLeft(bits1), op_or, state.num);
		        }
		        // align number on 30k+1 boundary
		        state.num.dAddOffset(31 - state.num.mod(THIRTY).byteValue(), 0);
		        deltaIdx = 0;

		        ++state.pqState;
		      } else if(state.pqState === 1) {
		        // try to make the number a prime
		        if(state.num.bitLength() > bits) {
		          // overflow, try again
		          state.pqState = 0;
		          // do primality test
		        } else if(state.num.isProbablePrime(
		          _getMillerRabinTests(state.num.bitLength()))) {
		          ++state.pqState;
		        } else {
		          // get next potential prime
		          state.num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);
		        }
		      } else if(state.pqState === 2) {
		        // ensure number is coprime with e
		        state.pqState =
		          (state.num.subtract(BigInteger.ONE).gcd(state.e)
		          .compareTo(BigInteger.ONE) === 0) ? 3 : 0;
		      } else if(state.pqState === 3) {
		        // store p or q
		        state.pqState = 0;
		        if(state.p === null) {
		          state.p = state.num;
		        } else {
		          state.q = state.num;
		        }

		        // advance state if both p and q are ready
		        if(state.p !== null && state.q !== null) {
		          ++state.state;
		        }
		        state.num = null;
		      }
		    } else if(state.state === 1) {
		      // ensure p is larger than q (swap them if not)
		      if(state.p.compareTo(state.q) < 0) {
		        state.num = state.p;
		        state.p = state.q;
		        state.q = state.num;
		      }
		      ++state.state;
		    } else if(state.state === 2) {
		      // compute phi: (p - 1)(q - 1) (Euler's totient function)
		      state.p1 = state.p.subtract(BigInteger.ONE);
		      state.q1 = state.q.subtract(BigInteger.ONE);
		      state.phi = state.p1.multiply(state.q1);
		      ++state.state;
		    } else if(state.state === 3) {
		      // ensure e and phi are coprime
		      if(state.phi.gcd(state.e).compareTo(BigInteger.ONE) === 0) {
		        // phi and e are coprime, advance
		        ++state.state;
		      } else {
		        // phi and e aren't coprime, so generate a new p and q
		        state.p = null;
		        state.q = null;
		        state.state = 0;
		      }
		    } else if(state.state === 4) {
		      // create n, ensure n is has the right number of bits
		      state.n = state.p.multiply(state.q);

		      // ensure n is right number of bits
		      if(state.n.bitLength() === state.bits) {
		        // success, advance
		        ++state.state;
		      } else {
		        // failed, get new q
		        state.q = null;
		        state.state = 0;
		      }
		    } else if(state.state === 5) {
		      // set keys
		      var d = state.e.modInverse(state.phi);
		      state.keys = {
		        privateKey: pki.rsa.setPrivateKey(
		          state.n, state.e, d, state.p, state.q,
		          d.mod(state.p1), d.mod(state.q1),
		          state.q.modInverse(state.p)),
		        publicKey: pki.rsa.setPublicKey(state.n, state.e)
		      };
		    }

		    // update timing
		    t2 = +new Date();
		    total += t2 - t1;
		    t1 = t2;
		  }

		  return state.keys !== null;
		};

		/**
		 * Generates an RSA public-private key pair in a single call.
		 *
		 * To generate a key-pair in steps (to allow for progress updates and to
		 * prevent blocking or warnings in slow browsers) then use the key-pair
		 * generation state functions.
		 *
		 * To generate a key-pair asynchronously (either through web-workers, if
		 * available, or by breaking up the work on the main thread), pass a
		 * callback function.
		 *
		 * @param [bits] the size for the private key in bits, defaults to 2048.
		 * @param [e] the public exponent to use, defaults to 65537.
		 * @param [options] options for key-pair generation, if given then 'bits'
		 *          and 'e' must *not* be given:
		 *          bits the size for the private key in bits, (default: 2048).
		 *          e the public exponent to use, (default: 65537 (0x10001)).
		 *          workerScript the worker script URL.
		 *          workers the number of web workers (if supported) to use,
		 *            (default: 2).
		 *          workLoad the size of the work load, ie: number of possible prime
		 *            numbers for each web worker to check per work assignment,
		 *            (default: 100).
		 *          e the public exponent to use, defaults to 65537.
		 *          prng a custom crypto-secure pseudo-random number generator to use,
		 *            that must define "getBytesSync".
		 *          algorithm the algorithm to use (default: 'PRIMEINC').
		 * @param [callback(err, keypair)] called once the operation completes.
		 *
		 * @return an object with privateKey and publicKey properties.
		 */
		pki.rsa.generateKeyPair = function(bits, e, options, callback) {
		  // (bits), (options), (callback)
		  if(arguments.length === 1) {
		    if(typeof bits === 'object') {
		      options = bits;
		      bits = undefined;
		    } else if(typeof bits === 'function') {
		      callback = bits;
		      bits = undefined;
		    }
		  } else if(arguments.length === 2) {
		    // (bits, e), (bits, options), (bits, callback), (options, callback)
		    if(typeof bits === 'number') {
		      if(typeof e === 'function') {
		        callback = e;
		        e = undefined;
		      } else if(typeof e !== 'number') {
		        options = e;
		        e = undefined;
		      }
		    } else {
		      options = bits;
		      callback = e;
		      bits = undefined;
		      e = undefined;
		    }
		  } else if(arguments.length === 3) {
		    // (bits, e, options), (bits, e, callback), (bits, options, callback)
		    if(typeof e === 'number') {
		      if(typeof options === 'function') {
		        callback = options;
		        options = undefined;
		      }
		    } else {
		      callback = options;
		      options = e;
		      e = undefined;
		    }
		  }
		  options = options || {};
		  if(bits === undefined) {
		    bits = options.bits || 2048;
		  }
		  if(e === undefined) {
		    e = options.e || 0x10001;
		  }
		  var state = pki.rsa.createKeyPairGenerationState(bits, e, options);
		  if(!callback) {
		    pki.rsa.stepKeyPairGenerationState(state, 0);
		    return state.keys;
		  }
		  _generateKeyPair(state, options, callback);
		};

		/**
		 * Sets an RSA public key from BigIntegers modulus and exponent.
		 *
		 * @param n the modulus.
		 * @param e the exponent.
		 *
		 * @return the public key.
		 */
		pki.setRsaPublicKey = pki.rsa.setPublicKey = function(n, e) {
		  var key = {
		    n: n,
		    e: e
		  };

		  /**
		   * Encrypts the given data with this public key. Newer applications
		   * should use the 'RSA-OAEP' decryption scheme, 'RSAES-PKCS1-V1_5' is for
		   * legacy applications.
		   *
		   * @param data the byte string to encrypt.
		   * @param scheme the encryption scheme to use:
		   *          'RSAES-PKCS1-V1_5' (default),
		   *          'RSA-OAEP',
		   *          'RAW', 'NONE', or null to perform raw RSA encryption,
		   *          an object with an 'encode' property set to a function
		   *          with the signature 'function(data, key)' that returns
		   *          a binary-encoded string representing the encoded data.
		   * @param schemeOptions any scheme-specific options.
		   *
		   * @return the encrypted byte string.
		   */
		  key.encrypt = function(data, scheme, schemeOptions) {
		    if(typeof scheme === 'string') {
		      scheme = scheme.toUpperCase();
		    } else if(scheme === undefined) {
		      scheme = 'RSAES-PKCS1-V1_5';
		    }

		    if(scheme === 'RSAES-PKCS1-V1_5') {
		      scheme = {
		        encode: function(m, key, pub) {
		          return _encodePkcs1_v1_5(m, key, 0x02).getBytes();
		        }
		      };
		    } else if(scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') {
		      scheme = {
		        encode: function(m, key) {
		          return forge.pkcs1.encode_rsa_oaep(key, m, schemeOptions);
		        }
		      };
		    } else if(['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) {
		      scheme = { encode: function(e) { return e; } };
		    } else if(typeof scheme === 'string') {
		      throw new Error('Unsupported encryption scheme: "' + scheme + '".');
		    }

		    // do scheme-based encoding then rsa encryption
		    var e = scheme.encode(data, key, true);
		    return pki.rsa.encrypt(e, key, true);
		  };

		  /**
		   * Verifies the given signature against the given digest.
		   *
		   * PKCS#1 supports multiple (currently two) signature schemes:
		   * RSASSA-PKCS1-V1_5 and RSASSA-PSS.
		   *
		   * By default this implementation uses the "old scheme", i.e.
		   * RSASSA-PKCS1-V1_5, in which case once RSA-decrypted, the
		   * signature is an OCTET STRING that holds a DigestInfo.
		   *
		   * DigestInfo ::= SEQUENCE {
		   *   digestAlgorithm DigestAlgorithmIdentifier,
		   *   digest Digest
		   * }
		   * DigestAlgorithmIdentifier ::= AlgorithmIdentifier
		   * Digest ::= OCTET STRING
		   *
		   * To perform PSS signature verification, provide an instance
		   * of Forge PSS object as the scheme parameter.
		   *
		   * @param digest the message digest hash to compare against the signature,
		   *          as a binary-encoded string.
		   * @param signature the signature to verify, as a binary-encoded string.
		   * @param scheme signature verification scheme to use:
		   *          'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5,
		   *          a Forge PSS object for RSASSA-PSS,
		   *          'NONE' or null for none, DigestInfo will not be expected, but
		   *            PKCS#1 v1.5 padding will still be used.
		   *
		   * @return true if the signature was verified, false if not.
		   */
		   key.verify = function(digest, signature, scheme) {
		     if(typeof scheme === 'string') {
		       scheme = scheme.toUpperCase();
		     } else if(scheme === undefined) {
		       scheme = 'RSASSA-PKCS1-V1_5';
		     }

		     if(scheme === 'RSASSA-PKCS1-V1_5') {
		       scheme = {
		         verify: function(digest, d) {
		           // remove padding
		           d = _decodePkcs1_v1_5(d, key, true);
		           // d is ASN.1 BER-encoded DigestInfo
		           var obj = asn1.fromDer(d);
		           // compare the given digest to the decrypted one
		           return digest === obj.value[1].value;
		         }
		       };
		     } else if(scheme === 'NONE' || scheme === 'NULL' || scheme === null) {
		       scheme = {
		         verify: function(digest, d) {
		           // remove padding
		           d = _decodePkcs1_v1_5(d, key, true);
		           return digest === d;
		         }
		       };
		     }

		     // do rsa decryption w/o any decoding, then verify -- which does decoding
		     var d = pki.rsa.decrypt(signature, key, true, false);
		     return scheme.verify(digest, d, key.n.bitLength());
		  };

		  return key;
		};

		/**
		 * Sets an RSA private key from BigIntegers modulus, exponent, primes,
		 * prime exponents, and modular multiplicative inverse.
		 *
		 * @param n the modulus.
		 * @param e the public exponent.
		 * @param d the private exponent ((inverse of e) mod n).
		 * @param p the first prime.
		 * @param q the second prime.
		 * @param dP exponent1 (d mod (p-1)).
		 * @param dQ exponent2 (d mod (q-1)).
		 * @param qInv ((inverse of q) mod p)
		 *
		 * @return the private key.
		 */
		pki.setRsaPrivateKey = pki.rsa.setPrivateKey = function(
		  n, e, d, p, q, dP, dQ, qInv) {
		  var key = {
		    n: n,
		    e: e,
		    d: d,
		    p: p,
		    q: q,
		    dP: dP,
		    dQ: dQ,
		    qInv: qInv
		  };

		  /**
		   * Decrypts the given data with this private key. The decryption scheme
		   * must match the one used to encrypt the data.
		   *
		   * @param data the byte string to decrypt.
		   * @param scheme the decryption scheme to use:
		   *          'RSAES-PKCS1-V1_5' (default),
		   *          'RSA-OAEP',
		   *          'RAW', 'NONE', or null to perform raw RSA decryption.
		   * @param schemeOptions any scheme-specific options.
		   *
		   * @return the decrypted byte string.
		   */
		  key.decrypt = function(data, scheme, schemeOptions) {
		    if(typeof scheme === 'string') {
		      scheme = scheme.toUpperCase();
		    } else if(scheme === undefined) {
		      scheme = 'RSAES-PKCS1-V1_5';
		    }

		    // do rsa decryption w/o any decoding
		    var d = pki.rsa.decrypt(data, key, false, false);

		    if(scheme === 'RSAES-PKCS1-V1_5') {
		      scheme = { decode: _decodePkcs1_v1_5 };
		    } else if(scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') {
		      scheme = {
		        decode: function(d, key) {
		          return forge.pkcs1.decode_rsa_oaep(key, d, schemeOptions);
		        }
		      };
		    } else if(['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) {
		      scheme = { decode: function(d) { return d; } };
		    } else {
		      throw new Error('Unsupported encryption scheme: "' + scheme + '".');
		    }

		    // decode according to scheme
		    return scheme.decode(d, key, false);
		  };

		  /**
		   * Signs the given digest, producing a signature.
		   *
		   * PKCS#1 supports multiple (currently two) signature schemes:
		   * RSASSA-PKCS1-V1_5 and RSASSA-PSS.
		   *
		   * By default this implementation uses the "old scheme", i.e.
		   * RSASSA-PKCS1-V1_5. In order to generate a PSS signature, provide
		   * an instance of Forge PSS object as the scheme parameter.
		   *
		   * @param md the message digest object with the hash to sign.
		   * @param scheme the signature scheme to use:
		   *          'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5,
		   *          a Forge PSS object for RSASSA-PSS,
		   *          'NONE' or null for none, DigestInfo will not be used but
		   *            PKCS#1 v1.5 padding will still be used.
		   *
		   * @return the signature as a byte string.
		   */
		  key.sign = function(md, scheme) {
		    /* Note: The internal implementation of RSA operations is being
		      transitioned away from a PKCS#1 v1.5 hard-coded scheme. Some legacy
		      code like the use of an encoding block identifier 'bt' will eventually
		      be removed. */

		    // private key operation
		    var bt = false;

		    if(typeof scheme === 'string') {
		      scheme = scheme.toUpperCase();
		    }

		    if(scheme === undefined || scheme === 'RSASSA-PKCS1-V1_5') {
		      scheme = { encode: emsaPkcs1v15encode };
		      bt = 0x01;
		    } else if(scheme === 'NONE' || scheme === 'NULL' || scheme === null) {
		      scheme = { encode: function() { return md; } };
		      bt = 0x01;
		    }

		    // encode and then encrypt
		    var d = scheme.encode(md, key.n.bitLength());
		    return pki.rsa.encrypt(d, key, bt);
		  };

		  return key;
		};

		/**
		 * Wraps an RSAPrivateKey ASN.1 object in an ASN.1 PrivateKeyInfo object.
		 *
		 * @param rsaKey the ASN.1 RSAPrivateKey.
		 *
		 * @return the ASN.1 PrivateKeyInfo.
		 */
		pki.wrapRsaPrivateKey = function(rsaKey) {
		  // PrivateKeyInfo
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // version (0)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      asn1.integerToDer(0).getBytes()),
		    // privateKeyAlgorithm
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(pki.oids.rsaEncryption).getBytes()),
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		    ]),
		    // PrivateKey
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		      asn1.toDer(rsaKey).getBytes())
		    ]);
		};

		/**
		 * Converts a private key from an ASN.1 object.
		 *
		 * @param obj the ASN.1 representation of a PrivateKeyInfo containing an
		 *          RSAPrivateKey or an RSAPrivateKey.
		 *
		 * @return the private key.
		 */
		pki.privateKeyFromAsn1 = function(obj) {
		  // get PrivateKeyInfo
		  var capture = {};
		  var errors = [];
		  if(asn1.validate(obj, privateKeyValidator, capture, errors)) {
		    obj = asn1.fromDer(forge.util.createBuffer(capture.privateKey));
		  }

		  // get RSAPrivateKey
		  capture = {};
		  errors = [];
		  if(!asn1.validate(obj, rsaPrivateKeyValidator, capture, errors)) {
		    var error = new Error('Cannot read private key. ' +
		      'ASN.1 object does not contain an RSAPrivateKey.');
		    error.errors = errors;
		    throw error;
		  }

		  // Note: Version is currently ignored.
		  // capture.privateKeyVersion
		  // FIXME: inefficient, get a BigInteger that uses byte strings
		  var n, e, d, p, q, dP, dQ, qInv;
		  n = forge.util.createBuffer(capture.privateKeyModulus).toHex();
		  e = forge.util.createBuffer(capture.privateKeyPublicExponent).toHex();
		  d = forge.util.createBuffer(capture.privateKeyPrivateExponent).toHex();
		  p = forge.util.createBuffer(capture.privateKeyPrime1).toHex();
		  q = forge.util.createBuffer(capture.privateKeyPrime2).toHex();
		  dP = forge.util.createBuffer(capture.privateKeyExponent1).toHex();
		  dQ = forge.util.createBuffer(capture.privateKeyExponent2).toHex();
		  qInv = forge.util.createBuffer(capture.privateKeyCoefficient).toHex();

		  // set private key
		  return pki.setRsaPrivateKey(
		    new BigInteger(n, 16),
		    new BigInteger(e, 16),
		    new BigInteger(d, 16),
		    new BigInteger(p, 16),
		    new BigInteger(q, 16),
		    new BigInteger(dP, 16),
		    new BigInteger(dQ, 16),
		    new BigInteger(qInv, 16));
		};

		/**
		 * Converts a private key to an ASN.1 RSAPrivateKey.
		 *
		 * @param key the private key.
		 *
		 * @return the ASN.1 representation of an RSAPrivateKey.
		 */
		pki.privateKeyToAsn1 = pki.privateKeyToRSAPrivateKey = function(key) {
		  // RSAPrivateKey
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // version (0 = only 2 primes, 1 multiple primes)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      asn1.integerToDer(0).getBytes()),
		    // modulus (n)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.n)),
		    // publicExponent (e)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.e)),
		    // privateExponent (d)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.d)),
		    // privateKeyPrime1 (p)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.p)),
		    // privateKeyPrime2 (q)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.q)),
		    // privateKeyExponent1 (dP)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.dP)),
		    // privateKeyExponent2 (dQ)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.dQ)),
		    // coefficient (qInv)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.qInv))
		  ]);
		};

		/**
		 * Converts a public key from an ASN.1 SubjectPublicKeyInfo or RSAPublicKey.
		 *
		 * @param obj the asn1 representation of a SubjectPublicKeyInfo or RSAPublicKey.
		 *
		 * @return the public key.
		 */
		pki.publicKeyFromAsn1 = function(obj) {
		  // get SubjectPublicKeyInfo
		  var capture = {};
		  var errors = [];
		  if(asn1.validate(obj, publicKeyValidator, capture, errors)) {
		    // get oid
		    var oid = asn1.derToOid(capture.publicKeyOid);
		    if(oid !== pki.oids.rsaEncryption) {
		      var error = new Error('Cannot read public key. Unknown OID.');
		      error.oid = oid;
		      throw error;
		    }
		    obj = capture.rsaPublicKey;
		  }

		  // get RSA params
		  errors = [];
		  if(!asn1.validate(obj, rsaPublicKeyValidator, capture, errors)) {
		    var error = new Error('Cannot read public key. ' +
		      'ASN.1 object does not contain an RSAPublicKey.');
		    error.errors = errors;
		    throw error;
		  }

		  // FIXME: inefficient, get a BigInteger that uses byte strings
		  var n = forge.util.createBuffer(capture.publicKeyModulus).toHex();
		  var e = forge.util.createBuffer(capture.publicKeyExponent).toHex();

		  // set public key
		  return pki.setRsaPublicKey(
		    new BigInteger(n, 16),
		    new BigInteger(e, 16));
		};

		/**
		 * Converts a public key to an ASN.1 SubjectPublicKeyInfo.
		 *
		 * @param key the public key.
		 *
		 * @return the asn1 representation of a SubjectPublicKeyInfo.
		 */
		pki.publicKeyToAsn1 = pki.publicKeyToSubjectPublicKeyInfo = function(key) {
		  // SubjectPublicKeyInfo
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // AlgorithmIdentifier
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(pki.oids.rsaEncryption).getBytes()),
		      // parameters (null)
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		    ]),
		    // subjectPublicKey
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, [
		      pki.publicKeyToRSAPublicKey(key)
		    ])
		  ]);
		};

		/**
		 * Converts a public key to an ASN.1 RSAPublicKey.
		 *
		 * @param key the public key.
		 *
		 * @return the asn1 representation of a RSAPublicKey.
		 */
		pki.publicKeyToRSAPublicKey = function(key) {
		  // RSAPublicKey
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // modulus (n)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.n)),
		    // publicExponent (e)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      _bnToBytes(key.e))
		  ]);
		};

		/**
		 * Encodes a message using PKCS#1 v1.5 padding.
		 *
		 * @param m the message to encode.
		 * @param key the RSA key to use.
		 * @param bt the block type to use, i.e. either 0x01 (for signing) or 0x02
		 *          (for encryption).
		 *
		 * @return the padded byte buffer.
		 */
		function _encodePkcs1_v1_5(m, key, bt) {
		  var eb = forge.util.createBuffer();

		  // get the length of the modulus in bytes
		  var k = Math.ceil(key.n.bitLength() / 8);

		  /* use PKCS#1 v1.5 padding */
		  if(m.length > (k - 11)) {
		    var error = new Error('Message is too long for PKCS#1 v1.5 padding.');
		    error.length = m.length;
		    error.max = k - 11;
		    throw error;
		  }

		  /* A block type BT, a padding string PS, and the data D shall be
		    formatted into an octet string EB, the encryption block:

		    EB = 00 || BT || PS || 00 || D

		    The block type BT shall be a single octet indicating the structure of
		    the encryption block. For this version of the document it shall have
		    value 00, 01, or 02. For a private-key operation, the block type
		    shall be 00 or 01. For a public-key operation, it shall be 02.

		    The padding string PS shall consist of k-3-||D|| octets. For block
		    type 00, the octets shall have value 00; for block type 01, they
		    shall have value FF; and for block type 02, they shall be
		    pseudorandomly generated and nonzero. This makes the length of the
		    encryption block EB equal to k. */

		  // build the encryption block
		  eb.putByte(0x00);
		  eb.putByte(bt);

		  // create the padding
		  var padNum = k - 3 - m.length;
		  var padByte;
		  // private key op
		  if(bt === 0x00 || bt === 0x01) {
		    padByte = (bt === 0x00) ? 0x00 : 0xFF;
		    for(var i = 0; i < padNum; ++i) {
		      eb.putByte(padByte);
		    }
		  } else {
		    // public key op
		    // pad with random non-zero values
		    while(padNum > 0) {
		      var numZeros = 0;
		      var padBytes = forge.random.getBytes(padNum);
		      for(var i = 0; i < padNum; ++i) {
		        padByte = padBytes.charCodeAt(i);
		        if(padByte === 0) {
		          ++numZeros;
		        } else {
		          eb.putByte(padByte);
		        }
		      }
		      padNum = numZeros;
		    }
		  }

		  // zero followed by message
		  eb.putByte(0x00);
		  eb.putBytes(m);

		  return eb;
		}

		/**
		 * Decodes a message using PKCS#1 v1.5 padding.
		 *
		 * @param em the message to decode.
		 * @param key the RSA key to use.
		 * @param pub true if the key is a public key, false if it is private.
		 * @param ml the message length, if specified.
		 *
		 * @return the decoded bytes.
		 */
		function _decodePkcs1_v1_5(em, key, pub, ml) {
		  // get the length of the modulus in bytes
		  var k = Math.ceil(key.n.bitLength() / 8);

		  /* It is an error if any of the following conditions occurs:

		    1. The encryption block EB cannot be parsed unambiguously.
		    2. The padding string PS consists of fewer than eight octets
		      or is inconsisent with the block type BT.
		    3. The decryption process is a public-key operation and the block
		      type BT is not 00 or 01, or the decryption process is a
		      private-key operation and the block type is not 02.
		   */

		  // parse the encryption block
		  var eb = forge.util.createBuffer(em);
		  var first = eb.getByte();
		  var bt = eb.getByte();
		  if(first !== 0x00 ||
		    (pub && bt !== 0x00 && bt !== 0x01) ||
		    (!pub && bt != 0x02) ||
		    (pub && bt === 0x00 && typeof(ml) === 'undefined')) {
		    throw new Error('Encryption block is invalid.');
		  }

		  var padNum = 0;
		  if(bt === 0x00) {
		    // check all padding bytes for 0x00
		    padNum = k - 3 - ml;
		    for(var i = 0; i < padNum; ++i) {
		      if(eb.getByte() !== 0x00) {
		        throw new Error('Encryption block is invalid.');
		      }
		    }
		  } else if(bt === 0x01) {
		    // find the first byte that isn't 0xFF, should be after all padding
		    padNum = 0;
		    while(eb.length() > 1) {
		      if(eb.getByte() !== 0xFF) {
		        --eb.read;
		        break;
		      }
		      ++padNum;
		    }
		  } else if(bt === 0x02) {
		    // look for 0x00 byte
		    padNum = 0;
		    while(eb.length() > 1) {
		      if(eb.getByte() === 0x00) {
		        --eb.read;
		        break;
		      }
		      ++padNum;
		    }
		  }

		  // zero must be 0x00 and padNum must be (k - 3 - message length)
		  var zero = eb.getByte();
		  if(zero !== 0x00 || padNum !== (k - 3 - eb.length())) {
		    throw new Error('Encryption block is invalid.');
		  }

		  return eb.getBytes();
		}

		/**
		 * Runs the key-generation algorithm asynchronously, either in the background
		 * via Web Workers, or using the main thread and setImmediate.
		 *
		 * @param state the key-pair generation state.
		 * @param [options] options for key-pair generation:
		 *          workerScript the worker script URL.
		 *          workers the number of web workers (if supported) to use,
		 *            (default: 2, -1 to use estimated cores minus one).
		 *          workLoad the size of the work load, ie: number of possible prime
		 *            numbers for each web worker to check per work assignment,
		 *            (default: 100).
		 * @param callback(err, keypair) called once the operation completes.
		 */
		function _generateKeyPair(state, options, callback) {
		  if(typeof options === 'function') {
		    callback = options;
		    options = {};
		  }
		  options = options || {};

		  var opts = {
		    algorithm: {
		      name: options.algorithm || 'PRIMEINC',
		      options: {
		        workers: options.workers || 2,
		        workLoad: options.workLoad || 100,
		        workerScript: options.workerScript
		      }
		    }
		  };
		  if('prng' in options) {
		    opts.prng = options.prng;
		  }

		  generate();

		  function generate() {
		    // find p and then q (done in series to simplify)
		    getPrime(state.pBits, function(err, num) {
		      if(err) {
		        return callback(err);
		      }
		      state.p = num;
		      if(state.q !== null) {
		        return finish(err, state.q);
		      }
		      getPrime(state.qBits, finish);
		    });
		  }

		  function getPrime(bits, callback) {
		    forge.prime.generateProbablePrime(bits, opts, callback);
		  }

		  function finish(err, num) {
		    if(err) {
		      return callback(err);
		    }

		    // set q
		    state.q = num;

		    // ensure p is larger than q (swap them if not)
		    if(state.p.compareTo(state.q) < 0) {
		      var tmp = state.p;
		      state.p = state.q;
		      state.q = tmp;
		    }

		    // ensure p is coprime with e
		    if(state.p.subtract(BigInteger.ONE).gcd(state.e)
		      .compareTo(BigInteger.ONE) !== 0) {
		      state.p = null;
		      generate();
		      return;
		    }

		    // ensure q is coprime with e
		    if(state.q.subtract(BigInteger.ONE).gcd(state.e)
		      .compareTo(BigInteger.ONE) !== 0) {
		      state.q = null;
		      getPrime(state.qBits, finish);
		      return;
		    }

		    // compute phi: (p - 1)(q - 1) (Euler's totient function)
		    state.p1 = state.p.subtract(BigInteger.ONE);
		    state.q1 = state.q.subtract(BigInteger.ONE);
		    state.phi = state.p1.multiply(state.q1);

		    // ensure e and phi are coprime
		    if(state.phi.gcd(state.e).compareTo(BigInteger.ONE) !== 0) {
		      // phi and e aren't coprime, so generate a new p and q
		      state.p = state.q = null;
		      generate();
		      return;
		    }

		    // create n, ensure n is has the right number of bits
		    state.n = state.p.multiply(state.q);
		    if(state.n.bitLength() !== state.bits) {
		      // failed, get new q
		      state.q = null;
		      getPrime(state.qBits, finish);
		      return;
		    }

		    // set keys
		    var d = state.e.modInverse(state.phi);
		    state.keys = {
		      privateKey: pki.rsa.setPrivateKey(
		        state.n, state.e, d, state.p, state.q,
		        d.mod(state.p1), d.mod(state.q1),
		        state.q.modInverse(state.p)),
		      publicKey: pki.rsa.setPublicKey(state.n, state.e)
		    };

		    callback(null, state.keys);
		  }
		}

		/**
		 * Converts a positive BigInteger into 2's-complement big-endian bytes.
		 *
		 * @param b the big integer to convert.
		 *
		 * @return the bytes.
		 */
		function _bnToBytes(b) {
		  // prepend 0x00 if first byte >= 0x80
		  var hex = b.toString(16);
		  if(hex[0] >= '8') {
		    hex = '00' + hex;
		  }
		  return forge.util.hexToBytes(hex);
		}

		/**
		 * Returns the required number of Miller-Rabin tests to generate a
		 * prime with an error probability of (1/2)^80.
		 *
		 * See Handbook of Applied Cryptography Chapter 4, Table 4.4.
		 *
		 * @param bits the bit size.
		 *
		 * @return the required number of iterations.
		 */
		function _getMillerRabinTests(bits) {
		  if(bits <= 100) return 27;
		  if(bits <= 150) return 18;
		  if(bits <= 200) return 15;
		  if(bits <= 250) return 12;
		  if(bits <= 300) return 9;
		  if(bits <= 350) return 8;
		  if(bits <= 400) return 7;
		  if(bits <= 500) return 6;
		  if(bits <= 600) return 5;
		  if(bits <= 800) return 4;
		  if(bits <= 1250) return 3;
		  return 2;
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'rsa';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/rsa',[
		  'require',
		  'module',
		  './asn1',
		  './jsbn',
		  './oids',
		  './pkcs1',
		  './prime',
		  './random',
		  './util'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Password-based encryption functions.
		 *
		 * @author Dave Longley
		 * @author Stefan Siegl <stesie@brokenpipe.de>
		 *
		 * Copyright (c) 2010-2013 Digital Bazaar, Inc.
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 *
		 * An EncryptedPrivateKeyInfo:
		 *
		 * EncryptedPrivateKeyInfo ::= SEQUENCE {
		 *   encryptionAlgorithm  EncryptionAlgorithmIdentifier,
		 *   encryptedData        EncryptedData }
		 *
		 * EncryptionAlgorithmIdentifier ::= AlgorithmIdentifier
		 *
		 * EncryptedData ::= OCTET STRING
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		if(typeof BigInteger === 'undefined') {
		  var BigInteger = forge.jsbn.BigInteger;
		}

		// shortcut for asn.1 API
		var asn1 = forge.asn1;

		/* Password-based encryption implementation. */
		var pki = forge.pki = forge.pki || {};
		pki.pbe = forge.pbe = forge.pbe || {};
		var oids = pki.oids;

		// validator for an EncryptedPrivateKeyInfo structure
		// Note: Currently only works w/algorithm params
		var encryptedPrivateKeyValidator = {
		  name: 'EncryptedPrivateKeyInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'EncryptedPrivateKeyInfo.encryptionAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'AlgorithmIdentifier.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'encryptionOid'
		    }, {
		      name: 'AlgorithmIdentifier.parameters',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      captureAsn1: 'encryptionParams'
		    }]
		  }, {
		    // encryptedData
		    name: 'EncryptedPrivateKeyInfo.encryptedData',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OCTETSTRING,
		    constructed: false,
		    capture: 'encryptedData'
		  }]
		};

		// validator for a PBES2Algorithms structure
		// Note: Currently only works w/PBKDF2 + AES encryption schemes
		var PBES2AlgorithmsValidator = {
		  name: 'PBES2Algorithms',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'PBES2Algorithms.keyDerivationFunc',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'PBES2Algorithms.keyDerivationFunc.oid',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'kdfOid'
		    }, {
		      name: 'PBES2Algorithms.params',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      value: [{
		        name: 'PBES2Algorithms.params.salt',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.OCTETSTRING,
		        constructed: false,
		        capture: 'kdfSalt'
		      }, {
		        name: 'PBES2Algorithms.params.iterationCount',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.INTEGER,
		        onstructed: true,
		        capture: 'kdfIterationCount'
		      }]
		    }]
		  }, {
		    name: 'PBES2Algorithms.encryptionScheme',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'PBES2Algorithms.encryptionScheme.oid',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'encOid'
		    }, {
		      name: 'PBES2Algorithms.encryptionScheme.iv',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OCTETSTRING,
		      constructed: false,
		      capture: 'encIv'
		    }]
		  }]
		};

		var pkcs12PbeParamsValidator = {
		  name: 'pkcs-12PbeParams',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'pkcs-12PbeParams.salt',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OCTETSTRING,
		    constructed: false,
		    capture: 'salt'
		  }, {
		    name: 'pkcs-12PbeParams.iterations',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'iterations'
		  }]
		};

		/**
		 * Encrypts a ASN.1 PrivateKeyInfo object, producing an EncryptedPrivateKeyInfo.
		 *
		 * PBES2Algorithms ALGORITHM-IDENTIFIER ::=
		 *   { {PBES2-params IDENTIFIED BY id-PBES2}, ...}
		 *
		 * id-PBES2 OBJECT IDENTIFIER ::= {pkcs-5 13}
		 *
		 * PBES2-params ::= SEQUENCE {
		 *   keyDerivationFunc AlgorithmIdentifier {{PBES2-KDFs}},
		 *   encryptionScheme AlgorithmIdentifier {{PBES2-Encs}}
		 * }
		 *
		 * PBES2-KDFs ALGORITHM-IDENTIFIER ::=
		 *   { {PBKDF2-params IDENTIFIED BY id-PBKDF2}, ... }
		 *
		 * PBES2-Encs ALGORITHM-IDENTIFIER ::= { ... }
		 *
		 * PBKDF2-params ::= SEQUENCE {
		 *   salt CHOICE {
		 *     specified OCTET STRING,
		 *     otherSource AlgorithmIdentifier {{PBKDF2-SaltSources}}
		 *   },
		 *   iterationCount INTEGER (1..MAX),
		 *   keyLength INTEGER (1..MAX) OPTIONAL,
		 *   prf AlgorithmIdentifier {{PBKDF2-PRFs}} DEFAULT algid-hmacWithSHA1
		 * }
		 *
		 * @param obj the ASN.1 PrivateKeyInfo object.
		 * @param password the password to encrypt with.
		 * @param options:
		 *          algorithm the encryption algorithm to use
		 *            ('aes128', 'aes192', 'aes256', '3des'), defaults to 'aes128'.
		 *          count the iteration count to use.
		 *          saltSize the salt size to use.
		 *
		 * @return the ASN.1 EncryptedPrivateKeyInfo.
		 */
		pki.encryptPrivateKeyInfo = function(obj, password, options) {
		  // set default options
		  options = options || {};
		  options.saltSize = options.saltSize || 8;
		  options.count = options.count || 2048;
		  options.algorithm = options.algorithm || 'aes128';

		  // generate PBE params
		  var salt = forge.random.getBytesSync(options.saltSize);
		  var count = options.count;
		  var countBytes = asn1.integerToDer(count);
		  var dkLen;
		  var encryptionAlgorithm;
		  var encryptedData;
		  if(options.algorithm.indexOf('aes') === 0 || options.algorithm === 'des') {
		    // Do PBES2
		    var ivLen, encOid, cipherFn;
		    switch(options.algorithm) {
		    case 'aes128':
		      dkLen = 16;
		      ivLen = 16;
		      encOid = oids['aes128-CBC'];
		      cipherFn = forge.aes.createEncryptionCipher;
		      break;
		    case 'aes192':
		      dkLen = 24;
		      ivLen = 16;
		      encOid = oids['aes192-CBC'];
		      cipherFn = forge.aes.createEncryptionCipher;
		      break;
		    case 'aes256':
		      dkLen = 32;
		      ivLen = 16;
		      encOid = oids['aes256-CBC'];
		      cipherFn = forge.aes.createEncryptionCipher;
		      break;
		    case 'des':
		      dkLen = 8;
		      ivLen = 8;
		      encOid = oids['desCBC'];
		      cipherFn = forge.des.createEncryptionCipher;
		      break;
		    default:
		      var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.');
		      error.algorithm = options.algorithm;
		      throw error;
		    }

		    // encrypt private key using pbe SHA-1 and AES/DES
		    var dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen);
		    var iv = forge.random.getBytesSync(ivLen);
		    var cipher = cipherFn(dk);
		    cipher.start(iv);
		    cipher.update(asn1.toDer(obj));
		    cipher.finish();
		    encryptedData = cipher.output.getBytes();

		    encryptionAlgorithm = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(oids['pkcs5PBES2']).getBytes()),
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // keyDerivationFunc
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(oids['pkcs5PBKDF2']).getBytes()),
		          // PBKDF2-params
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		            // salt
		            asn1.create(
		              asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt),
		            // iteration count
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		              countBytes.getBytes())
		          ])
		        ]),
		        // encryptionScheme
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(encOid).getBytes()),
		          // iv
		          asn1.create(
		            asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, iv)
		        ])
		      ])
		    ]);
		  } else if(options.algorithm === '3des') {
		    // Do PKCS12 PBE
		    dkLen = 24;

		    var saltBytes = new forge.util.ByteBuffer(salt);
		    var dk = pki.pbe.generatePkcs12Key(password, saltBytes, 1, count, dkLen);
		    var iv = pki.pbe.generatePkcs12Key(password, saltBytes, 2, count, dkLen);
		    var cipher = forge.des.createEncryptionCipher(dk);
		    cipher.start(iv);
		    cipher.update(asn1.toDer(obj));
		    cipher.finish();
		    encryptedData = cipher.output.getBytes();

		    encryptionAlgorithm = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(oids['pbeWithSHAAnd3-KeyTripleDES-CBC']).getBytes()),
		      // pkcs-12PbeParams
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // salt
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt),
		        // iteration count
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		          countBytes.getBytes())
		      ])
		    ]);
		  } else {
		    var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.');
		    error.algorithm = options.algorithm;
		    throw error;
		  }

		  // EncryptedPrivateKeyInfo
		  var rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // encryptionAlgorithm
		    encryptionAlgorithm,
		    // encryptedData
		    asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, encryptedData)
		  ]);
		  return rval;
		};

		/**
		 * Decrypts a ASN.1 PrivateKeyInfo object.
		 *
		 * @param obj the ASN.1 EncryptedPrivateKeyInfo object.
		 * @param password the password to decrypt with.
		 *
		 * @return the ASN.1 PrivateKeyInfo on success, null on failure.
		 */
		pki.decryptPrivateKeyInfo = function(obj, password) {
		  var rval = null;

		  // get PBE params
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, encryptedPrivateKeyValidator, capture, errors)) {
		    var error = new Error('Cannot read encrypted private key. ' +
		      'ASN.1 object is not a supported EncryptedPrivateKeyInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  // get cipher
		  var oid = asn1.derToOid(capture.encryptionOid);
		  var cipher = pki.pbe.getCipher(oid, capture.encryptionParams, password);

		  // get encrypted data
		  var encrypted = forge.util.createBuffer(capture.encryptedData);

		  cipher.update(encrypted);
		  if(cipher.finish()) {
		    rval = asn1.fromDer(cipher.output);
		  }

		  return rval;
		};

		/**
		 * Converts a EncryptedPrivateKeyInfo to PEM format.
		 *
		 * @param epki the EncryptedPrivateKeyInfo.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted encrypted private key.
		 */
		pki.encryptedPrivateKeyToPem = function(epki, maxline) {
		  // convert to DER, then PEM-encode
		  var msg = {
		    type: 'ENCRYPTED PRIVATE KEY',
		    body: asn1.toDer(epki).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		/**
		 * Converts a PEM-encoded EncryptedPrivateKeyInfo to ASN.1 format. Decryption
		 * is not performed.
		 *
		 * @param pem the EncryptedPrivateKeyInfo in PEM-format.
		 *
		 * @return the ASN.1 EncryptedPrivateKeyInfo.
		 */
		pki.encryptedPrivateKeyFromPem = function(pem) {
		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'ENCRYPTED PRIVATE KEY') {
		    var error = new Error('Could not convert encrypted private key from PEM; ' +
		      'PEM header type is "ENCRYPTED PRIVATE KEY".');
		    error.headerType = msg.type;
		    throw error;
		  }
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert encrypted private key from PEM; ' +
		      'PEM is encrypted.');
		  }

		  // convert DER to ASN.1 object
		  return asn1.fromDer(msg.body);
		};

		/**
		 * Encrypts an RSA private key. By default, the key will be wrapped in
		 * a PrivateKeyInfo and encrypted to produce a PKCS#8 EncryptedPrivateKeyInfo.
		 * This is the standard, preferred way to encrypt a private key.
		 *
		 * To produce a non-standard PEM-encrypted private key that uses encapsulated
		 * headers to indicate the encryption algorithm (old-style non-PKCS#8 OpenSSL
		 * private key encryption), set the 'legacy' option to true. Note: Using this
		 * option will cause the iteration count to be forced to 1.
		 *
		 * Note: The 'des' algorithm is supported, but it is not considered to be
		 * secure because it only uses a single 56-bit key. If possible, it is highly
		 * recommended that a different algorithm be used.
		 *
		 * @param rsaKey the RSA key to encrypt.
		 * @param password the password to use.
		 * @param options:
		 *          algorithm: the encryption algorithm to use
		 *            ('aes128', 'aes192', 'aes256', '3des', 'des').
		 *          count: the iteration count to use.
		 *          saltSize: the salt size to use.
		 *          legacy: output an old non-PKCS#8 PEM-encrypted+encapsulated
		 *            headers (DEK-Info) private key.
		 *
		 * @return the PEM-encoded ASN.1 EncryptedPrivateKeyInfo.
		 */
		pki.encryptRsaPrivateKey = function(rsaKey, password, options) {
		  // standard PKCS#8
		  options = options || {};
		  if(!options.legacy) {
		    // encrypt PrivateKeyInfo
		    var rval = pki.wrapRsaPrivateKey(pki.privateKeyToAsn1(rsaKey));
		    rval = pki.encryptPrivateKeyInfo(rval, password, options);
		    return pki.encryptedPrivateKeyToPem(rval);
		  }

		  // legacy non-PKCS#8
		  var algorithm;
		  var iv;
		  var dkLen;
		  var cipherFn;
		  switch(options.algorithm) {
		  case 'aes128':
		    algorithm = 'AES-128-CBC';
		    dkLen = 16;
		    iv = forge.random.getBytesSync(16);
		    cipherFn = forge.aes.createEncryptionCipher;
		    break;
		  case 'aes192':
		    algorithm = 'AES-192-CBC';
		    dkLen = 24;
		    iv = forge.random.getBytesSync(16);
		    cipherFn = forge.aes.createEncryptionCipher;
		    break;
		  case 'aes256':
		    algorithm = 'AES-256-CBC';
		    dkLen = 32;
		    iv = forge.random.getBytesSync(16);
		    cipherFn = forge.aes.createEncryptionCipher;
		    break;
		  case '3des':
		    algorithm = 'DES-EDE3-CBC';
		    dkLen = 24;
		    iv = forge.random.getBytesSync(8);
		    cipherFn = forge.des.createEncryptionCipher;
		    break;
		  case 'des':
		    algorithm = 'DES-CBC';
		    dkLen = 8;
		    iv = forge.random.getBytesSync(8);
		    cipherFn = forge.des.createEncryptionCipher;
		    break;
		  default:
		    var error = new Error('Could not encrypt RSA private key; unsupported ' +
		      'encryption algorithm "' + options.algorithm + '".');
		    error.algorithm = options.algorithm;
		    throw error;
		  }

		  // encrypt private key using OpenSSL legacy key derivation
		  var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen);
		  var cipher = cipherFn(dk);
		  cipher.start(iv);
		  cipher.update(asn1.toDer(pki.privateKeyToAsn1(rsaKey)));
		  cipher.finish();

		  var msg = {
		    type: 'RSA PRIVATE KEY',
		    procType: {
		      version: '4',
		      type: 'ENCRYPTED'
		    },
		    dekInfo: {
		      algorithm: algorithm,
		      parameters: forge.util.bytesToHex(iv).toUpperCase()
		    },
		    body: cipher.output.getBytes()
		  };
		  return forge.pem.encode(msg);
		};

		/**
		 * Decrypts an RSA private key.
		 *
		 * @param pem the PEM-formatted EncryptedPrivateKeyInfo to decrypt.
		 * @param password the password to use.
		 *
		 * @return the RSA key on success, null on failure.
		 */
		pki.decryptRsaPrivateKey = function(pem, password) {
		  var rval = null;

		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'ENCRYPTED PRIVATE KEY' &&
		    msg.type !== 'PRIVATE KEY' &&
		    msg.type !== 'RSA PRIVATE KEY') {
		    var error = new Error('Could not convert private key from PEM; PEM header type ' +
		      'is not "ENCRYPTED PRIVATE KEY", "PRIVATE KEY", or "RSA PRIVATE KEY".');
		    error.headerType = error;
		    throw error;
		  }

		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    var dkLen;
		    var cipherFn;
		    switch(msg.dekInfo.algorithm) {
		    case 'DES-CBC':
		      dkLen = 8;
		      cipherFn = forge.des.createDecryptionCipher;
		      break;
		    case 'DES-EDE3-CBC':
		      dkLen = 24;
		      cipherFn = forge.des.createDecryptionCipher;
		      break;
		    case 'AES-128-CBC':
		      dkLen = 16;
		      cipherFn = forge.aes.createDecryptionCipher;
		      break;
		    case 'AES-192-CBC':
		      dkLen = 24;
		      cipherFn = forge.aes.createDecryptionCipher;
		      break;
		    case 'AES-256-CBC':
		      dkLen = 32;
		      cipherFn = forge.aes.createDecryptionCipher;
		      break;
		    case 'RC2-40-CBC':
		      dkLen = 5;
		      cipherFn = function(key) {
		        return forge.rc2.createDecryptionCipher(key, 40);
		      };
		      break;
		    case 'RC2-64-CBC':
		      dkLen = 8;
		      cipherFn = function(key) {
		        return forge.rc2.createDecryptionCipher(key, 64);
		      };
		      break;
		    case 'RC2-128-CBC':
		      dkLen = 16;
		      cipherFn = function(key) {
		        return forge.rc2.createDecryptionCipher(key, 128);
		      };
		      break;
		    default:
		      var error = new Error('Could not decrypt private key; unsupported ' +
		        'encryption algorithm "' + msg.dekInfo.algorithm + '".');
		      error.algorithm = msg.dekInfo.algorithm;
		      throw error;
		    }

		    // use OpenSSL legacy key derivation
		    var iv = forge.util.hexToBytes(msg.dekInfo.parameters);
		    var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen);
		    var cipher = cipherFn(dk);
		    cipher.start(iv);
		    cipher.update(forge.util.createBuffer(msg.body));
		    if(cipher.finish()) {
		      rval = cipher.output.getBytes();
		    } else {
		      return rval;
		    }
		  } else {
		    rval = msg.body;
		  }

		  if(msg.type === 'ENCRYPTED PRIVATE KEY') {
		    rval = pki.decryptPrivateKeyInfo(asn1.fromDer(rval), password);
		  } else {
		    // decryption already performed above
		    rval = asn1.fromDer(rval);
		  }

		  if(rval !== null) {
		    rval = pki.privateKeyFromAsn1(rval);
		  }

		  return rval;
		};

		/**
		 * Derives a PKCS#12 key.
		 *
		 * @param password the password to derive the key material from, null or
		 *          undefined for none.
		 * @param salt the salt, as a ByteBuffer, to use.
		 * @param id the PKCS#12 ID byte (1 = key material, 2 = IV, 3 = MAC).
		 * @param iter the iteration count.
		 * @param n the number of bytes to derive from the password.
		 * @param md the message digest to use, defaults to SHA-1.
		 *
		 * @return a ByteBuffer with the bytes derived from the password.
		 */
		pki.pbe.generatePkcs12Key = function(password, salt, id, iter, n, md) {
		  var j, l;

		  if(typeof md === 'undefined' || md === null) {
		    md = forge.md.sha1.create();
		  }

		  var u = md.digestLength;
		  var v = md.blockLength;
		  var result = new forge.util.ByteBuffer();

		  /* Convert password to Unicode byte buffer + trailing 0-byte. */
		  var passBuf = new forge.util.ByteBuffer();
		  if(password !== null && password !== undefined) {
		    for(l = 0; l < password.length; l++) {
		      passBuf.putInt16(password.charCodeAt(l));
		    }
		    passBuf.putInt16(0);
		  }

		  /* Length of salt and password in BYTES. */
		  var p = passBuf.length();
		  var s = salt.length();

		  /* 1. Construct a string, D (the "diversifier"), by concatenating
		        v copies of ID. */
		  var D = new forge.util.ByteBuffer();
		  D.fillWithByte(id, v);

		  /* 2. Concatenate copies of the salt together to create a string S of length
		        v * ceil(s / v) bytes (the final copy of the salt may be trunacted
		        to create S).
		        Note that if the salt is the empty string, then so is S. */
		  var Slen = v * Math.ceil(s / v);
		  var S = new forge.util.ByteBuffer();
		  for(l = 0; l < Slen; l ++) {
		    S.putByte(salt.at(l % s));
		  }

		  /* 3. Concatenate copies of the password together to create a string P of
		        length v * ceil(p / v) bytes (the final copy of the password may be
		        truncated to create P).
		        Note that if the password is the empty string, then so is P. */
		  var Plen = v * Math.ceil(p / v);
		  var P = new forge.util.ByteBuffer();
		  for(l = 0; l < Plen; l ++) {
		    P.putByte(passBuf.at(l % p));
		  }

		  /* 4. Set I=S||P to be the concatenation of S and P. */
		  var I = S;
		  I.putBuffer(P);

		  /* 5. Set c=ceil(n / u). */
		  var c = Math.ceil(n / u);

		  /* 6. For i=1, 2, ..., c, do the following: */
		  for(var i = 1; i <= c; i ++) {
		    /* a) Set Ai=H^r(D||I). (l.e. the rth hash of D||I, H(H(H(...H(D||I)))) */
		    var buf = new forge.util.ByteBuffer();
		    buf.putBytes(D.bytes());
		    buf.putBytes(I.bytes());
		    for(var round = 0; round < iter; round ++) {
		      md.start();
		      md.update(buf.getBytes());
		      buf = md.digest();
		    }

		    /* b) Concatenate copies of Ai to create a string B of length v bytes (the
		          final copy of Ai may be truncated to create B). */
		    var B = new forge.util.ByteBuffer();
		    for(l = 0; l < v; l ++) {
		      B.putByte(buf.at(l % u));
		    }

		    /* c) Treating I as a concatenation I0, I1, ..., Ik-1 of v-byte blocks,
		          where k=ceil(s / v) + ceil(p / v), modify I by setting
		          Ij=(Ij+B+1) mod 2v for each j.  */
		    var k = Math.ceil(s / v) + Math.ceil(p / v);
		    var Inew = new forge.util.ByteBuffer();
		    for(j = 0; j < k; j ++) {
		      var chunk = new forge.util.ByteBuffer(I.getBytes(v));
		      var x = 0x1ff;
		      for(l = B.length() - 1; l >= 0; l --) {
		        x = x >> 8;
		        x += B.at(l) + chunk.at(l);
		        chunk.setAt(l, x & 0xff);
		      }
		      Inew.putBuffer(chunk);
		    }
		    I = Inew;

		    /* Add Ai to A. */
		    result.putBuffer(buf);
		  }

		  result.truncate(result.length() - n);
		  return result;
		};

		/**
		 * Get new Forge cipher object instance.
		 *
		 * @param oid the OID (in string notation).
		 * @param params the ASN.1 params object.
		 * @param password the password to decrypt with.
		 *
		 * @return new cipher object instance.
		 */
		pki.pbe.getCipher = function(oid, params, password) {
		  switch(oid) {
		  case pki.oids['pkcs5PBES2']:
		    return pki.pbe.getCipherForPBES2(oid, params, password);

		  case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']:
		  case pki.oids['pbewithSHAAnd40BitRC2-CBC']:
		    return pki.pbe.getCipherForPKCS12PBE(oid, params, password);

		  default:
		    var error = new Error('Cannot read encrypted PBE data block. Unsupported OID.');
		    error.oid = oid;
		    error.supportedOids = [
		      'pkcs5PBES2',
		      'pbeWithSHAAnd3-KeyTripleDES-CBC',
		      'pbewithSHAAnd40BitRC2-CBC'
		    ];
		    throw error;
		  }
		};

		/**
		 * Get new Forge cipher object instance according to PBES2 params block.
		 *
		 * The returned cipher instance is already started using the IV
		 * from PBES2 parameter block.
		 *
		 * @param oid the PKCS#5 PBKDF2 OID (in string notation).
		 * @param params the ASN.1 PBES2-params object.
		 * @param password the password to decrypt with.
		 *
		 * @return new cipher object instance.
		 */
		pki.pbe.getCipherForPBES2 = function(oid, params, password) {
		  // get PBE params
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(params, PBES2AlgorithmsValidator, capture, errors)) {
		    var error = new Error('Cannot read password-based-encryption algorithm ' +
		      'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  // check oids
		  oid = asn1.derToOid(capture.kdfOid);
		  if(oid !== pki.oids['pkcs5PBKDF2']) {
		    var error = new Error('Cannot read encrypted private key. ' +
		      'Unsupported key derivation function OID.');
		    error.oid = oid;
		    error.supportedOids = ['pkcs5PBKDF2'];
		    throw error;
		  }
		  oid = asn1.derToOid(capture.encOid);
		  if(oid !== pki.oids['aes128-CBC'] &&
		    oid !== pki.oids['aes192-CBC'] &&
		    oid !== pki.oids['aes256-CBC'] &&
		    oid !== pki.oids['des-EDE3-CBC'] &&
		    oid !== pki.oids['desCBC']) {
		    var error = new Error('Cannot read encrypted private key. ' +
		      'Unsupported encryption scheme OID.');
		    error.oid = oid;
		    error.supportedOids = [
		      'aes128-CBC', 'aes192-CBC', 'aes256-CBC', 'des-EDE3-CBC', 'desCBC'];
		    throw error;
		  }

		  // set PBE params
		  var salt = capture.kdfSalt;
		  var count = forge.util.createBuffer(capture.kdfIterationCount);
		  count = count.getInt(count.length() << 3);
		  var dkLen;
		  var cipherFn;
		  switch(pki.oids[oid]) {
		  case 'aes128-CBC':
		    dkLen = 16;
		    cipherFn = forge.aes.createDecryptionCipher;
		    break;
		  case 'aes192-CBC':
		    dkLen = 24;
		    cipherFn = forge.aes.createDecryptionCipher;
		    break;
		  case 'aes256-CBC':
		    dkLen = 32;
		    cipherFn = forge.aes.createDecryptionCipher;
		    break;
		  case 'des-EDE3-CBC':
		    dkLen = 24;
		    cipherFn = forge.des.createDecryptionCipher;
		    break;
		  case 'desCBC':
		    dkLen = 8;
		    cipherFn = forge.des.createDecryptionCipher;
		    break;
		  }

		  // decrypt private key using pbe SHA-1 and AES/DES
		  var dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen);
		  var iv = capture.encIv;
		  var cipher = cipherFn(dk);
		  cipher.start(iv);

		  return cipher;
		};

		/**
		 * Get new Forge cipher object instance for PKCS#12 PBE.
		 *
		 * The returned cipher instance is already started using the key & IV
		 * derived from the provided password and PKCS#12 PBE salt.
		 *
		 * @param oid The PKCS#12 PBE OID (in string notation).
		 * @param params The ASN.1 PKCS#12 PBE-params object.
		 * @param password The password to decrypt with.
		 *
		 * @return the new cipher object instance.
		 */
		pki.pbe.getCipherForPKCS12PBE = function(oid, params, password) {
		  // get PBE params
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(params, pkcs12PbeParamsValidator, capture, errors)) {
		    var error = new Error('Cannot read password-based-encryption algorithm ' +
		      'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  var salt = forge.util.createBuffer(capture.salt);
		  var count = forge.util.createBuffer(capture.iterations);
		  count = count.getInt(count.length() << 3);

		  var dkLen, dIvLen, cipherFn;
		  switch(oid) {
		    case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']:
		      dkLen = 24;
		      dIvLen = 8;
		      cipherFn = forge.des.startDecrypting;
		      break;

		    case pki.oids['pbewithSHAAnd40BitRC2-CBC']:
		      dkLen = 5;
		      dIvLen = 8;
		      cipherFn = function(key, iv) {
		        var cipher = forge.rc2.createDecryptionCipher(key, 40);
		        cipher.start(iv, null);
		        return cipher;
		      };
		      break;

		    default:
		      var error = new Error('Cannot read PKCS #12 PBE data block. Unsupported OID.');
		      error.oid = oid;
		      throw error;
		  }

		  var key = pki.pbe.generatePkcs12Key(password, salt, 1, count, dkLen);
		  var iv = pki.pbe.generatePkcs12Key(password, salt, 2, count, dIvLen);

		  return cipherFn(key, iv);
		};

		/**
		 * OpenSSL's legacy key derivation function.
		 *
		 * See: http://www.openssl.org/docs/crypto/EVP_BytesToKey.html
		 *
		 * @param password the password to derive the key from.
		 * @param salt the salt to use, null for none.
		 * @param dkLen the number of bytes needed for the derived key.
		 * @param [options] the options to use:
		 *          [md] an optional message digest object to use.
		 */
		pki.pbe.opensslDeriveBytes = function(password, salt, dkLen, md) {
		  if(typeof md === 'undefined' || md === null) {
		    md = forge.md.md5.create();
		  }
		  if(salt === null) {
		    salt = '';
		  }
		  var digests = [hash(md, password + salt)];
		  for(var length = 16, i = 1; length < dkLen; ++i, length += 16) {
		    digests.push(hash(md, digests[i - 1] + password + salt));
		  }
		  return digests.join('').substr(0, dkLen);
		};

		function hash(md, bytes) {
		  return md.start().update(bytes).digest().getBytes();
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pbe';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pbe',[
		  'require',
		  'module',
		  './aes',
		  './asn1',
		  './des',
		  './md',
		  './oids',
		  './pem',
		  './pbkdf2',
		  './random',
		  './rc2',
		  './rsa',
		  './util'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of ASN.1 validators for PKCS#7 v1.5.
		 *
		 * @author Dave Longley
		 * @author Stefan Siegl
		 *
		 * Copyright (c) 2012-2015 Digital Bazaar, Inc.
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 *
		 * The ASN.1 representation of PKCS#7 is as follows
		 * (see RFC #2315 for details, http://www.ietf.org/rfc/rfc2315.txt):
		 *
		 * A PKCS#7 message consists of a ContentInfo on root level, which may
		 * contain any number of further ContentInfo nested into it.
		 *
		 * ContentInfo ::= SEQUENCE {
		 *   contentType                ContentType,
		 *   content               [0]  EXPLICIT ANY DEFINED BY contentType OPTIONAL
		 * }
		 *
		 * ContentType ::= OBJECT IDENTIFIER
		 *
		 * EnvelopedData ::= SEQUENCE {
		 *   version                    Version,
		 *   recipientInfos             RecipientInfos,
		 *   encryptedContentInfo       EncryptedContentInfo
		 * }
		 *
		 * EncryptedData ::= SEQUENCE {
		 *   version                    Version,
		 *   encryptedContentInfo       EncryptedContentInfo
		 * }
		 *
		 * id-signedData OBJECT IDENTIFIER ::= { iso(1) member-body(2)
		 *   us(840) rsadsi(113549) pkcs(1) pkcs7(7) 2 }
		 *
		 * SignedData ::= SEQUENCE {
		 *   version           INTEGER,
		 *   digestAlgorithms  DigestAlgorithmIdentifiers,
		 *   contentInfo       ContentInfo,
		 *   certificates      [0] IMPLICIT Certificates OPTIONAL,
		 *   crls              [1] IMPLICIT CertificateRevocationLists OPTIONAL,
		 *   signerInfos       SignerInfos
		 * }
		 *
		 * SignerInfos ::= SET OF SignerInfo
		 *
		 * SignerInfo ::= SEQUENCE {
		 *   version                    Version,
		 *   issuerAndSerialNumber      IssuerAndSerialNumber,
		 *   digestAlgorithm            DigestAlgorithmIdentifier,
		 *   authenticatedAttributes    [0] IMPLICIT Attributes OPTIONAL,
		 *   digestEncryptionAlgorithm  DigestEncryptionAlgorithmIdentifier,
		 *   encryptedDigest            EncryptedDigest,
		 *   unauthenticatedAttributes  [1] IMPLICIT Attributes OPTIONAL
		 * }
		 *
		 * EncryptedDigest ::= OCTET STRING
		 *
		 * Attributes ::= SET OF Attribute
		 *
		 * Attribute ::= SEQUENCE {
		 *   attrType    OBJECT IDENTIFIER,
		 *   attrValues  SET OF AttributeValue
		 * }
		 *
		 * AttributeValue ::= ANY
		 *
		 * Version ::= INTEGER
		 *
		 * RecipientInfos ::= SET OF RecipientInfo
		 *
		 * EncryptedContentInfo ::= SEQUENCE {
		 *   contentType                 ContentType,
		 *   contentEncryptionAlgorithm  ContentEncryptionAlgorithmIdentifier,
		 *   encryptedContent       [0]  IMPLICIT EncryptedContent OPTIONAL
		 * }
		 *
		 * ContentEncryptionAlgorithmIdentifier ::= AlgorithmIdentifier
		 *
		 * The AlgorithmIdentifier contains an Object Identifier (OID) and parameters
		 * for the algorithm, if any. In the case of AES and DES3, there is only one,
		 * the IV.
		 *
		 * AlgorithmIdentifer ::= SEQUENCE {
		 *    algorithm OBJECT IDENTIFIER,
		 *    parameters ANY DEFINED BY algorithm OPTIONAL
		 * }
		 *
		 * EncryptedContent ::= OCTET STRING
		 *
		 * RecipientInfo ::= SEQUENCE {
		 *   version                     Version,
		 *   issuerAndSerialNumber       IssuerAndSerialNumber,
		 *   keyEncryptionAlgorithm      KeyEncryptionAlgorithmIdentifier,
		 *   encryptedKey                EncryptedKey
		 * }
		 *
		 * IssuerAndSerialNumber ::= SEQUENCE {
		 *   issuer                      Name,
		 *   serialNumber                CertificateSerialNumber
		 * }
		 *
		 * CertificateSerialNumber ::= INTEGER
		 *
		 * KeyEncryptionAlgorithmIdentifier ::= AlgorithmIdentifier
		 *
		 * EncryptedKey ::= OCTET STRING
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for ASN.1 API
		var asn1 = forge.asn1;

		// shortcut for PKCS#7 API
		var p7v = forge.pkcs7asn1 = forge.pkcs7asn1 || {};
		forge.pkcs7 = forge.pkcs7 || {};
		forge.pkcs7.asn1 = p7v;

		var contentInfoValidator = {
		  name: 'ContentInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'ContentInfo.ContentType',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OID,
		    constructed: false,
		    capture: 'contentType'
		  }, {
		    name: 'ContentInfo.content',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 0,
		    constructed: true,
		    optional: true,
		    captureAsn1: 'content'
		  }]
		};
		p7v.contentInfoValidator = contentInfoValidator;

		var encryptedContentInfoValidator = {
		  name: 'EncryptedContentInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'EncryptedContentInfo.contentType',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OID,
		    constructed: false,
		    capture: 'contentType'
		  }, {
		    name: 'EncryptedContentInfo.contentEncryptionAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'EncryptedContentInfo.contentEncryptionAlgorithm.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'encAlgorithm'
		    }, {
		      name: 'EncryptedContentInfo.contentEncryptionAlgorithm.parameter',
		      tagClass: asn1.Class.UNIVERSAL,
		      captureAsn1: 'encParameter'
		    }]
		  }, {
		    name: 'EncryptedContentInfo.encryptedContent',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 0,
		    /* The PKCS#7 structure output by OpenSSL somewhat differs from what
		     * other implementations do generate.
		     *
		     * OpenSSL generates a structure like this:
		     * SEQUENCE {
		     *    ...
		     *    [0]
		     *       26 DA 67 D2 17 9C 45 3C B1 2A A8 59 2F 29 33 38
		     *       C3 C3 DF 86 71 74 7A 19 9F 40 D0 29 BE 85 90 45
		     *       ...
		     * }
		     *
		     * Whereas other implementations (and this PKCS#7 module) generate:
		     * SEQUENCE {
		     *    ...
		     *    [0] {
		     *       OCTET STRING
		     *          26 DA 67 D2 17 9C 45 3C B1 2A A8 59 2F 29 33 38
		     *          C3 C3 DF 86 71 74 7A 19 9F 40 D0 29 BE 85 90 45
		     *          ...
		     *    }
		     * }
		     *
		     * In order to support both, we just capture the context specific
		     * field here.  The OCTET STRING bit is removed below.
		     */
		    capture: 'encryptedContent',
		    captureAsn1: 'encryptedContentAsn1'
		  }]
		};

		p7v.envelopedDataValidator = {
		  name: 'EnvelopedData',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'EnvelopedData.Version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'version'
		  }, {
		    name: 'EnvelopedData.RecipientInfos',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SET,
		    constructed: true,
		    captureAsn1: 'recipientInfos'
		  }].concat(encryptedContentInfoValidator)
		};

		p7v.encryptedDataValidator = {
		  name: 'EncryptedData',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'EncryptedData.Version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'version'
		  }].concat(encryptedContentInfoValidator)
		};

		var signerValidator = {
		  name: 'SignerInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'SignerInfo.version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false
		  }, {
		    name: 'SignerInfo.issuerAndSerialNumber',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'SignerInfo.issuerAndSerialNumber.issuer',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      captureAsn1: 'issuer'
		    }, {
		      name: 'SignerInfo.issuerAndSerialNumber.serialNumber',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.INTEGER,
		      constructed: false,
		      capture: 'serial'
		    }]
		  }, {
		    name: 'SignerInfo.digestAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'SignerInfo.digestAlgorithm.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'digestAlgorithm'
		    }, {
		      name: 'SignerInfo.digestAlgorithm.parameter',
		      tagClass: asn1.Class.UNIVERSAL,
		      constructed: false,
		      captureAsn1: 'digestParameter',
		      optional: true
		    }]
		  }, {
		    name: 'SignerInfo.authenticatedAttributes',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 0,
		    constructed: true,
		    optional: true,
		    capture: 'authenticatedAttributes'
		  }, {
		    name: 'SignerInfo.digestEncryptionAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    capture: 'signatureAlgorithm'
		  }, {
		    name: 'SignerInfo.encryptedDigest',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OCTETSTRING,
		    constructed: false,
		    capture: 'signature'
		  }, {
		    name: 'SignerInfo.unauthenticatedAttributes',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 1,
		    constructed: true,
		    optional: true,
		    capture: 'unauthenticatedAttributes'
		  }]
		};

		p7v.signedDataValidator = {
		  name: 'SignedData',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'SignedData.Version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'version'
		  }, {
		    name: 'SignedData.DigestAlgorithms',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SET,
		    constructed: true,
		    captureAsn1: 'digestAlgorithms'
		  },
		  contentInfoValidator,
		  {
		    name: 'SignedData.Certificates',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 0,
		    optional: true,
		    captureAsn1: 'certificates'
		  }, {
		    name: 'SignedData.CertificateRevocationLists',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 1,
		    optional: true,
		    captureAsn1: 'crls'
		  }, {
		    name: 'SignedData.SignerInfos',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SET,
		    capture: 'signerInfos',
		    optional: true,
		    value: [signerValidator]
		  }]
		};

		p7v.recipientInfoValidator = {
		  name: 'RecipientInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'RecipientInfo.version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'version'
		  }, {
		    name: 'RecipientInfo.issuerAndSerial',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'RecipientInfo.issuerAndSerial.issuer',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      captureAsn1: 'issuer'
		    }, {
		      name: 'RecipientInfo.issuerAndSerial.serialNumber',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.INTEGER,
		      constructed: false,
		      capture: 'serial'
		    }]
		  }, {
		    name: 'RecipientInfo.keyEncryptionAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      name: 'RecipientInfo.keyEncryptionAlgorithm.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'encAlgorithm'
		    }, {
		      name: 'RecipientInfo.keyEncryptionAlgorithm.parameter',
		      tagClass: asn1.Class.UNIVERSAL,
		      constructed: false,
		      captureAsn1: 'encParameter'
		    }]
		  }, {
		    name: 'RecipientInfo.encryptedKey',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OCTETSTRING,
		    constructed: false,
		    capture: 'encKey'
		  }]
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pkcs7asn1';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pkcs7asn1',['require', 'module', './asn1', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of mask generation function MGF1.
		 *
		 * @author Stefan Siegl
		 * @author Dave Longley
		 *
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 * Copyright (c) 2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.mgf = forge.mgf || {};
		var mgf1 = forge.mgf.mgf1 = forge.mgf1 = forge.mgf1 || {};

		/**
		 * Creates a MGF1 mask generation function object.
		 *
		 * @param md the message digest API to use (eg: forge.md.sha1.create()).
		 *
		 * @return a mask generation function object.
		 */
		mgf1.create = function(md) {
		  var mgf = {
		    /**
		     * Generate mask of specified length.
		     *
		     * @param {String} seed The seed for mask generation.
		     * @param maskLen Number of bytes to generate.
		     * @return {String} The generated mask.
		     */
		    generate: function(seed, maskLen) {
		      /* 2. Let T be the empty octet string. */
		      var t = new forge.util.ByteBuffer();

		      /* 3. For counter from 0 to ceil(maskLen / hLen), do the following: */
		      var len = Math.ceil(maskLen / md.digestLength);
		      for(var i = 0; i < len; i++) {
		        /* a. Convert counter to an octet string C of length 4 octets */
		        var c = new forge.util.ByteBuffer();
		        c.putInt32(i);

		        /* b. Concatenate the hash of the seed mgfSeed and C to the octet
		         * string T: */
		        md.start();
		        md.update(seed + c.getBytes());
		        t.putBuffer(md.digest());
		      }

		      /* Output the leading maskLen octets of T as the octet string mask. */
		      t.truncate(t.length() - maskLen);
		      return t.getBytes();
		    }
		  };

		  return mgf;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'mgf1';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/mgf1',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Node.js module for Forge mask generation functions.
		 *
		 * @author Stefan Siegl
		 *
		 * Copyright 2012 Stefan Siegl <stesie@brokenpipe.de>
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.mgf = forge.mgf || {};
		forge.mgf.mgf1 = forge.mgf1;

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'mgf';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/mgf',['require', 'module', './mgf1'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of PKCS#1 PSS signature padding.
		 *
		 * @author Stefan Siegl
		 *
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for PSS API
		var pss = forge.pss = forge.pss || {};

		/**
		 * Creates a PSS signature scheme object.
		 *
		 * There are several ways to provide a salt for encoding:
		 *
		 * 1. Specify the saltLength only and the built-in PRNG will generate it.
		 * 2. Specify the saltLength and a custom PRNG with 'getBytesSync' defined that
		 *   will be used.
		 * 3. Specify the salt itself as a forge.util.ByteBuffer.
		 *
		 * @param options the options to use:
		 *          md the message digest object to use, a forge md instance.
		 *          mgf the mask generation function to use, a forge mgf instance.
		 *          [saltLength] the length of the salt in octets.
		 *          [prng] the pseudo-random number generator to use to produce a salt.
		 *          [salt] the salt to use when encoding.
		 *
		 * @return a signature scheme object.
		 */
		pss.create = function(options) {
		  // backwards compatibility w/legacy args: hash, mgf, sLen
		  if(arguments.length === 3) {
		    options = {
		      md: arguments[0],
		      mgf: arguments[1],
		      saltLength: arguments[2]
		    };
		  }

		  var hash = options.md;
		  var mgf = options.mgf;
		  var hLen = hash.digestLength;

		  var salt_ = options.salt || null;
		  if(typeof salt_ === 'string') {
		    // assume binary-encoded string
		    salt_ = forge.util.createBuffer(salt_);
		  }

		  var sLen;
		  if('saltLength' in options) {
		    sLen = options.saltLength;
		  } else if(salt_ !== null) {
		    sLen = salt_.length();
		  } else {
		    throw new Error('Salt length not specified or specific salt not given.');
		  }

		  if(salt_ !== null && salt_.length() !== sLen) {
		    throw new Error('Given salt length does not match length of given salt.');
		  }

		  var prng = options.prng || forge.random;

		  var pssobj = {};

		  /**
		   * Encodes a PSS signature.
		   *
		   * This function implements EMSA-PSS-ENCODE as per RFC 3447, section 9.1.1.
		   *
		   * @param md the message digest object with the hash to sign.
		   * @param modsBits the length of the RSA modulus in bits.
		   *
		   * @return the encoded message as a binary-encoded string of length
		   *           ceil((modBits - 1) / 8).
		   */
		  pssobj.encode = function(md, modBits) {
		    var i;
		    var emBits = modBits - 1;
		    var emLen = Math.ceil(emBits / 8);

		    /* 2. Let mHash = Hash(M), an octet string of length hLen. */
		    var mHash = md.digest().getBytes();

		    /* 3. If emLen < hLen + sLen + 2, output "encoding error" and stop. */
		    if(emLen < hLen + sLen + 2) {
		      throw new Error('Message is too long to encrypt.');
		    }

		    /* 4. Generate a random octet string salt of length sLen; if sLen = 0,
		     *    then salt is the empty string. */
		    var salt;
		    if(salt_ === null) {
		      salt = prng.getBytesSync(sLen);
		    } else {
		      salt = salt_.bytes();
		    }

		    /* 5. Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt; */
		    var m_ = new forge.util.ByteBuffer();
		    m_.fillWithByte(0, 8);
		    m_.putBytes(mHash);
		    m_.putBytes(salt);

		    /* 6. Let H = Hash(M'), an octet string of length hLen. */
		    hash.start();
		    hash.update(m_.getBytes());
		    var h = hash.digest().getBytes();

		    /* 7. Generate an octet string PS consisting of emLen - sLen - hLen - 2
		     *    zero octets.  The length of PS may be 0. */
		    var ps = new forge.util.ByteBuffer();
		    ps.fillWithByte(0, emLen - sLen - hLen - 2);

		    /* 8. Let DB = PS || 0x01 || salt; DB is an octet string of length
		     *    emLen - hLen - 1. */
		    ps.putByte(0x01);
		    ps.putBytes(salt);
		    var db = ps.getBytes();

		    /* 9. Let dbMask = MGF(H, emLen - hLen - 1). */
		    var maskLen = emLen - hLen - 1;
		    var dbMask = mgf.generate(h, maskLen);

		    /* 10. Let maskedDB = DB \xor dbMask. */
		    var maskedDB = '';
		    for(i = 0; i < maskLen; i ++) {
		      maskedDB += String.fromCharCode(db.charCodeAt(i) ^ dbMask.charCodeAt(i));
		    }

		    /* 11. Set the leftmost 8emLen - emBits bits of the leftmost octet in
		     *     maskedDB to zero. */
		    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;
		    maskedDB = String.fromCharCode(maskedDB.charCodeAt(0) & ~mask) +
		      maskedDB.substr(1);

		    /* 12. Let EM = maskedDB || H || 0xbc.
		     * 13. Output EM. */
		    return maskedDB + h + String.fromCharCode(0xbc);
		  };

		  /**
		   * Verifies a PSS signature.
		   *
		   * This function implements EMSA-PSS-VERIFY as per RFC 3447, section 9.1.2.
		   *
		   * @param mHash the message digest hash, as a binary-encoded string, to
		   *         compare against the signature.
		   * @param em the encoded message, as a binary-encoded string
		   *          (RSA decryption result).
		   * @param modsBits the length of the RSA modulus in bits.
		   *
		   * @return true if the signature was verified, false if not.
		   */
		  pssobj.verify = function(mHash, em, modBits) {
		    var i;
		    var emBits = modBits - 1;
		    var emLen = Math.ceil(emBits / 8);

		    /* c. Convert the message representative m to an encoded message EM
		     *    of length emLen = ceil((modBits - 1) / 8) octets, where modBits
		     *    is the length in bits of the RSA modulus n */
		    em = em.substr(-emLen);

		    /* 3. If emLen < hLen + sLen + 2, output "inconsistent" and stop. */
		    if(emLen < hLen + sLen + 2) {
		      throw new Error('Inconsistent parameters to PSS signature verification.');
		    }

		    /* 4. If the rightmost octet of EM does not have hexadecimal value
		     *    0xbc, output "inconsistent" and stop. */
		    if(em.charCodeAt(emLen - 1) !== 0xbc) {
		      throw new Error('Encoded message does not end in 0xBC.');
		    }

		    /* 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and
		     *    let H be the next hLen octets. */
		    var maskLen = emLen - hLen - 1;
		    var maskedDB = em.substr(0, maskLen);
		    var h = em.substr(maskLen, hLen);

		    /* 6. If the leftmost 8emLen - emBits bits of the leftmost octet in
		     *    maskedDB are not all equal to zero, output "inconsistent" and stop. */
		    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;
		    if((maskedDB.charCodeAt(0) & mask) !== 0) {
		      throw new Error('Bits beyond keysize not zero as expected.');
		    }

		    /* 7. Let dbMask = MGF(H, emLen - hLen - 1). */
		    var dbMask = mgf.generate(h, maskLen);

		    /* 8. Let DB = maskedDB \xor dbMask. */
		    var db = '';
		    for(i = 0; i < maskLen; i ++) {
		      db += String.fromCharCode(maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i));
		    }

		    /* 9. Set the leftmost 8emLen - emBits bits of the leftmost octet
		     * in DB to zero. */
		    db = String.fromCharCode(db.charCodeAt(0) & ~mask) + db.substr(1);

		    /* 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero
		     * or if the octet at position emLen - hLen - sLen - 1 (the leftmost
		     * position is "position 1") does not have hexadecimal value 0x01,
		     * output "inconsistent" and stop. */
		    var checkLen = emLen - hLen - sLen - 2;
		    for(i = 0; i < checkLen; i ++) {
		      if(db.charCodeAt(i) !== 0x00) {
		        throw new Error('Leftmost octets not zero as expected');
		      }
		    }

		    if(db.charCodeAt(checkLen) !== 0x01) {
		      throw new Error('Inconsistent PSS signature, 0x01 marker not found');
		    }

		    /* 11. Let salt be the last sLen octets of DB. */
		    var salt = db.substr(-sLen);

		    /* 12.  Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt */
		    var m_ = new forge.util.ByteBuffer();
		    m_.fillWithByte(0, 8);
		    m_.putBytes(mHash);
		    m_.putBytes(salt);

		    /* 13. Let H' = Hash(M'), an octet string of length hLen. */
		    hash.start();
		    hash.update(m_.getBytes());
		    var h_ = hash.digest().getBytes();

		    /* 14. If H = H', output "consistent." Otherwise, output "inconsistent." */
		    return h === h_;
		  };

		  return pssobj;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pss';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pss',['require', 'module', './random', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of X.509 and related components (such as
		 * Certification Signing Requests) of a Public Key Infrastructure.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 *
		 * The ASN.1 representation of an X.509v3 certificate is as follows
		 * (see RFC 2459):
		 *
		 * Certificate ::= SEQUENCE {
		 *   tbsCertificate       TBSCertificate,
		 *   signatureAlgorithm   AlgorithmIdentifier,
		 *   signatureValue       BIT STRING
		 * }
		 *
		 * TBSCertificate ::= SEQUENCE {
		 *   version         [0]  EXPLICIT Version DEFAULT v1,
		 *   serialNumber         CertificateSerialNumber,
		 *   signature            AlgorithmIdentifier,
		 *   issuer               Name,
		 *   validity             Validity,
		 *   subject              Name,
		 *   subjectPublicKeyInfo SubjectPublicKeyInfo,
		 *   issuerUniqueID  [1]  IMPLICIT UniqueIdentifier OPTIONAL,
		 *                        -- If present, version shall be v2 or v3
		 *   subjectUniqueID [2]  IMPLICIT UniqueIdentifier OPTIONAL,
		 *                        -- If present, version shall be v2 or v3
		 *   extensions      [3]  EXPLICIT Extensions OPTIONAL
		 *                        -- If present, version shall be v3
		 * }
		 *
		 * Version ::= INTEGER  { v1(0), v2(1), v3(2) }
		 *
		 * CertificateSerialNumber ::= INTEGER
		 *
		 * Name ::= CHOICE {
		 *   // only one possible choice for now
		 *   RDNSequence
		 * }
		 *
		 * RDNSequence ::= SEQUENCE OF RelativeDistinguishedName
		 *
		 * RelativeDistinguishedName ::= SET OF AttributeTypeAndValue
		 *
		 * AttributeTypeAndValue ::= SEQUENCE {
		 *   type     AttributeType,
		 *   value    AttributeValue
		 * }
		 * AttributeType ::= OBJECT IDENTIFIER
		 * AttributeValue ::= ANY DEFINED BY AttributeType
		 *
		 * Validity ::= SEQUENCE {
		 *   notBefore      Time,
		 *   notAfter       Time
		 * }
		 *
		 * Time ::= CHOICE {
		 *   utcTime        UTCTime,
		 *   generalTime    GeneralizedTime
		 * }
		 *
		 * UniqueIdentifier ::= BIT STRING
		 *
		 * SubjectPublicKeyInfo ::= SEQUENCE {
		 *   algorithm            AlgorithmIdentifier,
		 *   subjectPublicKey     BIT STRING
		 * }
		 *
		 * Extensions ::= SEQUENCE SIZE (1..MAX) OF Extension
		 *
		 * Extension ::= SEQUENCE {
		 *   extnID      OBJECT IDENTIFIER,
		 *   critical    BOOLEAN DEFAULT FALSE,
		 *   extnValue   OCTET STRING
		 * }
		 *
		 * The only key algorithm currently supported for PKI is RSA.
		 *
		 * RSASSA-PSS signatures are described in RFC 3447 and RFC 4055.
		 *
		 * PKCS#10 v1.7 describes certificate signing requests:
		 *
		 * CertificationRequestInfo:
		 *
		 * CertificationRequestInfo ::= SEQUENCE {
		 *   version       INTEGER { v1(0) } (v1,...),
		 *   subject       Name,
		 *   subjectPKInfo SubjectPublicKeyInfo{{ PKInfoAlgorithms }},
		 *   attributes    [0] Attributes{{ CRIAttributes }}
		 * }
		 *
		 * Attributes { ATTRIBUTE:IOSet } ::= SET OF Attribute{{ IOSet }}
		 *
		 * CRIAttributes  ATTRIBUTE  ::= {
		 *   ... -- add any locally defined attributes here -- }
		 *
		 * Attribute { ATTRIBUTE:IOSet } ::= SEQUENCE {
		 *   type   ATTRIBUTE.&id({IOSet}),
		 *   values SET SIZE(1..MAX) OF ATTRIBUTE.&Type({IOSet}{@type})
		 * }
		 *
		 * CertificationRequest ::= SEQUENCE {
		 *   certificationRequestInfo CertificationRequestInfo,
		 *   signatureAlgorithm AlgorithmIdentifier{{ SignatureAlgorithms }},
		 *   signature          BIT STRING
		 * }
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for asn.1 API
		var asn1 = forge.asn1;

		/* Public Key Infrastructure (PKI) implementation. */
		var pki = forge.pki = forge.pki || {};
		var oids = pki.oids;

		// short name OID mappings
		var _shortNames = {};
		_shortNames['CN'] = oids['commonName'];
		_shortNames['commonName'] = 'CN';
		_shortNames['C'] = oids['countryName'];
		_shortNames['countryName'] = 'C';
		_shortNames['L'] = oids['localityName'];
		_shortNames['localityName'] = 'L';
		_shortNames['ST'] = oids['stateOrProvinceName'];
		_shortNames['stateOrProvinceName'] = 'ST';
		_shortNames['O'] = oids['organizationName'];
		_shortNames['organizationName'] = 'O';
		_shortNames['OU'] = oids['organizationalUnitName'];
		_shortNames['organizationalUnitName'] = 'OU';
		_shortNames['E'] = oids['emailAddress'];
		_shortNames['emailAddress'] = 'E';

		// validator for an SubjectPublicKeyInfo structure
		// Note: Currently only works with an RSA public key
		var publicKeyValidator = forge.pki.rsa.publicKeyValidator;

		// validator for an X.509v3 certificate
		var x509CertificateValidator = {
		  name: 'Certificate',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'Certificate.TBSCertificate',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    captureAsn1: 'tbsCertificate',
		    value: [{
		      name: 'Certificate.TBSCertificate.version',
		      tagClass: asn1.Class.CONTEXT_SPECIFIC,
		      type: 0,
		      constructed: true,
		      optional: true,
		      value: [{
		        name: 'Certificate.TBSCertificate.version.integer',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.INTEGER,
		        constructed: false,
		        capture: 'certVersion'
		      }]
		    }, {
		      name: 'Certificate.TBSCertificate.serialNumber',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.INTEGER,
		      constructed: false,
		      capture: 'certSerialNumber'
		    }, {
		      name: 'Certificate.TBSCertificate.signature',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      value: [{
		        name: 'Certificate.TBSCertificate.signature.algorithm',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.OID,
		        constructed: false,
		        capture: 'certinfoSignatureOid'
		      }, {
		        name: 'Certificate.TBSCertificate.signature.parameters',
		        tagClass: asn1.Class.UNIVERSAL,
		        optional: true,
		        captureAsn1: 'certinfoSignatureParams'
		      }]
		    }, {
		      name: 'Certificate.TBSCertificate.issuer',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      captureAsn1: 'certIssuer'
		    }, {
		      name: 'Certificate.TBSCertificate.validity',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      // Note: UTC and generalized times may both appear so the capture
		      // names are based on their detected order, the names used below
		      // are only for the common case, which validity time really means
		      // "notBefore" and which means "notAfter" will be determined by order
		      value: [{
		        // notBefore (Time) (UTC time case)
		        name: 'Certificate.TBSCertificate.validity.notBefore (utc)',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.UTCTIME,
		        constructed: false,
		        optional: true,
		        capture: 'certValidity1UTCTime'
		      }, {
		        // notBefore (Time) (generalized time case)
		        name: 'Certificate.TBSCertificate.validity.notBefore (generalized)',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.GENERALIZEDTIME,
		        constructed: false,
		        optional: true,
		        capture: 'certValidity2GeneralizedTime'
		      }, {
		        // notAfter (Time) (only UTC time is supported)
		        name: 'Certificate.TBSCertificate.validity.notAfter (utc)',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.UTCTIME,
		        constructed: false,
		        optional: true,
		        capture: 'certValidity3UTCTime'
		      }, {
		        // notAfter (Time) (only UTC time is supported)
		        name: 'Certificate.TBSCertificate.validity.notAfter (generalized)',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.GENERALIZEDTIME,
		        constructed: false,
		        optional: true,
		        capture: 'certValidity4GeneralizedTime'
		      }]
		    }, {
		      // Name (subject) (RDNSequence)
		      name: 'Certificate.TBSCertificate.subject',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      captureAsn1: 'certSubject'
		    },
		      // SubjectPublicKeyInfo
		      publicKeyValidator,
		    {
		      // issuerUniqueID (optional)
		      name: 'Certificate.TBSCertificate.issuerUniqueID',
		      tagClass: asn1.Class.CONTEXT_SPECIFIC,
		      type: 1,
		      constructed: true,
		      optional: true,
		      value: [{
		        name: 'Certificate.TBSCertificate.issuerUniqueID.id',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.BITSTRING,
		        constructed: false,
		        capture: 'certIssuerUniqueId'
		      }]
		    }, {
		      // subjectUniqueID (optional)
		      name: 'Certificate.TBSCertificate.subjectUniqueID',
		      tagClass: asn1.Class.CONTEXT_SPECIFIC,
		      type: 2,
		      constructed: true,
		      optional: true,
		      value: [{
		        name: 'Certificate.TBSCertificate.subjectUniqueID.id',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.BITSTRING,
		        constructed: false,
		        capture: 'certSubjectUniqueId'
		      }]
		    }, {
		      // Extensions (optional)
		      name: 'Certificate.TBSCertificate.extensions',
		      tagClass: asn1.Class.CONTEXT_SPECIFIC,
		      type: 3,
		      constructed: true,
		      captureAsn1: 'certExtensions',
		      optional: true
		    }]
		  }, {
		    // AlgorithmIdentifier (signature algorithm)
		    name: 'Certificate.signatureAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      // algorithm
		      name: 'Certificate.signatureAlgorithm.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'certSignatureOid'
		    }, {
		      name: 'Certificate.TBSCertificate.signature.parameters',
		      tagClass: asn1.Class.UNIVERSAL,
		      optional: true,
		      captureAsn1: 'certSignatureParams'
		    }]
		  }, {
		    // SignatureValue
		    name: 'Certificate.signatureValue',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.BITSTRING,
		    constructed: false,
		    capture: 'certSignature'
		  }]
		};

		var rsassaPssParameterValidator = {
		  name: 'rsapss',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'rsapss.hashAlgorithm',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 0,
		    constructed: true,
		    value: [{
		      name: 'rsapss.hashAlgorithm.AlgorithmIdentifier',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Class.SEQUENCE,
		      constructed: true,
		      optional: true,
		      value: [{
		        name: 'rsapss.hashAlgorithm.AlgorithmIdentifier.algorithm',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.OID,
		        constructed: false,
		        capture: 'hashOid'
		        /* parameter block omitted, for SHA1 NULL anyhow. */
		      }]
		    }]
		  }, {
		    name: 'rsapss.maskGenAlgorithm',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 1,
		    constructed: true,
		    value: [{
		      name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Class.SEQUENCE,
		      constructed: true,
		      optional: true,
		      value: [{
		        name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.algorithm',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.OID,
		        constructed: false,
		        capture: 'maskGenOid'
		      }, {
		        name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.params',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.SEQUENCE,
		        constructed: true,
		        value: [{
		          name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.params.algorithm',
		          tagClass: asn1.Class.UNIVERSAL,
		          type: asn1.Type.OID,
		          constructed: false,
		          capture: 'maskGenHashOid'
		          /* parameter block omitted, for SHA1 NULL anyhow. */
		        }]
		      }]
		    }]
		  }, {
		    name: 'rsapss.saltLength',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 2,
		    optional: true,
		    value: [{
		      name: 'rsapss.saltLength.saltLength',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Class.INTEGER,
		      constructed: false,
		      capture: 'saltLength'
		    }]
		  }, {
		    name: 'rsapss.trailerField',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 3,
		    optional: true,
		    value: [{
		      name: 'rsapss.trailer.trailer',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Class.INTEGER,
		      constructed: false,
		      capture: 'trailer'
		    }]
		  }]
		};

		// validator for a CertificationRequestInfo structure
		var certificationRequestInfoValidator = {
		  name: 'CertificationRequestInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  captureAsn1: 'certificationRequestInfo',
		  value: [{
		    name: 'CertificationRequestInfo.integer',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'certificationRequestInfoVersion'
		  }, {
		    // Name (subject) (RDNSequence)
		    name: 'CertificationRequestInfo.subject',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    captureAsn1: 'certificationRequestInfoSubject'
		  },
		  // SubjectPublicKeyInfo
		  publicKeyValidator,
		  {
		    name: 'CertificationRequestInfo.attributes',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    type: 0,
		    constructed: true,
		    optional: true,
		    capture: 'certificationRequestInfoAttributes',
		    value: [{
		      name: 'CertificationRequestInfo.attributes',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,
		      constructed: true,
		      value: [{
		        name: 'CertificationRequestInfo.attributes.type',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.OID,
		        constructed: false
		      }, {
		        name: 'CertificationRequestInfo.attributes.value',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.SET,
		        constructed: true
		      }]
		    }]
		  }]
		};

		// validator for a CertificationRequest structure
		var certificationRequestValidator = {
		  name: 'CertificationRequest',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  captureAsn1: 'csr',
		  value: [
		    certificationRequestInfoValidator, {
		    // AlgorithmIdentifier (signature algorithm)
		    name: 'CertificationRequest.signatureAlgorithm',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    value: [{
		      // algorithm
		      name: 'CertificationRequest.signatureAlgorithm.algorithm',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OID,
		      constructed: false,
		      capture: 'csrSignatureOid'
		    }, {
		      name: 'CertificationRequest.signatureAlgorithm.parameters',
		      tagClass: asn1.Class.UNIVERSAL,
		      optional: true,
		      captureAsn1: 'csrSignatureParams'
		    }]
		  }, {
		    // signature
		    name: 'CertificationRequest.signature',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.BITSTRING,
		    constructed: false,
		    capture: 'csrSignature'
		  }]
		};

		/**
		 * Converts an RDNSequence of ASN.1 DER-encoded RelativeDistinguishedName
		 * sets into an array with objects that have type and value properties.
		 *
		 * @param rdn the RDNSequence to convert.
		 * @param md a message digest to append type and value to if provided.
		 */
		pki.RDNAttributesAsArray = function(rdn, md) {
		  var rval = [];

		  // each value in 'rdn' in is a SET of RelativeDistinguishedName
		  var set, attr, obj;
		  for(var si = 0; si < rdn.value.length; ++si) {
		    // get the RelativeDistinguishedName set
		    set = rdn.value[si];

		    // each value in the SET is an AttributeTypeAndValue sequence
		    // containing first a type (an OID) and second a value (defined by
		    // the OID)
		    for(var i = 0; i < set.value.length; ++i) {
		      obj = {};
		      attr = set.value[i];
		      obj.type = asn1.derToOid(attr.value[0].value);
		      obj.value = attr.value[1].value;
		      obj.valueTagClass = attr.value[1].type;
		      // if the OID is known, get its name and short name
		      if(obj.type in oids) {
		        obj.name = oids[obj.type];
		        if(obj.name in _shortNames) {
		          obj.shortName = _shortNames[obj.name];
		        }
		      }
		      if(md) {
		        md.update(obj.type);
		        md.update(obj.value);
		      }
		      rval.push(obj);
		    }
		  }

		  return rval;
		};

		/**
		 * Converts ASN.1 CRIAttributes into an array with objects that have type and
		 * value properties.
		 *
		 * @param attributes the CRIAttributes to convert.
		 */
		pki.CRIAttributesAsArray = function(attributes) {
		  var rval = [];

		  // each value in 'attributes' in is a SEQUENCE with an OID and a SET
		  for(var si = 0; si < attributes.length; ++si) {
		    // get the attribute sequence
		    var seq = attributes[si];

		    // each value in the SEQUENCE containing first a type (an OID) and
		    // second a set of values (defined by the OID)
		    var type = asn1.derToOid(seq.value[0].value);
		    var values = seq.value[1].value;
		    for(var vi = 0; vi < values.length; ++vi) {
		      var obj = {};
		      obj.type = type;
		      obj.value = values[vi].value;
		      obj.valueTagClass = values[vi].type;
		      // if the OID is known, get its name and short name
		      if(obj.type in oids) {
		        obj.name = oids[obj.type];
		        if(obj.name in _shortNames) {
		          obj.shortName = _shortNames[obj.name];
		        }
		      }
		      // parse extensions
		      if(obj.type === oids.extensionRequest) {
		        obj.extensions = [];
		        for(var ei = 0; ei < obj.value.length; ++ei) {
		          obj.extensions.push(pki.certificateExtensionFromAsn1(obj.value[ei]));
		        }
		      }
		      rval.push(obj);
		    }
		  }

		  return rval;
		};

		/**
		 * Gets an issuer or subject attribute from its name, type, or short name.
		 *
		 * @param obj the issuer or subject object.
		 * @param options a short name string or an object with:
		 *          shortName the short name for the attribute.
		 *          name the name for the attribute.
		 *          type the type for the attribute.
		 *
		 * @return the attribute.
		 */
		function _getAttribute(obj, options) {
		  if(typeof options === 'string') {
		    options = {shortName: options};
		  }

		  var rval = null;
		  var attr;
		  for(var i = 0; rval === null && i < obj.attributes.length; ++i) {
		    attr = obj.attributes[i];
		    if(options.type && options.type === attr.type) {
		      rval = attr;
		    } else if(options.name && options.name === attr.name) {
		      rval = attr;
		    } else if(options.shortName && options.shortName === attr.shortName) {
		      rval = attr;
		    }
		  }
		  return rval;
		}

		/**
		 * Converts signature parameters from ASN.1 structure.
		 *
		 * Currently only RSASSA-PSS supported.  The PKCS#1 v1.5 signature scheme had
		 * no parameters.
		 *
		 * RSASSA-PSS-params  ::=  SEQUENCE  {
		 *   hashAlgorithm      [0] HashAlgorithm DEFAULT
		 *                             sha1Identifier,
		 *   maskGenAlgorithm   [1] MaskGenAlgorithm DEFAULT
		 *                             mgf1SHA1Identifier,
		 *   saltLength         [2] INTEGER DEFAULT 20,
		 *   trailerField       [3] INTEGER DEFAULT 1
		 * }
		 *
		 * HashAlgorithm  ::=  AlgorithmIdentifier
		 *
		 * MaskGenAlgorithm  ::=  AlgorithmIdentifier
		 *
		 * AlgorithmIdentifer ::= SEQUENCE {
		 *   algorithm OBJECT IDENTIFIER,
		 *   parameters ANY DEFINED BY algorithm OPTIONAL
		 * }
		 *
		 * @param oid The OID specifying the signature algorithm
		 * @param obj The ASN.1 structure holding the parameters
		 * @param fillDefaults Whether to use return default values where omitted
		 * @return signature parameter object
		 */
		var _readSignatureParameters = function(oid, obj, fillDefaults) {
		  var params = {};

		  if(oid !== oids['RSASSA-PSS']) {
		    return params;
		  }

		  if(fillDefaults) {
		    params = {
		      hash: {
		        algorithmOid: oids['sha1']
		      },
		      mgf: {
		        algorithmOid: oids['mgf1'],
		        hash: {
		          algorithmOid: oids['sha1']
		        }
		      },
		      saltLength: 20
		    };
		  }

		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, rsassaPssParameterValidator, capture, errors)) {
		    var error = new Error('Cannot read RSASSA-PSS parameter block.');
		    error.errors = errors;
		    throw error;
		  }

		  if(capture.hashOid !== undefined) {
		    params.hash = params.hash || {};
		    params.hash.algorithmOid = asn1.derToOid(capture.hashOid);
		  }

		  if(capture.maskGenOid !== undefined) {
		    params.mgf = params.mgf || {};
		    params.mgf.algorithmOid = asn1.derToOid(capture.maskGenOid);
		    params.mgf.hash = params.mgf.hash || {};
		    params.mgf.hash.algorithmOid = asn1.derToOid(capture.maskGenHashOid);
		  }

		  if(capture.saltLength !== undefined) {
		    params.saltLength = capture.saltLength.charCodeAt(0);
		  }

		  return params;
		};

		/**
		 * Converts an X.509 certificate from PEM format.
		 *
		 * Note: If the certificate is to be verified then compute hash should
		 * be set to true. This will scan the TBSCertificate part of the ASN.1
		 * object while it is converted so it doesn't need to be converted back
		 * to ASN.1-DER-encoding later.
		 *
		 * @param pem the PEM-formatted certificate.
		 * @param computeHash true to compute the hash for verification.
		 * @param strict true to be strict when checking ASN.1 value lengths, false to
		 *          allow truncated values (default: true).
		 *
		 * @return the certificate.
		 */
		pki.certificateFromPem = function(pem, computeHash, strict) {
		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'CERTIFICATE' &&
		    msg.type !== 'X509 CERTIFICATE' &&
		    msg.type !== 'TRUSTED CERTIFICATE') {
		    var error = new Error('Could not convert certificate from PEM; PEM header type ' +
		      'is not "CERTIFICATE", "X509 CERTIFICATE", or "TRUSTED CERTIFICATE".');
		    error.headerType = msg.type;
		    throw error;
		  }
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert certificate from PEM; PEM is encrypted.');
		  }

		  // convert DER to ASN.1 object
		  var obj = asn1.fromDer(msg.body, strict);

		  return pki.certificateFromAsn1(obj, computeHash);
		};

		/**
		 * Converts an X.509 certificate to PEM format.
		 *
		 * @param cert the certificate.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted certificate.
		 */
		pki.certificateToPem = function(cert, maxline) {
		  // convert to ASN.1, then DER, then PEM-encode
		  var msg = {
		    type: 'CERTIFICATE',
		    body: asn1.toDer(pki.certificateToAsn1(cert)).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		/**
		 * Converts an RSA public key from PEM format.
		 *
		 * @param pem the PEM-formatted public key.
		 *
		 * @return the public key.
		 */
		pki.publicKeyFromPem = function(pem) {
		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'PUBLIC KEY' && msg.type !== 'RSA PUBLIC KEY') {
		    var error = new Error('Could not convert public key from PEM; PEM header ' +
		      'type is not "PUBLIC KEY" or "RSA PUBLIC KEY".');
		    error.headerType = msg.type;
		    throw error;
		  }
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert public key from PEM; PEM is encrypted.');
		  }

		  // convert DER to ASN.1 object
		  var obj = asn1.fromDer(msg.body);

		  return pki.publicKeyFromAsn1(obj);
		};

		/**
		 * Converts an RSA public key to PEM format (using a SubjectPublicKeyInfo).
		 *
		 * @param key the public key.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted public key.
		 */
		pki.publicKeyToPem = function(key, maxline) {
		  // convert to ASN.1, then DER, then PEM-encode
		  var msg = {
		    type: 'PUBLIC KEY',
		    body: asn1.toDer(pki.publicKeyToAsn1(key)).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		/**
		 * Converts an RSA public key to PEM format (using an RSAPublicKey).
		 *
		 * @param key the public key.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted public key.
		 */
		pki.publicKeyToRSAPublicKeyPem = function(key, maxline) {
		  // convert to ASN.1, then DER, then PEM-encode
		  var msg = {
		    type: 'RSA PUBLIC KEY',
		    body: asn1.toDer(pki.publicKeyToRSAPublicKey(key)).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		/**
		 * Gets a fingerprint for the given public key.
		 *
		 * @param options the options to use.
		 *          [md] the message digest object to use (defaults to forge.md.sha1).
		 *          [type] the type of fingerprint, such as 'RSAPublicKey',
		 *            'SubjectPublicKeyInfo' (defaults to 'RSAPublicKey').
		 *          [encoding] an alternative output encoding, such as 'hex'
		 *            (defaults to none, outputs a byte buffer).
		 *          [delimiter] the delimiter to use between bytes for 'hex' encoded
		 *            output, eg: ':' (defaults to none).
		 *
		 * @return the fingerprint as a byte buffer or other encoding based on options.
		 */
		pki.getPublicKeyFingerprint = function(key, options) {
		  options = options || {};
		  var md = options.md || forge.md.sha1.create();
		  var type = options.type || 'RSAPublicKey';

		  var bytes;
		  switch(type) {
		  case 'RSAPublicKey':
		    bytes = asn1.toDer(pki.publicKeyToRSAPublicKey(key)).getBytes();
		    break;
		  case 'SubjectPublicKeyInfo':
		    bytes = asn1.toDer(pki.publicKeyToAsn1(key)).getBytes();
		    break;
		  default:
		    throw new Error('Unknown fingerprint type "' + options.type + '".');
		  }

		  // hash public key bytes
		  md.start();
		  md.update(bytes);
		  var digest = md.digest();
		  if(options.encoding === 'hex') {
		    var hex = digest.toHex();
		    if(options.delimiter) {
		      return hex.match(/.{2}/g).join(options.delimiter);
		    }
		    return hex;
		  } else if(options.encoding === 'binary') {
		    return digest.getBytes();
		  } else if(options.encoding) {
		    throw new Error('Unknown encoding "' + options.encoding + '".');
		  }
		  return digest;
		};

		/**
		 * Converts a PKCS#10 certification request (CSR) from PEM format.
		 *
		 * Note: If the certification request is to be verified then compute hash
		 * should be set to true. This will scan the CertificationRequestInfo part of
		 * the ASN.1 object while it is converted so it doesn't need to be converted
		 * back to ASN.1-DER-encoding later.
		 *
		 * @param pem the PEM-formatted certificate.
		 * @param computeHash true to compute the hash for verification.
		 * @param strict true to be strict when checking ASN.1 value lengths, false to
		 *          allow truncated values (default: true).
		 *
		 * @return the certification request (CSR).
		 */
		pki.certificationRequestFromPem = function(pem, computeHash, strict) {
		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'CERTIFICATE REQUEST') {
		    var error = new Error('Could not convert certification request from PEM; ' +
		      'PEM header type is not "CERTIFICATE REQUEST".');
		    error.headerType = msg.type;
		    throw error;
		  }
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert certification request from PEM; ' +
		      'PEM is encrypted.');
		  }

		  // convert DER to ASN.1 object
		  var obj = asn1.fromDer(msg.body, strict);

		  return pki.certificationRequestFromAsn1(obj, computeHash);
		};

		/**
		 * Converts a PKCS#10 certification request (CSR) to PEM format.
		 *
		 * @param csr the certification request.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted certification request.
		 */
		pki.certificationRequestToPem = function(csr, maxline) {
		  // convert to ASN.1, then DER, then PEM-encode
		  var msg = {
		    type: 'CERTIFICATE REQUEST',
		    body: asn1.toDer(pki.certificationRequestToAsn1(csr)).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		/**
		 * Creates an empty X.509v3 RSA certificate.
		 *
		 * @return the certificate.
		 */
		pki.createCertificate = function() {
		  var cert = {};
		  cert.version = 0x02;
		  cert.serialNumber = '00';
		  cert.signatureOid = null;
		  cert.signature = null;
		  cert.siginfo = {};
		  cert.siginfo.algorithmOid = null;
		  cert.validity = {};
		  cert.validity.notBefore = new Date();
		  cert.validity.notAfter = new Date();

		  cert.issuer = {};
		  cert.issuer.getField = function(sn) {
		    return _getAttribute(cert.issuer, sn);
		  };
		  cert.issuer.addField = function(attr) {
		    _fillMissingFields([attr]);
		    cert.issuer.attributes.push(attr);
		  };
		  cert.issuer.attributes = [];
		  cert.issuer.hash = null;

		  cert.subject = {};
		  cert.subject.getField = function(sn) {
		    return _getAttribute(cert.subject, sn);
		  };
		  cert.subject.addField = function(attr) {
		    _fillMissingFields([attr]);
		    cert.subject.attributes.push(attr);
		  };
		  cert.subject.attributes = [];
		  cert.subject.hash = null;

		  cert.extensions = [];
		  cert.publicKey = null;
		  cert.md = null;

		  /**
		   * Sets the subject of this certificate.
		   *
		   * @param attrs the array of subject attributes to use.
		   * @param uniqueId an optional a unique ID to use.
		   */
		  cert.setSubject = function(attrs, uniqueId) {
		    // set new attributes, clear hash
		    _fillMissingFields(attrs);
		    cert.subject.attributes = attrs;
		    delete cert.subject.uniqueId;
		    if(uniqueId) {
		      cert.subject.uniqueId = uniqueId;
		    }
		    cert.subject.hash = null;
		  };

		  /**
		   * Sets the issuer of this certificate.
		   *
		   * @param attrs the array of issuer attributes to use.
		   * @param uniqueId an optional a unique ID to use.
		   */
		  cert.setIssuer = function(attrs, uniqueId) {
		    // set new attributes, clear hash
		    _fillMissingFields(attrs);
		    cert.issuer.attributes = attrs;
		    delete cert.issuer.uniqueId;
		    if(uniqueId) {
		      cert.issuer.uniqueId = uniqueId;
		    }
		    cert.issuer.hash = null;
		  };

		  /**
		   * Sets the extensions of this certificate.
		   *
		   * @param exts the array of extensions to use.
		   */
		  cert.setExtensions = function(exts) {
		    for(var i = 0; i < exts.length; ++i) {
		      _fillMissingExtensionFields(exts[i], {cert: cert});
		    }
		    // set new extensions
		    cert.extensions = exts;
		  };

		  /**
		   * Gets an extension by its name or id.
		   *
		   * @param options the name to use or an object with:
		   *          name the name to use.
		   *          id the id to use.
		   *
		   * @return the extension or null if not found.
		   */
		  cert.getExtension = function(options) {
		    if(typeof options === 'string') {
		      options = {name: options};
		    }

		    var rval = null;
		    var ext;
		    for(var i = 0; rval === null && i < cert.extensions.length; ++i) {
		      ext = cert.extensions[i];
		      if(options.id && ext.id === options.id) {
		        rval = ext;
		      } else if(options.name && ext.name === options.name) {
		        rval = ext;
		      }
		    }
		    return rval;
		  };

		  /**
		   * Signs this certificate using the given private key.
		   *
		   * @param key the private key to sign with.
		   * @param md the message digest object to use (defaults to forge.md.sha1).
		   */
		  cert.sign = function(key, md) {
		    // TODO: get signature OID from private key
		    cert.md = md || forge.md.sha1.create();
		    var algorithmOid = oids[cert.md.algorithm + 'WithRSAEncryption'];
		    if(!algorithmOid) {
		      var error = new Error('Could not compute certificate digest. ' +
		        'Unknown message digest algorithm OID.');
		      error.algorithm = cert.md.algorithm;
		      throw error;
		    }
		    cert.signatureOid = cert.siginfo.algorithmOid = algorithmOid;

		    // get TBSCertificate, convert to DER
		    cert.tbsCertificate = pki.getTBSCertificate(cert);
		    var bytes = asn1.toDer(cert.tbsCertificate);

		    // digest and sign
		    cert.md.update(bytes.getBytes());
		    cert.signature = key.sign(cert.md);
		  };

		  /**
		   * Attempts verify the signature on the passed certificate using this
		   * certificate's public key.
		   *
		   * @param child the certificate to verify.
		   *
		   * @return true if verified, false if not.
		   */
		  cert.verify = function(child) {
		    var rval = false;

		    if(!cert.issued(child)) {
		      var issuer = child.issuer;
		      var subject = cert.subject;
		      var error = new Error('The parent certificate did not issue the given child ' +
		        'certificate; the child certificate\'s issuer does not match the ' +
		        'parent\'s subject.');
		      error.expectedIssuer = issuer.attributes;
		      error.actualIssuer = subject.attributes;
		      throw error;
		    }

		    var md = child.md;
		    if(md === null) {
		      // check signature OID for supported signature types
		      if(child.signatureOid in oids) {
		        var oid = oids[child.signatureOid];
		        switch(oid) {
		        case 'sha1WithRSAEncryption':
		          md = forge.md.sha1.create();
		          break;
		        case 'md5WithRSAEncryption':
		          md = forge.md.md5.create();
		          break;
		        case 'sha256WithRSAEncryption':
		          md = forge.md.sha256.create();
		          break;
		        case 'sha512WithRSAEncryption':
		          md = forge.md.sha512.create();
		          break;
		        case 'RSASSA-PSS':
		          md = forge.md.sha256.create();
		          break;
		        }
		      }
		      if(md === null) {
		        var error = new Error('Could not compute certificate digest. ' +
		          'Unknown signature OID.');
		        error.signatureOid = child.signatureOid;
		        throw error;
		      }

		      // produce DER formatted TBSCertificate and digest it
		      var tbsCertificate = child.tbsCertificate || pki.getTBSCertificate(child);
		      var bytes = asn1.toDer(tbsCertificate);
		      md.update(bytes.getBytes());
		    }

		    if(md !== null) {
		      var scheme;

		      switch(child.signatureOid) {
		      case oids.sha1WithRSAEncryption:
		        scheme = undefined;  /* use PKCS#1 v1.5 padding scheme */
		        break;
		      case oids['RSASSA-PSS']:
		        var hash, mgf;

		        /* initialize mgf */
		        hash = oids[child.signatureParameters.mgf.hash.algorithmOid];
		        if(hash === undefined || forge.md[hash] === undefined) {
		          var error = new Error('Unsupported MGF hash function.');
		          error.oid = child.signatureParameters.mgf.hash.algorithmOid;
		          error.name = hash;
		          throw error;
		        }

		        mgf = oids[child.signatureParameters.mgf.algorithmOid];
		        if(mgf === undefined || forge.mgf[mgf] === undefined) {
		          var error = new Error('Unsupported MGF function.');
		          error.oid = child.signatureParameters.mgf.algorithmOid;
		          error.name = mgf;
		          throw error;
		        }

		        mgf = forge.mgf[mgf].create(forge.md[hash].create());

		        /* initialize hash function */
		        hash = oids[child.signatureParameters.hash.algorithmOid];
		        if(hash === undefined || forge.md[hash] === undefined) {
		          throw {
		            message: 'Unsupported RSASSA-PSS hash function.',
		            oid: child.signatureParameters.hash.algorithmOid,
		            name: hash
		          };
		        }

		        scheme = forge.pss.create(forge.md[hash].create(), mgf,
		          child.signatureParameters.saltLength);
		        break;
		      }

		      // verify signature on cert using public key
		      rval = cert.publicKey.verify(
		        md.digest().getBytes(), child.signature, scheme);
		    }

		    return rval;
		  };

		  /**
		   * Returns true if this certificate's issuer matches the passed
		   * certificate's subject. Note that no signature check is performed.
		   *
		   * @param parent the certificate to check.
		   *
		   * @return true if this certificate's issuer matches the passed certificate's
		   *         subject.
		   */
		  cert.isIssuer = function(parent) {
		    var rval = false;

		    var i = cert.issuer;
		    var s = parent.subject;

		    // compare hashes if present
		    if(i.hash && s.hash) {
		      rval = (i.hash === s.hash);
		    } else if(i.attributes.length === s.attributes.length) {
		      // all attributes are the same so issuer matches subject
		      rval = true;
		      var iattr, sattr;
		      for(var n = 0; rval && n < i.attributes.length; ++n) {
		        iattr = i.attributes[n];
		        sattr = s.attributes[n];
		        if(iattr.type !== sattr.type || iattr.value !== sattr.value) {
		          // attribute mismatch
		          rval = false;
		        }
		      }
		    }

		    return rval;
		  };

		  /**
		   * Returns true if this certificate's subject matches the issuer of the
		   * given certificate). Note that not signature check is performed.
		   *
		   * @param child the certificate to check.
		   *
		   * @return true if this certificate's subject matches the passed
		   *         certificate's issuer.
		   */
		  cert.issued = function(child) {
		    return child.isIssuer(cert);
		  };

		  /**
		   * Generates the subjectKeyIdentifier for this certificate as byte buffer.
		   *
		   * @return the subjectKeyIdentifier for this certificate as byte buffer.
		   */
		  cert.generateSubjectKeyIdentifier = function() {
		    /* See: 4.2.1.2 section of the the RFC3280, keyIdentifier is either:

		      (1) The keyIdentifier is composed of the 160-bit SHA-1 hash of the
		        value of the BIT STRING subjectPublicKey (excluding the tag,
		        length, and number of unused bits).

		      (2) The keyIdentifier is composed of a four bit type field with
		        the value 0100 followed by the least significant 60 bits of the
		        SHA-1 hash of the value of the BIT STRING subjectPublicKey
		        (excluding the tag, length, and number of unused bit string bits).
		    */

		    // skipping the tag, length, and number of unused bits is the same
		    // as just using the RSAPublicKey (for RSA keys, which are the
		    // only ones supported)
		    return pki.getPublicKeyFingerprint(cert.publicKey, {type: 'RSAPublicKey'});
		  };

		  /**
		   * Verifies the subjectKeyIdentifier extension value for this certificate
		   * against its public key. If no extension is found, false will be
		   * returned.
		   *
		   * @return true if verified, false if not.
		   */
		  cert.verifySubjectKeyIdentifier = function() {
		    var oid = oids['subjectKeyIdentifier'];
		    for(var i = 0; i < cert.extensions.length; ++i) {
		      var ext = cert.extensions[i];
		      if(ext.id === oid) {
		        var ski = cert.generateSubjectKeyIdentifier().getBytes();
		        return (forge.util.hexToBytes(ext.subjectKeyIdentifier) === ski);
		      }
		    }
		    return false;
		  };

		  return cert;
		};

		/**
		 * Converts an X.509v3 RSA certificate from an ASN.1 object.
		 *
		 * Note: If the certificate is to be verified then compute hash should
		 * be set to true. There is currently no implementation for converting
		 * a certificate back to ASN.1 so the TBSCertificate part of the ASN.1
		 * object needs to be scanned before the cert object is created.
		 *
		 * @param obj the asn1 representation of an X.509v3 RSA certificate.
		 * @param computeHash true to compute the hash for verification.
		 *
		 * @return the certificate.
		 */
		pki.certificateFromAsn1 = function(obj, computeHash) {
		  // validate certificate and capture data
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, x509CertificateValidator, capture, errors)) {
		    var error = new Error('Cannot read X.509 certificate. ' +
		      'ASN.1 object is not an X509v3 Certificate.');
		    error.errors = errors;
		    throw error;
		  }

		  // ensure signature is not interpreted as an embedded ASN.1 object
		  if(typeof capture.certSignature !== 'string') {
		    var certSignature = '\x00';
		    for(var i = 0; i < capture.certSignature.length; ++i) {
		      certSignature += asn1.toDer(capture.certSignature[i]).getBytes();
		    }
		    capture.certSignature = certSignature;
		  }

		  // get oid
		  var oid = asn1.derToOid(capture.publicKeyOid);
		  if(oid !== pki.oids['rsaEncryption']) {
		    throw new Error('Cannot read public key. OID is not RSA.');
		  }

		  // create certificate
		  var cert = pki.createCertificate();
		  cert.version = capture.certVersion ?
		    capture.certVersion.charCodeAt(0) : 0;
		  var serial = forge.util.createBuffer(capture.certSerialNumber);
		  cert.serialNumber = serial.toHex();
		  cert.signatureOid = forge.asn1.derToOid(capture.certSignatureOid);
		  cert.signatureParameters = _readSignatureParameters(
		    cert.signatureOid, capture.certSignatureParams, true);
		  cert.siginfo.algorithmOid = forge.asn1.derToOid(capture.certinfoSignatureOid);
		  cert.siginfo.parameters = _readSignatureParameters(cert.siginfo.algorithmOid,
		    capture.certinfoSignatureParams, false);
		  // skip "unused bits" in signature value BITSTRING
		  var signature = forge.util.createBuffer(capture.certSignature);
		  ++signature.read;
		  cert.signature = signature.getBytes();

		  var validity = [];
		  if(capture.certValidity1UTCTime !== undefined) {
		    validity.push(asn1.utcTimeToDate(capture.certValidity1UTCTime));
		  }
		  if(capture.certValidity2GeneralizedTime !== undefined) {
		    validity.push(asn1.generalizedTimeToDate(
		      capture.certValidity2GeneralizedTime));
		  }
		  if(capture.certValidity3UTCTime !== undefined) {
		    validity.push(asn1.utcTimeToDate(capture.certValidity3UTCTime));
		  }
		  if(capture.certValidity4GeneralizedTime !== undefined) {
		    validity.push(asn1.generalizedTimeToDate(
		      capture.certValidity4GeneralizedTime));
		  }
		  if(validity.length > 2) {
		    throw new Error('Cannot read notBefore/notAfter validity times; more ' +
		      'than two times were provided in the certificate.');
		  }
		  if(validity.length < 2) {
		    throw new Error('Cannot read notBefore/notAfter validity times; they ' +
		      'were not provided as either UTCTime or GeneralizedTime.');
		  }
		  cert.validity.notBefore = validity[0];
		  cert.validity.notAfter = validity[1];

		  // keep TBSCertificate to preserve signature when exporting
		  cert.tbsCertificate = capture.tbsCertificate;

		  if(computeHash) {
		    // check signature OID for supported signature types
		    cert.md = null;
		    if(cert.signatureOid in oids) {
		      var oid = oids[cert.signatureOid];
		      switch(oid) {
		      case 'sha1WithRSAEncryption':
		        cert.md = forge.md.sha1.create();
		        break;
		      case 'md5WithRSAEncryption':
		        cert.md = forge.md.md5.create();
		        break;
		      case 'sha256WithRSAEncryption':
		        cert.md = forge.md.sha256.create();
		        break;
		      case 'sha512WithRSAEncryption':
		        cert.md = forge.md.sha512.create();
		        break;
		      case 'RSASSA-PSS':
		        cert.md = forge.md.sha256.create();
		        break;
		      }
		    }
		    if(cert.md === null) {
		      var error = new Error('Could not compute certificate digest. ' +
		        'Unknown signature OID.');
		      error.signatureOid = cert.signatureOid;
		      throw error;
		    }

		    // produce DER formatted TBSCertificate and digest it
		    var bytes = asn1.toDer(cert.tbsCertificate);
		    cert.md.update(bytes.getBytes());
		  }

		  // handle issuer, build issuer message digest
		  var imd = forge.md.sha1.create();
		  cert.issuer.getField = function(sn) {
		    return _getAttribute(cert.issuer, sn);
		  };
		  cert.issuer.addField = function(attr) {
		    _fillMissingFields([attr]);
		    cert.issuer.attributes.push(attr);
		  };
		  cert.issuer.attributes = pki.RDNAttributesAsArray(capture.certIssuer, imd);
		  if(capture.certIssuerUniqueId) {
		    cert.issuer.uniqueId = capture.certIssuerUniqueId;
		  }
		  cert.issuer.hash = imd.digest().toHex();

		  // handle subject, build subject message digest
		  var smd = forge.md.sha1.create();
		  cert.subject.getField = function(sn) {
		    return _getAttribute(cert.subject, sn);
		  };
		  cert.subject.addField = function(attr) {
		    _fillMissingFields([attr]);
		    cert.subject.attributes.push(attr);
		  };
		  cert.subject.attributes = pki.RDNAttributesAsArray(capture.certSubject, smd);
		  if(capture.certSubjectUniqueId) {
		    cert.subject.uniqueId = capture.certSubjectUniqueId;
		  }
		  cert.subject.hash = smd.digest().toHex();

		  // handle extensions
		  if(capture.certExtensions) {
		    cert.extensions = pki.certificateExtensionsFromAsn1(capture.certExtensions);
		  } else {
		    cert.extensions = [];
		  }

		  // convert RSA public key from ASN.1
		  cert.publicKey = pki.publicKeyFromAsn1(capture.subjectPublicKeyInfo);

		  return cert;
		};

		/**
		 * Converts an ASN.1 extensions object (with extension sequences as its
		 * values) into an array of extension objects with types and values.
		 *
		 * Supported extensions:
		 *
		 * id-ce-keyUsage OBJECT IDENTIFIER ::=  { id-ce 15 }
		 * KeyUsage ::= BIT STRING {
		 *   digitalSignature        (0),
		 *   nonRepudiation          (1),
		 *   keyEncipherment         (2),
		 *   dataEncipherment        (3),
		 *   keyAgreement            (4),
		 *   keyCertSign             (5),
		 *   cRLSign                 (6),
		 *   encipherOnly            (7),
		 *   decipherOnly            (8)
		 * }
		 *
		 * id-ce-basicConstraints OBJECT IDENTIFIER ::=  { id-ce 19 }
		 * BasicConstraints ::= SEQUENCE {
		 *   cA                      BOOLEAN DEFAULT FALSE,
		 *   pathLenConstraint       INTEGER (0..MAX) OPTIONAL
		 * }
		 *
		 * subjectAltName EXTENSION ::= {
		 *   SYNTAX GeneralNames
		 *   IDENTIFIED BY id-ce-subjectAltName
		 * }
		 *
		 * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName
		 *
		 * GeneralName ::= CHOICE {
		 *   otherName      [0] INSTANCE OF OTHER-NAME,
		 *   rfc822Name     [1] IA5String,
		 *   dNSName        [2] IA5String,
		 *   x400Address    [3] ORAddress,
		 *   directoryName  [4] Name,
		 *   ediPartyName   [5] EDIPartyName,
		 *   uniformResourceIdentifier [6] IA5String,
		 *   IPAddress      [7] OCTET STRING,
		 *   registeredID   [8] OBJECT IDENTIFIER
		 * }
		 *
		 * OTHER-NAME ::= TYPE-IDENTIFIER
		 *
		 * EDIPartyName ::= SEQUENCE {
		 *   nameAssigner [0] DirectoryString {ub-name} OPTIONAL,
		 *   partyName    [1] DirectoryString {ub-name}
		 * }
		 *
		 * @param exts the extensions ASN.1 with extension sequences to parse.
		 *
		 * @return the array.
		 */
		pki.certificateExtensionsFromAsn1 = function(exts) {
		  var rval = [];
		  for(var i = 0; i < exts.value.length; ++i) {
		    // get extension sequence
		    var extseq = exts.value[i];
		    for(var ei = 0; ei < extseq.value.length; ++ei) {
		      rval.push(pki.certificateExtensionFromAsn1(extseq.value[ei]));
		    }
		  }

		  return rval;
		};

		/**
		 * Parses a single certificate extension from ASN.1.
		 *
		 * @param ext the extension in ASN.1 format.
		 *
		 * @return the parsed extension as an object.
		 */
		pki.certificateExtensionFromAsn1 = function(ext) {
		  // an extension has:
		  // [0] extnID      OBJECT IDENTIFIER
		  // [1] critical    BOOLEAN DEFAULT FALSE
		  // [2] extnValue   OCTET STRING
		  var e = {};
		  e.id = asn1.derToOid(ext.value[0].value);
		  e.critical = false;
		  if(ext.value[1].type === asn1.Type.BOOLEAN) {
		    e.critical = (ext.value[1].value.charCodeAt(0) !== 0x00);
		    e.value = ext.value[2].value;
		  } else {
		    e.value = ext.value[1].value;
		  }
		  // if the oid is known, get its name
		  if(e.id in oids) {
		    e.name = oids[e.id];

		    // handle key usage
		    if(e.name === 'keyUsage') {
		      // get value as BIT STRING
		      var ev = asn1.fromDer(e.value);
		      var b2 = 0x00;
		      var b3 = 0x00;
		      if(ev.value.length > 1) {
		        // skip first byte, just indicates unused bits which
		        // will be padded with 0s anyway
		        // get bytes with flag bits
		        b2 = ev.value.charCodeAt(1);
		        b3 = ev.value.length > 2 ? ev.value.charCodeAt(2) : 0;
		      }
		      // set flags
		      e.digitalSignature = (b2 & 0x80) === 0x80;
		      e.nonRepudiation = (b2 & 0x40) === 0x40;
		      e.keyEncipherment = (b2 & 0x20) === 0x20;
		      e.dataEncipherment = (b2 & 0x10) === 0x10;
		      e.keyAgreement = (b2 & 0x08) === 0x08;
		      e.keyCertSign = (b2 & 0x04) === 0x04;
		      e.cRLSign = (b2 & 0x02) === 0x02;
		      e.encipherOnly = (b2 & 0x01) === 0x01;
		      e.decipherOnly = (b3 & 0x80) === 0x80;
		    } else if(e.name === 'basicConstraints') {
		      // handle basic constraints
		      // get value as SEQUENCE
		      var ev = asn1.fromDer(e.value);
		      // get cA BOOLEAN flag (defaults to false)
		      if(ev.value.length > 0 && ev.value[0].type === asn1.Type.BOOLEAN) {
		        e.cA = (ev.value[0].value.charCodeAt(0) !== 0x00);
		      } else {
		        e.cA = false;
		      }
		      // get path length constraint
		      var value = null;
		      if(ev.value.length > 0 && ev.value[0].type === asn1.Type.INTEGER) {
		        value = ev.value[0].value;
		      } else if(ev.value.length > 1) {
		        value = ev.value[1].value;
		      }
		      if(value !== null) {
		        e.pathLenConstraint = asn1.derToInteger(value);
		      }
		    } else if(e.name === 'extKeyUsage') {
		      // handle extKeyUsage
		      // value is a SEQUENCE of OIDs
		      var ev = asn1.fromDer(e.value);
		      for(var vi = 0; vi < ev.value.length; ++vi) {
		        var oid = asn1.derToOid(ev.value[vi].value);
		        if(oid in oids) {
		          e[oids[oid]] = true;
		        } else {
		          e[oid] = true;
		        }
		      }
		    } else if(e.name === 'nsCertType') {
		      // handle nsCertType
		      // get value as BIT STRING
		      var ev = asn1.fromDer(e.value);
		      var b2 = 0x00;
		      if(ev.value.length > 1) {
		        // skip first byte, just indicates unused bits which
		        // will be padded with 0s anyway
		        // get bytes with flag bits
		        b2 = ev.value.charCodeAt(1);
		      }
		      // set flags
		      e.client = (b2 & 0x80) === 0x80;
		      e.server = (b2 & 0x40) === 0x40;
		      e.email = (b2 & 0x20) === 0x20;
		      e.objsign = (b2 & 0x10) === 0x10;
		      e.reserved = (b2 & 0x08) === 0x08;
		      e.sslCA = (b2 & 0x04) === 0x04;
		      e.emailCA = (b2 & 0x02) === 0x02;
		      e.objCA = (b2 & 0x01) === 0x01;
		    } else if(
		      e.name === 'subjectAltName' ||
		      e.name === 'issuerAltName') {
		      // handle subjectAltName/issuerAltName
		      e.altNames = [];

		      // ev is a SYNTAX SEQUENCE
		      var gn;
		      var ev = asn1.fromDer(e.value);
		      for(var n = 0; n < ev.value.length; ++n) {
		        // get GeneralName
		        gn = ev.value[n];

		        var altName = {
		          type: gn.type,
		          value: gn.value
		        };
		        e.altNames.push(altName);

		        // Note: Support for types 1,2,6,7,8
		        switch(gn.type) {
		        // rfc822Name
		        case 1:
		        // dNSName
		        case 2:
		        // uniformResourceIdentifier (URI)
		        case 6:
		          break;
		        // IPAddress
		        case 7:
		          // convert to IPv4/IPv6 string representation
		          altName.ip = forge.util.bytesToIP(gn.value);
		          break;
		        // registeredID
		        case 8:
		          altName.oid = asn1.derToOid(gn.value);
		          break;
		        default:
		          // unsupported
		        }
		      }
		    } else if(e.name === 'subjectKeyIdentifier') {
		      // value is an OCTETSTRING w/the hash of the key-type specific
		      // public key structure (eg: RSAPublicKey)
		      var ev = asn1.fromDer(e.value);
		      e.subjectKeyIdentifier = forge.util.bytesToHex(ev.value);
		    }
		  }
		  return e;
		};

		/**
		 * Converts a PKCS#10 certification request (CSR) from an ASN.1 object.
		 *
		 * Note: If the certification request is to be verified then compute hash
		 * should be set to true. There is currently no implementation for converting
		 * a certificate back to ASN.1 so the CertificationRequestInfo part of the
		 * ASN.1 object needs to be scanned before the csr object is created.
		 *
		 * @param obj the asn1 representation of a PKCS#10 certification request (CSR).
		 * @param computeHash true to compute the hash for verification.
		 *
		 * @return the certification request (CSR).
		 */
		pki.certificationRequestFromAsn1 = function(obj, computeHash) {
		  // validate certification request and capture data
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, certificationRequestValidator, capture, errors)) {
		    var error = new Error('Cannot read PKCS#10 certificate request. ' +
		      'ASN.1 object is not a PKCS#10 CertificationRequest.');
		    error.errors = errors;
		    throw error;
		  }

		  // ensure signature is not interpreted as an embedded ASN.1 object
		  if(typeof capture.csrSignature !== 'string') {
		    var csrSignature = '\x00';
		    for(var i = 0; i < capture.csrSignature.length; ++i) {
		      csrSignature += asn1.toDer(capture.csrSignature[i]).getBytes();
		    }
		    capture.csrSignature = csrSignature;
		  }

		  // get oid
		  var oid = asn1.derToOid(capture.publicKeyOid);
		  if(oid !== pki.oids.rsaEncryption) {
		    throw new Error('Cannot read public key. OID is not RSA.');
		  }

		  // create certification request
		  var csr = pki.createCertificationRequest();
		  csr.version = capture.csrVersion ? capture.csrVersion.charCodeAt(0) : 0;
		  csr.signatureOid = forge.asn1.derToOid(capture.csrSignatureOid);
		  csr.signatureParameters = _readSignatureParameters(
		    csr.signatureOid, capture.csrSignatureParams, true);
		  csr.siginfo.algorithmOid = forge.asn1.derToOid(capture.csrSignatureOid);
		  csr.siginfo.parameters = _readSignatureParameters(
		    csr.siginfo.algorithmOid, capture.csrSignatureParams, false);
		  // skip "unused bits" in signature value BITSTRING
		  var signature = forge.util.createBuffer(capture.csrSignature);
		  ++signature.read;
		  csr.signature = signature.getBytes();

		  // keep CertificationRequestInfo to preserve signature when exporting
		  csr.certificationRequestInfo = capture.certificationRequestInfo;

		  if(computeHash) {
		    // check signature OID for supported signature types
		    csr.md = null;
		    if(csr.signatureOid in oids) {
		      var oid = oids[csr.signatureOid];
		      switch(oid) {
		      case 'sha1WithRSAEncryption':
		        csr.md = forge.md.sha1.create();
		        break;
		      case 'md5WithRSAEncryption':
		        csr.md = forge.md.md5.create();
		        break;
		      case 'sha256WithRSAEncryption':
		        csr.md = forge.md.sha256.create();
		        break;
		      case 'sha512WithRSAEncryption':
		        csr.md = forge.md.sha512.create();
		        break;
		      case 'RSASSA-PSS':
		        csr.md = forge.md.sha256.create();
		        break;
		      }
		    }
		    if(csr.md === null) {
		      var error = new Error('Could not compute certification request digest. ' +
		        'Unknown signature OID.');
		      error.signatureOid = csr.signatureOid;
		      throw error;
		    }

		    // produce DER formatted CertificationRequestInfo and digest it
		    var bytes = asn1.toDer(csr.certificationRequestInfo);
		    csr.md.update(bytes.getBytes());
		  }

		  // handle subject, build subject message digest
		  var smd = forge.md.sha1.create();
		  csr.subject.getField = function(sn) {
		    return _getAttribute(csr.subject, sn);
		  };
		  csr.subject.addField = function(attr) {
		    _fillMissingFields([attr]);
		    csr.subject.attributes.push(attr);
		  };
		  csr.subject.attributes = pki.RDNAttributesAsArray(
		    capture.certificationRequestInfoSubject, smd);
		  csr.subject.hash = smd.digest().toHex();

		  // convert RSA public key from ASN.1
		  csr.publicKey = pki.publicKeyFromAsn1(capture.subjectPublicKeyInfo);

		  // convert attributes from ASN.1
		  csr.getAttribute = function(sn) {
		    return _getAttribute(csr, sn);
		  };
		  csr.addAttribute = function(attr) {
		    _fillMissingFields([attr]);
		    csr.attributes.push(attr);
		  };
		  csr.attributes = pki.CRIAttributesAsArray(
		    capture.certificationRequestInfoAttributes || []);

		  return csr;
		};

		/**
		 * Creates an empty certification request (a CSR or certificate signing
		 * request). Once created, its public key and attributes can be set and then
		 * it can be signed.
		 *
		 * @return the empty certification request.
		 */
		pki.createCertificationRequest = function() {
		  var csr = {};
		  csr.version = 0x00;
		  csr.signatureOid = null;
		  csr.signature = null;
		  csr.siginfo = {};
		  csr.siginfo.algorithmOid = null;

		  csr.subject = {};
		  csr.subject.getField = function(sn) {
		    return _getAttribute(csr.subject, sn);
		  };
		  csr.subject.addField = function(attr) {
		    _fillMissingFields([attr]);
		    csr.subject.attributes.push(attr);
		  };
		  csr.subject.attributes = [];
		  csr.subject.hash = null;

		  csr.publicKey = null;
		  csr.attributes = [];
		  csr.getAttribute = function(sn) {
		    return _getAttribute(csr, sn);
		  };
		  csr.addAttribute = function(attr) {
		    _fillMissingFields([attr]);
		    csr.attributes.push(attr);
		  };
		  csr.md = null;

		  /**
		   * Sets the subject of this certification request.
		   *
		   * @param attrs the array of subject attributes to use.
		   */
		  csr.setSubject = function(attrs) {
		    // set new attributes
		    _fillMissingFields(attrs);
		    csr.subject.attributes = attrs;
		    csr.subject.hash = null;
		  };

		  /**
		   * Sets the attributes of this certification request.
		   *
		   * @param attrs the array of attributes to use.
		   */
		  csr.setAttributes = function(attrs) {
		    // set new attributes
		    _fillMissingFields(attrs);
		    csr.attributes = attrs;
		  };

		  /**
		   * Signs this certification request using the given private key.
		   *
		   * @param key the private key to sign with.
		   * @param md the message digest object to use (defaults to forge.md.sha1).
		   */
		  csr.sign = function(key, md) {
		    // TODO: get signature OID from private key
		    csr.md = md || forge.md.sha1.create();
		    var algorithmOid = oids[csr.md.algorithm + 'WithRSAEncryption'];
		    if(!algorithmOid) {
		      var error = new Error('Could not compute certification request digest. ' +
		        'Unknown message digest algorithm OID.');
		      error.algorithm = csr.md.algorithm;
		      throw error;
		    }
		    csr.signatureOid = csr.siginfo.algorithmOid = algorithmOid;

		    // get CertificationRequestInfo, convert to DER
		    csr.certificationRequestInfo = pki.getCertificationRequestInfo(csr);
		    var bytes = asn1.toDer(csr.certificationRequestInfo);

		    // digest and sign
		    csr.md.update(bytes.getBytes());
		    csr.signature = key.sign(csr.md);
		  };

		  /**
		   * Attempts verify the signature on the passed certification request using
		   * its public key.
		   *
		   * A CSR that has been exported to a file in PEM format can be verified using
		   * OpenSSL using this command:
		   *
		   * openssl req -in <the-csr-pem-file> -verify -noout -text
		   *
		   * @return true if verified, false if not.
		   */
		  csr.verify = function() {
		    var rval = false;

		    var md = csr.md;
		    if(md === null) {
		      // check signature OID for supported signature types
		      if(csr.signatureOid in oids) {
		        // TODO: create DRY `OID to md` function
		        var oid = oids[csr.signatureOid];
		        switch(oid) {
		        case 'sha1WithRSAEncryption':
		          md = forge.md.sha1.create();
		          break;
		        case 'md5WithRSAEncryption':
		          md = forge.md.md5.create();
		          break;
		        case 'sha256WithRSAEncryption':
		          md = forge.md.sha256.create();
		          break;
		        case 'sha512WithRSAEncryption':
		          md = forge.md.sha512.create();
		          break;
		        case 'RSASSA-PSS':
		          md = forge.md.sha256.create();
		          break;
		        }
		      }
		      if(md === null) {
		        var error = new Error('Could not compute certification request digest. ' +
		          'Unknown signature OID.');
		        error.signatureOid = csr.signatureOid;
		        throw error;
		      }

		      // produce DER formatted CertificationRequestInfo and digest it
		      var cri = csr.certificationRequestInfo ||
		        pki.getCertificationRequestInfo(csr);
		      var bytes = asn1.toDer(cri);
		      md.update(bytes.getBytes());
		    }

		    if(md !== null) {
		      var scheme;

		      switch(csr.signatureOid) {
		      case oids.sha1WithRSAEncryption:
		        /* use PKCS#1 v1.5 padding scheme */
		        break;
		      case oids['RSASSA-PSS']:
		        var hash, mgf;

		        /* initialize mgf */
		        hash = oids[csr.signatureParameters.mgf.hash.algorithmOid];
		        if(hash === undefined || forge.md[hash] === undefined) {
		          var error = new Error('Unsupported MGF hash function.');
		          error.oid = csr.signatureParameters.mgf.hash.algorithmOid;
		          error.name = hash;
		          throw error;
		        }

		        mgf = oids[csr.signatureParameters.mgf.algorithmOid];
		        if(mgf === undefined || forge.mgf[mgf] === undefined) {
		          var error = new Error('Unsupported MGF function.');
		          error.oid = csr.signatureParameters.mgf.algorithmOid;
		          error.name = mgf;
		          throw error;
		        }

		        mgf = forge.mgf[mgf].create(forge.md[hash].create());

		        /* initialize hash function */
		        hash = oids[csr.signatureParameters.hash.algorithmOid];
		        if(hash === undefined || forge.md[hash] === undefined) {
		          var error = new Error('Unsupported RSASSA-PSS hash function.');
		          error.oid = csr.signatureParameters.hash.algorithmOid;
		          error.name = hash;
		          throw error;
		        }

		        scheme = forge.pss.create(forge.md[hash].create(), mgf,
		          csr.signatureParameters.saltLength);
		        break;
		      }

		      // verify signature on csr using its public key
		      rval = csr.publicKey.verify(
		        md.digest().getBytes(), csr.signature, scheme);
		    }

		    return rval;
		  };

		  return csr;
		};

		/**
		 * Converts an X.509 subject or issuer to an ASN.1 RDNSequence.
		 *
		 * @param obj the subject or issuer (distinguished name).
		 *
		 * @return the ASN.1 RDNSequence.
		 */
		function _dnToAsn1(obj) {
		  // create an empty RDNSequence
		  var rval = asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);

		  // iterate over attributes
		  var attr, set;
		  var attrs = obj.attributes;
		  for(var i = 0; i < attrs.length; ++i) {
		    attr = attrs[i];
		    var value = attr.value;

		    // reuse tag class for attribute value if available
		    var valueTagClass = asn1.Type.PRINTABLESTRING;
		    if('valueTagClass' in attr) {
		      valueTagClass = attr.valueTagClass;

		      if(valueTagClass === asn1.Type.UTF8) {
		        value = forge.util.encodeUtf8(value);
		      }
		      // FIXME: handle more encodings
		    }

		    // create a RelativeDistinguishedName set
		    // each value in the set is an AttributeTypeAndValue first
		    // containing the type (an OID) and second the value
		    set = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // AttributeType
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(attr.type).getBytes()),
		        // AttributeValue
		        asn1.create(asn1.Class.UNIVERSAL, valueTagClass, false, value)
		      ])
		    ]);
		    rval.value.push(set);
		  }

		  return rval;
		}

		/**
		 * Gets all printable attributes (typically of an issuer or subject) in a
		 * simplified JSON format for display.
		 *
		 * @param attrs the attributes.
		 *
		 * @return the JSON for display.
		 */
		function _getAttributesAsJson(attrs) {
		  var rval = {};
		  for(var i = 0; i < attrs.length; ++i) {
		    var attr = attrs[i];
		    if(attr.shortName && (
		      attr.valueTagClass === asn1.Type.UTF8 ||
		      attr.valueTagClass === asn1.Type.PRINTABLESTRING ||
		      attr.valueTagClass === asn1.Type.IA5STRING)) {
		      var value = attr.value;
		      if(attr.valueTagClass === asn1.Type.UTF8) {
		        value = forge.util.encodeUtf8(attr.value);
		      }
		      if(!(attr.shortName in rval)) {
		        rval[attr.shortName] = value;
		      } else if(forge.util.isArray(rval[attr.shortName])) {
		        rval[attr.shortName].push(value);
		      } else {
		        rval[attr.shortName] = [rval[attr.shortName], value];
		      }
		    }
		  }
		  return rval;
		}

		/**
		 * Fills in missing fields in attributes.
		 *
		 * @param attrs the attributes to fill missing fields in.
		 */
		function _fillMissingFields(attrs) {
		  var attr;
		  for(var i = 0; i < attrs.length; ++i) {
		    attr = attrs[i];

		    // populate missing name
		    if(typeof attr.name === 'undefined') {
		      if(attr.type && attr.type in pki.oids) {
		        attr.name = pki.oids[attr.type];
		      } else if(attr.shortName && attr.shortName in _shortNames) {
		        attr.name = pki.oids[_shortNames[attr.shortName]];
		      }
		    }

		    // populate missing type (OID)
		    if(typeof attr.type === 'undefined') {
		      if(attr.name && attr.name in pki.oids) {
		        attr.type = pki.oids[attr.name];
		      } else {
		        var error = new Error('Attribute type not specified.');
		        error.attribute = attr;
		        throw error;
		      }
		    }

		    // populate missing shortname
		    if(typeof attr.shortName === 'undefined') {
		      if(attr.name && attr.name in _shortNames) {
		        attr.shortName = _shortNames[attr.name];
		      }
		    }

		    // convert extensions to value
		    if(attr.type === oids.extensionRequest) {
		      attr.valueConstructed = true;
		      attr.valueTagClass = asn1.Type.SEQUENCE;
		      if(!attr.value && attr.extensions) {
		        attr.value = [];
		        for(var ei = 0; ei < attr.extensions.length; ++ei) {
		          attr.value.push(pki.certificateExtensionToAsn1(
		            _fillMissingExtensionFields(attr.extensions[ei])));
		        }
		      }
		    }

		    if(typeof attr.value === 'undefined') {
		      var error = new Error('Attribute value not specified.');
		      error.attribute = attr;
		      throw error;
		    }
		  }
		}

		/**
		 * Fills in missing fields in certificate extensions.
		 *
		 * @param e the extension.
		 * @param [options] the options to use.
		 *          [cert] the certificate the extensions are for.
		 *
		 * @return the extension.
		 */
		function _fillMissingExtensionFields(e, options) {
		  options = options || {};

		  // populate missing name
		  if(typeof e.name === 'undefined') {
		    if(e.id && e.id in pki.oids) {
		      e.name = pki.oids[e.id];
		    }
		  }

		  // populate missing id
		  if(typeof e.id === 'undefined') {
		    if(e.name && e.name in pki.oids) {
		      e.id = pki.oids[e.name];
		    } else {
		      var error = new Error('Extension ID not specified.');
		      error.extension = e;
		      throw error;
		    }
		  }

		  if(typeof e.value !== 'undefined') {
		    return e;
		  }

		  // handle missing value:

		  // value is a BIT STRING
		  if(e.name === 'keyUsage') {
		    // build flags
		    var unused = 0;
		    var b2 = 0x00;
		    var b3 = 0x00;
		    if(e.digitalSignature) {
		      b2 |= 0x80;
		      unused = 7;
		    }
		    if(e.nonRepudiation) {
		      b2 |= 0x40;
		      unused = 6;
		    }
		    if(e.keyEncipherment) {
		      b2 |= 0x20;
		      unused = 5;
		    }
		    if(e.dataEncipherment) {
		      b2 |= 0x10;
		      unused = 4;
		    }
		    if(e.keyAgreement) {
		      b2 |= 0x08;
		      unused = 3;
		    }
		    if(e.keyCertSign) {
		      b2 |= 0x04;
		      unused = 2;
		    }
		    if(e.cRLSign) {
		      b2 |= 0x02;
		      unused = 1;
		    }
		    if(e.encipherOnly) {
		      b2 |= 0x01;
		      unused = 0;
		    }
		    if(e.decipherOnly) {
		      b3 |= 0x80;
		      unused = 7;
		    }

		    // create bit string
		    var value = String.fromCharCode(unused);
		    if(b3 !== 0) {
		      value += String.fromCharCode(b2) + String.fromCharCode(b3);
		    } else if(b2 !== 0) {
		      value += String.fromCharCode(b2);
		    }
		    e.value = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, value);
		  } else if(e.name === 'basicConstraints') {
		    // basicConstraints is a SEQUENCE
		    e.value = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);
		    // cA BOOLEAN flag defaults to false
		    if(e.cA) {
		      e.value.value.push(asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.BOOLEAN, false,
		        String.fromCharCode(0xFF)));
		    }
		    if('pathLenConstraint' in e) {
		      e.value.value.push(asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		        asn1.integerToDer(e.pathLenConstraint).getBytes()));
		    }
		  } else if(e.name === 'extKeyUsage') {
		    // extKeyUsage is a SEQUENCE of OIDs
		    e.value = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);
		    var seq = e.value.value;
		    for(var key in e) {
		      if(e[key] !== true) {
		        continue;
		      }
		      // key is name in OID map
		      if(key in oids) {
		        seq.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID,
		          false, asn1.oidToDer(oids[key]).getBytes()));
		      } else if(key.indexOf('.') !== -1) {
		        // assume key is an OID
		        seq.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID,
		          false, asn1.oidToDer(key).getBytes()));
		      }
		    }
		  } else if(e.name === 'nsCertType') {
		    // nsCertType is a BIT STRING
		    // build flags
		    var unused = 0;
		    var b2 = 0x00;

		    if(e.client) {
		      b2 |= 0x80;
		      unused = 7;
		    }
		    if(e.server) {
		      b2 |= 0x40;
		      unused = 6;
		    }
		    if(e.email) {
		      b2 |= 0x20;
		      unused = 5;
		    }
		    if(e.objsign) {
		      b2 |= 0x10;
		      unused = 4;
		    }
		    if(e.reserved) {
		      b2 |= 0x08;
		      unused = 3;
		    }
		    if(e.sslCA) {
		      b2 |= 0x04;
		      unused = 2;
		    }
		    if(e.emailCA) {
		      b2 |= 0x02;
		      unused = 1;
		    }
		    if(e.objCA) {
		      b2 |= 0x01;
		      unused = 0;
		    }

		    // create bit string
		    var value = String.fromCharCode(unused);
		    if(b2 !== 0) {
		      value += String.fromCharCode(b2);
		    }
		    e.value = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, value);
		  } else if(e.name === 'subjectAltName' || e.name === 'issuerAltName') {
		    // SYNTAX SEQUENCE
		    e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);

		    var altName;
		    for(var n = 0; n < e.altNames.length; ++n) {
		      altName = e.altNames[n];
		      var value = altName.value;
		      // handle IP
		      if(altName.type === 7 && altName.ip) {
		        value = forge.util.bytesFromIP(altName.ip);
		        if(value === null) {
		          var error = new Error(
		            'Extension "ip" value is not a valid IPv4 or IPv6 address.');
		          error.extension = e;
		          throw error;
		        }
		      } else if(altName.type === 8) {
		        // handle OID
		        if(altName.oid) {
		          value = asn1.oidToDer(asn1.oidToDer(altName.oid));
		        } else {
		          // deprecated ... convert value to OID
		          value = asn1.oidToDer(value);
		        }
		      }
		      e.value.value.push(asn1.create(
		        asn1.Class.CONTEXT_SPECIFIC, altName.type, false,
		        value));
		    }
		  } else if(e.name === 'subjectKeyIdentifier' && options.cert) {
		    var ski = options.cert.generateSubjectKeyIdentifier();
		    e.subjectKeyIdentifier = ski.toHex();
		    // OCTETSTRING w/digest
		    e.value = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, ski.getBytes());
		  }

		  // ensure value has been defined by now
		  if(typeof e.value === 'undefined') {
		    var error = new Error('Extension value not specified.');
		    error.extension = e;
		    throw error;
		  }

		  return e;
		}

		/**
		 * Convert signature parameters object to ASN.1
		 *
		 * @param {String} oid Signature algorithm OID
		 * @param params The signature parametrs object
		 * @return ASN.1 object representing signature parameters
		 */
		function _signatureParametersToAsn1(oid, params) {
		  switch(oid) {
		  case oids['RSASSA-PSS']:
		    var parts = [];

		    if(params.hash.algorithmOid !== undefined) {
		      parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(params.hash.algorithmOid).getBytes()),
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		        ])
		      ]));
		    }

		    if(params.mgf.algorithmOid !== undefined) {
		      parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, [
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(params.mgf.algorithmOid).getBytes()),
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		              asn1.oidToDer(params.mgf.hash.algorithmOid).getBytes()),
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		          ])
		        ])
		      ]));
		    }

		    if(params.saltLength !== undefined) {
		      parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, true, [
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		          asn1.integerToDer(params.saltLength).getBytes())
		      ]));
		    }

		    return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, parts);

		  default:
		    return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '');
		  }
		}

		/**
		 * Converts a certification request's attributes to an ASN.1 set of
		 * CRIAttributes.
		 *
		 * @param csr certification request.
		 *
		 * @return the ASN.1 set of CRIAttributes.
		 */
		function _CRIAttributesToAsn1(csr) {
		  // create an empty context-specific container
		  var rval = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, []);

		  // no attributes, return empty container
		  if(csr.attributes.length === 0) {
		    return rval;
		  }

		  // each attribute has a sequence with a type and a set of values
		  var attrs = csr.attributes;
		  for(var i = 0; i < attrs.length; ++i) {
		    var attr = attrs[i];
		    var value = attr.value;

		    // reuse tag class for attribute value if available
		    var valueTagClass = asn1.Type.UTF8;
		    if('valueTagClass' in attr) {
		      valueTagClass = attr.valueTagClass;
		    }
		    if(valueTagClass === asn1.Type.UTF8) {
		      value = forge.util.encodeUtf8(value);
		    }
		    var valueConstructed = false;
		    if('valueConstructed' in attr) {
		      valueConstructed = attr.valueConstructed;
		    }
		    // FIXME: handle more encodings

		    // create a RelativeDistinguishedName set
		    // each value in the set is an AttributeTypeAndValue first
		    // containing the type (an OID) and second the value
		    var seq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // AttributeType
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(attr.type).getBytes()),
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [
		        // AttributeValue
		        asn1.create(
		          asn1.Class.UNIVERSAL, valueTagClass, valueConstructed, value)
		      ])
		    ]);
		    rval.value.push(seq);
		  }

		  return rval;
		}

		/**
		 * Gets the ASN.1 TBSCertificate part of an X.509v3 certificate.
		 *
		 * @param cert the certificate.
		 *
		 * @return the asn1 TBSCertificate.
		 */
		pki.getTBSCertificate = function(cert) {
		  // TBSCertificate
		  var tbs = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // version
		    asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		      // integer
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		        asn1.integerToDer(cert.version).getBytes())
		    ]),
		    // serialNumber
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      forge.util.hexToBytes(cert.serialNumber)),
		    // signature
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(cert.siginfo.algorithmOid).getBytes()),
		      // parameters
		      _signatureParametersToAsn1(
		        cert.siginfo.algorithmOid, cert.siginfo.parameters)
		    ]),
		    // issuer
		    _dnToAsn1(cert.issuer),
		    // validity
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // notBefore
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,
		        asn1.dateToUtcTime(cert.validity.notBefore)),
		      // notAfter
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,
		        asn1.dateToUtcTime(cert.validity.notAfter))
		    ]),
		    // subject
		    _dnToAsn1(cert.subject),
		    // SubjectPublicKeyInfo
		    pki.publicKeyToAsn1(cert.publicKey)
		  ]);

		  if(cert.issuer.uniqueId) {
		    // issuerUniqueID (optional)
		    tbs.value.push(
		      asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, [
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,
		          String.fromCharCode(0x00) +
		          cert.issuer.uniqueId
		        )
		      ])
		    );
		  }
		  if(cert.subject.uniqueId) {
		    // subjectUniqueID (optional)
		    tbs.value.push(
		      asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, true, [
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,
		          String.fromCharCode(0x00) +
		          cert.subject.uniqueId
		        )
		      ])
		    );
		  }

		  if(cert.extensions.length > 0) {
		    // extensions (optional)
		    tbs.value.push(pki.certificateExtensionsToAsn1(cert.extensions));
		  }

		  return tbs;
		};

		/**
		 * Gets the ASN.1 CertificationRequestInfo part of a
		 * PKCS#10 CertificationRequest.
		 *
		 * @param csr the certification request.
		 *
		 * @return the asn1 CertificationRequestInfo.
		 */
		pki.getCertificationRequestInfo = function(csr) {
		  // CertificationRequestInfo
		  var cri = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // version
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      asn1.integerToDer(csr.version).getBytes()),
		    // subject
		    _dnToAsn1(csr.subject),
		    // SubjectPublicKeyInfo
		    pki.publicKeyToAsn1(csr.publicKey),
		    // attributes
		    _CRIAttributesToAsn1(csr)
		  ]);

		  return cri;
		};

		/**
		 * Converts a DistinguishedName (subject or issuer) to an ASN.1 object.
		 *
		 * @param dn the DistinguishedName.
		 *
		 * @return the asn1 representation of a DistinguishedName.
		 */
		pki.distinguishedNameToAsn1 = function(dn) {
		  return _dnToAsn1(dn);
		};

		/**
		 * Converts an X.509v3 RSA certificate to an ASN.1 object.
		 *
		 * @param cert the certificate.
		 *
		 * @return the asn1 representation of an X.509v3 RSA certificate.
		 */
		pki.certificateToAsn1 = function(cert) {
		  // prefer cached TBSCertificate over generating one
		  var tbsCertificate = cert.tbsCertificate || pki.getTBSCertificate(cert);

		  // Certificate
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // TBSCertificate
		    tbsCertificate,
		    // AlgorithmIdentifier (signature algorithm)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(cert.signatureOid).getBytes()),
		      // parameters
		      _signatureParametersToAsn1(cert.signatureOid, cert.signatureParameters)
		    ]),
		    // SignatureValue
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,
		      String.fromCharCode(0x00) + cert.signature)
		  ]);
		};

		/**
		 * Converts X.509v3 certificate extensions to ASN.1.
		 *
		 * @param exts the extensions to convert.
		 *
		 * @return the extensions in ASN.1 format.
		 */
		pki.certificateExtensionsToAsn1 = function(exts) {
		  // create top-level extension container
		  var rval = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 3, true, []);

		  // create extension sequence (stores a sequence for each extension)
		  var seq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);
		  rval.value.push(seq);

		  for(var i = 0; i < exts.length; ++i) {
		    seq.value.push(pki.certificateExtensionToAsn1(exts[i]));
		  }

		  return rval;
		};

		/**
		 * Converts a single certificate extension to ASN.1.
		 *
		 * @param ext the extension to convert.
		 *
		 * @return the extension in ASN.1 format.
		 */
		pki.certificateExtensionToAsn1 = function(ext) {
		  // create a sequence for each extension
		  var extseq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);

		  // extnID (OID)
		  extseq.value.push(asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		    asn1.oidToDer(ext.id).getBytes()));

		  // critical defaults to false
		  if(ext.critical) {
		    // critical BOOLEAN DEFAULT FALSE
		    extseq.value.push(asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.BOOLEAN, false,
		      String.fromCharCode(0xFF)));
		  }

		  var value = ext.value;
		  if(typeof ext.value !== 'string') {
		    // value is asn.1
		    value = asn1.toDer(value).getBytes();
		  }

		  // extnValue (OCTET STRING)
		  extseq.value.push(asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, value));

		  return extseq;
		};

		/**
		 * Converts a PKCS#10 certification request to an ASN.1 object.
		 *
		 * @param csr the certification request.
		 *
		 * @return the asn1 representation of a certification request.
		 */
		pki.certificationRequestToAsn1 = function(csr) {
		  // prefer cached CertificationRequestInfo over generating one
		  var cri = csr.certificationRequestInfo ||
		    pki.getCertificationRequestInfo(csr);

		  // Certificate
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // CertificationRequestInfo
		    cri,
		    // AlgorithmIdentifier (signature algorithm)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(csr.signatureOid).getBytes()),
		      // parameters
		      _signatureParametersToAsn1(csr.signatureOid, csr.signatureParameters)
		    ]),
		    // signature
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,
		      String.fromCharCode(0x00) + csr.signature)
		  ]);
		};

		/**
		 * Creates a CA store.
		 *
		 * @param certs an optional array of certificate objects or PEM-formatted
		 *          certificate strings to add to the CA store.
		 *
		 * @return the CA store.
		 */
		pki.createCaStore = function(certs) {
		  // create CA store
		  var caStore = {
		    // stored certificates
		    certs: {}
		  };

		  /**
		   * Gets the certificate that issued the passed certificate or its
		   * 'parent'.
		   *
		   * @param cert the certificate to get the parent for.
		   *
		   * @return the parent certificate or null if none was found.
		   */
		  caStore.getIssuer = function(cert) {
		    var rval = getBySubject(cert.issuer);

		    // see if there are multiple matches
		    /*if(forge.util.isArray(rval)) {
		      // TODO: resolve multiple matches by checking
		      // authorityKey/subjectKey/issuerUniqueID/other identifiers, etc.
		      // FIXME: or alternatively do authority key mapping
		      // if possible (X.509v1 certs can't work?)
		      throw new Error('Resolving multiple issuer matches not implemented yet.');
		    }*/

		    return rval;
		  };

		  /**
		   * Adds a trusted certificate to the store.
		   *
		   * @param cert the certificate to add as a trusted certificate (either a
		   *          pki.certificate object or a PEM-formatted certificate).
		   */
		  caStore.addCertificate = function(cert) {
		    // convert from pem if necessary
		    if(typeof cert === 'string') {
		      cert = forge.pki.certificateFromPem(cert);
		    }

		    // produce subject hash if it doesn't exist
		    if(!cert.subject.hash) {
		      var md = forge.md.sha1.create();
		      cert.subject.attributes =  pki.RDNAttributesAsArray(
		        _dnToAsn1(cert.subject), md);
		      cert.subject.hash = md.digest().toHex();
		    }

		    if(cert.subject.hash in caStore.certs) {
		      // subject hash already exists, append to array
		      var tmp = caStore.certs[cert.subject.hash];
		      if(!forge.util.isArray(tmp)) {
		        tmp = [tmp];
		      }
		      tmp.push(cert);
		    } else {
		      caStore.certs[cert.subject.hash] = cert;
		    }
		  };

		  /**
		   * Checks to see if the given certificate is in the store.
		   *
		   * @param cert the certificate to check.
		   *
		   * @return true if the certificate is in the store, false if not.
		   */
		  caStore.hasCertificate = function(cert) {
		    var match = getBySubject(cert.subject);
		    if(!match) {
		      return false;
		    }
		    if(!forge.util.isArray(match)) {
		      match = [match];
		    }
		    // compare DER-encoding of certificates
		    var der1 = asn1.toDer(pki.certificateToAsn1(cert)).getBytes();
		    for(var i = 0; i < match.length; ++i) {
		      var der2 = asn1.toDer(pki.certificateToAsn1(match[i])).getBytes();
		      if(der1 === der2) {
		        return true;
		      }
		    }
		    return false;
		  };

		  function getBySubject(subject) {
		    // produce subject hash if it doesn't exist
		    if(!subject.hash) {
		      var md = forge.md.sha1.create();
		      subject.attributes =  pki.RDNAttributesAsArray(_dnToAsn1(subject), md);
		      subject.hash = md.digest().toHex();
		    }
		    return caStore.certs[subject.hash] || null;
		  }

		  // auto-add passed in certs
		  if(certs) {
		    // parse PEM-formatted certificates as necessary
		    for(var i = 0; i < certs.length; ++i) {
		      var cert = certs[i];
		      caStore.addCertificate(cert);
		    }
		  }

		  return caStore;
		};

		/**
		 * Certificate verification errors, based on TLS.
		 */
		pki.certificateError = {
		  bad_certificate: 'forge.pki.BadCertificate',
		  unsupported_certificate: 'forge.pki.UnsupportedCertificate',
		  certificate_revoked: 'forge.pki.CertificateRevoked',
		  certificate_expired: 'forge.pki.CertificateExpired',
		  certificate_unknown: 'forge.pki.CertificateUnknown',
		  unknown_ca: 'forge.pki.UnknownCertificateAuthority'
		};

		/**
		 * Verifies a certificate chain against the given Certificate Authority store
		 * with an optional custom verify callback.
		 *
		 * @param caStore a certificate store to verify against.
		 * @param chain the certificate chain to verify, with the root or highest
		 *          authority at the end (an array of certificates).
		 * @param verify called for every certificate in the chain.
		 *
		 * The verify callback has the following signature:
		 *
		 * verified - Set to true if certificate was verified, otherwise the
		 *   pki.certificateError for why the certificate failed.
		 * depth - The current index in the chain, where 0 is the end point's cert.
		 * certs - The certificate chain, *NOTE* an empty chain indicates an anonymous
		 *   end point.
		 *
		 * The function returns true on success and on failure either the appropriate
		 * pki.certificateError or an object with 'error' set to the appropriate
		 * pki.certificateError and 'message' set to a custom error message.
		 *
		 * @return true if successful, error thrown if not.
		 */
		pki.verifyCertificateChain = function(caStore, chain, verify) {
		  /* From: RFC3280 - Internet X.509 Public Key Infrastructure Certificate
		    Section 6: Certification Path Validation
		    See inline parentheticals related to this particular implementation.

		    The primary goal of path validation is to verify the binding between
		    a subject distinguished name or a subject alternative name and subject
		    public key, as represented in the end entity certificate, based on the
		    public key of the trust anchor. This requires obtaining a sequence of
		    certificates that support that binding. That sequence should be provided
		    in the passed 'chain'. The trust anchor should be in the given CA
		    store. The 'end entity' certificate is the certificate provided by the
		    end point (typically a server) and is the first in the chain.

		    To meet this goal, the path validation process verifies, among other
		    things, that a prospective certification path (a sequence of n
		    certificates or a 'chain') satisfies the following conditions:

		    (a) for all x in {1, ..., n-1}, the subject of certificate x is
		          the issuer of certificate x+1;

		    (b) certificate 1 is issued by the trust anchor;

		    (c) certificate n is the certificate to be validated; and

		    (d) for all x in {1, ..., n}, the certificate was valid at the
		          time in question.

		    Note that here 'n' is index 0 in the chain and 1 is the last certificate
		    in the chain and it must be signed by a certificate in the connection's
		    CA store.

		    The path validation process also determines the set of certificate
		    policies that are valid for this path, based on the certificate policies
		    extension, policy mapping extension, policy constraints extension, and
		    inhibit any-policy extension.

		    Note: Policy mapping extension not supported (Not Required).

		    Note: If the certificate has an unsupported critical extension, then it
		    must be rejected.

		    Note: A certificate is self-issued if the DNs that appear in the subject
		    and issuer fields are identical and are not empty.

		    The path validation algorithm assumes the following seven inputs are
		    provided to the path processing logic. What this specific implementation
		    will use is provided parenthetically:

		    (a) a prospective certification path of length n (the 'chain')
		    (b) the current date/time: ('now').
		    (c) user-initial-policy-set: A set of certificate policy identifiers
		          naming the policies that are acceptable to the certificate user.
		          The user-initial-policy-set contains the special value any-policy
		          if the user is not concerned about certificate policy
		          (Not implemented. Any policy is accepted).
		    (d) trust anchor information, describing a CA that serves as a trust
		          anchor for the certification path. The trust anchor information
		          includes:

		      (1)  the trusted issuer name,
		      (2)  the trusted public key algorithm,
		      (3)  the trusted public key, and
		      (4)  optionally, the trusted public key parameters associated
		             with the public key.

		      (Trust anchors are provided via certificates in the CA store).

		      The trust anchor information may be provided to the path processing
		      procedure in the form of a self-signed certificate. The trusted anchor
		      information is trusted because it was delivered to the path processing
		      procedure by some trustworthy out-of-band procedure. If the trusted
		      public key algorithm requires parameters, then the parameters are
		      provided along with the trusted public key (No parameters used in this
		      implementation).

		    (e) initial-policy-mapping-inhibit, which indicates if policy mapping is
		          allowed in the certification path.
		          (Not implemented, no policy checking)

		    (f) initial-explicit-policy, which indicates if the path must be valid
		          for at least one of the certificate policies in the user-initial-
		          policy-set.
		          (Not implemented, no policy checking)

		    (g) initial-any-policy-inhibit, which indicates whether the
		          anyPolicy OID should be processed if it is included in a
		          certificate.
		          (Not implemented, so any policy is valid provided that it is
		          not marked as critical) */

		  /* Basic Path Processing:

		    For each certificate in the 'chain', the following is checked:

		    1. The certificate validity period includes the current time.
		    2. The certificate was signed by its parent (where the parent is either
		       the next in the chain or from the CA store). Allow processing to
		       continue to the next step if no parent is found but the certificate is
		       in the CA store.
		    3. TODO: The certificate has not been revoked.
		    4. The certificate issuer name matches the parent's subject name.
		    5. TODO: If the certificate is self-issued and not the final certificate
		       in the chain, skip this step, otherwise verify that the subject name
		       is within one of the permitted subtrees of X.500 distinguished names
		       and that each of the alternative names in the subjectAltName extension
		       (critical or non-critical) is within one of the permitted subtrees for
		       that name type.
		    6. TODO: If the certificate is self-issued and not the final certificate
		       in the chain, skip this step, otherwise verify that the subject name
		       is not within one of the excluded subtrees for X.500 distinguished
		       names and none of the subjectAltName extension names are excluded for
		       that name type.
		    7. The other steps in the algorithm for basic path processing involve
		       handling the policy extension which is not presently supported in this
		       implementation. Instead, if a critical policy extension is found, the
		       certificate is rejected as not supported.
		    8. If the certificate is not the first or if its the only certificate in
		       the chain (having no parent from the CA store or is self-signed) and it
		       has a critical key usage extension, verify that the keyCertSign bit is
		       set. If the key usage extension exists, verify that the basic
		       constraints extension exists. If the basic constraints extension exists,
		       verify that the cA flag is set. If pathLenConstraint is set, ensure that
		       the number of certificates that precede in the chain (come earlier
		       in the chain as implemented below), excluding the very first in the
		       chain (typically the end-entity one), isn't greater than the
		       pathLenConstraint. This constraint limits the number of intermediate
		       CAs that may appear below a CA before only end-entity certificates
		       may be issued. */

		  // copy cert chain references to another array to protect against changes
		  // in verify callback
		  chain = chain.slice(0);
		  var certs = chain.slice(0);

		  // get current date
		  var now = new Date();

		  // verify each cert in the chain using its parent, where the parent
		  // is either the next in the chain or from the CA store
		  var first = true;
		  var error = null;
		  var depth = 0;
		  do {
		    var cert = chain.shift();
		    var parent = null;
		    var selfSigned = false;

		    // 1. check valid time
		    if(now < cert.validity.notBefore || now > cert.validity.notAfter) {
		      error = {
		        message: 'Certificate is not valid yet or has expired.',
		        error: pki.certificateError.certificate_expired,
		        notBefore: cert.validity.notBefore,
		        notAfter: cert.validity.notAfter,
		        now: now
		      };
		    }

		    // 2. verify with parent from chain or CA store
		    if(error === null) {
		      parent = chain[0] || caStore.getIssuer(cert);
		      if(parent === null) {
		        // check for self-signed cert
		        if(cert.isIssuer(cert)) {
		          selfSigned = true;
		          parent = cert;
		        }
		      }

		      if(parent) {
		        // FIXME: current CA store implementation might have multiple
		        // certificates where the issuer can't be determined from the
		        // certificate (happens rarely with, eg: old certificates) so normalize
		        // by always putting parents into an array
		        // TODO: there's may be an extreme degenerate case currently uncovered
		        // where an old intermediate certificate seems to have a matching parent
		        // but none of the parents actually verify ... but the intermediate
		        // is in the CA and it should pass this check; needs investigation
		        var parents = parent;
		        if(!forge.util.isArray(parents)) {
		          parents = [parents];
		        }

		        // try to verify with each possible parent (typically only one)
		        var verified = false;
		        while(!verified && parents.length > 0) {
		          parent = parents.shift();
		          try {
		            verified = parent.verify(cert);
		          } catch(ex) {
		            // failure to verify, don't care why, try next one
		          }
		        }

		        if(!verified) {
		          error = {
		            message: 'Certificate signature is invalid.',
		            error: pki.certificateError.bad_certificate
		          };
		        }
		      }

		      if(error === null && (!parent || selfSigned) &&
		        !caStore.hasCertificate(cert)) {
		        // no parent issuer and certificate itself is not trusted
		        error = {
		          message: 'Certificate is not trusted.',
		          error: pki.certificateError.unknown_ca
		        };
		      }
		    }

		    // TODO: 3. check revoked

		    // 4. check for matching issuer/subject
		    if(error === null && parent && !cert.isIssuer(parent)) {
		      // parent is not issuer
		      error = {
		        message: 'Certificate issuer is invalid.',
		        error: pki.certificateError.bad_certificate
		      };
		    }

		    // 5. TODO: check names with permitted names tree

		    // 6. TODO: check names against excluded names tree

		    // 7. check for unsupported critical extensions
		    if(error === null) {
		      // supported extensions
		      var se = {
		        keyUsage: true,
		        basicConstraints: true
		      };
		      for(var i = 0; error === null && i < cert.extensions.length; ++i) {
		        var ext = cert.extensions[i];
		        if(ext.critical && !(ext.name in se)) {
		          error = {
		            message:
		              'Certificate has an unsupported critical extension.',
		            error: pki.certificateError.unsupported_certificate
		          };
		        }
		      }
		    }

		    // 8. check for CA if cert is not first or is the only certificate
		    // remaining in chain with no parent or is self-signed
		    if(error === null &&
		      (!first || (chain.length === 0 && (!parent || selfSigned)))) {
		      // first check keyUsage extension and then basic constraints
		      var bcExt = cert.getExtension('basicConstraints');
		      var keyUsageExt = cert.getExtension('keyUsage');
		      if(keyUsageExt !== null) {
		        // keyCertSign must be true and there must be a basic
		        // constraints extension
		        if(!keyUsageExt.keyCertSign || bcExt === null) {
		          // bad certificate
		          error = {
		            message:
		              'Certificate keyUsage or basicConstraints conflict ' +
		              'or indicate that the certificate is not a CA. ' +
		              'If the certificate is the only one in the chain or ' +
		              'isn\'t the first then the certificate must be a ' +
		              'valid CA.',
		            error: pki.certificateError.bad_certificate
		          };
		        }
		      }
		      // basic constraints cA flag must be set
		      if(error === null && bcExt !== null && !bcExt.cA) {
		        // bad certificate
		        error = {
		          message:
		            'Certificate basicConstraints indicates the certificate ' +
		            'is not a CA.',
		          error: pki.certificateError.bad_certificate
		        };
		      }
		      // if error is not null and keyUsage is available, then we know it
		      // has keyCertSign and there is a basic constraints extension too,
		      // which means we can check pathLenConstraint (if it exists)
		      if(error === null && keyUsageExt !== null &&
		        'pathLenConstraint' in bcExt) {
		        // pathLen is the maximum # of intermediate CA certs that can be
		        // found between the current certificate and the end-entity (depth 0)
		        // certificate; this number does not include the end-entity (depth 0,
		        // last in the chain) even if it happens to be a CA certificate itself
		        var pathLen = depth - 1;
		        if(pathLen > bcExt.pathLenConstraint) {
		          // pathLenConstraint violated, bad certificate
		          error = {
		            message:
		              'Certificate basicConstraints pathLenConstraint violated.',
		            error: pki.certificateError.bad_certificate
		          };
		        }
		      }
		    }

		    // call application callback
		    var vfd = (error === null) ? true : error.error;
		    var ret = verify ? verify(vfd, depth, certs) : vfd;
		    if(ret === true) {
		      // clear any set error
		      error = null;
		    } else {
		      // if passed basic tests, set default message and alert
		      if(vfd === true) {
		        error = {
		          message: 'The application rejected the certificate.',
		          error: pki.certificateError.bad_certificate
		        };
		      }

		      // check for custom error info
		      if(ret || ret === 0) {
		        // set custom message and error
		        if(typeof ret === 'object' && !forge.util.isArray(ret)) {
		          if(ret.message) {
		             error.message = ret.message;
		          }
		          if(ret.error) {
		            error.error = ret.error;
		          }
		        } else if(typeof ret === 'string') {
		          // set custom error
		          error.error = ret;
		        }
		      }

		      // throw error
		      throw error;
		    }

		    // no longer first cert in chain
		    first = false;
		    ++depth;
		  } while(chain.length > 0);

		  return true;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'x509';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge.pki;
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/x509',[
		  'require',
		  'module',
		  './aes',
		  './asn1',
		  './des',
		  './md',
		  './mgf',
		  './oids',
		  './pem',
		  './pss',
		  './rsa',
		  './util'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of PKCS#12.
		 *
		 * @author Dave Longley
		 * @author Stefan Siegl <stesie@brokenpipe.de>
		 *
		 * Copyright (c) 2010-2014 Digital Bazaar, Inc.
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 *
		 * The ASN.1 representation of PKCS#12 is as follows
		 * (see ftp://ftp.rsasecurity.com/pub/pkcs/pkcs-12/pkcs-12-tc1.pdf for details)
		 *
		 * PFX ::= SEQUENCE {
		 *   version  INTEGER {v3(3)}(v3,...),
		 *   authSafe ContentInfo,
		 *   macData  MacData OPTIONAL
		 * }
		 *
		 * MacData ::= SEQUENCE {
		 *   mac DigestInfo,
		 *   macSalt OCTET STRING,
		 *   iterations INTEGER DEFAULT 1
		 * }
		 * Note: The iterations default is for historical reasons and its use is
		 * deprecated. A higher value, like 1024, is recommended.
		 *
		 * DigestInfo is defined in PKCS#7 as follows:
		 *
		 * DigestInfo ::= SEQUENCE {
		 *   digestAlgorithm DigestAlgorithmIdentifier,
		 *   digest Digest
		 * }
		 *
		 * DigestAlgorithmIdentifier ::= AlgorithmIdentifier
		 *
		 * The AlgorithmIdentifier contains an Object Identifier (OID) and parameters
		 * for the algorithm, if any. In the case of SHA1 there is none.
		 *
		 * AlgorithmIdentifer ::= SEQUENCE {
		 *    algorithm OBJECT IDENTIFIER,
		 *    parameters ANY DEFINED BY algorithm OPTIONAL
		 * }
		 *
		 * Digest ::= OCTET STRING
		 *
		 *
		 * ContentInfo ::= SEQUENCE {
		 *   contentType ContentType,
		 *   content     [0] EXPLICIT ANY DEFINED BY contentType OPTIONAL
		 * }
		 *
		 * ContentType ::= OBJECT IDENTIFIER
		 *
		 * AuthenticatedSafe ::= SEQUENCE OF ContentInfo
		 * -- Data if unencrypted
		 * -- EncryptedData if password-encrypted
		 * -- EnvelopedData if public key-encrypted
		 *
		 *
		 * SafeContents ::= SEQUENCE OF SafeBag
		 *
		 * SafeBag ::= SEQUENCE {
		 *   bagId     BAG-TYPE.&id ({PKCS12BagSet})
		 *   bagValue  [0] EXPLICIT BAG-TYPE.&Type({PKCS12BagSet}{@bagId}),
		 *   bagAttributes SET OF PKCS12Attribute OPTIONAL
		 * }
		 *
		 * PKCS12Attribute ::= SEQUENCE {
		 *   attrId ATTRIBUTE.&id ({PKCS12AttrSet}),
		 *   attrValues SET OF ATTRIBUTE.&Type ({PKCS12AttrSet}{@attrId})
		 * } -- This type is compatible with the X.500 type ’Attribute’
		 *
		 * PKCS12AttrSet ATTRIBUTE ::= {
		 *   friendlyName | -- from PKCS #9
		 *   localKeyId, -- from PKCS #9
		 *   ... -- Other attributes are allowed
		 * }
		 *
		 * CertBag ::= SEQUENCE {
		 *   certId    BAG-TYPE.&id   ({CertTypes}),
		 *   certValue [0] EXPLICIT BAG-TYPE.&Type ({CertTypes}{@certId})
		 * }
		 *
		 * x509Certificate BAG-TYPE ::= {OCTET STRING IDENTIFIED BY {certTypes 1}}
		 *   -- DER-encoded X.509 certificate stored in OCTET STRING
		 *
		 * sdsiCertificate BAG-TYPE ::= {IA5String IDENTIFIED BY {certTypes 2}}
		 * -- Base64-encoded SDSI certificate stored in IA5String
		 *
		 * CertTypes BAG-TYPE ::= {
		 *   x509Certificate |
		 *   sdsiCertificate,
		 *   ... -- For future extensions
		 * }
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for asn.1 & PKI API
		var asn1 = forge.asn1;
		var pki = forge.pki;

		// shortcut for PKCS#12 API
		var p12 = forge.pkcs12 = forge.pkcs12 || {};

		var contentInfoValidator = {
		  name: 'ContentInfo',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,  // a ContentInfo
		  constructed: true,
		  value: [{
		    name: 'ContentInfo.contentType',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OID,
		    constructed: false,
		    capture: 'contentType'
		  }, {
		    name: 'ContentInfo.content',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    constructed: true,
		    captureAsn1: 'content'
		  }]
		};

		var pfxValidator = {
		  name: 'PFX',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'PFX.version',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.INTEGER,
		    constructed: false,
		    capture: 'version'
		  },
		  contentInfoValidator, {
		    name: 'PFX.macData',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SEQUENCE,
		    constructed: true,
		    optional: true,
		    captureAsn1: 'mac',
		    value: [{
		      name: 'PFX.macData.mac',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.SEQUENCE,  // DigestInfo
		      constructed: true,
		      value: [{
		        name: 'PFX.macData.mac.digestAlgorithm',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.SEQUENCE,  // DigestAlgorithmIdentifier
		        constructed: true,
		        value: [{
		          name: 'PFX.macData.mac.digestAlgorithm.algorithm',
		          tagClass: asn1.Class.UNIVERSAL,
		          type: asn1.Type.OID,
		          constructed: false,
		          capture: 'macAlgorithm'
		        }, {
		          name: 'PFX.macData.mac.digestAlgorithm.parameters',
		          tagClass: asn1.Class.UNIVERSAL,
		          captureAsn1: 'macAlgorithmParameters'
		        }]
		      }, {
		        name: 'PFX.macData.mac.digest',
		        tagClass: asn1.Class.UNIVERSAL,
		        type: asn1.Type.OCTETSTRING,
		        constructed: false,
		        capture: 'macDigest'
		      }]
		    }, {
		      name: 'PFX.macData.macSalt',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.OCTETSTRING,
		      constructed: false,
		      capture: 'macSalt'
		    }, {
		      name: 'PFX.macData.iterations',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Type.INTEGER,
		      constructed: false,
		      optional: true,
		      capture: 'macIterations'
		    }]
		  }]
		};

		var safeBagValidator = {
		  name: 'SafeBag',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'SafeBag.bagId',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OID,
		    constructed: false,
		    capture: 'bagId'
		  }, {
		    name: 'SafeBag.bagValue',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    constructed: true,
		    captureAsn1: 'bagValue'
		  }, {
		    name: 'SafeBag.bagAttributes',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SET,
		    constructed: true,
		    optional: true,
		    capture: 'bagAttributes'
		  }]
		};

		var attributeValidator = {
		  name: 'Attribute',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'Attribute.attrId',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OID,
		    constructed: false,
		    capture: 'oid'
		  }, {
		    name: 'Attribute.attrValues',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.SET,
		    constructed: true,
		    capture: 'values'
		  }]
		};

		var certBagValidator = {
		  name: 'CertBag',
		  tagClass: asn1.Class.UNIVERSAL,
		  type: asn1.Type.SEQUENCE,
		  constructed: true,
		  value: [{
		    name: 'CertBag.certId',
		    tagClass: asn1.Class.UNIVERSAL,
		    type: asn1.Type.OID,
		    constructed: false,
		    capture: 'certId'
		  }, {
		    name: 'CertBag.certValue',
		    tagClass: asn1.Class.CONTEXT_SPECIFIC,
		    constructed: true,
		    /* So far we only support X.509 certificates (which are wrapped in
		       an OCTET STRING, hence hard code that here). */
		    value: [{
		      name: 'CertBag.certValue[0]',
		      tagClass: asn1.Class.UNIVERSAL,
		      type: asn1.Class.OCTETSTRING,
		      constructed: false,
		      capture: 'cert'
		    }]
		  }]
		};

		/**
		 * Search SafeContents structure for bags with matching attributes.
		 *
		 * The search can optionally be narrowed by a certain bag type.
		 *
		 * @param safeContents the SafeContents structure to search in.
		 * @param attrName the name of the attribute to compare against.
		 * @param attrValue the attribute value to search for.
		 * @param [bagType] bag type to narrow search by.
		 *
		 * @return an array of matching bags.
		 */
		function _getBagsByAttribute(safeContents, attrName, attrValue, bagType) {
		  var result = [];

		  for(var i = 0; i < safeContents.length; i ++) {
		    for(var j = 0; j < safeContents[i].safeBags.length; j ++) {
		      var bag = safeContents[i].safeBags[j];
		      if(bagType !== undefined && bag.type !== bagType) {
		        continue;
		      }
		      // only filter by bag type, no attribute specified
		      if(attrName === null) {
		        result.push(bag);
		        continue;
		      }
		      if(bag.attributes[attrName] !== undefined &&
		        bag.attributes[attrName].indexOf(attrValue) >= 0) {
		        result.push(bag);
		      }
		    }
		  }

		  return result;
		}

		/**
		 * Converts a PKCS#12 PFX in ASN.1 notation into a PFX object.
		 *
		 * @param obj The PKCS#12 PFX in ASN.1 notation.
		 * @param strict true to use strict DER decoding, false not to (default: true).
		 * @param {String} password Password to decrypt with (optional).
		 *
		 * @return PKCS#12 PFX object.
		 */
		p12.pkcs12FromAsn1 = function(obj, strict, password) {
		  // handle args
		  if(typeof strict === 'string') {
		    password = strict;
		    strict = true;
		  } else if(strict === undefined) {
		    strict = true;
		  }

		  // validate PFX and capture data
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, pfxValidator, capture, errors)) {
		    var error = new Error('Cannot read PKCS#12 PFX. ' +
		      'ASN.1 object is not an PKCS#12 PFX.');
		    error.errors = error;
		    throw error;
		  }

		  var pfx = {
		    version: capture.version.charCodeAt(0),
		    safeContents: [],

		    /**
		     * Gets bags with matching attributes.
		     *
		     * @param filter the attributes to filter by:
		     *          [localKeyId] the localKeyId to search for.
		     *          [localKeyIdHex] the localKeyId in hex to search for.
		     *          [friendlyName] the friendly name to search for.
		     *          [bagType] bag type to narrow each attribute search by.
		     *
		     * @return a map of attribute type to an array of matching bags or, if no
		     *           attribute was given but a bag type, the map key will be the
		     *           bag type.
		     */
		    getBags: function(filter) {
		      var rval = {};

		      var localKeyId;
		      if('localKeyId' in filter) {
		        localKeyId = filter.localKeyId;
		      } else if('localKeyIdHex' in filter) {
		        localKeyId = forge.util.hexToBytes(filter.localKeyIdHex);
		      }

		      // filter on bagType only
		      if(localKeyId === undefined && !('friendlyName' in filter) &&
		        'bagType' in filter) {
		        rval[filter.bagType] = _getBagsByAttribute(
		          pfx.safeContents, null, null, filter.bagType);
		      }

		      if(localKeyId !== undefined) {
		        rval.localKeyId = _getBagsByAttribute(
		          pfx.safeContents, 'localKeyId',
		          localKeyId, filter.bagType);
		      }
		      if('friendlyName' in filter) {
		        rval.friendlyName = _getBagsByAttribute(
		          pfx.safeContents, 'friendlyName',
		          filter.friendlyName, filter.bagType);
		      }

		      return rval;
		    },

		    /**
		     * DEPRECATED: use getBags() instead.
		     *
		     * Get bags with matching friendlyName attribute.
		     *
		     * @param friendlyName the friendly name to search for.
		     * @param [bagType] bag type to narrow search by.
		     *
		     * @return an array of bags with matching friendlyName attribute.
		     */
		    getBagsByFriendlyName: function(friendlyName, bagType) {
		      return _getBagsByAttribute(
		        pfx.safeContents, 'friendlyName', friendlyName, bagType);
		    },

		    /**
		     * DEPRECATED: use getBags() instead.
		     *
		     * Get bags with matching localKeyId attribute.
		     *
		     * @param localKeyId the localKeyId to search for.
		     * @param [bagType] bag type to narrow search by.
		     *
		     * @return an array of bags with matching localKeyId attribute.
		     */
		    getBagsByLocalKeyId: function(localKeyId, bagType) {
		      return _getBagsByAttribute(
		        pfx.safeContents, 'localKeyId', localKeyId, bagType);
		    }
		  };

		  if(capture.version.charCodeAt(0) !== 3) {
		    var error = new Error('PKCS#12 PFX of version other than 3 not supported.');
		    error.version = capture.version.charCodeAt(0);
		    throw error;
		  }

		  if(asn1.derToOid(capture.contentType) !== pki.oids.data) {
		    var error = new Error('Only PKCS#12 PFX in password integrity mode supported.');
		    error.oid = asn1.derToOid(capture.contentType);
		    throw error;
		  }

		  var data = capture.content.value[0];
		  if(data.tagClass !== asn1.Class.UNIVERSAL ||
		     data.type !== asn1.Type.OCTETSTRING) {
		    throw new Error('PKCS#12 authSafe content data is not an OCTET STRING.');
		  }
		  data = _decodePkcs7Data(data);

		  // check for MAC
		  if(capture.mac) {
		    var md = null;
		    var macKeyBytes = 0;
		    var macAlgorithm = asn1.derToOid(capture.macAlgorithm);
		    switch(macAlgorithm) {
		    case pki.oids.sha1:
		      md = forge.md.sha1.create();
		      macKeyBytes = 20;
		      break;
		    case pki.oids.sha256:
		      md = forge.md.sha256.create();
		      macKeyBytes = 32;
		      break;
		    case pki.oids.sha384:
		      md = forge.md.sha384.create();
		      macKeyBytes = 48;
		      break;
		    case pki.oids.sha512:
		      md = forge.md.sha512.create();
		      macKeyBytes = 64;
		      break;
		    case pki.oids.md5:
		      md = forge.md.md5.create();
		      macKeyBytes = 16;
		      break;
		    }
		    if(md === null) {
		      throw new Error('PKCS#12 uses unsupported MAC algorithm: ' + macAlgorithm);
		    }

		    // verify MAC (iterations default to 1)
		    var macSalt = new forge.util.ByteBuffer(capture.macSalt);
		    var macIterations = (('macIterations' in capture) ?
		      parseInt(forge.util.bytesToHex(capture.macIterations), 16) : 1);
		    var macKey = p12.generateKey(
		      password, macSalt, 3, macIterations, macKeyBytes, md);
		    var mac = forge.hmac.create();
		    mac.start(md, macKey);
		    mac.update(data.value);
		    var macValue = mac.getMac();
		    if(macValue.getBytes() !== capture.macDigest) {
		      throw new Error('PKCS#12 MAC could not be verified. Invalid password?');
		    }
		  }

		  _decodeAuthenticatedSafe(pfx, data.value, strict, password);
		  return pfx;
		};

		/**
		 * Decodes PKCS#7 Data. PKCS#7 (RFC 2315) defines "Data" as an OCTET STRING,
		 * but it is sometimes an OCTET STRING that is composed/constructed of chunks,
		 * each its own OCTET STRING. This is BER-encoding vs. DER-encoding. This
		 * function transforms this corner-case into the usual simple,
		 * non-composed/constructed OCTET STRING.
		 *
		 * This function may be moved to ASN.1 at some point to better deal with
		 * more BER-encoding issues, should they arise.
		 *
		 * @param data the ASN.1 Data object to transform.
		 */
		function _decodePkcs7Data(data) {
		  // handle special case of "chunked" data content: an octet string composed
		  // of other octet strings
		  if(data.composed || data.constructed) {
		    var value = forge.util.createBuffer();
		    for(var i = 0; i < data.value.length; ++i) {
		      value.putBytes(data.value[i].value);
		    }
		    data.composed = data.constructed = false;
		    data.value = value.getBytes();
		  }
		  return data;
		}

		/**
		 * Decode PKCS#12 AuthenticatedSafe (BER encoded) into PFX object.
		 *
		 * The AuthenticatedSafe is a BER-encoded SEQUENCE OF ContentInfo.
		 *
		 * @param pfx The PKCS#12 PFX object to fill.
		 * @param {String} authSafe BER-encoded AuthenticatedSafe.
		 * @param strict true to use strict DER decoding, false not to.
		 * @param {String} password Password to decrypt with (optional).
		 */
		function _decodeAuthenticatedSafe(pfx, authSafe, strict, password) {
		  authSafe = asn1.fromDer(authSafe, strict);  /* actually it's BER encoded */

		  if(authSafe.tagClass !== asn1.Class.UNIVERSAL ||
		     authSafe.type !== asn1.Type.SEQUENCE ||
		     authSafe.constructed !== true) {
		    throw new Error('PKCS#12 AuthenticatedSafe expected to be a ' +
		      'SEQUENCE OF ContentInfo');
		  }

		  for(var i = 0; i < authSafe.value.length; i ++) {
		    var contentInfo = authSafe.value[i];

		    // validate contentInfo and capture data
		    var capture = {};
		    var errors = [];
		    if(!asn1.validate(contentInfo, contentInfoValidator, capture, errors)) {
		      var error = new Error('Cannot read ContentInfo.');
		      error.errors = errors;
		      throw error;
		    }

		    var obj = {
		      encrypted: false
		    };
		    var safeContents = null;
		    var data = capture.content.value[0];
		    switch(asn1.derToOid(capture.contentType)) {
		    case pki.oids.data:
		      if(data.tagClass !== asn1.Class.UNIVERSAL ||
		         data.type !== asn1.Type.OCTETSTRING) {
		        throw new Error('PKCS#12 SafeContents Data is not an OCTET STRING.');
		      }
		      safeContents = _decodePkcs7Data(data).value;
		      break;
		    case pki.oids.encryptedData:
		      safeContents = _decryptSafeContents(data, password);
		      obj.encrypted = true;
		      break;
		    default:
		      var error = new Error('Unsupported PKCS#12 contentType.');
		      error.contentType = asn1.derToOid(capture.contentType);
		      throw error;
		    }

		    obj.safeBags = _decodeSafeContents(safeContents, strict, password);
		    pfx.safeContents.push(obj);
		  }
		}

		/**
		 * Decrypt PKCS#7 EncryptedData structure.
		 *
		 * @param data ASN.1 encoded EncryptedContentInfo object.
		 * @param password The user-provided password.
		 *
		 * @return The decrypted SafeContents (ASN.1 object).
		 */
		function _decryptSafeContents(data, password) {
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(
		    data, forge.pkcs7.asn1.encryptedDataValidator, capture, errors)) {
		    var error = new Error('Cannot read EncryptedContentInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  var oid = asn1.derToOid(capture.contentType);
		  if(oid !== pki.oids.data) {
		    var error = new Error(
		      'PKCS#12 EncryptedContentInfo ContentType is not Data.');
		    error.oid = oid;
		    throw error;
		  }

		  // get cipher
		  oid = asn1.derToOid(capture.encAlgorithm);
		  var cipher = pki.pbe.getCipher(oid, capture.encParameter, password);

		  // get encrypted data
		  var encryptedContentAsn1 = _decodePkcs7Data(capture.encryptedContentAsn1);
		  var encrypted = forge.util.createBuffer(encryptedContentAsn1.value);

		  cipher.update(encrypted);
		  if(!cipher.finish()) {
		    throw new Error('Failed to decrypt PKCS#12 SafeContents.');
		  }

		  return cipher.output.getBytes();
		}

		/**
		 * Decode PKCS#12 SafeContents (BER-encoded) into array of Bag objects.
		 *
		 * The safeContents is a BER-encoded SEQUENCE OF SafeBag.
		 *
		 * @param {String} safeContents BER-encoded safeContents.
		 * @param strict true to use strict DER decoding, false not to.
		 * @param {String} password Password to decrypt with (optional).
		 *
		 * @return {Array} Array of Bag objects.
		 */
		function _decodeSafeContents(safeContents, strict, password) {
		  // if strict and no safe contents, return empty safes
		  if(!strict && safeContents.length === 0) {
		    return [];
		  }

		  // actually it's BER-encoded
		  safeContents = asn1.fromDer(safeContents, strict);

		  if(safeContents.tagClass !== asn1.Class.UNIVERSAL ||
		    safeContents.type !== asn1.Type.SEQUENCE ||
		    safeContents.constructed !== true) {
		    throw new Error(
		      'PKCS#12 SafeContents expected to be a SEQUENCE OF SafeBag.');
		  }

		  var res = [];
		  for(var i = 0; i < safeContents.value.length; i++) {
		    var safeBag = safeContents.value[i];

		    // validate SafeBag and capture data
		    var capture = {};
		    var errors = [];
		    if(!asn1.validate(safeBag, safeBagValidator, capture, errors)) {
		      var error = new Error('Cannot read SafeBag.');
		      error.errors = errors;
		      throw error;
		    }

		    /* Create bag object and push to result array. */
		    var bag = {
		      type: asn1.derToOid(capture.bagId),
		      attributes: _decodeBagAttributes(capture.bagAttributes)
		    };
		    res.push(bag);

		    var validator, decoder;
		    var bagAsn1 = capture.bagValue.value[0];
		    switch(bag.type) {
		      case pki.oids.pkcs8ShroudedKeyBag:
		        /* bagAsn1 has a EncryptedPrivateKeyInfo, which we need to decrypt.
		           Afterwards we can handle it like a keyBag,
		           which is a PrivateKeyInfo. */
		        bagAsn1 = pki.decryptPrivateKeyInfo(bagAsn1, password);
		        if(bagAsn1 === null) {
		          throw new Error(
		            'Unable to decrypt PKCS#8 ShroudedKeyBag, wrong password?');
		        }

		        /* fall through */
		      case pki.oids.keyBag:
		        /* A PKCS#12 keyBag is a simple PrivateKeyInfo as understood by our
		           PKI module, hence we don't have to do validation/capturing here,
		           just pass what we already got. */
		        try {
		          bag.key = pki.privateKeyFromAsn1(bagAsn1);
		        } catch(e) {
		          // ignore unknown key type, pass asn1 value
		          bag.key = null;
		          bag.asn1 = bagAsn1;
		        }
		        continue;  /* Nothing more to do. */

		      case pki.oids.certBag:
		        /* A PKCS#12 certBag can wrap both X.509 and sdsi certificates.
		           Therefore put the SafeBag content through another validator to
		           capture the fields.  Afterwards check & store the results. */
		        validator = certBagValidator;
		        decoder = function() {
		          if(asn1.derToOid(capture.certId) !== pki.oids.x509Certificate) {
		            var error = new Error(
		              'Unsupported certificate type, only X.509 supported.');
		            error.oid = asn1.derToOid(capture.certId);
		            throw error;
		          }

		          // true=produce cert hash
		          var certAsn1 = asn1.fromDer(capture.cert, strict);
		          try {
		            bag.cert = pki.certificateFromAsn1(certAsn1, true);
		          } catch(e) {
		            // ignore unknown cert type, pass asn1 value
		            bag.cert = null;
		            bag.asn1 = certAsn1;
		          }
		        };
		        break;

		      default:
		        var error = new Error('Unsupported PKCS#12 SafeBag type.');
		        error.oid = bag.type;
		        throw error;
		    }

		    /* Validate SafeBag value (i.e. CertBag, etc.) and capture data if needed. */
		    if(validator !== undefined &&
		       !asn1.validate(bagAsn1, validator, capture, errors)) {
		      var error = new Error('Cannot read PKCS#12 ' + validator.name);
		      error.errors = errors;
		      throw error;
		    }

		    /* Call decoder function from above to store the results. */
		    decoder();
		  }

		  return res;
		}

		/**
		 * Decode PKCS#12 SET OF PKCS12Attribute into JavaScript object.
		 *
		 * @param attributes SET OF PKCS12Attribute (ASN.1 object).
		 *
		 * @return the decoded attributes.
		 */
		function _decodeBagAttributes(attributes) {
		  var decodedAttrs = {};

		  if(attributes !== undefined) {
		    for(var i = 0; i < attributes.length; ++i) {
		      var capture = {};
		      var errors = [];
		      if(!asn1.validate(attributes[i], attributeValidator, capture, errors)) {
		        var error = new Error('Cannot read PKCS#12 BagAttribute.');
		        error.errors = errors;
		        throw error;
		      }

		      var oid = asn1.derToOid(capture.oid);
		      if(pki.oids[oid] === undefined) {
		        // unsupported attribute type, ignore.
		        continue;
		      }

		      decodedAttrs[pki.oids[oid]] = [];
		      for(var j = 0; j < capture.values.length; ++j) {
		        decodedAttrs[pki.oids[oid]].push(capture.values[j].value);
		      }
		    }
		  }

		  return decodedAttrs;
		}

		/**
		 * Wraps a private key and certificate in a PKCS#12 PFX wrapper. If a
		 * password is provided then the private key will be encrypted.
		 *
		 * An entire certificate chain may also be included. To do this, pass
		 * an array for the "cert" parameter where the first certificate is
		 * the one that is paired with the private key and each subsequent one
		 * verifies the previous one. The certificates may be in PEM format or
		 * have been already parsed by Forge.
		 *
		 * @todo implement password-based-encryption for the whole package
		 *
		 * @param key the private key.
		 * @param cert the certificate (may be an array of certificates in order
		 *          to specify a certificate chain).
		 * @param password the password to use, null for none.
		 * @param options:
		 *          algorithm the encryption algorithm to use
		 *            ('aes128', 'aes192', 'aes256', '3des'), defaults to 'aes128'.
		 *          count the iteration count to use.
		 *          saltSize the salt size to use.
		 *          useMac true to include a MAC, false not to, defaults to true.
		 *          localKeyId the local key ID to use, in hex.
		 *          friendlyName the friendly name to use.
		 *          generateLocalKeyId true to generate a random local key ID,
		 *            false not to, defaults to true.
		 *
		 * @return the PKCS#12 PFX ASN.1 object.
		 */
		p12.toPkcs12Asn1 = function(key, cert, password, options) {
		  // set default options
		  options = options || {};
		  options.saltSize = options.saltSize || 8;
		  options.count = options.count || 2048;
		  options.algorithm = options.algorithm || options.encAlgorithm || 'aes128';
		  if(!('useMac' in options)) {
		    options.useMac = true;
		  }
		  if(!('localKeyId' in options)) {
		    options.localKeyId = null;
		  }
		  if(!('generateLocalKeyId' in options)) {
		    options.generateLocalKeyId = true;
		  }

		  var localKeyId = options.localKeyId;
		  var bagAttrs;
		  if(localKeyId !== null) {
		    localKeyId = forge.util.hexToBytes(localKeyId);
		  } else if(options.generateLocalKeyId) {
		    // use SHA-1 of paired cert, if available
		    if(cert) {
		      var pairedCert = forge.util.isArray(cert) ? cert[0] : cert;
		      if(typeof pairedCert === 'string') {
		        pairedCert = pki.certificateFromPem(pairedCert);
		      }
		      var sha1 = forge.md.sha1.create();
		      sha1.update(asn1.toDer(pki.certificateToAsn1(pairedCert)).getBytes());
		      localKeyId = sha1.digest().getBytes();
		    } else {
		      // FIXME: consider using SHA-1 of public key (which can be generated
		      // from private key components), see: cert.generateSubjectKeyIdentifier
		      // generate random bytes
		      localKeyId = forge.random.getBytes(20);
		    }
		  }

		  var attrs = [];
		  if(localKeyId !== null) {
		    attrs.push(
		      // localKeyID
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // attrId
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(pki.oids.localKeyId).getBytes()),
		        // attrValues
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		            localKeyId)
		        ])
		      ]));
		  }
		  if('friendlyName' in options) {
		    attrs.push(
		      // friendlyName
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // attrId
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(pki.oids.friendlyName).getBytes()),
		        // attrValues
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BMPSTRING, false,
		            options.friendlyName)
		        ])
		      ]));
		  }

		  if(attrs.length > 0) {
		    bagAttrs = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, attrs);
		  }

		  // collect contents for AuthenticatedSafe
		  var contents = [];

		  // create safe bag(s) for certificate chain
		  var chain = [];
		  if(cert !== null) {
		    if(forge.util.isArray(cert)) {
		      chain = cert;
		    } else {
		      chain = [cert];
		    }
		  }

		  var certSafeBags = [];
		  for(var i = 0; i < chain.length; ++i) {
		    // convert cert from PEM as necessary
		    cert = chain[i];
		    if(typeof cert === 'string') {
		      cert = pki.certificateFromPem(cert);
		    }

		    // SafeBag
		    var certBagAttrs = (i === 0) ? bagAttrs : undefined;
		    var certAsn1 = pki.certificateToAsn1(cert);
		    var certSafeBag =
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // bagId
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(pki.oids.certBag).getBytes()),
		        // bagValue
		        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		          // CertBag
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		            // certId
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		              asn1.oidToDer(pki.oids.x509Certificate).getBytes()),
		            // certValue (x509Certificate)
		            asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		              asn1.create(
		                asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		                asn1.toDer(certAsn1).getBytes())
		            ])])]),
		        // bagAttributes (OPTIONAL)
		        certBagAttrs
		      ]);
		    certSafeBags.push(certSafeBag);
		  }

		  if(certSafeBags.length > 0) {
		    // SafeContents
		    var certSafeContents = asn1.create(
		      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, certSafeBags);

		    // ContentInfo
		    var certCI =
		      // PKCS#7 ContentInfo
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // contentType
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          // OID for the content type is 'data'
		          asn1.oidToDer(pki.oids.data).getBytes()),
		        // content
		        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		          asn1.create(
		            asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		            asn1.toDer(certSafeContents).getBytes())
		        ])
		      ]);
		    contents.push(certCI);
		  }

		  // create safe contents for private key
		  var keyBag = null;
		  if(key !== null) {
		    // SafeBag
		    var pkAsn1 = pki.wrapRsaPrivateKey(pki.privateKeyToAsn1(key));
		    if(password === null) {
		      // no encryption
		      keyBag = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // bagId
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(pki.oids.keyBag).getBytes()),
		        // bagValue
		        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		          // PrivateKeyInfo
		          pkAsn1
		        ]),
		        // bagAttributes (OPTIONAL)
		        bagAttrs
		      ]);
		    } else {
		      // encrypted PrivateKeyInfo
		      keyBag = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // bagId
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(pki.oids.pkcs8ShroudedKeyBag).getBytes()),
		        // bagValue
		        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		          // EncryptedPrivateKeyInfo
		          pki.encryptPrivateKeyInfo(pkAsn1, password, options)
		        ]),
		        // bagAttributes (OPTIONAL)
		        bagAttrs
		      ]);
		    }

		    // SafeContents
		    var keySafeContents =
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [keyBag]);

		    // ContentInfo
		    var keyCI =
		      // PKCS#7 ContentInfo
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // contentType
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          // OID for the content type is 'data'
		          asn1.oidToDer(pki.oids.data).getBytes()),
		        // content
		        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		          asn1.create(
		            asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		            asn1.toDer(keySafeContents).getBytes())
		        ])
		      ]);
		    contents.push(keyCI);
		  }

		  // create AuthenticatedSafe by stringing together the contents
		  var safe = asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, contents);

		  var macData;
		  if(options.useMac) {
		    // MacData
		    var sha1 = forge.md.sha1.create();
		    var macSalt = new forge.util.ByteBuffer(
		      forge.random.getBytes(options.saltSize));
		    var count = options.count;
		    // 160-bit key
		    var key = p12.generateKey(password, macSalt, 3, count, 20);
		    var mac = forge.hmac.create();
		    mac.start(sha1, key);
		    mac.update(asn1.toDer(safe).getBytes());
		    var macValue = mac.getMac();
		    macData = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // mac DigestInfo
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // digestAlgorithm
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          // algorithm = SHA-1
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(pki.oids.sha1).getBytes()),
		          // parameters = Null
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		        ]),
		        // digest
		        asn1.create(
		          asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING,
		          false, macValue.getBytes())
		      ]),
		      // macSalt OCTET STRING
		      asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, macSalt.getBytes()),
		      // iterations INTEGER (XXX: Only support count < 65536)
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		        asn1.integerToDer(count).getBytes()
		      )
		    ]);
		  }

		  // PFX
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // version (3)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      asn1.integerToDer(3).getBytes()),
		    // PKCS#7 ContentInfo
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // contentType
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        // OID for the content type is 'data'
		        asn1.oidToDer(pki.oids.data).getBytes()),
		      // content
		      asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		        asn1.create(
		          asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		          asn1.toDer(safe).getBytes())
		      ])
		    ]),
		    macData
		  ]);
		};

		/**
		 * Derives a PKCS#12 key.
		 *
		 * @param password the password to derive the key material from, null or
		 *          undefined for none.
		 * @param salt the salt, as a ByteBuffer, to use.
		 * @param id the PKCS#12 ID byte (1 = key material, 2 = IV, 3 = MAC).
		 * @param iter the iteration count.
		 * @param n the number of bytes to derive from the password.
		 * @param md the message digest to use, defaults to SHA-1.
		 *
		 * @return a ByteBuffer with the bytes derived from the password.
		 */
		p12.generateKey = forge.pbe.generatePkcs12Key;

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pkcs12';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pkcs12',[
		  'require',
		  'module',
		  './asn1',
		  './hmac',
		  './oids',
		  './pkcs7asn1',
		  './pbe',
		  './random',
		  './rsa',
		  './sha1',
		  './util',
		  './x509'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of a basic Public Key Infrastructure, including
		 * support for RSA public and private keys.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2010-2013 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for asn.1 API
		var asn1 = forge.asn1;

		/* Public Key Infrastructure (PKI) implementation. */
		var pki = forge.pki = forge.pki || {};

		/**
		 * NOTE: THIS METHOD IS DEPRECATED. Use pem.decode() instead.
		 *
		 * Converts PEM-formatted data to DER.
		 *
		 * @param pem the PEM-formatted data.
		 *
		 * @return the DER-formatted data.
		 */
		pki.pemToDer = function(pem) {
		  var msg = forge.pem.decode(pem)[0];
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert PEM to DER; PEM is encrypted.');
		  }
		  return forge.util.createBuffer(msg.body);
		};

		/**
		 * Converts an RSA private key from PEM format.
		 *
		 * @param pem the PEM-formatted private key.
		 *
		 * @return the private key.
		 */
		pki.privateKeyFromPem = function(pem) {
		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'PRIVATE KEY' && msg.type !== 'RSA PRIVATE KEY') {
		    var error = new Error('Could not convert private key from PEM; PEM ' +
		      'header type is not "PRIVATE KEY" or "RSA PRIVATE KEY".');
		    error.headerType = msg.type;
		    throw error;
		  }
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert private key from PEM; PEM is encrypted.');
		  }

		  // convert DER to ASN.1 object
		  var obj = asn1.fromDer(msg.body);

		  return pki.privateKeyFromAsn1(obj);
		};

		/**
		 * Converts an RSA private key to PEM format.
		 *
		 * @param key the private key.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted private key.
		 */
		pki.privateKeyToPem = function(key, maxline) {
		  // convert to ASN.1, then DER, then PEM-encode
		  var msg = {
		    type: 'RSA PRIVATE KEY',
		    body: asn1.toDer(pki.privateKeyToAsn1(key)).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		/**
		 * Converts a PrivateKeyInfo to PEM format.
		 *
		 * @param pki the PrivateKeyInfo.
		 * @param maxline the maximum characters per line, defaults to 64.
		 *
		 * @return the PEM-formatted private key.
		 */
		pki.privateKeyInfoToPem = function(pki, maxline) {
		  // convert to DER, then PEM-encode
		  var msg = {
		    type: 'PRIVATE KEY',
		    body: asn1.toDer(pki).getBytes()
		  };
		  return forge.pem.encode(msg, {maxline: maxline});
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pki';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pki',[
		  'require',
		  'module',
		  './asn1',
		  './oids',
		  './pbe',
		  './pem',
		  './pbkdf2',
		  './pkcs12',
		  './pss',
		  './rsa',
		  './util',
		  './x509'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * A Javascript implementation of Transport Layer Security (TLS).
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2009-2014 Digital Bazaar, Inc.
		 *
		 * The TLS Handshake Protocol involves the following steps:
		 *
		 * - Exchange hello messages to agree on algorithms, exchange random values,
		 * and check for session resumption.
		 *
		 * - Exchange the necessary cryptographic parameters to allow the client and
		 * server to agree on a premaster secret.
		 *
		 * - Exchange certificates and cryptographic information to allow the client
		 * and server to authenticate themselves.
		 *
		 * - Generate a master secret from the premaster secret and exchanged random
		 * values.
		 *
		 * - Provide security parameters to the record layer.
		 *
		 * - Allow the client and server to verify that their peer has calculated the
		 * same security parameters and that the handshake occurred without tampering
		 * by an attacker.
		 *
		 * Up to 4 different messages may be sent during a key exchange. The server
		 * certificate, the server key exchange, the client certificate, and the
		 * client key exchange.
		 *
		 * A typical handshake (from the client's perspective).
		 *
		 * 1. Client sends ClientHello.
		 * 2. Client receives ServerHello.
		 * 3. Client receives optional Certificate.
		 * 4. Client receives optional ServerKeyExchange.
		 * 5. Client receives ServerHelloDone.
		 * 6. Client sends optional Certificate.
		 * 7. Client sends ClientKeyExchange.
		 * 8. Client sends optional CertificateVerify.
		 * 9. Client sends ChangeCipherSpec.
		 * 10. Client sends Finished.
		 * 11. Client receives ChangeCipherSpec.
		 * 12. Client receives Finished.
		 * 13. Client sends/receives application data.
		 *
		 * To reuse an existing session:
		 *
		 * 1. Client sends ClientHello with session ID for reuse.
		 * 2. Client receives ServerHello with same session ID if reusing.
		 * 3. Client receives ChangeCipherSpec message if reusing.
		 * 4. Client receives Finished.
		 * 5. Client sends ChangeCipherSpec.
		 * 6. Client sends Finished.
		 *
		 * Note: Client ignores HelloRequest if in the middle of a handshake.
		 *
		 * Record Layer:
		 *
		 * The record layer fragments information blocks into TLSPlaintext records
		 * carrying data in chunks of 2^14 bytes or less. Client message boundaries are
		 * not preserved in the record layer (i.e., multiple client messages of the
		 * same ContentType MAY be coalesced into a single TLSPlaintext record, or a
		 * single message MAY be fragmented across several records).
		 *
		 * struct {
		 *   uint8 major;
		 *   uint8 minor;
		 * } ProtocolVersion;
		 *
		 * struct {
		 *   ContentType type;
		 *   ProtocolVersion version;
		 *   uint16 length;
		 *   opaque fragment[TLSPlaintext.length];
		 * } TLSPlaintext;
		 *
		 * type:
		 *   The higher-level protocol used to process the enclosed fragment.
		 *
		 * version:
		 *   The version of the protocol being employed. TLS Version 1.2 uses version
		 *   {3, 3}. TLS Version 1.0 uses version {3, 1}. Note that a client that
		 *   supports multiple versions of TLS may not know what version will be
		 *   employed before it receives the ServerHello.
		 *
		 * length:
		 *   The length (in bytes) of the following TLSPlaintext.fragment. The length
		 *   MUST NOT exceed 2^14 = 16384 bytes.
		 *
		 * fragment:
		 *   The application data. This data is transparent and treated as an
		 *   independent block to be dealt with by the higher-level protocol specified
		 *   by the type field.
		 *
		 * Implementations MUST NOT send zero-length fragments of Handshake, Alert, or
		 * ChangeCipherSpec content types. Zero-length fragments of Application data
		 * MAY be sent as they are potentially useful as a traffic analysis
		 * countermeasure.
		 *
		 * Note: Data of different TLS record layer content types MAY be interleaved.
		 * Application data is generally of lower precedence for transmission than
		 * other content types. However, records MUST be delivered to the network in
		 * the same order as they are protected by the record layer. Recipients MUST
		 * receive and process interleaved application layer traffic during handshakes
		 * subsequent to the first one on a connection.
		 *
		 * struct {
		 *   ContentType type;       // same as TLSPlaintext.type
		 *   ProtocolVersion version;// same as TLSPlaintext.version
		 *   uint16 length;
		 *   opaque fragment[TLSCompressed.length];
		 * } TLSCompressed;
		 *
		 * length:
		 *   The length (in bytes) of the following TLSCompressed.fragment.
		 *   The length MUST NOT exceed 2^14 + 1024.
		 *
		 * fragment:
		 *   The compressed form of TLSPlaintext.fragment.
		 *
		 * Note: A CompressionMethod.null operation is an identity operation; no fields
		 * are altered. In this implementation, since no compression is supported,
		 * uncompressed records are always the same as compressed records.
		 *
		 * Encryption Information:
		 *
		 * The encryption and MAC functions translate a TLSCompressed structure into a
		 * TLSCiphertext. The decryption functions reverse the process. The MAC of the
		 * record also includes a sequence number so that missing, extra, or repeated
		 * messages are detectable.
		 *
		 * struct {
		 *   ContentType type;
		 *   ProtocolVersion version;
		 *   uint16 length;
		 *   select (SecurityParameters.cipher_type) {
		 *     case stream: GenericStreamCipher;
		 *     case block:  GenericBlockCipher;
		 *     case aead:   GenericAEADCipher;
		 *   } fragment;
		 * } TLSCiphertext;
		 *
		 * type:
		 *   The type field is identical to TLSCompressed.type.
		 *
		 * version:
		 *   The version field is identical to TLSCompressed.version.
		 *
		 * length:
		 *   The length (in bytes) of the following TLSCiphertext.fragment.
		 *   The length MUST NOT exceed 2^14 + 2048.
		 *
		 * fragment:
		 *   The encrypted form of TLSCompressed.fragment, with the MAC.
		 *
		 * Note: Only CBC Block Ciphers are supported by this implementation.
		 *
		 * The TLSCompressed.fragment structures are converted to/from block
		 * TLSCiphertext.fragment structures.
		 *
		 * struct {
		 *   opaque IV[SecurityParameters.record_iv_length];
		 *   block-ciphered struct {
		 *     opaque content[TLSCompressed.length];
		 *     opaque MAC[SecurityParameters.mac_length];
		 *     uint8 padding[GenericBlockCipher.padding_length];
		 *     uint8 padding_length;
		 *   };
		 * } GenericBlockCipher;
		 *
		 * The MAC is generated as described in Section 6.2.3.1.
		 *
		 * IV:
		 *   The Initialization Vector (IV) SHOULD be chosen at random, and MUST be
		 *   unpredictable. Note that in versions of TLS prior to 1.1, there was no
		 *   IV field, and the last ciphertext block of the previous record (the "CBC
		 *   residue") was used as the IV. This was changed to prevent the attacks
		 *   described in [CBCATT]. For block ciphers, the IV length is of length
		 *   SecurityParameters.record_iv_length, which is equal to the
		 *   SecurityParameters.block_size.
		 *
		 * padding:
		 *   Padding that is added to force the length of the plaintext to be an
		 *   integral multiple of the block cipher's block length. The padding MAY be
		 *   any length up to 255 bytes, as long as it results in the
		 *   TLSCiphertext.length being an integral multiple of the block length.
		 *   Lengths longer than necessary might be desirable to frustrate attacks on
		 *   a protocol that are based on analysis of the lengths of exchanged
		 *   messages. Each uint8 in the padding data vector MUST be filled with the
		 *   padding length value. The receiver MUST check this padding and MUST use
		 *   the bad_record_mac alert to indicate padding errors.
		 *
		 * padding_length:
		 *   The padding length MUST be such that the total size of the
		 *   GenericBlockCipher structure is a multiple of the cipher's block length.
		 *   Legal values range from zero to 255, inclusive. This length specifies the
		 *   length of the padding field exclusive of the padding_length field itself.
		 *
		 * The encrypted data length (TLSCiphertext.length) is one more than the sum of
		 * SecurityParameters.block_length, TLSCompressed.length,
		 * SecurityParameters.mac_length, and padding_length.
		 *
		 * Example: If the block length is 8 bytes, the content length
		 * (TLSCompressed.length) is 61 bytes, and the MAC length is 20 bytes, then the
		 * length before padding is 82 bytes (this does not include the IV. Thus, the
		 * padding length modulo 8 must be equal to 6 in order to make the total length
		 * an even multiple of 8 bytes (the block length). The padding length can be
		 * 6, 14, 22, and so on, through 254. If the padding length were the minimum
		 * necessary, 6, the padding would be 6 bytes, each containing the value 6.
		 * Thus, the last 8 octets of the GenericBlockCipher before block encryption
		 * would be xx 06 06 06 06 06 06 06, where xx is the last octet of the MAC.
		 *
		 * Note: With block ciphers in CBC mode (Cipher Block Chaining), it is critical
		 * that the entire plaintext of the record be known before any ciphertext is
		 * transmitted. Otherwise, it is possible for the attacker to mount the attack
		 * described in [CBCATT].
		 *
		 * Implementation note: Canvel et al. [CBCTIME] have demonstrated a timing
		 * attack on CBC padding based on the time required to compute the MAC. In
		 * order to defend against this attack, implementations MUST ensure that
		 * record processing time is essentially the same whether or not the padding
		 * is correct. In general, the best way to do this is to compute the MAC even
		 * if the padding is incorrect, and only then reject the packet. For instance,
		 * if the pad appears to be incorrect, the implementation might assume a
		 * zero-length pad and then compute the MAC. This leaves a small timing
		 * channel, since MAC performance depends, to some extent, on the size of the
		 * data fragment, but it is not believed to be large enough to be exploitable,
		 * due to the large block size of existing MACs and the small size of the
		 * timing signal.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/**
		 * Generates pseudo random bytes by mixing the result of two hash functions,
		 * MD5 and SHA-1.
		 *
		 * prf_TLS1(secret, label, seed) =
		 *   P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed);
		 *
		 * Each P_hash function functions as follows:
		 *
		 * P_hash(secret, seed) = HMAC_hash(secret, A(1) + seed) +
		 *                        HMAC_hash(secret, A(2) + seed) +
		 *                        HMAC_hash(secret, A(3) + seed) + ...
		 * A() is defined as:
		 *   A(0) = seed
		 *   A(i) = HMAC_hash(secret, A(i-1))
		 *
		 * The '+' operator denotes concatenation.
		 *
		 * As many iterations A(N) as are needed are performed to generate enough
		 * pseudo random byte output. If an iteration creates more data than is
		 * necessary, then it is truncated.
		 *
		 * Therefore:
		 * A(1) = HMAC_hash(secret, A(0))
		 *      = HMAC_hash(secret, seed)
		 * A(2) = HMAC_hash(secret, A(1))
		 *      = HMAC_hash(secret, HMAC_hash(secret, seed))
		 *
		 * Therefore:
		 * P_hash(secret, seed) =
		 *   HMAC_hash(secret, HMAC_hash(secret, A(0)) + seed) +
		 *   HMAC_hash(secret, HMAC_hash(secret, A(1)) + seed) +
		 *   ...
		 *
		 * Therefore:
		 * P_hash(secret, seed) =
		 *   HMAC_hash(secret, HMAC_hash(secret, seed) + seed) +
		 *   HMAC_hash(secret, HMAC_hash(secret, HMAC_hash(secret, seed)) + seed) +
		 *   ...
		 *
		 * @param secret the secret to use.
		 * @param label the label to use.
		 * @param seed the seed value to use.
		 * @param length the number of bytes to generate.
		 *
		 * @return the pseudo random bytes in a byte buffer.
		 */
		var prf_TLS1 = function(secret, label, seed, length) {
		  var rval = forge.util.createBuffer();

		  /* For TLS 1.0, the secret is split in half, into two secrets of equal
		    length. If the secret has an odd length then the last byte of the first
		    half will be the same as the first byte of the second. The length of the
		    two secrets is half of the secret rounded up. */
		  var idx = (secret.length >> 1);
		  var slen = idx + (secret.length & 1);
		  var s1 = secret.substr(0, slen);
		  var s2 = secret.substr(idx, slen);
		  var ai = forge.util.createBuffer();
		  var hmac = forge.hmac.create();
		  seed = label + seed;

		  // determine the number of iterations that must be performed to generate
		  // enough output bytes, md5 creates 16 byte hashes, sha1 creates 20
		  var md5itr = Math.ceil(length / 16);
		  var sha1itr = Math.ceil(length / 20);

		  // do md5 iterations
		  hmac.start('MD5', s1);
		  var md5bytes = forge.util.createBuffer();
		  ai.putBytes(seed);
		  for(var i = 0; i < md5itr; ++i) {
		    // HMAC_hash(secret, A(i-1))
		    hmac.start(null, null);
		    hmac.update(ai.getBytes());
		    ai.putBuffer(hmac.digest());

		    // HMAC_hash(secret, A(i) + seed)
		    hmac.start(null, null);
		    hmac.update(ai.bytes() + seed);
		    md5bytes.putBuffer(hmac.digest());
		  }

		  // do sha1 iterations
		  hmac.start('SHA1', s2);
		  var sha1bytes = forge.util.createBuffer();
		  ai.clear();
		  ai.putBytes(seed);
		  for(var i = 0; i < sha1itr; ++i) {
		    // HMAC_hash(secret, A(i-1))
		    hmac.start(null, null);
		    hmac.update(ai.getBytes());
		    ai.putBuffer(hmac.digest());

		    // HMAC_hash(secret, A(i) + seed)
		    hmac.start(null, null);
		    hmac.update(ai.bytes() + seed);
		    sha1bytes.putBuffer(hmac.digest());
		  }

		  // XOR the md5 bytes with the sha1 bytes
		  rval.putBytes(forge.util.xorBytes(
		    md5bytes.getBytes(), sha1bytes.getBytes(), length));

		  return rval;
		};

		/**
		 * Generates pseudo random bytes using a SHA256 algorithm. For TLS 1.2.
		 *
		 * @param secret the secret to use.
		 * @param label the label to use.
		 * @param seed the seed value to use.
		 * @param length the number of bytes to generate.
		 *
		 * @return the pseudo random bytes in a byte buffer.
		 */
		var prf_sha256 = function(secret, label, seed, length) {
		   // FIXME: implement me for TLS 1.2
		};

		/**
		 * Gets a MAC for a record using the SHA-1 hash algorithm.
		 *
		 * @param key the mac key.
		 * @param state the sequence number (array of two 32-bit integers).
		 * @param record the record.
		 *
		 * @return the sha-1 hash (20 bytes) for the given record.
		 */
		var hmac_sha1 = function(key, seqNum, record) {
		  /* MAC is computed like so:
		  HMAC_hash(
		    key, seqNum +
		      TLSCompressed.type +
		      TLSCompressed.version +
		      TLSCompressed.length +
		      TLSCompressed.fragment)
		  */
		  var hmac = forge.hmac.create();
		  hmac.start('SHA1', key);
		  var b = forge.util.createBuffer();
		  b.putInt32(seqNum[0]);
		  b.putInt32(seqNum[1]);
		  b.putByte(record.type);
		  b.putByte(record.version.major);
		  b.putByte(record.version.minor);
		  b.putInt16(record.length);
		  b.putBytes(record.fragment.bytes());
		  hmac.update(b.getBytes());
		  return hmac.digest().getBytes();
		};

		/**
		 * Compresses the TLSPlaintext record into a TLSCompressed record using the
		 * deflate algorithm.
		 *
		 * @param c the TLS connection.
		 * @param record the TLSPlaintext record to compress.
		 * @param s the ConnectionState to use.
		 *
		 * @return true on success, false on failure.
		 */
		var deflate = function(c, record, s) {
		  var rval = false;

		  try {
		    var bytes = c.deflate(record.fragment.getBytes());
		    record.fragment = forge.util.createBuffer(bytes);
		    record.length = bytes.length;
		    rval = true;
		  } catch(ex) {
		    // deflate error, fail out
		  }

		  return rval;
		};

		/**
		 * Decompresses the TLSCompressed record into a TLSPlaintext record using the
		 * deflate algorithm.
		 *
		 * @param c the TLS connection.
		 * @param record the TLSCompressed record to decompress.
		 * @param s the ConnectionState to use.
		 *
		 * @return true on success, false on failure.
		 */
		var inflate = function(c, record, s) {
		  var rval = false;

		  try {
		    var bytes = c.inflate(record.fragment.getBytes());
		    record.fragment = forge.util.createBuffer(bytes);
		    record.length = bytes.length;
		    rval = true;
		  } catch(ex) {
		    // inflate error, fail out
		  }

		  return rval;
		};

		/**
		 * Reads a TLS variable-length vector from a byte buffer.
		 *
		 * Variable-length vectors are defined by specifying a subrange of legal
		 * lengths, inclusively, using the notation <floor..ceiling>. When these are
		 * encoded, the actual length precedes the vector's contents in the byte
		 * stream. The length will be in the form of a number consuming as many bytes
		 * as required to hold the vector's specified maximum (ceiling) length. A
		 * variable-length vector with an actual length field of zero is referred to
		 * as an empty vector.
		 *
		 * @param b the byte buffer.
		 * @param lenBytes the number of bytes required to store the length.
		 *
		 * @return the resulting byte buffer.
		 */
		var readVector = function(b, lenBytes) {
		  var len = 0;
		  switch(lenBytes) {
		  case 1:
		    len = b.getByte();
		    break;
		  case 2:
		    len = b.getInt16();
		    break;
		  case 3:
		    len = b.getInt24();
		    break;
		  case 4:
		    len = b.getInt32();
		    break;
		  }

		  // read vector bytes into a new buffer
		  return forge.util.createBuffer(b.getBytes(len));
		};

		/**
		 * Writes a TLS variable-length vector to a byte buffer.
		 *
		 * @param b the byte buffer.
		 * @param lenBytes the number of bytes required to store the length.
		 * @param v the byte buffer vector.
		 */
		var writeVector = function(b, lenBytes, v) {
		  // encode length at the start of the vector, where the number of bytes for
		  // the length is the maximum number of bytes it would take to encode the
		  // vector's ceiling
		  b.putInt(v.length(), lenBytes << 3);
		  b.putBuffer(v);
		};

		/**
		 * The tls implementation.
		 */
		var tls = {};

		/**
		 * Version: TLS 1.2 = 3.3, TLS 1.1 = 3.2, TLS 1.0 = 3.1. Both TLS 1.1 and
		 * TLS 1.2 were still too new (ie: openSSL didn't implement them) at the time
		 * of this implementation so TLS 1.0 was implemented instead.
		 */
		tls.Versions = {
		  TLS_1_0: {major: 3, minor: 1},
		  TLS_1_1: {major: 3, minor: 2},
		  TLS_1_2: {major: 3, minor: 3}
		};
		tls.SupportedVersions = [
		  tls.Versions.TLS_1_1,
		  tls.Versions.TLS_1_0
		];
		tls.Version = tls.SupportedVersions[0];

		/**
		 * Maximum fragment size. True maximum is 16384, but we fragment before that
		 * to allow for unusual small increases during compression.
		 */
		tls.MaxFragment = 16384 - 1024;

		/**
		 * Whether this entity is considered the "client" or "server".
		 * enum { server, client } ConnectionEnd;
		 */
		tls.ConnectionEnd = {
		  server: 0,
		  client: 1
		};

		/**
		 * Pseudo-random function algorithm used to generate keys from the master
		 * secret.
		 * enum { tls_prf_sha256 } PRFAlgorithm;
		 */
		tls.PRFAlgorithm = {
		  tls_prf_sha256: 0
		};

		/**
		 * Bulk encryption algorithms.
		 * enum { null, rc4, des3, aes } BulkCipherAlgorithm;
		 */
		tls.BulkCipherAlgorithm = {
		  none: null,
		  rc4: 0,
		  des3: 1,
		  aes: 2
		};

		/**
		 * Cipher types.
		 * enum { stream, block, aead } CipherType;
		 */
		tls.CipherType = {
		  stream: 0,
		  block: 1,
		  aead: 2
		};

		/**
		 * MAC (Message Authentication Code) algorithms.
		 * enum { null, hmac_md5, hmac_sha1, hmac_sha256,
		 *   hmac_sha384, hmac_sha512} MACAlgorithm;
		 */
		tls.MACAlgorithm = {
		  none: null,
		  hmac_md5: 0,
		  hmac_sha1: 1,
		  hmac_sha256: 2,
		  hmac_sha384: 3,
		  hmac_sha512: 4
		};

		/**
		 * Compression algorithms.
		 * enum { null(0), deflate(1), (255) } CompressionMethod;
		 */
		tls.CompressionMethod = {
		  none: 0,
		  deflate: 1
		};

		/**
		 * TLS record content types.
		 * enum {
		 *   change_cipher_spec(20), alert(21), handshake(22),
		 *   application_data(23), (255)
		 * } ContentType;
		 */
		tls.ContentType = {
		  change_cipher_spec: 20,
		  alert: 21,
		  handshake: 22,
		  application_data: 23,
		  heartbeat: 24
		};

		/**
		 * TLS handshake types.
		 * enum {
		 *   hello_request(0), client_hello(1), server_hello(2),
		 *   certificate(11), server_key_exchange (12),
		 *   certificate_request(13), server_hello_done(14),
		 *   certificate_verify(15), client_key_exchange(16),
		 *   finished(20), (255)
		 * } HandshakeType;
		 */
		tls.HandshakeType = {
		  hello_request: 0,
		  client_hello: 1,
		  server_hello: 2,
		  certificate: 11,
		  server_key_exchange: 12,
		  certificate_request: 13,
		  server_hello_done: 14,
		  certificate_verify: 15,
		  client_key_exchange: 16,
		  finished: 20
		};

		/**
		 * TLS Alert Protocol.
		 *
		 * enum { warning(1), fatal(2), (255) } AlertLevel;
		 *
		 * enum {
		 *   close_notify(0),
		 *   unexpected_message(10),
		 *   bad_record_mac(20),
		 *   decryption_failed(21),
		 *   record_overflow(22),
		 *   decompression_failure(30),
		 *   handshake_failure(40),
		 *   bad_certificate(42),
		 *   unsupported_certificate(43),
		 *   certificate_revoked(44),
		 *   certificate_expired(45),
		 *   certificate_unknown(46),
		 *   illegal_parameter(47),
		 *   unknown_ca(48),
		 *   access_denied(49),
		 *   decode_error(50),
		 *   decrypt_error(51),
		 *   export_restriction(60),
		 *   protocol_version(70),
		 *   insufficient_security(71),
		 *   internal_error(80),
		 *   user_canceled(90),
		 *   no_renegotiation(100),
		 *   (255)
		 * } AlertDescription;
		 *
		 * struct {
		 *   AlertLevel level;
		 *   AlertDescription description;
		 * } Alert;
		 */
		tls.Alert = {};
		tls.Alert.Level = {
		  warning: 1,
		  fatal: 2
		};
		tls.Alert.Description = {
		  close_notify: 0,
		  unexpected_message: 10,
		  bad_record_mac: 20,
		  decryption_failed: 21,
		  record_overflow: 22,
		  decompression_failure: 30,
		  handshake_failure: 40,
		  bad_certificate: 42,
		  unsupported_certificate: 43,
		  certificate_revoked: 44,
		  certificate_expired: 45,
		  certificate_unknown: 46,
		  illegal_parameter: 47,
		  unknown_ca: 48,
		  access_denied: 49,
		  decode_error: 50,
		  decrypt_error: 51,
		  export_restriction: 60,
		  protocol_version: 70,
		  insufficient_security: 71,
		  internal_error: 80,
		  user_canceled: 90,
		  no_renegotiation: 100
		};

		/**
		 * TLS Heartbeat Message types.
		 * enum {
		 *   heartbeat_request(1),
		 *   heartbeat_response(2),
		 *   (255)
		 * } HeartbeatMessageType;
		 */
		tls.HeartbeatMessageType = {
		  heartbeat_request: 1,
		  heartbeat_response: 2
		};

		/**
		 * Supported cipher suites.
		 */
		tls.CipherSuites = {};

		/**
		 * Gets a supported cipher suite from its 2 byte ID.
		 *
		 * @param twoBytes two bytes in a string.
		 *
		 * @return the matching supported cipher suite or null.
		 */
		tls.getCipherSuite = function(twoBytes) {
		  var rval = null;
		  for(var key in tls.CipherSuites) {
		    var cs = tls.CipherSuites[key];
		    if(cs.id[0] === twoBytes.charCodeAt(0) &&
		      cs.id[1] === twoBytes.charCodeAt(1)) {
		      rval = cs;
		      break;
		    }
		  }
		  return rval;
		};

		/**
		 * Called when an unexpected record is encountered.
		 *
		 * @param c the connection.
		 * @param record the record.
		 */
		tls.handleUnexpected = function(c, record) {
		  // if connection is client and closed, ignore unexpected messages
		  var ignore = (!c.open && c.entity === tls.ConnectionEnd.client);
		  if(!ignore) {
		    c.error(c, {
		      message: 'Unexpected message. Received TLS record out of order.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.unexpected_message
		      }
		    });
		  }
		};

		/**
		 * Called when a client receives a HelloRequest record.
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleHelloRequest = function(c, record, length) {
		  // ignore renegotiation requests from the server during a handshake, but
		  // if handshaking, send a warning alert that renegotation is denied
		  if(!c.handshaking && c.handshakes > 0) {
		    // send alert warning
		    tls.queue(c, tls.createAlert(c, {
		       level: tls.Alert.Level.warning,
		       description: tls.Alert.Description.no_renegotiation
		    }));
		    tls.flush(c);
		  }

		  // continue
		  c.process();
		};

		/**
		 * Parses a hello message from a ClientHello or ServerHello record.
		 *
		 * @param record the record to parse.
		 *
		 * @return the parsed message.
		 */
		tls.parseHelloMessage = function(c, record, length) {
		  var msg = null;

		  var client = (c.entity === tls.ConnectionEnd.client);

		  // minimum of 38 bytes in message
		  if(length < 38) {
		    c.error(c, {
		      message: client ?
		        'Invalid ServerHello message. Message too short.' :
		        'Invalid ClientHello message. Message too short.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.illegal_parameter
		      }
		    });
		  } else {
		    // use 'remaining' to calculate # of remaining bytes in the message
		    var b = record.fragment;
		    var remaining = b.length();
		    msg = {
		      version: {
		        major: b.getByte(),
		        minor: b.getByte()
		      },
		      random: forge.util.createBuffer(b.getBytes(32)),
		      session_id: readVector(b, 1),
		      extensions: []
		    };
		    if(client) {
		      msg.cipher_suite = b.getBytes(2);
		      msg.compression_method = b.getByte();
		    } else {
		      msg.cipher_suites = readVector(b, 2);
		      msg.compression_methods = readVector(b, 1);
		    }

		    // read extensions if there are any bytes left in the message
		    remaining = length - (remaining - b.length());
		    if(remaining > 0) {
		      // parse extensions
		      var exts = readVector(b, 2);
		      while(exts.length() > 0) {
		        msg.extensions.push({
		          type: [exts.getByte(), exts.getByte()],
		          data: readVector(exts, 2)
		        });
		      }

		      // TODO: make extension support modular
		      if(!client) {
		        for(var i = 0; i < msg.extensions.length; ++i) {
		          var ext = msg.extensions[i];

		          // support SNI extension
		          if(ext.type[0] === 0x00 && ext.type[1] === 0x00) {
		            // get server name list
		            var snl = readVector(ext.data, 2);
		            while(snl.length() > 0) {
		              // read server name type
		              var snType = snl.getByte();

		              // only HostName type (0x00) is known, break out if
		              // another type is detected
		              if(snType !== 0x00) {
		                break;
		              }

		              // add host name to server name list
		              c.session.extensions.server_name.serverNameList.push(
		                readVector(snl, 2).getBytes());
		            }
		          }
		        }
		      }
		    }

		    // version already set, do not allow version change
		    if(c.session.version) {
		      if(msg.version.major !== c.session.version.major ||
		        msg.version.minor !== c.session.version.minor) {
		        return c.error(c, {
		          message: 'TLS version change is disallowed during renegotiation.',
		          send: true,
		          alert: {
		            level: tls.Alert.Level.fatal,
		            description: tls.Alert.Description.protocol_version
		          }
		        });
		      }
		    }

		    // get the chosen (ServerHello) cipher suite
		    if(client) {
		      // FIXME: should be checking configured acceptable cipher suites
		      c.session.cipherSuite = tls.getCipherSuite(msg.cipher_suite);
		    } else {
		      // get a supported preferred (ClientHello) cipher suite
		      // choose the first supported cipher suite
		      var tmp = forge.util.createBuffer(msg.cipher_suites.bytes());
		      while(tmp.length() > 0) {
		        // FIXME: should be checking configured acceptable suites
		        // cipher suites take up 2 bytes
		        c.session.cipherSuite = tls.getCipherSuite(tmp.getBytes(2));
		        if(c.session.cipherSuite !== null) {
		          break;
		        }
		      }
		    }

		    // cipher suite not supported
		    if(c.session.cipherSuite === null) {
		      return c.error(c, {
		        message: 'No cipher suites in common.',
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.handshake_failure
		        },
		        cipherSuite: forge.util.bytesToHex(msg.cipher_suite)
		      });
		    }

		    // TODO: handle compression methods
		    if(client) {
		      c.session.compressionMethod = msg.compression_method;
		    } else {
		      // no compression
		      c.session.compressionMethod = tls.CompressionMethod.none;
		    }
		  }

		  return msg;
		};

		/**
		 * Creates security parameters for the given connection based on the given
		 * hello message.
		 *
		 * @param c the TLS connection.
		 * @param msg the hello message.
		 */
		tls.createSecurityParameters = function(c, msg) {
		  /* Note: security params are from TLS 1.2, some values like prf_algorithm
		  are ignored for TLS 1.0/1.1 and the builtin as specified in the spec is
		  used. */

		  // TODO: handle other options from server when more supported

		  // get client and server randoms
		  var client = (c.entity === tls.ConnectionEnd.client);
		  var msgRandom = msg.random.bytes();
		  var cRandom = client ? c.session.sp.client_random : msgRandom;
		  var sRandom = client ? msgRandom : tls.createRandom().getBytes();

		  // create new security parameters
		  c.session.sp = {
		    entity: c.entity,
		    prf_algorithm: tls.PRFAlgorithm.tls_prf_sha256,
		    bulk_cipher_algorithm: null,
		    cipher_type: null,
		    enc_key_length: null,
		    block_length: null,
		    fixed_iv_length: null,
		    record_iv_length: null,
		    mac_algorithm: null,
		    mac_length: null,
		    mac_key_length: null,
		    compression_algorithm: c.session.compressionMethod,
		    pre_master_secret: null,
		    master_secret: null,
		    client_random: cRandom,
		    server_random: sRandom
		  };
		};

		/**
		 * Called when a client receives a ServerHello record.
		 *
		 * When a ServerHello message will be sent:
		 *   The server will send this message in response to a client hello message
		 *   when it was able to find an acceptable set of algorithms. If it cannot
		 *   find such a match, it will respond with a handshake failure alert.
		 *
		 * uint24 length;
		 * struct {
		 *   ProtocolVersion server_version;
		 *   Random random;
		 *   SessionID session_id;
		 *   CipherSuite cipher_suite;
		 *   CompressionMethod compression_method;
		 *   select(extensions_present) {
		 *     case false:
		 *       struct {};
		 *     case true:
		 *       Extension extensions<0..2^16-1>;
		 *   };
		 * } ServerHello;
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleServerHello = function(c, record, length) {
		  var msg = tls.parseHelloMessage(c, record, length);
		  if(c.fail) {
		    return;
		  }

		  // ensure server version is compatible
		  if(msg.version.minor <= c.version.minor) {
		    c.version.minor = msg.version.minor;
		  } else {
		    return c.error(c, {
		      message: 'Incompatible TLS version.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.protocol_version
		      }
		    });
		  }

		  // indicate session version has been set
		  c.session.version = c.version;

		  // get the session ID from the message
		  var sessionId = msg.session_id.bytes();

		  // if the session ID is not blank and matches the cached one, resume
		  // the session
		  if(sessionId.length > 0 && sessionId === c.session.id) {
		    // resuming session, expect a ChangeCipherSpec next
		    c.expect = SCC;
		    c.session.resuming = true;

		    // get new server random
		    c.session.sp.server_random = msg.random.bytes();
		  } else {
		    // not resuming, expect a server Certificate message next
		    c.expect = SCE;
		    c.session.resuming = false;

		    // create new security parameters
		    tls.createSecurityParameters(c, msg);
		  }

		  // set new session ID
		  c.session.id = sessionId;

		  // continue
		  c.process();
		};

		/**
		 * Called when a server receives a ClientHello record.
		 *
		 * When a ClientHello message will be sent:
		 *   When a client first connects to a server it is required to send the
		 *   client hello as its first message. The client can also send a client
		 *   hello in response to a hello request or on its own initiative in order
		 *   to renegotiate the security parameters in an existing connection.
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleClientHello = function(c, record, length) {
		  var msg = tls.parseHelloMessage(c, record, length);
		  if(c.fail) {
		    return;
		  }

		  // get the session ID from the message
		  var sessionId = msg.session_id.bytes();

		  // see if the given session ID is in the cache
		  var session = null;
		  if(c.sessionCache) {
		    session = c.sessionCache.getSession(sessionId);
		    if(session === null) {
		      // session ID not found
		      sessionId = '';
		    } else if(session.version.major !== msg.version.major ||
		      session.version.minor > msg.version.minor) {
		      // if session version is incompatible with client version, do not resume
		      session = null;
		      sessionId = '';
		    }
		  }

		  // no session found to resume, generate a new session ID
		  if(sessionId.length === 0) {
		    sessionId = forge.random.getBytes(32);
		  }

		  // update session
		  c.session.id = sessionId;
		  c.session.clientHelloVersion = msg.version;
		  c.session.sp = {};
		  if(session) {
		    // use version and security parameters from resumed session
		    c.version = c.session.version = session.version;
		    c.session.sp = session.sp;
		  } else {
		    // use highest compatible minor version
		    var version;
		    for(var i = 1; i < tls.SupportedVersions.length; ++i) {
		      version = tls.SupportedVersions[i];
		      if(version.minor <= msg.version.minor) {
		        break;
		      }
		    }
		    c.version = {major: version.major, minor: version.minor};
		    c.session.version = c.version;
		  }

		  // if a session is set, resume it
		  if(session !== null) {
		    // resuming session, expect a ChangeCipherSpec next
		    c.expect = CCC;
		    c.session.resuming = true;

		    // get new client random
		    c.session.sp.client_random = msg.random.bytes();
		  } else {
		    // not resuming, expect a Certificate or ClientKeyExchange
		    c.expect = (c.verifyClient !== false) ? CCE : CKE;
		    c.session.resuming = false;

		    // create new security parameters
		    tls.createSecurityParameters(c, msg);
		  }

		  // connection now open
		  c.open = true;

		  // queue server hello
		  tls.queue(c, tls.createRecord(c, {
		    type: tls.ContentType.handshake,
		    data: tls.createServerHello(c)
		  }));

		  if(c.session.resuming) {
		    // queue change cipher spec message
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.change_cipher_spec,
		      data: tls.createChangeCipherSpec()
		    }));

		    // create pending state
		    c.state.pending = tls.createConnectionState(c);

		    // change current write state to pending write state
		    c.state.current.write = c.state.pending.write;

		    // queue finished
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.handshake,
		      data: tls.createFinished(c)
		    }));
		  } else {
		    // queue server certificate
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.handshake,
		      data: tls.createCertificate(c)
		    }));

		    if(!c.fail) {
		      // queue server key exchange
		      tls.queue(c, tls.createRecord(c, {
		        type: tls.ContentType.handshake,
		        data: tls.createServerKeyExchange(c)
		      }));

		      // request client certificate if set
		      if(c.verifyClient !== false) {
		        // queue certificate request
		        tls.queue(c, tls.createRecord(c, {
		          type: tls.ContentType.handshake,
		          data: tls.createCertificateRequest(c)
		        }));
		      }

		      // queue server hello done
		      tls.queue(c, tls.createRecord(c, {
		        type: tls.ContentType.handshake,
		        data: tls.createServerHelloDone(c)
		      }));
		    }
		  }

		  // send records
		  tls.flush(c);

		  // continue
		  c.process();
		};

		/**
		 * Called when a client receives a Certificate record.
		 *
		 * When this message will be sent:
		 *   The server must send a certificate whenever the agreed-upon key exchange
		 *   method is not an anonymous one. This message will always immediately
		 *   follow the server hello message.
		 *
		 * Meaning of this message:
		 *   The certificate type must be appropriate for the selected cipher suite's
		 *   key exchange algorithm, and is generally an X.509v3 certificate. It must
		 *   contain a key which matches the key exchange method, as follows. Unless
		 *   otherwise specified, the signing algorithm for the certificate must be
		 *   the same as the algorithm for the certificate key. Unless otherwise
		 *   specified, the public key may be of any length.
		 *
		 * opaque ASN.1Cert<1..2^24-1>;
		 * struct {
		 *   ASN.1Cert certificate_list<1..2^24-1>;
		 * } Certificate;
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleCertificate = function(c, record, length) {
		  // minimum of 3 bytes in message
		  if(length < 3) {
		    return c.error(c, {
		      message: 'Invalid Certificate message. Message too short.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.illegal_parameter
		      }
		    });
		  }

		  var b = record.fragment;
		  var msg = {
		    certificate_list: readVector(b, 3)
		  };

		  /* The sender's certificate will be first in the list (chain), each
		    subsequent one that follows will certify the previous one, but root
		    certificates (self-signed) that specify the certificate authority may
		    be omitted under the assumption that clients must already possess it. */
		  var cert, asn1;
		  var certs = [];
		  try {
		    while(msg.certificate_list.length() > 0) {
		      // each entry in msg.certificate_list is a vector with 3 len bytes
		      cert = readVector(msg.certificate_list, 3);
		      asn1 = forge.asn1.fromDer(cert);
		      cert = forge.pki.certificateFromAsn1(asn1, true);
		      certs.push(cert);
		    }
		  } catch(ex) {
		    return c.error(c, {
		      message: 'Could not parse certificate list.',
		      cause: ex,
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.bad_certificate
		      }
		    });
		  }

		  // ensure at least 1 certificate was provided if in client-mode
		  // or if verifyClient was set to true to require a certificate
		  // (as opposed to 'optional')
		  var client = (c.entity === tls.ConnectionEnd.client);
		  if((client || c.verifyClient === true) && certs.length === 0) {
		    // error, no certificate
		    c.error(c, {
		      message: client ?
		        'No server certificate provided.' :
		        'No client certificate provided.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.illegal_parameter
		      }
		    });
		  } else if(certs.length === 0) {
		    // no certs to verify
		    // expect a ServerKeyExchange or ClientKeyExchange message next
		    c.expect = client ? SKE : CKE;
		  } else {
		    // save certificate in session
		    if(client) {
		      c.session.serverCertificate = certs[0];
		    } else {
		      c.session.clientCertificate = certs[0];
		    }

		    if(tls.verifyCertificateChain(c, certs)) {
		      // expect a ServerKeyExchange or ClientKeyExchange message next
		      c.expect = client ? SKE : CKE;
		    }
		  }

		  // continue
		  c.process();
		};

		/**
		 * Called when a client receives a ServerKeyExchange record.
		 *
		 * When this message will be sent:
		 *   This message will be sent immediately after the server certificate
		 *   message (or the server hello message, if this is an anonymous
		 *   negotiation).
		 *
		 *   The server key exchange message is sent by the server only when the
		 *   server certificate message (if sent) does not contain enough data to
		 *   allow the client to exchange a premaster secret.
		 *
		 * Meaning of this message:
		 *   This message conveys cryptographic information to allow the client to
		 *   communicate the premaster secret: either an RSA public key to encrypt
		 *   the premaster secret with, or a Diffie-Hellman public key with which the
		 *   client can complete a key exchange (with the result being the premaster
		 *   secret.)
		 *
		 * enum {
		 *   dhe_dss, dhe_rsa, dh_anon, rsa, dh_dss, dh_rsa
		 * } KeyExchangeAlgorithm;
		 *
		 * struct {
		 *   opaque dh_p<1..2^16-1>;
		 *   opaque dh_g<1..2^16-1>;
		 *   opaque dh_Ys<1..2^16-1>;
		 * } ServerDHParams;
		 *
		 * struct {
		 *   select(KeyExchangeAlgorithm) {
		 *     case dh_anon:
		 *       ServerDHParams params;
		 *     case dhe_dss:
		 *     case dhe_rsa:
		 *       ServerDHParams params;
		 *       digitally-signed struct {
		 *         opaque client_random[32];
		 *         opaque server_random[32];
		 *         ServerDHParams params;
		 *       } signed_params;
		 *     case rsa:
		 *     case dh_dss:
		 *     case dh_rsa:
		 *       struct {};
		 *   };
		 * } ServerKeyExchange;
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleServerKeyExchange = function(c, record, length) {
		  // this implementation only supports RSA, no Diffie-Hellman support
		  // so any length > 0 is invalid
		  if(length > 0) {
		    return c.error(c, {
		      message: 'Invalid key parameters. Only RSA is supported.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.unsupported_certificate
		      }
		    });
		  }

		  // expect an optional CertificateRequest message next
		  c.expect = SCR;

		  // continue
		  c.process();
		};

		/**
		 * Called when a client receives a ClientKeyExchange record.
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleClientKeyExchange = function(c, record, length) {
		  // this implementation only supports RSA, no Diffie-Hellman support
		  // so any length < 48 is invalid
		  if(length < 48) {
		    return c.error(c, {
		      message: 'Invalid key parameters. Only RSA is supported.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.unsupported_certificate
		      }
		    });
		  }

		  var b = record.fragment;
		  var msg = {
		    enc_pre_master_secret: readVector(b, 2).getBytes()
		  };

		  // do rsa decryption
		  var privateKey = null;
		  if(c.getPrivateKey) {
		    try {
		      privateKey = c.getPrivateKey(c, c.session.serverCertificate);
		      privateKey = forge.pki.privateKeyFromPem(privateKey);
		    } catch(ex) {
		      c.error(c, {
		        message: 'Could not get private key.',
		        cause: ex,
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.internal_error
		        }
		      });
		    }
		  }

		  if(privateKey === null) {
		    return c.error(c, {
		      message: 'No private key set.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.internal_error
		      }
		    });
		  }

		  try {
		    // decrypt 48-byte pre-master secret
		    var sp = c.session.sp;
		    sp.pre_master_secret = privateKey.decrypt(msg.enc_pre_master_secret);

		    // ensure client hello version matches first 2 bytes
		    var version = c.session.clientHelloVersion;
		    if(version.major !== sp.pre_master_secret.charCodeAt(0) ||
		      version.minor !== sp.pre_master_secret.charCodeAt(1)) {
		      // error, do not send alert (see BLEI attack below)
		      throw new Error('TLS version rollback attack detected.');
		    }
		  } catch(ex) {
		    /* Note: Daniel Bleichenbacher [BLEI] can be used to attack a
		      TLS server which is using PKCS#1 encoded RSA, so instead of
		      failing here, we generate 48 random bytes and use that as
		      the pre-master secret. */
		    sp.pre_master_secret = forge.random.getBytes(48);
		  }

		  // expect a CertificateVerify message if a Certificate was received that
		  // does not have fixed Diffie-Hellman params, otherwise expect
		  // ChangeCipherSpec
		  c.expect = CCC;
		  if(c.session.clientCertificate !== null) {
		    // only RSA support, so expect CertificateVerify
		    // TODO: support Diffie-Hellman
		    c.expect = CCV;
		  }

		  // continue
		  c.process();
		};

		/**
		 * Called when a client receives a CertificateRequest record.
		 *
		 * When this message will be sent:
		 *   A non-anonymous server can optionally request a certificate from the
		 *   client, if appropriate for the selected cipher suite. This message, if
		 *   sent, will immediately follow the Server Key Exchange message (if it is
		 *   sent; otherwise, the Server Certificate message).
		 *
		 * enum {
		 *   rsa_sign(1), dss_sign(2), rsa_fixed_dh(3), dss_fixed_dh(4),
		 *   rsa_ephemeral_dh_RESERVED(5), dss_ephemeral_dh_RESERVED(6),
		 *   fortezza_dms_RESERVED(20), (255)
		 * } ClientCertificateType;
		 *
		 * opaque DistinguishedName<1..2^16-1>;
		 *
		 * struct {
		 *   ClientCertificateType certificate_types<1..2^8-1>;
		 *   SignatureAndHashAlgorithm supported_signature_algorithms<2^16-1>;
		 *   DistinguishedName certificate_authorities<0..2^16-1>;
		 * } CertificateRequest;
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleCertificateRequest = function(c, record, length) {
		  // minimum of 3 bytes in message
		  if(length < 3) {
		    return c.error(c, {
		      message: 'Invalid CertificateRequest. Message too short.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.illegal_parameter
		      }
		    });
		  }

		  // TODO: TLS 1.2+ has different format including
		  // SignatureAndHashAlgorithm after cert types
		  var b = record.fragment;
		  var msg = {
		    certificate_types: readVector(b, 1),
		    certificate_authorities: readVector(b, 2)
		  };

		  // save certificate request in session
		  c.session.certificateRequest = msg;

		  // expect a ServerHelloDone message next
		  c.expect = SHD;

		  // continue
		  c.process();
		};

		/**
		 * Called when a server receives a CertificateVerify record.
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleCertificateVerify = function(c, record, length) {
		  if(length < 2) {
		    return c.error(c, {
		      message: 'Invalid CertificateVerify. Message too short.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.illegal_parameter
		      }
		    });
		  }

		  // rewind to get full bytes for message so it can be manually
		  // digested below (special case for CertificateVerify messages because
		  // they must be digested *after* handling as opposed to all others)
		  var b = record.fragment;
		  b.read -= 4;
		  var msgBytes = b.bytes();
		  b.read += 4;

		  var msg = {
		    signature: readVector(b, 2).getBytes()
		  };

		  // TODO: add support for DSA

		  // generate data to verify
		  var verify = forge.util.createBuffer();
		  verify.putBuffer(c.session.md5.digest());
		  verify.putBuffer(c.session.sha1.digest());
		  verify = verify.getBytes();

		  try {
		    var cert = c.session.clientCertificate;
		    /*b = forge.pki.rsa.decrypt(
		      msg.signature, cert.publicKey, true, verify.length);
		    if(b !== verify) {*/
		    if(!cert.publicKey.verify(verify, msg.signature, 'NONE')) {
		      throw new Error('CertificateVerify signature does not match.');
		    }

		    // digest message now that it has been handled
		    c.session.md5.update(msgBytes);
		    c.session.sha1.update(msgBytes);
		  } catch(ex) {
		    return c.error(c, {
		      message: 'Bad signature in CertificateVerify.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.handshake_failure
		      }
		    });
		  }

		  // expect ChangeCipherSpec
		  c.expect = CCC;

		  // continue
		  c.process();
		};

		/**
		 * Called when a client receives a ServerHelloDone record.
		 *
		 * When this message will be sent:
		 *   The server hello done message is sent by the server to indicate the end
		 *   of the server hello and associated messages. After sending this message
		 *   the server will wait for a client response.
		 *
		 * Meaning of this message:
		 *   This message means that the server is done sending messages to support
		 *   the key exchange, and the client can proceed with its phase of the key
		 *   exchange.
		 *
		 *   Upon receipt of the server hello done message the client should verify
		 *   that the server provided a valid certificate if required and check that
		 *   the server hello parameters are acceptable.
		 *
		 * struct {} ServerHelloDone;
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleServerHelloDone = function(c, record, length) {
		  // len must be 0 bytes
		  if(length > 0) {
		    return c.error(c, {
		      message: 'Invalid ServerHelloDone message. Invalid length.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.record_overflow
		      }
		    });
		  }

		  if(c.serverCertificate === null) {
		    // no server certificate was provided
		    var error = {
		      message: 'No server certificate provided. Not enough security.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.insufficient_security
		      }
		    };

		    // call application callback
		    var depth = 0;
		    var ret = c.verify(c, error.alert.description, depth, []);
		    if(ret !== true) {
		      // check for custom alert info
		      if(ret || ret === 0) {
		        // set custom message and alert description
		        if(typeof ret === 'object' && !forge.util.isArray(ret)) {
		          if(ret.message) {
		            error.message = ret.message;
		          }
		          if(ret.alert) {
		            error.alert.description = ret.alert;
		          }
		        } else if(typeof ret === 'number') {
		          // set custom alert description
		          error.alert.description = ret;
		        }
		      }

		      // send error
		      return c.error(c, error);
		    }
		  }

		  // create client certificate message if requested
		  if(c.session.certificateRequest !== null) {
		    record = tls.createRecord(c, {
		      type: tls.ContentType.handshake,
		      data: tls.createCertificate(c)
		    });
		    tls.queue(c, record);
		  }

		  // create client key exchange message
		  record = tls.createRecord(c, {
		     type: tls.ContentType.handshake,
		     data: tls.createClientKeyExchange(c)
		  });
		  tls.queue(c, record);

		  // expect no messages until the following callback has been called
		  c.expect = SER;

		  // create callback to handle client signature (for client-certs)
		  var callback = function(c, signature) {
		    if(c.session.certificateRequest !== null &&
		      c.session.clientCertificate !== null) {
		      // create certificate verify message
		      tls.queue(c, tls.createRecord(c, {
		        type: tls.ContentType.handshake,
		        data: tls.createCertificateVerify(c, signature)
		      }));
		    }

		    // create change cipher spec message
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.change_cipher_spec,
		      data: tls.createChangeCipherSpec()
		    }));

		    // create pending state
		    c.state.pending = tls.createConnectionState(c);

		    // change current write state to pending write state
		    c.state.current.write = c.state.pending.write;

		    // create finished message
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.handshake,
		      data: tls.createFinished(c)
		    }));

		    // expect a server ChangeCipherSpec message next
		    c.expect = SCC;

		    // send records
		    tls.flush(c);

		    // continue
		    c.process();
		  };

		  // if there is no certificate request or no client certificate, do
		  // callback immediately
		  if(c.session.certificateRequest === null ||
		    c.session.clientCertificate === null) {
		    return callback(c, null);
		  }

		  // otherwise get the client signature
		  tls.getClientSignature(c, callback);
		};

		/**
		 * Called when a ChangeCipherSpec record is received.
		 *
		 * @param c the connection.
		 * @param record the record.
		 */
		tls.handleChangeCipherSpec = function(c, record) {
		  if(record.fragment.getByte() !== 0x01) {
		    return c.error(c, {
		      message: 'Invalid ChangeCipherSpec message received.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.illegal_parameter
		      }
		    });
		  }

		  // create pending state if:
		  // 1. Resuming session in client mode OR
		  // 2. NOT resuming session in server mode
		  var client = (c.entity === tls.ConnectionEnd.client);
		  if((c.session.resuming && client) || (!c.session.resuming && !client)) {
		    c.state.pending = tls.createConnectionState(c);
		  }

		  // change current read state to pending read state
		  c.state.current.read = c.state.pending.read;

		  // clear pending state if:
		  // 1. NOT resuming session in client mode OR
		  // 2. resuming a session in server mode
		  if((!c.session.resuming && client) || (c.session.resuming && !client)) {
		    c.state.pending = null;
		  }

		  // expect a Finished record next
		  c.expect = client ? SFI : CFI;

		  // continue
		  c.process();
		};

		/**
		 * Called when a Finished record is received.
		 *
		 * When this message will be sent:
		 *   A finished message is always sent immediately after a change
		 *   cipher spec message to verify that the key exchange and
		 *   authentication processes were successful. It is essential that a
		 *   change cipher spec message be received between the other
		 *   handshake messages and the Finished message.
		 *
		 * Meaning of this message:
		 *   The finished message is the first protected with the just-
		 *   negotiated algorithms, keys, and secrets. Recipients of finished
		 *   messages must verify that the contents are correct.  Once a side
		 *   has sent its Finished message and received and validated the
		 *   Finished message from its peer, it may begin to send and receive
		 *   application data over the connection.
		 *
		 * struct {
		 *   opaque verify_data[verify_data_length];
		 * } Finished;
		 *
		 * verify_data
		 *   PRF(master_secret, finished_label, Hash(handshake_messages))
		 *     [0..verify_data_length-1];
		 *
		 * finished_label
		 *   For Finished messages sent by the client, the string
		 *   "client finished". For Finished messages sent by the server, the
		 *   string "server finished".
		 *
		 * verify_data_length depends on the cipher suite. If it is not specified
		 * by the cipher suite, then it is 12. Versions of TLS < 1.2 always used
		 * 12 bytes.
		 *
		 * @param c the connection.
		 * @param record the record.
		 * @param length the length of the handshake message.
		 */
		tls.handleFinished = function(c, record, length) {
		  // rewind to get full bytes for message so it can be manually
		  // digested below (special case for Finished messages because they
		  // must be digested *after* handling as opposed to all others)
		  var b = record.fragment;
		  b.read -= 4;
		  var msgBytes = b.bytes();
		  b.read += 4;

		  // message contains only verify_data
		  var vd = record.fragment.getBytes();

		  // ensure verify data is correct
		  b = forge.util.createBuffer();
		  b.putBuffer(c.session.md5.digest());
		  b.putBuffer(c.session.sha1.digest());

		  // set label based on entity type
		  var client = (c.entity === tls.ConnectionEnd.client);
		  var label = client ? 'server finished' : 'client finished';

		  // TODO: determine prf function and verify length for TLS 1.2
		  var sp = c.session.sp;
		  var vdl = 12;
		  var prf = prf_TLS1;
		  b = prf(sp.master_secret, label, b.getBytes(), vdl);
		  if(b.getBytes() !== vd) {
		    return c.error(c, {
		      message: 'Invalid verify_data in Finished message.',
		      send: true,
		      alert: {
		        level: tls.Alert.Level.fatal,
		        description: tls.Alert.Description.decrypt_error
		      }
		    });
		  }

		  // digest finished message now that it has been handled
		  c.session.md5.update(msgBytes);
		  c.session.sha1.update(msgBytes);

		  // resuming session as client or NOT resuming session as server
		  if((c.session.resuming && client) || (!c.session.resuming && !client)) {
		    // create change cipher spec message
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.change_cipher_spec,
		      data: tls.createChangeCipherSpec()
		    }));

		    // change current write state to pending write state, clear pending
		    c.state.current.write = c.state.pending.write;
		    c.state.pending = null;

		    // create finished message
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.handshake,
		      data: tls.createFinished(c)
		    }));
		  }

		  // expect application data next
		  c.expect = client ? SAD : CAD;

		  // handshake complete
		  c.handshaking = false;
		  ++c.handshakes;

		  // save access to peer certificate
		  c.peerCertificate = client ?
		    c.session.serverCertificate : c.session.clientCertificate;

		  // send records
		  tls.flush(c);

		  // now connected
		  c.isConnected = true;
		  c.connected(c);

		  // continue
		  c.process();
		};

		/**
		 * Called when an Alert record is received.
		 *
		 * @param c the connection.
		 * @param record the record.
		 */
		tls.handleAlert = function(c, record) {
		  // read alert
		  var b = record.fragment;
		  var alert = {
		    level: b.getByte(),
		    description: b.getByte()
		  };

		  // TODO: consider using a table?
		  // get appropriate message
		  var msg;
		  switch(alert.description) {
		  case tls.Alert.Description.close_notify:
		    msg = 'Connection closed.';
		    break;
		  case tls.Alert.Description.unexpected_message:
		    msg = 'Unexpected message.';
		    break;
		  case tls.Alert.Description.bad_record_mac:
		    msg = 'Bad record MAC.';
		    break;
		  case tls.Alert.Description.decryption_failed:
		    msg = 'Decryption failed.';
		    break;
		  case tls.Alert.Description.record_overflow:
		    msg = 'Record overflow.';
		    break;
		  case tls.Alert.Description.decompression_failure:
		    msg = 'Decompression failed.';
		    break;
		  case tls.Alert.Description.handshake_failure:
		    msg = 'Handshake failure.';
		    break;
		  case tls.Alert.Description.bad_certificate:
		    msg = 'Bad certificate.';
		    break;
		  case tls.Alert.Description.unsupported_certificate:
		    msg = 'Unsupported certificate.';
		    break;
		  case tls.Alert.Description.certificate_revoked:
		    msg = 'Certificate revoked.';
		    break;
		  case tls.Alert.Description.certificate_expired:
		    msg = 'Certificate expired.';
		    break;
		  case tls.Alert.Description.certificate_unknown:
		    msg = 'Certificate unknown.';
		    break;
		  case tls.Alert.Description.illegal_parameter:
		    msg = 'Illegal parameter.';
		    break;
		  case tls.Alert.Description.unknown_ca:
		    msg = 'Unknown certificate authority.';
		    break;
		  case tls.Alert.Description.access_denied:
		    msg = 'Access denied.';
		    break;
		  case tls.Alert.Description.decode_error:
		    msg = 'Decode error.';
		    break;
		  case tls.Alert.Description.decrypt_error:
		    msg = 'Decrypt error.';
		    break;
		  case tls.Alert.Description.export_restriction:
		    msg = 'Export restriction.';
		    break;
		  case tls.Alert.Description.protocol_version:
		    msg = 'Unsupported protocol version.';
		    break;
		  case tls.Alert.Description.insufficient_security:
		    msg = 'Insufficient security.';
		    break;
		  case tls.Alert.Description.internal_error:
		    msg = 'Internal error.';
		    break;
		  case tls.Alert.Description.user_canceled:
		    msg = 'User canceled.';
		    break;
		  case tls.Alert.Description.no_renegotiation:
		    msg = 'Renegotiation not supported.';
		    break;
		  default:
		    msg = 'Unknown error.';
		    break;
		  }

		  // close connection on close_notify, not an error
		  if(alert.description === tls.Alert.Description.close_notify) {
		    return c.close();
		  }

		  // call error handler
		  c.error(c, {
		    message: msg,
		    send: false,
		    // origin is the opposite end
		    origin: (c.entity === tls.ConnectionEnd.client) ? 'server' : 'client',
		    alert: alert
		  });

		  // continue
		  c.process();
		};

		/**
		 * Called when a Handshake record is received.
		 *
		 * @param c the connection.
		 * @param record the record.
		 */
		tls.handleHandshake = function(c, record) {
		  // get the handshake type and message length
		  var b = record.fragment;
		  var type = b.getByte();
		  var length = b.getInt24();

		  // see if the record fragment doesn't yet contain the full message
		  if(length > b.length()) {
		    // cache the record, clear its fragment, and reset the buffer read
		    // pointer before the type and length were read
		    c.fragmented = record;
		    record.fragment = forge.util.createBuffer();
		    b.read -= 4;

		    // continue
		    return c.process();
		  }

		  // full message now available, clear cache, reset read pointer to
		  // before type and length
		  c.fragmented = null;
		  b.read -= 4;

		  // save the handshake bytes for digestion after handler is found
		  // (include type and length of handshake msg)
		  var bytes = b.bytes(length + 4);

		  // restore read pointer
		  b.read += 4;

		  // handle expected message
		  if(type in hsTable[c.entity][c.expect]) {
		    // initialize server session
		    if(c.entity === tls.ConnectionEnd.server && !c.open && !c.fail) {
		      c.handshaking = true;
		      c.session = {
		        version: null,
		        extensions: {
		          server_name: {
		            serverNameList: []
		          }
		        },
		        cipherSuite: null,
		        compressionMethod: null,
		        serverCertificate: null,
		        clientCertificate: null,
		        md5: forge.md.md5.create(),
		        sha1: forge.md.sha1.create()
		      };
		    }

		    /* Update handshake messages digest. Finished and CertificateVerify
		      messages are not digested here. They can't be digested as part of
		      the verify_data that they contain. These messages are manually
		      digested in their handlers. HelloRequest messages are simply never
		      included in the handshake message digest according to spec. */
		    if(type !== tls.HandshakeType.hello_request &&
		      type !== tls.HandshakeType.certificate_verify &&
		      type !== tls.HandshakeType.finished) {
		      c.session.md5.update(bytes);
		      c.session.sha1.update(bytes);
		    }

		    // handle specific handshake type record
		    hsTable[c.entity][c.expect][type](c, record, length);
		  } else {
		    // unexpected record
		    tls.handleUnexpected(c, record);
		  }
		};

		/**
		 * Called when an ApplicationData record is received.
		 *
		 * @param c the connection.
		 * @param record the record.
		 */
		tls.handleApplicationData = function(c, record) {
		  // buffer data, notify that its ready
		  c.data.putBuffer(record.fragment);
		  c.dataReady(c);

		  // continue
		  c.process();
		};

		/**
		 * Called when a Heartbeat record is received.
		 *
		 * @param c the connection.
		 * @param record the record.
		 */
		tls.handleHeartbeat = function(c, record) {
		  // get the heartbeat type and payload
		  var b = record.fragment;
		  var type = b.getByte();
		  var length = b.getInt16();
		  var payload = b.getBytes(length);

		  if(type === tls.HeartbeatMessageType.heartbeat_request) {
		    // discard request during handshake or if length is too large
		    if(c.handshaking || length > payload.length) {
		      // continue
		      return c.process();
		    }
		    // retransmit payload
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.heartbeat,
		      data: tls.createHeartbeat(
		        tls.HeartbeatMessageType.heartbeat_response, payload)
		    }));
		    tls.flush(c);
		  } else if(type === tls.HeartbeatMessageType.heartbeat_response) {
		    // check payload against expected payload, discard heartbeat if no match
		    if(payload !== c.expectedHeartbeatPayload) {
		      // continue
		      return c.process();
		    }

		    // notify that a valid heartbeat was received
		    if(c.heartbeatReceived) {
		      c.heartbeatReceived(c, forge.util.createBuffer(payload));
		    }
		  }

		  // continue
		  c.process();
		};

		/**
		 * The transistional state tables for receiving TLS records. It maps the
		 * current TLS engine state and a received record to a function to handle the
		 * record and update the state.
		 *
		 * For instance, if the current state is SHE, then the TLS engine is expecting
		 * a ServerHello record. Once a record is received, the handler function is
		 * looked up using the state SHE and the record's content type.
		 *
		 * The resulting function will either be an error handler or a record handler.
		 * The function will take whatever action is appropriate and update the state
		 * for the next record.
		 *
		 * The states are all based on possible server record types. Note that the
		 * client will never specifically expect to receive a HelloRequest or an alert
		 * from the server so there is no state that reflects this. These messages may
		 * occur at any time.
		 *
		 * There are two tables for mapping states because there is a second tier of
		 * types for handshake messages. Once a record with a content type of handshake
		 * is received, the handshake record handler will look up the handshake type in
		 * the secondary map to get its appropriate handler.
		 *
		 * Valid message orders are as follows:
		 *
		 * =======================FULL HANDSHAKE======================
		 * Client                                               Server
		 *
		 * ClientHello                  -------->
		 *                                                 ServerHello
		 *                                                Certificate*
		 *                                          ServerKeyExchange*
		 *                                         CertificateRequest*
		 *                              <--------      ServerHelloDone
		 * Certificate*
		 * ClientKeyExchange
		 * CertificateVerify*
		 * [ChangeCipherSpec]
		 * Finished                     -------->
		 *                                          [ChangeCipherSpec]
		 *                              <--------             Finished
		 * Application Data             <------->     Application Data
		 *
		 * =====================SESSION RESUMPTION=====================
		 * Client                                                Server
		 *
		 * ClientHello                   -------->
		 *                                                  ServerHello
		 *                                           [ChangeCipherSpec]
		 *                               <--------             Finished
		 * [ChangeCipherSpec]
		 * Finished                      -------->
		 * Application Data              <------->     Application Data
		 */
		// client expect states (indicate which records are expected to be received)
		var SHE = 0; // rcv server hello
		var SCE = 1; // rcv server certificate
		var SKE = 2; // rcv server key exchange
		var SCR = 3; // rcv certificate request
		var SHD = 4; // rcv server hello done
		var SCC = 5; // rcv change cipher spec
		var SFI = 6; // rcv finished
		var SAD = 7; // rcv application data
		var SER = 8; // not expecting any messages at this point

		// server expect states
		var CHE = 0; // rcv client hello
		var CCE = 1; // rcv client certificate
		var CKE = 2; // rcv client key exchange
		var CCV = 3; // rcv certificate verify
		var CCC = 4; // rcv change cipher spec
		var CFI = 5; // rcv finished
		var CAD = 6; // rcv application data
		var CER = 7; // not expecting any messages at this point

		// map client current expect state and content type to function
		var __ = tls.handleUnexpected;
		var R0 = tls.handleChangeCipherSpec;
		var R1 = tls.handleAlert;
		var R2 = tls.handleHandshake;
		var R3 = tls.handleApplicationData;
		var R4 = tls.handleHeartbeat;
		var ctTable = [];
		ctTable[tls.ConnectionEnd.client] = [
		//      CC,AL,HS,AD,HB
		/*SHE*/[__,R1,R2,__,R4],
		/*SCE*/[__,R1,R2,__,R4],
		/*SKE*/[__,R1,R2,__,R4],
		/*SCR*/[__,R1,R2,__,R4],
		/*SHD*/[__,R1,R2,__,R4],
		/*SCC*/[R0,R1,__,__,R4],
		/*SFI*/[__,R1,R2,__,R4],
		/*SAD*/[__,R1,R2,R3,R4],
		/*SER*/[__,R1,R2,__,R4]
		];

		// map server current expect state and content type to function
		ctTable[tls.ConnectionEnd.server] = [
		//      CC,AL,HS,AD
		/*CHE*/[__,R1,R2,__,R4],
		/*CCE*/[__,R1,R2,__,R4],
		/*CKE*/[__,R1,R2,__,R4],
		/*CCV*/[__,R1,R2,__,R4],
		/*CCC*/[R0,R1,__,__,R4],
		/*CFI*/[__,R1,R2,__,R4],
		/*CAD*/[__,R1,R2,R3,R4],
		/*CER*/[__,R1,R2,__,R4]
		];

		// map client current expect state and handshake type to function
		var H0 = tls.handleHelloRequest;
		var H1 = tls.handleServerHello;
		var H2 = tls.handleCertificate;
		var H3 = tls.handleServerKeyExchange;
		var H4 = tls.handleCertificateRequest;
		var H5 = tls.handleServerHelloDone;
		var H6 = tls.handleFinished;
		var hsTable = [];
		hsTable[tls.ConnectionEnd.client] = [
		//      HR,01,SH,03,04,05,06,07,08,09,10,SC,SK,CR,HD,15,CK,17,18,19,FI
		/*SHE*/[__,__,H1,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],
		/*SCE*/[H0,__,__,__,__,__,__,__,__,__,__,H2,H3,H4,H5,__,__,__,__,__,__],
		/*SKE*/[H0,__,__,__,__,__,__,__,__,__,__,__,H3,H4,H5,__,__,__,__,__,__],
		/*SCR*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,H4,H5,__,__,__,__,__,__],
		/*SHD*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,H5,__,__,__,__,__,__],
		/*SCC*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],
		/*SFI*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H6],
		/*SAD*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],
		/*SER*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__]
		];

		// map server current expect state and handshake type to function
		// Note: CAD[CH] does not map to FB because renegotation is prohibited
		var H7 = tls.handleClientHello;
		var H8 = tls.handleClientKeyExchange;
		var H9 = tls.handleCertificateVerify;
		hsTable[tls.ConnectionEnd.server] = [
		//      01,CH,02,03,04,05,06,07,08,09,10,CC,12,13,14,CV,CK,17,18,19,FI
		/*CHE*/[__,H7,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],
		/*CCE*/[__,__,__,__,__,__,__,__,__,__,__,H2,__,__,__,__,__,__,__,__,__],
		/*CKE*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H8,__,__,__,__],
		/*CCV*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H9,__,__,__,__,__],
		/*CCC*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],
		/*CFI*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H6],
		/*CAD*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],
		/*CER*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__]
		];

		/**
		 * Generates the master_secret and keys using the given security parameters.
		 *
		 * The security parameters for a TLS connection state are defined as such:
		 *
		 * struct {
		 *   ConnectionEnd          entity;
		 *   PRFAlgorithm           prf_algorithm;
		 *   BulkCipherAlgorithm    bulk_cipher_algorithm;
		 *   CipherType             cipher_type;
		 *   uint8                  enc_key_length;
		 *   uint8                  block_length;
		 *   uint8                  fixed_iv_length;
		 *   uint8                  record_iv_length;
		 *   MACAlgorithm           mac_algorithm;
		 *   uint8                  mac_length;
		 *   uint8                  mac_key_length;
		 *   CompressionMethod      compression_algorithm;
		 *   opaque                 master_secret[48];
		 *   opaque                 client_random[32];
		 *   opaque                 server_random[32];
		 * } SecurityParameters;
		 *
		 * Note that this definition is from TLS 1.2. In TLS 1.0 some of these
		 * parameters are ignored because, for instance, the PRFAlgorithm is a
		 * builtin-fixed algorithm combining iterations of MD5 and SHA-1 in TLS 1.0.
		 *
		 * The Record Protocol requires an algorithm to generate keys required by the
		 * current connection state.
		 *
		 * The master secret is expanded into a sequence of secure bytes, which is then
		 * split to a client write MAC key, a server write MAC key, a client write
		 * encryption key, and a server write encryption key. In TLS 1.0 a client write
		 * IV and server write IV are also generated. Each of these is generated from
		 * the byte sequence in that order. Unused values are empty. In TLS 1.2, some
		 * AEAD ciphers may additionally require a client write IV and a server write
		 * IV (see Section 6.2.3.3).
		 *
		 * When keys, MAC keys, and IVs are generated, the master secret is used as an
		 * entropy source.
		 *
		 * To generate the key material, compute:
		 *
		 * master_secret = PRF(pre_master_secret, "master secret",
		 *                     ClientHello.random + ServerHello.random)
		 *
		 * key_block = PRF(SecurityParameters.master_secret,
		 *                 "key expansion",
		 *                 SecurityParameters.server_random +
		 *                 SecurityParameters.client_random);
		 *
		 * until enough output has been generated. Then, the key_block is
		 * partitioned as follows:
		 *
		 * client_write_MAC_key[SecurityParameters.mac_key_length]
		 * server_write_MAC_key[SecurityParameters.mac_key_length]
		 * client_write_key[SecurityParameters.enc_key_length]
		 * server_write_key[SecurityParameters.enc_key_length]
		 * client_write_IV[SecurityParameters.fixed_iv_length]
		 * server_write_IV[SecurityParameters.fixed_iv_length]
		 *
		 * In TLS 1.2, the client_write_IV and server_write_IV are only generated for
		 * implicit nonce techniques as described in Section 3.2.1 of [AEAD]. This
		 * implementation uses TLS 1.0 so IVs are generated.
		 *
		 * Implementation note: The currently defined cipher suite which requires the
		 * most material is AES_256_CBC_SHA256. It requires 2 x 32 byte keys and 2 x 32
		 * byte MAC keys, for a total 128 bytes of key material. In TLS 1.0 it also
		 * requires 2 x 16 byte IVs, so it actually takes 160 bytes of key material.
		 *
		 * @param c the connection.
		 * @param sp the security parameters to use.
		 *
		 * @return the security keys.
		 */
		tls.generateKeys = function(c, sp) {
		  // TLS_RSA_WITH_AES_128_CBC_SHA (required to be compliant with TLS 1.2) &
		  // TLS_RSA_WITH_AES_256_CBC_SHA are the only cipher suites implemented
		  // at present

		  // TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA is required to be compliant with
		  // TLS 1.0 but we don't care right now because AES is better and we have
		  // an implementation for it

		  // TODO: TLS 1.2 implementation
		  /*
		  // determine the PRF
		  var prf;
		  switch(sp.prf_algorithm) {
		  case tls.PRFAlgorithm.tls_prf_sha256:
		    prf = prf_sha256;
		    break;
		  default:
		    // should never happen
		    throw new Error('Invalid PRF');
		  }
		  */

		  // TLS 1.0/1.1 implementation
		  var prf = prf_TLS1;

		  // concatenate server and client random
		  var random = sp.client_random + sp.server_random;

		  // only create master secret if session is new
		  if(!c.session.resuming) {
		    // create master secret, clean up pre-master secret
		    sp.master_secret = prf(
		      sp.pre_master_secret, 'master secret', random, 48).bytes();
		    sp.pre_master_secret = null;
		  }

		  // generate the amount of key material needed
		  random = sp.server_random + sp.client_random;
		  var length = 2 * sp.mac_key_length + 2 * sp.enc_key_length;

		  // include IV for TLS/1.0
		  var tls10 = (c.version.major === tls.Versions.TLS_1_0.major &&
		    c.version.minor === tls.Versions.TLS_1_0.minor);
		  if(tls10) {
		    length += 2 * sp.fixed_iv_length;
		  }
		  var km = prf(sp.master_secret, 'key expansion', random, length);

		  // split the key material into the MAC and encryption keys
		  var rval = {
		    client_write_MAC_key: km.getBytes(sp.mac_key_length),
		    server_write_MAC_key: km.getBytes(sp.mac_key_length),
		    client_write_key: km.getBytes(sp.enc_key_length),
		    server_write_key: km.getBytes(sp.enc_key_length)
		  };

		  // include TLS 1.0 IVs
		  if(tls10) {
		    rval.client_write_IV = km.getBytes(sp.fixed_iv_length);
		    rval.server_write_IV = km.getBytes(sp.fixed_iv_length);
		  }

		  return rval;
		};

		/**
		 * Creates a new initialized TLS connection state. A connection state has
		 * a read mode and a write mode.
		 *
		 * compression state:
		 *   The current state of the compression algorithm.
		 *
		 * cipher state:
		 *   The current state of the encryption algorithm. This will consist of the
		 *   scheduled key for that connection. For stream ciphers, this will also
		 *   contain whatever state information is necessary to allow the stream to
		 *   continue to encrypt or decrypt data.
		 *
		 * MAC key:
		 *   The MAC key for the connection.
		 *
		 * sequence number:
		 *   Each connection state contains a sequence number, which is maintained
		 *   separately for read and write states. The sequence number MUST be set to
		 *   zero whenever a connection state is made the active state. Sequence
		 *   numbers are of type uint64 and may not exceed 2^64-1. Sequence numbers do
		 *   not wrap. If a TLS implementation would need to wrap a sequence number,
		 *   it must renegotiate instead. A sequence number is incremented after each
		 *   record: specifically, the first record transmitted under a particular
		 *   connection state MUST use sequence number 0.
		 *
		 * @param c the connection.
		 *
		 * @return the new initialized TLS connection state.
		 */
		tls.createConnectionState = function(c) {
		  var client = (c.entity === tls.ConnectionEnd.client);

		  var createMode = function() {
		    var mode = {
		      // two 32-bit numbers, first is most significant
		      sequenceNumber: [0, 0],
		      macKey: null,
		      macLength: 0,
		      macFunction: null,
		      cipherState: null,
		      cipherFunction: function(record) {return true;},
		      compressionState: null,
		      compressFunction: function(record) {return true;},
		      updateSequenceNumber: function() {
		        if(mode.sequenceNumber[1] === 0xFFFFFFFF) {
		          mode.sequenceNumber[1] = 0;
		          ++mode.sequenceNumber[0];
		        } else {
		          ++mode.sequenceNumber[1];
		        }
		      }
		    };
		    return mode;
		  };
		  var state = {
		    read: createMode(),
		    write: createMode()
		  };

		  // update function in read mode will decrypt then decompress a record
		  state.read.update = function(c, record) {
		    if(!state.read.cipherFunction(record, state.read)) {
		      c.error(c, {
		        message: 'Could not decrypt record or bad MAC.',
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          // doesn't matter if decryption failed or MAC was
		          // invalid, return the same error so as not to reveal
		          // which one occurred
		          description: tls.Alert.Description.bad_record_mac
		        }
		      });
		    } else if(!state.read.compressFunction(c, record, state.read)) {
		      c.error(c, {
		        message: 'Could not decompress record.',
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.decompression_failure
		        }
		      });
		    }
		    return !c.fail;
		  };

		  // update function in write mode will compress then encrypt a record
		  state.write.update = function(c, record) {
		    if(!state.write.compressFunction(c, record, state.write)) {
		      // error, but do not send alert since it would require
		      // compression as well
		      c.error(c, {
		        message: 'Could not compress record.',
		        send: false,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.internal_error
		        }
		      });
		    } else if(!state.write.cipherFunction(record, state.write)) {
		      // error, but do not send alert since it would require
		      // encryption as well
		      c.error(c, {
		        message: 'Could not encrypt record.',
		        send: false,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.internal_error
		        }
		      });
		    }
		    return !c.fail;
		  };

		  // handle security parameters
		  if(c.session) {
		    var sp = c.session.sp;
		    c.session.cipherSuite.initSecurityParameters(sp);

		    // generate keys
		    sp.keys = tls.generateKeys(c, sp);
		    state.read.macKey = client ?
		      sp.keys.server_write_MAC_key : sp.keys.client_write_MAC_key;
		    state.write.macKey = client ?
		      sp.keys.client_write_MAC_key : sp.keys.server_write_MAC_key;

		    // cipher suite setup
		    c.session.cipherSuite.initConnectionState(state, c, sp);

		    // compression setup
		    switch(sp.compression_algorithm) {
		    case tls.CompressionMethod.none:
		      break;
		    case tls.CompressionMethod.deflate:
		      state.read.compressFunction = inflate;
		      state.write.compressFunction = deflate;
		      break;
		    default:
		      throw new Error('Unsupported compression algorithm.');
		    }
		  }

		  return state;
		};

		/**
		 * Creates a Random structure.
		 *
		 * struct {
		 *   uint32 gmt_unix_time;
		 *   opaque random_bytes[28];
		 * } Random;
		 *
		 * gmt_unix_time:
		 *   The current time and date in standard UNIX 32-bit format (seconds since
		 *   the midnight starting Jan 1, 1970, UTC, ignoring leap seconds) according
		 *   to the sender's internal clock. Clocks are not required to be set
		 *   correctly by the basic TLS protocol; higher-level or application
		 *   protocols may define additional requirements. Note that, for historical
		 *   reasons, the data element is named using GMT, the predecessor of the
		 *   current worldwide time base, UTC.
		 * random_bytes:
		 *   28 bytes generated by a secure random number generator.
		 *
		 * @return the Random structure as a byte array.
		 */
		tls.createRandom = function() {
		  // get UTC milliseconds
		  var d = new Date();
		  var utc = +d + d.getTimezoneOffset() * 60000;
		  var rval = forge.util.createBuffer();
		  rval.putInt32(utc);
		  rval.putBytes(forge.random.getBytes(28));
		  return rval;
		};

		/**
		 * Creates a TLS record with the given type and data.
		 *
		 * @param c the connection.
		 * @param options:
		 *   type: the record type.
		 *   data: the plain text data in a byte buffer.
		 *
		 * @return the created record.
		 */
		tls.createRecord = function(c, options) {
		  if(!options.data) {
		    return null;
		  }
		  var record = {
		    type: options.type,
		    version: {
		      major: c.version.major,
		      minor: c.version.minor
		    },
		    length: options.data.length(),
		    fragment: options.data
		  };
		  return record;
		};

		/**
		 * Creates a TLS alert record.
		 *
		 * @param c the connection.
		 * @param alert:
		 *   level: the TLS alert level.
		 *   description: the TLS alert description.
		 *
		 * @return the created alert record.
		 */
		tls.createAlert = function(c, alert) {
		  var b = forge.util.createBuffer();
		  b.putByte(alert.level);
		  b.putByte(alert.description);
		  return tls.createRecord(c, {
		    type: tls.ContentType.alert,
		    data: b
		  });
		};

		/* The structure of a TLS handshake message.
		 *
		 * struct {
		 *    HandshakeType msg_type;    // handshake type
		 *    uint24 length;             // bytes in message
		 *    select(HandshakeType) {
		 *       case hello_request:       HelloRequest;
		 *       case client_hello:        ClientHello;
		 *       case server_hello:        ServerHello;
		 *       case certificate:         Certificate;
		 *       case server_key_exchange: ServerKeyExchange;
		 *       case certificate_request: CertificateRequest;
		 *       case server_hello_done:   ServerHelloDone;
		 *       case certificate_verify:  CertificateVerify;
		 *       case client_key_exchange: ClientKeyExchange;
		 *       case finished:            Finished;
		 *    } body;
		 * } Handshake;
		 */

		/**
		 * Creates a ClientHello message.
		 *
		 * opaque SessionID<0..32>;
		 * enum { null(0), deflate(1), (255) } CompressionMethod;
		 * uint8 CipherSuite[2];
		 *
		 * struct {
		 *   ProtocolVersion client_version;
		 *   Random random;
		 *   SessionID session_id;
		 *   CipherSuite cipher_suites<2..2^16-2>;
		 *   CompressionMethod compression_methods<1..2^8-1>;
		 *   select(extensions_present) {
		 *     case false:
		 *       struct {};
		 *     case true:
		 *       Extension extensions<0..2^16-1>;
		 *   };
		 * } ClientHello;
		 *
		 * The extension format for extended client hellos and server hellos is:
		 *
		 * struct {
		 *   ExtensionType extension_type;
		 *   opaque extension_data<0..2^16-1>;
		 * } Extension;
		 *
		 * Here:
		 *
		 * - "extension_type" identifies the particular extension type.
		 * - "extension_data" contains information specific to the particular
		 * extension type.
		 *
		 * The extension types defined in this document are:
		 *
		 * enum {
		 *   server_name(0), max_fragment_length(1),
		 *   client_certificate_url(2), trusted_ca_keys(3),
		 *   truncated_hmac(4), status_request(5), (65535)
		 * } ExtensionType;
		 *
		 * @param c the connection.
		 *
		 * @return the ClientHello byte buffer.
		 */
		tls.createClientHello = function(c) {
		  // save hello version
		  c.session.clientHelloVersion = {
		    major: c.version.major,
		    minor: c.version.minor
		  };

		  // create supported cipher suites
		  var cipherSuites = forge.util.createBuffer();
		  for(var i = 0; i < c.cipherSuites.length; ++i) {
		    var cs = c.cipherSuites[i];
		    cipherSuites.putByte(cs.id[0]);
		    cipherSuites.putByte(cs.id[1]);
		  }
		  var cSuites = cipherSuites.length();

		  // create supported compression methods, null always supported, but
		  // also support deflate if connection has inflate and deflate methods
		  var compressionMethods = forge.util.createBuffer();
		  compressionMethods.putByte(tls.CompressionMethod.none);
		  // FIXME: deflate support disabled until issues with raw deflate data
		  // without zlib headers are resolved
		  /*
		  if(c.inflate !== null && c.deflate !== null) {
		    compressionMethods.putByte(tls.CompressionMethod.deflate);
		  }
		  */
		  var cMethods = compressionMethods.length();

		  // create TLS SNI (server name indication) extension if virtual host
		  // has been specified, see RFC 3546
		  var extensions = forge.util.createBuffer();
		  if(c.virtualHost) {
		    // create extension struct
		    var ext = forge.util.createBuffer();
		    ext.putByte(0x00); // type server_name (ExtensionType is 2 bytes)
		    ext.putByte(0x00);

		    /* In order to provide the server name, clients MAY include an
		     * extension of type "server_name" in the (extended) client hello.
		     * The "extension_data" field of this extension SHALL contain
		     * "ServerNameList" where:
		     *
		     * struct {
		     *   NameType name_type;
		     *   select(name_type) {
		     *     case host_name: HostName;
		     *   } name;
		     * } ServerName;
		     *
		     * enum {
		     *   host_name(0), (255)
		     * } NameType;
		     *
		     * opaque HostName<1..2^16-1>;
		     *
		     * struct {
		     *   ServerName server_name_list<1..2^16-1>
		     * } ServerNameList;
		     */
		    var serverName = forge.util.createBuffer();
		    serverName.putByte(0x00); // type host_name
		    writeVector(serverName, 2, forge.util.createBuffer(c.virtualHost));

		    // ServerNameList is in extension_data
		    var snList = forge.util.createBuffer();
		    writeVector(snList, 2, serverName);
		    writeVector(ext, 2, snList);
		    extensions.putBuffer(ext);
		  }
		  var extLength = extensions.length();
		  if(extLength > 0) {
		    // add extension vector length
		    extLength += 2;
		  }

		  // determine length of the handshake message
		  // cipher suites and compression methods size will need to be
		  // updated if more get added to the list
		  var sessionId = c.session.id;
		  var length =
		    sessionId.length + 1 + // session ID vector
		    2 +                    // version (major + minor)
		    4 + 28 +               // random time and random bytes
		    2 + cSuites +          // cipher suites vector
		    1 + cMethods +         // compression methods vector
		    extLength;             // extensions vector

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.client_hello);
		  rval.putInt24(length);                     // handshake length
		  rval.putByte(c.version.major);             // major version
		  rval.putByte(c.version.minor);             // minor version
		  rval.putBytes(c.session.sp.client_random); // random time + bytes
		  writeVector(rval, 1, forge.util.createBuffer(sessionId));
		  writeVector(rval, 2, cipherSuites);
		  writeVector(rval, 1, compressionMethods);
		  if(extLength > 0) {
		    writeVector(rval, 2, extensions);
		  }
		  return rval;
		};

		/**
		 * Creates a ServerHello message.
		 *
		 * @param c the connection.
		 *
		 * @return the ServerHello byte buffer.
		 */
		tls.createServerHello = function(c) {
		  // determine length of the handshake message
		  var sessionId = c.session.id;
		  var length =
		    sessionId.length + 1 + // session ID vector
		    2 +                    // version (major + minor)
		    4 + 28 +               // random time and random bytes
		    2 +                    // chosen cipher suite
		    1;                     // chosen compression method

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.server_hello);
		  rval.putInt24(length);                     // handshake length
		  rval.putByte(c.version.major);             // major version
		  rval.putByte(c.version.minor);             // minor version
		  rval.putBytes(c.session.sp.server_random); // random time + bytes
		  writeVector(rval, 1, forge.util.createBuffer(sessionId));
		  rval.putByte(c.session.cipherSuite.id[0]);
		  rval.putByte(c.session.cipherSuite.id[1]);
		  rval.putByte(c.session.compressionMethod);
		  return rval;
		};

		/**
		 * Creates a Certificate message.
		 *
		 * When this message will be sent:
		 *   This is the first message the client can send after receiving a server
		 *   hello done message and the first message the server can send after
		 *   sending a ServerHello. This client message is only sent if the server
		 *   requests a certificate. If no suitable certificate is available, the
		 *   client should send a certificate message containing no certificates. If
		 *   client authentication is required by the server for the handshake to
		 *   continue, it may respond with a fatal handshake failure alert.
		 *
		 * opaque ASN.1Cert<1..2^24-1>;
		 *
		 * struct {
		 *   ASN.1Cert certificate_list<0..2^24-1>;
		 * } Certificate;
		 *
		 * @param c the connection.
		 *
		 * @return the Certificate byte buffer.
		 */
		tls.createCertificate = function(c) {
		  // TODO: check certificate request to ensure types are supported

		  // get a certificate (a certificate as a PEM string)
		  var client = (c.entity === tls.ConnectionEnd.client);
		  var cert = null;
		  if(c.getCertificate) {
		    var hint;
		    if(client) {
		      hint = c.session.certificateRequest;
		    } else {
		      hint = c.session.extensions.server_name.serverNameList;
		    }
		    cert = c.getCertificate(c, hint);
		  }

		  // buffer to hold certificate list
		  var certList = forge.util.createBuffer();
		  if(cert !== null) {
		    try {
		      // normalize cert to a chain of certificates
		      if(!forge.util.isArray(cert)) {
		        cert = [cert];
		      }
		      var asn1 = null;
		      for(var i = 0; i < cert.length; ++i) {
		        var msg = forge.pem.decode(cert[i])[0];
		        if(msg.type !== 'CERTIFICATE' &&
		          msg.type !== 'X509 CERTIFICATE' &&
		          msg.type !== 'TRUSTED CERTIFICATE') {
		          var error = new Error('Could not convert certificate from PEM; PEM ' +
		            'header type is not "CERTIFICATE", "X509 CERTIFICATE", or ' +
		            '"TRUSTED CERTIFICATE".');
		          error.headerType = msg.type;
		          throw error;
		        }
		        if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		          throw new Error('Could not convert certificate from PEM; PEM is encrypted.');
		        }

		        var der = forge.util.createBuffer(msg.body);
		        if(asn1 === null) {
		          asn1 = forge.asn1.fromDer(der.bytes(), false);
		        }

		        // certificate entry is itself a vector with 3 length bytes
		        var certBuffer = forge.util.createBuffer();
		        writeVector(certBuffer, 3, der);

		        // add cert vector to cert list vector
		        certList.putBuffer(certBuffer);
		      }

		      // save certificate
		      cert = forge.pki.certificateFromAsn1(asn1);
		      if(client) {
		        c.session.clientCertificate = cert;
		      } else {
		        c.session.serverCertificate = cert;
		      }
		    } catch(ex) {
		      return c.error(c, {
		        message: 'Could not send certificate list.',
		        cause: ex,
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.bad_certificate
		        }
		      });
		    }
		  }

		  // determine length of the handshake message
		  var length = 3 + certList.length(); // cert list vector

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.certificate);
		  rval.putInt24(length);
		  writeVector(rval, 3, certList);
		  return rval;
		};

		/**
		 * Creates a ClientKeyExchange message.
		 *
		 * When this message will be sent:
		 *   This message is always sent by the client. It will immediately follow the
		 *   client certificate message, if it is sent. Otherwise it will be the first
		 *   message sent by the client after it receives the server hello done
		 *   message.
		 *
		 * Meaning of this message:
		 *   With this message, the premaster secret is set, either though direct
		 *   transmission of the RSA-encrypted secret, or by the transmission of
		 *   Diffie-Hellman parameters which will allow each side to agree upon the
		 *   same premaster secret. When the key exchange method is DH_RSA or DH_DSS,
		 *   client certification has been requested, and the client was able to
		 *   respond with a certificate which contained a Diffie-Hellman public key
		 *   whose parameters (group and generator) matched those specified by the
		 *   server in its certificate, this message will not contain any data.
		 *
		 * Meaning of this message:
		 *   If RSA is being used for key agreement and authentication, the client
		 *   generates a 48-byte premaster secret, encrypts it using the public key
		 *   from the server's certificate or the temporary RSA key provided in a
		 *   server key exchange message, and sends the result in an encrypted
		 *   premaster secret message. This structure is a variant of the client
		 *   key exchange message, not a message in itself.
		 *
		 * struct {
		 *   select(KeyExchangeAlgorithm) {
		 *     case rsa: EncryptedPreMasterSecret;
		 *     case diffie_hellman: ClientDiffieHellmanPublic;
		 *   } exchange_keys;
		 * } ClientKeyExchange;
		 *
		 * struct {
		 *   ProtocolVersion client_version;
		 *   opaque random[46];
		 * } PreMasterSecret;
		 *
		 * struct {
		 *   public-key-encrypted PreMasterSecret pre_master_secret;
		 * } EncryptedPreMasterSecret;
		 *
		 * A public-key-encrypted element is encoded as a vector <0..2^16-1>.
		 *
		 * @param c the connection.
		 *
		 * @return the ClientKeyExchange byte buffer.
		 */
		tls.createClientKeyExchange = function(c) {
		  // create buffer to encrypt
		  var b = forge.util.createBuffer();

		  // add highest client-supported protocol to help server avoid version
		  // rollback attacks
		  b.putByte(c.session.clientHelloVersion.major);
		  b.putByte(c.session.clientHelloVersion.minor);

		  // generate and add 46 random bytes
		  b.putBytes(forge.random.getBytes(46));

		  // save pre-master secret
		  var sp = c.session.sp;
		  sp.pre_master_secret = b.getBytes();

		  // RSA-encrypt the pre-master secret
		  var key = c.session.serverCertificate.publicKey;
		  b = key.encrypt(sp.pre_master_secret);

		  /* Note: The encrypted pre-master secret will be stored in a
		    public-key-encrypted opaque vector that has the length prefixed using
		    2 bytes, so include those 2 bytes in the handshake message length. This
		    is done as a minor optimization instead of calling writeVector(). */

		  // determine length of the handshake message
		  var length = b.length + 2;

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.client_key_exchange);
		  rval.putInt24(length);
		  // add vector length bytes
		  rval.putInt16(b.length);
		  rval.putBytes(b);
		  return rval;
		};

		/**
		 * Creates a ServerKeyExchange message.
		 *
		 * @param c the connection.
		 *
		 * @return the ServerKeyExchange byte buffer.
		 */
		tls.createServerKeyExchange = function(c) {
		  // this implementation only supports RSA, no Diffie-Hellman support,
		  // so this record is empty

		  // determine length of the handshake message
		  var length = 0;

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  if(length > 0) {
		    rval.putByte(tls.HandshakeType.server_key_exchange);
		    rval.putInt24(length);
		  }
		  return rval;
		};

		/**
		 * Gets the signed data used to verify a client-side certificate. See
		 * tls.createCertificateVerify() for details.
		 *
		 * @param c the connection.
		 * @param callback the callback to call once the signed data is ready.
		 */
		tls.getClientSignature = function(c, callback) {
		  // generate data to RSA encrypt
		  var b = forge.util.createBuffer();
		  b.putBuffer(c.session.md5.digest());
		  b.putBuffer(c.session.sha1.digest());
		  b = b.getBytes();

		  // create default signing function as necessary
		  c.getSignature = c.getSignature || function(c, b, callback) {
		    // do rsa encryption, call callback
		    var privateKey = null;
		    if(c.getPrivateKey) {
		      try {
		        privateKey = c.getPrivateKey(c, c.session.clientCertificate);
		        privateKey = forge.pki.privateKeyFromPem(privateKey);
		      } catch(ex) {
		        c.error(c, {
		          message: 'Could not get private key.',
		          cause: ex,
		          send: true,
		          alert: {
		            level: tls.Alert.Level.fatal,
		            description: tls.Alert.Description.internal_error
		          }
		        });
		      }
		    }
		    if(privateKey === null) {
		      c.error(c, {
		        message: 'No private key set.',
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: tls.Alert.Description.internal_error
		        }
		      });
		    } else {
		      b = privateKey.sign(b, null);
		    }
		    callback(c, b);
		  };

		  // get client signature
		  c.getSignature(c, b, callback);
		};

		/**
		 * Creates a CertificateVerify message.
		 *
		 * Meaning of this message:
		 *   This structure conveys the client's Diffie-Hellman public value
		 *   (Yc) if it was not already included in the client's certificate.
		 *   The encoding used for Yc is determined by the enumerated
		 *   PublicValueEncoding. This structure is a variant of the client
		 *   key exchange message, not a message in itself.
		 *
		 * When this message will be sent:
		 *   This message is used to provide explicit verification of a client
		 *   certificate. This message is only sent following a client
		 *   certificate that has signing capability (i.e. all certificates
		 *   except those containing fixed Diffie-Hellman parameters). When
		 *   sent, it will immediately follow the client key exchange message.
		 *
		 * struct {
		 *   Signature signature;
		 * } CertificateVerify;
		 *
		 * CertificateVerify.signature.md5_hash
		 *   MD5(handshake_messages);
		 *
		 * Certificate.signature.sha_hash
		 *   SHA(handshake_messages);
		 *
		 * Here handshake_messages refers to all handshake messages sent or
		 * received starting at client hello up to but not including this
		 * message, including the type and length fields of the handshake
		 * messages.
		 *
		 * select(SignatureAlgorithm) {
		 *   case anonymous: struct { };
		 *   case rsa:
		 *     digitally-signed struct {
		 *       opaque md5_hash[16];
		 *       opaque sha_hash[20];
		 *     };
		 *   case dsa:
		 *     digitally-signed struct {
		 *       opaque sha_hash[20];
		 *     };
		 * } Signature;
		 *
		 * In digital signing, one-way hash functions are used as input for a
		 * signing algorithm. A digitally-signed element is encoded as an opaque
		 * vector <0..2^16-1>, where the length is specified by the signing
		 * algorithm and key.
		 *
		 * In RSA signing, a 36-byte structure of two hashes (one SHA and one
		 * MD5) is signed (encrypted with the private key). It is encoded with
		 * PKCS #1 block type 0 or type 1 as described in [PKCS1].
		 *
		 * In DSS, the 20 bytes of the SHA hash are run directly through the
		 * Digital Signing Algorithm with no additional hashing.
		 *
		 * @param c the connection.
		 * @param signature the signature to include in the message.
		 *
		 * @return the CertificateVerify byte buffer.
		 */
		tls.createCertificateVerify = function(c, signature) {
		  /* Note: The signature will be stored in a "digitally-signed" opaque
		    vector that has the length prefixed using 2 bytes, so include those
		    2 bytes in the handshake message length. This is done as a minor
		    optimization instead of calling writeVector(). */

		  // determine length of the handshake message
		  var length = signature.length + 2;

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.certificate_verify);
		  rval.putInt24(length);
		  // add vector length bytes
		  rval.putInt16(signature.length);
		  rval.putBytes(signature);
		  return rval;
		};

		/**
		 * Creates a CertificateRequest message.
		 *
		 * @param c the connection.
		 *
		 * @return the CertificateRequest byte buffer.
		 */
		tls.createCertificateRequest = function(c) {
		  // TODO: support other certificate types
		  var certTypes = forge.util.createBuffer();

		  // common RSA certificate type
		  certTypes.putByte(0x01);

		  // TODO: verify that this data format is correct
		  // add distinguished names from CA store
		  var cAs = forge.util.createBuffer();
		  for(var key in c.caStore.certs) {
		    var cert = c.caStore.certs[key];
		    var dn = forge.pki.distinguishedNameToAsn1(cert.subject);
		    cAs.putBuffer(forge.asn1.toDer(dn));
		  }

		  // TODO: TLS 1.2+ has a different format

		  // determine length of the handshake message
		  var length =
		    1 + certTypes.length() +
		    2 + cAs.length();

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.certificate_request);
		  rval.putInt24(length);
		  writeVector(rval, 1, certTypes);
		  writeVector(rval, 2, cAs);
		  return rval;
		};

		/**
		 * Creates a ServerHelloDone message.
		 *
		 * @param c the connection.
		 *
		 * @return the ServerHelloDone byte buffer.
		 */
		tls.createServerHelloDone = function(c) {
		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.server_hello_done);
		  rval.putInt24(0);
		  return rval;
		};

		/**
		 * Creates a ChangeCipherSpec message.
		 *
		 * The change cipher spec protocol exists to signal transitions in
		 * ciphering strategies. The protocol consists of a single message,
		 * which is encrypted and compressed under the current (not the pending)
		 * connection state. The message consists of a single byte of value 1.
		 *
		 * struct {
		 *   enum { change_cipher_spec(1), (255) } type;
		 * } ChangeCipherSpec;
		 *
		 * @return the ChangeCipherSpec byte buffer.
		 */
		tls.createChangeCipherSpec = function() {
		  var rval = forge.util.createBuffer();
		  rval.putByte(0x01);
		  return rval;
		};

		/**
		 * Creates a Finished message.
		 *
		 * struct {
		 *   opaque verify_data[12];
		 * } Finished;
		 *
		 * verify_data
		 *   PRF(master_secret, finished_label, MD5(handshake_messages) +
		 *   SHA-1(handshake_messages)) [0..11];
		 *
		 * finished_label
		 *   For Finished messages sent by the client, the string "client
		 *   finished". For Finished messages sent by the server, the
		 *   string "server finished".
		 *
		 * handshake_messages
		 *   All of the data from all handshake messages up to but not
		 *   including this message. This is only data visible at the
		 *   handshake layer and does not include record layer headers.
		 *   This is the concatenation of all the Handshake structures as
		 *   defined in 7.4 exchanged thus far.
		 *
		 * @param c the connection.
		 *
		 * @return the Finished byte buffer.
		 */
		tls.createFinished = function(c) {
		  // generate verify_data
		  var b = forge.util.createBuffer();
		  b.putBuffer(c.session.md5.digest());
		  b.putBuffer(c.session.sha1.digest());

		  // TODO: determine prf function and verify length for TLS 1.2
		  var client = (c.entity === tls.ConnectionEnd.client);
		  var sp = c.session.sp;
		  var vdl = 12;
		  var prf = prf_TLS1;
		  var label = client ? 'client finished' : 'server finished';
		  b = prf(sp.master_secret, label, b.getBytes(), vdl);

		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(tls.HandshakeType.finished);
		  rval.putInt24(b.length());
		  rval.putBuffer(b);
		  return rval;
		};

		/**
		 * Creates a HeartbeatMessage (See RFC 6520).
		 *
		 * struct {
		 *   HeartbeatMessageType type;
		 *   uint16 payload_length;
		 *   opaque payload[HeartbeatMessage.payload_length];
		 *   opaque padding[padding_length];
		 * } HeartbeatMessage;
		 *
		 * The total length of a HeartbeatMessage MUST NOT exceed 2^14 or
		 * max_fragment_length when negotiated as defined in [RFC6066].
		 *
		 * type: The message type, either heartbeat_request or heartbeat_response.
		 *
		 * payload_length: The length of the payload.
		 *
		 * payload: The payload consists of arbitrary content.
		 *
		 * padding: The padding is random content that MUST be ignored by the
		 *   receiver. The length of a HeartbeatMessage is TLSPlaintext.length
		 *   for TLS and DTLSPlaintext.length for DTLS. Furthermore, the
		 *   length of the type field is 1 byte, and the length of the
		 *   payload_length is 2. Therefore, the padding_length is
		 *   TLSPlaintext.length - payload_length - 3 for TLS and
		 *   DTLSPlaintext.length - payload_length - 3 for DTLS. The
		 *   padding_length MUST be at least 16.
		 *
		 * The sender of a HeartbeatMessage MUST use a random padding of at
		 * least 16 bytes. The padding of a received HeartbeatMessage message
		 * MUST be ignored.
		 *
		 * If the payload_length of a received HeartbeatMessage is too large,
		 * the received HeartbeatMessage MUST be discarded silently.
		 *
		 * @param c the connection.
		 * @param type the tls.HeartbeatMessageType.
		 * @param payload the heartbeat data to send as the payload.
		 * @param [payloadLength] the payload length to use, defaults to the
		 *          actual payload length.
		 *
		 * @return the HeartbeatRequest byte buffer.
		 */
		tls.createHeartbeat = function(type, payload, payloadLength) {
		  if(typeof payloadLength === 'undefined') {
		    payloadLength = payload.length;
		  }
		  // build record fragment
		  var rval = forge.util.createBuffer();
		  rval.putByte(type);               // heartbeat message type
		  rval.putInt16(payloadLength);     // payload length
		  rval.putBytes(payload);           // payload
		  // padding
		  var plaintextLength = rval.length();
		  var paddingLength = Math.max(16, plaintextLength - payloadLength - 3);
		  rval.putBytes(forge.random.getBytes(paddingLength));
		  return rval;
		};

		/**
		 * Fragments, compresses, encrypts, and queues a record for delivery.
		 *
		 * @param c the connection.
		 * @param record the record to queue.
		 */
		tls.queue = function(c, record) {
		  // error during record creation
		  if(!record) {
		    return;
		  }

		  // if the record is a handshake record, update handshake hashes
		  if(record.type === tls.ContentType.handshake) {
		    var bytes = record.fragment.bytes();
		    c.session.md5.update(bytes);
		    c.session.sha1.update(bytes);
		    bytes = null;
		  }

		  // handle record fragmentation
		  var records;
		  if(record.fragment.length() <= tls.MaxFragment) {
		    records = [record];
		  } else {
		    // fragment data as long as it is too long
		    records = [];
		    var data = record.fragment.bytes();
		    while(data.length > tls.MaxFragment) {
		      records.push(tls.createRecord(c, {
		        type: record.type,
		        data: forge.util.createBuffer(data.slice(0, tls.MaxFragment))
		      }));
		      data = data.slice(tls.MaxFragment);
		    }
		    // add last record
		    if(data.length > 0) {
		      records.push(tls.createRecord(c, {
		        type: record.type,
		        data: forge.util.createBuffer(data)
		      }));
		    }
		  }

		  // compress and encrypt all fragmented records
		  for(var i = 0; i < records.length && !c.fail; ++i) {
		    // update the record using current write state
		    var rec = records[i];
		    var s = c.state.current.write;
		    if(s.update(c, rec)) {
		      // store record
		      c.records.push(rec);
		    }
		  }
		};

		/**
		 * Flushes all queued records to the output buffer and calls the
		 * tlsDataReady() handler on the given connection.
		 *
		 * @param c the connection.
		 *
		 * @return true on success, false on failure.
		 */
		tls.flush = function(c) {
		  for(var i = 0; i < c.records.length; ++i) {
		    var record = c.records[i];

		    // add record header and fragment
		    c.tlsData.putByte(record.type);
		    c.tlsData.putByte(record.version.major);
		    c.tlsData.putByte(record.version.minor);
		    c.tlsData.putInt16(record.fragment.length());
		    c.tlsData.putBuffer(c.records[i].fragment);
		  }
		  c.records = [];
		  return c.tlsDataReady(c);
		};

		/**
		 * Maps a pki.certificateError to a tls.Alert.Description.
		 *
		 * @param error the error to map.
		 *
		 * @return the alert description.
		 */
		var _certErrorToAlertDesc = function(error) {
		  switch(error) {
		  case true:
		    return true;
		  case forge.pki.certificateError.bad_certificate:
		    return tls.Alert.Description.bad_certificate;
		  case forge.pki.certificateError.unsupported_certificate:
		    return tls.Alert.Description.unsupported_certificate;
		  case forge.pki.certificateError.certificate_revoked:
		    return tls.Alert.Description.certificate_revoked;
		  case forge.pki.certificateError.certificate_expired:
		    return tls.Alert.Description.certificate_expired;
		  case forge.pki.certificateError.certificate_unknown:
		    return tls.Alert.Description.certificate_unknown;
		  case forge.pki.certificateError.unknown_ca:
		    return tls.Alert.Description.unknown_ca;
		  default:
		    return tls.Alert.Description.bad_certificate;
		  }
		};

		/**
		 * Maps a tls.Alert.Description to a pki.certificateError.
		 *
		 * @param desc the alert description.
		 *
		 * @return the certificate error.
		 */
		var _alertDescToCertError = function(desc) {
		  switch(desc) {
		  case true:
		    return true;
		  case tls.Alert.Description.bad_certificate:
		    return forge.pki.certificateError.bad_certificate;
		  case tls.Alert.Description.unsupported_certificate:
		    return forge.pki.certificateError.unsupported_certificate;
		  case tls.Alert.Description.certificate_revoked:
		    return forge.pki.certificateError.certificate_revoked;
		  case tls.Alert.Description.certificate_expired:
		    return forge.pki.certificateError.certificate_expired;
		  case tls.Alert.Description.certificate_unknown:
		    return forge.pki.certificateError.certificate_unknown;
		  case tls.Alert.Description.unknown_ca:
		    return forge.pki.certificateError.unknown_ca;
		  default:
		    return forge.pki.certificateError.bad_certificate;
		  }
		};

		/**
		 * Verifies a certificate chain against the given connection's
		 * Certificate Authority store.
		 *
		 * @param c the TLS connection.
		 * @param chain the certificate chain to verify, with the root or highest
		 *          authority at the end.
		 *
		 * @return true if successful, false if not.
		 */
		tls.verifyCertificateChain = function(c, chain) {
		  try {
		    // verify chain
		    forge.pki.verifyCertificateChain(c.caStore, chain,
		      function verify(vfd, depth, chain) {
		        // convert pki.certificateError to tls alert description
		        var desc = _certErrorToAlertDesc(vfd);

		        // call application callback
		        var ret = c.verify(c, vfd, depth, chain);
		        if(ret !== true) {
		          if(typeof ret === 'object' && !forge.util.isArray(ret)) {
		            // throw custom error
		            var error = new Error('The application rejected the certificate.');
		            error.send = true;
		            error.alert = {
		              level: tls.Alert.Level.fatal,
		              description: tls.Alert.Description.bad_certificate
		            };
		            if(ret.message) {
		              error.message = ret.message;
		            }
		            if(ret.alert) {
		              error.alert.description = ret.alert;
		            }
		            throw error;
		          }

		          // convert tls alert description to pki.certificateError
		          if(ret !== vfd) {
		            ret = _alertDescToCertError(ret);
		          }
		        }

		        return ret;
		      });
		  } catch(ex) {
		    // build tls error if not already customized
		    var err = ex;
		    if(typeof err !== 'object' || forge.util.isArray(err)) {
		      err = {
		        send: true,
		        alert: {
		          level: tls.Alert.Level.fatal,
		          description: _certErrorToAlertDesc(ex)
		        }
		      };
		    }
		    if(!('send' in err)) {
		      err.send = true;
		    }
		    if(!('alert' in err)) {
		      err.alert = {
		        level: tls.Alert.Level.fatal,
		        description: _certErrorToAlertDesc(err.error)
		      };
		    }

		    // send error
		    c.error(c, err);
		  }

		  return !c.fail;
		};

		/**
		 * Creates a new TLS session cache.
		 *
		 * @param cache optional map of session ID to cached session.
		 * @param capacity the maximum size for the cache (default: 100).
		 *
		 * @return the new TLS session cache.
		 */
		tls.createSessionCache = function(cache, capacity) {
		  var rval = null;

		  // assume input is already a session cache object
		  if(cache && cache.getSession && cache.setSession && cache.order) {
		    rval = cache;
		  } else {
		    // create cache
		    rval = {};
		    rval.cache = cache || {};
		    rval.capacity = Math.max(capacity || 100, 1);
		    rval.order = [];

		    // store order for sessions, delete session overflow
		    for(var key in cache) {
		      if(rval.order.length <= capacity) {
		        rval.order.push(key);
		      } else {
		        delete cache[key];
		      }
		    }

		    // get a session from a session ID (or get any session)
		    rval.getSession = function(sessionId) {
		      var session = null;
		      var key = null;

		      // if session ID provided, use it
		      if(sessionId) {
		        key = forge.util.bytesToHex(sessionId);
		      } else if(rval.order.length > 0) {
		        // get first session from cache
		        key = rval.order[0];
		      }

		      if(key !== null && key in rval.cache) {
		        // get cached session and remove from cache
		        session = rval.cache[key];
		        delete rval.cache[key];
		        for(var i in rval.order) {
		          if(rval.order[i] === key) {
		            rval.order.splice(i, 1);
		            break;
		          }
		        }
		      }

		      return session;
		    };

		    // set a session in the cache
		    rval.setSession = function(sessionId, session) {
		      // remove session from cache if at capacity
		      if(rval.order.length === rval.capacity) {
		        var key = rval.order.shift();
		        delete rval.cache[key];
		      }
		      // add session to cache
		      var key = forge.util.bytesToHex(sessionId);
		      rval.order.push(key);
		      rval.cache[key] = session;
		    };
		  }

		  return rval;
		};

		/**
		 * Creates a new TLS connection.
		 *
		 * See public createConnection() docs for more details.
		 *
		 * @param options the options for this connection.
		 *
		 * @return the new TLS connection.
		 */
		tls.createConnection = function(options) {
		  var caStore = null;
		  if(options.caStore) {
		    // if CA store is an array, convert it to a CA store object
		    if(forge.util.isArray(options.caStore)) {
		      caStore = forge.pki.createCaStore(options.caStore);
		    } else {
		      caStore = options.caStore;
		    }
		  } else {
		    // create empty CA store
		    caStore = forge.pki.createCaStore();
		  }

		  // setup default cipher suites
		  var cipherSuites = options.cipherSuites || null;
		  if(cipherSuites === null) {
		    cipherSuites = [];
		    for(var key in tls.CipherSuites) {
		      cipherSuites.push(tls.CipherSuites[key]);
		    }
		  }

		  // set default entity
		  var entity = (options.server || false) ?
		    tls.ConnectionEnd.server : tls.ConnectionEnd.client;

		  // create session cache if requested
		  var sessionCache = options.sessionCache ?
		    tls.createSessionCache(options.sessionCache) : null;

		  // create TLS connection
		  var c = {
		    version: {major: tls.Version.major, minor: tls.Version.minor},
		    entity: entity,
		    sessionId: options.sessionId,
		    caStore: caStore,
		    sessionCache: sessionCache,
		    cipherSuites: cipherSuites,
		    connected: options.connected,
		    virtualHost: options.virtualHost || null,
		    verifyClient: options.verifyClient || false,
		    verify: options.verify || function(cn, vfd, dpth, cts) {return vfd;},
		    getCertificate: options.getCertificate || null,
		    getPrivateKey: options.getPrivateKey || null,
		    getSignature: options.getSignature || null,
		    input: forge.util.createBuffer(),
		    tlsData: forge.util.createBuffer(),
		    data: forge.util.createBuffer(),
		    tlsDataReady: options.tlsDataReady,
		    dataReady: options.dataReady,
		    heartbeatReceived: options.heartbeatReceived,
		    closed: options.closed,
		    error: function(c, ex) {
		      // set origin if not set
		      ex.origin = ex.origin ||
		        ((c.entity === tls.ConnectionEnd.client) ? 'client' : 'server');

		      // send TLS alert
		      if(ex.send) {
		        tls.queue(c, tls.createAlert(c, ex.alert));
		        tls.flush(c);
		      }

		      // error is fatal by default
		      var fatal = (ex.fatal !== false);
		      if(fatal) {
		        // set fail flag
		        c.fail = true;
		      }

		      // call error handler first
		      options.error(c, ex);

		      if(fatal) {
		        // fatal error, close connection, do not clear fail
		        c.close(false);
		      }
		    },
		    deflate: options.deflate || null,
		    inflate: options.inflate || null
		  };

		  /**
		   * Resets a closed TLS connection for reuse. Called in c.close().
		   *
		   * @param clearFail true to clear the fail flag (default: true).
		   */
		  c.reset = function(clearFail) {
		    c.version = {major: tls.Version.major, minor: tls.Version.minor};
		    c.record = null;
		    c.session = null;
		    c.peerCertificate = null;
		    c.state = {
		      pending: null,
		      current: null
		    };
		    c.expect = (c.entity === tls.ConnectionEnd.client) ? SHE : CHE;
		    c.fragmented = null;
		    c.records = [];
		    c.open = false;
		    c.handshakes = 0;
		    c.handshaking = false;
		    c.isConnected = false;
		    c.fail = !(clearFail || typeof(clearFail) === 'undefined');
		    c.input.clear();
		    c.tlsData.clear();
		    c.data.clear();
		    c.state.current = tls.createConnectionState(c);
		  };

		  // do initial reset of connection
		  c.reset();

		  /**
		   * Updates the current TLS engine state based on the given record.
		   *
		   * @param c the TLS connection.
		   * @param record the TLS record to act on.
		   */
		  var _update = function(c, record) {
		    // get record handler (align type in table by subtracting lowest)
		    var aligned = record.type - tls.ContentType.change_cipher_spec;
		    var handlers = ctTable[c.entity][c.expect];
		    if(aligned in handlers) {
		      handlers[aligned](c, record);
		    } else {
		      // unexpected record
		      tls.handleUnexpected(c, record);
		    }
		  };

		  /**
		   * Reads the record header and initializes the next record on the given
		   * connection.
		   *
		   * @param c the TLS connection with the next record.
		   *
		   * @return 0 if the input data could be processed, otherwise the
		   *         number of bytes required for data to be processed.
		   */
		  var _readRecordHeader = function(c) {
		    var rval = 0;

		    // get input buffer and its length
		    var b = c.input;
		    var len = b.length();

		    // need at least 5 bytes to initialize a record
		    if(len < 5) {
		      rval = 5 - len;
		    } else {
		      // enough bytes for header
		      // initialize record
		      c.record = {
		        type: b.getByte(),
		        version: {
		          major: b.getByte(),
		          minor: b.getByte()
		        },
		        length: b.getInt16(),
		        fragment: forge.util.createBuffer(),
		        ready: false
		      };

		      // check record version
		      var compatibleVersion = (c.record.version.major === c.version.major);
		      if(compatibleVersion && c.session && c.session.version) {
		        // session version already set, require same minor version
		        compatibleVersion = (c.record.version.minor === c.version.minor);
		      }
		      if(!compatibleVersion) {
		        c.error(c, {
		          message: 'Incompatible TLS version.',
		          send: true,
		          alert: {
		            level: tls.Alert.Level.fatal,
		            description: tls.Alert.Description.protocol_version
		          }
		        });
		      }
		    }

		    return rval;
		  };

		  /**
		   * Reads the next record's contents and appends its message to any
		   * previously fragmented message.
		   *
		   * @param c the TLS connection with the next record.
		   *
		   * @return 0 if the input data could be processed, otherwise the
		   *         number of bytes required for data to be processed.
		   */
		  var _readRecord = function(c) {
		    var rval = 0;

		    // ensure there is enough input data to get the entire record
		    var b = c.input;
		    var len = b.length();
		    if(len < c.record.length) {
		      // not enough data yet, return how much is required
		      rval = c.record.length - len;
		    } else {
		      // there is enough data to parse the pending record
		      // fill record fragment and compact input buffer
		      c.record.fragment.putBytes(b.getBytes(c.record.length));
		      b.compact();

		      // update record using current read state
		      var s = c.state.current.read;
		      if(s.update(c, c.record)) {
		        // see if there is a previously fragmented message that the
		        // new record's message fragment should be appended to
		        if(c.fragmented !== null) {
		          // if the record type matches a previously fragmented
		          // record, append the record fragment to it
		          if(c.fragmented.type === c.record.type) {
		            // concatenate record fragments
		            c.fragmented.fragment.putBuffer(c.record.fragment);
		            c.record = c.fragmented;
		          } else {
		            // error, invalid fragmented record
		            c.error(c, {
		              message: 'Invalid fragmented record.',
		              send: true,
		              alert: {
		                level: tls.Alert.Level.fatal,
		                description:
		                  tls.Alert.Description.unexpected_message
		              }
		            });
		          }
		        }

		        // record is now ready
		        c.record.ready = true;
		      }
		    }

		    return rval;
		  };

		  /**
		   * Performs a handshake using the TLS Handshake Protocol, as a client.
		   *
		   * This method should only be called if the connection is in client mode.
		   *
		   * @param sessionId the session ID to use, null to start a new one.
		   */
		  c.handshake = function(sessionId) {
		    // error to call this in non-client mode
		    if(c.entity !== tls.ConnectionEnd.client) {
		      // not fatal error
		      c.error(c, {
		        message: 'Cannot initiate handshake as a server.',
		        fatal: false
		      });
		    } else if(c.handshaking) {
		      // handshake is already in progress, fail but not fatal error
		      c.error(c, {
		        message: 'Handshake already in progress.',
		        fatal: false
		      });
		    } else {
		      // clear fail flag on reuse
		      if(c.fail && !c.open && c.handshakes === 0) {
		        c.fail = false;
		      }

		      // now handshaking
		      c.handshaking = true;

		      // default to blank (new session)
		      sessionId = sessionId || '';

		      // if a session ID was specified, try to find it in the cache
		      var session = null;
		      if(sessionId.length > 0) {
		        if(c.sessionCache) {
		          session = c.sessionCache.getSession(sessionId);
		        }

		        // matching session not found in cache, clear session ID
		        if(session === null) {
		          sessionId = '';
		        }
		      }

		      // no session given, grab a session from the cache, if available
		      if(sessionId.length === 0 && c.sessionCache) {
		        session = c.sessionCache.getSession();
		        if(session !== null) {
		          sessionId = session.id;
		        }
		      }

		      // set up session
		      c.session = {
		        id: sessionId,
		        version: null,
		        cipherSuite: null,
		        compressionMethod: null,
		        serverCertificate: null,
		        certificateRequest: null,
		        clientCertificate: null,
		        sp: {},
		        md5: forge.md.md5.create(),
		        sha1: forge.md.sha1.create()
		      };

		      // use existing session information
		      if(session) {
		        // only update version on connection, session version not yet set
		        c.version = session.version;
		        c.session.sp = session.sp;
		      }

		      // generate new client random
		      c.session.sp.client_random = tls.createRandom().getBytes();

		      // connection now open
		      c.open = true;

		      // send hello
		      tls.queue(c, tls.createRecord(c, {
		        type: tls.ContentType.handshake,
		        data: tls.createClientHello(c)
		      }));
		      tls.flush(c);
		    }
		  };

		  /**
		   * Called when TLS protocol data has been received from somewhere and should
		   * be processed by the TLS engine.
		   *
		   * @param data the TLS protocol data, as a string, to process.
		   *
		   * @return 0 if the data could be processed, otherwise the number of bytes
		   *         required for data to be processed.
		   */
		  c.process = function(data) {
		    var rval = 0;

		    // buffer input data
		    if(data) {
		      c.input.putBytes(data);
		    }

		    // process next record if no failure, process will be called after
		    // each record is handled (since handling can be asynchronous)
		    if(!c.fail) {
		      // reset record if ready and now empty
		      if(c.record !== null &&
		        c.record.ready && c.record.fragment.isEmpty()) {
		        c.record = null;
		      }

		      // if there is no pending record, try to read record header
		      if(c.record === null) {
		        rval = _readRecordHeader(c);
		      }

		      // read the next record (if record not yet ready)
		      if(!c.fail && c.record !== null && !c.record.ready) {
		        rval = _readRecord(c);
		      }

		      // record ready to be handled, update engine state
		      if(!c.fail && c.record !== null && c.record.ready) {
		        _update(c, c.record);
		      }
		    }

		    return rval;
		  };

		  /**
		   * Requests that application data be packaged into a TLS record. The
		   * tlsDataReady handler will be called when the TLS record(s) have been
		   * prepared.
		   *
		   * @param data the application data, as a raw 'binary' encoded string, to
		   *          be sent; to send utf-16/utf-8 string data, use the return value
		   *          of util.encodeUtf8(str).
		   *
		   * @return true on success, false on failure.
		   */
		  c.prepare = function(data) {
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.application_data,
		      data: forge.util.createBuffer(data)
		    }));
		    return tls.flush(c);
		  };

		  /**
		   * Requests that a heartbeat request be packaged into a TLS record for
		   * transmission. The tlsDataReady handler will be called when TLS record(s)
		   * have been prepared.
		   *
		   * When a heartbeat response has been received, the heartbeatReceived
		   * handler will be called with the matching payload. This handler can
		   * be used to clear a retransmission timer, etc.
		   *
		   * @param payload the heartbeat data to send as the payload in the message.
		   * @param [payloadLength] the payload length to use, defaults to the
		   *          actual payload length.
		   *
		   * @return true on success, false on failure.
		   */
		  c.prepareHeartbeatRequest = function(payload, payloadLength) {
		    if(payload instanceof forge.util.ByteBuffer) {
		      payload = payload.bytes();
		    }
		    if(typeof payloadLength === 'undefined') {
		      payloadLength = payload.length;
		    }
		    c.expectedHeartbeatPayload = payload;
		    tls.queue(c, tls.createRecord(c, {
		      type: tls.ContentType.heartbeat,
		      data: tls.createHeartbeat(
		        tls.HeartbeatMessageType.heartbeat_request, payload, payloadLength)
		    }));
		    return tls.flush(c);
		  };

		  /**
		   * Closes the connection (sends a close_notify alert).
		   *
		   * @param clearFail true to clear the fail flag (default: true).
		   */
		  c.close = function(clearFail) {
		    // save session if connection didn't fail
		    if(!c.fail && c.sessionCache && c.session) {
		      // only need to preserve session ID, version, and security params
		      var session = {
		        id: c.session.id,
		        version: c.session.version,
		        sp: c.session.sp
		      };
		      session.sp.keys = null;
		      c.sessionCache.setSession(session.id, session);
		    }

		    if(c.open) {
		      // connection no longer open, clear input
		      c.open = false;
		      c.input.clear();

		      // if connected or handshaking, send an alert
		      if(c.isConnected || c.handshaking) {
		        c.isConnected = c.handshaking = false;

		        // send close_notify alert
		        tls.queue(c, tls.createAlert(c, {
		          level: tls.Alert.Level.warning,
		          description: tls.Alert.Description.close_notify
		        }));
		        tls.flush(c);
		      }

		      // call handler
		      c.closed(c);
		    }

		    // reset TLS connection, do not clear fail flag
		    c.reset(clearFail);
		  };

		  return c;
		};

		/* TLS API */
		forge.tls = forge.tls || {};

		// expose non-functions
		for(var key in tls) {
		  if(typeof tls[key] !== 'function') {
		    forge.tls[key] = tls[key];
		  }
		}

		// expose prf_tls1 for testing
		forge.tls.prf_tls1 = prf_TLS1;

		// expose sha1 hmac method
		forge.tls.hmac_sha1 = hmac_sha1;

		// expose session cache creation
		forge.tls.createSessionCache = tls.createSessionCache;

		/**
		 * Creates a new TLS connection. This does not make any assumptions about the
		 * transport layer that TLS is working on top of, ie: it does not assume there
		 * is a TCP/IP connection or establish one. A TLS connection is totally
		 * abstracted away from the layer is runs on top of, it merely establishes a
		 * secure channel between a client" and a "server".
		 *
		 * A TLS connection contains 4 connection states: pending read and write, and
		 * current read and write.
		 *
		 * At initialization, the current read and write states will be null. Only once
		 * the security parameters have been set and the keys have been generated can
		 * the pending states be converted into current states. Current states will be
		 * updated for each record processed.
		 *
		 * A custom certificate verify callback may be provided to check information
		 * like the common name on the server's certificate. It will be called for
		 * every certificate in the chain. It has the following signature:
		 *
		 * variable func(c, certs, index, preVerify)
		 * Where:
		 * c         The TLS connection
		 * verified  Set to true if certificate was verified, otherwise the alert
		 *           tls.Alert.Description for why the certificate failed.
		 * depth     The current index in the chain, where 0 is the server's cert.
		 * certs     The certificate chain, *NOTE* if the server was anonymous then
		 *           the chain will be empty.
		 *
		 * The function returns true on success and on failure either the appropriate
		 * tls.Alert.Description or an object with 'alert' set to the appropriate
		 * tls.Alert.Description and 'message' set to a custom error message. If true
		 * is not returned then the connection will abort using, in order of
		 * availability, first the returned alert description, second the preVerify
		 * alert description, and lastly the default 'bad_certificate'.
		 *
		 * There are three callbacks that can be used to make use of client-side
		 * certificates where each takes the TLS connection as the first parameter:
		 *
		 * getCertificate(conn, hint)
		 *   The second parameter is a hint as to which certificate should be
		 *   returned. If the connection entity is a client, then the hint will be
		 *   the CertificateRequest message from the server that is part of the
		 *   TLS protocol. If the connection entity is a server, then it will be
		 *   the servername list provided via an SNI extension the ClientHello, if
		 *   one was provided (empty array if not). The hint can be examined to
		 *   determine which certificate to use (advanced). Most implementations
		 *   will just return a certificate. The return value must be a
		 *   PEM-formatted certificate or an array of PEM-formatted certificates
		 *   that constitute a certificate chain, with the first in the array/chain
		 *   being the client's certificate.
		 * getPrivateKey(conn, certificate)
		 *   The second parameter is an forge.pki X.509 certificate object that
		 *   is associated with the requested private key. The return value must
		 *   be a PEM-formatted private key.
		 * getSignature(conn, bytes, callback)
		 *   This callback can be used instead of getPrivateKey if the private key
		 *   is not directly accessible in javascript or should not be. For
		 *   instance, a secure external web service could provide the signature
		 *   in exchange for appropriate credentials. The second parameter is a
		 *   string of bytes to be signed that are part of the TLS protocol. These
		 *   bytes are used to verify that the private key for the previously
		 *   provided client-side certificate is accessible to the client. The
		 *   callback is a function that takes 2 parameters, the TLS connection
		 *   and the RSA encrypted (signed) bytes as a string. This callback must
		 *   be called once the signature is ready.
		 *
		 * @param options the options for this connection:
		 *   server: true if the connection is server-side, false for client.
		 *   sessionId: a session ID to reuse, null for a new connection.
		 *   caStore: an array of certificates to trust.
		 *   sessionCache: a session cache to use.
		 *   cipherSuites: an optional array of cipher suites to use,
		 *     see tls.CipherSuites.
		 *   connected: function(conn) called when the first handshake completes.
		 *   virtualHost: the virtual server name to use in a TLS SNI extension.
		 *   verifyClient: true to require a client certificate in server mode,
		 *     'optional' to request one, false not to (default: false).
		 *   verify: a handler used to custom verify certificates in the chain.
		 *   getCertificate: an optional callback used to get a certificate or
		 *     a chain of certificates (as an array).
		 *   getPrivateKey: an optional callback used to get a private key.
		 *   getSignature: an optional callback used to get a signature.
		 *   tlsDataReady: function(conn) called when TLS protocol data has been
		 *     prepared and is ready to be used (typically sent over a socket
		 *     connection to its destination), read from conn.tlsData buffer.
		 *   dataReady: function(conn) called when application data has
		 *     been parsed from a TLS record and should be consumed by the
		 *     application, read from conn.data buffer.
		 *   closed: function(conn) called when the connection has been closed.
		 *   error: function(conn, error) called when there was an error.
		 *   deflate: function(inBytes) if provided, will deflate TLS records using
		 *     the deflate algorithm if the server supports it.
		 *   inflate: function(inBytes) if provided, will inflate TLS records using
		 *     the deflate algorithm if the server supports it.
		 *
		 * @return the new TLS connection.
		 */
		forge.tls.createConnection = tls.createConnection;

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'tls';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/tls',[
		  'require',
		  'module',
		  './asn1',
		  './hmac',
		  './md',
		  './pem',
		  './pki',
		  './random',
		  './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * A Javascript implementation of AES Cipher Suites for TLS.
		 *
		 * @author Dave Longley
		 *
		 * Copyright (c) 2009-2015 Digital Bazaar, Inc.
		 *
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var tls = forge.tls;

		/**
		 * Supported cipher suites.
		 */
		tls.CipherSuites['TLS_RSA_WITH_AES_128_CBC_SHA'] = {
		  id: [0x00,0x2f],
		  name: 'TLS_RSA_WITH_AES_128_CBC_SHA',
		  initSecurityParameters: function(sp) {
		    sp.bulk_cipher_algorithm = tls.BulkCipherAlgorithm.aes;
		    sp.cipher_type = tls.CipherType.block;
		    sp.enc_key_length = 16;
		    sp.block_length = 16;
		    sp.fixed_iv_length = 16;
		    sp.record_iv_length = 16;
		    sp.mac_algorithm = tls.MACAlgorithm.hmac_sha1;
		    sp.mac_length = 20;
		    sp.mac_key_length = 20;
		  },
		  initConnectionState: initConnectionState
		};
		tls.CipherSuites['TLS_RSA_WITH_AES_256_CBC_SHA'] = {
		  id: [0x00,0x35],
		  name: 'TLS_RSA_WITH_AES_256_CBC_SHA',
		  initSecurityParameters: function(sp) {
		    sp.bulk_cipher_algorithm = tls.BulkCipherAlgorithm.aes;
		    sp.cipher_type = tls.CipherType.block;
		    sp.enc_key_length = 32;
		    sp.block_length = 16;
		    sp.fixed_iv_length = 16;
		    sp.record_iv_length = 16;
		    sp.mac_algorithm = tls.MACAlgorithm.hmac_sha1;
		    sp.mac_length = 20;
		    sp.mac_key_length = 20;
		  },
		  initConnectionState: initConnectionState
		};

		function initConnectionState(state, c, sp) {
		  var client = (c.entity === forge.tls.ConnectionEnd.client);

		  // cipher setup
		  state.read.cipherState = {
		    init: false,
		    cipher: forge.cipher.createDecipher('AES-CBC', client ?
		      sp.keys.server_write_key : sp.keys.client_write_key),
		    iv: client ? sp.keys.server_write_IV : sp.keys.client_write_IV
		  };
		  state.write.cipherState = {
		    init: false,
		    cipher: forge.cipher.createCipher('AES-CBC', client ?
		      sp.keys.client_write_key : sp.keys.server_write_key),
		    iv: client ? sp.keys.client_write_IV : sp.keys.server_write_IV
		  };
		  state.read.cipherFunction = decrypt_aes_cbc_sha1;
		  state.write.cipherFunction = encrypt_aes_cbc_sha1;

		  // MAC setup
		  state.read.macLength = state.write.macLength = sp.mac_length;
		  state.read.macFunction = state.write.macFunction = tls.hmac_sha1;
		}

		/**
		 * Encrypts the TLSCompressed record into a TLSCipherText record using AES
		 * in CBC mode.
		 *
		 * @param record the TLSCompressed record to encrypt.
		 * @param s the ConnectionState to use.
		 *
		 * @return true on success, false on failure.
		 */
		function encrypt_aes_cbc_sha1(record, s) {
		  var rval = false;

		  // append MAC to fragment, update sequence number
		  var mac = s.macFunction(s.macKey, s.sequenceNumber, record);
		  record.fragment.putBytes(mac);
		  s.updateSequenceNumber();

		  // TLS 1.1+ use an explicit IV every time to protect against CBC attacks
		  var iv;
		  if(record.version.minor === tls.Versions.TLS_1_0.minor) {
		    // use the pre-generated IV when initializing for TLS 1.0, otherwise use
		    // the residue from the previous encryption
		    iv = s.cipherState.init ? null : s.cipherState.iv;
		  } else {
		    iv = forge.random.getBytesSync(16);
		  }

		  s.cipherState.init = true;

		  // start cipher
		  var cipher = s.cipherState.cipher;
		  cipher.start({iv: iv});

		  // TLS 1.1+ write IV into output
		  if(record.version.minor >= tls.Versions.TLS_1_1.minor) {
		    cipher.output.putBytes(iv);
		  }

		  // do encryption (default padding is appropriate)
		  cipher.update(record.fragment);
		  if(cipher.finish(encrypt_aes_cbc_sha1_padding)) {
		    // set record fragment to encrypted output
		    record.fragment = cipher.output;
		    record.length = record.fragment.length();
		    rval = true;
		  }

		  return rval;
		}

		/**
		 * Handles padding for aes_cbc_sha1 in encrypt mode.
		 *
		 * @param blockSize the block size.
		 * @param input the input buffer.
		 * @param decrypt true in decrypt mode, false in encrypt mode.
		 *
		 * @return true on success, false on failure.
		 */
		function encrypt_aes_cbc_sha1_padding(blockSize, input, decrypt) {
		  /* The encrypted data length (TLSCiphertext.length) is one more than the sum
		   of SecurityParameters.block_length, TLSCompressed.length,
		   SecurityParameters.mac_length, and padding_length.

		   The padding may be any length up to 255 bytes long, as long as it results in
		   the TLSCiphertext.length being an integral multiple of the block length.
		   Lengths longer than necessary might be desirable to frustrate attacks on a
		   protocol based on analysis of the lengths of exchanged messages. Each uint8
		   in the padding data vector must be filled with the padding length value.

		   The padding length should be such that the total size of the
		   GenericBlockCipher structure is a multiple of the cipher's block length.
		   Legal values range from zero to 255, inclusive. This length specifies the
		   length of the padding field exclusive of the padding_length field itself.

		   This is slightly different from PKCS#7 because the padding value is 1
		   less than the actual number of padding bytes if you include the
		   padding_length uint8 itself as a padding byte. */
		  if(!decrypt) {
		    // get the number of padding bytes required to reach the blockSize and
		    // subtract 1 for the padding value (to make room for the padding_length
		    // uint8)
		    var padding = blockSize - (input.length() % blockSize);
		    input.fillWithByte(padding - 1, padding);
		  }
		  return true;
		}

		/**
		 * Handles padding for aes_cbc_sha1 in decrypt mode.
		 *
		 * @param blockSize the block size.
		 * @param output the output buffer.
		 * @param decrypt true in decrypt mode, false in encrypt mode.
		 *
		 * @return true on success, false on failure.
		 */
		function decrypt_aes_cbc_sha1_padding(blockSize, output, decrypt) {
		  var rval = true;
		  if(decrypt) {
		    /* The last byte in the output specifies the number of padding bytes not
		      including itself. Each of the padding bytes has the same value as that
		      last byte (known as the padding_length). Here we check all padding
		      bytes to ensure they have the value of padding_length even if one of
		      them is bad in order to ward-off timing attacks. */
		    var len = output.length();
		    var paddingLength = output.last();
		    for(var i = len - 1 - paddingLength; i < len - 1; ++i) {
		      rval = rval && (output.at(i) == paddingLength);
		    }
		    if(rval) {
		      // trim off padding bytes and last padding length byte
		      output.truncate(paddingLength + 1);
		    }
		  }
		  return rval;
		}

		/**
		 * Decrypts a TLSCipherText record into a TLSCompressed record using
		 * AES in CBC mode.
		 *
		 * @param record the TLSCipherText record to decrypt.
		 * @param s the ConnectionState to use.
		 *
		 * @return true on success, false on failure.
		 */
		var count = 0;
		function decrypt_aes_cbc_sha1(record, s) {
		  var rval = false;
		  ++count;

		  var iv;
		  if(record.version.minor === tls.Versions.TLS_1_0.minor) {
		    // use pre-generated IV when initializing for TLS 1.0, otherwise use the
		    // residue from the previous decryption
		    iv = s.cipherState.init ? null : s.cipherState.iv;
		  } else {
		    // TLS 1.1+ use an explicit IV every time to protect against CBC attacks
		    // that is appended to the record fragment
		    iv = record.fragment.getBytes(16);
		  }

		  s.cipherState.init = true;

		  // start cipher
		  var cipher = s.cipherState.cipher;
		  cipher.start({iv: iv});

		  // do decryption
		  cipher.update(record.fragment);
		  rval = cipher.finish(decrypt_aes_cbc_sha1_padding);

		  // even if decryption fails, keep going to minimize timing attacks

		  // decrypted data:
		  // first (len - 20) bytes = application data
		  // last 20 bytes          = MAC
		  var macLen = s.macLength;

		  // create a random MAC to check against should the mac length check fail
		  // Note: do this regardless of the failure to keep timing consistent
		  var mac = forge.random.getBytesSync(macLen);

		  // get fragment and mac
		  var len = cipher.output.length();
		  if(len >= macLen) {
		    record.fragment = cipher.output.getBytes(len - macLen);
		    mac = cipher.output.getBytes(macLen);
		  } else {
		    // bad data, but get bytes anyway to try to keep timing consistent
		    record.fragment = cipher.output.getBytes();
		  }
		  record.fragment = forge.util.createBuffer(record.fragment);
		  record.length = record.fragment.length();

		  // see if data integrity checks out, update sequence number
		  var mac2 = s.macFunction(s.macKey, s.sequenceNumber, record);
		  s.updateSequenceNumber();
		  rval = compareMacs(s.macKey, mac, mac2) && rval;
		  return rval;
		}

		/**
		 * Safely compare two MACs. This function will compare two MACs in a way
		 * that protects against timing attacks.
		 *
		 * TODO: Expose elsewhere as a utility API.
		 *
		 * See: https://www.nccgroup.trust/us/about-us/newsroom-and-events/blog/2011/february/double-hmac-verification/
		 *
		 * @param key the MAC key to use.
		 * @param mac1 as a binary-encoded string of bytes.
		 * @param mac2 as a binary-encoded string of bytes.
		 *
		 * @return true if the MACs are the same, false if not.
		 */
		function compareMacs(key, mac1, mac2) {
		  var hmac = forge.hmac.create();

		  hmac.start('SHA1', key);
		  hmac.update(mac1);
		  mac1 = hmac.digest().getBytes();

		  hmac.start(null, null);
		  hmac.update(mac2);
		  mac2 = hmac.digest().getBytes();

		  return mac1 === mac2;
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'aesCipherSuites';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/aesCipherSuites',['require', 'module', './aes', './tls'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Debugging support for web applications.
		 *
		 * @author David I. Lehn <dlehn@digitalbazaar.com>
		 *
		 * Copyright 2008-2013 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* DEBUG API */
		forge.debug = forge.debug || {};

		// Private storage for debugging.
		// Useful to expose data that is otherwise unviewable behind closures.
		// NOTE: remember that this can hold references to data and cause leaks!
		// format is "forge._debug.<modulename>.<dataname> = data"
		// Example:
		// (function() {
		//   var cat = 'forge.test.Test'; // debugging category
		//   var sState = {...}; // local state
		//   forge.debug.set(cat, 'sState', sState);
		// })();
		forge.debug.storage = {};

		/**
		 * Gets debug data. Omit name for all cat data  Omit name and cat for
		 * all data.
		 *
		 * @param cat name of debugging category.
		 * @param name name of data to get (optional).
		 * @return object with requested debug data or undefined.
		 */
		forge.debug.get = function(cat, name) {
		  var rval;
		  if(typeof(cat) === 'undefined') {
		    rval = forge.debug.storage;
		  } else if(cat in forge.debug.storage) {
		    if(typeof(name) === 'undefined') {
		      rval = forge.debug.storage[cat];
		    } else {
		      rval = forge.debug.storage[cat][name];
		    }
		  }
		  return rval;
		};

		/**
		 * Sets debug data.
		 *
		 * @param cat name of debugging category.
		 * @param name name of data to set.
		 * @param data data to set.
		 */
		forge.debug.set = function(cat, name, data) {
		  if(!(cat in forge.debug.storage)) {
		    forge.debug.storage[cat] = {};
		  }
		  forge.debug.storage[cat][name] = data;
		};

		/**
		 * Clears debug data. Omit name for all cat data. Omit name and cat for
		 * all data.
		 *
		 * @param cat name of debugging category.
		 * @param name name of data to clear or omit to clear entire category.
		 */
		forge.debug.clear = function(cat, name) {
		  if(typeof(cat) === 'undefined') {
		    forge.debug.storage = {};
		  } else if(cat in forge.debug.storage) {
		    if(typeof(name) === 'undefined') {
		      delete forge.debug.storage[cat];
		    } else {
		      delete forge.debug.storage[cat][name];
		    }
		  }
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'debug';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/debug',['require', 'module'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of RSA-KEM.
		 *
		 * @author Lautaro Cozzani Rodriguez
		 * @author Dave Longley
		 *
		 * Copyright (c) 2014 Lautaro Cozzani <lautaro.cozzani@scytl.com>
		 * Copyright (c) 2014 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		forge.kem = forge.kem || {};

		var BigInteger = forge.jsbn.BigInteger;

		/**
		 * The API for the RSA Key Encapsulation Mechanism (RSA-KEM) from ISO 18033-2.
		 */
		forge.kem.rsa = {};

		/**
		 * Creates an RSA KEM API object for generating a secret asymmetric key.
		 *
		 * The symmetric key may be generated via a call to 'encrypt', which will
		 * produce a ciphertext to be transmitted to the recipient and a key to be
		 * kept secret. The ciphertext is a parameter to be passed to 'decrypt' which
		 * will produce the same secret key for the recipient to use to decrypt a
		 * message that was encrypted with the secret key.
		 *
		 * @param kdf the KDF API to use (eg: new forge.kem.kdf1()).
		 * @param options the options to use.
		 *          [prng] a custom crypto-secure pseudo-random number generator to use,
		 *            that must define "getBytesSync".
		 */
		forge.kem.rsa.create = function(kdf, options) {
		  options = options || {};
		  var prng = options.prng || forge.random;

		  var kem = {};

		  /**
		   * Generates a secret key and its encapsulation.
		   *
		   * @param publicKey the RSA public key to encrypt with.
		   * @param keyLength the length, in bytes, of the secret key to generate.
		   *
		   * @return an object with:
		   *   encapsulation: the ciphertext for generating the secret key, as a
		   *     binary-encoded string of bytes.
		   *   key: the secret key to use for encrypting a message.
		   */
		  kem.encrypt = function(publicKey, keyLength) {
		    // generate a random r where 1 > r > n
		    var byteLength = Math.ceil(publicKey.n.bitLength() / 8);
		    var r;
		    do {
		      r = new BigInteger(
		        forge.util.bytesToHex(prng.getBytesSync(byteLength)),
		        16).mod(publicKey.n);
		    } while(r.equals(BigInteger.ZERO));

		    // prepend r with zeros
		    r = forge.util.hexToBytes(r.toString(16));
		    var zeros = byteLength - r.length;
		    if(zeros > 0) {
		      r = forge.util.fillString(String.fromCharCode(0), zeros) + r;
		    }

		    // encrypt the random
		    var encapsulation = publicKey.encrypt(r, 'NONE');

		    // generate the secret key
		    var key = kdf.generate(r, keyLength);

		    return {encapsulation: encapsulation, key: key};
		  };

		  /**
		   * Decrypts an encapsulated secret key.
		   *
		   * @param privateKey the RSA private key to decrypt with.
		   * @param encapsulation the ciphertext for generating the secret key, as
		   *          a binary-encoded string of bytes.
		   * @param keyLength the length, in bytes, of the secret key to generate.
		   *
		   * @return the secret key as a binary-encoded string of bytes.
		   */
		  kem.decrypt = function(privateKey, encapsulation, keyLength) {
		    // decrypt the encapsulation and generate the secret key
		    var r = privateKey.decrypt(encapsulation, 'NONE');
		    return kdf.generate(r, keyLength);
		  };

		  return kem;
		};

		// TODO: add forge.kem.kdf.create('KDF1', {md: ..., ...}) API?

		/**
		 * Creates a key derivation API object that implements KDF1 per ISO 18033-2.
		 *
		 * @param md the hash API to use.
		 * @param [digestLength] an optional digest length that must be positive and
		 *          less than or equal to md.digestLength.
		 *
		 * @return a KDF1 API object.
		 */
		forge.kem.kdf1 = function(md, digestLength) {
		  _createKDF(this, md, 0, digestLength || md.digestLength);
		};

		/**
		 * Creates a key derivation API object that implements KDF2 per ISO 18033-2.
		 *
		 * @param md the hash API to use.
		 * @param [digestLength] an optional digest length that must be positive and
		 *          less than or equal to md.digestLength.
		 *
		 * @return a KDF2 API object.
		 */
		forge.kem.kdf2 = function(md, digestLength) {
		  _createKDF(this, md, 1, digestLength || md.digestLength);
		};

		/**
		 * Creates a KDF1 or KDF2 API object.
		 *
		 * @param md the hash API to use.
		 * @param counterStart the starting index for the counter.
		 * @param digestLength the digest length to use.
		 *
		 * @return the KDF API object.
		 */
		function _createKDF(kdf, md, counterStart, digestLength) {
		  /**
		   * Generate a key of the specified length.
		   *
		   * @param x the binary-encoded byte string to generate a key from.
		   * @param length the number of bytes to generate (the size of the key).
		   *
		   * @return the key as a binary-encoded string.
		   */
		  kdf.generate = function(x, length) {
		    var key = new forge.util.ByteBuffer();

		    // run counter from counterStart to ceil(length / Hash.len)
		    var k = Math.ceil(length / digestLength) + counterStart;

		    var c = new forge.util.ByteBuffer();
		    for(var i = counterStart; i < k; ++i) {
		      // I2OSP(i, 4): convert counter to an octet string of 4 octets
		      c.putInt32(i);

		      // digest 'x' and the counter and add the result to the key
		      md.start();
		      md.update(x + c.getBytes());
		      var hash = md.digest();
		      key.putBytes(hash.getBytes(digestLength));
		    }

		    // truncate to the correct key length
		    key.truncate(key.length() - length);
		    return key.getBytes();
		  };
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'kem';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/kem',['require', 'module', './util','./random','./jsbn'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Cross-browser support for logging in a web application.
		 *
		 * @author David I. Lehn <dlehn@digitalbazaar.com>
		 *
		 * Copyright (c) 2008-2013 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		/* LOG API */
		forge.log = forge.log || {};

		/**
		 * Application logging system.
		 *
		 * Each logger level available as it's own function of the form:
		 *   forge.log.level(category, args...)
		 * The category is an arbitrary string, and the args are the same as
		 * Firebug's console.log API. By default the call will be output as:
		 *   'LEVEL [category] <args[0]>, args[1], ...'
		 * This enables proper % formatting via the first argument.
		 * Each category is enabled by default but can be enabled or disabled with
		 * the setCategoryEnabled() function.
		 */
		// list of known levels
		forge.log.levels = [
		  'none', 'error', 'warning', 'info', 'debug', 'verbose', 'max'];
		// info on the levels indexed by name:
		//   index: level index
		//   name: uppercased display name
		var sLevelInfo = {};
		// list of loggers
		var sLoggers = [];
		/**
		 * Standard console logger. If no console support is enabled this will
		 * remain null. Check before using.
		 */
		var sConsoleLogger = null;

		// logger flags
		/**
		 * Lock the level at the current value. Used in cases where user config may
		 * set the level such that only critical messages are seen but more verbose
		 * messages are needed for debugging or other purposes.
		 */
		forge.log.LEVEL_LOCKED = (1 << 1);
		/**
		 * Always call log function. By default, the logging system will check the
		 * message level against logger.level before calling the log function. This
		 * flag allows the function to do its own check.
		 */
		forge.log.NO_LEVEL_CHECK = (1 << 2);
		/**
		 * Perform message interpolation with the passed arguments. "%" style
		 * fields in log messages will be replaced by arguments as needed. Some
		 * loggers, such as Firebug, may do this automatically. The original log
		 * message will be available as 'message' and the interpolated version will
		 * be available as 'fullMessage'.
		 */
		forge.log.INTERPOLATE = (1 << 3);

		// setup each log level
		for(var i = 0; i < forge.log.levels.length; ++i) {
		  var level = forge.log.levels[i];
		  sLevelInfo[level] = {
		    index: i,
		    name: level.toUpperCase()
		  };
		}

		/**
		 * Message logger. Will dispatch a message to registered loggers as needed.
		 *
		 * @param message message object
		 */
		forge.log.logMessage = function(message) {
		  var messageLevelIndex = sLevelInfo[message.level].index;
		  for(var i = 0; i < sLoggers.length; ++i) {
		    var logger = sLoggers[i];
		    if(logger.flags & forge.log.NO_LEVEL_CHECK) {
		      logger.f(message);
		    } else {
		      // get logger level
		      var loggerLevelIndex = sLevelInfo[logger.level].index;
		      // check level
		      if(messageLevelIndex <= loggerLevelIndex) {
		        // message critical enough, call logger
		        logger.f(logger, message);
		      }
		    }
		  }
		};

		/**
		 * Sets the 'standard' key on a message object to:
		 * "LEVEL [category] " + message
		 *
		 * @param message a message log object
		 */
		forge.log.prepareStandard = function(message) {
		  if(!('standard' in message)) {
		    message.standard =
		      sLevelInfo[message.level].name +
		      //' ' + +message.timestamp +
		      ' [' + message.category + '] ' +
		      message.message;
		  }
		};

		/**
		 * Sets the 'full' key on a message object to the original message
		 * interpolated via % formatting with the message arguments.
		 *
		 * @param message a message log object.
		 */
		forge.log.prepareFull = function(message) {
		  if(!('full' in message)) {
		    // copy args and insert message at the front
		    var args = [message.message];
		    args = args.concat([] || message['arguments']);
		    // format the message
		    message.full = forge.util.format.apply(this, args);
		  }
		};

		/**
		 * Applies both preparseStandard() and prepareFull() to a message object and
		 * store result in 'standardFull'.
		 *
		 * @param message a message log object.
		 */
		forge.log.prepareStandardFull = function(message) {
		  if(!('standardFull' in message)) {
		    // FIXME implement 'standardFull' logging
		    forge.log.prepareStandard(message);
		    message.standardFull = message.standard;
		  }
		};

		// create log level functions
		if(true) {
		  // levels for which we want functions
		  var levels = ['error', 'warning', 'info', 'debug', 'verbose'];
		  for(var i = 0; i < levels.length; ++i) {
		    // wrap in a function to ensure proper level var is passed
		    (function(level) {
		      // create function for this level
		      forge.log[level] = function(category, message/*, args...*/) {
		        // convert arguments to real array, remove category and message
		        var args = Array.prototype.slice.call(arguments).slice(2);
		        // create message object
		        // Note: interpolation and standard formatting is done lazily
		        var msg = {
		          timestamp: new Date(),
		          level: level,
		          category: category,
		          message: message,
		          'arguments': args
		          /*standard*/
		          /*full*/
		          /*fullMessage*/
		        };
		        // process this message
		        forge.log.logMessage(msg);
		      };
		    })(levels[i]);
		  }
		}

		/**
		 * Creates a new logger with specified custom logging function.
		 *
		 * The logging function has a signature of:
		 *   function(logger, message)
		 * logger: current logger
		 * message: object:
		 *   level: level id
		 *   category: category
		 *   message: string message
		 *   arguments: Array of extra arguments
		 *   fullMessage: interpolated message and arguments if INTERPOLATE flag set
		 *
		 * @param logFunction a logging function which takes a log message object
		 *          as a parameter.
		 *
		 * @return a logger object.
		 */
		forge.log.makeLogger = function(logFunction) {
		  var logger = {
		    flags: 0,
		    f: logFunction
		  };
		  forge.log.setLevel(logger, 'none');
		  return logger;
		};

		/**
		 * Sets the current log level on a logger.
		 *
		 * @param logger the target logger.
		 * @param level the new maximum log level as a string.
		 *
		 * @return true if set, false if not.
		 */
		forge.log.setLevel = function(logger, level) {
		  var rval = false;
		  if(logger && !(logger.flags & forge.log.LEVEL_LOCKED)) {
		    for(var i = 0; i < forge.log.levels.length; ++i) {
		      var aValidLevel = forge.log.levels[i];
		      if(level == aValidLevel) {
		        // set level
		        logger.level = level;
		        rval = true;
		        break;
		      }
		    }
		  }

		  return rval;
		};

		/**
		 * Locks the log level at its current value.
		 *
		 * @param logger the target logger.
		 * @param lock boolean lock value, default to true.
		 */
		forge.log.lock = function(logger, lock) {
		  if(typeof lock === 'undefined' || lock) {
		    logger.flags |= forge.log.LEVEL_LOCKED;
		  } else {
		    logger.flags &= ~forge.log.LEVEL_LOCKED;
		  }
		};

		/**
		 * Adds a logger.
		 *
		 * @param logger the logger object.
		 */
		forge.log.addLogger = function(logger) {
		  sLoggers.push(logger);
		};

		// setup the console logger if possible, else create fake console.log
		if(typeof(console) !== 'undefined' && 'log' in console) {
		  var logger;
		  if(console.error && console.warn && console.info && console.debug) {
		    // looks like Firebug-style logging is available
		    // level handlers map
		    var levelHandlers = {
		      error: console.error,
		      warning: console.warn,
		      info: console.info,
		      debug: console.debug,
		      verbose: console.debug
		    };
		    var f = function(logger, message) {
		      forge.log.prepareStandard(message);
		      var handler = levelHandlers[message.level];
		      // prepend standard message and concat args
		      var args = [message.standard];
		      args = args.concat(message['arguments'].slice());
		      // apply to low-level console function
		      handler.apply(console, args);
		    };
		    logger = forge.log.makeLogger(f);
		  } else {
		    // only appear to have basic console.log
		    var f = function(logger, message) {
		      forge.log.prepareStandardFull(message);
		      console.log(message.standardFull);
		    };
		    logger = forge.log.makeLogger(f);
		  }
		  forge.log.setLevel(logger, 'debug');
		  forge.log.addLogger(logger);
		  sConsoleLogger = logger;
		} else {
		  // define fake console.log to avoid potential script errors on
		  // browsers that do not have console logging
		  console = {
		    log: function() {}
		  };
		}

		/*
		 * Check for logging control query vars.
		 *
		 * console.level=<level-name>
		 * Set's the console log level by name.  Useful to override defaults and
		 * allow more verbose logging before a user config is loaded.
		 *
		 * console.lock=<true|false>
		 * Lock the console log level at whatever level it is set at.  This is run
		 * after console.level is processed.  Useful to force a level of verbosity
		 * that could otherwise be limited by a user config.
		 */
		if(sConsoleLogger !== null) {
		  var query = forge.util.getQueryVariables();
		  if('console.level' in query) {
		    // set with last value
		    forge.log.setLevel(
		      sConsoleLogger, query['console.level'].slice(-1)[0]);
		  }
		  if('console.lock' in query) {
		    // set with last value
		    var lock = query['console.lock'].slice(-1)[0];
		    if(lock == 'true') {
		      forge.log.lock(sConsoleLogger);
		    }
		  }
		}

		// provide public access to console logger
		forge.log.consoleLogger = sConsoleLogger;

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'log';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/log',['require', 'module', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Javascript implementation of PKCS#7 v1.5.
		 *
		 * @author Stefan Siegl
		 * @author Dave Longley
		 *
		 * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
		 * Copyright (c) 2012-2015 Digital Bazaar, Inc.
		 *
		 * Currently this implementation only supports ContentType of EnvelopedData,
		 * EncryptedData, or SignedData at the root level. The top level elements may
		 * contain only a ContentInfo of ContentType Data, i.e. plain data. Further
		 * nesting is not (yet) supported.
		 *
		 * The Forge validators for PKCS #7's ASN.1 structures are available from
		 * a separate file pkcs7asn1.js, since those are referenced from other
		 * PKCS standards like PKCS #12.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// shortcut for ASN.1 API
		var asn1 = forge.asn1;

		// shortcut for PKCS#7 API
		var p7 = forge.pkcs7 = forge.pkcs7 || {};

		/**
		 * Converts a PKCS#7 message from PEM format.
		 *
		 * @param pem the PEM-formatted PKCS#7 message.
		 *
		 * @return the PKCS#7 message.
		 */
		p7.messageFromPem = function(pem) {
		  var msg = forge.pem.decode(pem)[0];

		  if(msg.type !== 'PKCS7') {
		    var error = new Error('Could not convert PKCS#7 message from PEM; PEM ' +
		      'header type is not "PKCS#7".');
		    error.headerType = msg.type;
		    throw error;
		  }
		  if(msg.procType && msg.procType.type === 'ENCRYPTED') {
		    throw new Error('Could not convert PKCS#7 message from PEM; PEM is encrypted.');
		  }

		  // convert DER to ASN.1 object
		  var obj = asn1.fromDer(msg.body);

		  return p7.messageFromAsn1(obj);
		};

		/**
		 * Converts a PKCS#7 message to PEM format.
		 *
		 * @param msg The PKCS#7 message object
		 * @param maxline The maximum characters per line, defaults to 64.
		 *
		 * @return The PEM-formatted PKCS#7 message.
		 */
		p7.messageToPem = function(msg, maxline) {
		  // convert to ASN.1, then DER, then PEM-encode
		  var pemObj = {
		    type: 'PKCS7',
		    body: asn1.toDer(msg.toAsn1()).getBytes()
		  };
		  return forge.pem.encode(pemObj, {maxline: maxline});
		};

		/**
		 * Converts a PKCS#7 message from an ASN.1 object.
		 *
		 * @param obj the ASN.1 representation of a ContentInfo.
		 *
		 * @return the PKCS#7 message.
		 */
		p7.messageFromAsn1 = function(obj) {
		  // validate root level ContentInfo and capture data
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, p7.asn1.contentInfoValidator, capture, errors))
		  {
		    var error = new Error('Cannot read PKCS#7 message. ' +
		      'ASN.1 object is not an PKCS#7 ContentInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  var contentType = asn1.derToOid(capture.contentType);
		  var msg;

		  switch(contentType) {
		    case forge.pki.oids.envelopedData:
		      msg = p7.createEnvelopedData();
		      break;

		    case forge.pki.oids.encryptedData:
		      msg = p7.createEncryptedData();
		      break;

		    case forge.pki.oids.signedData:
		      msg = p7.createSignedData();
		      break;

		    default:
		      throw new Error('Cannot read PKCS#7 message. ContentType with OID ' +
		        contentType + ' is not (yet) supported.');
		  }

		  msg.fromAsn1(capture.content.value[0]);
		  return msg;
		};

		p7.createSignedData = function() {
		  var msg = null;
		  msg = {
		    type: forge.pki.oids.signedData,
		    version: 1,
		    certificates: [],
		    crls: [],
		    // TODO: add json-formatted signer stuff here?
		    signers: [],
		    // populated during sign()
		    digestAlgorithmIdentifiers: [],
		    contentInfo: null,
		    signerInfos: [],

		    fromAsn1: function(obj) {
		      // validate SignedData content block and capture data.
		      _fromAsn1(msg, obj, p7.asn1.signedDataValidator);
		      msg.certificates = [];
		      msg.crls = [];
		      msg.digestAlgorithmIdentifiers = [];
		      msg.contentInfo = null;
		      msg.signerInfos = [];

		      var certs = msg.rawCapture.certificates.value;
		      for(var i = 0; i < certs.length; ++i) {
		        msg.certificates.push(forge.pki.certificateFromAsn1(certs[i]));
		      }

		      // TODO: parse crls
		    },

		    toAsn1: function() {
		      // degenerate case with no content
		      if(!msg.contentInfo) {
		        msg.sign();
		      }

		      var certs = [];
		      for(var i = 0; i < msg.certificates.length; ++i) {
		        certs.push(forge.pki.certificateToAsn1(msg.certificates[i]));
		      }

		      var crls = [];
		      // TODO: implement CRLs

		      // [0] SignedData
		      var signedData = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          // Version
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		            asn1.integerToDer(msg.version).getBytes()),
		          // DigestAlgorithmIdentifiers
		          asn1.create(
		            asn1.Class.UNIVERSAL, asn1.Type.SET, true,
		            msg.digestAlgorithmIdentifiers),
		          // ContentInfo
		          msg.contentInfo
		        ])
		      ]);
		      if(certs.length > 0) {
		        // [0] IMPLICIT ExtendedCertificatesAndCertificates OPTIONAL
		        signedData.value[0].value.push(
		          asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, certs));
		      }
		      if(crls.length > 0) {
		        // [1] IMPLICIT CertificateRevocationLists OPTIONAL
		        signedData.value[0].value.push(
		          asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, crls));
		      }
		      // SignerInfos
		      signedData.value[0].value.push(
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,
		          msg.signerInfos));

		      // ContentInfo
		      return asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          // ContentType
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(msg.type).getBytes()),
		          // [0] SignedData
		          signedData
		        ]);
		    },

		    /**
		     * Add (another) entity to list of signers.
		     *
		     * Note: If authenticatedAttributes are provided, then, per RFC 2315,
		     * they must include at least two attributes: content type and
		     * message digest. The message digest attribute value will be
		     * auto-calculated during signing and will be ignored if provided.
		     *
		     * Here's an example of providing these two attributes:
		     *
		     * forge.pkcs7.createSignedData();
		     * p7.addSigner({
		     *   issuer: cert.issuer.attributes,
		     *   serialNumber: cert.serialNumber,
		     *   key: privateKey,
		     *   digestAlgorithm: forge.pki.oids.sha1,
		     *   authenticatedAttributes: [{
		     *     type: forge.pki.oids.contentType,
		     *     value: forge.pki.oids.data
		     *   }, {
		     *     type: forge.pki.oids.messageDigest
		     *   }]
		     * });
		     *
		     * TODO: Support [subjectKeyIdentifier] as signer's ID.
		     *
		     * @param signer the signer information:
		     *          key the signer's private key.
		     *          [certificate] a certificate containing the public key
		     *            associated with the signer's private key; use this option as
		     *            an alternative to specifying signer.issuer and
		     *            signer.serialNumber.
		     *          [issuer] the issuer attributes (eg: cert.issuer.attributes).
		     *          [serialNumber] the signer's certificate's serial number in
		     *           hexadecimal (eg: cert.serialNumber).
		     *          [digestAlgorithm] the message digest OID, as a string, to use
		     *            (eg: forge.pki.oids.sha1).
		     *          [authenticatedAttributes] an optional array of attributes
		     *            to also sign along with the content.
		     */
		    addSigner: function(signer) {
		      var issuer = signer.issuer;
		      var serialNumber = signer.serialNumber;
		      if(signer.certificate) {
		        var cert = signer.certificate;
		        if(typeof cert === 'string') {
		          cert = forge.pki.certificateFromPem(cert);
		        }
		        issuer = cert.issuer.attributes;
		        serialNumber = cert.serialNumber;
		      }
		      var key = signer.key;
		      if(!key) {
		        throw new Error(
		          'Could not add PKCS#7 signer; no private key specified.');
		      }
		      if(typeof key === 'string') {
		        key = forge.pki.privateKeyFromPem(key);
		      }

		      // ensure OID known for digest algorithm
		      var digestAlgorithm = signer.digestAlgorithm || forge.pki.oids.sha1;
		      switch(digestAlgorithm) {
		      case forge.pki.oids.sha1:
		      case forge.pki.oids.sha256:
		      case forge.pki.oids.sha384:
		      case forge.pki.oids.sha512:
		      case forge.pki.oids.md5:
		        break;
		      default:
		        throw new Error(
		          'Could not add PKCS#7 signer; unknown message digest algorithm: ' +
		          digestAlgorithm);
		      }

		      // if authenticatedAttributes is present, then the attributes
		      // must contain at least PKCS #9 content-type and message-digest
		      var authenticatedAttributes = signer.authenticatedAttributes || [];
		      if(authenticatedAttributes.length > 0) {
		        var contentType = false;
		        var messageDigest = false;
		        for(var i = 0; i < authenticatedAttributes.length; ++i) {
		          var attr = authenticatedAttributes[i];
		          if(!contentType && attr.type === forge.pki.oids.contentType) {
		            contentType = true;
		            if(messageDigest) {
		              break;
		            }
		            continue;
		          }
		          if(!messageDigest && attr.type === forge.pki.oids.messageDigest) {
		            messageDigest = true;
		            if(contentType) {
		              break;
		            }
		            continue;
		          }
		        }

		        if(!contentType || !messageDigest) {
		          throw new Error('Invalid signer.authenticatedAttributes. If ' +
		            'signer.authenticatedAttributes is specified, then it must ' +
		            'contain at least two attributes, PKCS #9 content-type and ' +
		            'PKCS #9 message-digest.');
		        }
		      }

		      msg.signers.push({
		        key: key,
		        version: 1,
		        issuer: issuer,
		        serialNumber: serialNumber,
		        digestAlgorithm: digestAlgorithm,
		        signatureAlgorithm: forge.pki.oids.rsaEncryption,
		        signature: null,
		        authenticatedAttributes: authenticatedAttributes,
		        unauthenticatedAttributes: []
		      });
		    },

		    /**
		     * Signs the content.
		     */
		    sign: function() {
		      // auto-generate content info
		      if(typeof msg.content !== 'object' || msg.contentInfo === null) {
		        // use Data ContentInfo
		        msg.contentInfo = asn1.create(
		          asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		            // ContentType
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		              asn1.oidToDer(forge.pki.oids.data).getBytes())
		          ]);

		        // add actual content, if present
		        if('content' in msg) {
		          var content;
		          if(msg.content instanceof forge.util.ByteBuffer) {
		            content = msg.content.bytes();
		          } else if(typeof msg.content === 'string') {
		            content = forge.util.encodeUtf8(msg.content);
		          }

		          msg.contentInfo.value.push(
		            // [0] EXPLICIT content
		            asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		              asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		                content)
		            ]));
		        }
		      }

		      // no signers, return early (degenerate case for certificate container)
		      if(msg.signers.length === 0) {
		        return;
		      }

		      // generate digest algorithm identifiers
		      var mds = addDigestAlgorithmIds();

		      // generate signerInfos
		      addSignerInfos(mds);
		    },

		    verify: function() {
		      throw new Error('PKCS#7 signature verification not yet implemented.');
		    },

		    /**
		     * Add a certificate.
		     *
		     * @param cert the certificate to add.
		     */
		    addCertificate: function(cert) {
		      // convert from PEM
		      if(typeof cert === 'string') {
		        cert = forge.pki.certificateFromPem(cert);
		      }
		      msg.certificates.push(cert);
		    },

		    /**
		     * Add a certificate revokation list.
		     *
		     * @param crl the certificate revokation list to add.
		     */
		    addCertificateRevokationList: function(crl) {
		      throw new Error('PKCS#7 CRL support not yet implemented.');
		    }
		  };
		  return msg;

		  function addDigestAlgorithmIds() {
		    var mds = {};

		    for(var i = 0; i < msg.signers.length; ++i) {
		      var signer = msg.signers[i];
		      var oid = signer.digestAlgorithm;
		      if(!(oid in mds)) {
		        // content digest
		        mds[oid] = forge.md[forge.pki.oids[oid]].create();
		      }
		      if(signer.authenticatedAttributes.length === 0) {
		        // no custom attributes to digest; use content message digest
		        signer.md = mds[oid];
		      } else {
		        // custom attributes to be digested; use own message digest
		        // TODO: optimize to just copy message digest state if that
		        // feature is ever supported with message digests
		        signer.md = forge.md[forge.pki.oids[oid]].create();
		      }
		    }

		    // add unique digest algorithm identifiers
		    msg.digestAlgorithmIdentifiers = [];
		    for(var oid in mds) {
		      msg.digestAlgorithmIdentifiers.push(
		        // AlgorithmIdentifier
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		          // algorithm
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		            asn1.oidToDer(oid).getBytes()),
		          // parameters (null)
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		        ]));
		    }

		    return mds;
		  }

		  function addSignerInfos(mds) {
		    // Note: ContentInfo is a SEQUENCE with 2 values, second value is
		    // the content field and is optional for a ContentInfo but required here
		    // since signers are present
		    if(msg.contentInfo.value.length < 2) {
		      throw new Error(
		        'Could not sign PKCS#7 message; there is no content to sign.');
		    }

		    // get ContentInfo content type
		    var contentType = asn1.derToOid(msg.contentInfo.value[0].value);

		    // get ContentInfo content
		    var content = msg.contentInfo.value[1];
		    // skip [0] EXPLICIT content wrapper
		    content = content.value[0];

		    // serialize content
		    var bytes = asn1.toDer(content);

		    // skip identifier and length per RFC 2315 9.3
		    // skip identifier (1 byte)
		    bytes.getByte();
		    // read and discard length bytes
		    asn1.getBerValueLength(bytes);
		    bytes = bytes.getBytes();

		    // digest content DER value bytes
		    for(var oid in mds) {
		      mds[oid].start().update(bytes);
		    }

		    // sign content
		    var signingTime = new Date();
		    for(var i = 0; i < msg.signers.length; ++i) {
		      var signer = msg.signers[i];

		      if(signer.authenticatedAttributes.length === 0) {
		        // if ContentInfo content type is not "Data", then
		        // authenticatedAttributes must be present per RFC 2315
		        if(contentType !== forge.pki.oids.data) {
		          throw new Error(
		            'Invalid signer; authenticatedAttributes must be present ' +
		            'when the ContentInfo content type is not PKCS#7 Data.');
		        }
		      } else {
		        // process authenticated attributes
		        // [0] IMPLICIT
		        signer.authenticatedAttributesAsn1 = asn1.create(
		          asn1.Class.CONTEXT_SPECIFIC, 0, true, []);

		        // per RFC 2315, attributes are to be digested using a SET container
		        // not the above [0] IMPLICIT container
		        var attrsAsn1 = asn1.create(
		          asn1.Class.UNIVERSAL, asn1.Type.SET, true, []);

		        for(var ai = 0; ai < signer.authenticatedAttributes.length; ++ai) {
		          var attr = signer.authenticatedAttributes[ai];
		          if(attr.type === forge.pki.oids.messageDigest) {
		            // use content message digest as value
		            attr.value = mds[signer.digestAlgorithm].digest();
		          } else if(attr.type === forge.pki.oids.signingTime) {
		            // auto-populate signing time if not already set
		            if(!attr.value) {
		              attr.value = signingTime;
		            }
		          }

		          // convert to ASN.1 and push onto Attributes SET (for signing) and
		          // onto authenticatedAttributesAsn1 to complete SignedData ASN.1
		          // TODO: optimize away duplication
		          attrsAsn1.value.push(_attributeToAsn1(attr));
		          signer.authenticatedAttributesAsn1.value.push(_attributeToAsn1(attr));
		        }

		        // DER-serialize and digest SET OF attributes only
		        bytes = asn1.toDer(attrsAsn1).getBytes();
		        signer.md.start().update(bytes);
		      }

		      // sign digest
		      signer.signature = signer.key.sign(signer.md, 'RSASSA-PKCS1-V1_5');
		    }

		    // add signer info
		    msg.signerInfos = _signersToAsn1(msg.signers);
		  }
		};

		/**
		 * Creates an empty PKCS#7 message of type EncryptedData.
		 *
		 * @return the message.
		 */
		p7.createEncryptedData = function() {
		  var msg = null;
		  msg = {
		    type: forge.pki.oids.encryptedData,
		    version: 0,
		    encryptedContent: {
		      algorithm: forge.pki.oids['aes256-CBC']
		    },

		    /**
		     * Reads an EncryptedData content block (in ASN.1 format)
		     *
		     * @param obj The ASN.1 representation of the EncryptedData content block
		     */
		    fromAsn1: function(obj) {
		      // Validate EncryptedData content block and capture data.
		      _fromAsn1(msg, obj, p7.asn1.encryptedDataValidator);
		    },

		    /**
		     * Decrypt encrypted content
		     *
		     * @param key The (symmetric) key as a byte buffer
		     */
		    decrypt: function(key) {
		      if(key !== undefined) {
		        msg.encryptedContent.key = key;
		      }
		      _decryptContent(msg);
		    }
		  };
		  return msg;
		};

		/**
		 * Creates an empty PKCS#7 message of type EnvelopedData.
		 *
		 * @return the message.
		 */
		p7.createEnvelopedData = function() {
		  var msg = null;
		  msg = {
		    type: forge.pki.oids.envelopedData,
		    version: 0,
		    recipients: [],
		    encryptedContent: {
		      algorithm: forge.pki.oids['aes256-CBC']
		    },

		    /**
		     * Reads an EnvelopedData content block (in ASN.1 format)
		     *
		     * @param obj the ASN.1 representation of the EnvelopedData content block.
		     */
		    fromAsn1: function(obj) {
		      // validate EnvelopedData content block and capture data
		      var capture = _fromAsn1(msg, obj, p7.asn1.envelopedDataValidator);
		      msg.recipients = _recipientsFromAsn1(capture.recipientInfos.value);
		    },

		    toAsn1: function() {
		      // ContentInfo
		      return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		        // ContentType
		        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		          asn1.oidToDer(msg.type).getBytes()),
		        // [0] EnvelopedData
		        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		            // Version
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		              asn1.integerToDer(msg.version).getBytes()),
		            // RecipientInfos
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,
		              _recipientsToAsn1(msg.recipients)),
		            // EncryptedContentInfo
		            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true,
		              _encryptedContentToAsn1(msg.encryptedContent))
		          ])
		        ])
		      ]);
		    },

		    /**
		     * Find recipient by X.509 certificate's issuer.
		     *
		     * @param cert the certificate with the issuer to look for.
		     *
		     * @return the recipient object.
		     */
		    findRecipient: function(cert) {
		      var sAttr = cert.issuer.attributes;

		      for(var i = 0; i < msg.recipients.length; ++i) {
		        var r = msg.recipients[i];
		        var rAttr = r.issuer;

		        if(r.serialNumber !== cert.serialNumber) {
		          continue;
		        }

		        if(rAttr.length !== sAttr.length) {
		          continue;
		        }

		        var match = true;
		        for(var j = 0; j < sAttr.length; ++j) {
		          if(rAttr[j].type !== sAttr[j].type ||
		            rAttr[j].value !== sAttr[j].value) {
		            match = false;
		            break;
		          }
		        }

		        if(match) {
		          return r;
		        }
		      }

		      return null;
		    },

		    /**
		     * Decrypt enveloped content
		     *
		     * @param recipient The recipient object related to the private key
		     * @param privKey The (RSA) private key object
		     */
		    decrypt: function(recipient, privKey) {
		      if(msg.encryptedContent.key === undefined && recipient !== undefined &&
		        privKey !== undefined) {
		        switch(recipient.encryptedContent.algorithm) {
		          case forge.pki.oids.rsaEncryption:
		          case forge.pki.oids.desCBC:
		            var key = privKey.decrypt(recipient.encryptedContent.content);
		            msg.encryptedContent.key = forge.util.createBuffer(key);
		            break;

		          default:
		            throw new Error('Unsupported asymmetric cipher, ' +
		              'OID ' + recipient.encryptedContent.algorithm);
		        }
		      }

		      _decryptContent(msg);
		    },

		    /**
		     * Add (another) entity to list of recipients.
		     *
		     * @param cert The certificate of the entity to add.
		     */
		    addRecipient: function(cert) {
		      msg.recipients.push({
		        version: 0,
		        issuer: cert.issuer.attributes,
		        serialNumber: cert.serialNumber,
		        encryptedContent: {
		          // We simply assume rsaEncryption here, since forge.pki only
		          // supports RSA so far.  If the PKI module supports other
		          // ciphers one day, we need to modify this one as well.
		          algorithm: forge.pki.oids.rsaEncryption,
		          key: cert.publicKey
		        }
		      });
		    },

		    /**
		     * Encrypt enveloped content.
		     *
		     * This function supports two optional arguments, cipher and key, which
		     * can be used to influence symmetric encryption.  Unless cipher is
		     * provided, the cipher specified in encryptedContent.algorithm is used
		     * (defaults to AES-256-CBC).  If no key is provided, encryptedContent.key
		     * is (re-)used.  If that one's not set, a random key will be generated
		     * automatically.
		     *
		     * @param [key] The key to be used for symmetric encryption.
		     * @param [cipher] The OID of the symmetric cipher to use.
		     */
		    encrypt: function(key, cipher) {
		      // Part 1: Symmetric encryption
		      if(msg.encryptedContent.content === undefined) {
		        cipher = cipher || msg.encryptedContent.algorithm;
		        key = key || msg.encryptedContent.key;

		        var keyLen, ivLen, ciphFn;
		        switch(cipher) {
		          case forge.pki.oids['aes128-CBC']:
		            keyLen = 16;
		            ivLen = 16;
		            ciphFn = forge.aes.createEncryptionCipher;
		            break;

		          case forge.pki.oids['aes192-CBC']:
		            keyLen = 24;
		            ivLen = 16;
		            ciphFn = forge.aes.createEncryptionCipher;
		            break;

		          case forge.pki.oids['aes256-CBC']:
		            keyLen = 32;
		            ivLen = 16;
		            ciphFn = forge.aes.createEncryptionCipher;
		            break;

		          case forge.pki.oids['des-EDE3-CBC']:
		            keyLen = 24;
		            ivLen = 8;
		            ciphFn = forge.des.createEncryptionCipher;
		            break;

		          default:
		            throw new Error('Unsupported symmetric cipher, OID ' + cipher);
		        }

		        if(key === undefined) {
		          key = forge.util.createBuffer(forge.random.getBytes(keyLen));
		        } else if(key.length() != keyLen) {
		          throw new Error('Symmetric key has wrong length; ' +
		            'got ' + key.length() + ' bytes, expected ' + keyLen + '.');
		        }

		        // Keep a copy of the key & IV in the object, so the caller can
		        // use it for whatever reason.
		        msg.encryptedContent.algorithm = cipher;
		        msg.encryptedContent.key = key;
		        msg.encryptedContent.parameter = forge.util.createBuffer(
		          forge.random.getBytes(ivLen));

		        var ciph = ciphFn(key);
		        ciph.start(msg.encryptedContent.parameter.copy());
		        ciph.update(msg.content);

		        // The finish function does PKCS#7 padding by default, therefore
		        // no action required by us.
		        if(!ciph.finish()) {
		          throw new Error('Symmetric encryption failed.');
		        }

		        msg.encryptedContent.content = ciph.output;
		      }

		      // Part 2: asymmetric encryption for each recipient
		      for(var i = 0; i < msg.recipients.length; ++i) {
		        var recipient = msg.recipients[i];

		        // Nothing to do, encryption already done.
		        if(recipient.encryptedContent.content !== undefined) {
		          continue;
		        }

		        switch(recipient.encryptedContent.algorithm) {
		          case forge.pki.oids.rsaEncryption:
		            recipient.encryptedContent.content =
		              recipient.encryptedContent.key.encrypt(
		                msg.encryptedContent.key.data);
		            break;

		          default:
		            throw new Error('Unsupported asymmetric cipher, OID ' +
		              recipient.encryptedContent.algorithm);
		        }
		      }
		    }
		  };
		  return msg;
		};

		/**
		 * Converts a single recipient from an ASN.1 object.
		 *
		 * @param obj the ASN.1 RecipientInfo.
		 *
		 * @return the recipient object.
		 */
		function _recipientFromAsn1(obj) {
		  // validate EnvelopedData content block and capture data
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, p7.asn1.recipientInfoValidator, capture, errors)) {
		    var error = new Error('Cannot read PKCS#7 RecipientInfo. ' +
		      'ASN.1 object is not an PKCS#7 RecipientInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  return {
		    version: capture.version.charCodeAt(0),
		    issuer: forge.pki.RDNAttributesAsArray(capture.issuer),
		    serialNumber: forge.util.createBuffer(capture.serial).toHex(),
		    encryptedContent: {
		      algorithm: asn1.derToOid(capture.encAlgorithm),
		      parameter: capture.encParameter.value,
		      content: capture.encKey
		    }
		  };
		}

		/**
		 * Converts a single recipient object to an ASN.1 object.
		 *
		 * @param obj the recipient object.
		 *
		 * @return the ASN.1 RecipientInfo.
		 */
		function _recipientToAsn1(obj) {
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // Version
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      asn1.integerToDer(obj.version).getBytes()),
		    // IssuerAndSerialNumber
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // Name
		      forge.pki.distinguishedNameToAsn1({attributes: obj.issuer}),
		      // Serial
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		        forge.util.hexToBytes(obj.serialNumber))
		    ]),
		    // KeyEncryptionAlgorithmIdentifier
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // Algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(obj.encryptedContent.algorithm).getBytes()),
		      // Parameter, force NULL, only RSA supported for now.
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		    ]),
		    // EncryptedKey
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		      obj.encryptedContent.content)
		  ]);
		}

		/**
		 * Map a set of RecipientInfo ASN.1 objects to recipient objects.
		 *
		 * @param infos an array of ASN.1 representations RecipientInfo (i.e. SET OF).
		 *
		 * @return an array of recipient objects.
		 */
		function _recipientsFromAsn1(infos) {
		  var ret = [];
		  for(var i = 0; i < infos.length; ++i) {
		    ret.push(_recipientFromAsn1(infos[i]));
		  }
		  return ret;
		}

		/**
		 * Map an array of recipient objects to ASN.1 RecipientInfo objects.
		 *
		 * @param recipients an array of recipientInfo objects.
		 *
		 * @return an array of ASN.1 RecipientInfos.
		 */
		function _recipientsToAsn1(recipients) {
		  var ret = [];
		  for(var i = 0; i < recipients.length; ++i) {
		    ret.push(_recipientToAsn1(recipients[i]));
		  }
		  return ret;
		}

		/**
		 * Converts a single signer from an ASN.1 object.
		 *
		 * @param obj the ASN.1 representation of a SignerInfo.
		 *
		 * @return the signer object.
		 */
		function _signerFromAsn1(obj) {
		  // validate EnvelopedData content block and capture data
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, p7.asn1.signerInfoValidator, capture, errors)) {
		    var error = new Error('Cannot read PKCS#7 SignerInfo. ' +
		      'ASN.1 object is not an PKCS#7 SignerInfo.');
		    error.errors = errors;
		    throw error;
		  }

		  var rval = {
		    version: capture.version.charCodeAt(0),
		    issuer: forge.pki.RDNAttributesAsArray(capture.issuer),
		    serialNumber: forge.util.createBuffer(capture.serial).toHex(),
		    digestAlgorithm: asn1.derToOid(capture.digestAlgorithm),
		    signatureAlgorithm: asn1.derToOid(capture.signatureAlgorithm),
		    signature: capture.signature,
		    authenticatedAttributes: [],
		    unauthenticatedAttributes: []
		  };

		  // TODO: convert attributes
		  var authenticatedAttributes = capture.authenticatedAttributes || [];
		  var unauthenticatedAttributes = capture.unauthenticatedAttributes || [];

		  return rval;
		}

		/**
		 * Converts a single signerInfo object to an ASN.1 object.
		 *
		 * @param obj the signerInfo object.
		 *
		 * @return the ASN.1 representation of a SignerInfo.
		 */
		function _signerToAsn1(obj) {
		  // SignerInfo
		  var rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // version
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		      asn1.integerToDer(obj.version).getBytes()),
		    // issuerAndSerialNumber
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // name
		      forge.pki.distinguishedNameToAsn1({attributes: obj.issuer}),
		      // serial
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,
		        forge.util.hexToBytes(obj.serialNumber))
		    ]),
		    // digestAlgorithm
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(obj.digestAlgorithm).getBytes()),
		      // parameters (null)
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		    ])
		  ]);

		  // authenticatedAttributes (OPTIONAL)
		  if(obj.authenticatedAttributesAsn1) {
		    // add ASN.1 previously generated during signing
		    rval.value.push(obj.authenticatedAttributesAsn1);
		  }

		  // digestEncryptionAlgorithm
		  rval.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // algorithm
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		      asn1.oidToDer(obj.signatureAlgorithm).getBytes()),
		    // parameters (null)
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')
		  ]));

		  // encryptedDigest
		  rval.value.push(asn1.create(
		    asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, obj.signature));

		  // unauthenticatedAttributes (OPTIONAL)
		  if(obj.unauthenticatedAttributes.length > 0) {
		    // [1] IMPLICIT
		    var attrsAsn1 = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, []);
		    for(var i = 0; i < obj.unauthenticatedAttributes.length; ++i) {
		      var attr = obj.unauthenticatedAttributes[i];
		      attrsAsn1.values.push(_attributeToAsn1(attr));
		    }
		    rval.value.push(attrsAsn1);
		  }

		  return rval;
		}

		/**
		 * Map a set of SignerInfo ASN.1 objects to an array of signer objects.
		 *
		 * @param signerInfoAsn1s an array of ASN.1 SignerInfos (i.e. SET OF).
		 *
		 * @return an array of signers objects.
		 */
		function _signersFromAsn1(signerInfoAsn1s) {
		  var ret = [];
		  for(var i = 0; i < signerInfoAsn1s.length; ++i) {
		    ret.push(_signerFromAsn1(signerInfoAsn1s[i]));
		  }
		  return ret;
		}

		/**
		 * Map an array of signer objects to ASN.1 objects.
		 *
		 * @param signers an array of signer objects.
		 *
		 * @return an array of ASN.1 SignerInfos.
		 */
		function _signersToAsn1(signers) {
		  var ret = [];
		  for(var i = 0; i < signers.length; ++i) {
		    ret.push(_signerToAsn1(signers[i]));
		  }
		  return ret;
		}

		/**
		 * Convert an attribute object to an ASN.1 Attribute.
		 *
		 * @param attr the attribute object.
		 *
		 * @return the ASN.1 Attribute.
		 */
		function _attributeToAsn1(attr) {
		  var value;

		  // TODO: generalize to support more attributes
		  if(attr.type === forge.pki.oids.contentType) {
		    value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		      asn1.oidToDer(attr.value).getBytes());
		  } else if(attr.type === forge.pki.oids.messageDigest) {
		    value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		      attr.value.bytes());
		  } else if(attr.type === forge.pki.oids.signingTime) {
		    /* Note per RFC 2985: Dates between 1 January 1950 and 31 December 2049
		      (inclusive) MUST be encoded as UTCTime. Any dates with year values
		      before 1950 or after 2049 MUST be encoded as GeneralizedTime. [Further,]
		      UTCTime values MUST be expressed in Greenwich Mean Time (Zulu) and MUST
		      include seconds (i.e., times are YYMMDDHHMMSSZ), even where the
		      number of seconds is zero.  Midnight (GMT) must be represented as
		      "YYMMDD000000Z". */
		    // TODO: make these module-level constants
		    var jan_1_1950 = new Date('Jan 1, 1950 00:00:00Z');
		    var jan_1_2050 = new Date('Jan 1, 2050 00:00:00Z');
		    var date = attr.value;
		    if(typeof date === 'string') {
		      // try to parse date
		      var timestamp = Date.parse(date);
		      if(!isNaN(timestamp)) {
		        date = new Date(timestamp);
		      } else if(date.length === 13) {
		        // YYMMDDHHMMSSZ (13 chars for UTCTime)
		        date = asn1.utcTimeToDate(date);
		      } else {
		        // assume generalized time
		        date = asn1.generalizedTimeToDate(date);
		      }
		    }

		    if(date >= jan_1_1950 && date < jan_1_2050) {
		      value = asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,
		        asn1.dateToUtcTime(date));
		    } else {
		      value = asn1.create(
		        asn1.Class.UNIVERSAL, asn1.Type.GENERALIZEDTIME, false,
		        asn1.dateToGeneralizedTime(date));
		    }
		  }

		  // TODO: expose as common API call
		  // create a RelativeDistinguishedName set
		  // each value in the set is an AttributeTypeAndValue first
		  // containing the type (an OID) and second the value
		  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		    // AttributeType
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		      asn1.oidToDer(attr.type).getBytes()),
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [
		      // AttributeValue
		      value
		    ])
		  ]);
		}

		/**
		 * Map messages encrypted content to ASN.1 objects.
		 *
		 * @param ec The encryptedContent object of the message.
		 *
		 * @return ASN.1 representation of the encryptedContent object (SEQUENCE).
		 */
		function _encryptedContentToAsn1(ec) {
		  return [
		    // ContentType, always Data for the moment
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		      asn1.oidToDer(forge.pki.oids.data).getBytes()),
		    // ContentEncryptionAlgorithmIdentifier
		    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [
		      // Algorithm
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,
		        asn1.oidToDer(ec.algorithm).getBytes()),
		      // Parameters (IV)
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		        ec.parameter.getBytes())
		    ]),
		    // [0] EncryptedContent
		    asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [
		      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,
		        ec.content.getBytes())
		    ])
		  ];
		}

		/**
		 * Reads the "common part" of an PKCS#7 content block (in ASN.1 format)
		 *
		 * This function reads the "common part" of the PKCS#7 content blocks
		 * EncryptedData and EnvelopedData, i.e. version number and symmetrically
		 * encrypted content block.
		 *
		 * The result of the ASN.1 validate and capture process is returned
		 * to allow the caller to extract further data, e.g. the list of recipients
		 * in case of a EnvelopedData object.
		 *
		 * @param msg the PKCS#7 object to read the data to.
		 * @param obj the ASN.1 representation of the content block.
		 * @param validator the ASN.1 structure validator object to use.
		 *
		 * @return the value map captured by validator object.
		 */
		function _fromAsn1(msg, obj, validator) {
		  var capture = {};
		  var errors = [];
		  if(!asn1.validate(obj, validator, capture, errors)) {
		    var error = new Error('Cannot read PKCS#7 message. ' +
		      'ASN.1 object is not a supported PKCS#7 message.');
		    error.errors = error;
		    throw error;
		  }

		  // Check contentType, so far we only support (raw) Data.
		  var contentType = asn1.derToOid(capture.contentType);
		  if(contentType !== forge.pki.oids.data) {
		    throw new Error('Unsupported PKCS#7 message. ' +
		      'Only wrapped ContentType Data supported.');
		  }

		  if(capture.encryptedContent) {
		    var content = '';
		    if(forge.util.isArray(capture.encryptedContent)) {
		      for(var i = 0; i < capture.encryptedContent.length; ++i) {
		        if(capture.encryptedContent[i].type !== asn1.Type.OCTETSTRING) {
		          throw new Error('Malformed PKCS#7 message, expecting encrypted ' +
		            'content constructed of only OCTET STRING objects.');
		        }
		        content += capture.encryptedContent[i].value;
		      }
		    } else {
		      content = capture.encryptedContent;
		    }
		    msg.encryptedContent = {
		      algorithm: asn1.derToOid(capture.encAlgorithm),
		      parameter: forge.util.createBuffer(capture.encParameter.value),
		      content: forge.util.createBuffer(content)
		    };
		  }

		  if(capture.content) {
		    var content = '';
		    if(forge.util.isArray(capture.content)) {
		      for(var i = 0; i < capture.content.length; ++i) {
		        if(capture.content[i].type !== asn1.Type.OCTETSTRING) {
		          throw new Error('Malformed PKCS#7 message, expecting ' +
		            'content constructed of only OCTET STRING objects.');
		        }
		        content += capture.content[i].value;
		      }
		    } else {
		      content = capture.content;
		    }
		    msg.content = forge.util.createBuffer(content);
		  }

		  msg.version = capture.version.charCodeAt(0);
		  msg.rawCapture = capture;

		  return capture;
		}

		/**
		 * Decrypt the symmetrically encrypted content block of the PKCS#7 message.
		 *
		 * Decryption is skipped in case the PKCS#7 message object already has a
		 * (decrypted) content attribute.  The algorithm, key and cipher parameters
		 * (probably the iv) are taken from the encryptedContent attribute of the
		 * message object.
		 *
		 * @param The PKCS#7 message object.
		 */
		function _decryptContent(msg) {
		  if(msg.encryptedContent.key === undefined) {
		    throw new Error('Symmetric key not available.');
		  }

		  if(msg.content === undefined) {
		    var ciph;

		    switch(msg.encryptedContent.algorithm) {
		      case forge.pki.oids['aes128-CBC']:
		      case forge.pki.oids['aes192-CBC']:
		      case forge.pki.oids['aes256-CBC']:
		        ciph = forge.aes.createDecryptionCipher(msg.encryptedContent.key);
		        break;

		      case forge.pki.oids['desCBC']:
		      case forge.pki.oids['des-EDE3-CBC']:
		        ciph = forge.des.createDecryptionCipher(msg.encryptedContent.key);
		        break;

		      default:
		        throw new Error('Unsupported symmetric cipher, OID ' +
		          msg.encryptedContent.algorithm);
		    }
		    ciph.start(msg.encryptedContent.parameter);
		    ciph.update(msg.encryptedContent.content);

		    if(!ciph.finish()) {
		      throw new Error('Symmetric decryption failed.');
		    }

		    msg.content = ciph.output;
		  }
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'pkcs7';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/pkcs7',[
		  'require',
		  'module',
		  './aes',
		  './asn1',
		  './des',
		  './oids',
		  './pem',
		  './pkcs7asn1',
		  './random',
		  './util',
		  './x509'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Functions to output keys in SSH-friendly formats.
		 *
		 * This is part of the Forge project which may be used under the terms of
		 * either the BSD License or the GNU General Public License (GPL) Version 2.
		 *
		 * See: https://github.com/digitalbazaar/forge/blob/cbebca3780658703d925b61b2caffb1d263a6c1d/LICENSE
		 *
		 * @author https://github.com/shellac
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		var ssh = forge.ssh = forge.ssh || {};

		/**
		 * Encodes (and optionally encrypts) a private RSA key as a Putty PPK file.
		 *
		 * @param privateKey the key.
		 * @param passphrase a passphrase to protect the key (falsy for no encryption).
		 * @param comment a comment to include in the key file.
		 *
		 * @return the PPK file as a string.
		 */
		ssh.privateKeyToPutty = function(privateKey, passphrase, comment) {
		  comment = comment || '';
		  passphrase = passphrase || '';
		  var algorithm = 'ssh-rsa';
		  var encryptionAlgorithm = (passphrase === '') ? 'none' : 'aes256-cbc';

		  var ppk = 'PuTTY-User-Key-File-2: ' + algorithm + '\r\n';
		  ppk += 'Encryption: ' + encryptionAlgorithm + '\r\n';
		  ppk += 'Comment: ' + comment + '\r\n';

		  // public key into buffer for ppk
		  var pubbuffer = forge.util.createBuffer();
		  _addStringToBuffer(pubbuffer, algorithm);
		  _addBigIntegerToBuffer(pubbuffer, privateKey.e);
		  _addBigIntegerToBuffer(pubbuffer, privateKey.n);

		  // write public key
		  var pub = forge.util.encode64(pubbuffer.bytes(), 64);
		  var length = Math.floor(pub.length / 66) + 1; // 66 = 64 + \r\n
		  ppk += 'Public-Lines: ' + length + '\r\n';
		  ppk += pub;

		  // private key into a buffer
		  var privbuffer = forge.util.createBuffer();
		  _addBigIntegerToBuffer(privbuffer, privateKey.d);
		  _addBigIntegerToBuffer(privbuffer, privateKey.p);
		  _addBigIntegerToBuffer(privbuffer, privateKey.q);
		  _addBigIntegerToBuffer(privbuffer, privateKey.qInv);

		  // optionally encrypt the private key
		  var priv;
		  if(!passphrase) {
		    // use the unencrypted buffer
		    priv = forge.util.encode64(privbuffer.bytes(), 64);
		  } else {
		    // encrypt RSA key using passphrase
		    var encLen = privbuffer.length() + 16 - 1;
		    encLen -= encLen % 16;

		    // pad private key with sha1-d data -- needs to be a multiple of 16
		    var padding = _sha1(privbuffer.bytes());

		    padding.truncate(padding.length() - encLen + privbuffer.length());
		    privbuffer.putBuffer(padding);

		    var aeskey = forge.util.createBuffer();
		    aeskey.putBuffer(_sha1('\x00\x00\x00\x00', passphrase));
		    aeskey.putBuffer(_sha1('\x00\x00\x00\x01', passphrase));

		    // encrypt some bytes using CBC mode
		    // key is 40 bytes, so truncate *by* 8 bytes
		    var cipher = forge.aes.createEncryptionCipher(aeskey.truncate(8), 'CBC');
		    cipher.start(forge.util.createBuffer().fillWithByte(0, 16));
		    cipher.update(privbuffer.copy());
		    cipher.finish();
		    var encrypted = cipher.output;

		    // Note: this appears to differ from Putty -- is forge wrong, or putty?
		    // due to padding we finish as an exact multiple of 16
		    encrypted.truncate(16); // all padding

		    priv = forge.util.encode64(encrypted.bytes(), 64);
		  }

		  // output private key
		  length = Math.floor(priv.length / 66) + 1; // 64 + \r\n
		  ppk += '\r\nPrivate-Lines: ' + length + '\r\n';
		  ppk += priv;

		  // MAC
		  var mackey = _sha1('putty-private-key-file-mac-key', passphrase);

		  var macbuffer = forge.util.createBuffer();
		  _addStringToBuffer(macbuffer, algorithm);
		  _addStringToBuffer(macbuffer, encryptionAlgorithm);
		  _addStringToBuffer(macbuffer, comment);
		  macbuffer.putInt32(pubbuffer.length());
		  macbuffer.putBuffer(pubbuffer);
		  macbuffer.putInt32(privbuffer.length());
		  macbuffer.putBuffer(privbuffer);

		  var hmac = forge.hmac.create();
		  hmac.start('sha1', mackey);
		  hmac.update(macbuffer.bytes());

		  ppk += '\r\nPrivate-MAC: ' + hmac.digest().toHex() + '\r\n';

		  return ppk;
		};

		/**
		 * Encodes a public RSA key as an OpenSSH file.
		 *
		 * @param key the key.
		 * @param comment a comment.
		 *
		 * @return the public key in OpenSSH format.
		 */
		ssh.publicKeyToOpenSSH = function(key, comment) {
		  var type = 'ssh-rsa';
		  comment = comment || '';

		  var buffer = forge.util.createBuffer();
		  _addStringToBuffer(buffer, type);
		  _addBigIntegerToBuffer(buffer, key.e);
		  _addBigIntegerToBuffer(buffer, key.n);

		  return type + ' ' + forge.util.encode64(buffer.bytes()) + ' ' + comment;
		};

		/**
		 * Encodes a private RSA key as an OpenSSH file.
		 *
		 * @param key the key.
		 * @param passphrase a passphrase to protect the key (falsy for no encryption).
		 *
		 * @return the public key in OpenSSH format.
		 */
		ssh.privateKeyToOpenSSH = function(privateKey, passphrase) {
		  if(!passphrase) {
		    return forge.pki.privateKeyToPem(privateKey);
		  }
		  // OpenSSH private key is just a legacy format, it seems
		  return forge.pki.encryptRsaPrivateKey(privateKey, passphrase,
		    {legacy: true, algorithm: 'aes128'});
		};

		/**
		 * Gets the SSH fingerprint for the given public key.
		 *
		 * @param options the options to use.
		 *          [md] the message digest object to use (defaults to forge.md.md5).
		 *          [encoding] an alternative output encoding, such as 'hex'
		 *            (defaults to none, outputs a byte buffer).
		 *          [delimiter] the delimiter to use between bytes for 'hex' encoded
		 *            output, eg: ':' (defaults to none).
		 *
		 * @return the fingerprint as a byte buffer or other encoding based on options.
		 */
		ssh.getPublicKeyFingerprint = function(key, options) {
		  options = options || {};
		  var md = options.md || forge.md.md5.create();

		  var type = 'ssh-rsa';
		  var buffer = forge.util.createBuffer();
		  _addStringToBuffer(buffer, type);
		  _addBigIntegerToBuffer(buffer, key.e);
		  _addBigIntegerToBuffer(buffer, key.n);

		  // hash public key bytes
		  md.start();
		  md.update(buffer.getBytes());
		  var digest = md.digest();
		  if(options.encoding === 'hex') {
		    var hex = digest.toHex();
		    if(options.delimiter) {
		      return hex.match(/.{2}/g).join(options.delimiter);
		    }
		    return hex;
		  } else if(options.encoding === 'binary') {
		    return digest.getBytes();
		  } else if(options.encoding) {
		    throw new Error('Unknown encoding "' + options.encoding + '".');
		  }
		  return digest;
		};

		/**
		 * Adds len(val) then val to a buffer.
		 *
		 * @param buffer the buffer to add to.
		 * @param val a big integer.
		 */
		function _addBigIntegerToBuffer(buffer, val) {
		  var hexVal = val.toString(16);
		  // ensure 2s complement +ve
		  if(hexVal[0] >= '8') {
		    hexVal = '00' + hexVal;
		  }
		  var bytes = forge.util.hexToBytes(hexVal);
		  buffer.putInt32(bytes.length);
		  buffer.putBytes(bytes);
		}

		/**
		 * Adds len(val) then val to a buffer.
		 *
		 * @param buffer the buffer to add to.
		 * @param val a string.
		 */
		function _addStringToBuffer(buffer, val) {
		  buffer.putInt32(val.length);
		  buffer.putString(val);
		}

		/**
		 * Hashes the arguments into one value using SHA-1.
		 *
		 * @return the sha1 hash of the provided arguments.
		 */
		function _sha1() {
		  var sha = forge.md.sha1.create();
		  var num = arguments.length;
		  for (var i = 0; i < num; ++i) {
		    sha.update(arguments[i]);
		  }
		  return sha.digest();
		}

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'ssh';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/ssh',[
		  'require',
		  'module',
		  './aes',
		  './hmac',
		  './md5',
		  './sha1',
		  './util'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Support for concurrent task management and synchronization in web
		 * applications.
		 *
		 * @author Dave Longley
		 * @author David I. Lehn <dlehn@digitalbazaar.com>
		 *
		 * Copyright (c) 2009-2013 Digital Bazaar, Inc.
		 */
		(function() {
		/* ########## Begin module implementation ########## */
		function initModule(forge) {

		// logging category
		var cat = 'forge.task';

		// verbose level
		// 0: off, 1: a little, 2: a whole lot
		// Verbose debug logging is surrounded by a level check to avoid the
		// performance issues with even calling the logging code regardless if it
		// is actually logged.  For performance reasons this should not be set to 2
		// for production use.
		// ex: if(sVL >= 2) forge.log.verbose(....)
		var sVL = 0;

		// track tasks for debugging
		var sTasks = {};
		var sNextTaskId = 0;
		// debug access
		forge.debug.set(cat, 'tasks', sTasks);

		// a map of task type to task queue
		var sTaskQueues = {};
		// debug access
		forge.debug.set(cat, 'queues', sTaskQueues);

		// name for unnamed tasks
		var sNoTaskName = '?';

		// maximum number of doNext() recursions before a context swap occurs
		// FIXME: might need to tweak this based on the browser
		var sMaxRecursions = 30;

		// time slice for doing tasks before a context swap occurs
		// FIXME: might need to tweak this based on the browser
		var sTimeSlice = 20;

		/**
		 * Task states.
		 *
		 * READY: ready to start processing
		 * RUNNING: task or a subtask is running
		 * BLOCKED: task is waiting to acquire N permits to continue
		 * SLEEPING: task is sleeping for a period of time
		 * DONE: task is done
		 * ERROR: task has an error
		 */
		var READY = 'ready';
		var RUNNING = 'running';
		var BLOCKED = 'blocked';
		var SLEEPING = 'sleeping';
		var DONE = 'done';
		var ERROR = 'error';

		/**
		 * Task actions.  Used to control state transitions.
		 *
		 * STOP: stop processing
		 * START: start processing tasks
		 * BLOCK: block task from continuing until 1 or more permits are released
		 * UNBLOCK: release one or more permits
		 * SLEEP: sleep for a period of time
		 * WAKEUP: wakeup early from SLEEPING state
		 * CANCEL: cancel further tasks
		 * FAIL: a failure occured
		 */
		var STOP = 'stop';
		var START = 'start';
		var BLOCK = 'block';
		var UNBLOCK = 'unblock';
		var SLEEP = 'sleep';
		var WAKEUP = 'wakeup';
		var CANCEL = 'cancel';
		var FAIL = 'fail';

		/**
		 * State transition table.
		 *
		 * nextState = sStateTable[currentState][action]
		 */
		var sStateTable = {};

		sStateTable[READY] = {};
		sStateTable[READY][STOP] = READY;
		sStateTable[READY][START] = RUNNING;
		sStateTable[READY][CANCEL] = DONE;
		sStateTable[READY][FAIL] = ERROR;

		sStateTable[RUNNING] = {};
		sStateTable[RUNNING][STOP] = READY;
		sStateTable[RUNNING][START] = RUNNING;
		sStateTable[RUNNING][BLOCK] = BLOCKED;
		sStateTable[RUNNING][UNBLOCK] = RUNNING;
		sStateTable[RUNNING][SLEEP] = SLEEPING;
		sStateTable[RUNNING][WAKEUP] = RUNNING;
		sStateTable[RUNNING][CANCEL] = DONE;
		sStateTable[RUNNING][FAIL] = ERROR;

		sStateTable[BLOCKED] = {};
		sStateTable[BLOCKED][STOP] = BLOCKED;
		sStateTable[BLOCKED][START] = BLOCKED;
		sStateTable[BLOCKED][BLOCK] = BLOCKED;
		sStateTable[BLOCKED][UNBLOCK] = BLOCKED;
		sStateTable[BLOCKED][SLEEP] = BLOCKED;
		sStateTable[BLOCKED][WAKEUP] = BLOCKED;
		sStateTable[BLOCKED][CANCEL] = DONE;
		sStateTable[BLOCKED][FAIL] = ERROR;

		sStateTable[SLEEPING] = {};
		sStateTable[SLEEPING][STOP] = SLEEPING;
		sStateTable[SLEEPING][START] = SLEEPING;
		sStateTable[SLEEPING][BLOCK] = SLEEPING;
		sStateTable[SLEEPING][UNBLOCK] = SLEEPING;
		sStateTable[SLEEPING][SLEEP] = SLEEPING;
		sStateTable[SLEEPING][WAKEUP] = SLEEPING;
		sStateTable[SLEEPING][CANCEL] = DONE;
		sStateTable[SLEEPING][FAIL] = ERROR;

		sStateTable[DONE] = {};
		sStateTable[DONE][STOP] = DONE;
		sStateTable[DONE][START] = DONE;
		sStateTable[DONE][BLOCK] = DONE;
		sStateTable[DONE][UNBLOCK] = DONE;
		sStateTable[DONE][SLEEP] = DONE;
		sStateTable[DONE][WAKEUP] = DONE;
		sStateTable[DONE][CANCEL] = DONE;
		sStateTable[DONE][FAIL] = ERROR;

		sStateTable[ERROR] = {};
		sStateTable[ERROR][STOP] = ERROR;
		sStateTable[ERROR][START] = ERROR;
		sStateTable[ERROR][BLOCK] = ERROR;
		sStateTable[ERROR][UNBLOCK] = ERROR;
		sStateTable[ERROR][SLEEP] = ERROR;
		sStateTable[ERROR][WAKEUP] = ERROR;
		sStateTable[ERROR][CANCEL] = ERROR;
		sStateTable[ERROR][FAIL] = ERROR;

		/**
		 * Creates a new task.
		 *
		 * @param options options for this task
		 *   run: the run function for the task (required)
		 *   name: the run function for the task (optional)
		 *   parent: parent of this task (optional)
		 *
		 * @return the empty task.
		 */
		var Task = function(options) {
		  // task id
		  this.id = -1;

		  // task name
		  this.name = options.name || sNoTaskName;

		  // task has no parent
		  this.parent = options.parent || null;

		  // save run function
		  this.run = options.run;

		  // create a queue of subtasks to run
		  this.subtasks = [];

		  // error flag
		  this.error = false;

		  // state of the task
		  this.state = READY;

		  // number of times the task has been blocked (also the number
		  // of permits needed to be released to continue running)
		  this.blocks = 0;

		  // timeout id when sleeping
		  this.timeoutId = null;

		  // no swap time yet
		  this.swapTime = null;

		  // no user data
		  this.userData = null;

		  // initialize task
		  // FIXME: deal with overflow
		  this.id = sNextTaskId++;
		  sTasks[this.id] = this;
		  if(sVL >= 1) {
		    forge.log.verbose(cat, '[%s][%s] init', this.id, this.name, this);
		  }
		};

		/**
		 * Logs debug information on this task and the system state.
		 */
		Task.prototype.debug = function(msg) {
		  msg = msg || '';
		  forge.log.debug(cat, msg,
		    '[%s][%s] task:', this.id, this.name, this,
		    'subtasks:', this.subtasks.length,
		    'queue:', sTaskQueues);
		};

		/**
		 * Adds a subtask to run after task.doNext() or task.fail() is called.
		 *
		 * @param name human readable name for this task (optional).
		 * @param subrun a function to run that takes the current task as
		 *          its first parameter.
		 *
		 * @return the current task (useful for chaining next() calls).
		 */
		Task.prototype.next = function(name, subrun) {
		  // juggle parameters if it looks like no name is given
		  if(typeof(name) === 'function') {
		    subrun = name;

		    // inherit parent's name
		    name = this.name;
		  }
		  // create subtask, set parent to this task, propagate callbacks
		  var subtask = new Task({
		    run: subrun,
		    name: name,
		    parent: this
		  });
		  // start subtasks running
		  subtask.state = RUNNING;
		  subtask.type = this.type;
		  subtask.successCallback = this.successCallback || null;
		  subtask.failureCallback = this.failureCallback || null;

		  // queue a new subtask
		  this.subtasks.push(subtask);

		  return this;
		};

		/**
		 * Adds subtasks to run in parallel after task.doNext() or task.fail()
		 * is called.
		 *
		 * @param name human readable name for this task (optional).
		 * @param subrun functions to run that take the current task as
		 *          their first parameter.
		 *
		 * @return the current task (useful for chaining next() calls).
		 */
		Task.prototype.parallel = function(name, subrun) {
		  // juggle parameters if it looks like no name is given
		  if(forge.util.isArray(name)) {
		    subrun = name;

		    // inherit parent's name
		    name = this.name;
		  }
		  // Wrap parallel tasks in a regular task so they are started at the
		  // proper time.
		  return this.next(name, function(task) {
		    // block waiting for subtasks
		    var ptask = task;
		    ptask.block(subrun.length);

		    // we pass the iterator from the loop below as a parameter
		    // to a function because it is otherwise included in the
		    // closure and changes as the loop changes -- causing i
		    // to always be set to its highest value
		    var startParallelTask = function(pname, pi) {
		      forge.task.start({
		        type: pname,
		        run: function(task) {
		           subrun[pi](task);
		        },
		        success: function(task) {
		           ptask.unblock();
		        },
		        failure: function(task) {
		           ptask.unblock();
		        }
		      });
		    };

		    for(var i = 0; i < subrun.length; i++) {
		      // Type must be unique so task starts in parallel:
		      //    name + private string + task id + sub-task index
		      // start tasks in parallel and unblock when the finish
		      var pname = name + '__parallel-' + task.id + '-' + i;
		      var pi = i;
		      startParallelTask(pname, pi);
		    }
		  });
		};

		/**
		 * Stops a running task.
		 */
		Task.prototype.stop = function() {
		  this.state = sStateTable[this.state][STOP];
		};

		/**
		 * Starts running a task.
		 */
		Task.prototype.start = function() {
		  this.error = false;
		  this.state = sStateTable[this.state][START];

		  // try to restart
		  if(this.state === RUNNING) {
		    this.start = new Date();
		    this.run(this);
		    runNext(this, 0);
		  }
		};

		/**
		 * Blocks a task until it one or more permits have been released. The
		 * task will not resume until the requested number of permits have
		 * been released with call(s) to unblock().
		 *
		 * @param n number of permits to wait for(default: 1).
		 */
		Task.prototype.block = function(n) {
		  n = typeof(n) === 'undefined' ? 1 : n;
		  this.blocks += n;
		  if(this.blocks > 0) {
		    this.state = sStateTable[this.state][BLOCK];
		  }
		};

		/**
		 * Releases a permit to unblock a task. If a task was blocked by
		 * requesting N permits via block(), then it will only continue
		 * running once enough permits have been released via unblock() calls.
		 *
		 * If multiple processes need to synchronize with a single task then
		 * use a condition variable (see forge.task.createCondition). It is
		 * an error to unblock a task more times than it has been blocked.
		 *
		 * @param n number of permits to release (default: 1).
		 *
		 * @return the current block count (task is unblocked when count is 0)
		 */
		Task.prototype.unblock = function(n) {
		  n = typeof(n) === 'undefined' ? 1 : n;
		  this.blocks -= n;
		  if(this.blocks === 0 && this.state !== DONE) {
		    this.state = RUNNING;
		    runNext(this, 0);
		  }
		  return this.blocks;
		};

		/**
		 * Sleep for a period of time before resuming tasks.
		 *
		 * @param n number of milliseconds to sleep (default: 0).
		 */
		Task.prototype.sleep = function(n) {
		  n = typeof(n) === 'undefined' ? 0 : n;
		  this.state = sStateTable[this.state][SLEEP];
		  var self = this;
		  this.timeoutId = setTimeout(function() {
		    self.timeoutId = null;
		    self.state = RUNNING;
		    runNext(self, 0);
		  }, n);
		};

		/**
		 * Waits on a condition variable until notified. The next task will
		 * not be scheduled until notification. A condition variable can be
		 * created with forge.task.createCondition().
		 *
		 * Once cond.notify() is called, the task will continue.
		 *
		 * @param cond the condition variable to wait on.
		 */
		Task.prototype.wait = function(cond) {
		  cond.wait(this);
		};

		/**
		 * If sleeping, wakeup and continue running tasks.
		 */
		Task.prototype.wakeup = function() {
		  if(this.state === SLEEPING) {
		    cancelTimeout(this.timeoutId);
		    this.timeoutId = null;
		    this.state = RUNNING;
		    runNext(this, 0);
		  }
		};

		/**
		 * Cancel all remaining subtasks of this task.
		 */
		Task.prototype.cancel = function() {
		  this.state = sStateTable[this.state][CANCEL];
		  // remove permits needed
		  this.permitsNeeded = 0;
		  // cancel timeouts
		  if(this.timeoutId !== null) {
		    cancelTimeout(this.timeoutId);
		    this.timeoutId = null;
		  }
		  // remove subtasks
		  this.subtasks = [];
		};

		/**
		 * Finishes this task with failure and sets error flag. The entire
		 * task will be aborted unless the next task that should execute
		 * is passed as a parameter. This allows levels of subtasks to be
		 * skipped. For instance, to abort only this tasks's subtasks, then
		 * call fail(task.parent). To abort this task's subtasks and its
		 * parent's subtasks, call fail(task.parent.parent). To abort
		 * all tasks and simply call the task callback, call fail() or
		 * fail(null).
		 *
		 * The task callback (success or failure) will always, eventually, be
		 * called.
		 *
		 * @param next the task to continue at, or null to abort entirely.
		 */
		Task.prototype.fail = function(next) {
		  // set error flag
		  this.error = true;

		  // finish task
		  finish(this, true);

		  if(next) {
		    // propagate task info
		    next.error = this.error;
		    next.swapTime = this.swapTime;
		    next.userData = this.userData;

		    // do next task as specified
		    runNext(next, 0);
		  } else {
		    if(this.parent !== null) {
		      // finish root task (ensures it is removed from task queue)
		      var parent = this.parent;
		      while(parent.parent !== null) {
		        // propagate task info
		        parent.error = this.error;
		        parent.swapTime = this.swapTime;
		        parent.userData = this.userData;
		        parent = parent.parent;
		      }
		      finish(parent, true);
		    }

		    // call failure callback if one exists
		    if(this.failureCallback) {
		      this.failureCallback(this);
		    }
		  }
		};

		/**
		 * Asynchronously start a task.
		 *
		 * @param task the task to start.
		 */
		var start = function(task) {
		  task.error = false;
		  task.state = sStateTable[task.state][START];
		  setTimeout(function() {
		    if(task.state === RUNNING) {
		      task.swapTime = +new Date();
		      task.run(task);
		      runNext(task, 0);
		    }
		  }, 0);
		};

		/**
		 * Run the next subtask or finish this task.
		 *
		 * @param task the task to process.
		 * @param recurse the recursion count.
		 */
		var runNext = function(task, recurse) {
		  // get time since last context swap (ms), if enough time has passed set
		  // swap to true to indicate that doNext was performed asynchronously
		  // also, if recurse is too high do asynchronously
		  var swap =
		    (recurse > sMaxRecursions) ||
		    (+new Date() - task.swapTime) > sTimeSlice;

		  var doNext = function(recurse) {
		    recurse++;
		    if(task.state === RUNNING) {
		      if(swap) {
		        // update swap time
		        task.swapTime = +new Date();
		      }

		      if(task.subtasks.length > 0) {
		        // run next subtask
		        var subtask = task.subtasks.shift();
		        subtask.error = task.error;
		        subtask.swapTime = task.swapTime;
		        subtask.userData = task.userData;
		        subtask.run(subtask);
		        if(!subtask.error) {
		           runNext(subtask, recurse);
		        }
		      } else {
		        finish(task);

		        if(!task.error) {
		          // chain back up and run parent
		          if(task.parent !== null) {
		            // propagate task info
		            task.parent.error = task.error;
		            task.parent.swapTime = task.swapTime;
		            task.parent.userData = task.userData;

		            // no subtasks left, call run next subtask on parent
		            runNext(task.parent, recurse);
		          }
		        }
		      }
		    }
		  };

		  if(swap) {
		    // we're swapping, so run asynchronously
		    setTimeout(doNext, 0);
		  } else {
		    // not swapping, so run synchronously
		    doNext(recurse);
		  }
		};

		/**
		 * Finishes a task and looks for the next task in the queue to start.
		 *
		 * @param task the task to finish.
		 * @param suppressCallbacks true to suppress callbacks.
		 */
		var finish = function(task, suppressCallbacks) {
		  // subtask is now done
		  task.state = DONE;

		  delete sTasks[task.id];
		  if(sVL >= 1) {
		    forge.log.verbose(cat, '[%s][%s] finish',
		      task.id, task.name, task);
		  }

		  // only do queue processing for root tasks
		  if(task.parent === null) {
		    // report error if queue is missing
		    if(!(task.type in sTaskQueues)) {
		      forge.log.error(cat,
		        '[%s][%s] task queue missing [%s]',
		        task.id, task.name, task.type);
		    } else if(sTaskQueues[task.type].length === 0) {
		      // report error if queue is empty
		      forge.log.error(cat,
		        '[%s][%s] task queue empty [%s]',
		        task.id, task.name, task.type);
		    } else if(sTaskQueues[task.type][0] !== task) {
		      // report error if this task isn't the first in the queue
		      forge.log.error(cat,
		        '[%s][%s] task not first in queue [%s]',
		        task.id, task.name, task.type);
		    } else {
		      // remove ourselves from the queue
		      sTaskQueues[task.type].shift();
		      // clean up queue if it is empty
		      if(sTaskQueues[task.type].length === 0) {
		        if(sVL >= 1) {
		          forge.log.verbose(cat, '[%s][%s] delete queue [%s]',
		            task.id, task.name, task.type);
		        }
		        /* Note: Only a task can delete a queue of its own type. This
		         is used as a way to synchronize tasks. If a queue for a certain
		         task type exists, then a task of that type is running.
		         */
		        delete sTaskQueues[task.type];
		      } else {
		        // dequeue the next task and start it
		        if(sVL >= 1) {
		          forge.log.verbose(cat,
		            '[%s][%s] queue start next [%s] remain:%s',
		            task.id, task.name, task.type,
		            sTaskQueues[task.type].length);
		        }
		        sTaskQueues[task.type][0].start();
		      }
		    }

		    if(!suppressCallbacks) {
		      // call final callback if one exists
		      if(task.error && task.failureCallback) {
		        task.failureCallback(task);
		      } else if(!task.error && task.successCallback) {
		        task.successCallback(task);
		      }
		    }
		  }
		};

		/* Tasks API */
		forge.task = forge.task || {};

		/**
		 * Starts a new task that will run the passed function asynchronously.
		 *
		 * In order to finish the task, either task.doNext() or task.fail()
		 * *must* be called.
		 *
		 * The task must have a type (a string identifier) that can be used to
		 * synchronize it with other tasks of the same type. That type can also
		 * be used to cancel tasks that haven't started yet.
		 *
		 * To start a task, the following object must be provided as a parameter
		 * (each function takes a task object as its first parameter):
		 *
		 * {
		 *   type: the type of task.
		 *   run: the function to run to execute the task.
		 *   success: a callback to call when the task succeeds (optional).
		 *   failure: a callback to call when the task fails (optional).
		 * }
		 *
		 * @param options the object as described above.
		 */
		forge.task.start = function(options) {
		  // create a new task
		  var task = new Task({
		    run: options.run,
		    name: options.name || sNoTaskName
		  });
		  task.type = options.type;
		  task.successCallback = options.success || null;
		  task.failureCallback = options.failure || null;

		  // append the task onto the appropriate queue
		  if(!(task.type in sTaskQueues)) {
		    if(sVL >= 1) {
		      forge.log.verbose(cat, '[%s][%s] create queue [%s]',
		        task.id, task.name, task.type);
		    }
		    // create the queue with the new task
		    sTaskQueues[task.type] = [task];
		    start(task);
		  } else {
		    // push the task onto the queue, it will be run after a task
		    // with the same type completes
		    sTaskQueues[options.type].push(task);
		  }
		};

		/**
		 * Cancels all tasks of the given type that haven't started yet.
		 *
		 * @param type the type of task to cancel.
		 */
		forge.task.cancel = function(type) {
		  // find the task queue
		  if(type in sTaskQueues) {
		    // empty all but the current task from the queue
		    sTaskQueues[type] = [sTaskQueues[type][0]];
		  }
		};

		/**
		 * Creates a condition variable to synchronize tasks. To make a task wait
		 * on the condition variable, call task.wait(condition). To notify all
		 * tasks that are waiting, call condition.notify().
		 *
		 * @return the condition variable.
		 */
		forge.task.createCondition = function() {
		  var cond = {
		    // all tasks that are blocked
		    tasks: {}
		  };

		  /**
		   * Causes the given task to block until notify is called. If the task
		   * is already waiting on this condition then this is a no-op.
		   *
		   * @param task the task to cause to wait.
		   */
		  cond.wait = function(task) {
		    // only block once
		    if(!(task.id in cond.tasks)) {
		       task.block();
		       cond.tasks[task.id] = task;
		    }
		  };

		  /**
		   * Notifies all waiting tasks to wake up.
		   */
		  cond.notify = function() {
		    // since unblock() will run the next task from here, make sure to
		    // clear the condition's blocked task list before unblocking
		    var tmp = cond.tasks;
		    cond.tasks = {};
		    for(var id in tmp) {
		      tmp[id].unblock();
		    }
		  };

		  return cond;
		};

		} // end module implementation

		/* ########## Begin module wrapper ########## */
		var name = 'task';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      forge = {};
		    }
		    return initModule(forge);
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    }).concat(initModule);
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge[name];
		  };
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/task',['require', 'module', './debug', './log', './util'], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();

		/**
		 * Node.js module for Forge.
		 *
		 * @author Dave Longley
		 *
		 * Copyright 2011-2014 Digital Bazaar, Inc.
		 */
		(function() {
		var name = 'forge';
		if(typeof define !== 'function') {
		  // NodeJS -> AMD
		  if(typeof module === 'object' && module.exports) {
		    var nodeJS = true;
		    define = function(ids, factory) {
		      factory(require, module);
		    };
		  } else {
		    // <script>
		    if(typeof forge === 'undefined') {
		      // set to true to disable native code if even it's available
		      forge = {disableNativeCode: false};
		    }
		    return;
		  }
		}
		// AMD
		var deps;
		var defineFunc = function(require, module) {
		  module.exports = function(forge) {
		    var mods = deps.map(function(dep) {
		      return require(dep);
		    });
		    // handle circular dependencies
		    forge = forge || {};
		    forge.defined = forge.defined || {};
		    if(forge.defined[name]) {
		      return forge[name];
		    }
		    forge.defined[name] = true;
		    for(var i = 0; i < mods.length; ++i) {
		      mods[i](forge);
		    }
		    return forge;
		  };
		  // set to true to disable native code if even it's available
		  module.exports.disableNativeCode = false;
		  module.exports(module.exports);
		};
		var tmpDefine = define;
		define = function(ids, factory) {
		  deps = (typeof ids === 'string') ? factory.slice(2) : ids.slice(2);
		  if(nodeJS) {
		    delete define;
		    return tmpDefine.apply(null, Array.prototype.slice.call(arguments, 0));
		  }
		  define = tmpDefine;
		  return define.apply(null, Array.prototype.slice.call(arguments, 0));
		};
		define('js/forge',[
		  'require',
		  'module',
		  './aes',
		  './aesCipherSuites',
		  './asn1',
		  './cipher',
		  './cipherModes',
		  './debug',
		  './des',
		  './hmac',
		  './kem',
		  './log',
		  './md',
		  './mgf1',
		  './pbkdf2',
		  './pem',
		  './pkcs7',
		  './pkcs1',
		  './pkcs12',
		  './pki',
		  './prime',
		  './prng',
		  './pss',
		  './random',
		  './rc2',
		  './ssh',
		  './task',
		  './tls',
		  './util'
		], function() {
		  defineFunc.apply(null, Array.prototype.slice.call(arguments, 0));
		});
		})();


		return require('js/forge');

		});

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3), __webpack_require__(21).setImmediate, __webpack_require__(48)(module), __webpack_require__(0).Buffer))

	/***/ },
	/* 706 */
	/***/ function(module, exports, __webpack_require__) {

		var parse = __webpack_require__(707)
		var stringify = __webpack_require__(708)

		module.exports = parse
		module.exports.parse = parse
		module.exports.stringify = stringify


	/***/ },
	/* 707 */
	/***/ function(module, exports, __webpack_require__) {

		var tokenize = __webpack_require__(709)
		var MAX_RANGE = 0x1FFFFFFF

		var onfieldoptions = function (tokens) {
		  var opts = {}

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case '[':
		      case ',':
		        tokens.shift()
		        var name = tokens.shift()
		        if (tokens[0] !== '=') throw new Error('Unexpected token in field options: ' + tokens[0])
		        tokens.shift()
		        if (tokens[0] === ']') throw new Error('Unexpected ] in field option')
		        opts[name] = tokens.shift()
		        break

		      case ']':
		        tokens.shift()
		        return opts

		      default:
		        throw new Error('Unexpected token in field options: ' + tokens[0])
		    }
		  }

		  throw new Error('No closing tag for field options')
		}

		var onfield = function (tokens) {
		  var field = {
		    name: null,
		    type: null,
		    tag: 0,
		    required: false,
		    repeated: false,
		    options: {}
		  }

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case '=':
		        tokens.shift()
		        field.tag = Number(tokens.shift())
		        break

		      case 'repeated':
		      case 'required':
		      case 'optional':
		        var t = tokens.shift()
		        field.required = t === 'required'
		        field.repeated = t === 'repeated'
		        field.type = tokens.shift()
		        field.name = tokens.shift()
		        break

		      case '[':
		        field.options = onfieldoptions(tokens)
		        break

		      case ';':
		        tokens.shift()
		        return field

		      default:
		        throw new Error('Unexpected token in message field: ' + tokens[0])
		    }
		  }

		  throw new Error('No ; found for message field')
		}

		var onmessagebody = function (tokens) {
		  var body = {
		    enums: [],
		    messages: [],
		    fields: [],
		    oneof: [],
		    extensions: null
		  }

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case 'repeated':
		      case 'optional':
		      case 'required':
		        body.fields.push(onfield(tokens))
		        break

		      case 'enum':
		        body.enums.push(onenum(tokens))
		        break

		      case 'message':
		        body.messages.push(onmessage(tokens))
		        break

		      case 'extensions':
		        body.extensions = onextensions(tokens)
		        break

		      case 'oneof':
		        body.oneof.push(ononeof(tokens))
		        break

		      case ';':
		        tokens.shift()
		        break

		      default:
		        throw new Error('Unexpected token in message: ' + tokens[0])
		    }
		  }

		  return body
		}

		var onextend = function (tokens) {
		  var out = {
		    name: tokens[1],
		    message: onmessage(tokens)
		  }
		  return out
		}

		var onextensions = function (tokens) {
		  tokens.shift()
		  var from = Number(tokens.shift())
		  if (isNaN(from)) throw new Error('Invalid from in extensions definition')
		  if (tokens.shift() !== 'to') throw new Error("Expected keyword 'to' in extensions definition")
		  var to = tokens.shift()
		  if (to === 'max') to = MAX_RANGE
		  to = Number(to)
		  if (isNaN(to)) throw new Error('Invalid to in extensions definition')
		  if (tokens.shift() !== ';') throw new Error('Missing ; in extensions definition')
		  return {from: from, to: to}
		}
		var onmessage = function (tokens) {
		  tokens.shift()

		  var lvl = 1
		  var body = []
		  var msg = {
		    name: tokens.shift(),
		    enums: [],
		    oneof: [],
		    messages: [],
		    fields: []
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '{') lvl++
		    else if (tokens[0] === '}') lvl--

		    if (!lvl) {
		      tokens.shift()
		      body = onmessagebody(body)
		      msg.enums = body.enums
		      msg.oneof = body.oneof
		      msg.messages = body.messages
		      msg.fields = body.fields
		      msg.extensions = body.extensions
		      return msg
		    }

		    body.push(tokens.shift())
		  }

		  if (lvl) throw new Error('No closing tag for message')
		}

		var onpackagename = function (tokens) {
		  tokens.shift()
		  var name = tokens.shift()
		  if (tokens[0] !== ';') throw new Error('Expected ; but found ' + tokens[0])
		  tokens.shift()
		  return name
		}

		var onenumvalue = function (tokens) {
		  if (tokens.length < 4) throw new Error('Invalid enum value: ' + tokens.slice(0, 3).join(' '))
		  if (tokens[1] !== '=') throw new Error('Expected = but found ' + tokens[1])
		  if (tokens[3] !== ';') throw new Error('Expected ; but found ' + tokens[1])

		  var name = tokens.shift()
		  tokens.shift()

		  var value = Number(tokens.shift())
		  tokens.shift()

		  return {
		    name: name,
		    value: value
		  }
		}

		var onenum = function (tokens) {
		  tokens.shift()

		  var e = {
		    name: tokens.shift(),
		    values: {}
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '}') {
		      tokens.shift()
		      // there goes optional semicolon after the enclosing "}"
		      if (tokens[0] === ';') tokens.shift()
		      return e
		    }
		    if (tokens[0] === 'option') {
		      // just skip "option allow_alias = true;"
		      while (tokens.shift() !== ';') {
		        // do nothing
		      }
		    }
		    var val = onenumvalue(tokens)
		    e.values[val.name] = val.value
		  }

		  throw new Error('No closing tag for enum')
		}

		var ononeof = function (tokens) {
		  tokens.shift()

		  var oneof = {
		    name: tokens.shift(),
		    fields: []
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '}') {
		      tokens.shift()
		      return oneof
		    }

		    var field = {}

		    field.type = tokens.shift()
		    field.name = tokens.shift()
		    if (tokens[0] !== '=') throw new Error('Expected = but found ' + tokens[0])
		    tokens.shift()
		    field.tag = Number(tokens.shift())

		    oneof.fields.push(field)
		    if (tokens[0] !== ';') throw new Error('Expected ; but found ' + tokens[0])
		    tokens.shift()
		  }

		  throw new Error('No closing tag for oneof')
		}

		var onoption = function (tokens) {
		  var name = null
		  var value = null

		  var parse = function (value) {
		    if (value === 'true') return true
		    if (value === 'false') return false
		    return value.replace(/^"+|"+$/gm, '')
		  }

		  while (tokens.length) {
		    if (tokens[0] === ';') {
		      tokens.shift()
		      return {name: name, value: value}
		    }
		    switch (tokens[0]) {
		      case 'option':
		        tokens.shift()
		        name = tokens.shift()
		        break

		      case '=':
		        tokens.shift()
		        if (name === null) throw new Error('Expected key for option with value: ' + tokens[0])
		        value = parse(tokens.shift())
		        if (name === 'optimize_for' && !/^(SPEED|CODE_SIZE|LITE_RUNTIME)$/.test(value)) {
		          throw new Error('Unexpected value for option optimize_for: ' + value)
		        }
		        break

		      default:
		        throw new Error('Unexpected token in option: ' + tokens[0])
		    }
		  }
		}

		var onimport = function (tokens) {
		  tokens.shift()
		  var file = tokens.shift().replace(/^"+|"+$/gm, '')

		  if (tokens[0] !== ';') throw new Error('Unexpected token: ' + tokens[0] + '. Expected ";"')

		  tokens.shift()
		  return file
		}

		var parse = function (buf) {
		  var tokens = tokenize(buf.toString())
		  var schema = {
		    package: null,
		    imports: [],
		    enums: [],
		    messages: [],
		    options: {},
		    extends: []
		  }

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case 'package':
		        schema.package = onpackagename(tokens)
		        break

		      case 'message':
		        schema.messages.push(onmessage(tokens))
		        break

		      case 'enum':
		        schema.enums.push(onenum(tokens))
		        break

		      case 'option':
		        var opt = onoption(tokens)
		        if (schema.options[opt.name]) throw new Error('Duplicate option ' + opt.name)
		        schema.options[opt.name] = opt.value
		        break

		      case 'import':
		        schema.imports.push(onimport(tokens))
		        break

		      case 'extend':
		        schema.extends.push(onextend(tokens))
		        break

		      default:
		        throw new Error('Unexpected token: ' + tokens[0])
		    }
		  }

		  // now iterate over messages and propagate extends
		  schema.extends.forEach(function (ext) {
		    schema.messages.forEach(function (msg) {
		      if (msg.name === ext.name) {
		        ext.message.fields.forEach(function (field) {
		          if (!msg.extensions || field.tag < msg.extensions.from || field.tag > msg.extensions.to) {
		            throw new Error(msg.name + ' does not declare ' + field.tag + ' as an extension number')
		          }
		          msg.fields.push(field)
		        })
		      }
		    })
		  })

		  return schema
		}

		module.exports = parse


	/***/ },
	/* 708 */
	/***/ function(module, exports) {

		var onfield = function (f, result) {
		  var prefix = f.repeated ? 'repeated' : f.required ? 'required' : 'optional'

		  var opts = Object.keys(f.options || {}).map(function (key) {
		    return key + ' = ' + f.options[key]
		  }).join(',')

		  if (opts) opts = ' [' + opts + ']'

		  result.push(prefix + ' ' + f.type + ' ' + f.name + ' = ' + f.tag + opts + ';')
		  return result
		}

		var onmessage = function (m, result) {
		  result.push('message ' + m.name + ' {')

		  if (!m.enums) m.enums = []
		  m.enums.forEach(function (e) {
		    result.push(onenum(e, []))
		  })

		  if (!m.messages) m.messages = []
		  m.messages.forEach(function (m) {
		    result.push(onmessage(m, []))
		  })

		  if (!m.fields) m.fields = []
		  m.fields.forEach(function (f) {
		    result.push(onfield(f, []))
		  })

		  result.push('}', '')
		  return result
		}

		var onenum = function (e, result) {
		  result.push('enum ' + e.name + ' {')

		  var vals = Object.keys(e.values).map(function (key) {
		    return key + ' = ' + e.values[key] + ';'
		  })

		  result.push(vals)
		  result.push('}', '')
		  return result
		}

		var onoption = function (o, result) {
		  var keys = Object.keys(o)
		  keys.forEach(function (option) {
		    var v = o[option]
		    if (typeof v === 'string' && option !== 'optimize_for') v = '"' + v + '"'
		    result.push('option ' + option + ' = ' + v + ';')
		  })
		  if (keys.length > 0) {
		    result.push('')
		  }
		}

		var indent = function (lvl) {
		  return function (line) {
		    if (Array.isArray(line)) return line.map(indent(lvl + '  ')).join('\n')
		    return lvl + line
		  }
		}

		module.exports = function (schema) {
		  var result = []
		  if (schema.package) result.push('package ' + schema.package + ';', '')

		  if (!schema.options) schema.options = {}

		  onoption(schema.options, result)

		  if (!schema.enums) schema.enums = []
		  schema.enums.forEach(function (e) {
		    onenum(e, result)
		  })

		  if (!schema.messages) schema.messages = []
		  schema.messages.forEach(function (m) {
		    onmessage(m, result)
		  })

		  return result.map(indent('')).join('\n')
		}


	/***/ },
	/* 709 */
	/***/ function(module, exports) {

		module.exports = function (sch) {
		  var noComments = function (line) {
		    var i = line.indexOf('//')
		    return i > -1 ? line.slice(0, i) : line
		  }

		  var noMultilineComments = function () {
		    var inside = false
		    return function (token) {
		      if (token === '/*') {
		        inside = true
		        return false
		      }
		      if (token === '*/') {
		        inside = false
		        return false
		      }
		      return !inside
		    }
		  }

		  var trim = function (line) {
		    return line.trim()
		  }

		  return sch
		    .replace(/([;,{}=\[\]]|\/\*|\*\/)/g, ' $1 ')
		    .split(/\n/)
		    .map(trim)
		    .filter(Boolean)
		    .map(noComments)
		    .filter(Boolean)
		    .join('\n')
		    .split(/\s+|\n+/gm)
		    .filter(noMultilineComments())
		}


	/***/ },
	/* 710 */
	/***/ function(module, exports, __webpack_require__) {

		var parse = __webpack_require__(711)
		var stringify = __webpack_require__(712)

		module.exports = parse
		module.exports.parse = parse
		module.exports.stringify = stringify


	/***/ },
	/* 711 */
	/***/ function(module, exports, __webpack_require__) {

		var tokenize = __webpack_require__(713)
		var MAX_RANGE = 0x1FFFFFFF

		var onfieldoptions = function (tokens) {
		  var opts = {}

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case '[':
		      case ',':
		        tokens.shift()
		        var name = tokens.shift()
		        if (name === '(') {       // handling [(A) = B]
		          name = tokens.shift()
		          tokens.shift()          // remove the end of bracket
		        }
		        if (tokens[0] !== '=') throw new Error('Unexpected token in field options: ' + tokens[0])
		        tokens.shift()
		        if (tokens[0] === ']') throw new Error('Unexpected ] in field option')
		        opts[name] = tokens.shift()
		        break
		      case ']':
		        tokens.shift()
		        return opts

		      default:
		        throw new Error('Unexpected token in field options: ' + tokens[0])
		    }
		  }

		  throw new Error('No closing tag for field options')
		}

		var onfield = function (tokens) {
		  var field = {
		    name: null,
		    type: null,
		    tag: 0,
		    map: null,
		    oneof: null,
		    required: false,
		    repeated: false,
		    options: {}
		  }

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case '=':
		        tokens.shift()
		        field.tag = Number(tokens.shift())
		        break

		      case 'map':
		        field.type = 'map'
		        field.map = {from: null, to: null}
		        tokens.shift()
		        if (tokens[0] !== '<') throw new Error('Unexpected token in map type: ' + tokens[0])
		        tokens.shift()
		        field.map.from = tokens.shift()
		        if (tokens[0] !== ',') throw new Error('Unexpected token in map type: ' + tokens[0])
		        tokens.shift()
		        field.map.to = tokens.shift()
		        if (tokens[0] !== '>') throw new Error('Unexpected token in map type: ' + tokens[0])
		        tokens.shift()
		        field.name = tokens.shift()
		        break

		      case 'repeated':
		      case 'required':
		      case 'optional':
		        var t = tokens.shift()
		        field.required = t === 'required'
		        field.repeated = t === 'repeated'
		        field.type = tokens.shift()
		        field.name = tokens.shift()
		        break

		      case '[':
		        field.options = onfieldoptions(tokens)
		        break

		      case ';':
		        tokens.shift()
		        return field

		      default:
		        throw new Error('Unexpected token in message field: ' + tokens[0])
		    }
		  }

		  throw new Error('No ; found for message field')
		}

		var onmessagebody = function (tokens) {
		  var body = {
		    enums: [],
		    messages: [],
		    fields: [],
		    extensions: null
		  }

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case 'map':
		      case 'repeated':
		      case 'optional':
		      case 'required':
		        body.fields.push(onfield(tokens))
		        break

		      case 'enum':
		        body.enums.push(onenum(tokens))
		        break

		      case 'message':
		        body.messages.push(onmessage(tokens))
		        break

		      case 'extensions':
		        body.extensions = onextensions(tokens)
		        break

		      case 'oneof':
		        tokens.shift()
		        var name = tokens.shift()
		        if (tokens[0] !== '{') throw new Error('Unexpected token in oneof: ' + tokens[0])
		        tokens.shift()
		        while (tokens[0] !== '}') {
		          tokens.unshift('optional')
		          var field = onfield(tokens)
		          field.oneof = name
		          body.fields.push(field)
		        }
		        tokens.shift()
		        break

		      case ';':
		        tokens.shift()
		        break

		      default:
		        // proto3 does not require the use of optional/required, assumed as optional
		        // "singular: a well-formed message can have zero or one of this field (but not more than one)."
		        // https://developers.google.com/protocol-buffers/docs/proto3#specifying-field-rules
		        tokens.unshift('optional')
		        body.fields.push(onfield(tokens))
		    }
		  }

		  return body
		}

		var onextend = function (tokens) {
		  var out = {
		    name: tokens[1],
		    message: onmessage(tokens)
		  }
		  return out
		}

		var onextensions = function (tokens) {
		  tokens.shift()
		  var from = Number(tokens.shift())
		  if (isNaN(from)) throw new Error('Invalid from in extensions definition')
		  if (tokens.shift() !== 'to') throw new Error("Expected keyword 'to' in extensions definition")
		  var to = tokens.shift()
		  if (to === 'max') to = MAX_RANGE
		  to = Number(to)
		  if (isNaN(to)) throw new Error('Invalid to in extensions definition')
		  if (tokens.shift() !== ';') throw new Error('Missing ; in extensions definition')
		  return {from: from, to: to}
		}
		var onmessage = function (tokens) {
		  tokens.shift()

		  var lvl = 1
		  var body = []
		  var msg = {
		    name: tokens.shift(),
		    enums: [],
		    messages: [],
		    fields: []
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '{') lvl++
		    else if (tokens[0] === '}') lvl--

		    if (!lvl) {
		      tokens.shift()
		      body = onmessagebody(body)
		      msg.enums = body.enums
		      msg.messages = body.messages
		      msg.fields = body.fields
		      msg.extensions = body.extensions
		      return msg
		    }

		    body.push(tokens.shift())
		  }

		  if (lvl) throw new Error('No closing tag for message')
		}

		var onpackagename = function (tokens) {
		  tokens.shift()
		  var name = tokens.shift()
		  if (tokens[0] !== ';') throw new Error('Expected ; but found ' + tokens[0])
		  tokens.shift()
		  return name
		}

		var onsyntaxversion = function (tokens) {
		  tokens.shift()

		  if (tokens[0] !== '=') throw new Error('Expected = but found ' + tokens[0])
		  tokens.shift()

		  var version = tokens.shift()
		  switch (version) {
		    case '"proto2"':
		      version = 2
		      break

		    case '"proto3"':
		      version = 3
		      break

		    default:
		      throw new Error('Expected protobuf syntax version but found ' + version)
		  }

		  if (tokens[0] !== ';') throw new Error('Expected ; but found ' + tokens[0])
		  tokens.shift()

		  return version
		}

		var onenumvalue = function (tokens) {
		  if (tokens.length < 4) throw new Error('Invalid enum value: ' + tokens.slice(0, 3).join(' '))
		  if (tokens[1] !== '=') throw new Error('Expected = but found ' + tokens[1])
		  if (tokens[3] !== ';') throw new Error('Expected ; but found ' + tokens[1])

		  var name = tokens.shift()
		  tokens.shift()

		  var value = Number(tokens.shift())
		  tokens.shift()

		  return {
		    name: name,
		    value: value
		  }
		}

		var onenum = function (tokens) {
		  tokens.shift()

		  var e = {
		    name: tokens.shift(),
		    values: {}
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '}') {
		      tokens.shift()
		      // there goes optional semicolon after the enclosing "}"
		      if (tokens[0] === ';') tokens.shift()
		      return e
		    }
		    if (tokens[0] === 'option') {
		      // just skip "option allow_alias = true;"
		      while (tokens.shift() !== ';') {
		        // do nothing
		      }
		    }
		    var val = onenumvalue(tokens)
		    e.values[val.name] = val.value
		  }

		  throw new Error('No closing tag for enum')
		}

		var onoption = function (tokens) {
		  var name = null
		  var value = null

		  var parse = function (value) {
		    if (value === 'true') return true
		    if (value === 'false') return false
		    return value.replace(/^"+|"+$/gm, '')
		  }

		  while (tokens.length) {
		    if (tokens[0] === ';') {
		      tokens.shift()
		      return {name: name, value: value}
		    }
		    switch (tokens[0]) {
		      case 'option':
		        tokens.shift()

		        var hasBracket = tokens[0] === '('
		        if (hasBracket) tokens.shift()

		        name = tokens.shift()

		        if (hasBracket) {
		          if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0])
		          tokens.shift()
		        }
		        break

		      case '=':
		        tokens.shift()
		        if (name === null) throw new Error('Expected key for option with value: ' + tokens[0])
		        value = parse(tokens.shift())

		        if (name === 'optimize_for' && !/^(SPEED|CODE_SIZE|LITE_RUNTIME)$/.test(value)) {
		          throw new Error('Unexpected value for option optimize_for: ' + value)
		        } else if (value === '{') {
		          // option foo = {bar: baz}
		          value = onoptionMap(tokens)
		        }
		        break

		      default:
		        throw new Error('Unexpected token in option: ' + tokens[0])
		    }
		  }
		}

		var onoptionMap = function (tokens) {
		  var parse = function (value) {
		    if (value === 'true') return true
		    if (value === 'false') return false
		    return value.replace(/^"+|"+$/gm, '')
		  }

		  var map = {}

		  while (tokens.length) {
		    if (tokens[0] === '}') {
		      tokens.shift()
		      return map
		    }

		    var hasBracket = tokens[0] === '('
		    if (hasBracket) tokens.shift()

		    var key = tokens.shift()
		    if (hasBracket) {
		      if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0])
		      tokens.shift()
		    }

		    var value = null

		    switch (tokens[0]) {
		      case ':':
		        if (map[key] !== undefined) throw new Error('Duplicate option map key ' + key)

		        tokens.shift()

		        value = parse(tokens.shift())

		        if (value === '{') {
		          // option foo = {bar: baz}
		          value = onoptionMap(tokens)
		        }

		        map[key] = value
		        break

		      case '{':
		        tokens.shift()
		        value = onoptionMap(tokens)

		        if (map[key] === undefined) map[key] = []
		        if (!Array.isArray(map[key])) throw new Error('Duplicate option map key ' + key)

		        map[key].push(value)
		        break

		      default:
		        throw new Error('Unexpected token in option map: ' + tokens[0])
		    }
		  }

		  throw new Error('No closing tag for option map')
		}

		var onimport = function (tokens) {
		  tokens.shift()
		  var file = tokens.shift().replace(/^"+|"+$/gm, '')

		  if (tokens[0] !== ';') throw new Error('Unexpected token: ' + tokens[0] + '. Expected ";"')

		  tokens.shift()
		  return file
		}

		var onservice = function (tokens) {
		  tokens.shift()

		  var service = {
		    name: tokens.shift(),
		    methods: [],
		    options: {}
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '}') {
		      tokens.shift()
		      // there goes optional semicolon after the enclosing "}"
		      if (tokens[0] === ';') tokens.shift()
		      return service
		    }

		    switch (tokens[0]) {
		      case 'option':
		        var opt = onoption(tokens)
		        if (service.options[opt.name] !== undefined) throw new Error('Duplicate option ' + opt.name)
		        service.options[opt.name] = opt.value
		        break
		      case 'rpc':
		        service.methods.push(onrpc(tokens))
		        break
		      default:
		        throw new Error('Unexpected token in service: ' + tokens[0])
		    }
		  }

		  throw new Error('No closing tag for service')
		}

		var onrpc = function (tokens) {
		  tokens.shift()

		  var rpc = {
		    name: tokens.shift(),
		    input_type: null,
		    output_type: null,
		    client_streaming: false,
		    server_streaming: false,
		    options: {}
		  }

		  if (tokens[0] !== '(') throw new Error('Expected ( but found ' + tokens[0])
		  tokens.shift()

		  if (tokens[0] === 'stream') {
		    tokens.shift()
		    rpc.client_streaming = true
		  }

		  rpc.input_type = tokens.shift()

		  if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0])
		  tokens.shift()

		  if (tokens[0] !== 'returns') throw new Error('Expected returns but found ' + tokens[0])
		  tokens.shift()

		  if (tokens[0] !== '(') throw new Error('Expected ( but found ' + tokens[0])
		  tokens.shift()

		  if (tokens[0] === 'stream') {
		    tokens.shift()
		    rpc.server_streaming = true
		  }

		  rpc.output_type = tokens.shift()

		  if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0])
		  tokens.shift()

		  if (tokens[0] === ';') {
		    tokens.shift()
		    return rpc
		  }

		  if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0])
		  tokens.shift()

		  while (tokens.length) {
		    if (tokens[0] === '}') {
		      tokens.shift()
		      // there goes optional semicolon after the enclosing "}"
		      if (tokens[0] === ';') tokens.shift()
		      return rpc
		    }

		    if (tokens[0] === 'option') {
		      var opt = onoption(tokens)
		      if (rpc.options[opt.name] !== undefined) throw new Error('Duplicate option ' + opt.name)
		      rpc.options[opt.name] = opt.value
		    } else {
		      throw new Error('Unexpected token in rpc options: ' + tokens[0])
		    }
		  }

		  throw new Error('No closing tag for rpc')
		}

		var parse = function (buf) {
		  var tokens = tokenize(buf.toString())
		  // check for isolated strings in tokens by looking for opening quote
		  for (var i = 0; i < tokens.length; i++) {
		    if (/^(\"|\')([^\'\"]*)$/.test(tokens[i])) {
		      var j
		      if (tokens[i].length === 1) {
		        j = i + 1
		      } else {
		        j = i
		      }
		      // look ahead for the closing quote and collapse all
		      // in-between tokens into a single token
		      for (j; j < tokens.length; j++) {
		        if (/^([^\'\"]*)(\"|\')$/.test(tokens[j])) {
		          tokens = tokens.slice(0, i).concat(tokens.slice(i, j + 1).join('')).concat(tokens.slice(j + 1))
		          break
		        }
		      }
		    }
		  }
		  var schema = {
		    syntax: 3,
		    package: null,
		    imports: [],
		    enums: [],
		    messages: [],
		    options: {},
		    extends: []
		  }

		  var firstline = true

		  while (tokens.length) {
		    switch (tokens[0]) {
		      case 'package':
		        schema.package = onpackagename(tokens)
		        break

		      case 'syntax':
		        if (!firstline) throw new Error('Protobuf syntax version should be first thing in file')
		        schema.syntax = onsyntaxversion(tokens)
		        break

		      case 'message':
		        schema.messages.push(onmessage(tokens))
		        break

		      case 'enum':
		        schema.enums.push(onenum(tokens))
		        break

		      case 'option':
		        var opt = onoption(tokens)
		        if (schema.options[opt.name]) throw new Error('Duplicate option ' + opt.name)
		        schema.options[opt.name] = opt.value
		        break

		      case 'import':
		        schema.imports.push(onimport(tokens))
		        break

		      case 'extend':
		        schema.extends.push(onextend(tokens))
		        break

		      case 'service':
		        if (!schema.services) schema.services = []
		        schema.services.push(onservice(tokens))
		        break

		      default:
		        throw new Error('Unexpected token: ' + tokens[0])
		    }
		    firstline = false
		  }

		  // now iterate over messages and propagate extends
		  schema.extends.forEach(function (ext) {
		    schema.messages.forEach(function (msg) {
		      if (msg.name === ext.name) {
		        ext.message.fields.forEach(function (field) {
		          if (!msg.extensions || field.tag < msg.extensions.from || field.tag > msg.extensions.to) {
		            throw new Error(msg.name + ' does not declare ' + field.tag + ' as an extension number')
		          }
		          msg.fields.push(field)
		        })
		      }
		    })
		  })

		  return schema
		}

		module.exports = parse


	/***/ },
	/* 712 */
	/***/ function(module, exports) {

		var onfield = function (f, result) {
		  var prefix = f.repeated ? 'repeated' : f.required ? 'required' : 'optional'
		  if (f.type === 'map') prefix = 'map<' + f.map.from + ',' + f.map.to + '>'
		  if (f.oneof) prefix = ''

		  var opts = Object.keys(f.options || {}).map(function (key) {
		    return key + ' = ' + f.options[key]
		  }).join(',')

		  if (opts) opts = ' [' + opts + ']'

		  result.push((prefix ? prefix + ' ' : '') + (f.map === 'map' ? '' : f.type + ' ') + f.name + ' = ' + f.tag + opts + ';')
		  return result
		}

		var onmessage = function (m, result) {
		  result.push('message ' + m.name + ' {')

		  if (!m.enums) m.enums = []
		  m.enums.forEach(function (e) {
		    result.push(onenum(e, []))
		  })

		  if (!m.messages) m.messages = []
		  m.messages.forEach(function (m) {
		    result.push(onmessage(m, []))
		  })

		  var oneofs = {}

		  if (!m.fields) m.fields = []
		  m.fields.forEach(function (f) {
		    if (f.oneof) {
		      if (!oneofs[f.oneof]) oneofs[f.oneof] = []
		      oneofs[f.oneof].push(onfield(f, []))
		    } else {
		      result.push(onfield(f, []))
		    }
		  })

		  Object.keys(oneofs).forEach(function (n) {
		    oneofs[n].unshift('oneof ' + n + ' {')
		    oneofs[n].push('}')
		    result.push(oneofs[n])
		  })

		  result.push('}', '')
		  return result
		}

		var onenum = function (e, result) {
		  result.push('enum ' + e.name + ' {')

		  var vals = Object.keys(e.values).map(function (key) {
		    return key + ' = ' + e.values[key] + ';'
		  })

		  result.push(vals)
		  result.push('}', '')
		  return result
		}

		var onoption = function (o, result) {
		  var keys = Object.keys(o)
		  keys.forEach(function (option) {
		    var v = o[option]

		    if (~option.indexOf('.')) option = '(' + option + ')'

		    var type = typeof v

		    if (type === 'object') {
		      v = onoptionMap(v, [])
		      if (v.length) result.push('option ' + option + ' = {', v, '};')
		    } else {
		      if (type === 'string' && option !== 'optimize_for') v = '"' + v + '"'
		      result.push('option ' + option + ' = ' + v + ';')
		    }
		  })
		  if (keys.length > 0) {
		    result.push('')
		  }

		  return result
		}

		var onoptionMap = function (o, result) {
		  var keys = Object.keys(o)
		  keys.forEach(function (k) {
		    var v = o[k]

		    var type = typeof v

		    if (type === 'object') {
		      if (Array.isArray(v)) {
		        v.forEach(function (v) {
		          v = onoptionMap(v, [])
		          if (v.length) result.push(k + ' {', v, '}')
		        })
		      } else {
		        v = onoptionMap(v, [])
		        if (v.length) result.push(k + ' {', v, '}')
		      }
		    } else {
		      if (type === 'string') v = '"' + v + '"'
		      result.push(k + ': ' + v)
		    }
		  })

		  return result
		}

		var onservices = function (s, result) {
		  result.push('service ' + s.name + ' {')

		  if (!s.options) s.options = {}

		  onoption(s.options, result)

		  if (!s.methods) s.methods = []
		  s.methods.forEach(function (m) {
		    result.push(onrpc(m, []))
		  })

		  result.push('}', '')
		  return result
		}

		var onrpc = function (rpc, result) {
		  var def = 'rpc ' + rpc.name + '('
		  if (rpc.client_streaming) def += 'stream '
		  def += rpc.input_type + ') returns ('
		  if (rpc.server_streaming) def += 'stream '
		  def += rpc.output_type + ')'

		  if (!rpc.options) rpc.options = {}

		  var options = onoption(rpc.options, [])
		  if (options.length > 1) {
		    result.push(def + ' {', options.slice(0, -1), '}')
		  } else {
		    result.push(def + ';')
		  }

		  return result
		}

		var indent = function (lvl) {
		  return function (line) {
		    if (Array.isArray(line)) return line.map(indent(lvl + '  ')).join('\n')
		    return lvl + line
		  }
		}

		module.exports = function (schema) {
		  var result = []

		  result.push('syntax = "proto' + schema.syntax + '";', '')

		  if (schema.package) result.push('package ' + schema.package + ';', '')

		  if (!schema.options) schema.options = {}

		  onoption(schema.options, result)

		  if (!schema.enums) schema.enums = []
		  schema.enums.forEach(function (e) {
		    onenum(e, result)
		  })

		  if (!schema.messages) schema.messages = []
		  schema.messages.forEach(function (m) {
		    onmessage(m, result)
		  })

		  if (schema.services) {
		    schema.services.forEach(function (s) {
		      onservices(s, result)
		    })
		  }

		  return result.map(indent('')).join('\n')
		}


	/***/ },
	/* 713 */
	/***/ function(module, exports) {

		module.exports = function (sch) {
		  var noComments = function (line) {
		    var i = line.indexOf('//')
		    return i > -1 ? line.slice(0, i) : line
		  }

		  var noMultilineComments = function () {
		    var inside = false
		    return function (token) {
		      if (token === '/*') {
		        inside = true
		        return false
		      }
		      if (token === '*/') {
		        inside = false
		        return false
		      }
		      return !inside
		    }
		  }

		  var trim = function (line) {
		    return line.trim()
		  }

		  return sch
		    .replace(/([;,{}\(\)=\:\[\]<>]|\/\*|\*\/)/g, ' $1 ')
		    .split(/\n/)
		    .map(trim)
		    .filter(Boolean)
		    .map(noComments)
		    .map(trim)
		    .filter(Boolean)
		    .join('\n')
		    .split(/\s+|\n+/gm)
		    .filter(noMultilineComments())
		}


	/***/ },
	/* 714 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var protobuf = __webpack_require__(717)
		var varint = __webpack_require__(725)
		var stream = __webpack_require__(722)
		var util = __webpack_require__(11)
		var debug = __webpack_require__(17)('protocol-buffers-stream')

		var Handshake = protobuf('message Handshake { repeated string messages = 1; }').Handshake

		var camelize = function (key) {
		  return key[0].toLowerCase() + key.slice(1)
		}

		var compile = function (schema) {
		  var messages = protobuf(schema)
		  var encodings = []

		  var toMessage = function (key) {
		    var m = messages[key]
		    return m && typeof m.encode === 'function' && typeof m.decode === 'function' && m.name && m
		  }

		  var handshake = {
		    messages: Object.keys(messages).filter(toMessage)
		  }

		  var Messages = function (opts) {
		    if (!(this instanceof Messages)) return new Messages(opts)
		    if (!opts) opts = {}
		    stream.Duplex.call(this)

		    this.destroyed = false
		    this._handshake = opts.handshake !== false
		    this._missing = 0
		    this._buffer = null
		    this._header = new Buffer(50)
		    this._ptr = 0
		    this._events = []
		    this._decodings = []
		    this._encodings = encodings

		    if (this._handshake) this._push(0, handshake)
		    else this._onhandshake(handshake)
		  }

		  util.inherits(Messages, stream.Duplex)

		  handshake.messages.forEach(function (key, i) {
		    encodings.push(messages[key])
		    Messages.prototype[camelize(key)] = function (obj) {
		      this._push(i + 1, obj)
		    }
		  })

		  Messages.prototype._push = function (id, obj) {
		    if (this.destroyed) return

		    var enc = id === 0 ? Handshake : this._encodings[id - 1]
		    var len = enc.encodingLength(obj)

		    debug('writing %s (id: %d, length: %d)', enc.name, id, len)

		    len += varint.encodingLength(id)

		    var offset = 0
		    var buf = new Buffer(len + varint.encodingLength(len))

		    varint.encode(len, buf, offset)
		    offset += varint.encode.bytes

		    varint.encode(id, buf, offset)
		    offset += varint.encode.bytes

		    enc.encode(obj, buf, offset)
		    this.push(buf)
		  }

		  Messages.prototype.destroy = function (err) {
		    if (this.destroyed) return
		    this.destroyed = true
		    if (err) this.emit('error', err)
		    this.emit('close')
		  }

		  Messages.prototype.finalize = function () {
		    this.push(null)
		  }

		  Messages.prototype._read = function () {
		    // do nothing
		  }

		  Messages.prototype._write = function (data, enc, cb) {
		    while (data && data.length && !this.destroyed) {
		      if (this._missing) data = this._onmessage(data)
		      else data = this._onheader(data)
		    }
		    cb()
		  }

		  Messages.prototype._emit = function () {
		    this._missing = 0
		    this._ptr = 0

		    var id = varint.decode(this._buffer)
		    var enc = id === 0 ? Handshake : this._decodings[id - 1]
		    var evt = id > 0 && this._events[id - 1]

		    if (!enc) {
		      debug('unknown (id: %d)', id)
		      return this.emit('unknown', id)
		    }

		    try {
		      var obj = enc.decode(this._buffer, varint.decode.bytes)
		    } catch (err) {
		      debug('invalid %s (id: %d, length: %d)', enc.name, id, this._buffer.length)
		      return this.emit('invalid', evt, this._buffer)
		    }

		    debug('received %s (id: %d, length: %d)', enc.name, id, this._buffer.length)
		    if (enc !== Handshake) return this.emit(evt, obj)

		    this._onhandshake(obj)

		    return false
		  }

		  Messages.prototype._onhandshake = function (obj) {
		    for (var i = 0; i < obj.messages.length; i++) {
		      this._decodings[i] = toMessage(obj.messages[i]) || null
		      this._events[i] = this._decodings[i] && camelize(this._decodings[i].name)
		    }
		  }

		  Messages.prototype._onmessage = function (data) {
		    var overflow = null

		    if (!this._buffer) {
		      if (data.length === this._missing) {
		        this._buffer = data
		        this._emit()
		        return null
		      }

		      if (data.length > this._missing) {
		        this._buffer = data.slice(0, this._missing)
		        overflow = data.slice(this._missing)
		        this._emit()
		        return overflow
		      }

		      this._buffer = new Buffer(this._missing)
		    }

		    if (data.length === this._missing) {
		      data.copy(this._buffer, this._ptr)
		      this._emit()
		      return null
		    }

		    if (data.length > this._missing) {
		      data.slice(0, this._missing).copy(this._buffer, this._ptr)
		      overflow = data.slice(this._missing)
		      this._emit()
		      return overflow
		    }

		    data.copy(this._buffer, this._ptr)
		    this._ptr += data.length
		    this._missing -= data.length

		    return null
		  }

		  Messages.prototype._onheader = function (data) {
		    for (var i = 0; i < data.length; i++) {
		      this._header[this._ptr++] = data[i]
		      if (data[i] & 0x80) continue
		      this._ptr = 0
		      this._missing = varint.decode(this._header)
		      this._buffer = null
		      debug('expecting message (length: %d)', this._missing)
		      return data.slice(i + 1)
		    }
		    return null
		  }

		  return Messages
		}

		module.exports = compile

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 715 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var encodings = __webpack_require__(716)
		var varint = __webpack_require__(268)
		var genobj = __webpack_require__(248)
		var genfun = __webpack_require__(247)

		var skip = function(type, buffer, offset) {
		  switch (type) {
		    case 0:
		    varint.decode(buffer, offset)
		    return offset + varint.decode.bytes

		    case 1:
		    return offset + 8

		    case 2:
		    var len = varint.decode(buffer, offset)
		    return offset + varint.decode.bytes + len

		    case 3:
		    case 4:
		    throw new Error('Groups are not supported')

		    case 5:
		    return offset + 4
		  }

		  throw new Error('Unknown wire type: '+type)
		}

		var defined = function(val) {
		  return val !== null && val !== undefined
		}

		var isString = function(def) {
		  try {
		    return !!def && typeof JSON.parse(def) === 'string'
		  } catch (err) {
		    return false
		  }
		}

		var defaultValue = function(f, def) {
		  if (f.repeated) return '[]'

		  switch (f.type) {
		    case 'string':
		    return isString(def) ? def : '""'

		    case 'bool':
		    if (def === 'true') return 'true'
		    return 'false'

		    case 'float':
		    case 'double':
		    case 'sfixed32':
		    case 'fixed32':
		    case 'varint':
		    case 'enum':
		    case 'uint64':
		    case 'uint32':
		    case 'int64':
		    case 'int32':
		    case 'sint64':
		    case 'sint32':
		    return ''+parseInt(def || 0)

		    default:
		    return 'null'
		  }
		}

		module.exports = function(schema, extraEncodings) {
		  var messages = {}
		  var enums = {}
		  var cache = {}

		  var visit = function(schema, prefix) {
		    if (schema.enums) {
		      schema.enums.forEach(function(e) {
		        e.id = prefix + (prefix ? '.' : '')+e.name
		        enums[e.id] = e
		        visit(e, e.id)
		      })
		    }
		    if (schema.messages) {
		      schema.messages.forEach(function(m) {
		        m.id = prefix + (prefix ? '.' : '')+m.name
		        messages[m.id] = m
		        visit(m, m.id)
		      })
		    }
		  }

		  visit(schema, '')

		  var compileEnum = function(e) {
		    var conditions = Object.keys(e.values)
		      .map(function(k) {
		        return 'val !== '+parseInt(e.values[k])
		      })
		      .join(' && ')

		    if (!conditions) conditions = 'true'

		    var encode = genfun()
		      ('function encode(val, buf, offset) {')
		        ('if (%s) throw new Error("Invalid enum value: "+val)', conditions)
		        ('varint.encode(val, buf, offset)')
		        ('encode.bytes = varint.encode.bytes')
		        ('return buf')
		      ('}')
		      .toFunction({
		        varint: varint
		      })

		    var decode = genfun()
		      ('function decode(buf, offset) {')
		        ('var val = varint.decode(buf, offset)')
		        ('if (%s) throw new Error("Invalid enum value: "+val)', conditions)
		        ('decode.bytes = varint.decode.bytes')
		        ('return val')
		      ('}')
		      .toFunction({
		        varint: varint
		      })

		    return encodings.make(0, encode, decode, varint.encodingLength)
		  }

		  var compileMessage = function(m, exports) {
		    m.messages.forEach(function (nested) {
		      exports[nested.name] = resolve(nested.name, m.id)
		    })

		    m.enums.forEach(function( val ) {
		      exports[val.name] = val.values
		    })

		    exports.type = 2
		    exports.message = true
		    exports.name = m.name

		    var oneofMap = {}
		    var oneofs = []
		    m.oneof.forEach(function(o) {
		      o.fields.forEach(function(f) {
		        oneofMap[f.name] = o.name
		        oneofs.push({
		          name: f.name,
		          type: f.type,
		          tag: f.tag,
		          required: false,
		          oneof: o.name
		        })
		      })
		    })

		    var fields = m.fields.concat(oneofs)
		    var enc = fields.map(function(f) {
		      return resolve(f.type, m.id)
		    })

		    var forEach = function(fn) {
		      for (var i = 0; i < enc.length; i++) fn(enc[i], fields[i], genobj('obj', fields[i].name), i)
		    }

		    // compile encodingLength

		    var encodingLength = genfun()
		      ('function encodingLength(obj) {')
		        ('var length = 0')

		    forEach(function(e, f, val, i) {
		      var packed = f.repeated && f.options && f.options.packed
		      var hl = varint.encodingLength(f.tag << 3 | e.type)

		      if (f.required) encodingLength('if (!defined(%s)) throw new Error(%s)', val, JSON.stringify(f.name+' is required'))
		      else encodingLength('if (defined(%s)) {', val)

		      if (packed) {
		        encodingLength()
		          ('var packedLen = 0')
		          ('for (var i = 0; i < %s.length; i++) {', val)
		            ('if (!defined(%s)) continue', val+'[i]')
		            ('var len = enc[%d].encodingLength(%s)', i, val+'[i]')
		            ('packedLen += len')
		            if (e.message) encodingLength('packedLen += varint.encodingLength(len)')
		          encodingLength('}')
		          ('if (packedLen) {')
		            ('length += %d + packedLen + varint.encodingLength(packedLen)', hl)
		          ('}')
		      } else {
		        if (f.repeated) {
		          encodingLength('for (var i = 0; i < %s.length; i++) {', val)
		          val += '[i]'
		          encodingLength('if (!defined(%s)) continue', val)
		        }

		        encodingLength('var len = enc[%d].encodingLength(%s)', i, val)
		        if (e.message) encodingLength('length += varint.encodingLength(len)')
		        encodingLength('length += %d + len', hl)
		        if (f.repeated) encodingLength('}')
		      }

		      if (!f.required) encodingLength('}')
		    })

		    encodingLength()
		        ('return length')
		      ('}')

		    encodingLength = encodingLength.toFunction({
		      defined: defined,
		      varint: varint,
		      enc: enc
		    })

		    // compile encode

		    var encode = genfun()
		      ('function encode(obj, buf, offset) {')
		        if (oneofs.length) {
		          // build up clean object with only the last field set for each oneof
		          encode()
		          ('var cleanObj={}, foundOneofs = {}')
		          ('var oneofs = %s', JSON.stringify(oneofMap))
		          ('for (var f in obj) {')
		            ('cleanObj[f] = obj[f]')
		            ('if (oneofs[f]) {')
		              ('if (foundOneofs[oneofs[f]]) {')
		                ('delete cleanObj[foundOneofs[oneofs[f]]]')
		              ('}')
		              ('foundOneofs[oneofs[f]] = f')
		            ('}')
		          ('}')
		          ('obj = cleanObj')
		        }
		        encode()
		        ('if (!offset) offset = 0')
		        ('if (!buf) buf = new Buffer(encodingLength(obj))')
		        ('var oldOffset = offset')

		    forEach(function(e, f, val, i) {
		      if (f.required) encode('if (!defined(%s)) throw new Error(%s)', val, JSON.stringify(f.name+' is required'))
		      else encode('if (defined(%s)) {', val)

		      var packed = f.repeated && f.options && f.options.packed
		      var p = varint.encode(f.tag << 3 | 2)
		      var h = varint.encode(f.tag << 3 | e.type)

		      if (packed) {
		        encode()
		          ('var packedLen = 0')
		          ('for (var i = 0; i < %s.length; i++) {', val)
		            ('if (!defined(%s)) continue', val+'[i]')
		            ('packedLen += enc[%d].encodingLength(%s)', i, val+'[i]')
		          ('}')

		        encode('if (packedLen) {')
		        for (var j = 0; j < h.length; j++) encode('buf[offset++] = %d', p[j])
		        encode('varint.encode(packedLen, buf, offset)')
		        encode('offset += varint.encode.bytes')
		        encode('}')
		      }

		      if (f.repeated) {
		        encode('for (var i = 0; i < %s.length; i++) {', val)
		        val += '[i]'
		        encode('if (!defined(%s)) continue', val)
		      }

		      if (!packed) for (var j = 0; j < h.length; j++) encode('buf[offset++] = %d', h[j])

		      if (e.message) {
		        encode('varint.encode(enc[%d].encodingLength(%s), buf, offset)', i, val)
		        encode('offset += varint.encode.bytes')
		      }

		      encode('enc[%d].encode(%s, buf, offset)', i, val)
		      encode('offset += enc[%d].encode.bytes', i)

		      if (f.repeated) encode('}')
		      if (!f.required) encode('}')
		    })

		    encode()
		        ('encode.bytes = offset - oldOffset')
		        ('return buf')
		      ('}')

		    encode = encode.toFunction({
		      encodingLength: encodingLength,
		      defined: defined,
		      varint: varint,
		      enc: enc,
		      Buffer: Buffer
		    })

		    // compile proto

		    var Message = genfun()

		    Message('function Message() {')
		    forEach(function(e, f) {
		      var def = f.options && f.options.default
		      var resolved = resolve(f.type, m.id, false)
		      var vals = resolved && resolved.values

		      if (vals) { // is enum
		        if (f.repeated) {
		          Message('%s = []', genobj('this', f.name))
		        } else {
		          def = (def && def in vals) ? vals[def] : vals[Object.keys(vals)[0]]
		          Message('%s = %s', genobj('this', f.name), ''+parseInt(def || 0))
		        }
		        return
		      }

		      // only set defaults if not a oneof
		      if (f.oneof == null) {
		        Message('%s = %s', genobj('this', f.name), defaultValue(f, def))
		      }
		    })
		    Message('}')

		    Message = Message.toFunction()

		    // compile decode

		    var invalid = m.fields
		      .map(function(f, i) {
		        return f.required && '!found'+i
		      })
		      .filter(function(f) {
		        return f
		      })
		      .join(' || ')

		    var decode = genfun()

		    decode()
		      ('function decode(buf, offset, end) {')
		        ('if (!offset) offset = 0')
		        ('if (!end) end = buf.length')
		        ('if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")')
		        ('var oldOffset = offset')
		        ('var obj = new Message()')
		        if (oneofs.length) {
		          decode()
		          ('var oneofs = %s', JSON.stringify(oneofMap))
		          ('var foundOneofs = {}')
		        }

		    forEach(function(e, f, val, i) {
		      if (f.required) decode('var found%d = false', i)
		    })

		    decode('while (true) {')
		      ('if (end <= offset) {')
		        (invalid && 'if (%s) throw new Error("Decoded message is not valid")', invalid)
		        ('decode.bytes = offset - oldOffset')
		        ('return obj')
		      ('}')
		      ('var prefix = varint.decode(buf, offset)')
		      ('offset += varint.decode.bytes')
		      ('var tag = prefix >> 3')
		      ('switch (tag) {')

		    forEach(function(e, f, val, i) {
		      var packed = f.repeated && f.options && f.options.packed

		      decode('case %d:', f.tag)

		      if (packed) {
		        decode()
		          ('var packedEnd = varint.decode(buf, offset)')
		          ('offset += varint.decode.bytes')
		          ('packedEnd += offset')
		          ('while (offset < packedEnd) {')
		      }

		      if (e.message) {
		        decode('var len = varint.decode(buf, offset)')
		        decode('offset += varint.decode.bytes')
		        if (f.repeated) decode('%s.push(enc[%d].decode(buf, offset, offset + len))', val, i)
		        else decode('%s = enc[%d].decode(buf, offset, offset + len)', val, i)
		      } else {
		        if (f.repeated) decode('%s.push(enc[%d].decode(buf, offset))', val, i)
		        else {
		          decode('%s = enc[%d].decode(buf, offset)', val, i)
		          // if a oneof, only keep the last value in the buffer
		          if (oneofs.length && f.oneof) {
		            decode('var f = "%s"', f.name)
		            ('if (oneofs[f]) {')
		              ('if (foundOneofs[oneofs[f]]) {')
		                ('delete obj[foundOneofs[oneofs[f]]]')
		              ('}')
		              ('foundOneofs[oneofs[f]] = f')
		            ('}')
		          }
		        }
		      }

		      decode('offset += enc[%d].decode.bytes', i)

		      if (packed) decode('}')
		      if (f.required) decode('found%d = true', i)
		      decode('break')
		    })

		    decode()
		          ('default:')
		          ('offset = skip(prefix & 7, buf, offset)')
		        ('}')
		      ('}')
		    ('}')

		    decode = decode.toFunction({
		      Message: Message,
		      varint: varint,
		      skip: skip,
		      enc: enc
		    })


		    // end of compilation - return all the things

		    encode.bytes = decode.bytes = 0

		    exports.buffer = true
		    exports.encode = encode
		    exports.decode = decode
		    exports.encodingLength = encodingLength

		    return exports
		  }

		  var resolve = function(name, from, compile) {
		    if (extraEncodings && extraEncodings[name]) return extraEncodings[name]
		    if (encodings[name]) return encodings[name]

		    var m = (from ? from+'.'+name : name).split('.')
		      .map(function(part, i, list) {
		        return list.slice(0, i).concat(name).join('.')
		      })
		      .reverse()
		      .reduce(function(result, id) {
		        return result || messages[id] || enums[id]
		      }, null)

		    if (compile === false) return m
		    if (!m) throw new Error('Could not resolve '+name)

		    if (m.values) return compileEnum(m)
		    return cache[m.id] || compileMessage(m, cache[m.id] = {})
		  }

		  return (schema.enums || []).concat((schema.messages || []).map(function(message) {
		    return resolve(message.id)
		  }))
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 716 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var varint = __webpack_require__(268)
		var svarint = __webpack_require__(281)

		var encoder = function(type, encode, decode, encodingLength) {
		  encode.bytes = decode.bytes = 0

		  return {
		    type: type,
		    encode: encode,
		    decode: decode,
		    encodingLength: encodingLength
		  }
		}

		exports.make = encoder

		exports.bytes = function(tag) {
		  var bufferLength = function(val) {
		    return Buffer.isBuffer(val) ? val.length : Buffer.byteLength(val)
		  }

		  var encodingLength = function(val) {
		    var len = bufferLength(val)
		    return varint.encodingLength(len) + len
		  }

		  var encode = function(val, buffer, offset) {
		    var oldOffset = offset
		    var len = bufferLength(val)

		    varint.encode(len, buffer, offset)
		    offset += varint.encode.bytes

		    if (Buffer.isBuffer(val)) val.copy(buffer, offset)
		    else buffer.write(val, offset, len)
		    offset += len

		    encode.bytes = offset - oldOffset
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var oldOffset = offset

		    var len = varint.decode(buffer, offset)
		    offset += varint.decode.bytes

		    var val = buffer.slice(offset, offset+len)
		    offset += val.length

		    decode.bytes = offset - oldOffset
		    return val
		  }

		  return encoder(2, encode, decode, encodingLength)
		}()

		exports.string = function() {
		  var encodingLength = function(val) {
		    var len = Buffer.byteLength(val)
		    return varint.encodingLength(len) + len
		  }

		  var encode = function(val, buffer, offset) {
		    var oldOffset = offset
		    var len = Buffer.byteLength(val)

		    varint.encode(len, buffer, offset, 'utf-8')
		    offset += varint.encode.bytes

		    buffer.write(val, offset, len)
		    offset += len

		    encode.bytes = offset - oldOffset
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var oldOffset = offset

		    var len = varint.decode(buffer, offset)
		    offset += varint.decode.bytes

		    var val = buffer.toString('utf-8', offset, offset+len)
		    offset += len

		    decode.bytes = offset - oldOffset
		    return val
		  }

		  return encoder(2, encode, decode, encodingLength)
		}()

		exports.bool = function() {
		  var encodingLength = function(val) {
		    return 1
		  }

		  var encode = function(val, buffer, offset) {
		    buffer[offset] = val ? 1 : 0
		    encode.bytes = 1
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var bool = buffer[offset] > 0
		    decode.bytes = 1
		    return bool
		  }

		  return encoder(0, encode, decode, encodingLength)
		}()

		exports.int32 = function() {
		  var decode = function(buffer, offset) {
		    var val = varint.decode(buffer, offset)
		    decode.bytes = varint.decode.bytes
		    return val > 2147483647 ? val - 4294967296 : val
		  }

		  var encode = function(val, buffer, offset) {
		    varint.encode(val < 0 ? val + 4294967296 : val, buffer, offset)
		    encode.bytes = varint.encode.bytes
		    return buffer
		  }

		  var encodingLength = function(val) {
		    return varint.encodingLength(val < 0 ? val + 4294967296 : val)
		  }

		  return encoder(0, varint.encode, decode, encodingLength)
		}()

		exports.int64 = function() {
		  var decode = function(buffer, offset) {
		    var val = varint.decode(buffer, offset)
		    if (val >= Math.pow(2,63)) {
		      var limit = 9;
		      while (buffer[offset+limit-1] === 0xff) limit--
		      limit = limit || 9;
		      var subset = new Buffer(limit)
		      buffer.copy(subset, 0, offset, offset+limit)
		      subset[limit-1] = subset[limit-1] & 0x7f
		      val = -1 * varint.decode(subset, 0)
		      decode.bytes = 10
		    } else {
		      decode.bytes = varint.decode.bytes
		    }
		    return val
		  }

		  var encode = function(val, buffer, offset) {
		    if (val < 0) {
		      var last = offset + 9;
		      varint.encode(val * -1, buffer, offset)
		      offset += varint.encode.bytes - 1
		      buffer[offset] = buffer[offset] | 0x80
		      while (offset < last - 1) {
		        offset++
		        buffer[offset] = 0xff
		      }
		      buffer[last] = 0x01
		      encode.bytes = 10
		    } else {
		      varint.encode(val, buffer, offset)
		      encode.bytes = varint.encode.bytes
		    }
		    return buffer
		  }

		  var encodingLength = function(val) {
		    return val < 0 ? 10 : varint.encodingLength(val)
		  }

		  return encoder(0, encode, decode, encodingLength)
		}()

		exports.sint32 =
		exports.sint64 = function() {
		  return encoder(0, svarint.encode, svarint.decode, svarint.encodingLength)
		}()

		exports.uint32 =
		exports.uint64 =
		exports.enum =
		exports.varint = function() {
		  return encoder(0, varint.encode, varint.decode, varint.encodingLength)
		}()

		// we cannot represent these in javascript so we just use buffers
		exports.fixed64 =
		exports.sfixed64 = function() {
		  var encodingLength = function(val) {
		    return 8
		  }

		  var encode = function(val, buffer, offset) {
		    val.copy(buffer, offset)
		    encode.bytes = 8
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var val = buffer.slice(offset, offset + 8)
		    decode.bytes = 8
		    return val
		  }

		  return encoder(1, encode, decode, encodingLength)
		}()

		exports.double = function() {
		  var encodingLength = function(val) {
		    return 8
		  }

		  var encode = function(val, buffer, offset) {
		    buffer.writeDoubleLE(val, offset)
		    encode.bytes = 8
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var val = buffer.readDoubleLE(offset)
		    decode.bytes = 8
		    return val
		  }

		  return encoder(1, encode, decode, encodingLength)
		}()

		exports.fixed32 = function() {
		  var encodingLength = function(val) {
		    return 4
		  }

		  var encode = function(val, buffer, offset) {
		    buffer.writeUInt32LE(val, offset)
		    encode.bytes = 4
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var val = buffer.readUInt32LE(offset)
		    decode.bytes = 4
		    return val
		  }

		  return encoder(5, encode, decode, encodingLength)
		}()

		exports.sfixed32 = function() {
		  var encodingLength = function(val) {
		    return 4
		  }

		  var encode = function(val, buffer, offset) {
		    buffer.writeInt32LE(val, offset)
		    encode.bytes = 4
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var val = buffer.readInt32LE(offset)
		    decode.bytes = 4
		    return val
		  }

		  return encoder(5, encode, decode, encodingLength)
		}()

		exports.float = function() {
		  var encodingLength = function(val) {
		    return 4
		  }

		  var encode = function(val, buffer, offset) {
		    buffer.writeFloatLE(val, offset)
		    encode.bytes = 4
		    return buffer
		  }

		  var decode = function(buffer, offset) {
		    var val = buffer.readFloatLE(offset)
		    decode.bytes = 4
		    return val
		  }

		  return encoder(5, encode, decode, encodingLength)
		}()

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 717 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var schema = __webpack_require__(706)
		var compile = __webpack_require__(715)


		module.exports = function(proto, opts) {
		  if (!opts) opts = {}
		  if (!proto) throw new Error('Pass in a .proto string or a protobuf-schema parsed object')

		  var sch = (typeof proto === 'object' && !Buffer.isBuffer(proto)) ? proto : schema.parse(proto)

		  // to not make toString,toJSON enumarable we make a fire-and-forget prototype
		  var Messages = function() {
		    var self = this

		    compile(sch, opts.encodings || {}).forEach(function(m) {
		      self[m.name] = m.values || m
		    })
		  }

		  Messages.prototype.toString = function() {
		    return schema.stringify(sch)
		  }

		  Messages.prototype.toJSON = function() {
		    return sch
		  }

		  return new Messages()
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 718 */
	/***/ function(module, exports) {

		module.exports = read

		var MSB = 0x80
		  , REST = 0x7F

		function read(buf, offset) {
		  var res    = 0
		    , offset = offset || 0
		    , shift  = 0
		    , counter = offset
		    , b
		    , l = buf.length
		  
		  do {
		    if(counter >= l) {
		      read.bytesRead = 0
		      return undefined
		    }
		    b = buf[counter++]
		    res += shift < 28
		      ? (b & REST) << shift
		      : (b & REST) * Math.pow(2, shift)
		    shift += 7
		  } while (b >= MSB)
		  
		  read.bytes = counter - offset
		  
		  return res
		}


	/***/ },
	/* 719 */
	/***/ function(module, exports) {

		module.exports = encode

		var MSB = 0x80
		  , REST = 0x7F
		  , MSBALL = ~REST
		  , INT = Math.pow(2, 31)

		function encode(num, out, offset) {
		  out = out || []
		  offset = offset || 0
		  var oldOffset = offset

		  while(num >= INT) {
		    out[offset++] = (num & 0xFF) | MSB
		    num /= 128
		  }
		  while(num & MSBALL) {
		    out[offset++] = (num & 0xFF) | MSB
		    num >>>= 7
		  }
		  out[offset] = num | 0
		  
		  encode.bytes = offset - oldOffset + 1
		  
		  return out
		}


	/***/ },
	/* 720 */
	/***/ function(module, exports) {

		
		var N1 = Math.pow(2,  7)
		var N2 = Math.pow(2, 14)
		var N3 = Math.pow(2, 21)
		var N4 = Math.pow(2, 28)
		var N5 = Math.pow(2, 35)
		var N6 = Math.pow(2, 42)
		var N7 = Math.pow(2, 49)
		var N8 = Math.pow(2, 56)
		var N9 = Math.pow(2, 63)

		module.exports = function (value) {
		  return (
		    value < N1 ? 1
		  : value < N2 ? 2
		  : value < N3 ? 3
		  : value < N4 ? 4
		  : value < N5 ? 5
		  : value < N6 ? 6
		  : value < N7 ? 7
		  : value < N8 ? 8
		  : value < N9 ? 9
		  :              10
		  )
		}


	/***/ },
	/* 721 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(270);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 722 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(269);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(271);
		exports.Duplex = __webpack_require__(78);
		exports.Transform = __webpack_require__(270);
		exports.PassThrough = __webpack_require__(721);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 723 */
	/***/ function(module, exports) {

		module.exports = read

		var MSB = 0x80
		  , REST = 0x7F

		function read(buf, offset) {
		  var res    = 0
		    , offset = offset || 0
		    , shift  = 0
		    , counter = offset
		    , b
		    , l = buf.length
		  
		  do {
		    if(counter >= l) {
		      read.bytesRead = 0
		      return undefined
		    }
		    b = buf[counter++]
		    res += shift < 28
		      ? (b & REST) << shift
		      : (b & REST) * Math.pow(2, shift)
		    shift += 7
		  } while (b >= MSB)
		  
		  read.bytes = counter - offset
		  
		  return res
		}


	/***/ },
	/* 724 */
	/***/ function(module, exports) {

		module.exports = encode

		var MSB = 0x80
		  , REST = 0x7F
		  , MSBALL = ~REST
		  , INT = Math.pow(2, 31)

		function encode(num, out, offset) {
		  out = out || []
		  offset = offset || 0
		  var oldOffset = offset

		  while(num >= INT) {
		    out[offset++] = (num & 0xFF) | MSB
		    num /= 128
		  }
		  while(num & MSBALL) {
		    out[offset++] = (num & 0xFF) | MSB
		    num >>>= 7
		  }
		  out[offset] = num | 0
		  
		  encode.bytes = offset - oldOffset + 1
		  
		  return out
		}


	/***/ },
	/* 725 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = {
		    encode: __webpack_require__(724)
		  , decode: __webpack_require__(723)
		  , encodingLength: __webpack_require__(726)
		}


	/***/ },
	/* 726 */
	/***/ function(module, exports) {

		
		var N1 = Math.pow(2,  7)
		var N2 = Math.pow(2, 14)
		var N3 = Math.pow(2, 21)
		var N4 = Math.pow(2, 28)
		var N5 = Math.pow(2, 35)
		var N6 = Math.pow(2, 42)
		var N7 = Math.pow(2, 49)

		module.exports = function (value) {
		  return (
		    value < N1 ? 1
		  : value < N2 ? 2
		  : value < N3 ? 3
		  : value < N4 ? 4
		  : value < N5 ? 5
		  : value < N6 ? 6
		  : value < N7 ? 7
		  :              8
		  )
		}


	/***/ },
	/* 727 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/* eslint-disable no-spaced-func */
		/* eslint-disable no-unexpected-multiline */
		var encodings = __webpack_require__(728)
		var varint = __webpack_require__(93)
		var genobj = __webpack_require__(248)
		var genfun = __webpack_require__(247)

		var skip = function (type, buffer, offset) {
		  switch (type) {
		    case 0:
		      varint.decode(buffer, offset)
		      return offset + varint.decode.bytes

		    case 1:
		      return offset + 8

		    case 2:
		      var len = varint.decode(buffer, offset)
		      return offset + varint.decode.bytes + len

		    case 3:
		    case 4:
		      throw new Error('Groups are not supported')

		    case 5:
		      return offset + 4
		  }

		  throw new Error('Unknown wire type: ' + type)
		}

		var defined = function (val) {
		  return val !== null && val !== undefined && (typeof val !== 'number' || !isNaN(val))
		}

		var isString = function (def) {
		  try {
		    return !!def && typeof JSON.parse(def) === 'string'
		  } catch (err) {
		    return false
		  }
		}

		var defaultValue = function (f, def) {
		  if (f.map) return '{}'
		  if (f.repeated) return '[]'

		  switch (f.type) {
		    case 'string':
		      return isString(def) ? def : '""'

		    case 'bool':
		      if (def === 'true') return 'true'
		      return 'false'

		    case 'float':
		    case 'double':
		    case 'sfixed32':
		    case 'fixed32':
		    case 'varint':
		    case 'enum':
		    case 'uint64':
		    case 'uint32':
		    case 'int64':
		    case 'int32':
		    case 'sint64':
		    case 'sint32':
		      return '' + Number(def || 0)

		    default:
		      return 'null'
		  }
		}

		module.exports = function (schema, extraEncodings) {
		  var messages = {}
		  var enums = {}
		  var cache = {}

		  var visit = function (schema, prefix) {
		    if (schema.enums) {
		      schema.enums.forEach(function (e) {
		        e.id = prefix + (prefix ? '.' : '') + e.name
		        enums[e.id] = e
		        visit(e, e.id)
		      })
		    }
		    if (schema.messages) {
		      schema.messages.forEach(function (m) {
		        m.id = prefix + (prefix ? '.' : '') + m.name
		        messages[m.id] = m
		        m.fields.forEach(function (f) {
		          if (!f.map) return

		          var name = 'Map_' + f.map.from + '_' + f.map.to
		          var map = {
		            name: name,
		            enums: [],
		            messages: [],
		            fields: [{
		              name: 'key',
		              type: f.map.from,
		              tag: 1,
		              repeated: false,
		              required: true
		            }, {
		              name: 'value',
		              type: f.map.to,
		              tag: 2,
		              repeated: false,
		              required: false
		            }],
		            extensions: null,
		            id: prefix + (prefix ? '.' : '') + name
		          }

		          if (!messages[map.id]) {
		            messages[map.id] = map
		            schema.messages.push(map)
		          }
		          f.type = name
		          f.repeated = true
		        })
		        visit(m, m.id)
		      })
		    }
		  }

		  visit(schema, '')

		  var compileEnum = function (e) {
		    var conditions = Object.keys(e.values)
		      .map(function (k) {
		        return 'val !== ' + parseInt(e.values[k], 10)
		      })
		      .join(' && ')

		    if (!conditions) conditions = 'true'

		    var encode = genfun()
		      ('function encode (val, buf, offset) {')
		        ('if (%s) throw new Error("Invalid enum value: "+val)', conditions)
		        ('varint.encode(val, buf, offset)')
		        ('encode.bytes = varint.encode.bytes')
		        ('return buf')
		      ('}')
		      .toFunction({
		        varint: varint
		      })

		    var decode = genfun()
		      ('function decode (buf, offset) {')
		        ('var val = varint.decode(buf, offset)')
		        ('if (%s) throw new Error("Invalid enum value: "+val)', conditions)
		        ('decode.bytes = varint.decode.bytes')
		        ('return val')
		      ('}')
		      .toFunction({
		        varint: varint
		      })

		    return encodings.make(0, encode, decode, varint.encodingLength)
		  }

		  var compileMessage = function (m, exports) {
		    m.messages.forEach(function (nested) {
		      exports[nested.name] = resolve(nested.name, m.id)
		    })

		    m.enums.forEach(function (val) {
		      exports[val.name] = val.values
		    })

		    exports.type = 2
		    exports.message = true
		    exports.name = m.name

		    var oneofs = {}

		    m.fields.forEach(function (f) {
		      if (!f.oneof) return
		      if (!oneofs[f.oneof]) oneofs[f.oneof] = []
		      oneofs[f.oneof].push(f.name)
		    })

		    var enc = m.fields.map(function (f) {
		      return resolve(f.type, m.id)
		    })

		    var forEach = function (fn) {
		      for (var i = 0; i < enc.length; i++) fn(enc[i], m.fields[i], genobj('obj', m.fields[i].name), i)
		    }

		    // compile encodingLength

		    var encodingLength = genfun()
		      ('function encodingLength (obj) {')
		        ('var length = 0')

		    Object.keys(oneofs).forEach(function (name) {
		      var msg = JSON.stringify('only one of the properties defined in oneof ' + name + ' can be set')
		      var cnt = oneofs[name]
		        .map(function (prop) {
		          return '+defined(' + genobj('obj', prop) + ')'
		        })
		        .join(' + ')

		      encodingLength('if ((%s) > 1) throw new Error(%s)', cnt, msg)
		    })

		    forEach(function (e, f, val, i) {
		      var packed = f.repeated && f.options && f.options.packed && f.options.packed !== 'false'
		      var hl = varint.encodingLength(f.tag << 3 | e.type)

		      if (f.required) encodingLength('if (!defined(%s)) throw new Error(%s)', val, JSON.stringify(f.name + ' is required'))
		      else encodingLength('if (defined(%s)) {', val)

		      if (f.map) {
		        encodingLength()
		          ('var tmp = Object.keys(%s)', val)
		          ('for (var i = 0; i < tmp.length; i++) {')
		            ('tmp[i] = {key: tmp[i], value: %s[tmp[i]]}', val)
		          ('}')
		        val = 'tmp'
		      }

		      if (packed) {
		        encodingLength()
		          ('var packedLen = 0')
		          ('for (var i = 0; i < %s.length; i++) {', val)
		            ('if (!defined(%s)) continue', val + '[i]')
		            ('var len = enc[%d].encodingLength(%s)', i, val + '[i]')
		            ('packedLen += len')

		        if (e.message) encodingLength('packedLen += varint.encodingLength(len)')

		        encodingLength('}')
		          ('if (packedLen) {')
		            ('length += %d + packedLen + varint.encodingLength(packedLen)', hl)
		          ('}')
		      } else {
		        if (f.repeated) {
		          encodingLength('for (var i = 0; i < %s.length; i++) {', val)
		          val += '[i]'
		          encodingLength('if (!defined(%s)) continue', val)
		        }

		        encodingLength('var len = enc[%d].encodingLength(%s)', i, val)
		        if (e.message) encodingLength('length += varint.encodingLength(len)')
		        encodingLength('length += %d + len', hl)
		        if (f.repeated) encodingLength('}')
		      }

		      if (!f.required) encodingLength('}')
		    })

		    encodingLength()
		        ('return length')
		      ('}')

		    encodingLength = encodingLength.toFunction({
		      defined: defined,
		      varint: varint,
		      enc: enc
		    })

		    // compile encode

		    var encode = genfun()
		      ('function encode (obj, buf, offset) {')
		        ('if (!offset) offset = 0')
		        ('if (!buf) buf = new Buffer(encodingLength(obj))')
		        ('var oldOffset = offset')

		    Object.keys(oneofs).forEach(function (name) {
		      var msg = JSON.stringify('only one of the properties defined in oneof ' + name + ' can be set')
		      var cnt = oneofs[name]
		        .map(function (prop) {
		          return '+defined(' + genobj('obj', prop) + ')'
		        })
		        .join(' + ')

		      encode('if ((%s) > 1) throw new Error(%s)', cnt, msg)
		    })

		    forEach(function (e, f, val, i) {
		      if (f.required) encode('if (!defined(%s)) throw new Error(%s)', val, JSON.stringify(f.name + ' is required'))
		      else encode('if (defined(%s)) {', val)

		      var packed = f.repeated && f.options && f.options.packed && f.options.packed !== 'false'
		      var p = varint.encode(f.tag << 3 | 2)
		      var h = varint.encode(f.tag << 3 | e.type)
		      var j

		      if (f.map) {
		        encode()
		          ('var tmp = Object.keys(%s)', val)
		          ('for (var i = 0; i < tmp.length; i++) {')
		            ('tmp[i] = {key: tmp[i], value: %s[tmp[i]]}', val)
		          ('}')
		        val = 'tmp'
		      }

		      if (packed) {
		        encode()
		          ('var packedLen = 0')
		          ('for (var i = 0; i < %s.length; i++) {', val)
		            ('if (!defined(%s)) continue', val + '[i]')
		            ('packedLen += enc[%d].encodingLength(%s)', i, val + '[i]')
		          ('}')

		        encode('if (packedLen) {')
		        for (j = 0; j < h.length; j++) encode('buf[offset++] = %d', p[j])
		        encode('varint.encode(packedLen, buf, offset)')
		        encode('offset += varint.encode.bytes')
		        encode('}')
		      }

		      if (f.repeated) {
		        encode('for (var i = 0; i < %s.length; i++) {', val)
		        val += '[i]'
		        encode('if (!defined(%s)) continue', val)
		      }

		      if (!packed) for (j = 0; j < h.length; j++) encode('buf[offset++] = %d', h[j])

		      if (e.message) {
		        encode('varint.encode(enc[%d].encodingLength(%s), buf, offset)', i, val)
		        encode('offset += varint.encode.bytes')
		      }

		      encode('enc[%d].encode(%s, buf, offset)', i, val)
		      encode('offset += enc[%d].encode.bytes', i)

		      if (f.repeated) encode('}')
		      if (!f.required) encode('}')
		    })

		    encode()
		        ('encode.bytes = offset - oldOffset')
		        ('return buf')
		      ('}')

		    encode = encode.toFunction({
		      encodingLength: encodingLength,
		      defined: defined,
		      varint: varint,
		      enc: enc,
		      Buffer: Buffer
		    })

		    // compile decode

		    var invalid = m.fields
		      .map(function (f, i) {
		        return f.required && '!found' + i
		      })
		      .filter(function (f) {
		        return f
		      })
		      .join(' || ')

		    var decode = genfun()

		    var objectKeys = []
		    forEach(function (e, f) {
		      var def = f.options && f.options.default
		      var resolved = resolve(f.type, m.id, false)
		      var vals = resolved && resolved.values

		      if (vals) { // is enum
		        if (f.repeated) {
		          objectKeys.push(genobj.property(f.name) + ': []')
		        } else {
		          def = (def && def in vals) ? vals[def] : vals[Object.keys(vals)[0]]
		          objectKeys.push(genobj.property(f.name) + ': ' + parseInt(def || 0, 10))
		        }
		        return
		      }

		      if (!f.oneof) {
		        objectKeys.push(genobj.property(f.name) + ': ' + defaultValue(f, def))
		      }
		    })

		    decode()
		      ('function decode (buf, offset, end) {')
		        ('if (!offset) offset = 0')
		        ('if (!end) end = buf.length')
		        ('if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")')
		        ('var oldOffset = offset')
		        ('var obj = {')

		    objectKeys.forEach(function (prop, i) {
		      decode(prop + (i === objectKeys.length - 1 ? '' : ','))
		    })

		    decode('}')

		    forEach(function (e, f, val, i) {
		      if (f.required) decode('var found%d = false', i)
		    })

		    decode('while (true) {')
		      ('if (end <= offset) {')
		        (invalid && 'if (%s) throw new Error("Decoded message is not valid")', invalid)
		        ('decode.bytes = offset - oldOffset')
		        ('return obj')
		      ('}')
		      ('var prefix = varint.decode(buf, offset)')
		      ('offset += varint.decode.bytes')
		      ('var tag = prefix >> 3')
		      ('switch (tag) {')

		    forEach(function (e, f, val, i) {
		      var packed = f.repeated && f.options && f.options.packed && f.options.packed !== 'false'

		      decode('case %d:', f.tag)

		      if (f.oneof) {
		        m.fields.forEach(function (otherField) {
		          if (otherField.oneof === f.oneof && f.name !== otherField.name) {
		            decode('delete %s', genobj('obj', otherField.name))
		          }
		        })
		      }

		      if (packed) {
		        decode()
		          ('var packedEnd = varint.decode(buf, offset)')
		          ('offset += varint.decode.bytes')
		          ('packedEnd += offset')
		          ('while (offset < packedEnd) {')
		      }

		      if (e.message) {
		        decode('var len = varint.decode(buf, offset)')
		        decode('offset += varint.decode.bytes')
		        if (f.map) {
		          decode('var tmp = enc[%d].decode(buf, offset, offset + len)', i)
		          decode('%s[tmp.key] = tmp.value', val)
		        } else if (f.repeated) {
		          decode('%s.push(enc[%d].decode(buf, offset, offset + len))', val, i)
		        } else {
		          decode('%s = enc[%d].decode(buf, offset, offset + len)', val, i)
		        }
		      } else {
		        if (f.repeated) {
		          decode('%s.push(enc[%d].decode(buf, offset))', val, i)
		        } else {
		          decode('%s = enc[%d].decode(buf, offset)', val, i)
		        }
		      }

		      decode('offset += enc[%d].decode.bytes', i)

		      if (packed) decode('}')
		      if (f.required) decode('found%d = true', i)
		      decode('break')
		    })

		    decode()
		          ('default:')
		          ('offset = skip(prefix & 7, buf, offset)')
		        ('}')
		      ('}')
		    ('}')

		    decode = decode.toFunction({
		      varint: varint,
		      skip: skip,
		      enc: enc
		    })

		    // end of compilation - return all the things

		    encode.bytes = decode.bytes = 0

		    exports.buffer = true
		    exports.encode = encode
		    exports.decode = decode
		    exports.encodingLength = encodingLength

		    return exports
		  }

		  var resolve = function (name, from, compile) {
		    if (extraEncodings && extraEncodings[name]) return extraEncodings[name]
		    if (encodings[name]) return encodings[name]

		    var m = (from ? from + '.' + name : name).split('.')
		      .map(function (part, i, list) {
		        return list.slice(0, i).concat(name).join('.')
		      })
		      .reverse()
		      .reduce(function (result, id) {
		        return result || messages[id] || enums[id]
		      }, null)

		    if (compile === false) return m
		    if (!m) throw new Error('Could not resolve ' + name)

		    if (m.values) return compileEnum(m)
		    return cache[m.id] || compileMessage(m, cache[m.id] = {})
		  }

		  return (schema.enums || []).concat((schema.messages || []).map(function (message) {
		    return resolve(message.id)
		  }))
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 728 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var varint = __webpack_require__(93)
		var svarint = __webpack_require__(281)

		var encoder = function (type, encode, decode, encodingLength) {
		  encode.bytes = decode.bytes = 0

		  return {
		    type: type,
		    encode: encode,
		    decode: decode,
		    encodingLength: encodingLength
		  }
		}

		exports.make = encoder

		exports.bytes = (function (tag) {
		  var bufferLength = function (val) {
		    return Buffer.isBuffer(val) ? val.length : Buffer.byteLength(val)
		  }

		  var encodingLength = function (val) {
		    var len = bufferLength(val)
		    return varint.encodingLength(len) + len
		  }

		  var encode = function (val, buffer, offset) {
		    var oldOffset = offset
		    var len = bufferLength(val)

		    varint.encode(len, buffer, offset)
		    offset += varint.encode.bytes

		    if (Buffer.isBuffer(val)) val.copy(buffer, offset)
		    else buffer.write(val, offset, len)
		    offset += len

		    encode.bytes = offset - oldOffset
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var oldOffset = offset

		    var len = varint.decode(buffer, offset)
		    offset += varint.decode.bytes

		    var val = buffer.slice(offset, offset + len)
		    offset += val.length

		    decode.bytes = offset - oldOffset
		    return val
		  }

		  return encoder(2, encode, decode, encodingLength)
		})()

		exports.string = (function () {
		  var encodingLength = function (val) {
		    var len = Buffer.byteLength(val)
		    return varint.encodingLength(len) + len
		  }

		  var encode = function (val, buffer, offset) {
		    var oldOffset = offset
		    var len = Buffer.byteLength(val)

		    varint.encode(len, buffer, offset, 'utf-8')
		    offset += varint.encode.bytes

		    buffer.write(val, offset, len)
		    offset += len

		    encode.bytes = offset - oldOffset
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var oldOffset = offset

		    var len = varint.decode(buffer, offset)
		    offset += varint.decode.bytes

		    var val = buffer.toString('utf-8', offset, offset + len)
		    offset += len

		    decode.bytes = offset - oldOffset
		    return val
		  }

		  return encoder(2, encode, decode, encodingLength)
		})()

		exports.bool = (function () {
		  var encodingLength = function (val) {
		    return 1
		  }

		  var encode = function (val, buffer, offset) {
		    buffer[offset] = val ? 1 : 0
		    encode.bytes = 1
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var bool = buffer[offset] > 0
		    decode.bytes = 1
		    return bool
		  }

		  return encoder(0, encode, decode, encodingLength)
		})()

		exports.int32 = (function () {
		  var decode = function (buffer, offset) {
		    var val = varint.decode(buffer, offset)
		    decode.bytes = varint.decode.bytes
		    return val > 2147483647 ? val - 4294967296 : val
		  }

		  var encode = function (val, buffer, offset) {
		    varint.encode(val < 0 ? val + 4294967296 : val, buffer, offset)
		    encode.bytes = varint.encode.bytes
		    return buffer
		  }

		  var encodingLength = function (val) {
		    return varint.encodingLength(val < 0 ? val + 4294967296 : val)
		  }

		  return encoder(0, varint.encode, decode, encodingLength)
		})()

		exports.int64 = (function () {
		  var decode = function (buffer, offset) {
		    var val = varint.decode(buffer, offset)
		    if (val >= Math.pow(2, 63)) {
		      var limit = 9
		      while (buffer[offset + limit - 1] === 0xff) limit--
		      limit = limit || 9
		      var subset = new Buffer(limit)
		      buffer.copy(subset, 0, offset, offset + limit)
		      subset[limit - 1] = subset[limit - 1] & 0x7f
		      val = -1 * varint.decode(subset, 0)
		      decode.bytes = 10
		    } else {
		      decode.bytes = varint.decode.bytes
		    }
		    return val
		  }

		  var encode = function (val, buffer, offset) {
		    if (val < 0) {
		      var last = offset + 9
		      varint.encode(val * -1, buffer, offset)
		      offset += varint.encode.bytes - 1
		      buffer[offset] = buffer[offset] | 0x80
		      while (offset < last - 1) {
		        offset++
		        buffer[offset] = 0xff
		      }
		      buffer[last] = 0x01
		      encode.bytes = 10
		    } else {
		      varint.encode(val, buffer, offset)
		      encode.bytes = varint.encode.bytes
		    }
		    return buffer
		  }

		  var encodingLength = function (val) {
		    return val < 0 ? 10 : varint.encodingLength(val)
		  }

		  return encoder(0, encode, decode, encodingLength)
		})()

		exports.sint32 =
		exports.sint64 = (function () {
		  return encoder(0, svarint.encode, svarint.decode, svarint.encodingLength)
		})()

		exports.uint32 =
		exports.uint64 =
		exports.enum =
		exports.varint = (function () {
		  return encoder(0, varint.encode, varint.decode, varint.encodingLength)
		})()

		// we cannot represent these in javascript so we just use buffers
		exports.fixed64 =
		exports.sfixed64 = (function () {
		  var encodingLength = function (val) {
		    return 8
		  }

		  var encode = function (val, buffer, offset) {
		    val.copy(buffer, offset)
		    encode.bytes = 8
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var val = buffer.slice(offset, offset + 8)
		    decode.bytes = 8
		    return val
		  }

		  return encoder(1, encode, decode, encodingLength)
		})()

		exports.double = (function () {
		  var encodingLength = function (val) {
		    return 8
		  }

		  var encode = function (val, buffer, offset) {
		    buffer.writeDoubleLE(val, offset)
		    encode.bytes = 8
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var val = buffer.readDoubleLE(offset)
		    decode.bytes = 8
		    return val
		  }

		  return encoder(1, encode, decode, encodingLength)
		})()

		exports.fixed32 = (function () {
		  var encodingLength = function (val) {
		    return 4
		  }

		  var encode = function (val, buffer, offset) {
		    buffer.writeUInt32LE(val, offset)
		    encode.bytes = 4
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var val = buffer.readUInt32LE(offset)
		    decode.bytes = 4
		    return val
		  }

		  return encoder(5, encode, decode, encodingLength)
		})()

		exports.sfixed32 = (function () {
		  var encodingLength = function (val) {
		    return 4
		  }

		  var encode = function (val, buffer, offset) {
		    buffer.writeInt32LE(val, offset)
		    encode.bytes = 4
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var val = buffer.readInt32LE(offset)
		    decode.bytes = 4
		    return val
		  }

		  return encoder(5, encode, decode, encodingLength)
		})()

		exports.float = (function () {
		  var encodingLength = function (val) {
		    return 4
		  }

		  var encode = function (val, buffer, offset) {
		    buffer.writeFloatLE(val, offset)
		    encode.bytes = 4
		    return buffer
		  }

		  var decode = function (buffer, offset) {
		    var val = buffer.readFloatLE(offset)
		    decode.bytes = 4
		    return val
		  }

		  return encoder(5, encode, decode, encodingLength)
		})()

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 729 */
	/***/ function(module, exports, __webpack_require__) {

		exports.publicEncrypt = __webpack_require__(731);
		exports.privateDecrypt = __webpack_require__(730);

		exports.privateEncrypt = function privateEncrypt(key, buf) {
		  return exports.publicEncrypt(key, buf, true);
		};

		exports.publicDecrypt = function publicDecrypt(key, buf) {
		  return exports.privateDecrypt(key, buf, true);
		};

	/***/ },
	/* 730 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var parseKeys = __webpack_require__(127);
		var mgf = __webpack_require__(272);
		var xor = __webpack_require__(274);
		var bn = __webpack_require__(19);
		var crt = __webpack_require__(135);
		var createHash = __webpack_require__(72);
		var withPublic = __webpack_require__(273);
		module.exports = function privateDecrypt(private_key, enc, reverse) {
		  var padding;
		  if (private_key.padding) {
		    padding = private_key.padding;
		  } else if (reverse) {
		    padding = 1;
		  } else {
		    padding = 4;
		  }
		  
		  var key = parseKeys(private_key);
		  var k = key.modulus.byteLength();
		  if (enc.length > k || new bn(enc).cmp(key.modulus) >= 0) {
		    throw new Error('decryption error');
		  }
		  var msg;
		  if (reverse) {
		    msg = withPublic(new bn(enc), key);
		  } else {
		    msg = crt(enc, key);
		  }
		  var zBuffer = new Buffer(k - msg.length);
		  zBuffer.fill(0);
		  msg = Buffer.concat([zBuffer, msg], k);
		  if (padding === 4) {
		    return oaep(key, msg);
		  } else if (padding === 1) {
		    return pkcs1(key, msg, reverse);
		  } else if (padding === 3) {
		    return msg;
		  } else {
		    throw new Error('unknown padding');
		  }
		};

		function oaep(key, msg){
		  var n = key.modulus;
		  var k = key.modulus.byteLength();
		  var mLen = msg.length;
		  var iHash = createHash('sha1').update(new Buffer('')).digest();
		  var hLen = iHash.length;
		  var hLen2 = 2 * hLen;
		  if (msg[0] !== 0) {
		    throw new Error('decryption error');
		  }
		  var maskedSeed = msg.slice(1, hLen + 1);
		  var maskedDb =  msg.slice(hLen + 1);
		  var seed = xor(maskedSeed, mgf(maskedDb, hLen));
		  var db = xor(maskedDb, mgf(seed, k - hLen - 1));
		  if (compare(iHash, db.slice(0, hLen))) {
		    throw new Error('decryption error');
		  }
		  var i = hLen;
		  while (db[i] === 0) {
		    i++;
		  }
		  if (db[i++] !== 1) {
		    throw new Error('decryption error');
		  }
		  return db.slice(i);
		}

		function pkcs1(key, msg, reverse){
		  var p1 = msg.slice(0, 2);
		  var i = 2;
		  var status = 0;
		  while (msg[i++] !== 0) {
		    if (i >= msg.length) {
		      status++;
		      break;
		    }
		  }
		  var ps = msg.slice(2, i - 1);
		  var p2 = msg.slice(i - 1, i);

		  if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)){
		    status++;
		  }
		  if (ps.length < 8) {
		    status++;
		  }
		  if (status) {
		    throw new Error('decryption error');
		  }
		  return  msg.slice(i);
		}
		function compare(a, b){
		  a = new Buffer(a);
		  b = new Buffer(b);
		  var dif = 0;
		  var len = a.length;
		  if (a.length !== b.length) {
		    dif++;
		    len = Math.min(a.length, b.length);
		  }
		  var i = -1;
		  while (++i < len) {
		    dif += (a[i] ^ b[i]);
		  }
		  return dif;
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 731 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var parseKeys = __webpack_require__(127);
		var randomBytes = __webpack_require__(91);
		var createHash = __webpack_require__(72);
		var mgf = __webpack_require__(272);
		var xor = __webpack_require__(274);
		var bn = __webpack_require__(19);
		var withPublic = __webpack_require__(273);
		var crt = __webpack_require__(135);

		var constants = {
		  RSA_PKCS1_OAEP_PADDING: 4,
		  RSA_PKCS1_PADDIN: 1,
		  RSA_NO_PADDING: 3
		};

		module.exports = function publicEncrypt(public_key, msg, reverse) {
		  var padding;
		  if (public_key.padding) {
		    padding = public_key.padding;
		  } else if (reverse) {
		    padding = 1;
		  } else {
		    padding = 4;
		  }
		  var key = parseKeys(public_key);
		  var paddedMsg;
		  if (padding === 4) {
		    paddedMsg = oaep(key, msg);
		  } else if (padding === 1) {
		    paddedMsg = pkcs1(key, msg, reverse);
		  } else if (padding === 3) {
		    paddedMsg = new bn(msg);
		    if (paddedMsg.cmp(key.modulus) >= 0) {
		      throw new Error('data too long for modulus');
		    }
		  } else {
		    throw new Error('unknown padding');
		  }
		  if (reverse) {
		    return crt(paddedMsg, key);
		  } else {
		    return withPublic(paddedMsg, key);
		  }
		};

		function oaep(key, msg){
		  var k = key.modulus.byteLength();
		  var mLen = msg.length;
		  var iHash = createHash('sha1').update(new Buffer('')).digest();
		  var hLen = iHash.length;
		  var hLen2 = 2 * hLen;
		  if (mLen > k - hLen2 - 2) {
		    throw new Error('message too long');
		  }
		  var ps = new Buffer(k - mLen - hLen2 - 2);
		  ps.fill(0);
		  var dblen = k - hLen - 1;
		  var seed = randomBytes(hLen);
		  var maskedDb = xor(Buffer.concat([iHash, ps, new Buffer([1]), msg], dblen), mgf(seed, dblen));
		  var maskedSeed = xor(seed, mgf(maskedDb, hLen));
		  return new bn(Buffer.concat([new Buffer([0]), maskedSeed, maskedDb], k));
		}
		function pkcs1(key, msg, reverse){
		  var mLen = msg.length;
		  var k = key.modulus.byteLength();
		  if (mLen > k - 11) {
		    throw new Error('message too long');
		  }
		  var ps;
		  if (reverse) {
		    ps = new Buffer(k - mLen - 3);
		    ps.fill(0xff);
		  } else {
		    ps = nonZero(k - mLen - 3);
		  }
		  return new bn(Buffer.concat([new Buffer([0, reverse?1:2]), ps, new Buffer([0]), msg], k));
		}
		function nonZero(len, crypto) {
		  var out = new Buffer(len);
		  var i = 0;
		  var cache = randomBytes(len*2);
		  var cur = 0;
		  var num;
		  while (i < len) {
		    if (cur === cache.length) {
		      cache = randomBytes(len*2);
		      cur = 0;
		    }
		    num = cache[cur++];
		    if (num) {
		      out[i++] = num;
		    }
		  }
		  return out;
		}
		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 732 */
	/***/ 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__(276);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};


	/***/ },
	/* 733 */
	/***/ function(module, exports) {

		module.exports = Array.isArray || function (arr) {
		  return Object.prototype.toString.call(arr) == '[object Array]';
		};


	/***/ },
	/* 734 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/*
		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]

		function bytesToWords (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
		}

		function wordsToBytes (words) {
		  var bytes = []
		  for (var b = 0; b < words.length * 32; b += 8) {
		    bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF)
		  }
		  return bytes
		}

		function processBlock (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 (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 (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)
		}

		module.exports = ripemd160

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 735 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {module.exports = function (tasks, limit, cb) {
		  if (typeof limit !== 'number') throw new Error('second argument must be a Number')
		  var results, len, pending, keys, isErrored
		  var isSync = true

		  if (Array.isArray(tasks)) {
		    results = []
		    pending = len = tasks.length
		  } else {
		    keys = Object.keys(tasks)
		    results = {}
		    pending = len = keys.length
		  }

		  function done (err) {
		    function end () {
		      if (cb) cb(err, results)
		      cb = null
		    }
		    if (isSync) process.nextTick(end)
		    else end()
		  }

		  function each (i, err, result) {
		    results[i] = result
		    if (err) isErrored = true
		    if (--pending === 0 || err) {
		      done(err)
		    } else if (!isErrored && next < len) {
		      var key
		      if (keys) {
		        key = keys[next]
		        next += 1
		        tasks[key](function (err, result) { each(key, err, result) })
		      } else {
		        key = next
		        next += 1
		        tasks[key](function (err, result) { each(key, err, result) })
		      }
		    }
		  }

		  var next = limit
		  if (!pending) {
		    // empty
		    done(null)
		  } else if (keys) {
		    // object
		    keys.some(function (key, i) {
		      tasks[key](function (err, result) { each(key, err, result) })
		      if (i === limit - 1) return true // early return
		    })
		  } else {
		    // array
		    tasks.some(function (task, i) {
		      task(function (err, result) { each(i, err, result) })
		      if (i === limit - 1) return true // early return
		    })
		  }

		  isSync = false
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 736 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {module.exports = function (tasks, cb) {
		  var current = 0
		  var results = []
		  var isSync = true

		  function done (err) {
		    function end () {
		      if (cb) cb(err, results)
		    }
		    if (isSync) process.nextTick(end)
		    else end()
		  }

		  function each (err, result) {
		    results.push(result)
		    if (++current >= tasks.length || err) done(err)
		    else tasks[current](each)
		  }

		  if (tasks.length > 0) tasks[0](each)
		  else done(null)

		  isSync = false
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 737 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {module.exports = function (tasks, cb) {
		  var current = 0
		  var isSync = true

		  function done (err, args) {
		    function end () {
		      args = args ? [].concat(err, args) : [ err ]
		      if (cb) cb.apply(undefined, args)
		    }
		    if (isSync) process.nextTick(end)
		    else end()
		  }

		  function each (err) {
		    var args = Array.prototype.slice.call(arguments, 1)
		    if (++current >= tasks.length || err) {
		      done(err, args)
		    } else {
		      tasks[current].apply(undefined, [].concat(args, each))
		    }
		  }

		  if (tasks.length) {
		    tasks[0](each)
		  } else {
		    done(null)
		  }

		  isSync = false
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 738 */
	/***/ function(module, exports, __webpack_require__) {

		var exports = module.exports = function SHA (algorithm) {
		  algorithm = algorithm.toLowerCase()

		  var Algorithm = exports[algorithm]
		  if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')

		  return new Algorithm()
		}

		exports.sha = __webpack_require__(739)
		exports.sha1 = __webpack_require__(740)
		exports.sha224 = __webpack_require__(741)
		exports.sha256 = __webpack_require__(279)
		exports.sha384 = __webpack_require__(742)
		exports.sha512 = __webpack_require__(280)


	/***/ },
	/* 739 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/*
		 * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined
		 * in FIPS PUB 180-1
		 * This source code is derived from sha1.js of the same repository.
		 * The difference between SHA-0 and SHA-1 is just a bitwise rotate left
		 * operation was added.
		 */

		var inherits = __webpack_require__(2)
		var Hash = __webpack_require__(80)

		var K = [
		  0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0
		]

		var W = new Array(80)

		function Sha () {
		  this.init()
		  this._w = W

		  Hash.call(this, 64, 56)
		}

		inherits(Sha, Hash)

		Sha.prototype.init = function () {
		  this._a = 0x67452301
		  this._b = 0xefcdab89
		  this._c = 0x98badcfe
		  this._d = 0x10325476
		  this._e = 0xc3d2e1f0

		  return this
		}

		function rotl5 (num) {
		  return (num << 5) | (num >>> 27)
		}

		function rotl30 (num) {
		  return (num << 30) | (num >>> 2)
		}

		function ft (s, b, c, d) {
		  if (s === 0) return (b & c) | ((~b) & d)
		  if (s === 2) return (b & c) | (b & d) | (c & d)
		  return b ^ c ^ d
		}

		Sha.prototype._update = function (M) {
		  var W = this._w

		  var a = this._a | 0
		  var b = this._b | 0
		  var c = this._c | 0
		  var d = this._d | 0
		  var e = this._e | 0

		  for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)
		  for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]

		  for (var j = 0; j < 80; ++j) {
		    var s = ~~(j / 20)
		    var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0

		    e = d
		    d = c
		    c = rotl30(b)
		    b = a
		    a = t
		  }

		  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
		}

		Sha.prototype._hash = function () {
		  var H = new Buffer(20)

		  H.writeInt32BE(this._a | 0, 0)
		  H.writeInt32BE(this._b | 0, 4)
		  H.writeInt32BE(this._c | 0, 8)
		  H.writeInt32BE(this._d | 0, 12)
		  H.writeInt32BE(this._e | 0, 16)

		  return H
		}

		module.exports = Sha

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 740 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/*
		 * 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__(2)
		var Hash = __webpack_require__(80)

		var K = [
		  0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0
		]

		var W = new Array(80)

		function Sha1 () {
		  this.init()
		  this._w = W

		  Hash.call(this, 64, 56)
		}

		inherits(Sha1, Hash)

		Sha1.prototype.init = function () {
		  this._a = 0x67452301
		  this._b = 0xefcdab89
		  this._c = 0x98badcfe
		  this._d = 0x10325476
		  this._e = 0xc3d2e1f0

		  return this
		}

		function rotl1 (num) {
		  return (num << 1) | (num >>> 31)
		}

		function rotl5 (num) {
		  return (num << 5) | (num >>> 27)
		}

		function rotl30 (num) {
		  return (num << 30) | (num >>> 2)
		}

		function ft (s, b, c, d) {
		  if (s === 0) return (b & c) | ((~b) & d)
		  if (s === 2) return (b & c) | (b & d) | (c & d)
		  return b ^ c ^ d
		}

		Sha1.prototype._update = function (M) {
		  var W = this._w

		  var a = this._a | 0
		  var b = this._b | 0
		  var c = this._c | 0
		  var d = this._d | 0
		  var e = this._e | 0

		  for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)
		  for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16])

		  for (var j = 0; j < 80; ++j) {
		    var s = ~~(j / 20)
		    var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0

		    e = d
		    d = c
		    c = rotl30(b)
		    b = a
		    a = t
		  }

		  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
		}

		Sha1.prototype._hash = function () {
		  var H = new Buffer(20)

		  H.writeInt32BE(this._a | 0, 0)
		  H.writeInt32BE(this._b | 0, 4)
		  H.writeInt32BE(this._c | 0, 8)
		  H.writeInt32BE(this._d | 0, 12)
		  H.writeInt32BE(this._e | 0, 16)

		  return H
		}

		module.exports = Sha1

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 741 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/**
		 * 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__(2)
		var Sha256 = __webpack_require__(279)
		var Hash = __webpack_require__(80)

		var W = new Array(64)

		function Sha224 () {
		  this.init()

		  this._w = W // new Array(64)

		  Hash.call(this, 64, 56)
		}

		inherits(Sha224, Sha256)

		Sha224.prototype.init = function () {
		  this._a = 0xc1059ed8
		  this._b = 0x367cd507
		  this._c = 0x3070dd17
		  this._d = 0xf70e5939
		  this._e = 0xffc00b31
		  this._f = 0x68581511
		  this._g = 0x64f98fa7
		  this._h = 0xbefa4fa4

		  return this
		}

		Sha224.prototype._hash = function () {
		  var H = new Buffer(28)

		  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)

		  return H
		}

		module.exports = Sha224

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 742 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {var inherits = __webpack_require__(2)
		var SHA512 = __webpack_require__(280)
		var Hash = __webpack_require__(80)

		var W = new Array(160)

		function Sha384 () {
		  this.init()
		  this._w = W

		  Hash.call(this, 128, 112)
		}

		inherits(Sha384, SHA512)

		Sha384.prototype.init = function () {
		  this._ah = 0xcbbb9d5d
		  this._bh = 0x629a292a
		  this._ch = 0x9159015a
		  this._dh = 0x152fecd8
		  this._eh = 0x67332667
		  this._fh = 0x8eb44a87
		  this._gh = 0xdb0c2e0d
		  this._hh = 0x47b5481d

		  this._al = 0xc1059ed8
		  this._bl = 0x367cd507
		  this._cl = 0x3070dd17
		  this._dl = 0xf70e5939
		  this._el = 0xffc00b31
		  this._fl = 0x68581511
		  this._gl = 0x64f98fa7
		  this._hl = 0xbefa4fa4

		  return this
		}

		Sha384.prototype._hash = function () {
		  var H = new Buffer(48)

		  function writeInt64BE (h, l, offset) {
		    H.writeInt32BE(h, offset)
		    H.writeInt32BE(l, offset + 4)
		  }

		  writeInt64BE(this._ah, this._al, 0)
		  writeInt64BE(this._bh, this._bl, 8)
		  writeInt64BE(this._ch, this._cl, 16)
		  writeInt64BE(this._dh, this._dl, 24)
		  writeInt64BE(this._eh, this._el, 32)
		  writeInt64BE(this._fh, this._fl, 40)

		  return H
		}

		module.exports = Sha384

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 743 */
	/***/ function(module, exports) {

		module.exports = read

		var MSB = 0x80
		  , REST = 0x7F

		function read(buf, offset) {
		  var res    = 0
		    , offset = offset || 0
		    , shift  = 0
		    , counter = offset
		    , b
		    , l = buf.length
		  
		  do {
		    if(counter >= l) {
		      read.bytesRead = 0
		      return undefined
		    }
		    b = buf[counter++]
		    res += shift < 28
		      ? (b & REST) << shift
		      : (b & REST) * Math.pow(2, shift)
		    shift += 7
		  } while (b >= MSB)
		  
		  read.bytes = counter - offset
		  
		  return res
		}


	/***/ },
	/* 744 */
	/***/ function(module, exports) {

		module.exports = encode

		var MSB = 0x80
		  , REST = 0x7F
		  , MSBALL = ~REST
		  , INT = Math.pow(2, 31)

		function encode(num, out, offset) {
		  out = out || []
		  offset = offset || 0
		  var oldOffset = offset

		  while(num >= INT) {
		    out[offset++] = (num & 0xFF) | MSB
		    num /= 128
		  }
		  while(num & MSBALL) {
		    out[offset++] = (num & 0xFF) | MSB
		    num >>>= 7
		  }
		  out[offset] = num | 0
		  
		  encode.bytes = offset - oldOffset + 1
		  
		  return out
		}


	/***/ },
	/* 745 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = {
		    encode: __webpack_require__(744)
		  , decode: __webpack_require__(743)
		  , encodingLength: __webpack_require__(746)
		}


	/***/ },
	/* 746 */
	/***/ function(module, exports) {

		
		var N1 = Math.pow(2,  7)
		var N2 = Math.pow(2, 14)
		var N3 = Math.pow(2, 21)
		var N4 = Math.pow(2, 28)
		var N5 = Math.pow(2, 35)
		var N6 = Math.pow(2, 42)
		var N7 = Math.pow(2, 49)

		module.exports = function (value) {
		  return (
		    value < N1 ? 1
		  : value < N2 ? 2
		  : value < N3 ? 3
		  : value < N4 ? 4
		  : value < N5 ? 5
		  : value < N6 ? 6
		  : value < N7 ? 7
		  :              8
		  )
		}


	/***/ },
	/* 747 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {exports = module.exports = Socket

		var debug = __webpack_require__(17)('simple-websocket')
		var inherits = __webpack_require__(2)
		var stream = __webpack_require__(5)
		var ws = __webpack_require__(292) // websockets in node - will be empty object in browser

		var isBrowser = typeof window !== 'undefined'

		var WebSocket

		if (isBrowser) {
		  WebSocket = window.WebSocket
		} else {
		  WebSocket = ws
		  var Server = __webpack_require__(748)
		  exports.Server = Server
		  exports.createServer = Server.createServer
		}

		inherits(Socket, stream.Duplex)

		/**
		 * WebSocket. Same API as node core `net.Socket`. Duplex stream.
		 * @param {string} url websocket server url
		 * @param {Object} opts options to stream.Duplex
		 */
		function Socket (url, opts) {
		  var self = this
		  if (!(self instanceof Socket)) return new Socket(url, opts)
		  if (!opts) opts = {}
		  debug('new websocket: %s %o', url, opts)

		  opts.allowHalfOpen = false
		  if (opts.highWaterMark == null) opts.highWaterMark = 1024 * 1024

		  stream.Duplex.call(self, opts)

		  self.url = url
		  self.connected = false
		  self.destroyed = false

		  self._maxBufferedAmount = opts.highWaterMark
		  self._chunk = null
		  self._cb = null
		  self._interval = null

		  self._ws = new WebSocket(self.url)
		  self._ws.binaryType = 'arraybuffer'
		  self._ws.onopen = self._onOpen.bind(self)
		  self._ws.onmessage = self._onMessage.bind(self)
		  self._ws.onclose = self._onClose.bind(self)
		  self._ws.onerror = function () {
		    self._onError(new Error('connection error to ' + self.url))
		  }

		  self.on('finish', function () {
		    if (self.connected) {
		      // When stream is finished writing, close socket connection. Half open connections
		      // are currently not supported.
		      // Wait a bit before destroying so the socket flushes.
		      // TODO: is there a more reliable way to accomplish this?
		      setTimeout(function () {
		        self._destroy()
		      }, 100)
		    } else {
		      // If socket is not connected when stream is finished writing, wait until data is
		      // flushed to network at "connect" event.
		      // TODO: is there a more reliable way to accomplish this?
		      self.once('connect', function () {
		        setTimeout(function () {
		          self._destroy()
		        }, 100)
		      })
		    }
		  })
		}

		Socket.WEBSOCKET_SUPPORT = !!WebSocket

		/**
		 * Send text/binary data to the WebSocket server.
		 * @param {TypedArrayView|ArrayBuffer|Buffer|string|Blob|Object} chunk
		 */
		Socket.prototype.send = function (chunk) {
		  var self = this

		  var len = chunk.length || chunk.byteLength || chunk.size
		  self._ws.send(chunk)
		  debug('write: %d bytes', len)
		}

		Socket.prototype.destroy = function (onclose) {
		  var self = this
		  self._destroy(null, onclose)
		}

		Socket.prototype._destroy = function (err, onclose) {
		  var self = this
		  if (self.destroyed) return
		  if (onclose) self.once('close', onclose)

		  debug('destroy (error: %s)', err && err.message)

		  this.readable = this.writable = false

		  if (!self._readableState.ended) self.push(null)
		  if (!self._writableState.finished) self.end()

		  self.connected = false
		  self.destroyed = true

		  clearInterval(self._interval)
		  self._interval = null
		  self._chunk = null
		  self._cb = null

		  if (self._ws) {
		    var ws = self._ws
		    var onClose = function () {
		      ws.onclose = null
		      self.emit('close')
		    }
		    if (ws.readyState === WebSocket.CLOSED) {
		      onClose()
		    } else {
		      try {
		        ws.onclose = onClose
		        ws.close()
		      } catch (err) {
		        onClose()
		      }
		    }

		    ws.onopen = null
		    ws.onmessage = null
		    ws.onerror = null
		  }
		  self._ws = null

		  if (err) self.emit('error', err)
		}

		Socket.prototype._read = function () {}

		Socket.prototype._write = function (chunk, encoding, cb) {
		  var self = this
		  if (self.destroyed) return cb(new Error('cannot write after socket is destroyed'))

		  if (self.connected) {
		    try {
		      self.send(chunk)
		    } catch (err) {
		      return self._onError(err)
		    }
		    if (typeof ws !== 'function' && self._ws.bufferedAmount > self._maxBufferedAmount) {
		      debug('start backpressure: bufferedAmount %d', self._ws.bufferedAmount)
		      self._cb = cb
		    } else {
		      cb(null)
		    }
		  } else {
		    debug('write before connect')
		    self._chunk = chunk
		    self._cb = cb
		  }
		}

		Socket.prototype._onMessage = function (event) {
		  var self = this
		  if (self.destroyed) return
		  var data = event.data
		  debug('read: %d bytes', data.byteLength || data.length)

		  if (data instanceof ArrayBuffer) data = new Buffer(data)
		  self.push(data)
		}

		Socket.prototype._onOpen = function () {
		  var self = this
		  if (self.connected || self.destroyed) return
		  self.connected = true

		  if (self._chunk) {
		    try {
		      self.send(self._chunk)
		    } catch (err) {
		      return self._onError(err)
		    }
		    self._chunk = null
		    debug('sent chunk from "write before connect"')

		    var cb = self._cb
		    self._cb = null
		    cb(null)
		  }

		  // No backpressure in node. The `ws` module has a buggy `bufferedAmount` property.
		  // See: https://github.com/websockets/ws/issues/492
		  if (typeof ws !== 'function') {
		    self._interval = setInterval(function () {
		      if (!self._cb || !self._ws || self._ws.bufferedAmount > self._maxBufferedAmount) {
		        return
		      }
		      debug('ending backpressure: bufferedAmount %d', self._ws.bufferedAmount)
		      var cb = self._cb
		      self._cb = null
		      cb(null)
		    }, 150)
		    if (self._interval.unref) self._interval.unref()
		  }

		  debug('connect')
		  self.emit('connect')
		}

		Socket.prototype._onClose = function () {
		  var self = this
		  if (self.destroyed) return
		  debug('on close')
		  self._destroy()
		}

		Socket.prototype._onError = function (err) {
		  var self = this
		  if (self.destroyed) return
		  debug('error: %s', err.message || err)
		  self._destroy(err)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 748 */
	/***/ function(module, exports, __webpack_require__) {

		exports = module.exports = Server

		var Duplex = __webpack_require__(5).Duplex
		var util = __webpack_require__(11)
		var WebSocketServer = __webpack_require__(292).Server

		exports.createServer = function (options, onConnCb) {
		  if (typeof options === 'function') {
		    onConnCb = options
		    options = {}
		  }

		  var server

		  return {
		    listen: function (port, callback) {
		      server = new WebSocketServer({ port: port }, function () {
		        // TODO, if no callback is passed, emit a 'listening' event
		        // such as https://nodejs.org/api/net.html#net_event_listening
		        callback()
		      })
		      server.on('connection', function (wsConn) {
		        onConnCb(convertToStream(wsConn, options))
		      })
		    },
		    close: function (callback) {
		      server.close(callback)
		    }
		  }
		}

		function Server () {}

		function convertToStream (wsConn, options) {
		  function read () {}

		  var enforcedOpts = {
		    objectMode: false,
		    decodeStrings: false,
		    allowHalfOpen: false
		  }

		  options = util._extend(options || {}, enforcedOpts)

		  var stream = new Duplex(options)
		  stream._read = read
		  stream._write = write

		  stream.ws = wsConn
		  stream.ws.on('message', onWsMessage)
		  stream.ws.on('close', onWsClose)
		  stream.ws.on('open', onWsOpen)
		  stream.ws.on('end', onWsEnd)

		  stream.close = stream.ws.close.bind(stream.ws)

		  function write (chunk, encoding, cb) {
		    if (stream.ws.readyState !== 1) {
		      return stream.emit('close')
		    }

		    try {
		      stream.ws.send(chunk, cb)
		    } catch (err) {
		      cb(err)
		    }
		  }

		  function onWsOpen () {
		    stream.emit('open')
		  }

		  function onWsClose () {
		    stream.emit('close')
		  }

		  function onWsEnd () {
		    stream.push(null)
		  }

		  function onWsMessage (message) {
		    stream.push(message)
		  }

		  return stream
		}


	/***/ },
	/* 749 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(Buffer, process) {'use strict';

		var util = __webpack_require__(11);
		var transport = __webpack_require__(24);

		var debug = {
		  server: __webpack_require__(17)('spdy:connection:server'),
		  client: __webpack_require__(17)('spdy:connection:client')
		};
		var EventEmitter = __webpack_require__(7).EventEmitter;

		var Stream = transport.Stream;

		function Connection(socket, options) {
		  EventEmitter.call(this);

		  var state = {};
		  this._spdyState = state;

		  // NOTE: There's a big trick here. Connection is used as a `this` argument
		  // to the wrapped `connection` event listener.
		  // socket end doesn't necessarly mean connection drop
		  this.httpAllowHalfOpen = true;

		  state.timeout = new transport.utils.Timeout(this);

		  // Protocol info
		  state.protocol = transport.protocol[options.protocol];
		  state.version = null;
		  state.constants = state.protocol.constants;
		  state.pair = null;
		  state.isServer = options.isServer;

		  // Root of priority tree (i.e. stream id = 0)
		  state.priorityRoot = new transport.Priority({
		    defaultWeight: state.constants.DEFAULT_WEIGHT,
		    maxCount: transport.protocol.base.constants.MAX_PRIORITY_STREAMS
		  });

		  // Defaults
		  state.maxStreams = options.maxStreams ||
		                     state.constants.MAX_CONCURRENT_STREAMS;

		  state.autoSpdy31 = options.protocol.name !== 'h2' && options.autoSpdy31;
		  state.acceptPush = options.acceptPush === undefined ?
		      !state.isServer :
		      options.acceptPush;

		  if (options.maxChunk === false)
		    state.maxChunk = Infinity;
		  else if (options.maxChunk === undefined)
		    state.maxChunk = transport.protocol.base.constants.DEFAULT_MAX_CHUNK;
		  else
		    state.maxChunk = options.maxChunk;

		  // Connection-level flow control
		  var windowSize = options.windowSize || 1 << 20;
		  state.window = new transport.Window({
		    id: 0,
		    isServer: state.isServer,
		    recv: {
		      size: state.constants.DEFAULT_WINDOW,
		      max: state.constants.MAX_INITIAL_WINDOW_SIZE
		    },
		    send: {
		      size: state.constants.DEFAULT_WINDOW,
		      max: state.constants.MAX_INITIAL_WINDOW_SIZE
		    }
		  });

		  // It starts with DEFAULT_WINDOW, update must be sent to change it on client
		  state.window.recv.setMax(windowSize);

		  // Boilerplate for Stream constructor
		  state.streamWindow = new transport.Window({
		    id: -1,
		    isServer: state.isServer,
		    recv: {
		      size: windowSize,
		      max: state.constants.MAX_INITIAL_WINDOW_SIZE
		    },
		    send: {
		      size: state.constants.DEFAULT_WINDOW,
		      max: state.constants.MAX_INITIAL_WINDOW_SIZE
		    }
		  });

		  // Interleaving configuration
		  state.maxChunk = options.maxChunk === undefined ? 8 * 1024 : options.maxChunk;

		  // Various state info
		  state.pool = state.protocol.compressionPool.create(options.headerCompression);
		  state.counters = {
		    push: 0,
		    stream: 0
		  };

		  // Init streams list
		  state.stream = {
		    map: {},
		    count: 0,
		    nextId: state.isServer ? 2 : 1,
		    lastId: {
		      both: 0,
		      received: 0
		    }
		  };
		  state.ping = {
		    nextId: state.isServer ? 2 : 1,
		    map: {}
		  };
		  state.goaway = false;

		  // Debug
		  state.debug = state.isServer ? debug.server : debug.client;

		  // X-Forwarded feature
		  state.xForward = null;

		  // Create parser and hole for framer
		  state.parser = state.protocol.parser.create({
		    // NOTE: needed to distinguish ping from ping ACK in SPDY
		    isServer: state.isServer,
		    window: state.window
		  });
		  state.framer = state.protocol.framer.create({
		    window: state.window,
		    timeout: state.timeout
		  });

		  // SPDY has PUSH enabled on servers
		  if (state.protocol.name === 'spdy')
		    state.framer.enablePush(state.isServer);

		  if (!state.isServer)
		    state.parser.skipPreface();

		  this.socket = socket;

		  this._init();
		}
		util.inherits(Connection, EventEmitter);
		exports.Connection = Connection;

		Connection.create = function create(socket, options) {
		  return new Connection(socket, options);
		};

		Connection.prototype._init = function init() {
		  var self = this;
		  var state = this._spdyState;
		  var pool = state.pool;

		  // Initialize session window
		  state.window.recv.on('drain', function() {
		    self._onSessionWindowDrain();
		  });

		  // Initialize parser
		  state.parser.on('data', function(frame) {
		    self._handleFrame(frame);
		  });
		  state.parser.once('version', function(version) {
		    self._onVersion(version);
		  });

		  // Propagate parser errors
		  state.parser.on('error', function(err) {
		    self._onParserError(err);
		  });

		  // Propagate framer errors
		  state.framer.on('error', function(err) {
		    self.emit('error', err);
		  });

		  this.socket.pipe(state.parser);
		  state.framer.pipe(this.socket);

		  // Allow high-level api to catch socket errors
		  this.socket.on('error', function onSocketError(e) {
		    self.emit('error', e);
		  });

		  this.socket.once('close', function onclose() {
		    var err = new Error('socket hang up');
		    err.code = 'ECONNRESET';
		    self.destroyStreams(err);
		    self.emit('close', err);

		    if (state.pair)
		      pool.put(state.pair);
		  });

		  // Reset timeout on close
		  this.once('close', function() {
		    self.setTimeout(0);
		  });

		  function _onWindowOverflow() {
		    self._onWindowOverflow();
		  }

		  state.window.recv.on('overflow', _onWindowOverflow);
		  state.window.send.on('overflow', _onWindowOverflow);

		  // Do not allow half-open connections
		  this.socket.allowHalfOpen = false;
		};

		Connection.prototype._onVersion = function _onVersion(version) {
		  var state = this._spdyState;
		  var prev = state.version;
		  var parser = state.parser;
		  var framer = state.framer;
		  var pool = state.pool;

		  state.version = version;
		  state.debug('id=0 version=%d', version);

		  // Ignore transition to 3.1
		  if (!prev) {
		    state.pair = pool.get(version);
		    parser.setCompression(state.pair);
		    framer.setCompression(state.pair);
		  }
		  framer.setVersion(version);

		  if (!state.isServer) {
		    framer.prefaceFrame();
		    if (state.xForward !== null)
		      framer.xForwardedFor({ host: state.xForward });
		  }

		  // Send preface+settings frame (once)
		  framer.settingsFrame({
		    max_header_list_size: state.constants.DEFAULT_MAX_HEADER_LIST_SIZE,
		    max_concurrent_streams: state.maxStreams,
		    enable_push: state.acceptPush ? 1 : 0,
		    initial_window_size: state.window.recv.max
		  });

		  // Update session window
		  if (state.version >= 3.1 || (state.isServer && state.autoSpdy31))
		    this._onSessionWindowDrain();

		  this.emit('version', version);
		};

		Connection.prototype._onParserError = function _onParserError(err) {
		  var state = this._spdyState;

		  // Prevent further errors
		  state.parser.kill();

		  // Send GOAWAY
		  if (err instanceof transport.protocol.base.utils.ProtocolError) {
		    this._goaway({
		      lastId: state.stream.lastId.both,
		      code: err.code,
		      extra: err.message,
		      send: true
		    });
		  }

		  this.emit('error', err);
		};

		Connection.prototype._handleFrame = function _handleFrame(frame) {
		  var state = this._spdyState;

		  state.debug('id=0 frame', frame);
		  state.timeout.reset();

		  // For testing purposes
		  this.emit('frame', frame);

		  var stream;

		  // Session window update
		  if (frame.type === 'WINDOW_UPDATE' && frame.id === 0) {
		    if (state.version < 3.1 && state.autoSpdy31) {
		      state.debug('id=0 switch version to 3.1');
		      state.version = 3.1;
		      this.emit('version', 3.1);
		    }
		    state.window.send.update(frame.delta);
		    return;
		  }

		  if (state.isServer && frame.type === 'PUSH_PROMISE') {
		    state.debug('id=0 server PUSH_PROMISE');
		    this._goaway({
		      lastId: state.stream.lastId.both,
		      code: 'PROTOCOL_ERROR',
		      send: true
		    });
		    return;
		  }

		  if (!stream && frame.id !== undefined) {
		    // Load created one
		    stream = state.stream.map[frame.id];

		    // Fail if not found
		    if (!stream &&
		        frame.type !== 'HEADERS' &&
		        frame.type !== 'PRIORITY' &&
		        frame.type !== 'RST') {
		      // Other side should destroy the stream upon receiving GOAWAY
		      if (this._isGoaway(frame.id))
		        return;

		      state.debug('id=0 stream=%d not found', frame.id);
		      state.framer.rstFrame({ id: frame.id, code: 'INVALID_STREAM' });
		      return;
		    }
		  }

		  // Create new stream
		  if (!stream && frame.type === 'HEADERS') {
		    this._handleHeaders(frame);
		    return;
		  }

		  if (stream) {
		    stream._handleFrame(frame);
		  } else if (frame.type === 'SETTINGS') {
		    this._handleSettings(frame.settings);
		  } else if (frame.type === 'ACK_SETTINGS') {
		    // TODO(indutny): handle it one day
		  } else if (frame.type === 'PING') {
		    this._handlePing(frame);
		  } else if (frame.type === 'GOAWAY') {
		    this._handleGoaway(frame);
		  } else if (frame.type === 'X_FORWARDED_FOR') {
		    // Set X-Forwarded-For only once
		    if (state.xForward === null)
		      state.xForward = frame.host;
		  } else if (frame.type === 'PRIORITY') {
		    // TODO(indutny): handle this
		  } else {
		    state.debug('id=0 unknown frame type: %s', frame.type);
		  }
		};

		Connection.prototype._onWindowOverflow = function _onWindowOverflow() {
		  var state = this._spdyState;
		  state.debug('id=0 window overflow');
		  this._goaway({
		    lastId: state.stream.lastId.both,
		    code: 'FLOW_CONTROL_ERROR',
		    send: true
		  });
		};

		Connection.prototype._isGoaway = function _isGoaway(id) {
		  var state = this._spdyState;
		  if (state.goaway !== false && state.goaway < id)
		    return true;
		  return false;
		};

		Connection.prototype._getId = function _getId() {
		  var state = this._spdyState;

		  var id = state.stream.nextId;
		  state.stream.nextId += 2;
		  return id;
		};

		Connection.prototype._createStream = function _createStream(uri) {
		  var state = this._spdyState;
		  var id = uri.id;
		  if (id === undefined)
		    id = this._getId();

		  var isGoaway = this._isGoaway(id);

		  if (uri.push && !state.acceptPush) {
		    state.debug('id=0 push disabled promisedId=%d', id);

		    // Fatal error
		    this._goaway({
		      lastId: state.stream.lastId.both,
		      code: 'PROTOCOL_ERROR',
		      send: true
		    });
		    isGoaway = true;
		  }

		  var stream = new Stream(this, {
		    id: id,
		    request: uri.request !== false,
		    method: uri.method,
		    path: uri.path,
		    host: uri.host,
		    priority: uri.priority,
		    headers: uri.headers,
		    parent: uri.parent,
		    readable: !isGoaway && uri.readable,
		    writable: !isGoaway && uri.writable
		  });
		  var self = this;

		  // Just an empty stream for API consistency
		  if (isGoaway)
		    return stream;

		  state.stream.lastId.both = Math.max(state.stream.lastId.both, id);

		  state.debug('id=0 add stream=%d', stream.id);
		  state.stream.map[stream.id] = stream;
		  state.stream.count++;
		  state.counters.stream++;
		  if (stream.parent !== null)
		    state.counters.push++;

		  stream.once('close', function() {
		    self._removeStream(stream);
		  });

		  return stream;
		};

		Connection.prototype._handleHeaders = function _handleHeaders(frame) {
		  var state = this._spdyState;

		  // Must be HEADERS frame after stream close
		  if (frame.id <= state.stream.lastId.received)
		    return;

		  // Someone is using our ids!
		  if ((frame.id + state.stream.nextId) % 2 === 0) {
		    state.framer.rstFrame({ id: frame.id, code: 'PROTOCOL_ERROR' });
		    return;
		  }

		  var stream = this._createStream({
		    id: frame.id,
		    request: false,
		    method: frame.headers[':method'],
		    path: frame.headers[':path'],
		    host: frame.headers[':authority'],
		    priority: frame.priority,
		    headers: frame.headers,
		    writable: frame.writable
		  });

		  // GOAWAY
		  if (this._isGoaway(stream.id))
		    return;

		  state.stream.lastId.received = Math.max(state.stream.lastId.received,
		                                          stream.id);

		  // TODO(indutny) handle stream limit
		  if (!this.emit('stream', stream)) {
		    // No listeners was set - abort the stream
		    stream.abort();
		    return;
		  }

		  // Create fake frame to simulate end of the data
		  if (frame.fin)
		    stream._handleFrame({ type: 'FIN', fin: true });

		  return stream;
		};

		Connection.prototype._onSessionWindowDrain = function _onSessionWindowDrain() {
		  var state = this._spdyState;
		  if (state.version < 3.1 && (!state.isServer || !state.autoSpdy31))
		    return;

		  var delta = state.window.recv.getDelta();
		  state.debug('id=0 session window drain, update by %d', delta);

		  state.framer.windowUpdateFrame({
		    id: 0,
		    delta: delta
		  });
		  state.window.recv.update(delta);
		};

		Connection.prototype.start = function start(version) {
		  this._spdyState.parser.setVersion(version);
		};

		// Mostly for testing
		Connection.prototype.getVersion = function getVersion() {
		  return this._spdyState.version;
		};

		Connection.prototype._handleSettings = function _handleSettings(settings) {
		  var state = this._spdyState;

		  state.framer.ackSettingsFrame();

		  this._setDefaultWindow(settings);
		  if (settings.max_frame_size)
		    state.framer.setMaxFrameSize(settings.max_frame_size);

		  // TODO(indutny): handle max_header_list_size
		  if (settings.header_table_size) {
		    try {
		      state.pair.decompress.updateTableSize(settings.header_table_size);
		    } catch (e) {
		      this._goaway({
		        lastId: 0,
		        code: 'PROTOCOL_ERROR',
		        send: true
		      });
		      return;
		    }
		  }

		  // HTTP2 clients needs to enable PUSH streams explicitly
		  if (state.protocol.name !== 'spdy') {
		    if (settings.enable_push === undefined)
		      state.framer.enablePush(state.isServer);
		    else
		      state.framer.enablePush(settings.enable_push === 1);
		  }

		  // TODO(indutny): handle max_concurrent_streams
		};

		Connection.prototype._setDefaultWindow = function _setDefaultWindow(settings) {
		  if (!settings.initial_window_size)
		    return;

		  var state = this._spdyState;

		  // Update defaults
		  var window = state.streamWindow;
		  window.send.setMax(settings.initial_window_size);

		  // Update existing streams
		  Object.keys(state.stream.map).forEach(function(id) {
		    var stream = state.stream.map[id];
		    var window = stream._spdyState.window;

		    window.send.updateMax(settings.initial_window_size);
		  });
		};

		Connection.prototype._handlePing = function handlePing(frame) {
		  var self = this;
		  var state = this._spdyState;

		  // Handle incoming PING
		  if (!frame.ack) {
		    state.framer.pingFrame({
		      opaque: frame.opaque,
		      ack: true
		    });

		    self.emit('ping', frame.opaque);
		    return;
		  }

		  // Handle reply PING
		  var hex = frame.opaque.toString('hex');
		  if (!state.ping.map[hex])
		    return;
		  var ping = state.ping.map[hex];
		  delete state.ping.map[hex];

		  if (ping.cb)
		    ping.cb(null);
		};

		Connection.prototype._handleGoaway = function handleGoaway(frame) {
		  this._goaway({
		    lastId: frame.lastId,
		    code: frame.code,
		    send: false
		  });
		};

		Connection.prototype.ping = function ping(callback) {
		  var state = this._spdyState;

		  // HTTP2 is using 8-byte opaque
		  var opaque = new Buffer(state.constants.PING_OPAQUE_SIZE);
		  opaque.fill(0);
		  opaque.writeUInt32BE(state.ping.nextId, opaque.length - 4);
		  state.ping.nextId += 2;

		  state.ping.map[opaque.toString('hex')] = { cb: callback };
		  state.framer.pingFrame({
		    opaque: opaque,
		    ack: false
		  });
		};

		Connection.prototype.getCounter = function getCounter(name) {
		  return this._spdyState.counters[name];
		};

		Connection.prototype.reserveStream = function reserveStream(uri, callback) {
		  var stream = this._createStream(uri);

		  // GOAWAY
		  if (this._isGoaway(stream.id)) {
		    var err = new Error('Can\'t send request after GOAWAY');
		    process.nextTick(function() {
		      if (callback)
		        callback(err);
		      else
		        stream.emit('error', err);
		    });
		    return stream;
		  }

		  if (callback) {
		    process.nextTick(function() {
		      callback(null, stream);
		    });
		  }

		  return stream;
		};

		Connection.prototype.request = function request(uri, callback) {
		  var stream = this.reserveStream(uri, function(err) {
		    if (err) {
		      if (callback)
		        callback(err);
		      else
		        stream.emit('error', err);
		      return;
		    }

		    if (stream._wasSent()) {
		      if (callback)
		        callback(null, stream);
		      return;
		    }

		    stream.send(function(err) {
		      if (err) {
		        if (callback)
		          return callback(err);
		        else
		          return stream.emit('error', err);
		      }

		      if (callback)
		        callback(null, stream);
		    });
		  });

		  return stream;
		};

		Connection.prototype._removeStream = function _removeStream(stream) {
		  var state = this._spdyState;

		  state.debug('id=0 remove stream=%d', stream.id);
		  delete state.stream.map[stream.id];
		  state.stream.count--;

		  if (state.stream.count === 0)
		    this.emit('_streamDrain');
		};

		Connection.prototype._goaway = function _goaway(params) {
		  var state = this._spdyState;
		  var self = this;

		  state.goaway = params.lastId;
		  state.debug('id=0 goaway from=%d', state.goaway);

		  Object.keys(state.stream.map).forEach(function(id) {
		    var stream = state.stream.map[id];

		    // Abort every stream started after GOAWAY
		    if (stream.id <= params.lastId)
		      return;

		    stream.abort();
		    stream.emit('error', new Error('New stream after GOAWAY'));
		  });

		  function finish() {
		    // Destroy socket if there are no streams
		    if (state.stream.count === 0 || params.code !== 'OK') {
		      // No further frames should be processed
		      state.parser.kill();

		      process.nextTick(function() {
		        var err = new Error('Fatal error: ' + params.code);
		        self._onStreamDrain(err);
		      });
		      return;
		    }

		    self.on('_streamDrain', self._onStreamDrain);
		  }

		  if (params.send) {
		    // Make sure that GOAWAY frame is sent before dumping framer
		    state.framer.goawayFrame({
		      lastId: params.lastId,
		      code: params.code,
		      extra: params.extra
		    }, finish);
		  } else {
		    finish();
		  }
		};

		Connection.prototype._onStreamDrain = function _onStreamDrain(error) {
		  var state = this._spdyState;

		  state.debug('id=0 _onStreamDrain');

		  state.framer.dump();
		  state.framer.unpipe(this.socket);

		  if (this.socket.destroySoon)
		    this.socket.destroySoon();
		  this.emit('close', error);
		};

		Connection.prototype.end = function end(callback) {
		  var state = this._spdyState;

		  if (callback)
		    this.once('close', callback);
		  this._goaway({
		    lastId: state.stream.lastId.both,
		    code: 'OK',
		    send: true
		  });
		};

		Connection.prototype.destroyStreams = function destroyStreams(err) {
		  var state = this._spdyState;
		  Object.keys(state.stream.map).forEach(function(id) {
		    var stream = state.stream.map[id];

		    stream.abort();
		    stream.emit('error', err);
		  });
		};

		Connection.prototype.isServer = function isServer() {
		  return this._spdyState.isServer;
		};

		Connection.prototype.getXForwardedFor = function getXForwardFor() {
		  return this._spdyState.xForward;
		};

		Connection.prototype.sendXForwardedFor = function sendXForwardedFor(host) {
		  var state = this._spdyState;
		  if (state.version !== null)
		    state.framer.xForwardedFor({ host: host });
		  else
		    state.xForward = host;
		};

		Connection.prototype.pushPromise = function pushPromise(parent, uri, callback) {
		  var state = this._spdyState;

		  var stream = this._createStream({
		    request: false,
		    parent: parent,
		    method: uri.method,
		    path: uri.path,
		    host: uri.host,
		    priority: uri.priority,
		    headers: uri.headers,
		    readable: false
		  });

		  // TODO(indutny): deduplicate this logic somehow
		  if (this._isGoaway(stream.id)) {
		    var err = new Error('Can\'t send PUSH_PROMISE after GOAWAY');
		    process.nextTick(function() {
		      if (callback)
		        callback(err);
		      else
		        stream.emit('error', err);
		    });
		    return stream;
		  }

		  if (uri.push && !state.acceptPush) {
		    var err = new Error(
		        'Can\'t send PUSH_PROMISE, other side won\'t accept it');
		    process.nextTick(function() {
		      if (callback)
		        callback(err);
		      else
		        stream.emit('error', err);
		    });
		    return stream;
		  }

		  stream._sendPush(uri.status, uri.response, function(err) {
		    if (!callback) {
		      if (err)
		        stream.emit('error', err);
		      return;
		    }

		    if (err)
		      return callback(err);
		    callback(null, stream);
		  });

		  return stream;
		};

		Connection.prototype.setTimeout = function setTimeout(delay, callback) {
		  var state = this._spdyState;

		  state.timeout.set(delay, callback);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer, __webpack_require__(3)))

	/***/ },
	/* 750 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var transport = __webpack_require__(24);
		var utils = transport.utils;

		var assert = __webpack_require__(34);
		var debug = __webpack_require__(17)('spdy:priority');

		function PriorityNode(tree, options) {
		  this.tree = tree;

		  this.id = options.id;
		  this.parent = options.parent;
		  this.weight = options.weight;

		  // To be calculated in `addChild`
		  this.priorityFrom = 0;
		  this.priorityTo = 1;
		  this.priority = 1;

		  this.children = {
		    list: [],
		    weight: 0
		  };

		  if (this.parent !== null)
		    this.parent.addChild(this);
		}

		function compareChildren(a, b) {
		  return a.weight === b.weight ? a.id - b.id : a.weight - b.weight;
		}

		PriorityNode.prototype.toJSON = function toJSON() {
		  return {
		    parent: this.parent,
		    weight: this.weight,
		    exclusive: this.exclusive
		  };
		};

		PriorityNode.prototype.getPriority = function getPriority() {
		  return this.priority;
		};

		PriorityNode.prototype.getPriorityRange = function getPriorityRange() {
		  return { from: this.priorityFrom, to: this.priorityTo };
		};

		PriorityNode.prototype.addChild = function addChild(child) {
		  child.parent = this;
		  utils.binaryInsert(this.children.list, child, compareChildren);
		  this.children.weight += child.weight;

		  this._updatePriority(this.priorityFrom, this.priorityTo);
		};

		PriorityNode.prototype.remove = function remove() {
		  assert(this.parent, 'Can\'t remove root node');

		  this.parent.removeChild(this);
		  this.tree._removeNode(this);

		  // Move all children to the parent
		  for (var i = 0; i < this.children.list.length; i++)
		    this.parent.addChild(this.children.list[i]);
		};

		PriorityNode.prototype.removeChild = function removeChild(child) {
		  this.children.weight -= child.weight;
		  var index = utils.binarySearch(this.children.list, child, compareChildren);
		  assert(index !== -1);

		  // Remove the child
		  this.children.list.splice(index, 1);
		};

		PriorityNode.prototype.removeChildren = function removeChildren() {
		  var children = this.children.list;
		  this.children.list = [];
		  this.children.weight = 0;
		  return children;
		};

		PriorityNode.prototype._updatePriority = function _updatePriority(from, to) {
		  this.priority = to - from;
		  this.priorityFrom = from;
		  this.priorityTo = to;

		  var weight = 0;
		  for (var i = 0; i < this.children.list.length; i++) {
		    var node = this.children.list[i];
		    var nextWeight = weight + node.weight;

		    node._updatePriority(
		      from + this.priority * (weight / this.children.weight),
		      from + this.priority * (nextWeight / this.children.weight)
		    );
		    weight = nextWeight;
		  }
		};

		function PriorityTree(options) {
		  this.map = {};
		  this.list = [];
		  this.defaultWeight = options.defaultWeight || 16;

		  this.count = 0;
		  this.maxCount = options.maxCount;

		  // Root
		  this.root = this.add({
		    id: 0,
		    parent: null,
		    weight: 1
		  });
		}
		module.exports = PriorityTree;

		PriorityTree.create = function create(options) {
		  return new PriorityTree(options);
		};

		PriorityTree.prototype.add = function add(options) {
		  if (options.id === options.parent)
		    return this.addDefault(options.id);

		  var parent = options.parent === null ? null : this.map[options.parent];
		  if (parent === undefined)
		    return this.addDefault(options.id);

		  debug('add node=%d parent=%d weight=%d exclusive=%d',
		        options.id,
		        options.parent === null ? -1 : options.parent,
		        options.weight || this.defaultWeight,
		        options.exclusive ? 1 : 0);

		  var children;
		  if (options.exclusive)
		    children = parent.removeChildren();

		  var node = new PriorityNode(this, {
		    id: options.id,
		    parent: parent,
		    weight: options.weight || this.defaultWeight
		  });
		  this.map[options.id] = node;

		  if (options.exclusive) {
		    for (var i = 0; i < children.length; i++)
		      node.addChild(children[i]);
		  }

		  this.count++;
		  if (this.count > this.maxCount) {
		    debug('hit maximum remove id=%d', this.list[0].id);
		    this.list.shift().remove();
		  }

		  // Root node is not subject to removal
		  if (node.parent !== null)
		    this.list.push(node);

		  return node;
		};

		// Only for testing, should use `node`'s methods
		PriorityTree.prototype.get = function get(id) {
		  return this.map[id];
		};

		PriorityTree.prototype.addDefault = function addDefault(id) {
		  debug('creating default node');
		  return this.add({ id: id, parent: 0, weight: this.defaultWeight });
		};

		PriorityTree.prototype._removeNode = function _removeNode(node) {
		  delete this.map[node.id];
		  this.count--;
		};


	/***/ },
	/* 751 */
	/***/ function(module, exports) {

		exports.DEFAULT_METHOD = 'GET';
		exports.DEFAULT_HOST = 'localhost';
		exports.MAX_PRIORITY_STREAMS = 100;
		exports.DEFAULT_MAX_CHUNK = 8 * 1024;


	/***/ },
	/* 752 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var util = __webpack_require__(11);

		var transport = __webpack_require__(24);
		var base = __webpack_require__(177);
		var Scheduler = base.Scheduler;

		function Framer(options) {
		  Scheduler.call(this);

		  this.version = null;
		  this.compress = null;
		  this.window = options.window;
		  this.timeout = options.timeout;

		  // Wait for `enablePush`
		  this.pushEnabled = null;
		}
		util.inherits(Framer, Scheduler);
		module.exports = Framer;

		Framer.prototype.setVersion = function setVersion(version) {
		  this.version = version;
		  this.emit('version');
		};

		Framer.prototype.setCompression = function setCompresion(pair) {
		  this.compress = new transport.utils.LockStream(pair.compress);
		};

		Framer.prototype.enablePush = function enablePush(enable) {
		  this.pushEnabled = enable;
		  this.emit('_pushEnabled');
		};

		Framer.prototype._checkPush = function _checkPush(callback) {
		  if (this.pushEnabled === null) {
		    this.once('_pushEnabled', function() {
		      this._checkPush(callback);
		    });
		    return;
		  }

		  var self = this;
		  var err = null;
		  if (!this.pushEnabled)
		    err = new Error('PUSH_PROMISE disabled by other side');
		  process.nextTick(function() {
		    return callback(err);
		  });
		};

		Framer.prototype._resetTimeout = function _resetTimeout() {
		  if (this.timeout)
		    this.timeout.reset();
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 753 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var transport = __webpack_require__(24);

		var util = __webpack_require__(11);
		var utils = __webpack_require__(177).utils;
		var OffsetBuffer = __webpack_require__(124);
		var Transform = __webpack_require__(178).Transform;

		function Parser(options) {
		  Transform.call(this, {
		    readableObjectMode: true
		  });

		  this.buffer = new OffsetBuffer();
		  this.partial = false;
		  this.waiting = 0;

		  this.window = options.window;

		  this.version = null;
		  this.decompress = null;
		  this.dead = false;
		}
		module.exports = Parser;
		util.inherits(Parser, Transform);

		Parser.prototype.error = utils.error;

		Parser.prototype.kill = function kill() {
		  this.dead = true;
		};

		Parser.prototype._transform = function transform(data, encoding, cb) {
		  if (!this.dead)
		    this.buffer.push(data);

		  this._consume(cb);
		};

		Parser.prototype._consume = function _consume(cb) {
		  var self = this;

		  function next(err, frame) {
		    if (err)
		      return cb(err);

		    if (Array.isArray(frame)) {
		      for (var i = 0; i < frame.length; i++)
		        self.push(frame[i]);
		    } else if (frame) {
		      self.push(frame);
		    }

		    // Consume more packets
		    if (!sync)
		      return self._consume(cb);

		    process.nextTick(function() {
		      self._consume(cb);
		    });
		  }

		  if (this.dead)
		    return cb();


		  if (this.buffer.size < this.waiting) {
		    // No data at all
		    if (this.buffer.size === 0)
		      return cb();

		    // Partial DATA frame or something that we can process partially
		    if (this.partial) {
		      var partial = this.buffer.clone(this.buffer.size);
		      this.buffer.skip(partial.size);
		      this.waiting -= partial.size;

		      this.executePartial(partial, next);
		      return;
		    }

		    // We shall not do anything until we get all expected data
		    return cb();
		  }

		  var sync = true;

		  var content = this.buffer.clone(this.waiting);
		  this.buffer.skip(this.waiting);

		  this.execute(content, next);
		  sync = false;
		};

		Parser.prototype.setVersion = function setVersion(version) {
		  this.version = version;
		  this.emit('version', version);
		};

		Parser.prototype.setCompression = function setCompresion(pair) {
		  this.decompress = new transport.utils.LockStream(pair.decompress);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 754 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var transport = __webpack_require__(24);
		var utils = transport.utils;

		var assert = __webpack_require__(34);
		var util = __webpack_require__(11);
		var debug = __webpack_require__(17)('spdy:scheduler');
		var Readable = __webpack_require__(178).Readable;

		/*
		 * We create following structure in `pending`:
		 * [ [ id = 0 ], [ id = 1 ], [ id = 2 ], [ id = 0 ] ]
		 *     chunks      chunks      chunks      chunks
		 *     chunks                  chunks
		 *     chunks
		 *
		 * Then on the `.tick()` pass we pick one chunks from each item and remove the
		 * item if it is empty:
		 *
		 * [ [ id = 0 ], [ id = 2 ] ]
		 *     chunks      chunks
		 *     chunks
		 *
		 * Writing out: chunks for 0, chunks for 1, chunks for 2, chunks for 0
		 *
		 * This way data is interleaved between the different streams.
		 */

		function Scheduler(options) {
		  Readable.call(this);

		  // Pretty big window by default
		  this.window = 0.25;

		  if (options && options.window)
		    this.window = options.window;

		  this.sync = [];
		  this.list = [];
		  this.count = 0;
		  this.pendingTick = false;
		}
		util.inherits(Scheduler, Readable);
		module.exports = Scheduler;

		// Just for testing, really
		Scheduler.create = function create(options) {
		  return new Scheduler(options);
		};

		function insertCompare(a, b) {
		  return a.priority === b.priority ?
		      a.stream - b.stream :
		      b.priority - a.priority;
		}

		Scheduler.prototype.schedule = function schedule(data) {
		  var priority = data.priority;
		  var stream = data.stream;
		  var chunks = data.chunks;

		  // Synchronous frames should not be interleaved
		  if (priority === false) {
		    debug('queue sync', chunks);
		    this.sync.push(data);
		    this.count += chunks.length;

		    this._read();
		    return;
		  }

		  debug('queue async priority=%d stream=%d', priority, stream, chunks);
		  var item = new SchedulerItem(stream, priority);
		  var index = utils.binaryLookup(this.list, item, insertCompare);

		  // Push new item
		  if (index >= this.list.length || insertCompare(this.list[index], item) !== 0)
		    this.list.splice(index, 0, item);
		  // Coalesce
		  else
		    item = this.list[index];

		  item.push(data);

		  this.count += chunks.length;

		  this._read();
		};

		Scheduler.prototype._read = function _read() {
		  if (this.count === 0)
		    return;

		  if (this.pendingTick)
		    return;
		  this.pendingTick = true;

		  var self = this;
		  process.nextTick(function() {
		    self.pendingTick = false;
		    self.tick();
		  });
		};

		Scheduler.prototype.tick = function tick() {
		  // No luck for async frames
		  if (!this.tickSync())
		    return false;

		  return this.tickAsync();
		};

		Scheduler.prototype.tickSync = function tickSync() {
		  // Empty sync queue first
		  var sync = this.sync;
		  var res = true;
		  this.sync = [];
		  for (var i = 0; i < sync.length; i++) {
		    var item = sync[i];
		    debug('tick sync pending=%d', this.count, item.chunks);
		    for (var j = 0; j < item.chunks.length; j++) {
		      this.count--;
		      res = this.push(item.chunks[j]);
		    }
		    debug('after tick sync pending=%d', this.count);

		    // TODO(indutny): figure out the way to invoke callback on actual write
		    if (item.callback)
		      item.callback(null);
		  }
		  return res;
		};

		Scheduler.prototype.tickAsync = function tickAsync() {
		  var res = true;
		  var list = this.list;
		  if (list.length === 0)
		    return res;

		  var startPriority = list[0].priority;
		  for (var index = 0; list.length > 0; index++) {
		    // Loop index
		    index %= list.length;
		    if (startPriority - list[index].priority > this.window)
		      index = 0;
		    debug('tick async index=%d start=%d', index, startPriority);

		    var current = list[index];
		    var item = current.shift();

		    if (current.isEmpty()) {
		      list.splice(index, 1);
		      if (index === 0 && list.length > 0)
		        startPriority = list[0].priority;
		      index--;
		    }

		    debug('tick async pending=%d', this.count, item.chunks);
		    for (var i = 0; i < item.chunks.length; i++) {
		      this.count--;
		      res = this.push(item.chunks[i]);
		    }
		    debug('after tick pending=%d', this.count);

		    // TODO(indutny): figure out the way to invoke callback on actual write
		    if (item.callback)
		      item.callback(null);
		    if (!res)
		      break;
		  }

		  return res;
		};

		Scheduler.prototype.dump = function dump() {
		  this.tickSync();

		  // Write everything out
		  while (!this.tickAsync()) {
		    // Intentional no-op
		  }
		  assert.equal(this.count, 0);
		};

		function SchedulerItem(stream, priority) {
		  this.stream = stream;
		  this.priority = priority;
		  this.queue = [];
		}

		SchedulerItem.prototype.push = function push(chunks) {
		  this.queue.push(chunks);
		};

		SchedulerItem.prototype.shift = function shift() {
		  return this.queue.shift();
		};

		SchedulerItem.prototype.isEmpty = function isEmpty() {
		  return this.queue.length === 0;
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 755 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var utils = exports;

		var util = __webpack_require__(11);

		function ProtocolError(code, message) {
		  this.code = code;
		  this.message = message;
		}
		util.inherits(ProtocolError, Error);
		utils.ProtocolError = ProtocolError;

		utils.error = function error(code, message) {
		  return new ProtocolError(code, message);
		};

		utils.reverse = function reverse(object) {
		  var result = []

		  Object.keys(object).forEach(function(key) {
		    result[object[key] | 0] = key;
		  });

		  return result;
		};

		// weight [1, 36] <=> priority [0, 7]
		// This way weight=16 is preserved and has priority=3
		utils.weightToPriority = function weightToPriority(weight) {
		  return ((Math.min(35, (weight - 1)) / 35) * 7) | 0;
		};

		utils.priorityToWeight = function priorityToWeight(priority) {
		  return (((priority / 7) * 35) | 0) + 1;
		};

		// Copy-Paste from node
		exports.addHeaderLine = function addHeaderLine(field, value, dest) {
		  field = field.toLowerCase();
		  if (/^:/.test(field)) {
		    dest[field] = value;
		    return;
		  }

		  switch (field) {
		    // Array headers:
		    case 'set-cookie':
		      if (dest[field] !== undefined) {
		        dest[field].push(value);
		      } else {
		        dest[field] = [ value ];
		      }
		      break;

		    /* eslint-disable max-len */
		    // list is taken from:
		    /* eslint-enable max-len */
		    case 'content-type':
		    case 'content-length':
		    case 'user-agent':
		    case 'referer':
		    case 'host':
		    case 'authorization':
		    case 'proxy-authorization':
		    case 'if-modified-since':
		    case 'if-unmodified-since':
		    case 'from':
		    case 'location':
		    case 'max-forwards':
		      // drop duplicates
		      if (dest[field] === undefined)
		        dest[field] = value;
		      break;

		    case 'cookie':
		      // make semicolon-separated list
		      if (dest[field] !== undefined) {
		        dest[field] += '; ' + value;
		      } else {
		        dest[field] = value;
		      }
		      break;

		    default:
		      // make comma-separated list
		      if (dest[field] !== undefined) {
		        dest[field] += ', ' + value;
		      } else {
		        dest[field] = value;
		      }
		  }
		};


	/***/ },
	/* 756 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var transport = __webpack_require__(24);
		var base = transport.protocol.base;

		var util = __webpack_require__(11);
		var Buffer = __webpack_require__(0).Buffer;

		exports.PREFACE_SIZE = 24;
		exports.PREFACE = 'PRI * HTTP/2.0\r\n\r\nSM\r\n\r\n';
		exports.PREFACE_BUFFER = new Buffer(exports.PREFACE);

		exports.PING_OPAQUE_SIZE = 8;

		exports.FRAME_HEADER_SIZE = 9;
		exports.INITIAL_MAX_FRAME_SIZE = 16384;
		exports.ABSOLUTE_MAX_FRAME_SIZE = 16777215;
		exports.HEADER_TABLE_SIZE = 4096;
		exports.DEFAULT_MAX_HEADER_LIST_SIZE = 80 * 1024;  // as in http_parser
		exports.MAX_INITIAL_WINDOW_SIZE = 2147483647;

		exports.DEFAULT_WEIGHT = 16;

		exports.MAX_CONCURRENT_STREAMS = Infinity;

		exports.frameType = {
		  DATA: 0,
		  HEADERS: 1,
		  PRIORITY: 2,
		  RST_STREAM: 3,
		  SETTINGS: 4,
		  PUSH_PROMISE: 5,
		  PING: 6,
		  GOAWAY: 7,
		  WINDOW_UPDATE: 8,
		  CONTINUATION: 9,

		  // Custom
		  X_FORWARDED_FOR: 0xde
		};

		exports.flags = {
		  ACK: 0x01,  // SETTINGS-only
		  END_STREAM: 0x01,
		  END_HEADERS: 0x04,
		  PADDED: 0x08,
		  PRIORITY: 0x20
		};

		exports.settings = {
		  SETTINGS_HEADER_TABLE_SIZE: 0x01,
		  SETTINGS_ENABLE_PUSH: 0x02,
		  SETTINGS_MAX_CONCURRENT_STREAMS: 0x03,
		  SETTINGS_INITIAL_WINDOW_SIZE: 0x04,
		  SETTINGS_MAX_FRAME_SIZE: 0x05,
		  SETTINGS_MAX_HEADER_LIST_SIZE: 0x06
		};

		exports.settingsIndex = [
		  null,
		  'header_table_size',
		  'enable_push',
		  'max_concurrent_streams',
		  'initial_window_size',
		  'max_frame_size',
		  'max_header_list_size'
		];

		exports.error = {
		  OK: 0,
		  NO_ERROR: 0,

		  PROTOCOL_ERROR: 1,
		  INTERNAL_ERROR: 2,
		  FLOW_CONTROL_ERROR: 3,
		  SETTINGS_TIMEOUT: 4,

		  STREAM_CLOSED: 5,
		  INVALID_STREAM: 5,

		  FRAME_SIZE_ERROR: 6,
		  REFUSED_STREAM: 7,
		  CANCEL: 8,
		  COMPRESSION_ERROR: 9,
		  CONNECT_ERROR: 10,
		  ENHANCE_YOUR_CALM: 11,
		  INADEQUATE_SECURITY: 12,
		  HTTP_1_1_REQUIRED: 13
		};
		exports.errorByCode = base.utils.reverse(exports.error);

		exports.DEFAULT_WINDOW = 64 * 1024 - 1;

		exports.goaway = exports.error;
		exports.goawayByCode = util._extend({}, exports.errorByCode);
		exports.goawayByCode[0] = 'OK';


	/***/ },
	/* 757 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var transport = __webpack_require__(24);
		var base = transport.protocol.base;
		var constants = __webpack_require__(129).constants;

		var assert = __webpack_require__(34);
		var util = __webpack_require__(11);
		var WriteBuffer = __webpack_require__(181);
		var OffsetBuffer = __webpack_require__(124);
		var Buffer = __webpack_require__(0).Buffer;
		var debug = __webpack_require__(17)('spdy:framer');
		var debugExtra = __webpack_require__(17)('spdy:framer:extra');

		function Framer(options) {
		  base.Framer.call(this, options);

		  this.maxFrameSize = constants.INITIAL_MAX_FRAME_SIZE;
		}
		util.inherits(Framer, base.Framer);
		module.exports = Framer;

		Framer.create = function create(options) {
		  return new Framer(options);
		};

		Framer.prototype.setMaxFrameSize = function setMaxFrameSize(size) {
		  this.maxFrameSize = size;
		};

		Framer.prototype._frame = function _frame(frame, body, callback) {
		  debug('id=%d type=%s', frame.id, frame.type);

		  var buffer = new WriteBuffer();

		  buffer.reserve(constants.FRAME_HEADER_SIZE);
		  var len = buffer.skip(3);
		  buffer.writeUInt8(constants.frameType[frame.type]);
		  buffer.writeUInt8(frame.flags);
		  buffer.writeUInt32BE(frame.id & 0x7fffffff);

		  body(buffer);

		  var frameSize = buffer.size - constants.FRAME_HEADER_SIZE;
		  len.writeUInt24BE(frameSize);

		  var chunks = buffer.render();
		  var toWrite = {
		    stream: frame.id,
		    priority: frame.priority === undefined ? false : frame.priority,
		    chunks: chunks,
		    callback: callback
		  };

		  if (this.window && frame.type === 'DATA') {
		    var self = this;
		    this._resetTimeout();
		    this.window.send.update(-frameSize, function() {
		      self._resetTimeout();
		      self.schedule(toWrite);
		    });
		  } else {
		    this._resetTimeout();
		    this.schedule(toWrite);
		  }

		  return chunks;
		};

		Framer.prototype._split = function _split(frame) {
		  var buf = new OffsetBuffer();
		  for (var i = 0; i < frame.chunks.length; i++)
		    buf.push(frame.chunks[i]);

		  var frames = [];
		  while (!buf.isEmpty()) {
		    // First frame may have reserved bytes in it
		    var size = this.maxFrameSize;
		    if (frames.length === 0)
		      size -= frame.reserve;
		    size = Math.min(size, buf.size);

		    var frameBuf = buf.clone(size);
		    buf.skip(size);

		    frames.push({
		      size: frameBuf.size,
		      chunks: frameBuf.toChunks()
		    });
		  }

		  return frames;
		};

		Framer.prototype._continuationFrame = function _continuationFrame(frame,
		                                                                  body,
		                                                                  callback) {
		  var frames = this._split(frame);

		  frames.forEach(function(subFrame, i) {
		    var isFirst = i === 0;
		    var isLast = i === frames.length - 1;

		    var flags = isLast ? constants.flags.END_HEADERS : 0;

		    // PRIORITY and friends
		    if (isFirst)
		      flags |= frame.flags;

		    this._frame({
		      id: frame.id,
		      priority: false,
		      type: isFirst ? frame.type : 'CONTINUATION',
		      flags: flags
		    }, function(buf) {
		      // Fill those reserved bytes
		      if (isFirst && body)
		        body(buf);

		      buf.reserve(subFrame.size);
		      for (var i = 0; i < subFrame.chunks.length; i++)
		        buf.copyFrom(subFrame.chunks[i]);
		    }, isLast ? callback : null);
		  }, this);

		  if (frames.length === 0) {
		    this._frame({
		      id: frame.id,
		      priority: false,
		      type: frame.type,
		      flags: frame.flags | constants.flags.END_HEADERS
		    }, function(buf) {
		      if (body)
		        body(buf);
		    }, callback);
		  }
		};

		Framer.prototype._compressHeaders = function _compressHeaders(headers,
		                                                              pairs,
		                                                              callback) {
		  Object.keys(headers || {}).forEach(function(name) {
		    var lowName = name.toLowerCase();

		    // Should be already in `:authority`
		    if (lowName === 'host')
		      return;
		    // Not allowed in HTTP2
		    if (lowName === 'connection')
		      return;

		    // Should be in `pairs`
		    if (/^:/.test(lowName))
		      return;

		    // Do not compress, or index Cookie field (for security reasons)
		    var neverIndex = lowName === 'cookie' || lowName === 'set-cookie';

		    var value = headers[name];
		    if (Array.isArray(value)) {
		      for (var i = 0; i < value.length; i++) {
		        pairs.push({
		          name: lowName,
		          value: value[i] + '',
		          neverIndex: neverIndex,
		          huffman: !neverIndex
		        });
		      }
		    } else {
		      pairs.push({
		        name: lowName,
		        value: value + '',
		        neverIndex: neverIndex,
		        huffman: !neverIndex
		      });
		    }
		  });

		  var self = this;
		  assert(this.compress !== null, 'Framer version not initialized');
		  debugExtra('compressing headers=%j', pairs);
		  this.compress.write([ pairs ], callback);
		};

		Framer.prototype._isDefaultPriority = function _isDefaultPriority(priority) {
		  if (!priority)
		    return true;

		  return !priority.parent &&
		         priority.weight === constants.DEFAULT &&
		         !priority.exclusive;
		};

		Framer.prototype._defaultHeaders = function _defaultHeaders(frame, pairs) {
		  if (!frame.path)
		    throw new Error('`path` is required frame argument');

		  pairs.push({
		    name: ':method',
		    value: frame.method || base.constants.DEFAULT_METHOD
		  });
		  pairs.push({ name: ':path', value: frame.path });
		  pairs.push({ name: ':scheme', value: frame.scheme || 'https' });
		  pairs.push({
		    name: ':authority',
		    value: frame.host ||
		           frame.headers && frame.headers.host ||
		           base.constants.DEFAULT_HOST
		  });
		};

		Framer.prototype._headersFrame = function _headersFrame(kind, frame, callback) {
		  var pairs = [];

		  if (kind === 'request') {
		    this._defaultHeaders(frame, pairs);
		  } else if (kind === 'response') {
		    pairs.push({ name: ':status', value: (frame.status || 200) + '' });
		  }

		  var self = this;
		  this._compressHeaders(frame.headers, pairs, function(err, chunks) {
		    if (err) {
		      if (callback)
		        return callback(err);
		      else
		        return self.emit('error', err);
		    }

		    var reserve = 0;

		    // If priority info is present, and the values are not default ones
		    // reserve space for the priority info and add PRIORITY flag
		    var priority = frame.priority;
		    if (!self._isDefaultPriority(priority))
		      reserve = 5;

		    var flags = reserve === 0 ? 0 : constants.flags.PRIORITY;

		    // Mostly for testing
		    if (frame.fin)
		      flags |= constants.flags.END_STREAM;

		    self._continuationFrame({
		      id: frame.id,
		      type: 'HEADERS',
		      flags: flags,
		      reserve: reserve,
		      chunks: chunks
		    }, function(buf) {
		      if (reserve === 0)
		        return;

		      buf.writeUInt32BE((priority.exclusive ? 0x80000000 : 0) |
		                        priority.parent);
		      buf.writeUInt8((priority.weight | 0) - 1);
		    }, callback);
		  });
		};

		Framer.prototype.requestFrame = function requestFrame(frame, callback) {
		  return this._headersFrame('request', frame, callback);
		};

		Framer.prototype.responseFrame = function responseFrame(frame, callback) {
		  return this._headersFrame('response', frame, callback);
		};

		Framer.prototype.headersFrame = function headersFrame(frame, callback) {
		  return this._headersFrame('headers', frame, callback);
		};

		Framer.prototype.pushFrame = function pushFrame(frame, callback) {
		  var self = this;

		  function compress(headers, pairs, callback) {
		    self._compressHeaders(headers, pairs, function(err, chunks) {
		      if (err) {
		        if (callback)
		          return callback(err);
		        else
		          return self.emit('error', err);
		      }

		      callback(chunks);
		    });
		  }

		  function sendPromise(chunks) {
		    self._continuationFrame({
		      id: frame.id,
		      type: 'PUSH_PROMISE',
		      reserve: 4,
		      chunks: chunks
		    }, function(buf) {
		      buf.writeUInt32BE(frame.promisedId);
		    });
		  }

		  function sendResponse(chunks, callback) {
		    var priority = frame.priority;
		    var isDefaultPriority = self._isDefaultPriority(priority);
		    var flags = isDefaultPriority ? 0 : constants.flags.PRIORITY;

		    // Mostly for testing
		    if (frame.fin)
		      flags |= constants.flags.END_STREAM;

		    self._continuationFrame({
		      id: frame.promisedId,
		      type: 'HEADERS',
		      flags: flags,
		      reserve: isDefaultPriority ? 0 : 5,
		      chunks: chunks
		    }, function(buf) {
		      if (isDefaultPriority)
		        return;

		      buf.writeUInt32BE((priority.exclusive ? 0x80000000 : 0) |
		                        priority.parent);
		      buf.writeUInt8((priority.weight | 0) - 1);
		    }, callback);
		  }

		  this._checkPush(function(err) {
		    if (err)
		      return callback(err);

		    var pairs = {
		      promise: [],
		      response: []
		    };

		    self._defaultHeaders(frame, pairs.promise);
		    pairs.response.push({ name: ':status', value: (frame.status || 200) + '' });

		    compress(frame.headers, pairs.promise, function(promiseChunks) {
		      sendPromise(promiseChunks);
		      compress(frame.response, pairs.response, function(responseChunks) {
		        sendResponse(responseChunks, callback);
		      });
		    });
		  });
		};

		Framer.prototype.priorityFrame = function priorityFrame(frame, callback) {
		  this._frame({
		    id: frame.id,
		    priority: false,
		    type: 'PRIORITY',
		    flags: 0
		  }, function(buf) {
		    var priority = frame.priority;
		    buf.writeUInt32BE((priority.exclusive ? 0x80000000 : 0) |
		                      priority.parent);
		    buf.writeUInt8((priority.weight | 0) - 1);
		  }, callback);
		};

		Framer.prototype.dataFrame = function dataFrame(frame, callback) {
		  var frames = this._split({
		    reserve: 0,
		    chunks: [ frame.data ]
		  });

		  var fin = frame.fin ? constants.flags.END_STREAM : 0;

		  var self = this;
		  frames.forEach(function(subFrame, i) {
		    var isLast = i === frames.length - 1;
		    var flags = 0;
		    if (isLast)
		      flags |= fin;

		    self._frame({
		      id: frame.id,
		      priority: frame.priority,
		      type: 'DATA',
		      flags: flags
		    }, function(buf) {
		      buf.reserve(subFrame.size);
		      for (var i = 0; i < subFrame.chunks.length; i++)
		        buf.copyFrom(subFrame.chunks[i]);
		    }, isLast ? callback : null);
		  });

		  // Empty DATA
		  if (frames.length === 0) {
		    this._frame({
		      id: frame.id,
		      priority: frame.priority,
		      type: 'DATA',
		      flags: fin
		    }, function(buf) {
		      // No-op
		    }, callback);
		  }
		};

		Framer.prototype.pingFrame = function pingFrame(frame, callback) {
		  this._frame({
		    id: 0,
		    type: 'PING',
		    flags: frame.ack ? constants.flags.ACK : 0
		  }, function(buf) {
		    buf.copyFrom(frame.opaque);
		  }, callback);
		};

		Framer.prototype.rstFrame = function rstFrame(frame, callback) {
		  this._frame({
		    id: frame.id,
		    type: 'RST_STREAM',
		    flags: 0
		  }, function(buf) {
		    buf.writeUInt32BE(constants.error[frame.code]);
		  }, callback);
		};

		Framer.prototype.prefaceFrame = function prefaceFrame(callback) {
		  debug('preface');
		  this._resetTimeout();
		  this.schedule({
		    stream: 0,
		    priority: false,
		    chunks: [ constants.PREFACE_BUFFER ],
		    callback: callback
		  });
		};

		Framer.prototype.settingsFrame = function settingsFrame(options, callback) {
		  var key = JSON.stringify(options);

		  var settings = Framer.settingsCache[key];
		  if (settings) {
		    debug('cached settings');
		    this._resetTimeout();
		    this.schedule({
		      id: 0,
		      priority: false,
		      chunks: settings,
		      callback: callback
		    });
		    return;
		  }

		  var params = [];
		  for (var i = 0; i < constants.settingsIndex.length; i++) {
		    var name = constants.settingsIndex[i];
		    if (!name)
		      continue;

		    // value: Infinity
		    if (!isFinite(options[name]))
		      continue;

		    if (options[name] !== undefined)
		      params.push({ key: i, value: options[name] });
		  }

		  var bodySize = params.length * 6;

		  var chunks = this._frame({
		    id: 0,
		    type: 'SETTINGS',
		    flags: 0
		  }, function(buffer) {
		    buffer.reserve(bodySize);
		    for (var i = 0; i < params.length; i++) {
		      var param = params[i];

		      buffer.writeUInt16BE(param.key);
		      buffer.writeUInt32BE(param.value);
		    }
		  }, callback);

		  Framer.settingsCache[key] = chunks;
		};
		Framer.settingsCache = {};

		Framer.prototype.ackSettingsFrame = function ackSettingsFrame(callback) {
		  var chunks = this._frame({
		    id: 0,
		    type: 'SETTINGS',
		    flags: constants.flags.ACK
		  }, function(buffer) {
		    // No-op
		  }, callback);
		};

		Framer.prototype.windowUpdateFrame = function windowUpdateFrame(frame,
		                                                                callback) {
		  this._frame({
		    id: frame.id,
		    type: 'WINDOW_UPDATE',
		    flags: 0
		  }, function(buffer) {
		    buffer.reserve(4);
		    buffer.writeInt32BE(frame.delta);
		  }, callback);
		};

		Framer.prototype.goawayFrame = function goawayFrame(frame, callback) {
		  this._frame({
		    type: 'GOAWAY',
		    id: 0,
		    flags: 0
		  }, function(buf) {
		    buf.reserve(8);

		    // Last-good-stream-ID
		    buf.writeUInt32BE(frame.lastId & 0x7fffffff);
		    // Code
		    buf.writeUInt32BE(constants.goaway[frame.code]);

		    // Extra debugging information
		    if (frame.extra)
		      buf.write(frame.extra);
		  }, callback);
		};

		Framer.prototype.xForwardedFor = function xForwardedFor(frame, callback) {
		  this._frame({
		    type: 'X_FORWARDED_FOR',
		    id: 0,
		    flags: 0
		  }, function(buf) {
		    buf.write(frame.host);
		  }, callback);
		};


	/***/ },
	/* 758 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var transport = __webpack_require__(24);
		var constants = __webpack_require__(129).constants;

		var hpack = __webpack_require__(75);

		function Pool() {
		}
		module.exports = Pool;

		Pool.create = function create() {
		  return new Pool();
		};

		Pool.prototype.get = function get(version) {
		  var options = {
		    table: {
		      maxSize: constants.HEADER_TABLE_SIZE
		    }
		  };

		  var compress = hpack.compressor.create(options);
		  var decompress = hpack.decompressor.create(options);

		  return {
		    version: version,

		    compress: compress,
		    decompress: decompress
		  };
		};

		Pool.prototype.put = function put() {
		};


	/***/ },
	/* 759 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var parser = exports;

		var transport = __webpack_require__(24);
		var base = transport.protocol.base;
		var utils = base.utils;
		var constants = __webpack_require__(129).constants;

		var assert = __webpack_require__(34);
		var util = __webpack_require__(11);

		function Parser(options) {
		  base.Parser.call(this, options);

		  this.isServer = options.isServer;

		  this.waiting = constants.PREFACE_SIZE;
		  this.state = 'preface';
		  this.pendingHeader = null;

		  // Header Block queue
		  this._lastHeaderBlock = null;
		  this.maxFrameSize = constants.INITIAL_MAX_FRAME_SIZE;
		  this.maxHeaderListSize = constants.DEFAULT_MAX_HEADER_LIST_SIZE;
		}
		util.inherits(Parser, base.Parser);

		parser.create = function create(options) {
		  return new Parser(options);
		};

		Parser.prototype.setMaxFrameSize = function setMaxFrameSize(size) {
		  this.maxFrameSize = size;
		};

		Parser.prototype.setMaxHeaderListSize = function setMaxHeaderListSize(size) {
		  this.maxHeaderListSize = size;
		};

		// Only for testing
		Parser.prototype.skipPreface = function skipPreface() {
		  // Just some number bigger than 3.1, doesn't really matter for HTTP2
		  this.setVersion(4);

		  // Parse frame header!
		  this.state = 'frame-head';
		  this.waiting = constants.FRAME_HEADER_SIZE;
		};

		Parser.prototype.execute = function execute(buffer, callback) {
		  if (this.state === 'preface')
		    return this.onPreface(buffer, callback);

		  if (this.state === 'frame-head')
		    return this.onFrameHead(buffer, callback);

		  assert(this.state === 'frame-body' && this.pendingHeader !== null);

		  var self = this;
		  var header = this.pendingHeader;
		  this.pendingHeader = null;

		  this.onFrameBody(header, buffer, function(err, frame) {
		    if (err)
		      return callback(err);

		    self.state = 'frame-head';
		    self.partial = false;
		    self.waiting = constants.FRAME_HEADER_SIZE;
		    callback(null, frame);
		  });
		};

		Parser.prototype.executePartial = function executePartial(buffer, callback) {
		  var header = this.pendingHeader;

		  assert.equal(header.flags & constants.flags.PADDED, 0);

		  if (this.window)
		    this.window.recv.update(-buffer.size);

		  callback(null, {
		    type: 'DATA',
		    id: header.id,

		    // Partial DATA can't be FIN
		    fin: false,
		    data: buffer.take(buffer.size)
		  });
		};

		Parser.prototype.onPreface = function onPreface(buffer, callback) {
		  if (buffer.take(buffer.size).toString() !== constants.PREFACE) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid preface'));
		  }

		  this.skipPreface();
		  callback(null, null);
		};

		Parser.prototype.onFrameHead = function onFrameHead(buffer, callback) {
		  var header = {
		    length: buffer.readUInt24BE(),
		    control: true,
		    type: buffer.readUInt8(),
		    flags: buffer.readUInt8(),
		    id: buffer.readUInt32BE() & 0x7fffffff
		  };

		  if (header.length > this.maxFrameSize) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'Frame length OOB'));
		  }

		  header.control = header.type !== constants.frameType.DATA;

		  this.state = 'frame-body';
		  this.pendingHeader = header;
		  this.waiting = header.length;
		  this.partial = !header.control;

		  // TODO(indutny): eventually support partial padded DATA
		  if (this.partial)
		    this.partial = (header.flags & constants.flags.PADDED) === 0;

		  callback(null, null);
		};

		Parser.prototype.onFrameBody = function onFrameBody(header, buffer, callback) {
		  var frameType = constants.frameType;

		  if (header.type === frameType.DATA)
		    this.onDataFrame(header, buffer, callback);
		  else if (header.type === frameType.HEADERS)
		    this.onHeadersFrame(header, buffer, callback);
		  else if (header.type === frameType.CONTINUATION)
		    this.onContinuationFrame(header, buffer, callback);
		  else if (header.type === frameType.WINDOW_UPDATE)
		    this.onWindowUpdateFrame(header, buffer, callback);
		  else if (header.type === frameType.RST_STREAM)
		    this.onRSTFrame(header, buffer, callback);
		  else if (header.type === frameType.SETTINGS)
		    this.onSettingsFrame(header, buffer, callback);
		  else if (header.type === frameType.PUSH_PROMISE)
		    this.onPushPromiseFrame(header, buffer, callback);
		  else if (header.type === frameType.PING)
		    this.onPingFrame(header, buffer, callback);
		  else if (header.type === frameType.GOAWAY)
		    this.onGoawayFrame(header, buffer, callback);
		  else if (header.type === frameType.PRIORITY)
		    this.onPriorityFrame(header, buffer, callback);
		  else if (header.type === frameType.X_FORWARDED_FOR)
		    this.onXForwardedFrame(header, buffer, callback);
		  else
		    this.onUnknownFrame(header, buffer, callback);
		};

		Parser.prototype.onUnknownFrame = function onUnknownFrame(header, buffer, callback) {
		  if (this._lastHeaderBlock !== null) {
		    callback(this.error(constants.error.PROTOCOL_ERROR,
		                        'Received unknown frame in the middle of a header block'));
		    return;
		  }
		  callback(null, { type: 'unknown: ' + header.type });
		};

		Parser.prototype.unpadData = function unpadData(header, body, callback) {
		  var isPadded = (header.flags & constants.flags.PADDED) !== 0;

		  if (!isPadded)
		    return callback(null, body);

		  if (!body.has(1)) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'Not enough space for padding'));
		  }

		  var pad = body.readUInt8();
		  if (!body.has(pad)) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid padding size'));
		  }

		  var contents = body.clone(body.size - pad);
		  body.skip(body.size);
		  callback(null, contents);
		};

		Parser.prototype.onDataFrame = function onDataFrame(header, body, callback) {
		  var isEndStream = (header.flags & constants.flags.END_STREAM) !== 0;

		  if (header.id === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Received DATA frame with stream=0'));
		  }

		  // Count received bytes
		  if (this.window)
		    this.window.recv.update(-body.size);

		  this.unpadData(header, body, function(err, data) {
		    if (err)
		      return callback(err);

		    callback(null, {
		      type: 'DATA',
		      id: header.id,
		      fin: isEndStream,
		      data: data.take(data.size)
		    });
		  });
		};

		Parser.prototype.initHeaderBlock = function initHeaderBlock(header,
		                                                            frame,
		                                                            block,
		                                                            callback) {

		  if (this._lastHeaderBlock) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Duplicate Stream ID'));
		  }

		  this._lastHeaderBlock = {
		    id: header.id,
		    frame: frame,
		    queue: [],
		    size: 0
		  };

		  this.queueHeaderBlock(header, block, callback);
		};

		Parser.prototype.queueHeaderBlock = function queueHeaderBlock(header,
		                                                              block,
		                                                              callback) {
		  var self = this;
		  var item = this._lastHeaderBlock;
		  if (!this._lastHeaderBlock || item.id !== header.id) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'No matching stream for continuation'));
		  }

		  var fin = (header.flags & constants.flags.END_HEADERS) !== 0;

		  var chunks = block.toChunks();
		  for (var i = 0; i < chunks.length; i++) {
		    var chunk = chunks[i];
		    item.queue.push(chunk);
		    item.size += chunk.length;
		  }

		  if (item.size >= self.maxHeaderListSize) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Compressed header list is too large'));
		  }

		  if (!fin)
		    return callback(null, null);
		  this._lastHeaderBlock = null;

		  this.decompress.write(item.queue, function(err, chunks) {
		    if (err) {
		      return callback(self.error(constants.error.COMPRESSION_ERROR,
		                                 err.message));
		    }

		    var headers = {};
		    var size = 0;
		    for (var i = 0; i < chunks.length; i++) {
		      var header = chunks[i];

		      size += header.name.length + header.value.length + 32;
		      if (size >= self.maxHeaderListSize) {
		        return callback(self.error(constants.error.PROTOCOL_ERROR,
		                                   'Header list is too large'));
		      }

		      if (/[A-Z]/.test(header.name)) {
		        return callback(self.error(constants.error.PROTOCOL_ERROR,
		                                   'Header name must be lowercase'));
		      }

		      utils.addHeaderLine(header.name, header.value, headers);
		    }

		    item.frame.headers = headers;
		    item.frame.path = headers[':path'];

		    callback(null, item.frame);
		  });
		};

		Parser.prototype.onHeadersFrame = function onHeadersFrame(header,
		                                                          body,
		                                                          callback) {
		  var self = this;

		  if (header.id === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for HEADERS'));
		  }

		  this.unpadData(header, body, function(err, data) {
		    if (err)
		      return callback(err);

		    var isPriority = (header.flags & constants.flags.PRIORITY) !== 0;
		    if (!data.has(isPriority ? 5 : 0)) {
		      return callback(self.error(constants.error.FRAME_SIZE_ERROR,
		                                 'Not enough data for HEADERS'));
		    }

		    var exclusive = false;
		    var dependency = 0;
		    var weight = constants.DEFAULT_WEIGHT;
		    if (isPriority) {
		      dependency = data.readUInt32BE();
		      exclusive = (dependency & 0x80000000) !== 0;
		      dependency &= 0x7fffffff;

		      // Weight's range is [1, 256]
		      weight = data.readUInt8() + 1;
		    }

		    if (dependency === header.id) {
		      return callback(self.error(constants.error.PROTOCOL_ERROR,
		                                 'Stream can\'t dependend on itself'));
		    }

		    var streamInfo = {
		      type: 'HEADERS',
		      id: header.id,
		      priority: {
		        parent: dependency,
		        exclusive: exclusive,
		        weight: weight
		      },
		      fin: (header.flags & constants.flags.END_STREAM) !== 0,
		      writable: true,
		      headers: null,
		      path: null
		    };

		    self.initHeaderBlock(header, streamInfo, data, callback);
		  });
		};

		Parser.prototype.onContinuationFrame = function onContinuationFrame(header,
		                                                                    body,
		                                                                    callback) {
		  this.queueHeaderBlock(header, body, callback);
		};

		Parser.prototype.onRSTFrame = function onRSTFrame(header, body, callback) {
		  if (body.size !== 4) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'RST_STREAM length not 4'));
		  }

		  if (header.id === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for RST_STREAM'));
		  }

		  callback(null, {
		    type: 'RST',
		    id: header.id,
		    code: constants.errorByCode[body.readUInt32BE()]
		  });
		};

		Parser.prototype._validateSettings = function _validateSettings(settings) {
		  if (settings['enable_push'] !== undefined &&
		      settings['enable_push'] !== 0 &&
		      settings['enable_push'] !== 1)
		    return this.error(constants.error.PROTOCOL_ERROR,
		                      'SETTINGS_ENABLE_PUSH must be 0 or 1');

		  if ( settings['initial_window_size'] !== undefined &&
		      (settings['initial_window_size'] > constants.MAX_INITIAL_WINDOW_SIZE ||
		       settings['initial_window_size'] < 0))
		    return this.error(constants.error.FLOW_CONTROL_ERROR,
		                      'SETTINGS_INITIAL_WINDOW_SIZE is OOB');

		  if ( settings['max_frame_size'] !== undefined &&
		      (settings['max_frame_size'] > constants.ABSOLUTE_MAX_FRAME_SIZE ||
		       settings['max_frame_size'] < constants.INITIAL_MAX_FRAME_SIZE))
		    return this.error(constants.error.PROTOCOL_ERROR,
		                      'SETTINGS_MAX_FRAME_SIZE is OOB');

		  return undefined;
		};

		Parser.prototype.onSettingsFrame = function onSettingsFrame(header,
		                                                            body,
		                                                            callback) {

		  if (header.id !== 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for SETTINGS'));
		  }

		  var isAck = (header.flags & constants.flags.ACK) !== 0;
		  if (isAck && body.size !== 0) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'SETTINGS with ACK and non-zero length'));
		  }

		  if (isAck)
		    return callback(null, { type: 'ACK_SETTINGS' });

		  if (body.size % 6 !== 0) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'SETTINGS length not multiple of 6'));
		  }

		  var settings = {};
		  while (!body.isEmpty()) {
		    var id = body.readUInt16BE();
		    var value = body.readUInt32BE();
		    var name = constants.settingsIndex[id];

		    if (name)
		      settings[name] = value;
		  }

		  var err = this._validateSettings(settings);
		  if (err !== undefined) {
		    return callback(err);
		  }

		  callback(null, {
		    type: 'SETTINGS',
		    settings: settings
		  });
		};

		Parser.prototype.onPushPromiseFrame = function onPushPromiseFrame(header,
		                                                                  body,
		                                                                  callback) {

		  if (header.id === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for PUSH_PROMISE'));
		  }

		  var self = this;
		  this.unpadData(header, body, function(err, data) {
		    if (err)
		      return callback(err);

		    if (!data.has(4)) {
		      return callback(self.error(constants.error.FRAME_SIZE_ERROR,
		                                 'PUSH_PROMISE length less than 4'));
		    }

		    var streamInfo = {
		      type: 'PUSH_PROMISE',
		      id: header.id,
		      fin: false,
		      promisedId: data.readUInt32BE() & 0x7fffffff,
		      headers: null,
		      path: null
		    };

		    self.initHeaderBlock(header, streamInfo, data, callback);
		  });
		};

		Parser.prototype.onPingFrame = function onPingFrame(header, body, callback) {
		  if (body.size !== 8) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'PING length != 8'));
		  }

		  if (header.id !== 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for PING'));
		  }

		  var ack = (header.flags & constants.flags.ACK) !== 0;
		  callback(null, { type: 'PING', opaque: body.take(body.size), ack: ack });
		};

		Parser.prototype.onGoawayFrame = function onGoawayFrame(header,
		                                                        body,
		                                                        callback) {
		  if (!body.has(8)) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'GOAWAY length < 8'));
		  }

		  if (header.id !== 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for GOAWAY'));
		  }

		  var frame = {
		    type: 'GOAWAY',
		    lastId: body.readUInt32BE(),
		    code: constants.goawayByCode[body.readUInt32BE()]
		  };

		  if (body.size !== 0)
		    frame.debug = body.take(body.size);

		  callback(null, frame);
		};

		Parser.prototype.onPriorityFrame = function onPriorityFrame(header,
		                                                            body,
		                                                            callback) {
		  if (body.size !== 5) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'PRIORITY length != 5'));
		  }

		  if (header.id === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for PRIORITY'));
		  }

		  var dependency = body.readUInt32BE();

		  // Again the range is from 1 to 256
		  var weight = body.readUInt8() + 1;

		  if (dependency === header.id) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Stream can\'t dependend on itself'));
		  }

		  callback(null, {
		    type: 'PRIORITY',
		    id: header.id,
		    priority: {
		      exclusive: (dependency & 0x80000000) !== 0,
		      parent: dependency & 0x7fffffff,
		      weight: weight
		    }
		  });
		};

		Parser.prototype.onWindowUpdateFrame = function onWindowUpdateFrame(header,
		                                                                    body,
		                                                                    callback) {
		  if (body.size !== 4) {
		    return callback(this.error(constants.error.FRAME_SIZE_ERROR,
		                               'WINDOW_UPDATE length != 4'));
		  }

		  var delta = body.readInt32BE();
		  if (delta === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'WINDOW_UPDATE delta == 0'));
		  }

		  callback(null, {
		    type: 'WINDOW_UPDATE',
		    id: header.id,
		    delta: delta
		  });
		};

		Parser.prototype.onXForwardedFrame = function onXForwardedFrame(header,
		                                                                body,
		                                                                callback) {
		  callback(null, {
		    type: 'X_FORWARDED_FOR',
		    host: body.take(body.size).toString()
		  });
		};


	/***/ },
	/* 760 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var Buffer = __webpack_require__(0).Buffer;

		var dictionary = {};
		module.exports = dictionary;

		dictionary[2] = new Buffer([
		  'optionsgetheadpostputdeletetraceacceptaccept-charsetaccept-encodingaccept-',
		  'languageauthorizationexpectfromhostif-modified-sinceif-matchif-none-matchi',
		  'f-rangeif-unmodifiedsincemax-forwardsproxy-authorizationrangerefererteuser',
		  '-agent10010120020120220320420520630030130230330430530630740040140240340440',
		  '5406407408409410411412413414415416417500501502503504505accept-rangesageeta',
		  'glocationproxy-authenticatepublicretry-afterservervarywarningwww-authentic',
		  'ateallowcontent-basecontent-encodingcache-controlconnectiondatetrailertran',
		  'sfer-encodingupgradeviawarningcontent-languagecontent-lengthcontent-locati',
		  'oncontent-md5content-rangecontent-typeetagexpireslast-modifiedset-cookieMo',
		  'ndayTuesdayWednesdayThursdayFridaySaturdaySundayJanFebMarAprMayJunJulAugSe',
		  'pOctNovDecchunkedtext/htmlimage/pngimage/jpgimage/gifapplication/xmlapplic',
		  'ation/xhtmltext/plainpublicmax-agecharset=iso-8859-1utf-8gzipdeflateHTTP/1',
		  '.1statusversionurl\x00'
		].join(''));

		dictionary[3] = new Buffer([
		  0x00, 0x00, 0x00, 0x07, 0x6f, 0x70, 0x74, 0x69,  // ....opti
		  0x6f, 0x6e, 0x73, 0x00, 0x00, 0x00, 0x04, 0x68,  // ons....h
		  0x65, 0x61, 0x64, 0x00, 0x00, 0x00, 0x04, 0x70,  // ead....p
		  0x6f, 0x73, 0x74, 0x00, 0x00, 0x00, 0x03, 0x70,  // ost....p
		  0x75, 0x74, 0x00, 0x00, 0x00, 0x06, 0x64, 0x65,  // ut....de
		  0x6c, 0x65, 0x74, 0x65, 0x00, 0x00, 0x00, 0x05,  // lete....
		  0x74, 0x72, 0x61, 0x63, 0x65, 0x00, 0x00, 0x00,  // trace...
		  0x06, 0x61, 0x63, 0x63, 0x65, 0x70, 0x74, 0x00,  // .accept.
		  0x00, 0x00, 0x0e, 0x61, 0x63, 0x63, 0x65, 0x70,  // ...accep
		  0x74, 0x2d, 0x63, 0x68, 0x61, 0x72, 0x73, 0x65,  // t-charse
		  0x74, 0x00, 0x00, 0x00, 0x0f, 0x61, 0x63, 0x63,  // t....acc
		  0x65, 0x70, 0x74, 0x2d, 0x65, 0x6e, 0x63, 0x6f,  // ept-enco
		  0x64, 0x69, 0x6e, 0x67, 0x00, 0x00, 0x00, 0x0f,  // ding....
		  0x61, 0x63, 0x63, 0x65, 0x70, 0x74, 0x2d, 0x6c,  // accept-l
		  0x61, 0x6e, 0x67, 0x75, 0x61, 0x67, 0x65, 0x00,  // anguage.
		  0x00, 0x00, 0x0d, 0x61, 0x63, 0x63, 0x65, 0x70,  // ...accep
		  0x74, 0x2d, 0x72, 0x61, 0x6e, 0x67, 0x65, 0x73,  // t-ranges
		  0x00, 0x00, 0x00, 0x03, 0x61, 0x67, 0x65, 0x00,  // ....age.
		  0x00, 0x00, 0x05, 0x61, 0x6c, 0x6c, 0x6f, 0x77,  // ...allow
		  0x00, 0x00, 0x00, 0x0d, 0x61, 0x75, 0x74, 0x68,  // ....auth
		  0x6f, 0x72, 0x69, 0x7a, 0x61, 0x74, 0x69, 0x6f,  // orizatio
		  0x6e, 0x00, 0x00, 0x00, 0x0d, 0x63, 0x61, 0x63,  // n....cac
		  0x68, 0x65, 0x2d, 0x63, 0x6f, 0x6e, 0x74, 0x72,  // he-contr
		  0x6f, 0x6c, 0x00, 0x00, 0x00, 0x0a, 0x63, 0x6f,  // ol....co
		  0x6e, 0x6e, 0x65, 0x63, 0x74, 0x69, 0x6f, 0x6e,  // nnection
		  0x00, 0x00, 0x00, 0x0c, 0x63, 0x6f, 0x6e, 0x74,  // ....cont
		  0x65, 0x6e, 0x74, 0x2d, 0x62, 0x61, 0x73, 0x65,  // ent-base
		  0x00, 0x00, 0x00, 0x10, 0x63, 0x6f, 0x6e, 0x74,  // ....cont
		  0x65, 0x6e, 0x74, 0x2d, 0x65, 0x6e, 0x63, 0x6f,  // ent-enco
		  0x64, 0x69, 0x6e, 0x67, 0x00, 0x00, 0x00, 0x10,  // ding....
		  0x63, 0x6f, 0x6e, 0x74, 0x65, 0x6e, 0x74, 0x2d,  // content-
		  0x6c, 0x61, 0x6e, 0x67, 0x75, 0x61, 0x67, 0x65,  // language
		  0x00, 0x00, 0x00, 0x0e, 0x63, 0x6f, 0x6e, 0x74,  // ....cont
		  0x65, 0x6e, 0x74, 0x2d, 0x6c, 0x65, 0x6e, 0x67,  // ent-leng
		  0x74, 0x68, 0x00, 0x00, 0x00, 0x10, 0x63, 0x6f,  // th....co
		  0x6e, 0x74, 0x65, 0x6e, 0x74, 0x2d, 0x6c, 0x6f,  // ntent-lo
		  0x63, 0x61, 0x74, 0x69, 0x6f, 0x6e, 0x00, 0x00,  // cation..
		  0x00, 0x0b, 0x63, 0x6f, 0x6e, 0x74, 0x65, 0x6e,  // ..conten
		  0x74, 0x2d, 0x6d, 0x64, 0x35, 0x00, 0x00, 0x00,  // t-md5...
		  0x0d, 0x63, 0x6f, 0x6e, 0x74, 0x65, 0x6e, 0x74,  // .content
		  0x2d, 0x72, 0x61, 0x6e, 0x67, 0x65, 0x00, 0x00,  // -range..
		  0x00, 0x0c, 0x63, 0x6f, 0x6e, 0x74, 0x65, 0x6e,  // ..conten
		  0x74, 0x2d, 0x74, 0x79, 0x70, 0x65, 0x00, 0x00,  // t-type..
		  0x00, 0x04, 0x64, 0x61, 0x74, 0x65, 0x00, 0x00,  // ..date..
		  0x00, 0x04, 0x65, 0x74, 0x61, 0x67, 0x00, 0x00,  // ..etag..
		  0x00, 0x06, 0x65, 0x78, 0x70, 0x65, 0x63, 0x74,  // ..expect
		  0x00, 0x00, 0x00, 0x07, 0x65, 0x78, 0x70, 0x69,  // ....expi
		  0x72, 0x65, 0x73, 0x00, 0x00, 0x00, 0x04, 0x66,  // res....f
		  0x72, 0x6f, 0x6d, 0x00, 0x00, 0x00, 0x04, 0x68,  // rom....h
		  0x6f, 0x73, 0x74, 0x00, 0x00, 0x00, 0x08, 0x69,  // ost....i
		  0x66, 0x2d, 0x6d, 0x61, 0x74, 0x63, 0x68, 0x00,  // f-match.
		  0x00, 0x00, 0x11, 0x69, 0x66, 0x2d, 0x6d, 0x6f,  // ...if-mo
		  0x64, 0x69, 0x66, 0x69, 0x65, 0x64, 0x2d, 0x73,  // dified-s
		  0x69, 0x6e, 0x63, 0x65, 0x00, 0x00, 0x00, 0x0d,  // ince....
		  0x69, 0x66, 0x2d, 0x6e, 0x6f, 0x6e, 0x65, 0x2d,  // if-none-
		  0x6d, 0x61, 0x74, 0x63, 0x68, 0x00, 0x00, 0x00,  // match...
		  0x08, 0x69, 0x66, 0x2d, 0x72, 0x61, 0x6e, 0x67,  // .if-rang
		  0x65, 0x00, 0x00, 0x00, 0x13, 0x69, 0x66, 0x2d,  // e....if-
		  0x75, 0x6e, 0x6d, 0x6f, 0x64, 0x69, 0x66, 0x69,  // unmodifi
		  0x65, 0x64, 0x2d, 0x73, 0x69, 0x6e, 0x63, 0x65,  // ed-since
		  0x00, 0x00, 0x00, 0x0d, 0x6c, 0x61, 0x73, 0x74,  // ....last
		  0x2d, 0x6d, 0x6f, 0x64, 0x69, 0x66, 0x69, 0x65,  // -modifie
		  0x64, 0x00, 0x00, 0x00, 0x08, 0x6c, 0x6f, 0x63,  // d....loc
		  0x61, 0x74, 0x69, 0x6f, 0x6e, 0x00, 0x00, 0x00,  // ation...
		  0x0c, 0x6d, 0x61, 0x78, 0x2d, 0x66, 0x6f, 0x72,  // .max-for
		  0x77, 0x61, 0x72, 0x64, 0x73, 0x00, 0x00, 0x00,  // wards...
		  0x06, 0x70, 0x72, 0x61, 0x67, 0x6d, 0x61, 0x00,  // .pragma.
		  0x00, 0x00, 0x12, 0x70, 0x72, 0x6f, 0x78, 0x79,  // ...proxy
		  0x2d, 0x61, 0x75, 0x74, 0x68, 0x65, 0x6e, 0x74,  // -authent
		  0x69, 0x63, 0x61, 0x74, 0x65, 0x00, 0x00, 0x00,  // icate...
		  0x13, 0x70, 0x72, 0x6f, 0x78, 0x79, 0x2d, 0x61,  // .proxy-a
		  0x75, 0x74, 0x68, 0x6f, 0x72, 0x69, 0x7a, 0x61,  // uthoriza
		  0x74, 0x69, 0x6f, 0x6e, 0x00, 0x00, 0x00, 0x05,  // tion....
		  0x72, 0x61, 0x6e, 0x67, 0x65, 0x00, 0x00, 0x00,  // range...
		  0x07, 0x72, 0x65, 0x66, 0x65, 0x72, 0x65, 0x72,  // .referer
		  0x00, 0x00, 0x00, 0x0b, 0x72, 0x65, 0x74, 0x72,  // ....retr
		  0x79, 0x2d, 0x61, 0x66, 0x74, 0x65, 0x72, 0x00,  // y-after.
		  0x00, 0x00, 0x06, 0x73, 0x65, 0x72, 0x76, 0x65,  // ...serve
		  0x72, 0x00, 0x00, 0x00, 0x02, 0x74, 0x65, 0x00,  // r....te.
		  0x00, 0x00, 0x07, 0x74, 0x72, 0x61, 0x69, 0x6c,  // ...trail
		  0x65, 0x72, 0x00, 0x00, 0x00, 0x11, 0x74, 0x72,  // er....tr
		  0x61, 0x6e, 0x73, 0x66, 0x65, 0x72, 0x2d, 0x65,  // ansfer-e
		  0x6e, 0x63, 0x6f, 0x64, 0x69, 0x6e, 0x67, 0x00,  // ncoding.
		  0x00, 0x00, 0x07, 0x75, 0x70, 0x67, 0x72, 0x61,  // ...upgra
		  0x64, 0x65, 0x00, 0x00, 0x00, 0x0a, 0x75, 0x73,  // de....us
		  0x65, 0x72, 0x2d, 0x61, 0x67, 0x65, 0x6e, 0x74,  // er-agent
		  0x00, 0x00, 0x00, 0x04, 0x76, 0x61, 0x72, 0x79,  // ....vary
		  0x00, 0x00, 0x00, 0x03, 0x76, 0x69, 0x61, 0x00,  // ....via.
		  0x00, 0x00, 0x07, 0x77, 0x61, 0x72, 0x6e, 0x69,  // ...warni
		  0x6e, 0x67, 0x00, 0x00, 0x00, 0x10, 0x77, 0x77,  // ng....ww
		  0x77, 0x2d, 0x61, 0x75, 0x74, 0x68, 0x65, 0x6e,  // w-authen
		  0x74, 0x69, 0x63, 0x61, 0x74, 0x65, 0x00, 0x00,  // ticate..
		  0x00, 0x06, 0x6d, 0x65, 0x74, 0x68, 0x6f, 0x64,  // ..method
		  0x00, 0x00, 0x00, 0x03, 0x67, 0x65, 0x74, 0x00,  // ....get.
		  0x00, 0x00, 0x06, 0x73, 0x74, 0x61, 0x74, 0x75,  // ...statu
		  0x73, 0x00, 0x00, 0x00, 0x06, 0x32, 0x30, 0x30,  // s....200
		  0x20, 0x4f, 0x4b, 0x00, 0x00, 0x00, 0x07, 0x76,  // .OK....v
		  0x65, 0x72, 0x73, 0x69, 0x6f, 0x6e, 0x00, 0x00,  // ersion..
		  0x00, 0x08, 0x48, 0x54, 0x54, 0x50, 0x2f, 0x31,  // ..HTTP.1
		  0x2e, 0x31, 0x00, 0x00, 0x00, 0x03, 0x75, 0x72,  // .1....ur
		  0x6c, 0x00, 0x00, 0x00, 0x06, 0x70, 0x75, 0x62,  // l....pub
		  0x6c, 0x69, 0x63, 0x00, 0x00, 0x00, 0x0a, 0x73,  // lic....s
		  0x65, 0x74, 0x2d, 0x63, 0x6f, 0x6f, 0x6b, 0x69,  // et-cooki
		  0x65, 0x00, 0x00, 0x00, 0x0a, 0x6b, 0x65, 0x65,  // e....kee
		  0x70, 0x2d, 0x61, 0x6c, 0x69, 0x76, 0x65, 0x00,  // p-alive.
		  0x00, 0x00, 0x06, 0x6f, 0x72, 0x69, 0x67, 0x69,  // ...origi
		  0x6e, 0x31, 0x30, 0x30, 0x31, 0x30, 0x31, 0x32,  // n1001012
		  0x30, 0x31, 0x32, 0x30, 0x32, 0x32, 0x30, 0x35,  // 01202205
		  0x32, 0x30, 0x36, 0x33, 0x30, 0x30, 0x33, 0x30,  // 20630030
		  0x32, 0x33, 0x30, 0x33, 0x33, 0x30, 0x34, 0x33,  // 23033043
		  0x30, 0x35, 0x33, 0x30, 0x36, 0x33, 0x30, 0x37,  // 05306307
		  0x34, 0x30, 0x32, 0x34, 0x30, 0x35, 0x34, 0x30,  // 40240540
		  0x36, 0x34, 0x30, 0x37, 0x34, 0x30, 0x38, 0x34,  // 64074084
		  0x30, 0x39, 0x34, 0x31, 0x30, 0x34, 0x31, 0x31,  // 09410411
		  0x34, 0x31, 0x32, 0x34, 0x31, 0x33, 0x34, 0x31,  // 41241341
		  0x34, 0x34, 0x31, 0x35, 0x34, 0x31, 0x36, 0x34,  // 44154164
		  0x31, 0x37, 0x35, 0x30, 0x32, 0x35, 0x30, 0x34,  // 17502504
		  0x35, 0x30, 0x35, 0x32, 0x30, 0x33, 0x20, 0x4e,  // 505203.N
		  0x6f, 0x6e, 0x2d, 0x41, 0x75, 0x74, 0x68, 0x6f,  // on-Autho
		  0x72, 0x69, 0x74, 0x61, 0x74, 0x69, 0x76, 0x65,  // ritative
		  0x20, 0x49, 0x6e, 0x66, 0x6f, 0x72, 0x6d, 0x61,  // .Informa
		  0x74, 0x69, 0x6f, 0x6e, 0x32, 0x30, 0x34, 0x20,  // tion204.
		  0x4e, 0x6f, 0x20, 0x43, 0x6f, 0x6e, 0x74, 0x65,  // No.Conte
		  0x6e, 0x74, 0x33, 0x30, 0x31, 0x20, 0x4d, 0x6f,  // nt301.Mo
		  0x76, 0x65, 0x64, 0x20, 0x50, 0x65, 0x72, 0x6d,  // ved.Perm
		  0x61, 0x6e, 0x65, 0x6e, 0x74, 0x6c, 0x79, 0x34,  // anently4
		  0x30, 0x30, 0x20, 0x42, 0x61, 0x64, 0x20, 0x52,  // 00.Bad.R
		  0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x34, 0x30,  // equest40
		  0x31, 0x20, 0x55, 0x6e, 0x61, 0x75, 0x74, 0x68,  // 1.Unauth
		  0x6f, 0x72, 0x69, 0x7a, 0x65, 0x64, 0x34, 0x30,  // orized40
		  0x33, 0x20, 0x46, 0x6f, 0x72, 0x62, 0x69, 0x64,  // 3.Forbid
		  0x64, 0x65, 0x6e, 0x34, 0x30, 0x34, 0x20, 0x4e,  // den404.N
		  0x6f, 0x74, 0x20, 0x46, 0x6f, 0x75, 0x6e, 0x64,  // ot.Found
		  0x35, 0x30, 0x30, 0x20, 0x49, 0x6e, 0x74, 0x65,  // 500.Inte
		  0x72, 0x6e, 0x61, 0x6c, 0x20, 0x53, 0x65, 0x72,  // rnal.Ser
		  0x76, 0x65, 0x72, 0x20, 0x45, 0x72, 0x72, 0x6f,  // ver.Erro
		  0x72, 0x35, 0x30, 0x31, 0x20, 0x4e, 0x6f, 0x74,  // r501.Not
		  0x20, 0x49, 0x6d, 0x70, 0x6c, 0x65, 0x6d, 0x65,  // .Impleme
		  0x6e, 0x74, 0x65, 0x64, 0x35, 0x30, 0x33, 0x20,  // nted503.
		  0x53, 0x65, 0x72, 0x76, 0x69, 0x63, 0x65, 0x20,  // Service.
		  0x55, 0x6e, 0x61, 0x76, 0x61, 0x69, 0x6c, 0x61,  // Unavaila
		  0x62, 0x6c, 0x65, 0x4a, 0x61, 0x6e, 0x20, 0x46,  // bleJan.F
		  0x65, 0x62, 0x20, 0x4d, 0x61, 0x72, 0x20, 0x41,  // eb.Mar.A
		  0x70, 0x72, 0x20, 0x4d, 0x61, 0x79, 0x20, 0x4a,  // pr.May.J
		  0x75, 0x6e, 0x20, 0x4a, 0x75, 0x6c, 0x20, 0x41,  // un.Jul.A
		  0x75, 0x67, 0x20, 0x53, 0x65, 0x70, 0x74, 0x20,  // ug.Sept.
		  0x4f, 0x63, 0x74, 0x20, 0x4e, 0x6f, 0x76, 0x20,  // Oct.Nov.
		  0x44, 0x65, 0x63, 0x20, 0x30, 0x30, 0x3a, 0x30,  // Dec.00.0
		  0x30, 0x3a, 0x30, 0x30, 0x20, 0x4d, 0x6f, 0x6e,  // 0.00.Mon
		  0x2c, 0x20, 0x54, 0x75, 0x65, 0x2c, 0x20, 0x57,  // ..Tue..W
		  0x65, 0x64, 0x2c, 0x20, 0x54, 0x68, 0x75, 0x2c,  // ed..Thu.
		  0x20, 0x46, 0x72, 0x69, 0x2c, 0x20, 0x53, 0x61,  // .Fri..Sa
		  0x74, 0x2c, 0x20, 0x53, 0x75, 0x6e, 0x2c, 0x20,  // t..Sun..
		  0x47, 0x4d, 0x54, 0x63, 0x68, 0x75, 0x6e, 0x6b,  // GMTchunk
		  0x65, 0x64, 0x2c, 0x74, 0x65, 0x78, 0x74, 0x2f,  // ed.text.
		  0x68, 0x74, 0x6d, 0x6c, 0x2c, 0x69, 0x6d, 0x61,  // html.ima
		  0x67, 0x65, 0x2f, 0x70, 0x6e, 0x67, 0x2c, 0x69,  // ge.png.i
		  0x6d, 0x61, 0x67, 0x65, 0x2f, 0x6a, 0x70, 0x67,  // mage.jpg
		  0x2c, 0x69, 0x6d, 0x61, 0x67, 0x65, 0x2f, 0x67,  // .image.g
		  0x69, 0x66, 0x2c, 0x61, 0x70, 0x70, 0x6c, 0x69,  // if.appli
		  0x63, 0x61, 0x74, 0x69, 0x6f, 0x6e, 0x2f, 0x78,  // cation.x
		  0x6d, 0x6c, 0x2c, 0x61, 0x70, 0x70, 0x6c, 0x69,  // ml.appli
		  0x63, 0x61, 0x74, 0x69, 0x6f, 0x6e, 0x2f, 0x78,  // cation.x
		  0x68, 0x74, 0x6d, 0x6c, 0x2b, 0x78, 0x6d, 0x6c,  // html.xml
		  0x2c, 0x74, 0x65, 0x78, 0x74, 0x2f, 0x70, 0x6c,  // .text.pl
		  0x61, 0x69, 0x6e, 0x2c, 0x74, 0x65, 0x78, 0x74,  // ain.text
		  0x2f, 0x6a, 0x61, 0x76, 0x61, 0x73, 0x63, 0x72,  // .javascr
		  0x69, 0x70, 0x74, 0x2c, 0x70, 0x75, 0x62, 0x6c,  // ipt.publ
		  0x69, 0x63, 0x70, 0x72, 0x69, 0x76, 0x61, 0x74,  // icprivat
		  0x65, 0x6d, 0x61, 0x78, 0x2d, 0x61, 0x67, 0x65,  // emax-age
		  0x3d, 0x67, 0x7a, 0x69, 0x70, 0x2c, 0x64, 0x65,  // .gzip.de
		  0x66, 0x6c, 0x61, 0x74, 0x65, 0x2c, 0x73, 0x64,  // flate.sd
		  0x63, 0x68, 0x63, 0x68, 0x61, 0x72, 0x73, 0x65,  // chcharse
		  0x74, 0x3d, 0x75, 0x74, 0x66, 0x2d, 0x38, 0x63,  // t.utf-8c
		  0x68, 0x61, 0x72, 0x73, 0x65, 0x74, 0x3d, 0x69,  // harset.i
		  0x73, 0x6f, 0x2d, 0x38, 0x38, 0x35, 0x39, 0x2d,  // so-8859-
		  0x31, 0x2c, 0x75, 0x74, 0x66, 0x2d, 0x2c, 0x2a,  // 1.utf-..
		  0x2c, 0x65, 0x6e, 0x71, 0x3d, 0x30, 0x2e         // .enq.0.
		]);

		dictionary[3.1] = dictionary[3];


	/***/ },
	/* 761 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var transport = __webpack_require__(24);
		var constants = __webpack_require__(283).constants;
		var base = transport.protocol.base;
		var utils = base.utils;

		var assert = __webpack_require__(34);
		var util = __webpack_require__(11);
		var Buffer = __webpack_require__(0).Buffer;
		var WriteBuffer = __webpack_require__(181);

		var debug = __webpack_require__(17)('spdy:framer');

		function Framer(options) {
		  base.Framer.call(this, options);
		}
		util.inherits(Framer, base.Framer);
		module.exports = Framer;

		Framer.create = function create(options) {
		  return new Framer(options);
		};

		Framer.prototype.setMaxFrameSize = function setMaxFrameSize(size) {
		  // http2-only
		};

		Framer.prototype.headersToDict = function headersToDict(headers,
		                                                        preprocess,
		                                                        callback) {
		  function stringify(value) {
		    if (value !== undefined) {
		      if (Array.isArray(value)) {
		        return value.join('\x00');
		      } else if (typeof value === 'string') {
		        return value;
		      } else {
		        return value.toString();
		      }
		    } else {
		      return '';
		    }
		  }

		  // Lower case of all headers keys
		  var loweredHeaders = {};
		  Object.keys(headers || {}).map(function(key) {
		    loweredHeaders[key.toLowerCase()] = headers[key];
		  });

		  // Allow outer code to add custom headers or remove something
		  if (preprocess)
		    preprocess(loweredHeaders);

		  // Transform object into kv pairs
		  var size = this.version === 2 ? 2 : 4;
		  var len = size;
		  var pairs = Object.keys(loweredHeaders).filter(function(key) {
		    var lkey = key.toLowerCase();

		    // Will be in `:host`
		    if (lkey === 'host' && this.version >= 3)
		      return false;

		    return lkey !== 'connection' && lkey !== 'keep-alive' &&
		           lkey !== 'proxy-connection' && lkey !== 'transfer-encoding';
		  }, this).map(function(key) {
		    var klen = Buffer.byteLength(key),
		        value = stringify(loweredHeaders[key]),
		        vlen = Buffer.byteLength(value);

		    len += size * 2 + klen + vlen;
		    return [klen, key, vlen, value];
		  });

		  var block = new WriteBuffer();
		  block.reserve(len);

		  if (this.version === 2)
		    block.writeUInt16BE(pairs.length);
		  else
		    block.writeUInt32BE(pairs.length);

		  pairs.forEach(function(pair) {
		    // Write key length
		    if (this.version === 2)
		      block.writeUInt16BE(pair[0]);
		    else
		      block.writeUInt32BE(pair[0]);

		    // Write key
		    block.write(pair[1]);

		    // Write value length
		    if (this.version === 2)
		      block.writeUInt16BE(pair[2]);
		    else
		      block.writeUInt32BE(pair[2]);
		    // Write value
		    block.write(pair[3]);
		  }, this);

		  assert(this.compress !== null, 'Framer version not initialized');
		  this.compress.write(block.render(), callback);
		};

		Framer.prototype._frame = function _frame(frame, body, callback) {
		  if (!this.version) {
		    this.on('version', function() {
		      this._frame(frame, body, callback);
		    });
		    return;
		  }

		  debug('id=%d type=%s', frame.id, frame.type);

		  var buffer = new WriteBuffer();

		  buffer.writeUInt16BE(0x8000 | this.version);
		  buffer.writeUInt16BE(constants.frameType[frame.type]);
		  buffer.writeUInt8(frame.flags);
		  var len = buffer.skip(3);

		  var self = this;
		  body(buffer);

		  var frameSize = buffer.size - constants.FRAME_HEADER_SIZE;
		  len.writeUInt24BE(frameSize);

		  var chunks = buffer.render();
		  var toWrite = {
		    stream: frame.id,
		    priority: false,
		    chunks: chunks,
		    callback: callback
		  };

		  this._resetTimeout();
		  this.schedule(toWrite);

		  return chunks;
		};

		Framer.prototype._synFrame = function _synFrame(frame, callback) {
		  var self = this;

		  if (!frame.path)
		    throw new Error('`path` is required frame argument');

		  function preprocess(headers) {
		    var method = frame.method || base.constants.DEFAULT_METHOD;
		    var version = frame.version || 'HTTP/1.1';
		    var scheme = frame.scheme || 'https';
		    var host = frame.host ||
		               frame.headers && frame.headers.host ||
		               base.constants.DEFAULT_HOST;

		    if (self.version === 2) {
		      headers.method = method;
		      headers.version = version;
		      headers.url = frame.path;
		      headers.scheme = scheme;
		      headers.host = host;
		      if (frame.status)
		        headers.status = frame.status;
		    } else {
		      headers[':method'] = method;
		      headers[':version'] = version;
		      headers[':path'] = frame.path;
		      headers[':scheme'] = scheme;
		      headers[':host'] = host;
		      if (frame.status)
		        headers[':status'] = frame.status;
		    }
		  }

		  this.headersToDict(frame.headers, preprocess, function(err, chunks) {
		    if (err) {
		      if (callback)
		        return callback(err);
		      else
		        return self.emit('error', err);
		    }

		    self._frame({
		      type: 'SYN_STREAM',
		      id: frame.id,
		      flags: frame.fin ? constants.flags.FLAG_FIN : 0
		    }, function(buf) {
		      buf.reserve(10);

		      buf.writeUInt32BE(frame.id & 0x7fffffff);
		      buf.writeUInt32BE(frame.associated & 0x7fffffff);

		      var weight = frame.priority && frame.priority.weight ||
		                   constants.DEFAULT_WEIGHT;

		      // We only have 3 bits for priority in SPDY, try to fit it into this
		      var priority = utils.weightToPriority(weight);
		      buf.writeUInt8(priority << 5);

		      // CREDENTIALS slot
		      buf.writeUInt8(0);

		      for (var i = 0; i < chunks.length; i++)
		        buf.copyFrom(chunks[i]);
		    }, callback);
		  });
		};

		Framer.prototype.requestFrame = function requestFrame(frame, callback) {
		  this._synFrame({
		    id: frame.id,
		    fin: frame.fin,
		    associated: 0,
		    method: frame.method,
		    version: frame.version,
		    scheme: frame.scheme,
		    host: frame.host,
		    path: frame.path,
		    priority: frame.priority,
		    headers: frame.headers
		  }, callback);
		};

		Framer.prototype.responseFrame = function responseFrame(frame, callback) {
		  var self = this;

		  var reason = frame.reason;
		  if (!reason)
		    reason = constants.statusReason[frame.status];

		  function preprocess(headers) {
		    if (self.version === 2) {
		      headers.status = frame.status + ' ' + reason;
		      headers.version = 'HTTP/1.1';
		    } else {
		      headers[':status'] = frame.status + ' ' + reason;
		      headers[':version'] = 'HTTP/1.1';
		    }
		  }

		  this.headersToDict(frame.headers, preprocess, function(err, chunks) {
		    if (err) {
		      if (callback)
		        return callback(err);
		      else
		        return self.emit('error', err);
		    }

		    self._frame({
		      type: 'SYN_REPLY',
		      id: frame.id,
		      flags: 0
		    }, function(buf) {
		      buf.reserve(self.version === 2 ? 6 : 4);

		      buf.writeUInt32BE(frame.id & 0x7fffffff);

		      // Unused data
		      if (self.version === 2)
		        buf.writeUInt16BE(0);

		      for (var i = 0; i < chunks.length; i++)
		        buf.copyFrom(chunks[i]);
		    }, callback);
		  });
		};


		Framer.prototype.pushFrame = function pushFrame(frame, callback) {
		  var self = this;

		  this._checkPush(function(err) {
		    if (err)
		      return callback(err);

		    self._synFrame({
		      id: frame.promisedId,
		      associated: frame.id,
		      method: frame.method,
		      status: frame.status || 200,
		      version: frame.version,
		      scheme: frame.scheme,
		      host: frame.host,
		      path: frame.path,
		      priority: frame.priority,

		      // Merge everything together, there is no difference in SPDY protocol
		      headers: util._extend(util._extend({}, frame.headers), frame.response)
		    }, callback);
		  });
		};

		Framer.prototype.headersFrame = function headersFrame(frame, callback) {
		  var self = this;

		  this.headersToDict(frame.headers, null, function(err, chunks) {
		    if (err) {
		      if (callback)
		        return callback(err);
		      else
		        return self.emit('error', err);
		    }

		    self._frame({
		      type: 'HEADERS',
		      id: frame.id,
		      priority: false,
		      flags: 0
		    }, function(buf) {
		      buf.reserve(4 + (self.version === 2 ? 2 : 0));
		      buf.writeUInt32BE(frame.id & 0x7fffffff);

		      // Unused data
		      if (self.version === 2)
		        buf.writeUInt16BE(0);

		      for (var i = 0; i < chunks.length; i++)
		        buf.copyFrom(chunks[i]);
		    }, callback);
		  });
		};

		Framer.prototype.dataFrame = function dataFrame(frame, callback) {
		  if (!this.version) {
		    return this.on('version', function() {
		      this.dataFrame(frame, callback);
		    });
		  }

		  debug('id=%d type=DATA', frame.id);

		  var buffer = new WriteBuffer();
		  buffer.reserve(8 + frame.data.length);

		  buffer.writeUInt32BE(frame.id & 0x7fffffff);
		  buffer.writeUInt8(frame.fin ? 0x01 : 0x0);
		  buffer.writeUInt24BE(frame.data.length);
		  buffer.copyFrom(frame.data);

		  var chunks = buffer.render();
		  var toWrite = {
		    stream: frame.id,
		    priority: frame.priority,
		    chunks: chunks,
		    callback: callback
		  };

		  var self = this;
		  this._resetTimeout();
		  this.window.send.update(-frame.data.length, function() {
		    self._resetTimeout();
		    self.schedule(toWrite);
		  });
		};

		Framer.prototype.pingFrame = function pingFrame(frame, callback) {
		  this._frame({
		    type: 'PING',
		    id: 0,
		    flags: 0
		  }, function(buf, callback) {
		    buf.reserve(4);

		    var opaque = frame.opaque;
		    buf.writeUInt32BE(opaque.readUInt32BE(opaque.length - 4, true));
		  }, callback);
		};

		Framer.prototype.rstFrame = function rstFrame(frame, callback) {
		  var self = this;

		  this._frame({
		    type: 'RST_STREAM',
		    id: frame.id,
		    flags: 0
		  }, function(buf) {
		    buf.reserve(8);

		    // Stream ID
		    buf.writeUInt32BE(frame.id & 0x7fffffff);
		    // Status Code
		    buf.writeUInt32BE(constants.error[frame.code]);

		    // Extra debugging information
		    if (frame.extra)
		      buf.write(frame.extra);
		  }, callback);
		};

		Framer.prototype.prefaceFrame = function prefaceFrame() {
		};

		Framer.prototype.settingsFrame = function settingsFrame(options, callback) {
		  var self = this;

		  var key = this.version + '/' + JSON.stringify(options);

		  var settings = Framer.settingsCache[key];
		  if (settings) {
		    debug('cached settings');
		    this._resetTimeout();
		    this.schedule({
		      stream: 0,
		      priority: false,
		      chunks: settings,
		      callback: callback
		    });
		    return;
		  }

		  var params = [];
		  for (var i = 0; i < constants.settingsIndex.length; i++) {
		    var name = constants.settingsIndex[i];
		    if (!name)
		      continue;

		    // value: Infinity
		    if (!isFinite(options[name]))
		      continue;

		    if (options[name] !== undefined)
		      params.push({ key: i, value: options[name] });
		  }

		  var frame = this._frame({
		    type: 'SETTINGS',
		    id: 0,
		    flags: 0
		  }, function(buf) {
		    buf.reserve(4 + 8 * params.length);

		    // Count of entries
		    buf.writeUInt32BE(params.length);

		    params.forEach(function(param) {
		      var flag = constants.settings.FLAG_SETTINGS_PERSIST_VALUE << 24;

		      if (self.version === 2)
		        buf.writeUInt32LE(flag | param.key);
		      else
		        buf.writeUInt32BE(flag | param.key);
		      buf.writeUInt32BE(param.value & 0x7fffffff);
		    });
		  }, callback);

		  Framer.settingsCache[key] = frame;
		};
		Framer.settingsCache = {};

		Framer.prototype.ackSettingsFrame = function ackSettingsFrame(callback) {
		  if (callback)
		    process.nextTick(callback);
		};

		Framer.prototype.windowUpdateFrame = function windowUpdateFrame(frame,
		                                                                callback) {
		  this._frame({
		    type: 'WINDOW_UPDATE',
		    id: frame.id,
		    flags: 0
		  }, function(buf) {
		    buf.reserve(8);

		    // ID
		    buf.writeUInt32BE(frame.id & 0x7fffffff);

		    // Delta
		    buf.writeInt32BE(frame.delta);
		  }, callback);
		};

		Framer.prototype.goawayFrame = function goawayFrame(frame, callback) {
		  this._frame({
		    type: 'GOAWAY',
		    id: 0,
		    flags: 0
		  }, function(buf) {
		    buf.reserve(8);

		    // Last-good-stream-ID
		    buf.writeUInt32BE(frame.lastId & 0x7fffffff);
		    // Status
		    buf.writeUInt32BE(constants.goaway[frame.code]);
		  }, callback);
		};

		Framer.prototype.priorityFrame = function priorityFrame(frame, callback) {
		  // No such thing in SPDY
		  if (callback)
		    process.nextTick(callback);
		};

		Framer.prototype.xForwardedFor = function xForwardedFor(frame, callback) {
		  this._frame({
		    type: 'X_FORWARDED_FOR',
		    id: 0,
		    flags: 0
		  }, function(buf) {
		    buf.writeUInt32BE(Buffer.byteLength(frame.host));
		    buf.write(frame.host);
		  }, callback);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 762 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var parser = exports;

		var transport = __webpack_require__(24);
		var base = transport.protocol.base;
		var utils = base.utils;
		var constants = __webpack_require__(282);

		var assert = __webpack_require__(34);
		var util = __webpack_require__(11);
		var OffsetBuffer = __webpack_require__(124);

		function Parser(options) {
		  base.Parser.call(this, options);

		  this.isServer = options.isServer;
		  this.waiting = constants.FRAME_HEADER_SIZE;
		  this.state = 'frame-head';
		  this.pendingHeader = null;
		}
		util.inherits(Parser, base.Parser);

		parser.create = function create(options) {
		  return new Parser(options);
		};

		Parser.prototype.setMaxFrameSize = function setMaxFrameSize(size) {
		  // http2-only
		};

		Parser.prototype.setMaxHeaderListSize = function setMaxHeaderListSize(size) {
		  // http2-only
		};

		// Only for testing
		Parser.prototype.skipPreface = function skipPreface() {
		};

		Parser.prototype.execute = function execute(buffer, callback) {
		  if (this.state === 'frame-head')
		    return this.onFrameHead(buffer, callback);

		  assert(this.state === 'frame-body' && this.pendingHeader !== null);

		  var self = this;
		  var header = this.pendingHeader;
		  this.pendingHeader = null;

		  this.onFrameBody(header, buffer, function(err, frame) {
		    if (err)
		      return callback(err);

		    self.state = 'frame-head';
		    self.waiting = constants.FRAME_HEADER_SIZE;
		    self.partial = false;
		    callback(null, frame);
		  });
		};

		Parser.prototype.executePartial = function executePartial(buffer, callback) {
		  var header = this.pendingHeader;

		  if (this.window)
		    this.window.recv.update(-buffer.size);

		  // DATA frame
		  callback(null, {
		    type: 'DATA',
		    id: header.id,

		    // Partial DATA can't be FIN
		    fin: false,
		    data: buffer.take(buffer.size)
		  });
		};

		Parser.prototype.onFrameHead = function onFrameHead(buffer, callback) {
		  var header = {
		    control: (buffer.peekUInt8() & 0x80) === 0x80 ? true : false,
		    version: null,
		    type: null,
		    id: null,
		    flags: null,
		    length: null
		  };

		  if (header.control) {
		    header.version = buffer.readUInt16BE() & 0x7fff;
		    header.type = buffer.readUInt16BE();
		  } else {
		    header.id = buffer.readUInt32BE(0) & 0x7fffffff;
		  }
		  header.flags = buffer.readUInt8();
		  header.length = buffer.readUInt24BE();

		  if (this.version === null && header.control) {
		    // TODO(indutny): do ProtocolError here and in the rest of errors
		    if (header.version !== 2 && header.version !== 3)
		      return callback(new Error('Unsupported SPDY version: ' + header.version));
		    this.setVersion(header.version);
		  }

		  this.state = 'frame-body';
		  this.waiting = header.length;
		  this.pendingHeader = header;
		  this.partial = !header.control;

		  callback(null, null);
		};

		Parser.prototype.onFrameBody = function onFrameBody(header, buffer, callback) {
		  // Data frame
		  if (!header.control) {
		    // Count received bytes
		    if (this.window)
		      this.window.recv.update(-buffer.size);

		    // No support for compressed DATA
		    if ((header.flags & constants.flags.FLAG_COMPRESSED) !== 0)
		      return callback(new Error('DATA compression not supported'));

		    if (header.id === 0) {
		      return callback(this.error(constants.error.PROTOCOL_ERROR,
		                                 'Invalid stream id for DATA'));
		    }

		    return callback(null, {
		      type: 'DATA',
		      id: header.id,
		      fin: (header.flags & constants.flags.FLAG_FIN) !== 0,
		      data: buffer.take(buffer.size)
		    });
		  }

		  // SYN_STREAM or SYN_REPLY
		  if (header.type === 0x01 || header.type === 0x02)
		    this.onSynHeadFrame(header.type, header.flags, buffer, callback);
		  // RST_STREAM
		  else if (header.type === 0x03)
		    this.onRSTFrame(buffer, callback);
		  // SETTINGS
		  else if (header.type === 0x04)
		    this.onSettingsFrame(buffer, callback);
		  else if (header.type === 0x05)
		    callback(null, { type: 'NOOP' });
		  // PING
		  else if (header.type === 0x06)
		    this.onPingFrame(buffer, callback);
		  // GOAWAY
		  else if (header.type === 0x07)
		    this.onGoawayFrame(buffer, callback);
		  // HEADERS
		  else if (header.type === 0x08)
		    this.onHeaderFrames(buffer, callback);
		  // WINDOW_UPDATE
		  else if (header.type === 0x09)
		    this.onWindowUpdateFrame(buffer, callback);
		  // X-FORWARDED
		  else if (header.type === 0xf000)
		    this.onXForwardedFrame(buffer, callback);
		  else
		    callback(null, { type: 'unknown: ' + header.type });
		};

		Parser.prototype._filterHeader = function _filterHeader(headers, name) {
		  var res = {};
		  var keys = Object.keys(headers);

		  for (var i = 0; i < keys.length; i++) {
		    var key = keys[i];
		    if (key !== name)
		      res[key] = headers[key];
		  }

		  return res;
		};

		Parser.prototype.onSynHeadFrame = function onSynHeadFrame(type,
		                                                          flags,
		                                                          body,
		                                                          callback) {
		  var self = this;
		  var stream = type === 0x01;
		  var offset = stream ? 10 : this.version === 2 ? 6 : 4;

		  if (!body.has(offset))
		    return callback(new Error('SynHead OOB'));

		  var head = body.clone(offset);
		  body.skip(offset);
		  this.parseKVs(body, function(err, headers) {
		    if (err)
		      return callback(err);

		    if (stream &&
		        (!headers[':method'] || !headers[':path'])) {
		      return callback(new Error('Missing `:method` and/or `:path` header'));
		    }

		    var id = head.readUInt32BE() & 0x7fffffff;

		    if (id === 0) {
		      return callback(self.error(constants.error.PROTOCOL_ERROR,
		                                 'Invalid stream id for HEADERS'));
		    }

		    var associated = stream ? head.readUInt32BE() & 0x7fffffff : 0;
		    var priority = stream ? head.readUInt8() >> 5 :
		                            utils.weightToPriority(constants.DEFAULT_WEIGHT);
		    var fin = (flags & constants.flags.FLAG_FIN) !== 0;
		    var unidir = (flags & constants.flags.FLAG_UNIDIRECTIONAL) !== 0;
		    var path = headers[':path'];

		    var isPush = stream && associated !== 0;

		    var weight = utils.priorityToWeight(priority);
		    var priorityInfo = {
		      weight: weight,
		      exclusive: false,
		      parent: 0
		    };

		    if (!isPush) {
		      callback(null, {
		        type: 'HEADERS',
		        id: id,
		        priority: priorityInfo,
		        fin: fin,
		        writable: !unidir,
		        headers: headers,
		        path: path
		      });
		      return;
		    }

		    if (stream && !headers[':status'])
		      return callback(new Error('Missing `:status` header'));

		    var filteredHeaders = self._filterHeader(headers, ':status');

		    callback(null, [ {
		      type: 'PUSH_PROMISE',
		      id: associated,
		      fin: false,
		      promisedId: id,
		      headers: filteredHeaders,
		      path: path
		    }, {
		      type: 'HEADERS',
		      id: id,
		      fin: fin,
		      priority: priorityInfo,
		      writable: true,
		      path: undefined,
		      headers: {
		        ':status': headers[':status']
		      }
		    }]);
		  });
		};

		Parser.prototype.onHeaderFrames = function onHeaderFrames(body, callback) {
		  var offset = this.version === 2 ? 6 : 4;
		  if (!body.has(offset))
		    return callback(new Error('HEADERS OOB'));

		  var streamId = body.readUInt32BE() & 0x7fffffff;
		  if (this.version === 2)
		    body.skip(2);

		  this.parseKVs(body, function(err, headers) {
		    if (err)
		      return callback(err);

		    callback(null, {
		      type: 'HEADERS',
		      priority: {
		        parent: 0,
		        exclusive: false,
		        weight: constants.DEFAULT_WEIGHT
		      },
		      id: streamId,
		      fin: false,
		      writable: true,
		      path: undefined,
		      headers: headers
		    });
		  });
		};

		Parser.prototype.parseKVs = function parseKVs(buffer, callback) {
		  var self = this;

		  this.decompress.write(buffer.toChunks(), function(err, chunks) {
		    if (err)
		      return callback(err);

		    var buffer = new OffsetBuffer();
		    for (var i = 0; i < chunks.length; i++)
		      buffer.push(chunks[i]);

		    var size = self.version === 2 ? 2 : 4;
		    if (!buffer.has(size))
		      return callback(new Error('KV OOB'));

		    var count = self.version === 2 ? buffer.readUInt16BE() :
		                                     buffer.readUInt32BE();
		    var headers = {};

		    function readString() {
		      if (!buffer.has(size))
		        return null;
		      var len = self.version === 2 ? buffer.readUInt16BE() :
		                                     buffer.readUInt32BE();

		      if (!buffer.has(len))
		        return null;

		      var value = buffer.take(len);
		      return value.toString();
		    }

		    while (count > 0) {
		      var key = readString();
		      var value = readString();

		      if (key === null || value === null)
		        return callback(new Error('Headers OOB'));

		      if (self.version < 3) {
		        var isInternal = /^(method|version|url|host|scheme|status)$/.test(key);
		        if (key === 'url')
		          key = 'path';
		        if (isInternal)
		          key = ':' + key;
		      }

		      // Compatibility with HTTP2
		      if (key === ':status')
		        value = value.split(/ /g, 2)[0];

		      count--;
		      if (key === ':host')
		        key = ':authority';

		      // Skip version, not present in HTTP2
		      if (key === ':version')
		        continue;

		      value = value.split(/\0/g);
		      for (var i = 0; i < value.length; i++)
		        utils.addHeaderLine(key, value[i], headers);
		    }

		    callback(null, headers);
		  });
		};

		Parser.prototype.onRSTFrame = function onRSTFrame(body, callback) {
		  if (!body.has(8))
		    return callback(new Error('RST OOB'));

		  var frame = {
		    type: 'RST',
		    id: body.readUInt32BE() & 0x7fffffff,
		    code: constants.errorByCode[body.readUInt32BE()],
		  };

		  if (frame.id === 0) {
		    return callback(this.error(constants.error.PROTOCOL_ERROR,
		                               'Invalid stream id for RST'));
		  }

		  if (body.size !== 0)
		    frame.extra = body.take(body.size);
		  callback(null, frame);
		};

		Parser.prototype.onSettingsFrame = function onSettingsFrame(body, callback) {
		  if (!body.has(4))
		    return callback(new Error('SETTINGS OOB'));

		  var settings = {},
		      number = body.readUInt32BE(),
		      idMap = {
		        1: 'upload_bandwidth',
		        2: 'download_bandwidth',
		        3: 'round_trip_time',
		        4: 'max_concurrent_streams',
		        5: 'current_cwnd',
		        6: 'download_retrans_rate',
		        7: 'initial_window_size',
		        8: 'client_certificate_vector_size'
		      };

		  if (!body.has(number * 8))
		    return callback(new Error('SETTINGS OOB#2'));

		  for (var i = 0; i < number; i++) {
		    var id = this.version === 2 ? body.readUInt32LE() :
		                                   body.readUInt32BE();
		    var flags = (id >> 24) & 0xff;
		    id = id & 0xffffff;

		    // Skip persisted settings
		    if (flags & 0x2)
		      continue;

		    var name = idMap[id];

		    settings[name] = body.readUInt32BE();
		  }

		  callback(null, {
		    type: 'SETTINGS',
		    settings: settings
		  });
		};

		Parser.prototype.onPingFrame = function onPingFrame(body, callback) {
		  if (!body.has(4))
		    return callback(new Error('PING OOB'));

		  var isServer = this.isServer;
		  var opaque = body.clone(body.size).take(body.size);
		  var id = body.readUInt32BE();
		  var ack = isServer ? (id % 2 === 0) : (id % 2 === 1);

		  callback(null, { type: 'PING', opaque: opaque, ack: ack });
		};

		Parser.prototype.onGoawayFrame = function onGoawayFrame(body, callback) {
		  if (!body.has(8))
		    return callback(new Error('GOAWAY OOB'));

		  callback(null, {
		    type: 'GOAWAY',
		    lastId: body.readUInt32BE() & 0x7fffffff,
		    code: constants.goawayByCode[body.readUInt32BE()]
		  });
		};

		Parser.prototype.onWindowUpdateFrame = function onWindowUpdateFrame(body,
		                                                                    callback) {
		  if (!body.has(8))
		    return callback(new Error('WINDOW_UPDATE OOB'));

		  callback(null, {
		    type: 'WINDOW_UPDATE',
		    id: body.readUInt32BE() & 0x7fffffff,
		    delta: body.readInt32BE()
		  });
		};

		Parser.prototype.onXForwardedFrame = function onXForwardedFrame(body,
		                                                                callback) {
		  if (!body.has(4))
		    return callback(new Error('X_FORWARDED OOB'));

		  var len = body.readUInt32BE();
		  if (!body.has(len))
		    return callback(new Error('X_FORWARDED host length OOB'));

		  callback(null, {
		    type: 'X_FORWARDED_FOR',
		    host: body.take(len).toString()
		  });
		};


	/***/ },
	/* 763 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		'use strict';

		var zlibpool = exports;
		var zlib = __webpack_require__(377);

		var transport = __webpack_require__(24);

		// TODO(indutny): think about it, why has it always been Z_SYNC_FLUSH here.
		// It should be possible to manually flush stuff after the write instead
		function createDeflate(version, compression) {
		  var deflate = zlib.createDeflate({
		    dictionary: transport.protocol.spdy.dictionary[version],
		    flush: zlib.Z_SYNC_FLUSH,
		    windowBits: 11,
		    level: compression ? zlib.Z_DEFAULT_COMPRESSION : zlib.Z_NO_COMPRESSION
		  });

		  // For node.js v0.8
		  deflate._flush = zlib.Z_SYNC_FLUSH;

		  return deflate;
		}

		function createInflate(version) {
		  var inflate = zlib.createInflate({
		    dictionary: transport.protocol.spdy.dictionary[version],
		    flush: zlib.Z_SYNC_FLUSH,
		    windowBits: 0
		  });

		  // For node.js v0.8
		  inflate._flush = zlib.Z_SYNC_FLUSH;

		  return inflate;
		}

		function Pool(compression) {
		  this.compression = compression;
		  this.pool = {
		    2: [],
		    3: [],
		    3.1: []
		  };
		}

		zlibpool.create = function create(compression) {
		  return new Pool(compression);
		};

		Pool.prototype.get = function get(version) {
		  if (this.pool[version].length > 0) {
		    return this.pool[version].pop();
		  } else {
		    var id = version;

		    return {
		      version: version,
		      compress: createDeflate(id, this.compression),
		      decompress: createInflate(id)
		    };
		  }
		};

		Pool.prototype.put = function put(pair) {
		  this.pool[pair.version].push(pair);
		};


	/***/ },
	/* 764 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var transport = __webpack_require__(24);

		var assert = __webpack_require__(34);
		var util = __webpack_require__(11);
		var debug = {
		  client: __webpack_require__(17)('spdy:stream:client'),
		  server: __webpack_require__(17)('spdy:stream:server')
		};
		var Buffer = __webpack_require__(0).Buffer;
		var Duplex = __webpack_require__(178).Duplex;

		function Stream(connection, options) {
		  Duplex.call(this);

		  var connectionState = connection._spdyState;

		  var state = {};
		  this._spdyState = state;

		  this.id = options.id;
		  this.method = options.method;
		  this.path = options.path;
		  this.host = options.host;
		  this.headers = options.headers || {};
		  this.connection = connection;
		  this.parent = options.parent || null;

		  state.socket = null;
		  state.protocol = connectionState.protocol;
		  state.constants = state.protocol.constants;

		  // See _initPriority()
		  state.priority = null;

		  state.version = this.connection.getVersion();
		  state.isServer = this.connection.isServer();
		  state.debug = state.isServer ? debug.server : debug.client;

		  state.framer = connectionState.framer;
		  state.parser = connectionState.parser;

		  state.request = options.request;
		  state.needResponse = options.request;
		  state.window = connectionState.streamWindow.clone(options.id);
		  state.sessionWindow = connectionState.window;
		  state.maxChunk = connectionState.maxChunk;

		  // Can't send incoming request
		  // (See `.send()` method)
		  state.sent = !state.request;

		  state.readable = options.readable !== false;
		  state.writable = options.writable !== false;

		  state.aborted = false;

		  state.corked = 0;
		  state.corkQueue = [];

		  state.timeout = new transport.utils.Timeout(this);

		  this.on('finish', this._onFinish);
		  this.on('end', this._onEnd);

		  var self = this;
		  function _onWindowOverflow() {
		    self._onWindowOverflow();
		  }

		  state.window.recv.on('overflow', _onWindowOverflow);
		  state.window.send.on('overflow', _onWindowOverflow);

		  this._initPriority(options.priority);

		  if (!state.readable)
		    this.push(null);
		  if (!state.writable) {
		    this._writableState.ended = true;
		    this._writableState.finished = true;
		  }
		}
		util.inherits(Stream, Duplex);
		exports.Stream = Stream;

		Stream.prototype._init = function _init(socket) {
		  this.socket = socket;
		};

		Stream.prototype._initPriority = function _initPriority(priority) {
		  var state = this._spdyState;
		  var connectionState = this.connection._spdyState;
		  var root = connectionState.priorityRoot;

		  if (!priority) {
		    state.priority = root.addDefault(this.id);
		    return;
		  }

		  state.priority = root.add({
		    id: this.id,
		    parent: priority.parent,
		    weight: priority.weight,
		    exclusive: priority.exclusive
		  });
		};

		Stream.prototype._handleFrame = function _handleFrame(frame) {
		  var state = this._spdyState;

		  // Ignore any kind of data after abort
		  if (state.aborted) {
		    state.debug('id=%d ignoring frame=%s after abort', this.id, frame.type);
		    return;
		  }

		  // Restart the timer on incoming frames
		  state.timeout.reset();

		  if (frame.type === 'DATA')
		    this._handleData(frame);
		  else if (frame.type === 'HEADERS')
		    this._handleHeaders(frame);
		  else if (frame.type === 'RST')
		    this._handleRST(frame);
		  else if (frame.type === 'WINDOW_UPDATE')
		    this._handleWindowUpdate(frame);
		  else if (frame.type === 'PRIORITY')
		    this._handlePriority(frame);
		  else if (frame.type === 'PUSH_PROMISE')
		    this._handlePushPromise(frame);

		  if (frame.fin) {
		    state.debug('id=%d end', this.id);
		    this.push(null);
		  }
		};

		function checkAborted(stream, state, callback) {
		  if (state.aborted) {
		    state.debug('id=%d abort write', stream.id);
		    process.nextTick(function() {
		      callback(new Error('Stream write aborted'));
		    });
		    return true;
		  }

		  return false;
		}

		function _send(stream, state, data, callback) {
		  if (checkAborted(stream, state, callback))
		    return;

		  state.debug('id=%d presend=%d', stream.id, data.length);

		  state.timeout.reset();

		  state.window.send.update(-data.length, function() {
		    if (checkAborted(stream, state, callback))
		      return;

		    state.debug('id=%d send=%d', stream.id, data.length);

		    state.timeout.reset();

		    state.framer.dataFrame({
		      id: stream.id,
		      priority: state.priority.getPriority(),
		      fin: false,
		      data: data
		    }, function(err) {
		      state.debug('id=%d postsend=%d', stream.id, data.length);
		      callback(err);
		    });
		  });
		}

		Stream.prototype._write = function _write(data, enc, callback) {
		  var state = this._spdyState;

		  // Send the request if it wasn't sent
		  if (!state.sent)
		    this.send();

		  // Writes should come after pending control frames (response and headers)
		  if (state.corked !== 0) {
		    var self = this;
		    state.corkQueue.push(function() {
		      self._write(data, enc, callback);
		    });
		    return;
		  }

		  // Split DATA in chunks to prevent window from going negative
		  this._splitStart(data, _send, callback);
		};

		Stream.prototype._splitStart = function _splitStart(data, onChunk, callback) {
		  return this._split(data, 0, onChunk, callback);
		};

		Stream.prototype._split = function _split(data, offset, onChunk, callback) {
		  if (offset === data.length)
		    return process.nextTick(callback);

		  var state = this._spdyState;
		  var local = state.window.send;
		  var session = state.sessionWindow.send;

		  var availSession = Math.max(0, session.getCurrent());
		  if (availSession === 0)
		    availSession = session.getMax();
		  var availLocal = Math.max(0, local.getCurrent());
		  if (availLocal === 0)
		    availLocal = local.getMax();

		  var avail = Math.min(availSession, availLocal);
		  avail = Math.min(avail, state.maxChunk);

		  // Split data in chunks in a following way:
		  // 1. Try to fill `this.current` first
		  // 2. If it is empty - fill `this.max`
		  var limit = avail === 0 ? this.max : avail;
		  var size = Math.min(data.length - offset, limit);

		  var chunk = data.slice(offset, offset + size);

		  var self = this;
		  onChunk(this, state, chunk, function(err) {
		    if (err)
		      return callback(err);

		    // Get the next chunk
		    self._split(data, offset + size, onChunk, callback);
		  });
		};

		Stream.prototype._read = function _read() {
		  var state = this._spdyState;

		  if (!state.window.recv.isDraining())
		    return;

		  var delta = state.window.recv.getDelta();

		  state.debug('id=%d window emptying, update by %d', this.id, delta);

		  state.window.recv.update(delta);
		  state.framer.windowUpdateFrame({
		    id: this.id,
		    delta: delta
		  });
		};

		Stream.prototype._handleData = function _handleData(frame) {
		  var state = this._spdyState;

		  // DATA on ended or not readable stream!
		  if (!state.readable || this._readableState.ended) {
		    state.framer.rstFrame({ id: this.id, code: 'STREAM_CLOSED' });
		    return;
		  }

		  state.debug('id=%d recv=%d', this.id, frame.data.length);
		  state.window.recv.update(-frame.data.length);

		  this.push(frame.data);
		};

		Stream.prototype._handleRST = function _handleRST(frame) {
		  if (frame.code !== 'CANCEL')
		    this.emit('error', new Error('Got RST: ' + frame.code));
		  this.abort();
		};

		Stream.prototype._handleWindowUpdate = function _handleWindowUpdate(frame) {
		  var state = this._spdyState;

		  state.window.send.update(frame.delta);
		};

		Stream.prototype._onWindowOverflow = function _onWindowOverflow() {
		  var state = this._spdyState;

		  state.debug('id=%d window overflow', this.id);
		  state.framer.rstFrame({ id: this.id, code: 'FLOW_CONTROL_ERROR' });
		};

		Stream.prototype._handlePriority = function _handlePriority(frame) {
		  var state = this._spdyState;

		  state.priority.remove();
		  state.priority = null;
		  this._initPriority(frame.priority);

		  // Mostly for testing purposes
		  this.emit('priority', frame.priority);
		};

		Stream.prototype._handleHeaders = function _handleHeaders(frame) {
		  var state = this._spdyState;

		  if (!state.readable || this._readableState.ended) {
		    state.framer.rstFrame({ id: this.id, code: 'STREAM_CLOSED' });
		    return;
		  }

		  if (state.needResponse)
		    return this._handleResponse(frame);

		  this.emit('headers', frame.headers);
		};

		Stream.prototype._handleResponse = function _handleResponse(frame) {
		  var state = this._spdyState;

		  if (frame.headers[':status'] === undefined) {
		    state.framer.rstFrame({ id: this.id, code: 'PROTOCOL_ERROR' });
		    return;
		  }

		  state.needResponse = false;
		  this.emit('response', frame.headers[':status'] | 0, frame.headers);
		};

		Stream.prototype._onFinish = function _onFinish() {
		  var state = this._spdyState;

		  // Send the request if it wasn't sent
		  if (!state.sent) {
		    // NOTE: will send HEADERS with FIN flag
		    this.send();
		  } else {
		    // Just an `.end()` without any writes will trigger immediate `finish` event
		    // without any calls to `_write()`.
		    if (state.corked !== 0) {
		      var self = this;
		      state.corkQueue.push(function() {
		        self._onFinish();
		      });
		      return;
		    }

		    state.framer.dataFrame({
		      id: this.id,
		      priority: state.priority.getPriority(),
		      fin: true,
		      data: new Buffer(0)
		    });
		  }

		  this._maybeClose();
		};

		Stream.prototype._onEnd = function _onEnd() {
		  this._maybeClose();
		};

		Stream.prototype._checkEnded = function _checkEnded(callback) {
		  var state = this._spdyState;

		  var ended = false;
		  if (state.aborted)
		    ended = true;

		  if (!state.writable || this._writableState.finished)
		    ended = true;

		  if (!ended)
		    return true;

		  if (!callback)
		    return false;

		  var err = new Error('Ended stream can\'t send frames');
		  process.nextTick(function() {
		    callback(err);
		  });

		  return false;
		};

		Stream.prototype._maybeClose = function _maybeClose() {
		  var state = this._spdyState;

		  // .abort() emits `close`
		  if (state.aborted)
		    return;

		  if ((!state.readable || this._readableState.ended) &&
		      this._writableState.finished) {
		    // Clear timeout
		    state.timeout.set(0);

		    this.emit('close');
		  }
		};

		Stream.prototype._handlePushPromise = function _handlePushPromise(frame) {
		  var push = this.connection._createStream({
		    id: frame.promisedId,
		    parent: this,
		    push: true,
		    request: true,
		    method: frame.headers[':method'],
		    path: frame.headers[':path'],
		    host: frame.headers[':authority'],
		    priority: frame.priority,
		    headers: frame.headers,
		    writable: false
		  });

		  // GOAWAY
		  if (this.connection._isGoaway(push.id))
		    return;

		  if (!this.emit('pushPromise', push))
		    push.abort();
		};

		Stream.prototype._hardCork = function _hardCork() {
		  var state = this._spdyState;

		  this.cork();
		  state.corked++;
		};

		Stream.prototype._hardUncork = function _hardUncork() {
		  var state = this._spdyState;

		  this.uncork();
		  state.corked--;
		  if (state.corked !== 0)
		    return;

		  // Invoke callbacks
		  var queue = state.corkQueue;
		  state.corkQueue = [];
		  for (var i = 0; i < queue.length; i++)
		    queue[i]();
		};

		Stream.prototype._sendPush = function _sendPush(status, response, callback) {
		  var self = this;
		  var state = this._spdyState;

		  this._hardCork();
		  state.framer.pushFrame({
		    id: this.parent.id,
		    promisedId: this.id,
		    priority: state.priority.toJSON(),
		    path: this.path,
		    host: this.host,
		    method: this.method,
		    status: status,
		    headers: this.headers,
		    response: response
		  }, function(err) {
		    self._hardUncork();

		    callback(err);
		  });
		};

		Stream.prototype._wasSent = function _wasSent() {
		  var state = this._spdyState;
		  return state.sent;
		};

		// Public API

		Stream.prototype.send = function send(callback) {
		  var state = this._spdyState;

		  if (state.sent) {
		    var err = new Error('Stream was already sent');
		    process.nextTick(function() {
		      if (callback)
		        callback(err);
		    });
		    return;
		  }

		  state.sent = true;
		  state.timeout.reset();

		  // GET requests should always be auto-finished
		  if (this.method === 'GET') {
		    this._writableState.ended = true;
		    this._writableState.finished = true;
		  }

		  // TODO(indunty): ideally it should just take a stream object as an input
		  var self = this;
		  this._hardCork();
		  state.framer.requestFrame({
		    id: this.id,
		    method: this.method,
		    path: this.path,
		    host: this.host,
		    priority: state.priority.toJSON(),
		    headers: this.headers,
		    fin: this._writableState.finished
		  }, function(err) {
		    self._hardUncork();

		    if (!callback)
		      return;

		    callback(err);
		  });
		};

		Stream.prototype.respond = function respond(status, headers, callback) {
		  var self = this;
		  var state = this._spdyState;
		  assert(!state.request, 'Can\'t respond on request');

		  state.timeout.reset();

		  if (!this._checkEnded(callback))
		    return;

		  var frame = {
		    id: this.id,
		    status: status,
		    headers: headers
		  };
		  this._hardCork();
		  state.framer.responseFrame(frame, function(err) {
		    self._hardUncork();
		    if (callback)
		      callback(err);
		  });
		};

		Stream.prototype.setWindow = function setWindow(size) {
		  var state = this._spdyState;

		  state.timeout.reset();

		  if (!this._checkEnded())
		    return;

		  state.debug('id=%d force window max=%d', this.id, size);
		  state.window.recv.setMax(size);

		  var delta = state.window.recv.getDelta();
		  state.framer.windowUpdateFrame({
		    id: this.id,
		    delta: delta
		  });
		  state.window.recv.update(delta);
		};

		Stream.prototype.sendHeaders = function sendHeaders(headers, callback) {
		  var self = this;
		  var state = this._spdyState;

		  state.timeout.reset();

		  if (!this._checkEnded(callback))
		    return;

		  // Request wasn't yet send, coalesce headers
		  if (!state.sent) {
		    this.headers = util._extend({}, this.headers);
		    util._extend(this.headers, headers);
		    process.nextTick(function() {
		      if (callback)
		        callback(null);
		    });
		    return;
		  }

		  this._hardCork();
		  state.framer.headersFrame({
		    id: this.id,
		    headers: headers
		  }, function(err) {
		    self._hardUncork();
		    if (callback)
		      callback(err);
		  });
		};

		Stream.prototype.destroy = function destroy() {
		  this.abort();
		};

		Stream.prototype.abort = function abort(code, callback) {
		  var state = this._spdyState;

		  // .abort(callback)
		  if (typeof code === 'function') {
		    callback = code;
		    code = null;
		  }

		  if (this._readableState.ended && this._writableState.finished) {
		    state.debug('id=%d already closed', this.id);
		    if (callback)
		      process.nextTick(callback);
		    return;
		  }

		  if (state.aborted) {
		    state.debug('id=%d already aborted', this.id);
		    if (callback)
		      process.nextTick(callback);
		    return;
		  }

		  state.aborted = true;
		  state.debug('id=%d abort', this.id);

		  this.setTimeout(0);

		  var abortCode = code || 'CANCEL';

		  state.framer.rstFrame({
		    id: this.id,
		    code: abortCode
		  });

		  var self = this;
		  process.nextTick(function() {
		    if (callback)
		      callback(null);
		    self.emit('close', new Error('Aborted, code: ' + abortCode));
		  });
		};

		Stream.prototype.setPriority = function setPriority(info) {
		  var state = this._spdyState;

		  state.timeout.reset();

		  if (!this._checkEnded())
		    return;

		  state.debug('id=%d priority change', this.id, info);

		  var frame = { id: this.id, priority: info };

		  // Change priority on this side
		  this._handlePriority(frame);

		  // And on the other too
		  state.framer.priorityFrame(frame);
		};

		Stream.prototype.pushPromise = function pushPromise(uri, callback) {
		  if (!this._checkEnded(callback))
		    return;

		  var self = this;
		  this._hardCork();
		  var push = this.connection.pushPromise(this, uri, function(err) {
		    self._hardUncork();
		    if (!err)
		      push._hardUncork();

		    if (callback)
		      return callback(err, push);

		    if (err)
		      push.emit('error', err);
		  });
		  push._hardCork();

		  return push;
		};

		Stream.prototype.setMaxChunk = function setMaxChunk(size) {
		  var state = this._spdyState;
		  state.maxChunk = size;
		};

		Stream.prototype.setTimeout = function setTimeout(delay, callback) {
		  var state = this._spdyState;

		  state.timeout.set(delay, callback);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 765 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var util = __webpack_require__(11);

		function QueueItem() {
		  this.prev = null;
		  this.next = null;
		}
		exports.QueueItem = QueueItem;

		function Queue() {
		  QueueItem.call(this);

		  this.prev = this;
		  this.next = this;
		}
		util.inherits(Queue, QueueItem);
		exports.Queue = Queue;

		Queue.prototype.insertTail = function insertTail(item) {
		  item.prev = this.prev;
		  item.next = this;
		  item.prev.next = item;
		  item.next.prev = item;
		};

		Queue.prototype.remove = function remove(item) {
		  var next = item.next;
		  var prev = item.prev;

		  item.next = item;
		  item.prev = item;
		  next.prev = prev;
		  prev.next = next;
		};

		Queue.prototype.head = function head() {
		  return this.next;
		};

		Queue.prototype.tail = function tail() {
		  return this.prev;
		};

		Queue.prototype.isEmpty = function isEmpty() {
		  return this.next === this;
		};

		Queue.prototype.isRoot = function isRoot(item) {
		  return this === item;
		};

		function LockStream(stream) {
		  this.locked = false;
		  this.queue = [];
		  this.stream = stream;
		}
		exports.LockStream = LockStream;

		LockStream.prototype.write = function write(chunks, callback) {
		  var self = this;

		  // Do not let it interleave
		  if (this.locked) {
		    this.queue.push(function() {
		      return self.write(chunks, callback);
		    });
		    return;
		  }

		  this.locked = true;

		  function done(err, chunks) {
		    self.stream.removeListener('error', done);

		    self.locked = false;
		    if (self.queue.length > 0)
		      self.queue.shift()();
		    callback(err, chunks);
		  }

		  this.stream.on('error', done);

		  // Accumulate all output data
		  var output = [];
		  function onData(chunk) {
		    output.push(chunk);
		  }
		  this.stream.on('data', onData);

		  function next(err) {
		    self.stream.removeListener('data', onData);
		    if (err)
		      return done(err);

		    done(null, output);
		  }

		  for (var i = 0; i < chunks.length - 1; i++)
		    this.stream.write(chunks[i]);

		  if (chunks.length > 0)
		    this.stream.write(chunks[i], next);
		  else
		    process.nextTick(next);

		  if (this.stream.execute) {
		    this.stream.execute(function(err) {
		      if (err)
		        return done(err);
		    });
		  }
		};

		// Just finds the place in array to insert
		function binaryLookup(list, item, compare) {
		  var start = 0;
		  var end = list.length;

		  while (start < end) {
		    var pos = (start + end) >> 1;
		    var cmp = compare(item, list[pos]);

		    if (cmp === 0) {
		      start = pos;
		      end = pos;
		      break;
		    } else if (cmp < 0) {
		      end = pos;
		    } else {
		      start = pos + 1;
		    }
		  }

		  return start;
		}
		exports.binaryLookup = binaryLookup;

		function binaryInsert(list, item, compare) {
		  var index = binaryLookup(list, item, compare);

		  list.splice(index, 0, item);
		}
		exports.binaryInsert = binaryInsert;

		function binarySearch(list, item, compare) {
		  var index = binaryLookup(list, item, compare);

		  if (index >= list.length)
		    return -1;

		  if (compare(item, list[index]) === 0)
		    return index;

		  return -1;
		}
		exports.binarySearch = binarySearch;

		function Timeout(object) {
		  this.delay = 0;
		  this.timer = null;
		  this.object = object;
		}
		exports.Timeout = Timeout;

		Timeout.prototype.set = function set(delay, callback) {
		  this.delay = delay;
		  this.reset();
		  if (!callback)
		    return;

		  if (this.delay === 0)
		    this.object.removeListener('timeout', callback);
		  else
		    this.object.once('timeout', callback);
		};

		Timeout.prototype.reset = function reset() {
		  if (this.timer !== null) {
		    clearTimeout(this.timer);
		    this.timer = null;
		  }

		  if (this.delay === 0)
		    return;

		  var self = this;
		  this.timer = setTimeout(function() {
		    self.timer = null;
		    self.object.emit('timeout');
		  }, this.delay);
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 766 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		var util = __webpack_require__(11);
		var EventEmitter = __webpack_require__(7).EventEmitter;
		var debug = {
		  server: __webpack_require__(17)('spdy:window:server'),
		  client: __webpack_require__(17)('spdy:window:client')
		};

		function Side(window, name, options) {
		  EventEmitter.call(this);

		  this.name = name;
		  this.window = window;
		  this.current = options.size;
		  this.max = options.size;
		  this.limit = options.max;
		  this.lowWaterMark = options.lowWaterMark === undefined ?
		      this.max / 2 :
		      options.lowWaterMark;

		  this._refilling = false;
		  this._refillQueue = [];
		}
		util.inherits(Side, EventEmitter);

		Side.prototype.setMax = function setMax(max) {
		  this.window.debug('id=%d side=%s setMax=%d',
		                    this.window.id,
		                    this.name,
		                    max);
		  this.max = max;
		  this.lowWaterMark = this.max / 2;
		};

		Side.prototype.updateMax = function updateMax(max) {
		  var delta = max - this.max;
		  this.window.debug('id=%d side=%s updateMax=%d delta=%d',
		                    this.window.id,
		                    this.name,
		                    max,
		                    delta);

		  this.max = max;
		  this.lowWaterMark = max / 2;

		  this.update(delta);
		};

		Side.prototype.setLowWaterMark = function setLowWaterMark(lwm) {
		  this.lowWaterMark = lwm;
		};

		Side.prototype.update = function update(size, callback) {
		  // Not enough space for the update, wait for refill
		  if (size < 0 && callback && this.isEmpty()) {
		    this.window.debug('id=%d side=%s wait for refill=%d [%d/%d]',
		                      this.window.id,
		                      this.name,
		                      -size,
		                      this.current,
		                      this.max);
		    this._refillQueue.push({
		      size: size,
		      callback: callback
		    });
		    return;
		  }

		  this.current += size;

		  if (this.current > this.limit) {
		    this.emit('overflow');
		    return;
		  }

		  this.window.debug('id=%d side=%s update by=%d [%d/%d]',
		                    this.window.id,
		                    this.name,
		                    size,
		                    this.current,
		                    this.max);

		  // Time to send WINDOW_UPDATE
		  if (size < 0 && this.isDraining()) {
		    this.window.debug('id=%d side=%s drained', this.window.id, this.name);
		    this.emit('drain');
		  }

		  // Time to write
		  if (size > 0 && this.current > 0 && this.current <= size) {
		    this.window.debug('id=%d side=%s full', this.window.id, this.name);
		    this.emit('full');
		  }

		  this._processRefillQueue();

		  if (callback)
		    process.nextTick(callback);
		};

		Side.prototype.getCurrent = function getCurrent() {
		  return this.current;
		};

		Side.prototype.getMax = function getMax() {
		  return this.max;
		};

		Side.prototype.getDelta = function getDelta() {
		  return this.max - this.current;
		};

		Side.prototype.isDraining = function isDraining() {
		  return this.current <= this.lowWaterMark;
		};

		Side.prototype.isEmpty = function isEmpty() {
		  return this.current <= 0;
		};

		// Private

		Side.prototype._processRefillQueue = function _processRefillQueue() {
		  // Prevent recursion
		  if (this._refilling)
		    return;
		  this._refilling = true;

		  while (this._refillQueue.length > 0) {
		    var item = this._refillQueue[0];

		    if (this.isEmpty())
		      break;

		    this.window.debug('id=%d side=%s refilled for size=%d',
		                      this.window.id,
		                      this.name,
		                      -item.size);

		    this._refillQueue.shift();
		    this.update(item.size, item.callback);
		  }

		  this._refilling = false;
		};

		function Window(options) {
		  this.id = options.id;
		  this.isServer = options.isServer;
		  this.debug = this.isServer ? debug.server : debug.client;

		  this.recv = new Side(this, 'recv', options.recv);
		  this.send = new Side(this, 'send', options.send);
		}
		module.exports = Window;

		Window.prototype.clone = function clone(id) {
		  return new Window({
		    id: id,
		    isServer: this.isServer,
		    recv: {
		      size: this.recv.max,
		      max: this.recv.limit,
		      lowWaterMark: this.recv.lowWaterMark
		    },
		    send: {
		      size: this.send.max,
		      max: this.send.limit,
		      lowWaterMark: this.send.lowWaterMark
		    }
		  });
		};

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 767 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(285);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		};

	/***/ },
	/* 768 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(63)


	/***/ },
	/* 769 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(288)


	/***/ },
	/* 770 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Stream = (function (){
		  try {
		    return __webpack_require__(5); // hack to fix a circular dependency issue when used with browserify
		  } catch(_){}
		}());
		exports = module.exports = __webpack_require__(289);
		exports.Stream = Stream || exports;
		exports.Readable = exports;
		exports.Writable = __webpack_require__(180);
		exports.Duplex = __webpack_require__(63);
		exports.Transform = __webpack_require__(179);
		exports.PassThrough = __webpack_require__(288);

		if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {
		  module.exports = Stream;
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 771 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(179)


	/***/ },
	/* 772 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(180)


	/***/ },
	/* 773 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* WEBPACK VAR INJECTION */(function(process) {'use strict';

		module.exports = Readable;

		/*<replacement>*/
		var processNextTick = __webpack_require__(10);
		/*</replacement>*/

		/*<replacement>*/
		var isArray = __webpack_require__(43);
		/*</replacement>*/

		/*<replacement>*/
		var Buffer = __webpack_require__(0).Buffer;
		/*</replacement>*/

		Readable.ReadableState = ReadableState;

		var EE = __webpack_require__(7);

		/*<replacement>*/
		var EElistenerCount = function (emitter, type) {
		  return emitter.listeners(type).length;
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).Buffer;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var debugUtil = __webpack_require__(795);
		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__(92);

		  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__(14).StringDecoder;
		    this.decoder = new StringDecoder(options.encoding);
		    this.encoding = options.encoding;
		  }
		}

		var Duplex;
		function Readable(options) {
		  Duplex = Duplex || __webpack_require__(92);

		  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__(14).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__(3)))

	/***/ },
	/* 774 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		// 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__(92);

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</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);
		}

	/***/ },
	/* 775 */
	/***/ function(module, exports, __webpack_require__) {

		"use strict";
		/* 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__(10);
		/*</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__(0).Buffer;
		/*</replacement>*/

		Writable.WritableState = WritableState;

		/*<replacement>*/
		var util = __webpack_require__(4);
		util.inherits = __webpack_require__(2);
		/*</replacement>*/

		/*<replacement>*/
		var internalUtil = {
		  deprecate: __webpack_require__(47)
		};
		/*</replacement>*/

		/*<replacement>*/
		var Stream;
		(function () {
		  try {
		    Stream = __webpack_require__(5);
		  } catch (_) {} finally {
		    if (!Stream) Stream = __webpack_require__(7).EventEmitter;
		  }
		})();
		/*</replacement>*/

		var Buffer = __webpack_require__(0).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__(92);

		  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__(92);

		  // 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__(3), __webpack_require__(21).setImmediate))

	/***/ },
	/* 776 */
	/***/ function(module, exports, __webpack_require__) {

		module.exports = __webpack_require__(774)


	/***/ },
	/* 777 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(process) {var Transform = __webpack_require__(776)
		  , inherits  = __webpack_require__(11).inherits
		  , xtend     = __webpack_require__(291)

		function DestroyableTransform(opts) {
		  Transform.call(this, opts)
		  this._destroyed = false
		}

		inherits(DestroyableTransform, Transform)

		DestroyableTransform.prototype.destroy = function(err) {
		  if (this._destroyed) return
		  this._destroyed = true
		  
		  var self = this
		  process.nextTick(function() {
		    if (err)
		      self.emit('error', err)
		    self.emit('close')
		  })
		}

		// a noop _transform function
		function noop (chunk, enc, callback) {
		  callback(null, chunk)
		}


		// create a new export function, used by both the main export and
		// the .ctor export, contains common logic for dealing with arguments
		function through2 (construct) {
		  return function (options, transform, flush) {
		    if (typeof options == 'function') {
		      flush     = transform
		      transform = options
		      options   = {}
		    }

		    if (typeof transform != 'function')
		      transform = noop

		    if (typeof flush != 'function')
		      flush = null

		    return construct(options, transform, flush)
		  }
		}


		// main export, just make me a transform stream!
		module.exports = through2(function (options, transform, flush) {
		  var t2 = new DestroyableTransform(options)

		  t2._transform = transform

		  if (flush)
		    t2._flush = flush

		  return t2
		})


		// make me a reusable prototype that I can `new`, or implicitly `new`
		// with a constructor call
		module.exports.ctor = through2(function (options, transform, flush) {
		  function Through2 (override) {
		    if (!(this instanceof Through2))
		      return new Through2(override)

		    this.options = xtend(options, override)

		    DestroyableTransform.call(this, this.options)
		  }

		  inherits(Through2, DestroyableTransform)

		  Through2.prototype._transform = transform

		  if (flush)
		    Through2.prototype._flush = flush

		  return Through2
		})


		module.exports.obj = through2(function (options, transform, flush) {
		  var t2 = new DestroyableTransform(xtend({ objectMode: true, highWaterMark: 16 }, options))

		  t2._transform = transform

		  if (flush)
		    t2._flush = flush

		  return t2
		})

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(3)))

	/***/ },
	/* 778 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(Buffer) {/**
		 * Convert a typed array to a Buffer without a copy
		 *
		 * Author:   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
		 * License:  MIT
		 *
		 * `npm install typedarray-to-buffer`
		 */

		var isTypedArray = __webpack_require__(649).strict

		module.exports = function typedarrayToBuffer (arr) {
		  if (isTypedArray(arr)) {
		    // To avoid a copy, use the typed array's underlying ArrayBuffer to back new Buffer
		    var buf = new Buffer(arr.buffer)
		    if (arr.byteLength !== arr.buffer.byteLength) {
		      // Respect the "view", i.e. byteOffset and byteLength, without doing a copy
		      buf = buf.slice(arr.byteOffset, arr.byteOffset + arr.byteLength)
		    }
		    return buf
		  } else {
		    // Pass through all other types to the `Buffer` constructor
		    return new Buffer(arr)
		  }
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))

	/***/ },
	/* 779 */
	/***/ 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';
		}

	/***/ },
	/* 780 */
	/***/ function(module, exports) {

		module.exports = read

		var MSB = 0x80
		  , REST = 0x7F

		function read(buf, offset) {
		  var res    = 0
		    , offset = offset || 0
		    , shift  = 0
		    , counter = offset
		    , b
		    , l = buf.length
		  
		  do {
		    if(counter >= l) {
		      read.bytesRead = 0
		      return undefined
		    }
		    b = buf[counter++]
		    res += shift < 28
		      ? (b & REST) << shift
		      : (b & REST) * Math.pow(2, shift)
		    shift += 7
		  } while (b >= MSB)
		  
		  read.bytes = counter - offset
		  
		  return res
		}


	/***/ },
	/* 781 */
	/***/ function(module, exports) {

		module.exports = encode

		var MSB = 0x80
		  , REST = 0x7F
		  , MSBALL = ~REST
		  , INT = Math.pow(2, 31)

		function encode(num, out, offset) {
		  out = out || []
		  offset = offset || 0
		  var oldOffset = offset

		  while(num >= INT) {
		    out[offset++] = (num & 0xFF) | MSB
		    num /= 128
		  }
		  while(num & MSBALL) {
		    out[offset++] = (num & 0xFF) | MSB
		    num >>>= 7
		  }
		  out[offset] = num | 0
		  
		  encode.bytes = offset - oldOffset + 1
		  
		  return out
		}


	/***/ },
	/* 782 */
	/***/ function(module, exports) {

		
		var N1 = Math.pow(2,  7)
		var N2 = Math.pow(2, 14)
		var N3 = Math.pow(2, 21)
		var N4 = Math.pow(2, 28)
		var N5 = Math.pow(2, 35)
		var N6 = Math.pow(2, 42)
		var N7 = Math.pow(2, 49)
		var N8 = Math.pow(2, 56)
		var N9 = Math.pow(2, 63)

		module.exports = function (value) {
		  return (
		    value < N1 ? 1
		  : value < N2 ? 2
		  : value < N3 ? 3
		  : value < N4 ? 4
		  : value < N5 ? 5
		  : value < N6 ? 6
		  : value < N7 ? 7
		  : value < N8 ? 8
		  : value < N9 ? 9
		  :              10
		  )
		}


	/***/ },
	/* 783 */
	/***/ function(module, exports, __webpack_require__) {

		var indexOf = __webpack_require__(645);

		var Object_keys = function (obj) {
		    if (Object.keys) return Object.keys(obj)
		    else {
		        var res = [];
		        for (var key in obj) res.push(key)
		        return res;
		    }
		};

		var forEach = function (xs, fn) {
		    if (xs.forEach) return xs.forEach(fn)
		    else for (var i = 0; i < xs.length; i++) {
		        fn(xs[i], i, xs);
		    }
		};

		var defineProp = (function() {
		    try {
		        Object.defineProperty({}, '_', {});
		        return function(obj, name, value) {
		            Object.defineProperty(obj, name, {
		                writable: true,
		                enumerable: false,
		                configurable: true,
		                value: value
		            })
		        };
		    } catch(e) {
		        return function(obj, name, value) {
		            obj[name] = value;
		        };
		    }
		}());

		var globals = ['Array', 'Boolean', 'Date', 'Error', 'EvalError', 'Function',
		'Infinity', 'JSON', 'Math', 'NaN', 'Number', 'Object', 'RangeError',
		'ReferenceError', 'RegExp', 'String', 'SyntaxError', 'TypeError', 'URIError',
		'decodeURI', 'decodeURIComponent', 'encodeURI', 'encodeURIComponent', 'escape',
		'eval', 'isFinite', 'isNaN', 'parseFloat', 'parseInt', 'undefined', 'unescape'];

		function Context() {}
		Context.prototype = {};

		var Script = exports.Script = function NodeScript (code) {
		    if (!(this instanceof Script)) return new Script(code);
		    this.code = code;
		};

		Script.prototype.runInContext = function (context) {
		    if (!(context instanceof Context)) {
		        throw new TypeError("needs a 'context' argument.");
		    }
		    
		    var iframe = document.createElement('iframe');
		    if (!iframe.style) iframe.style = {};
		    iframe.style.display = 'none';
		    
		    document.body.appendChild(iframe);
		    
		    var win = iframe.contentWindow;
		    var wEval = win.eval, wExecScript = win.execScript;

		    if (!wEval && wExecScript) {
		        // win.eval() magically appears when this is called in IE:
		        wExecScript.call(win, 'null');
		        wEval = win.eval;
		    }
		    
		    forEach(Object_keys(context), function (key) {
		        win[key] = context[key];
		    });
		    forEach(globals, function (key) {
		        if (context[key]) {
		            win[key] = context[key];
		        }
		    });
		    
		    var winKeys = Object_keys(win);

		    var res = wEval.call(win, this.code);
		    
		    forEach(Object_keys(win), function (key) {
		        // Avoid copying circular objects like `top` and `window` by only
		        // updating existing context properties or new properties in the `win`
		        // that was only introduced after the eval.
		        if (key in context || indexOf(winKeys, key) === -1) {
		            context[key] = win[key];
		        }
		    });

		    forEach(globals, function (key) {
		        if (!(key in context)) {
		            defineProp(context, key, win[key]);
		        }
		    });
		    
		    document.body.removeChild(iframe);
		    
		    return res;
		};

		Script.prototype.runInThisContext = function () {
		    return eval(this.code); // maybe...
		};

		Script.prototype.runInNewContext = function (context) {
		    var ctx = Script.createContext(context);
		    var res = this.runInContext(ctx);

		    forEach(Object_keys(ctx), function (key) {
		        context[key] = ctx[key];
		    });

		    return res;
		};

		forEach(Object_keys(Script.prototype), function (name) {
		    exports[name] = Script[name] = function (code) {
		        var s = Script(code);
		        return s[name].apply(s, [].slice.call(arguments, 1));
		    };
		});

		exports.createScript = function (code) {
		    return exports.Script(code);
		};

		exports.createContext = Script.createContext = function (context) {
		    var copy = new Context();
		    if(typeof context === 'object') {
		        forEach(Object_keys(context), function (key) {
		            copy[key] = context[key];
		        });
		    }
		    return copy;
		};


	/***/ },
	/* 784 */
	/***/ function(module, exports, __webpack_require__) {

		/* WEBPACK VAR INJECTION */(function(global) {var isNode = !global.window

		if (isNode) {
		  module.exports = __webpack_require__(796)
		} else {
		  module.exports = __webpack_require__(238)
		}

		/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(18)))

	/***/ },
	/* 785 */
	/***/ function(module, exports) {

		module.exports = {};

	/***/ },
	/* 786 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 787 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 788 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 789 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 790 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 791 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 792 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 793 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 794 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 795 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 796 */
	/***/ function(module, exports) {

		/* (ignored) */

	/***/ },
	/* 797 */
	/***/ function(module, exports, __webpack_require__) {

		__webpack_require__(294);
		module.exports = __webpack_require__(293);


	/***/ }
	/******/ ]);

	/*** EXPORTS FROM exports-loader ***/
	module.exports = Ipfs;

/***/ },
/* 86 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = { "default": __webpack_require__(90), __esModule: true };

/***/ },
/* 87 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = { "default": __webpack_require__(91), __esModule: true };

/***/ },
/* 88 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(process, global, setImmediate) {/* @preserve
	 * The MIT License (MIT)
	 * 
	 * Copyright (c) 2013-2015 Petka Antonov
	 * 
	 * 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.
	 * 
	 */
	/**
	 * bluebird build version 3.3.5
	 * Features enabled: core, race, call_get, generators, map, nodeify, promisify, props, reduce, settle, some, using, timers, filter, any, each
	*/
	!function(e){if(true)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.Promise=e()}}(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof _dereq_=="function"&&_dereq_;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof _dereq_=="function"&&_dereq_;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise) {
	var SomePromiseArray = Promise._SomePromiseArray;
	function any(promises) {
	    var ret = new SomePromiseArray(promises);
	    var promise = ret.promise();
	    ret.setHowMany(1);
	    ret.setUnwrap();
	    ret.init();
	    return promise;
	}

	Promise.any = function (promises) {
	    return any(promises);
	};

	Promise.prototype.any = function () {
	    return any(this);
	};

	};

	},{}],2:[function(_dereq_,module,exports){
	"use strict";
	var firstLineError;
	try {throw new Error(); } catch (e) {firstLineError = e;}
	var schedule = _dereq_("./schedule");
	var Queue = _dereq_("./queue");
	var util = _dereq_("./util");

	function Async() {
	    this._customScheduler = false;
	    this._isTickUsed = false;
	    this._lateQueue = new Queue(16);
	    this._normalQueue = new Queue(16);
	    this._haveDrainedQueues = false;
	    this._trampolineEnabled = true;
	    var self = this;
	    this.drainQueues = function () {
	        self._drainQueues();
	    };
	    this._schedule = schedule;
	}

	Async.prototype.setScheduler = function(fn) {
	    var prev = this._schedule;
	    this._schedule = fn;
	    this._customScheduler = true;
	    return prev;
	};

	Async.prototype.hasCustomScheduler = function() {
	    return this._customScheduler;
	};

	Async.prototype.enableTrampoline = function() {
	    this._trampolineEnabled = true;
	};

	Async.prototype.disableTrampolineIfNecessary = function() {
	    if (util.hasDevTools) {
	        this._trampolineEnabled = false;
	    }
	};

	Async.prototype.haveItemsQueued = function () {
	    return this._isTickUsed || this._haveDrainedQueues;
	};


	Async.prototype.fatalError = function(e, isNode) {
	    if (isNode) {
	        process.stderr.write("Fatal " + (e instanceof Error ? e.stack : e) +
	            "\n");
	        process.exit(2);
	    } else {
	        this.throwLater(e);
	    }
	};

	Async.prototype.throwLater = function(fn, arg) {
	    if (arguments.length === 1) {
	        arg = fn;
	        fn = function () { throw arg; };
	    }
	    if (typeof setTimeout !== "undefined") {
	        setTimeout(function() {
	            fn(arg);
	        }, 0);
	    } else try {
	        this._schedule(function() {
	            fn(arg);
	        });
	    } catch (e) {
	        throw new Error("No async scheduler available\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	};

	function AsyncInvokeLater(fn, receiver, arg) {
	    this._lateQueue.push(fn, receiver, arg);
	    this._queueTick();
	}

	function AsyncInvoke(fn, receiver, arg) {
	    this._normalQueue.push(fn, receiver, arg);
	    this._queueTick();
	}

	function AsyncSettlePromises(promise) {
	    this._normalQueue._pushOne(promise);
	    this._queueTick();
	}

	if (!util.hasDevTools) {
	    Async.prototype.invokeLater = AsyncInvokeLater;
	    Async.prototype.invoke = AsyncInvoke;
	    Async.prototype.settlePromises = AsyncSettlePromises;
	} else {
	    Async.prototype.invokeLater = function (fn, receiver, arg) {
	        if (this._trampolineEnabled) {
	            AsyncInvokeLater.call(this, fn, receiver, arg);
	        } else {
	            this._schedule(function() {
	                setTimeout(function() {
	                    fn.call(receiver, arg);
	                }, 100);
	            });
	        }
	    };

	    Async.prototype.invoke = function (fn, receiver, arg) {
	        if (this._trampolineEnabled) {
	            AsyncInvoke.call(this, fn, receiver, arg);
	        } else {
	            this._schedule(function() {
	                fn.call(receiver, arg);
	            });
	        }
	    };

	    Async.prototype.settlePromises = function(promise) {
	        if (this._trampolineEnabled) {
	            AsyncSettlePromises.call(this, promise);
	        } else {
	            this._schedule(function() {
	                promise._settlePromises();
	            });
	        }
	    };
	}

	Async.prototype.invokeFirst = function (fn, receiver, arg) {
	    this._normalQueue.unshift(fn, receiver, arg);
	    this._queueTick();
	};

	Async.prototype._drainQueue = function(queue) {
	    while (queue.length() > 0) {
	        var fn = queue.shift();
	        if (typeof fn !== "function") {
	            fn._settlePromises();
	            continue;
	        }
	        var receiver = queue.shift();
	        var arg = queue.shift();
	        fn.call(receiver, arg);
	    }
	};

	Async.prototype._drainQueues = function () {
	    this._drainQueue(this._normalQueue);
	    this._reset();
	    this._haveDrainedQueues = true;
	    this._drainQueue(this._lateQueue);
	};

	Async.prototype._queueTick = function () {
	    if (!this._isTickUsed) {
	        this._isTickUsed = true;
	        this._schedule(this.drainQueues);
	    }
	};

	Async.prototype._reset = function () {
	    this._isTickUsed = false;
	};

	module.exports = Async;
	module.exports.firstLineError = firstLineError;

	},{"./queue":26,"./schedule":29,"./util":36}],3:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL, tryConvertToPromise, debug) {
	var calledBind = false;
	var rejectThis = function(_, e) {
	    this._reject(e);
	};

	var targetRejected = function(e, context) {
	    context.promiseRejectionQueued = true;
	    context.bindingPromise._then(rejectThis, rejectThis, null, this, e);
	};

	var bindingResolved = function(thisArg, context) {
	    if (((this._bitField & 50397184) === 0)) {
	        this._resolveCallback(context.target);
	    }
	};

	var bindingRejected = function(e, context) {
	    if (!context.promiseRejectionQueued) this._reject(e);
	};

	Promise.prototype.bind = function (thisArg) {
	    if (!calledBind) {
	        calledBind = true;
	        Promise.prototype._propagateFrom = debug.propagateFromFunction();
	        Promise.prototype._boundValue = debug.boundValueFunction();
	    }
	    var maybePromise = tryConvertToPromise(thisArg);
	    var ret = new Promise(INTERNAL);
	    ret._propagateFrom(this, 1);
	    var target = this._target();
	    ret._setBoundTo(maybePromise);
	    if (maybePromise instanceof Promise) {
	        var context = {
	            promiseRejectionQueued: false,
	            promise: ret,
	            target: target,
	            bindingPromise: maybePromise
	        };
	        target._then(INTERNAL, targetRejected, undefined, ret, context);
	        maybePromise._then(
	            bindingResolved, bindingRejected, undefined, ret, context);
	        ret._setOnCancel(maybePromise);
	    } else {
	        ret._resolveCallback(target);
	    }
	    return ret;
	};

	Promise.prototype._setBoundTo = function (obj) {
	    if (obj !== undefined) {
	        this._bitField = this._bitField | 2097152;
	        this._boundTo = obj;
	    } else {
	        this._bitField = this._bitField & (~2097152);
	    }
	};

	Promise.prototype._isBound = function () {
	    return (this._bitField & 2097152) === 2097152;
	};

	Promise.bind = function (thisArg, value) {
	    return Promise.resolve(value).bind(thisArg);
	};
	};

	},{}],4:[function(_dereq_,module,exports){
	"use strict";
	var old;
	if (typeof Promise !== "undefined") old = Promise;
	function noConflict() {
	    try { if (Promise === bluebird) Promise = old; }
	    catch (e) {}
	    return bluebird;
	}
	var bluebird = _dereq_("./promise")();
	bluebird.noConflict = noConflict;
	module.exports = bluebird;

	},{"./promise":22}],5:[function(_dereq_,module,exports){
	"use strict";
	var cr = Object.create;
	if (cr) {
	    var callerCache = cr(null);
	    var getterCache = cr(null);
	    callerCache[" size"] = getterCache[" size"] = 0;
	}

	module.exports = function(Promise) {
	var util = _dereq_("./util");
	var canEvaluate = util.canEvaluate;
	var isIdentifier = util.isIdentifier;

	var getMethodCaller;
	var getGetter;
	if (false) {
	var makeMethodCaller = function (methodName) {
	    return new Function("ensureMethod", "                                    \n\
	        return function(obj) {                                               \n\
	            'use strict'                                                     \n\
	            var len = this.length;                                           \n\
	            ensureMethod(obj, 'methodName');                                 \n\
	            switch(len) {                                                    \n\
	                case 1: return obj.methodName(this[0]);                      \n\
	                case 2: return obj.methodName(this[0], this[1]);             \n\
	                case 3: return obj.methodName(this[0], this[1], this[2]);    \n\
	                case 0: return obj.methodName();                             \n\
	                default:                                                     \n\
	                    return obj.methodName.apply(obj, this);                  \n\
	            }                                                                \n\
	        };                                                                   \n\
	        ".replace(/methodName/g, methodName))(ensureMethod);
	};

	var makeGetter = function (propertyName) {
	    return new Function("obj", "                                             \n\
	        'use strict';                                                        \n\
	        return obj.propertyName;                                             \n\
	        ".replace("propertyName", propertyName));
	};

	var getCompiled = function(name, compiler, cache) {
	    var ret = cache[name];
	    if (typeof ret !== "function") {
	        if (!isIdentifier(name)) {
	            return null;
	        }
	        ret = compiler(name);
	        cache[name] = ret;
	        cache[" size"]++;
	        if (cache[" size"] > 512) {
	            var keys = Object.keys(cache);
	            for (var i = 0; i < 256; ++i) delete cache[keys[i]];
	            cache[" size"] = keys.length - 256;
	        }
	    }
	    return ret;
	};

	getMethodCaller = function(name) {
	    return getCompiled(name, makeMethodCaller, callerCache);
	};

	getGetter = function(name) {
	    return getCompiled(name, makeGetter, getterCache);
	};
	}

	function ensureMethod(obj, methodName) {
	    var fn;
	    if (obj != null) fn = obj[methodName];
	    if (typeof fn !== "function") {
	        var message = "Object " + util.classString(obj) + " has no method '" +
	            util.toString(methodName) + "'";
	        throw new Promise.TypeError(message);
	    }
	    return fn;
	}

	function caller(obj) {
	    var methodName = this.pop();
	    var fn = ensureMethod(obj, methodName);
	    return fn.apply(obj, this);
	}
	Promise.prototype.call = function (methodName) {
	    var args = [].slice.call(arguments, 1);;
	    if (false) {
	        if (canEvaluate) {
	            var maybeCaller = getMethodCaller(methodName);
	            if (maybeCaller !== null) {
	                return this._then(
	                    maybeCaller, undefined, undefined, args, undefined);
	            }
	        }
	    }
	    args.push(methodName);
	    return this._then(caller, undefined, undefined, args, undefined);
	};

	function namedGetter(obj) {
	    return obj[this];
	}
	function indexedGetter(obj) {
	    var index = +this;
	    if (index < 0) index = Math.max(0, index + obj.length);
	    return obj[index];
	}
	Promise.prototype.get = function (propertyName) {
	    var isIndex = (typeof propertyName === "number");
	    var getter;
	    if (!isIndex) {
	        if (canEvaluate) {
	            var maybeGetter = getGetter(propertyName);
	            getter = maybeGetter !== null ? maybeGetter : namedGetter;
	        } else {
	            getter = namedGetter;
	        }
	    } else {
	        getter = indexedGetter;
	    }
	    return this._then(getter, undefined, undefined, propertyName, undefined);
	};
	};

	},{"./util":36}],6:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, PromiseArray, apiRejection, debug) {
	var util = _dereq_("./util");
	var tryCatch = util.tryCatch;
	var errorObj = util.errorObj;
	var async = Promise._async;

	Promise.prototype["break"] = Promise.prototype.cancel = function() {
	    if (!debug.cancellation()) return this._warn("cancellation is disabled");

	    var promise = this;
	    var child = promise;
	    while (promise.isCancellable()) {
	        if (!promise._cancelBy(child)) {
	            if (child._isFollowing()) {
	                child._followee().cancel();
	            } else {
	                child._cancelBranched();
	            }
	            break;
	        }

	        var parent = promise._cancellationParent;
	        if (parent == null || !parent.isCancellable()) {
	            if (promise._isFollowing()) {
	                promise._followee().cancel();
	            } else {
	                promise._cancelBranched();
	            }
	            break;
	        } else {
	            if (promise._isFollowing()) promise._followee().cancel();
	            child = promise;
	            promise = parent;
	        }
	    }
	};

	Promise.prototype._branchHasCancelled = function() {
	    this._branchesRemainingToCancel--;
	};

	Promise.prototype._enoughBranchesHaveCancelled = function() {
	    return this._branchesRemainingToCancel === undefined ||
	           this._branchesRemainingToCancel <= 0;
	};

	Promise.prototype._cancelBy = function(canceller) {
	    if (canceller === this) {
	        this._branchesRemainingToCancel = 0;
	        this._invokeOnCancel();
	        return true;
	    } else {
	        this._branchHasCancelled();
	        if (this._enoughBranchesHaveCancelled()) {
	            this._invokeOnCancel();
	            return true;
	        }
	    }
	    return false;
	};

	Promise.prototype._cancelBranched = function() {
	    if (this._enoughBranchesHaveCancelled()) {
	        this._cancel();
	    }
	};

	Promise.prototype._cancel = function() {
	    if (!this.isCancellable()) return;

	    this._setCancelled();
	    async.invoke(this._cancelPromises, this, undefined);
	};

	Promise.prototype._cancelPromises = function() {
	    if (this._length() > 0) this._settlePromises();
	};

	Promise.prototype._unsetOnCancel = function() {
	    this._onCancelField = undefined;
	};

	Promise.prototype.isCancellable = function() {
	    return this.isPending() && !this.isCancelled();
	};

	Promise.prototype._doInvokeOnCancel = function(onCancelCallback, internalOnly) {
	    if (util.isArray(onCancelCallback)) {
	        for (var i = 0; i < onCancelCallback.length; ++i) {
	            this._doInvokeOnCancel(onCancelCallback[i], internalOnly);
	        }
	    } else if (onCancelCallback !== undefined) {
	        if (typeof onCancelCallback === "function") {
	            if (!internalOnly) {
	                var e = tryCatch(onCancelCallback).call(this._boundValue());
	                if (e === errorObj) {
	                    this._attachExtraTrace(e.e);
	                    async.throwLater(e.e);
	                }
	            }
	        } else {
	            onCancelCallback._resultCancelled(this);
	        }
	    }
	};

	Promise.prototype._invokeOnCancel = function() {
	    var onCancelCallback = this._onCancel();
	    this._unsetOnCancel();
	    async.invoke(this._doInvokeOnCancel, this, onCancelCallback);
	};

	Promise.prototype._invokeInternalOnCancel = function() {
	    if (this.isCancellable()) {
	        this._doInvokeOnCancel(this._onCancel(), true);
	        this._unsetOnCancel();
	    }
	};

	Promise.prototype._resultCancelled = function() {
	    this.cancel();
	};

	};

	},{"./util":36}],7:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(NEXT_FILTER) {
	var util = _dereq_("./util");
	var getKeys = _dereq_("./es5").keys;
	var tryCatch = util.tryCatch;
	var errorObj = util.errorObj;

	function catchFilter(instances, cb, promise) {
	    return function(e) {
	        var boundTo = promise._boundValue();
	        predicateLoop: for (var i = 0; i < instances.length; ++i) {
	            var item = instances[i];

	            if (item === Error ||
	                (item != null && item.prototype instanceof Error)) {
	                if (e instanceof item) {
	                    return tryCatch(cb).call(boundTo, e);
	                }
	            } else if (typeof item === "function") {
	                var matchesPredicate = tryCatch(item).call(boundTo, e);
	                if (matchesPredicate === errorObj) {
	                    return matchesPredicate;
	                } else if (matchesPredicate) {
	                    return tryCatch(cb).call(boundTo, e);
	                }
	            } else if (util.isObject(e)) {
	                var keys = getKeys(item);
	                for (var j = 0; j < keys.length; ++j) {
	                    var key = keys[j];
	                    if (item[key] != e[key]) {
	                        continue predicateLoop;
	                    }
	                }
	                return tryCatch(cb).call(boundTo, e);
	            }
	        }
	        return NEXT_FILTER;
	    };
	}

	return catchFilter;
	};

	},{"./es5":13,"./util":36}],8:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise) {
	var longStackTraces = false;
	var contextStack = [];

	Promise.prototype._promiseCreated = function() {};
	Promise.prototype._pushContext = function() {};
	Promise.prototype._popContext = function() {return null;};
	Promise._peekContext = Promise.prototype._peekContext = function() {};

	function Context() {
	    this._trace = new Context.CapturedTrace(peekContext());
	}
	Context.prototype._pushContext = function () {
	    if (this._trace !== undefined) {
	        this._trace._promiseCreated = null;
	        contextStack.push(this._trace);
	    }
	};

	Context.prototype._popContext = function () {
	    if (this._trace !== undefined) {
	        var trace = contextStack.pop();
	        var ret = trace._promiseCreated;
	        trace._promiseCreated = null;
	        return ret;
	    }
	    return null;
	};

	function createContext() {
	    if (longStackTraces) return new Context();
	}

	function peekContext() {
	    var lastIndex = contextStack.length - 1;
	    if (lastIndex >= 0) {
	        return contextStack[lastIndex];
	    }
	    return undefined;
	}
	Context.CapturedTrace = null;
	Context.create = createContext;
	Context.deactivateLongStackTraces = function() {};
	Context.activateLongStackTraces = function() {
	    var Promise_pushContext = Promise.prototype._pushContext;
	    var Promise_popContext = Promise.prototype._popContext;
	    var Promise_PeekContext = Promise._peekContext;
	    var Promise_peekContext = Promise.prototype._peekContext;
	    var Promise_promiseCreated = Promise.prototype._promiseCreated;
	    Context.deactivateLongStackTraces = function() {
	        Promise.prototype._pushContext = Promise_pushContext;
	        Promise.prototype._popContext = Promise_popContext;
	        Promise._peekContext = Promise_PeekContext;
	        Promise.prototype._peekContext = Promise_peekContext;
	        Promise.prototype._promiseCreated = Promise_promiseCreated;
	        longStackTraces = false;
	    };
	    longStackTraces = true;
	    Promise.prototype._pushContext = Context.prototype._pushContext;
	    Promise.prototype._popContext = Context.prototype._popContext;
	    Promise._peekContext = Promise.prototype._peekContext = peekContext;
	    Promise.prototype._promiseCreated = function() {
	        var ctx = this._peekContext();
	        if (ctx && ctx._promiseCreated == null) ctx._promiseCreated = this;
	    };
	};
	return Context;
	};

	},{}],9:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, Context) {
	var getDomain = Promise._getDomain;
	var async = Promise._async;
	var Warning = _dereq_("./errors").Warning;
	var util = _dereq_("./util");
	var canAttachTrace = util.canAttachTrace;
	var unhandledRejectionHandled;
	var possiblyUnhandledRejection;
	var bluebirdFramePattern =
	    /[\\\/]bluebird[\\\/]js[\\\/](release|debug|instrumented)/;
	var stackFramePattern = null;
	var formatStack = null;
	var indentStackFrames = false;
	var printWarning;
	var debugging = !!(util.env("BLUEBIRD_DEBUG") != 0 &&
	                        (true ||
	                         util.env("BLUEBIRD_DEBUG") ||
	                         util.env("NODE_ENV") === "development"));

	var warnings = !!(util.env("BLUEBIRD_WARNINGS") != 0 &&
	    (debugging || util.env("BLUEBIRD_WARNINGS")));

	var longStackTraces = !!(util.env("BLUEBIRD_LONG_STACK_TRACES") != 0 &&
	    (debugging || util.env("BLUEBIRD_LONG_STACK_TRACES")));

	var wForgottenReturn = util.env("BLUEBIRD_W_FORGOTTEN_RETURN") != 0 &&
	    (warnings || !!util.env("BLUEBIRD_W_FORGOTTEN_RETURN"));

	Promise.prototype.suppressUnhandledRejections = function() {
	    var target = this._target();
	    target._bitField = ((target._bitField & (~1048576)) |
	                      524288);
	};

	Promise.prototype._ensurePossibleRejectionHandled = function () {
	    if ((this._bitField & 524288) !== 0) return;
	    this._setRejectionIsUnhandled();
	    async.invokeLater(this._notifyUnhandledRejection, this, undefined);
	};

	Promise.prototype._notifyUnhandledRejectionIsHandled = function () {
	    fireRejectionEvent("rejectionHandled",
	                                  unhandledRejectionHandled, undefined, this);
	};

	Promise.prototype._setReturnedNonUndefined = function() {
	    this._bitField = this._bitField | 268435456;
	};

	Promise.prototype._returnedNonUndefined = function() {
	    return (this._bitField & 268435456) !== 0;
	};

	Promise.prototype._notifyUnhandledRejection = function () {
	    if (this._isRejectionUnhandled()) {
	        var reason = this._settledValue();
	        this._setUnhandledRejectionIsNotified();
	        fireRejectionEvent("unhandledRejection",
	                                      possiblyUnhandledRejection, reason, this);
	    }
	};

	Promise.prototype._setUnhandledRejectionIsNotified = function () {
	    this._bitField = this._bitField | 262144;
	};

	Promise.prototype._unsetUnhandledRejectionIsNotified = function () {
	    this._bitField = this._bitField & (~262144);
	};

	Promise.prototype._isUnhandledRejectionNotified = function () {
	    return (this._bitField & 262144) > 0;
	};

	Promise.prototype._setRejectionIsUnhandled = function () {
	    this._bitField = this._bitField | 1048576;
	};

	Promise.prototype._unsetRejectionIsUnhandled = function () {
	    this._bitField = this._bitField & (~1048576);
	    if (this._isUnhandledRejectionNotified()) {
	        this._unsetUnhandledRejectionIsNotified();
	        this._notifyUnhandledRejectionIsHandled();
	    }
	};

	Promise.prototype._isRejectionUnhandled = function () {
	    return (this._bitField & 1048576) > 0;
	};

	Promise.prototype._warn = function(message, shouldUseOwnTrace, promise) {
	    return warn(message, shouldUseOwnTrace, promise || this);
	};

	Promise.onPossiblyUnhandledRejection = function (fn) {
	    var domain = getDomain();
	    possiblyUnhandledRejection =
	        typeof fn === "function" ? (domain === null ? fn : domain.bind(fn))
	                                 : undefined;
	};

	Promise.onUnhandledRejectionHandled = function (fn) {
	    var domain = getDomain();
	    unhandledRejectionHandled =
	        typeof fn === "function" ? (domain === null ? fn : domain.bind(fn))
	                                 : undefined;
	};

	var disableLongStackTraces = function() {};
	Promise.longStackTraces = function () {
	    if (async.haveItemsQueued() && !config.longStackTraces) {
	        throw new Error("cannot enable long stack traces after promises have been created\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    if (!config.longStackTraces && longStackTracesIsSupported()) {
	        var Promise_captureStackTrace = Promise.prototype._captureStackTrace;
	        var Promise_attachExtraTrace = Promise.prototype._attachExtraTrace;
	        config.longStackTraces = true;
	        disableLongStackTraces = function() {
	            if (async.haveItemsQueued() && !config.longStackTraces) {
	                throw new Error("cannot enable long stack traces after promises have been created\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	            }
	            Promise.prototype._captureStackTrace = Promise_captureStackTrace;
	            Promise.prototype._attachExtraTrace = Promise_attachExtraTrace;
	            Context.deactivateLongStackTraces();
	            async.enableTrampoline();
	            config.longStackTraces = false;
	        };
	        Promise.prototype._captureStackTrace = longStackTracesCaptureStackTrace;
	        Promise.prototype._attachExtraTrace = longStackTracesAttachExtraTrace;
	        Context.activateLongStackTraces();
	        async.disableTrampolineIfNecessary();
	    }
	};

	Promise.hasLongStackTraces = function () {
	    return config.longStackTraces && longStackTracesIsSupported();
	};

	var fireDomEvent = (function() {
	    try {
	        var event = document.createEvent("CustomEvent");
	        event.initCustomEvent("testingtheevent", false, true, {});
	        util.global.dispatchEvent(event);
	        return function(name, event) {
	            var domEvent = document.createEvent("CustomEvent");
	            domEvent.initCustomEvent(name.toLowerCase(), false, true, event);
	            return !util.global.dispatchEvent(domEvent);
	        };
	    } catch (e) {}
	    return function() {
	        return false;
	    };
	})();

	var fireGlobalEvent = (function() {
	    if (util.isNode) {
	        return function() {
	            return process.emit.apply(process, arguments);
	        };
	    } else {
	        if (!util.global) {
	            return function() {
	                return false;
	            };
	        }
	        return function(name) {
	            var methodName = "on" + name.toLowerCase();
	            var method = util.global[methodName];
	            if (!method) return false;
	            method.apply(util.global, [].slice.call(arguments, 1));
	            return true;
	        };
	    }
	})();

	function generatePromiseLifecycleEventObject(name, promise) {
	    return {promise: promise};
	}

	var eventToObjectGenerator = {
	    promiseCreated: generatePromiseLifecycleEventObject,
	    promiseFulfilled: generatePromiseLifecycleEventObject,
	    promiseRejected: generatePromiseLifecycleEventObject,
	    promiseResolved: generatePromiseLifecycleEventObject,
	    promiseCancelled: generatePromiseLifecycleEventObject,
	    promiseChained: function(name, promise, child) {
	        return {promise: promise, child: child};
	    },
	    warning: function(name, warning) {
	        return {warning: warning};
	    },
	    unhandledRejection: function (name, reason, promise) {
	        return {reason: reason, promise: promise};
	    },
	    rejectionHandled: generatePromiseLifecycleEventObject
	};

	var activeFireEvent = function (name) {
	    var globalEventFired = false;
	    try {
	        globalEventFired = fireGlobalEvent.apply(null, arguments);
	    } catch (e) {
	        async.throwLater(e);
	        globalEventFired = true;
	    }

	    var domEventFired = false;
	    try {
	        domEventFired = fireDomEvent(name,
	                    eventToObjectGenerator[name].apply(null, arguments));
	    } catch (e) {
	        async.throwLater(e);
	        domEventFired = true;
	    }

	    return domEventFired || globalEventFired;
	};

	Promise.config = function(opts) {
	    opts = Object(opts);
	    if ("longStackTraces" in opts) {
	        if (opts.longStackTraces) {
	            Promise.longStackTraces();
	        } else if (!opts.longStackTraces && Promise.hasLongStackTraces()) {
	            disableLongStackTraces();
	        }
	    }
	    if ("warnings" in opts) {
	        var warningsOption = opts.warnings;
	        config.warnings = !!warningsOption;
	        wForgottenReturn = config.warnings;

	        if (util.isObject(warningsOption)) {
	            if ("wForgottenReturn" in warningsOption) {
	                wForgottenReturn = !!warningsOption.wForgottenReturn;
	            }
	        }
	    }
	    if ("cancellation" in opts && opts.cancellation && !config.cancellation) {
	        if (async.haveItemsQueued()) {
	            throw new Error(
	                "cannot enable cancellation after promises are in use");
	        }
	        Promise.prototype._clearCancellationData =
	            cancellationClearCancellationData;
	        Promise.prototype._propagateFrom = cancellationPropagateFrom;
	        Promise.prototype._onCancel = cancellationOnCancel;
	        Promise.prototype._setOnCancel = cancellationSetOnCancel;
	        Promise.prototype._attachCancellationCallback =
	            cancellationAttachCancellationCallback;
	        Promise.prototype._execute = cancellationExecute;
	        propagateFromFunction = cancellationPropagateFrom;
	        config.cancellation = true;
	    }
	    if ("monitoring" in opts) {
	        if (opts.monitoring && !config.monitoring) {
	            config.monitoring = true;
	            Promise.prototype._fireEvent = activeFireEvent;
	        } else if (!opts.monitoring && config.monitoring) {
	            config.monitoring = false;
	            Promise.prototype._fireEvent = defaultFireEvent;
	        }
	    }
	};

	function defaultFireEvent() { return false; }

	Promise.prototype._fireEvent = defaultFireEvent;
	Promise.prototype._execute = function(executor, resolve, reject) {
	    try {
	        executor(resolve, reject);
	    } catch (e) {
	        return e;
	    }
	};
	Promise.prototype._onCancel = function () {};
	Promise.prototype._setOnCancel = function (handler) { ; };
	Promise.prototype._attachCancellationCallback = function(onCancel) {
	    ;
	};
	Promise.prototype._captureStackTrace = function () {};
	Promise.prototype._attachExtraTrace = function () {};
	Promise.prototype._clearCancellationData = function() {};
	Promise.prototype._propagateFrom = function (parent, flags) {
	    ;
	    ;
	};

	function cancellationExecute(executor, resolve, reject) {
	    var promise = this;
	    try {
	        executor(resolve, reject, function(onCancel) {
	            if (typeof onCancel !== "function") {
	                throw new TypeError("onCancel must be a function, got: " +
	                                    util.toString(onCancel));
	            }
	            promise._attachCancellationCallback(onCancel);
	        });
	    } catch (e) {
	        return e;
	    }
	}

	function cancellationAttachCancellationCallback(onCancel) {
	    if (!this.isCancellable()) return this;

	    var previousOnCancel = this._onCancel();
	    if (previousOnCancel !== undefined) {
	        if (util.isArray(previousOnCancel)) {
	            previousOnCancel.push(onCancel);
	        } else {
	            this._setOnCancel([previousOnCancel, onCancel]);
	        }
	    } else {
	        this._setOnCancel(onCancel);
	    }
	}

	function cancellationOnCancel() {
	    return this._onCancelField;
	}

	function cancellationSetOnCancel(onCancel) {
	    this._onCancelField = onCancel;
	}

	function cancellationClearCancellationData() {
	    this._cancellationParent = undefined;
	    this._onCancelField = undefined;
	}

	function cancellationPropagateFrom(parent, flags) {
	    if ((flags & 1) !== 0) {
	        this._cancellationParent = parent;
	        var branchesRemainingToCancel = parent._branchesRemainingToCancel;
	        if (branchesRemainingToCancel === undefined) {
	            branchesRemainingToCancel = 0;
	        }
	        parent._branchesRemainingToCancel = branchesRemainingToCancel + 1;
	    }
	    if ((flags & 2) !== 0 && parent._isBound()) {
	        this._setBoundTo(parent._boundTo);
	    }
	}

	function bindingPropagateFrom(parent, flags) {
	    if ((flags & 2) !== 0 && parent._isBound()) {
	        this._setBoundTo(parent._boundTo);
	    }
	}
	var propagateFromFunction = bindingPropagateFrom;

	function boundValueFunction() {
	    var ret = this._boundTo;
	    if (ret !== undefined) {
	        if (ret instanceof Promise) {
	            if (ret.isFulfilled()) {
	                return ret.value();
	            } else {
	                return undefined;
	            }
	        }
	    }
	    return ret;
	}

	function longStackTracesCaptureStackTrace() {
	    this._trace = new CapturedTrace(this._peekContext());
	}

	function longStackTracesAttachExtraTrace(error, ignoreSelf) {
	    if (canAttachTrace(error)) {
	        var trace = this._trace;
	        if (trace !== undefined) {
	            if (ignoreSelf) trace = trace._parent;
	        }
	        if (trace !== undefined) {
	            trace.attachExtraTrace(error);
	        } else if (!error.__stackCleaned__) {
	            var parsed = parseStackAndMessage(error);
	            util.notEnumerableProp(error, "stack",
	                parsed.message + "\n" + parsed.stack.join("\n"));
	            util.notEnumerableProp(error, "__stackCleaned__", true);
	        }
	    }
	}

	function checkForgottenReturns(returnValue, promiseCreated, name, promise,
	                               parent) {
	    if (returnValue === undefined && promiseCreated !== null &&
	        wForgottenReturn) {
	        if (parent !== undefined && parent._returnedNonUndefined()) return;
	        if ((promise._bitField & 65535) === 0) return;

	        if (name) name = name + " ";
	        var msg = "a promise was created in a " + name +
	            "handler but was not returned from it";
	        promise._warn(msg, true, promiseCreated);
	    }
	}

	function deprecated(name, replacement) {
	    var message = name +
	        " is deprecated and will be removed in a future version.";
	    if (replacement) message += " Use " + replacement + " instead.";
	    return warn(message);
	}

	function warn(message, shouldUseOwnTrace, promise) {
	    if (!config.warnings) return;
	    var warning = new Warning(message);
	    var ctx;
	    if (shouldUseOwnTrace) {
	        promise._attachExtraTrace(warning);
	    } else if (config.longStackTraces && (ctx = Promise._peekContext())) {
	        ctx.attachExtraTrace(warning);
	    } else {
	        var parsed = parseStackAndMessage(warning);
	        warning.stack = parsed.message + "\n" + parsed.stack.join("\n");
	    }

	    if (!activeFireEvent("warning", warning)) {
	        formatAndLogError(warning, "", true);
	    }
	}

	function reconstructStack(message, stacks) {
	    for (var i = 0; i < stacks.length - 1; ++i) {
	        stacks[i].push("From previous event:");
	        stacks[i] = stacks[i].join("\n");
	    }
	    if (i < stacks.length) {
	        stacks[i] = stacks[i].join("\n");
	    }
	    return message + "\n" + stacks.join("\n");
	}

	function removeDuplicateOrEmptyJumps(stacks) {
	    for (var i = 0; i < stacks.length; ++i) {
	        if (stacks[i].length === 0 ||
	            ((i + 1 < stacks.length) && stacks[i][0] === stacks[i+1][0])) {
	            stacks.splice(i, 1);
	            i--;
	        }
	    }
	}

	function removeCommonRoots(stacks) {
	    var current = stacks[0];
	    for (var i = 1; i < stacks.length; ++i) {
	        var prev = stacks[i];
	        var currentLastIndex = current.length - 1;
	        var currentLastLine = current[currentLastIndex];
	        var commonRootMeetPoint = -1;

	        for (var j = prev.length - 1; j >= 0; --j) {
	            if (prev[j] === currentLastLine) {
	                commonRootMeetPoint = j;
	                break;
	            }
	        }

	        for (var j = commonRootMeetPoint; j >= 0; --j) {
	            var line = prev[j];
	            if (current[currentLastIndex] === line) {
	                current.pop();
	                currentLastIndex--;
	            } else {
	                break;
	            }
	        }
	        current = prev;
	    }
	}

	function cleanStack(stack) {
	    var ret = [];
	    for (var i = 0; i < stack.length; ++i) {
	        var line = stack[i];
	        var isTraceLine = "    (No stack trace)" === line ||
	            stackFramePattern.test(line);
	        var isInternalFrame = isTraceLine && shouldIgnore(line);
	        if (isTraceLine && !isInternalFrame) {
	            if (indentStackFrames && line.charAt(0) !== " ") {
	                line = "    " + line;
	            }
	            ret.push(line);
	        }
	    }
	    return ret;
	}

	function stackFramesAsArray(error) {
	    var stack = error.stack.replace(/\s+$/g, "").split("\n");
	    for (var i = 0; i < stack.length; ++i) {
	        var line = stack[i];
	        if ("    (No stack trace)" === line || stackFramePattern.test(line)) {
	            break;
	        }
	    }
	    if (i > 0) {
	        stack = stack.slice(i);
	    }
	    return stack;
	}

	function parseStackAndMessage(error) {
	    var stack = error.stack;
	    var message = error.toString();
	    stack = typeof stack === "string" && stack.length > 0
	                ? stackFramesAsArray(error) : ["    (No stack trace)"];
	    return {
	        message: message,
	        stack: cleanStack(stack)
	    };
	}

	function formatAndLogError(error, title, isSoft) {
	    if (typeof console !== "undefined") {
	        var message;
	        if (util.isObject(error)) {
	            var stack = error.stack;
	            message = title + formatStack(stack, error);
	        } else {
	            message = title + String(error);
	        }
	        if (typeof printWarning === "function") {
	            printWarning(message, isSoft);
	        } else if (typeof console.log === "function" ||
	            typeof console.log === "object") {
	            console.log(message);
	        }
	    }
	}

	function fireRejectionEvent(name, localHandler, reason, promise) {
	    var localEventFired = false;
	    try {
	        if (typeof localHandler === "function") {
	            localEventFired = true;
	            if (name === "rejectionHandled") {
	                localHandler(promise);
	            } else {
	                localHandler(reason, promise);
	            }
	        }
	    } catch (e) {
	        async.throwLater(e);
	    }

	    if (name === "unhandledRejection") {
	        if (!activeFireEvent(name, reason, promise) && !localEventFired) {
	            formatAndLogError(reason, "Unhandled rejection ");
	        }
	    } else {
	        activeFireEvent(name, promise);
	    }
	}

	function formatNonError(obj) {
	    var str;
	    if (typeof obj === "function") {
	        str = "[function " +
	            (obj.name || "anonymous") +
	            "]";
	    } else {
	        str = obj && typeof obj.toString === "function"
	            ? obj.toString() : util.toString(obj);
	        var ruselessToString = /\[object [a-zA-Z0-9$_]+\]/;
	        if (ruselessToString.test(str)) {
	            try {
	                var newStr = JSON.stringify(obj);
	                str = newStr;
	            }
	            catch(e) {

	            }
	        }
	        if (str.length === 0) {
	            str = "(empty array)";
	        }
	    }
	    return ("(<" + snip(str) + ">, no stack trace)");
	}

	function snip(str) {
	    var maxChars = 41;
	    if (str.length < maxChars) {
	        return str;
	    }
	    return str.substr(0, maxChars - 3) + "...";
	}

	function longStackTracesIsSupported() {
	    return typeof captureStackTrace === "function";
	}

	var shouldIgnore = function() { return false; };
	var parseLineInfoRegex = /[\/<\(]([^:\/]+):(\d+):(?:\d+)\)?\s*$/;
	function parseLineInfo(line) {
	    var matches = line.match(parseLineInfoRegex);
	    if (matches) {
	        return {
	            fileName: matches[1],
	            line: parseInt(matches[2], 10)
	        };
	    }
	}

	function setBounds(firstLineError, lastLineError) {
	    if (!longStackTracesIsSupported()) return;
	    var firstStackLines = firstLineError.stack.split("\n");
	    var lastStackLines = lastLineError.stack.split("\n");
	    var firstIndex = -1;
	    var lastIndex = -1;
	    var firstFileName;
	    var lastFileName;
	    for (var i = 0; i < firstStackLines.length; ++i) {
	        var result = parseLineInfo(firstStackLines[i]);
	        if (result) {
	            firstFileName = result.fileName;
	            firstIndex = result.line;
	            break;
	        }
	    }
	    for (var i = 0; i < lastStackLines.length; ++i) {
	        var result = parseLineInfo(lastStackLines[i]);
	        if (result) {
	            lastFileName = result.fileName;
	            lastIndex = result.line;
	            break;
	        }
	    }
	    if (firstIndex < 0 || lastIndex < 0 || !firstFileName || !lastFileName ||
	        firstFileName !== lastFileName || firstIndex >= lastIndex) {
	        return;
	    }

	    shouldIgnore = function(line) {
	        if (bluebirdFramePattern.test(line)) return true;
	        var info = parseLineInfo(line);
	        if (info) {
	            if (info.fileName === firstFileName &&
	                (firstIndex <= info.line && info.line <= lastIndex)) {
	                return true;
	            }
	        }
	        return false;
	    };
	}

	function CapturedTrace(parent) {
	    this._parent = parent;
	    this._promisesCreated = 0;
	    var length = this._length = 1 + (parent === undefined ? 0 : parent._length);
	    captureStackTrace(this, CapturedTrace);
	    if (length > 32) this.uncycle();
	}
	util.inherits(CapturedTrace, Error);
	Context.CapturedTrace = CapturedTrace;

	CapturedTrace.prototype.uncycle = function() {
	    var length = this._length;
	    if (length < 2) return;
	    var nodes = [];
	    var stackToIndex = {};

	    for (var i = 0, node = this; node !== undefined; ++i) {
	        nodes.push(node);
	        node = node._parent;
	    }
	    length = this._length = i;
	    for (var i = length - 1; i >= 0; --i) {
	        var stack = nodes[i].stack;
	        if (stackToIndex[stack] === undefined) {
	            stackToIndex[stack] = i;
	        }
	    }
	    for (var i = 0; i < length; ++i) {
	        var currentStack = nodes[i].stack;
	        var index = stackToIndex[currentStack];
	        if (index !== undefined && index !== i) {
	            if (index > 0) {
	                nodes[index - 1]._parent = undefined;
	                nodes[index - 1]._length = 1;
	            }
	            nodes[i]._parent = undefined;
	            nodes[i]._length = 1;
	            var cycleEdgeNode = i > 0 ? nodes[i - 1] : this;

	            if (index < length - 1) {
	                cycleEdgeNode._parent = nodes[index + 1];
	                cycleEdgeNode._parent.uncycle();
	                cycleEdgeNode._length =
	                    cycleEdgeNode._parent._length + 1;
	            } else {
	                cycleEdgeNode._parent = undefined;
	                cycleEdgeNode._length = 1;
	            }
	            var currentChildLength = cycleEdgeNode._length + 1;
	            for (var j = i - 2; j >= 0; --j) {
	                nodes[j]._length = currentChildLength;
	                currentChildLength++;
	            }
	            return;
	        }
	    }
	};

	CapturedTrace.prototype.attachExtraTrace = function(error) {
	    if (error.__stackCleaned__) return;
	    this.uncycle();
	    var parsed = parseStackAndMessage(error);
	    var message = parsed.message;
	    var stacks = [parsed.stack];

	    var trace = this;
	    while (trace !== undefined) {
	        stacks.push(cleanStack(trace.stack.split("\n")));
	        trace = trace._parent;
	    }
	    removeCommonRoots(stacks);
	    removeDuplicateOrEmptyJumps(stacks);
	    util.notEnumerableProp(error, "stack", reconstructStack(message, stacks));
	    util.notEnumerableProp(error, "__stackCleaned__", true);
	};

	var captureStackTrace = (function stackDetection() {
	    var v8stackFramePattern = /^\s*at\s*/;
	    var v8stackFormatter = function(stack, error) {
	        if (typeof stack === "string") return stack;

	        if (error.name !== undefined &&
	            error.message !== undefined) {
	            return error.toString();
	        }
	        return formatNonError(error);
	    };

	    if (typeof Error.stackTraceLimit === "number" &&
	        typeof Error.captureStackTrace === "function") {
	        Error.stackTraceLimit += 6;
	        stackFramePattern = v8stackFramePattern;
	        formatStack = v8stackFormatter;
	        var captureStackTrace = Error.captureStackTrace;

	        shouldIgnore = function(line) {
	            return bluebirdFramePattern.test(line);
	        };
	        return function(receiver, ignoreUntil) {
	            Error.stackTraceLimit += 6;
	            captureStackTrace(receiver, ignoreUntil);
	            Error.stackTraceLimit -= 6;
	        };
	    }
	    var err = new Error();

	    if (typeof err.stack === "string" &&
	        err.stack.split("\n")[0].indexOf("stackDetection@") >= 0) {
	        stackFramePattern = /@/;
	        formatStack = v8stackFormatter;
	        indentStackFrames = true;
	        return function captureStackTrace(o) {
	            o.stack = new Error().stack;
	        };
	    }

	    var hasStackAfterThrow;
	    try { throw new Error(); }
	    catch(e) {
	        hasStackAfterThrow = ("stack" in e);
	    }
	    if (!("stack" in err) && hasStackAfterThrow &&
	        typeof Error.stackTraceLimit === "number") {
	        stackFramePattern = v8stackFramePattern;
	        formatStack = v8stackFormatter;
	        return function captureStackTrace(o) {
	            Error.stackTraceLimit += 6;
	            try { throw new Error(); }
	            catch(e) { o.stack = e.stack; }
	            Error.stackTraceLimit -= 6;
	        };
	    }

	    formatStack = function(stack, error) {
	        if (typeof stack === "string") return stack;

	        if ((typeof error === "object" ||
	            typeof error === "function") &&
	            error.name !== undefined &&
	            error.message !== undefined) {
	            return error.toString();
	        }
	        return formatNonError(error);
	    };

	    return null;

	})([]);

	if (typeof console !== "undefined" && typeof console.warn !== "undefined") {
	    printWarning = function (message) {
	        console.warn(message);
	    };
	    if (util.isNode && process.stderr.isTTY) {
	        printWarning = function(message, isSoft) {
	            var color = isSoft ? "\u001b[33m" : "\u001b[31m";
	            console.warn(color + message + "\u001b[0m\n");
	        };
	    } else if (!util.isNode && typeof (new Error().stack) === "string") {
	        printWarning = function(message, isSoft) {
	            console.warn("%c" + message,
	                        isSoft ? "color: darkorange" : "color: red");
	        };
	    }
	}

	var config = {
	    warnings: warnings,
	    longStackTraces: false,
	    cancellation: false,
	    monitoring: false
	};

	if (longStackTraces) Promise.longStackTraces();

	return {
	    longStackTraces: function() {
	        return config.longStackTraces;
	    },
	    warnings: function() {
	        return config.warnings;
	    },
	    cancellation: function() {
	        return config.cancellation;
	    },
	    monitoring: function() {
	        return config.monitoring;
	    },
	    propagateFromFunction: function() {
	        return propagateFromFunction;
	    },
	    boundValueFunction: function() {
	        return boundValueFunction;
	    },
	    checkForgottenReturns: checkForgottenReturns,
	    setBounds: setBounds,
	    warn: warn,
	    deprecated: deprecated,
	    CapturedTrace: CapturedTrace,
	    fireDomEvent: fireDomEvent,
	    fireGlobalEvent: fireGlobalEvent
	};
	};

	},{"./errors":12,"./util":36}],10:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise) {
	function returner() {
	    return this.value;
	}
	function thrower() {
	    throw this.reason;
	}

	Promise.prototype["return"] =
	Promise.prototype.thenReturn = function (value) {
	    if (value instanceof Promise) value.suppressUnhandledRejections();
	    return this._then(
	        returner, undefined, undefined, {value: value}, undefined);
	};

	Promise.prototype["throw"] =
	Promise.prototype.thenThrow = function (reason) {
	    return this._then(
	        thrower, undefined, undefined, {reason: reason}, undefined);
	};

	Promise.prototype.catchThrow = function (reason) {
	    if (arguments.length <= 1) {
	        return this._then(
	            undefined, thrower, undefined, {reason: reason}, undefined);
	    } else {
	        var _reason = arguments[1];
	        var handler = function() {throw _reason;};
	        return this.caught(reason, handler);
	    }
	};

	Promise.prototype.catchReturn = function (value) {
	    if (arguments.length <= 1) {
	        if (value instanceof Promise) value.suppressUnhandledRejections();
	        return this._then(
	            undefined, returner, undefined, {value: value}, undefined);
	    } else {
	        var _value = arguments[1];
	        if (_value instanceof Promise) _value.suppressUnhandledRejections();
	        var handler = function() {return _value;};
	        return this.caught(value, handler);
	    }
	};
	};

	},{}],11:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL) {
	var PromiseReduce = Promise.reduce;
	var PromiseAll = Promise.all;

	function promiseAllThis() {
	    return PromiseAll(this);
	}

	function PromiseMapSeries(promises, fn) {
	    return PromiseReduce(promises, fn, INTERNAL, INTERNAL);
	}

	Promise.prototype.each = function (fn) {
	    return this.mapSeries(fn)
	            ._then(promiseAllThis, undefined, undefined, this, undefined);
	};

	Promise.prototype.mapSeries = function (fn) {
	    return PromiseReduce(this, fn, INTERNAL, INTERNAL);
	};

	Promise.each = function (promises, fn) {
	    return PromiseMapSeries(promises, fn)
	            ._then(promiseAllThis, undefined, undefined, promises, undefined);
	};

	Promise.mapSeries = PromiseMapSeries;
	};

	},{}],12:[function(_dereq_,module,exports){
	"use strict";
	var es5 = _dereq_("./es5");
	var Objectfreeze = es5.freeze;
	var util = _dereq_("./util");
	var inherits = util.inherits;
	var notEnumerableProp = util.notEnumerableProp;

	function subError(nameProperty, defaultMessage) {
	    function SubError(message) {
	        if (!(this instanceof SubError)) return new SubError(message);
	        notEnumerableProp(this, "message",
	            typeof message === "string" ? message : defaultMessage);
	        notEnumerableProp(this, "name", nameProperty);
	        if (Error.captureStackTrace) {
	            Error.captureStackTrace(this, this.constructor);
	        } else {
	            Error.call(this);
	        }
	    }
	    inherits(SubError, Error);
	    return SubError;
	}

	var _TypeError, _RangeError;
	var Warning = subError("Warning", "warning");
	var CancellationError = subError("CancellationError", "cancellation error");
	var TimeoutError = subError("TimeoutError", "timeout error");
	var AggregateError = subError("AggregateError", "aggregate error");
	try {
	    _TypeError = TypeError;
	    _RangeError = RangeError;
	} catch(e) {
	    _TypeError = subError("TypeError", "type error");
	    _RangeError = subError("RangeError", "range error");
	}

	var methods = ("join pop push shift unshift slice filter forEach some " +
	    "every map indexOf lastIndexOf reduce reduceRight sort reverse").split(" ");

	for (var i = 0; i < methods.length; ++i) {
	    if (typeof Array.prototype[methods[i]] === "function") {
	        AggregateError.prototype[methods[i]] = Array.prototype[methods[i]];
	    }
	}

	es5.defineProperty(AggregateError.prototype, "length", {
	    value: 0,
	    configurable: false,
	    writable: true,
	    enumerable: true
	});
	AggregateError.prototype["isOperational"] = true;
	var level = 0;
	AggregateError.prototype.toString = function() {
	    var indent = Array(level * 4 + 1).join(" ");
	    var ret = "\n" + indent + "AggregateError of:" + "\n";
	    level++;
	    indent = Array(level * 4 + 1).join(" ");
	    for (var i = 0; i < this.length; ++i) {
	        var str = this[i] === this ? "[Circular AggregateError]" : this[i] + "";
	        var lines = str.split("\n");
	        for (var j = 0; j < lines.length; ++j) {
	            lines[j] = indent + lines[j];
	        }
	        str = lines.join("\n");
	        ret += str + "\n";
	    }
	    level--;
	    return ret;
	};

	function OperationalError(message) {
	    if (!(this instanceof OperationalError))
	        return new OperationalError(message);
	    notEnumerableProp(this, "name", "OperationalError");
	    notEnumerableProp(this, "message", message);
	    this.cause = message;
	    this["isOperational"] = true;

	    if (message instanceof Error) {
	        notEnumerableProp(this, "message", message.message);
	        notEnumerableProp(this, "stack", message.stack);
	    } else if (Error.captureStackTrace) {
	        Error.captureStackTrace(this, this.constructor);
	    }

	}
	inherits(OperationalError, Error);

	var errorTypes = Error["__BluebirdErrorTypes__"];
	if (!errorTypes) {
	    errorTypes = Objectfreeze({
	        CancellationError: CancellationError,
	        TimeoutError: TimeoutError,
	        OperationalError: OperationalError,
	        RejectionError: OperationalError,
	        AggregateError: AggregateError
	    });
	    es5.defineProperty(Error, "__BluebirdErrorTypes__", {
	        value: errorTypes,
	        writable: false,
	        enumerable: false,
	        configurable: false
	    });
	}

	module.exports = {
	    Error: Error,
	    TypeError: _TypeError,
	    RangeError: _RangeError,
	    CancellationError: errorTypes.CancellationError,
	    OperationalError: errorTypes.OperationalError,
	    TimeoutError: errorTypes.TimeoutError,
	    AggregateError: errorTypes.AggregateError,
	    Warning: Warning
	};

	},{"./es5":13,"./util":36}],13:[function(_dereq_,module,exports){
	var isES5 = (function(){
	    "use strict";
	    return this === undefined;
	})();

	if (isES5) {
	    module.exports = {
	        freeze: Object.freeze,
	        defineProperty: Object.defineProperty,
	        getDescriptor: Object.getOwnPropertyDescriptor,
	        keys: Object.keys,
	        names: Object.getOwnPropertyNames,
	        getPrototypeOf: Object.getPrototypeOf,
	        isArray: Array.isArray,
	        isES5: isES5,
	        propertyIsWritable: function(obj, prop) {
	            var descriptor = Object.getOwnPropertyDescriptor(obj, prop);
	            return !!(!descriptor || descriptor.writable || descriptor.set);
	        }
	    };
	} else {
	    var has = {}.hasOwnProperty;
	    var str = {}.toString;
	    var proto = {}.constructor.prototype;

	    var ObjectKeys = function (o) {
	        var ret = [];
	        for (var key in o) {
	            if (has.call(o, key)) {
	                ret.push(key);
	            }
	        }
	        return ret;
	    };

	    var ObjectGetDescriptor = function(o, key) {
	        return {value: o[key]};
	    };

	    var ObjectDefineProperty = function (o, key, desc) {
	        o[key] = desc.value;
	        return o;
	    };

	    var ObjectFreeze = function (obj) {
	        return obj;
	    };

	    var ObjectGetPrototypeOf = function (obj) {
	        try {
	            return Object(obj).constructor.prototype;
	        }
	        catch (e) {
	            return proto;
	        }
	    };

	    var ArrayIsArray = function (obj) {
	        try {
	            return str.call(obj) === "[object Array]";
	        }
	        catch(e) {
	            return false;
	        }
	    };

	    module.exports = {
	        isArray: ArrayIsArray,
	        keys: ObjectKeys,
	        names: ObjectKeys,
	        defineProperty: ObjectDefineProperty,
	        getDescriptor: ObjectGetDescriptor,
	        freeze: ObjectFreeze,
	        getPrototypeOf: ObjectGetPrototypeOf,
	        isES5: isES5,
	        propertyIsWritable: function() {
	            return true;
	        }
	    };
	}

	},{}],14:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL) {
	var PromiseMap = Promise.map;

	Promise.prototype.filter = function (fn, options) {
	    return PromiseMap(this, fn, options, INTERNAL);
	};

	Promise.filter = function (promises, fn, options) {
	    return PromiseMap(promises, fn, options, INTERNAL);
	};
	};

	},{}],15:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, tryConvertToPromise) {
	var util = _dereq_("./util");
	var CancellationError = Promise.CancellationError;
	var errorObj = util.errorObj;

	function PassThroughHandlerContext(promise, type, handler) {
	    this.promise = promise;
	    this.type = type;
	    this.handler = handler;
	    this.called = false;
	    this.cancelPromise = null;
	}

	PassThroughHandlerContext.prototype.isFinallyHandler = function() {
	    return this.type === 0;
	};

	function FinallyHandlerCancelReaction(finallyHandler) {
	    this.finallyHandler = finallyHandler;
	}

	FinallyHandlerCancelReaction.prototype._resultCancelled = function() {
	    checkCancel(this.finallyHandler);
	};

	function checkCancel(ctx, reason) {
	    if (ctx.cancelPromise != null) {
	        if (arguments.length > 1) {
	            ctx.cancelPromise._reject(reason);
	        } else {
	            ctx.cancelPromise._cancel();
	        }
	        ctx.cancelPromise = null;
	        return true;
	    }
	    return false;
	}

	function succeed() {
	    return finallyHandler.call(this, this.promise._target()._settledValue());
	}
	function fail(reason) {
	    if (checkCancel(this, reason)) return;
	    errorObj.e = reason;
	    return errorObj;
	}
	function finallyHandler(reasonOrValue) {
	    var promise = this.promise;
	    var handler = this.handler;

	    if (!this.called) {
	        this.called = true;
	        var ret = this.isFinallyHandler()
	            ? handler.call(promise._boundValue())
	            : handler.call(promise._boundValue(), reasonOrValue);
	        if (ret !== undefined) {
	            promise._setReturnedNonUndefined();
	            var maybePromise = tryConvertToPromise(ret, promise);
	            if (maybePromise instanceof Promise) {
	                if (this.cancelPromise != null) {
	                    if (maybePromise.isCancelled()) {
	                        var reason =
	                            new CancellationError("late cancellation observer");
	                        promise._attachExtraTrace(reason);
	                        errorObj.e = reason;
	                        return errorObj;
	                    } else if (maybePromise.isPending()) {
	                        maybePromise._attachCancellationCallback(
	                            new FinallyHandlerCancelReaction(this));
	                    }
	                }
	                return maybePromise._then(
	                    succeed, fail, undefined, this, undefined);
	            }
	        }
	    }

	    if (promise.isRejected()) {
	        checkCancel(this);
	        errorObj.e = reasonOrValue;
	        return errorObj;
	    } else {
	        checkCancel(this);
	        return reasonOrValue;
	    }
	}

	Promise.prototype._passThrough = function(handler, type, success, fail) {
	    if (typeof handler !== "function") return this.then();
	    return this._then(success,
	                      fail,
	                      undefined,
	                      new PassThroughHandlerContext(this, type, handler),
	                      undefined);
	};

	Promise.prototype.lastly =
	Promise.prototype["finally"] = function (handler) {
	    return this._passThrough(handler,
	                             0,
	                             finallyHandler,
	                             finallyHandler);
	};

	Promise.prototype.tap = function (handler) {
	    return this._passThrough(handler, 1, finallyHandler);
	};

	return PassThroughHandlerContext;
	};

	},{"./util":36}],16:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise,
	                          apiRejection,
	                          INTERNAL,
	                          tryConvertToPromise,
	                          Proxyable,
	                          debug) {
	var errors = _dereq_("./errors");
	var TypeError = errors.TypeError;
	var util = _dereq_("./util");
	var errorObj = util.errorObj;
	var tryCatch = util.tryCatch;
	var yieldHandlers = [];

	function promiseFromYieldHandler(value, yieldHandlers, traceParent) {
	    for (var i = 0; i < yieldHandlers.length; ++i) {
	        traceParent._pushContext();
	        var result = tryCatch(yieldHandlers[i])(value);
	        traceParent._popContext();
	        if (result === errorObj) {
	            traceParent._pushContext();
	            var ret = Promise.reject(errorObj.e);
	            traceParent._popContext();
	            return ret;
	        }
	        var maybePromise = tryConvertToPromise(result, traceParent);
	        if (maybePromise instanceof Promise) return maybePromise;
	    }
	    return null;
	}

	function PromiseSpawn(generatorFunction, receiver, yieldHandler, stack) {
	    if (debug.cancellation()) {
	        var internal = new Promise(INTERNAL);
	        var _finallyPromise = this._finallyPromise = new Promise(INTERNAL);
	        this._promise = internal.lastly(function() {
	            return _finallyPromise;
	        });
	        internal._captureStackTrace();
	        internal._setOnCancel(this);
	    } else {
	        var promise = this._promise = new Promise(INTERNAL);
	        promise._captureStackTrace();
	    }
	    this._stack = stack;
	    this._generatorFunction = generatorFunction;
	    this._receiver = receiver;
	    this._generator = undefined;
	    this._yieldHandlers = typeof yieldHandler === "function"
	        ? [yieldHandler].concat(yieldHandlers)
	        : yieldHandlers;
	    this._yieldedPromise = null;
	    this._cancellationPhase = false;
	}
	util.inherits(PromiseSpawn, Proxyable);

	PromiseSpawn.prototype._isResolved = function() {
	    return this._promise === null;
	};

	PromiseSpawn.prototype._cleanup = function() {
	    this._promise = this._generator = null;
	    if (debug.cancellation() && this._finallyPromise !== null) {
	        this._finallyPromise._fulfill();
	        this._finallyPromise = null;
	    }
	};

	PromiseSpawn.prototype._promiseCancelled = function() {
	    if (this._isResolved()) return;
	    var implementsReturn = typeof this._generator["return"] !== "undefined";

	    var result;
	    if (!implementsReturn) {
	        var reason = new Promise.CancellationError(
	            "generator .return() sentinel");
	        Promise.coroutine.returnSentinel = reason;
	        this._promise._attachExtraTrace(reason);
	        this._promise._pushContext();
	        result = tryCatch(this._generator["throw"]).call(this._generator,
	                                                         reason);
	        this._promise._popContext();
	    } else {
	        this._promise._pushContext();
	        result = tryCatch(this._generator["return"]).call(this._generator,
	                                                          undefined);
	        this._promise._popContext();
	    }
	    this._cancellationPhase = true;
	    this._yieldedPromise = null;
	    this._continue(result);
	};

	PromiseSpawn.prototype._promiseFulfilled = function(value) {
	    this._yieldedPromise = null;
	    this._promise._pushContext();
	    var result = tryCatch(this._generator.next).call(this._generator, value);
	    this._promise._popContext();
	    this._continue(result);
	};

	PromiseSpawn.prototype._promiseRejected = function(reason) {
	    this._yieldedPromise = null;
	    this._promise._attachExtraTrace(reason);
	    this._promise._pushContext();
	    var result = tryCatch(this._generator["throw"])
	        .call(this._generator, reason);
	    this._promise._popContext();
	    this._continue(result);
	};

	PromiseSpawn.prototype._resultCancelled = function() {
	    if (this._yieldedPromise instanceof Promise) {
	        var promise = this._yieldedPromise;
	        this._yieldedPromise = null;
	        promise.cancel();
	    }
	};

	PromiseSpawn.prototype.promise = function () {
	    return this._promise;
	};

	PromiseSpawn.prototype._run = function () {
	    this._generator = this._generatorFunction.call(this._receiver);
	    this._receiver =
	        this._generatorFunction = undefined;
	    this._promiseFulfilled(undefined);
	};

	PromiseSpawn.prototype._continue = function (result) {
	    var promise = this._promise;
	    if (result === errorObj) {
	        this._cleanup();
	        if (this._cancellationPhase) {
	            return promise.cancel();
	        } else {
	            return promise._rejectCallback(result.e, false);
	        }
	    }

	    var value = result.value;
	    if (result.done === true) {
	        this._cleanup();
	        if (this._cancellationPhase) {
	            return promise.cancel();
	        } else {
	            return promise._resolveCallback(value);
	        }
	    } else {
	        var maybePromise = tryConvertToPromise(value, this._promise);
	        if (!(maybePromise instanceof Promise)) {
	            maybePromise =
	                promiseFromYieldHandler(maybePromise,
	                                        this._yieldHandlers,
	                                        this._promise);
	            if (maybePromise === null) {
	                this._promiseRejected(
	                    new TypeError(
	                        "A value %s was yielded that could not be treated as a promise\u000a\u000a    See http://goo.gl/MqrFmX\u000a\u000a".replace("%s", value) +
	                        "From coroutine:\u000a" +
	                        this._stack.split("\n").slice(1, -7).join("\n")
	                    )
	                );
	                return;
	            }
	        }
	        maybePromise = maybePromise._target();
	        var bitField = maybePromise._bitField;
	        ;
	        if (((bitField & 50397184) === 0)) {
	            this._yieldedPromise = maybePromise;
	            maybePromise._proxy(this, null);
	        } else if (((bitField & 33554432) !== 0)) {
	            this._promiseFulfilled(maybePromise._value());
	        } else if (((bitField & 16777216) !== 0)) {
	            this._promiseRejected(maybePromise._reason());
	        } else {
	            this._promiseCancelled();
	        }
	    }
	};

	Promise.coroutine = function (generatorFunction, options) {
	    if (typeof generatorFunction !== "function") {
	        throw new TypeError("generatorFunction must be a function\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    var yieldHandler = Object(options).yieldHandler;
	    var PromiseSpawn$ = PromiseSpawn;
	    var stack = new Error().stack;
	    return function () {
	        var generator = generatorFunction.apply(this, arguments);
	        var spawn = new PromiseSpawn$(undefined, undefined, yieldHandler,
	                                      stack);
	        var ret = spawn.promise();
	        spawn._generator = generator;
	        spawn._promiseFulfilled(undefined);
	        return ret;
	    };
	};

	Promise.coroutine.addYieldHandler = function(fn) {
	    if (typeof fn !== "function") {
	        throw new TypeError("expecting a function but got " + util.classString(fn));
	    }
	    yieldHandlers.push(fn);
	};

	Promise.spawn = function (generatorFunction) {
	    debug.deprecated("Promise.spawn()", "Promise.coroutine()");
	    if (typeof generatorFunction !== "function") {
	        return apiRejection("generatorFunction must be a function\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    var spawn = new PromiseSpawn(generatorFunction, this);
	    var ret = spawn.promise();
	    spawn._run(Promise.spawn);
	    return ret;
	};
	};

	},{"./errors":12,"./util":36}],17:[function(_dereq_,module,exports){
	"use strict";
	module.exports =
	function(Promise, PromiseArray, tryConvertToPromise, INTERNAL) {
	var util = _dereq_("./util");
	var canEvaluate = util.canEvaluate;
	var tryCatch = util.tryCatch;
	var errorObj = util.errorObj;
	var reject;

	if (false) {
	if (canEvaluate) {
	    var thenCallback = function(i) {
	        return new Function("value", "holder", "                             \n\
	            'use strict';                                                    \n\
	            holder.pIndex = value;                                           \n\
	            holder.checkFulfillment(this);                                   \n\
	            ".replace(/Index/g, i));
	    };

	    var promiseSetter = function(i) {
	        return new Function("promise", "holder", "                           \n\
	            'use strict';                                                    \n\
	            holder.pIndex = promise;                                         \n\
	            ".replace(/Index/g, i));
	    };

	    var generateHolderClass = function(total) {
	        var props = new Array(total);
	        for (var i = 0; i < props.length; ++i) {
	            props[i] = "this.p" + (i+1);
	        }
	        var assignment = props.join(" = ") + " = null;";
	        var cancellationCode= "var promise;\n" + props.map(function(prop) {
	            return "                                                         \n\
	                promise = " + prop + ";                                      \n\
	                if (promise instanceof Promise) {                            \n\
	                    promise.cancel();                                        \n\
	                }                                                            \n\
	            ";
	        }).join("\n");
	        var passedArguments = props.join(", ");
	        var name = "Holder$" + total;


	        var code = "return function(tryCatch, errorObj, Promise) {           \n\
	            'use strict';                                                    \n\
	            function [TheName](fn) {                                         \n\
	                [TheProperties]                                              \n\
	                this.fn = fn;                                                \n\
	                this.now = 0;                                                \n\
	            }                                                                \n\
	            [TheName].prototype.checkFulfillment = function(promise) {       \n\
	                var now = ++this.now;                                        \n\
	                if (now === [TheTotal]) {                                    \n\
	                    promise._pushContext();                                  \n\
	                    var callback = this.fn;                                  \n\
	                    var ret = tryCatch(callback)([ThePassedArguments]);      \n\
	                    promise._popContext();                                   \n\
	                    if (ret === errorObj) {                                  \n\
	                        promise._rejectCallback(ret.e, false);               \n\
	                    } else {                                                 \n\
	                        promise._resolveCallback(ret);                       \n\
	                    }                                                        \n\
	                }                                                            \n\
	            };                                                               \n\
	                                                                             \n\
	            [TheName].prototype._resultCancelled = function() {              \n\
	                [CancellationCode]                                           \n\
	            };                                                               \n\
	                                                                             \n\
	            return [TheName];                                                \n\
	        }(tryCatch, errorObj, Promise);                                      \n\
	        ";

	        code = code.replace(/\[TheName\]/g, name)
	            .replace(/\[TheTotal\]/g, total)
	            .replace(/\[ThePassedArguments\]/g, passedArguments)
	            .replace(/\[TheProperties\]/g, assignment)
	            .replace(/\[CancellationCode\]/g, cancellationCode);

	        return new Function("tryCatch", "errorObj", "Promise", code)
	                           (tryCatch, errorObj, Promise);
	    };

	    var holderClasses = [];
	    var thenCallbacks = [];
	    var promiseSetters = [];

	    for (var i = 0; i < 8; ++i) {
	        holderClasses.push(generateHolderClass(i + 1));
	        thenCallbacks.push(thenCallback(i + 1));
	        promiseSetters.push(promiseSetter(i + 1));
	    }

	    reject = function (reason) {
	        this._reject(reason);
	    };
	}}

	Promise.join = function () {
	    var last = arguments.length - 1;
	    var fn;
	    if (last > 0 && typeof arguments[last] === "function") {
	        fn = arguments[last];
	        if (false) {
	            if (last <= 8 && canEvaluate) {
	                var ret = new Promise(INTERNAL);
	                ret._captureStackTrace();
	                var HolderClass = holderClasses[last - 1];
	                var holder = new HolderClass(fn);
	                var callbacks = thenCallbacks;

	                for (var i = 0; i < last; ++i) {
	                    var maybePromise = tryConvertToPromise(arguments[i], ret);
	                    if (maybePromise instanceof Promise) {
	                        maybePromise = maybePromise._target();
	                        var bitField = maybePromise._bitField;
	                        ;
	                        if (((bitField & 50397184) === 0)) {
	                            maybePromise._then(callbacks[i], reject,
	                                               undefined, ret, holder);
	                            promiseSetters[i](maybePromise, holder);
	                        } else if (((bitField & 33554432) !== 0)) {
	                            callbacks[i].call(ret,
	                                              maybePromise._value(), holder);
	                        } else if (((bitField & 16777216) !== 0)) {
	                            ret._reject(maybePromise._reason());
	                        } else {
	                            ret._cancel();
	                        }
	                    } else {
	                        callbacks[i].call(ret, maybePromise, holder);
	                    }
	                }
	                if (!ret._isFateSealed()) {
	                    ret._setAsyncGuaranteed();
	                    ret._setOnCancel(holder);
	                }
	                return ret;
	            }
	        }
	    }
	    var args = [].slice.call(arguments);;
	    if (fn) args.pop();
	    var ret = new PromiseArray(args).promise();
	    return fn !== undefined ? ret.spread(fn) : ret;
	};

	};

	},{"./util":36}],18:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise,
	                          PromiseArray,
	                          apiRejection,
	                          tryConvertToPromise,
	                          INTERNAL,
	                          debug) {
	var getDomain = Promise._getDomain;
	var util = _dereq_("./util");
	var tryCatch = util.tryCatch;
	var errorObj = util.errorObj;
	var EMPTY_ARRAY = [];

	function MappingPromiseArray(promises, fn, limit, _filter) {
	    this.constructor$(promises);
	    this._promise._captureStackTrace();
	    var domain = getDomain();
	    this._callback = domain === null ? fn : domain.bind(fn);
	    this._preservedValues = _filter === INTERNAL
	        ? new Array(this.length())
	        : null;
	    this._limit = limit;
	    this._inFlight = 0;
	    this._queue = limit >= 1 ? [] : EMPTY_ARRAY;
	    this._init$(undefined, -2);
	}
	util.inherits(MappingPromiseArray, PromiseArray);

	MappingPromiseArray.prototype._init = function () {};

	MappingPromiseArray.prototype._promiseFulfilled = function (value, index) {
	    var values = this._values;
	    var length = this.length();
	    var preservedValues = this._preservedValues;
	    var limit = this._limit;

	    if (index < 0) {
	        index = (index * -1) - 1;
	        values[index] = value;
	        if (limit >= 1) {
	            this._inFlight--;
	            this._drainQueue();
	            if (this._isResolved()) return true;
	        }
	    } else {
	        if (limit >= 1 && this._inFlight >= limit) {
	            values[index] = value;
	            this._queue.push(index);
	            return false;
	        }
	        if (preservedValues !== null) preservedValues[index] = value;

	        var promise = this._promise;
	        var callback = this._callback;
	        var receiver = promise._boundValue();
	        promise._pushContext();
	        var ret = tryCatch(callback).call(receiver, value, index, length);
	        var promiseCreated = promise._popContext();
	        debug.checkForgottenReturns(
	            ret,
	            promiseCreated,
	            preservedValues !== null ? "Promise.filter" : "Promise.map",
	            promise
	        );
	        if (ret === errorObj) {
	            this._reject(ret.e);
	            return true;
	        }

	        var maybePromise = tryConvertToPromise(ret, this._promise);
	        if (maybePromise instanceof Promise) {
	            maybePromise = maybePromise._target();
	            var bitField = maybePromise._bitField;
	            ;
	            if (((bitField & 50397184) === 0)) {
	                if (limit >= 1) this._inFlight++;
	                values[index] = maybePromise;
	                maybePromise._proxy(this, (index + 1) * -1);
	                return false;
	            } else if (((bitField & 33554432) !== 0)) {
	                ret = maybePromise._value();
	            } else if (((bitField & 16777216) !== 0)) {
	                this._reject(maybePromise._reason());
	                return true;
	            } else {
	                this._cancel();
	                return true;
	            }
	        }
	        values[index] = ret;
	    }
	    var totalResolved = ++this._totalResolved;
	    if (totalResolved >= length) {
	        if (preservedValues !== null) {
	            this._filter(values, preservedValues);
	        } else {
	            this._resolve(values);
	        }
	        return true;
	    }
	    return false;
	};

	MappingPromiseArray.prototype._drainQueue = function () {
	    var queue = this._queue;
	    var limit = this._limit;
	    var values = this._values;
	    while (queue.length > 0 && this._inFlight < limit) {
	        if (this._isResolved()) return;
	        var index = queue.pop();
	        this._promiseFulfilled(values[index], index);
	    }
	};

	MappingPromiseArray.prototype._filter = function (booleans, values) {
	    var len = values.length;
	    var ret = new Array(len);
	    var j = 0;
	    for (var i = 0; i < len; ++i) {
	        if (booleans[i]) ret[j++] = values[i];
	    }
	    ret.length = j;
	    this._resolve(ret);
	};

	MappingPromiseArray.prototype.preservedValues = function () {
	    return this._preservedValues;
	};

	function map(promises, fn, options, _filter) {
	    if (typeof fn !== "function") {
	        return apiRejection("expecting a function but got " + util.classString(fn));
	    }
	    var limit = typeof options === "object" && options !== null
	        ? options.concurrency
	        : 0;
	    limit = typeof limit === "number" &&
	        isFinite(limit) && limit >= 1 ? limit : 0;
	    return new MappingPromiseArray(promises, fn, limit, _filter).promise();
	}

	Promise.prototype.map = function (fn, options) {
	    return map(this, fn, options, null);
	};

	Promise.map = function (promises, fn, options, _filter) {
	    return map(promises, fn, options, _filter);
	};


	};

	},{"./util":36}],19:[function(_dereq_,module,exports){
	"use strict";
	module.exports =
	function(Promise, INTERNAL, tryConvertToPromise, apiRejection, debug) {
	var util = _dereq_("./util");
	var tryCatch = util.tryCatch;

	Promise.method = function (fn) {
	    if (typeof fn !== "function") {
	        throw new Promise.TypeError("expecting a function but got " + util.classString(fn));
	    }
	    return function () {
	        var ret = new Promise(INTERNAL);
	        ret._captureStackTrace();
	        ret._pushContext();
	        var value = tryCatch(fn).apply(this, arguments);
	        var promiseCreated = ret._popContext();
	        debug.checkForgottenReturns(
	            value, promiseCreated, "Promise.method", ret);
	        ret._resolveFromSyncValue(value);
	        return ret;
	    };
	};

	Promise.attempt = Promise["try"] = function (fn) {
	    if (typeof fn !== "function") {
	        return apiRejection("expecting a function but got " + util.classString(fn));
	    }
	    var ret = new Promise(INTERNAL);
	    ret._captureStackTrace();
	    ret._pushContext();
	    var value;
	    if (arguments.length > 1) {
	        debug.deprecated("calling Promise.try with more than 1 argument");
	        var arg = arguments[1];
	        var ctx = arguments[2];
	        value = util.isArray(arg) ? tryCatch(fn).apply(ctx, arg)
	                                  : tryCatch(fn).call(ctx, arg);
	    } else {
	        value = tryCatch(fn)();
	    }
	    var promiseCreated = ret._popContext();
	    debug.checkForgottenReturns(
	        value, promiseCreated, "Promise.try", ret);
	    ret._resolveFromSyncValue(value);
	    return ret;
	};

	Promise.prototype._resolveFromSyncValue = function (value) {
	    if (value === util.errorObj) {
	        this._rejectCallback(value.e, false);
	    } else {
	        this._resolveCallback(value, true);
	    }
	};
	};

	},{"./util":36}],20:[function(_dereq_,module,exports){
	"use strict";
	var util = _dereq_("./util");
	var maybeWrapAsError = util.maybeWrapAsError;
	var errors = _dereq_("./errors");
	var OperationalError = errors.OperationalError;
	var es5 = _dereq_("./es5");

	function isUntypedError(obj) {
	    return obj instanceof Error &&
	        es5.getPrototypeOf(obj) === Error.prototype;
	}

	var rErrorKey = /^(?:name|message|stack|cause)$/;
	function wrapAsOperationalError(obj) {
	    var ret;
	    if (isUntypedError(obj)) {
	        ret = new OperationalError(obj);
	        ret.name = obj.name;
	        ret.message = obj.message;
	        ret.stack = obj.stack;
	        var keys = es5.keys(obj);
	        for (var i = 0; i < keys.length; ++i) {
	            var key = keys[i];
	            if (!rErrorKey.test(key)) {
	                ret[key] = obj[key];
	            }
	        }
	        return ret;
	    }
	    util.markAsOriginatingFromRejection(obj);
	    return obj;
	}

	function nodebackForPromise(promise, multiArgs) {
	    return function(err, value) {
	        if (promise === null) return;
	        if (err) {
	            var wrapped = wrapAsOperationalError(maybeWrapAsError(err));
	            promise._attachExtraTrace(wrapped);
	            promise._reject(wrapped);
	        } else if (!multiArgs) {
	            promise._fulfill(value);
	        } else {
	            var args = [].slice.call(arguments, 1);;
	            promise._fulfill(args);
	        }
	        promise = null;
	    };
	}

	module.exports = nodebackForPromise;

	},{"./errors":12,"./es5":13,"./util":36}],21:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise) {
	var util = _dereq_("./util");
	var async = Promise._async;
	var tryCatch = util.tryCatch;
	var errorObj = util.errorObj;

	function spreadAdapter(val, nodeback) {
	    var promise = this;
	    if (!util.isArray(val)) return successAdapter.call(promise, val, nodeback);
	    var ret =
	        tryCatch(nodeback).apply(promise._boundValue(), [null].concat(val));
	    if (ret === errorObj) {
	        async.throwLater(ret.e);
	    }
	}

	function successAdapter(val, nodeback) {
	    var promise = this;
	    var receiver = promise._boundValue();
	    var ret = val === undefined
	        ? tryCatch(nodeback).call(receiver, null)
	        : tryCatch(nodeback).call(receiver, null, val);
	    if (ret === errorObj) {
	        async.throwLater(ret.e);
	    }
	}
	function errorAdapter(reason, nodeback) {
	    var promise = this;
	    if (!reason) {
	        var newReason = new Error(reason + "");
	        newReason.cause = reason;
	        reason = newReason;
	    }
	    var ret = tryCatch(nodeback).call(promise._boundValue(), reason);
	    if (ret === errorObj) {
	        async.throwLater(ret.e);
	    }
	}

	Promise.prototype.asCallback = Promise.prototype.nodeify = function (nodeback,
	                                                                     options) {
	    if (typeof nodeback == "function") {
	        var adapter = successAdapter;
	        if (options !== undefined && Object(options).spread) {
	            adapter = spreadAdapter;
	        }
	        this._then(
	            adapter,
	            errorAdapter,
	            undefined,
	            this,
	            nodeback
	        );
	    }
	    return this;
	};
	};

	},{"./util":36}],22:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function() {
	var makeSelfResolutionError = function () {
	    return new TypeError("circular promise resolution chain\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	};
	var reflectHandler = function() {
	    return new Promise.PromiseInspection(this._target());
	};
	var apiRejection = function(msg) {
	    return Promise.reject(new TypeError(msg));
	};
	function Proxyable() {}
	var UNDEFINED_BINDING = {};
	var util = _dereq_("./util");

	var getDomain;
	if (util.isNode) {
	    getDomain = function() {
	        var ret = process.domain;
	        if (ret === undefined) ret = null;
	        return ret;
	    };
	} else {
	    getDomain = function() {
	        return null;
	    };
	}
	util.notEnumerableProp(Promise, "_getDomain", getDomain);

	var es5 = _dereq_("./es5");
	var Async = _dereq_("./async");
	var async = new Async();
	es5.defineProperty(Promise, "_async", {value: async});
	var errors = _dereq_("./errors");
	var TypeError = Promise.TypeError = errors.TypeError;
	Promise.RangeError = errors.RangeError;
	var CancellationError = Promise.CancellationError = errors.CancellationError;
	Promise.TimeoutError = errors.TimeoutError;
	Promise.OperationalError = errors.OperationalError;
	Promise.RejectionError = errors.OperationalError;
	Promise.AggregateError = errors.AggregateError;
	var INTERNAL = function(){};
	var APPLY = {};
	var NEXT_FILTER = {};
	var tryConvertToPromise = _dereq_("./thenables")(Promise, INTERNAL);
	var PromiseArray =
	    _dereq_("./promise_array")(Promise, INTERNAL,
	                               tryConvertToPromise, apiRejection, Proxyable);
	var Context = _dereq_("./context")(Promise);
	 /*jshint unused:false*/
	var createContext = Context.create;
	var debug = _dereq_("./debuggability")(Promise, Context);
	var CapturedTrace = debug.CapturedTrace;
	var PassThroughHandlerContext =
	    _dereq_("./finally")(Promise, tryConvertToPromise);
	var catchFilter = _dereq_("./catch_filter")(NEXT_FILTER);
	var nodebackForPromise = _dereq_("./nodeback");
	var errorObj = util.errorObj;
	var tryCatch = util.tryCatch;
	function check(self, executor) {
	    if (typeof executor !== "function") {
	        throw new TypeError("expecting a function but got " + util.classString(executor));
	    }
	    if (self.constructor !== Promise) {
	        throw new TypeError("the promise constructor cannot be invoked directly\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	}

	function Promise(executor) {
	    this._bitField = 0;
	    this._fulfillmentHandler0 = undefined;
	    this._rejectionHandler0 = undefined;
	    this._promise0 = undefined;
	    this._receiver0 = undefined;
	    if (executor !== INTERNAL) {
	        check(this, executor);
	        this._resolveFromExecutor(executor);
	    }
	    this._promiseCreated();
	    this._fireEvent("promiseCreated", this);
	}

	Promise.prototype.toString = function () {
	    return "[object Promise]";
	};

	Promise.prototype.caught = Promise.prototype["catch"] = function (fn) {
	    var len = arguments.length;
	    if (len > 1) {
	        var catchInstances = new Array(len - 1),
	            j = 0, i;
	        for (i = 0; i < len - 1; ++i) {
	            var item = arguments[i];
	            if (util.isObject(item)) {
	                catchInstances[j++] = item;
	            } else {
	                return apiRejection("expecting an object but got " + util.classString(item));
	            }
	        }
	        catchInstances.length = j;
	        fn = arguments[i];
	        return this.then(undefined, catchFilter(catchInstances, fn, this));
	    }
	    return this.then(undefined, fn);
	};

	Promise.prototype.reflect = function () {
	    return this._then(reflectHandler,
	        reflectHandler, undefined, this, undefined);
	};

	Promise.prototype.then = function (didFulfill, didReject) {
	    if (debug.warnings() && arguments.length > 0 &&
	        typeof didFulfill !== "function" &&
	        typeof didReject !== "function") {
	        var msg = ".then() only accepts functions but was passed: " +
	                util.classString(didFulfill);
	        if (arguments.length > 1) {
	            msg += ", " + util.classString(didReject);
	        }
	        this._warn(msg);
	    }
	    return this._then(didFulfill, didReject, undefined, undefined, undefined);
	};

	Promise.prototype.done = function (didFulfill, didReject) {
	    var promise =
	        this._then(didFulfill, didReject, undefined, undefined, undefined);
	    promise._setIsFinal();
	};

	Promise.prototype.spread = function (fn) {
	    if (typeof fn !== "function") {
	        return apiRejection("expecting a function but got " + util.classString(fn));
	    }
	    return this.all()._then(fn, undefined, undefined, APPLY, undefined);
	};

	Promise.prototype.toJSON = function () {
	    var ret = {
	        isFulfilled: false,
	        isRejected: false,
	        fulfillmentValue: undefined,
	        rejectionReason: undefined
	    };
	    if (this.isFulfilled()) {
	        ret.fulfillmentValue = this.value();
	        ret.isFulfilled = true;
	    } else if (this.isRejected()) {
	        ret.rejectionReason = this.reason();
	        ret.isRejected = true;
	    }
	    return ret;
	};

	Promise.prototype.all = function () {
	    if (arguments.length > 0) {
	        this._warn(".all() was passed arguments but it does not take any");
	    }
	    return new PromiseArray(this).promise();
	};

	Promise.prototype.error = function (fn) {
	    return this.caught(util.originatesFromRejection, fn);
	};

	Promise.is = function (val) {
	    return val instanceof Promise;
	};

	Promise.fromNode = Promise.fromCallback = function(fn) {
	    var ret = new Promise(INTERNAL);
	    ret._captureStackTrace();
	    var multiArgs = arguments.length > 1 ? !!Object(arguments[1]).multiArgs
	                                         : false;
	    var result = tryCatch(fn)(nodebackForPromise(ret, multiArgs));
	    if (result === errorObj) {
	        ret._rejectCallback(result.e, true);
	    }
	    if (!ret._isFateSealed()) ret._setAsyncGuaranteed();
	    return ret;
	};

	Promise.all = function (promises) {
	    return new PromiseArray(promises).promise();
	};

	Promise.cast = function (obj) {
	    var ret = tryConvertToPromise(obj);
	    if (!(ret instanceof Promise)) {
	        ret = new Promise(INTERNAL);
	        ret._captureStackTrace();
	        ret._setFulfilled();
	        ret._rejectionHandler0 = obj;
	    }
	    return ret;
	};

	Promise.resolve = Promise.fulfilled = Promise.cast;

	Promise.reject = Promise.rejected = function (reason) {
	    var ret = new Promise(INTERNAL);
	    ret._captureStackTrace();
	    ret._rejectCallback(reason, true);
	    return ret;
	};

	Promise.setScheduler = function(fn) {
	    if (typeof fn !== "function") {
	        throw new TypeError("expecting a function but got " + util.classString(fn));
	    }
	    return async.setScheduler(fn);
	};

	Promise.prototype._then = function (
	    didFulfill,
	    didReject,
	    _,    receiver,
	    internalData
	) {
	    var haveInternalData = internalData !== undefined;
	    var promise = haveInternalData ? internalData : new Promise(INTERNAL);
	    var target = this._target();
	    var bitField = target._bitField;

	    if (!haveInternalData) {
	        promise._propagateFrom(this, 3);
	        promise._captureStackTrace();
	        if (receiver === undefined &&
	            ((this._bitField & 2097152) !== 0)) {
	            if (!((bitField & 50397184) === 0)) {
	                receiver = this._boundValue();
	            } else {
	                receiver = target === this ? undefined : this._boundTo;
	            }
	        }
	        this._fireEvent("promiseChained", this, promise);
	    }

	    var domain = getDomain();
	    if (!((bitField & 50397184) === 0)) {
	        var handler, value, settler = target._settlePromiseCtx;
	        if (((bitField & 33554432) !== 0)) {
	            value = target._rejectionHandler0;
	            handler = didFulfill;
	        } else if (((bitField & 16777216) !== 0)) {
	            value = target._fulfillmentHandler0;
	            handler = didReject;
	            target._unsetRejectionIsUnhandled();
	        } else {
	            settler = target._settlePromiseLateCancellationObserver;
	            value = new CancellationError("late cancellation observer");
	            target._attachExtraTrace(value);
	            handler = didReject;
	        }

	        async.invoke(settler, target, {
	            handler: domain === null ? handler
	                : (typeof handler === "function" && domain.bind(handler)),
	            promise: promise,
	            receiver: receiver,
	            value: value
	        });
	    } else {
	        target._addCallbacks(didFulfill, didReject, promise, receiver, domain);
	    }

	    return promise;
	};

	Promise.prototype._length = function () {
	    return this._bitField & 65535;
	};

	Promise.prototype._isFateSealed = function () {
	    return (this._bitField & 117506048) !== 0;
	};

	Promise.prototype._isFollowing = function () {
	    return (this._bitField & 67108864) === 67108864;
	};

	Promise.prototype._setLength = function (len) {
	    this._bitField = (this._bitField & -65536) |
	        (len & 65535);
	};

	Promise.prototype._setFulfilled = function () {
	    this._bitField = this._bitField | 33554432;
	    this._fireEvent("promiseFulfilled", this);
	};

	Promise.prototype._setRejected = function () {
	    this._bitField = this._bitField | 16777216;
	    this._fireEvent("promiseRejected", this);
	};

	Promise.prototype._setFollowing = function () {
	    this._bitField = this._bitField | 67108864;
	    this._fireEvent("promiseResolved", this);
	};

	Promise.prototype._setIsFinal = function () {
	    this._bitField = this._bitField | 4194304;
	};

	Promise.prototype._isFinal = function () {
	    return (this._bitField & 4194304) > 0;
	};

	Promise.prototype._unsetCancelled = function() {
	    this._bitField = this._bitField & (~65536);
	};

	Promise.prototype._setCancelled = function() {
	    this._bitField = this._bitField | 65536;
	    this._fireEvent("promiseCancelled", this);
	};

	Promise.prototype._setAsyncGuaranteed = function() {
	    if (async.hasCustomScheduler()) return;
	    this._bitField = this._bitField | 134217728;
	};

	Promise.prototype._receiverAt = function (index) {
	    var ret = index === 0 ? this._receiver0 : this[
	            index * 4 - 4 + 3];
	    if (ret === UNDEFINED_BINDING) {
	        return undefined;
	    } else if (ret === undefined && this._isBound()) {
	        return this._boundValue();
	    }
	    return ret;
	};

	Promise.prototype._promiseAt = function (index) {
	    return this[
	            index * 4 - 4 + 2];
	};

	Promise.prototype._fulfillmentHandlerAt = function (index) {
	    return this[
	            index * 4 - 4 + 0];
	};

	Promise.prototype._rejectionHandlerAt = function (index) {
	    return this[
	            index * 4 - 4 + 1];
	};

	Promise.prototype._boundValue = function() {};

	Promise.prototype._migrateCallback0 = function (follower) {
	    var bitField = follower._bitField;
	    var fulfill = follower._fulfillmentHandler0;
	    var reject = follower._rejectionHandler0;
	    var promise = follower._promise0;
	    var receiver = follower._receiverAt(0);
	    if (receiver === undefined) receiver = UNDEFINED_BINDING;
	    this._addCallbacks(fulfill, reject, promise, receiver, null);
	};

	Promise.prototype._migrateCallbackAt = function (follower, index) {
	    var fulfill = follower._fulfillmentHandlerAt(index);
	    var reject = follower._rejectionHandlerAt(index);
	    var promise = follower._promiseAt(index);
	    var receiver = follower._receiverAt(index);
	    if (receiver === undefined) receiver = UNDEFINED_BINDING;
	    this._addCallbacks(fulfill, reject, promise, receiver, null);
	};

	Promise.prototype._addCallbacks = function (
	    fulfill,
	    reject,
	    promise,
	    receiver,
	    domain
	) {
	    var index = this._length();

	    if (index >= 65535 - 4) {
	        index = 0;
	        this._setLength(0);
	    }

	    if (index === 0) {
	        this._promise0 = promise;
	        this._receiver0 = receiver;
	        if (typeof fulfill === "function") {
	            this._fulfillmentHandler0 =
	                domain === null ? fulfill : domain.bind(fulfill);
	        }
	        if (typeof reject === "function") {
	            this._rejectionHandler0 =
	                domain === null ? reject : domain.bind(reject);
	        }
	    } else {
	        var base = index * 4 - 4;
	        this[base + 2] = promise;
	        this[base + 3] = receiver;
	        if (typeof fulfill === "function") {
	            this[base + 0] =
	                domain === null ? fulfill : domain.bind(fulfill);
	        }
	        if (typeof reject === "function") {
	            this[base + 1] =
	                domain === null ? reject : domain.bind(reject);
	        }
	    }
	    this._setLength(index + 1);
	    return index;
	};

	Promise.prototype._proxy = function (proxyable, arg) {
	    this._addCallbacks(undefined, undefined, arg, proxyable, null);
	};

	Promise.prototype._resolveCallback = function(value, shouldBind) {
	    if (((this._bitField & 117506048) !== 0)) return;
	    if (value === this)
	        return this._rejectCallback(makeSelfResolutionError(), false);
	    var maybePromise = tryConvertToPromise(value, this);
	    if (!(maybePromise instanceof Promise)) return this._fulfill(value);

	    if (shouldBind) this._propagateFrom(maybePromise, 2);

	    var promise = maybePromise._target();

	    if (promise === this) {
	        this._reject(makeSelfResolutionError());
	        return;
	    }

	    var bitField = promise._bitField;
	    if (((bitField & 50397184) === 0)) {
	        var len = this._length();
	        if (len > 0) promise._migrateCallback0(this);
	        for (var i = 1; i < len; ++i) {
	            promise._migrateCallbackAt(this, i);
	        }
	        this._setFollowing();
	        this._setLength(0);
	        this._setFollowee(promise);
	    } else if (((bitField & 33554432) !== 0)) {
	        this._fulfill(promise._value());
	    } else if (((bitField & 16777216) !== 0)) {
	        this._reject(promise._reason());
	    } else {
	        var reason = new CancellationError("late cancellation observer");
	        promise._attachExtraTrace(reason);
	        this._reject(reason);
	    }
	};

	Promise.prototype._rejectCallback =
	function(reason, synchronous, ignoreNonErrorWarnings) {
	    var trace = util.ensureErrorObject(reason);
	    var hasStack = trace === reason;
	    if (!hasStack && !ignoreNonErrorWarnings && debug.warnings()) {
	        var message = "a promise was rejected with a non-error: " +
	            util.classString(reason);
	        this._warn(message, true);
	    }
	    this._attachExtraTrace(trace, synchronous ? hasStack : false);
	    this._reject(reason);
	};

	Promise.prototype._resolveFromExecutor = function (executor) {
	    var promise = this;
	    this._captureStackTrace();
	    this._pushContext();
	    var synchronous = true;
	    var r = this._execute(executor, function(value) {
	        promise._resolveCallback(value);
	    }, function (reason) {
	        promise._rejectCallback(reason, synchronous);
	    });
	    synchronous = false;
	    this._popContext();

	    if (r !== undefined) {
	        promise._rejectCallback(r, true);
	    }
	};

	Promise.prototype._settlePromiseFromHandler = function (
	    handler, receiver, value, promise
	) {
	    var bitField = promise._bitField;
	    if (((bitField & 65536) !== 0)) return;
	    promise._pushContext();
	    var x;
	    if (receiver === APPLY) {
	        if (!value || typeof value.length !== "number") {
	            x = errorObj;
	            x.e = new TypeError("cannot .spread() a non-array: " +
	                                    util.classString(value));
	        } else {
	            x = tryCatch(handler).apply(this._boundValue(), value);
	        }
	    } else {
	        x = tryCatch(handler).call(receiver, value);
	    }
	    var promiseCreated = promise._popContext();
	    bitField = promise._bitField;
	    if (((bitField & 65536) !== 0)) return;

	    if (x === NEXT_FILTER) {
	        promise._reject(value);
	    } else if (x === errorObj) {
	        promise._rejectCallback(x.e, false);
	    } else {
	        debug.checkForgottenReturns(x, promiseCreated, "",  promise, this);
	        promise._resolveCallback(x);
	    }
	};

	Promise.prototype._target = function() {
	    var ret = this;
	    while (ret._isFollowing()) ret = ret._followee();
	    return ret;
	};

	Promise.prototype._followee = function() {
	    return this._rejectionHandler0;
	};

	Promise.prototype._setFollowee = function(promise) {
	    this._rejectionHandler0 = promise;
	};

	Promise.prototype._settlePromise = function(promise, handler, receiver, value) {
	    var isPromise = promise instanceof Promise;
	    var bitField = this._bitField;
	    var asyncGuaranteed = ((bitField & 134217728) !== 0);
	    if (((bitField & 65536) !== 0)) {
	        if (isPromise) promise._invokeInternalOnCancel();

	        if (receiver instanceof PassThroughHandlerContext &&
	            receiver.isFinallyHandler()) {
	            receiver.cancelPromise = promise;
	            if (tryCatch(handler).call(receiver, value) === errorObj) {
	                promise._reject(errorObj.e);
	            }
	        } else if (handler === reflectHandler) {
	            promise._fulfill(reflectHandler.call(receiver));
	        } else if (receiver instanceof Proxyable) {
	            receiver._promiseCancelled(promise);
	        } else if (isPromise || promise instanceof PromiseArray) {
	            promise._cancel();
	        } else {
	            receiver.cancel();
	        }
	    } else if (typeof handler === "function") {
	        if (!isPromise) {
	            handler.call(receiver, value, promise);
	        } else {
	            if (asyncGuaranteed) promise._setAsyncGuaranteed();
	            this._settlePromiseFromHandler(handler, receiver, value, promise);
	        }
	    } else if (receiver instanceof Proxyable) {
	        if (!receiver._isResolved()) {
	            if (((bitField & 33554432) !== 0)) {
	                receiver._promiseFulfilled(value, promise);
	            } else {
	                receiver._promiseRejected(value, promise);
	            }
	        }
	    } else if (isPromise) {
	        if (asyncGuaranteed) promise._setAsyncGuaranteed();
	        if (((bitField & 33554432) !== 0)) {
	            promise._fulfill(value);
	        } else {
	            promise._reject(value);
	        }
	    }
	};

	Promise.prototype._settlePromiseLateCancellationObserver = function(ctx) {
	    var handler = ctx.handler;
	    var promise = ctx.promise;
	    var receiver = ctx.receiver;
	    var value = ctx.value;
	    if (typeof handler === "function") {
	        if (!(promise instanceof Promise)) {
	            handler.call(receiver, value, promise);
	        } else {
	            this._settlePromiseFromHandler(handler, receiver, value, promise);
	        }
	    } else if (promise instanceof Promise) {
	        promise._reject(value);
	    }
	};

	Promise.prototype._settlePromiseCtx = function(ctx) {
	    this._settlePromise(ctx.promise, ctx.handler, ctx.receiver, ctx.value);
	};

	Promise.prototype._settlePromise0 = function(handler, value, bitField) {
	    var promise = this._promise0;
	    var receiver = this._receiverAt(0);
	    this._promise0 = undefined;
	    this._receiver0 = undefined;
	    this._settlePromise(promise, handler, receiver, value);
	};

	Promise.prototype._clearCallbackDataAtIndex = function(index) {
	    var base = index * 4 - 4;
	    this[base + 2] =
	    this[base + 3] =
	    this[base + 0] =
	    this[base + 1] = undefined;
	};

	Promise.prototype._fulfill = function (value) {
	    var bitField = this._bitField;
	    if (((bitField & 117506048) >>> 16)) return;
	    if (value === this) {
	        var err = makeSelfResolutionError();
	        this._attachExtraTrace(err);
	        return this._reject(err);
	    }
	    this._setFulfilled();
	    this._rejectionHandler0 = value;

	    if ((bitField & 65535) > 0) {
	        if (((bitField & 134217728) !== 0)) {
	            this._settlePromises();
	        } else {
	            async.settlePromises(this);
	        }
	    }
	};

	Promise.prototype._reject = function (reason) {
	    var bitField = this._bitField;
	    if (((bitField & 117506048) >>> 16)) return;
	    this._setRejected();
	    this._fulfillmentHandler0 = reason;

	    if (this._isFinal()) {
	        return async.fatalError(reason, util.isNode);
	    }

	    if ((bitField & 65535) > 0) {
	        async.settlePromises(this);
	    } else {
	        this._ensurePossibleRejectionHandled();
	    }
	};

	Promise.prototype._fulfillPromises = function (len, value) {
	    for (var i = 1; i < len; i++) {
	        var handler = this._fulfillmentHandlerAt(i);
	        var promise = this._promiseAt(i);
	        var receiver = this._receiverAt(i);
	        this._clearCallbackDataAtIndex(i);
	        this._settlePromise(promise, handler, receiver, value);
	    }
	};

	Promise.prototype._rejectPromises = function (len, reason) {
	    for (var i = 1; i < len; i++) {
	        var handler = this._rejectionHandlerAt(i);
	        var promise = this._promiseAt(i);
	        var receiver = this._receiverAt(i);
	        this._clearCallbackDataAtIndex(i);
	        this._settlePromise(promise, handler, receiver, reason);
	    }
	};

	Promise.prototype._settlePromises = function () {
	    var bitField = this._bitField;
	    var len = (bitField & 65535);

	    if (len > 0) {
	        if (((bitField & 16842752) !== 0)) {
	            var reason = this._fulfillmentHandler0;
	            this._settlePromise0(this._rejectionHandler0, reason, bitField);
	            this._rejectPromises(len, reason);
	        } else {
	            var value = this._rejectionHandler0;
	            this._settlePromise0(this._fulfillmentHandler0, value, bitField);
	            this._fulfillPromises(len, value);
	        }
	        this._setLength(0);
	    }
	    this._clearCancellationData();
	};

	Promise.prototype._settledValue = function() {
	    var bitField = this._bitField;
	    if (((bitField & 33554432) !== 0)) {
	        return this._rejectionHandler0;
	    } else if (((bitField & 16777216) !== 0)) {
	        return this._fulfillmentHandler0;
	    }
	};

	function deferResolve(v) {this.promise._resolveCallback(v);}
	function deferReject(v) {this.promise._rejectCallback(v, false);}

	Promise.defer = Promise.pending = function() {
	    debug.deprecated("Promise.defer", "new Promise");
	    var promise = new Promise(INTERNAL);
	    return {
	        promise: promise,
	        resolve: deferResolve,
	        reject: deferReject
	    };
	};

	util.notEnumerableProp(Promise,
	                       "_makeSelfResolutionError",
	                       makeSelfResolutionError);

	_dereq_("./method")(Promise, INTERNAL, tryConvertToPromise, apiRejection,
	    debug);
	_dereq_("./bind")(Promise, INTERNAL, tryConvertToPromise, debug);
	_dereq_("./cancel")(Promise, PromiseArray, apiRejection, debug);
	_dereq_("./direct_resolve")(Promise);
	_dereq_("./synchronous_inspection")(Promise);
	_dereq_("./join")(
	    Promise, PromiseArray, tryConvertToPromise, INTERNAL, debug);
	Promise.Promise = Promise;
	_dereq_('./map.js')(Promise, PromiseArray, apiRejection, tryConvertToPromise, INTERNAL, debug);
	_dereq_('./call_get.js')(Promise);
	_dereq_('./using.js')(Promise, apiRejection, tryConvertToPromise, createContext, INTERNAL, debug);
	_dereq_('./timers.js')(Promise, INTERNAL, debug);
	_dereq_('./generators.js')(Promise, apiRejection, INTERNAL, tryConvertToPromise, Proxyable, debug);
	_dereq_('./nodeify.js')(Promise);
	_dereq_('./promisify.js')(Promise, INTERNAL);
	_dereq_('./props.js')(Promise, PromiseArray, tryConvertToPromise, apiRejection);
	_dereq_('./race.js')(Promise, INTERNAL, tryConvertToPromise, apiRejection);
	_dereq_('./reduce.js')(Promise, PromiseArray, apiRejection, tryConvertToPromise, INTERNAL, debug);
	_dereq_('./settle.js')(Promise, PromiseArray, debug);
	_dereq_('./some.js')(Promise, PromiseArray, apiRejection);
	_dereq_('./filter.js')(Promise, INTERNAL);
	_dereq_('./each.js')(Promise, INTERNAL);
	_dereq_('./any.js')(Promise);
	                                                         
	    util.toFastProperties(Promise);                                          
	    util.toFastProperties(Promise.prototype);                                
	    function fillTypes(value) {                                              
	        var p = new Promise(INTERNAL);                                       
	        p._fulfillmentHandler0 = value;                                      
	        p._rejectionHandler0 = value;                                        
	        p._promise0 = value;                                                 
	        p._receiver0 = value;                                                
	    }                                                                        
	    // Complete slack tracking, opt out of field-type tracking and           
	    // stabilize map                                                         
	    fillTypes({a: 1});                                                       
	    fillTypes({b: 2});                                                       
	    fillTypes({c: 3});                                                       
	    fillTypes(1);                                                            
	    fillTypes(function(){});                                                 
	    fillTypes(undefined);                                                    
	    fillTypes(false);                                                        
	    fillTypes(new Promise(INTERNAL));                                        
	    debug.setBounds(Async.firstLineError, util.lastLineError);               
	    return Promise;                                                          

	};

	},{"./any.js":1,"./async":2,"./bind":3,"./call_get.js":5,"./cancel":6,"./catch_filter":7,"./context":8,"./debuggability":9,"./direct_resolve":10,"./each.js":11,"./errors":12,"./es5":13,"./filter.js":14,"./finally":15,"./generators.js":16,"./join":17,"./map.js":18,"./method":19,"./nodeback":20,"./nodeify.js":21,"./promise_array":23,"./promisify.js":24,"./props.js":25,"./race.js":27,"./reduce.js":28,"./settle.js":30,"./some.js":31,"./synchronous_inspection":32,"./thenables":33,"./timers.js":34,"./using.js":35,"./util":36}],23:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL, tryConvertToPromise,
	    apiRejection, Proxyable) {
	var util = _dereq_("./util");
	var isArray = util.isArray;

	function toResolutionValue(val) {
	    switch(val) {
	    case -2: return [];
	    case -3: return {};
	    }
	}

	function PromiseArray(values) {
	    var promise = this._promise = new Promise(INTERNAL);
	    if (values instanceof Promise) {
	        promise._propagateFrom(values, 3);
	    }
	    promise._setOnCancel(this);
	    this._values = values;
	    this._length = 0;
	    this._totalResolved = 0;
	    this._init(undefined, -2);
	}
	util.inherits(PromiseArray, Proxyable);

	PromiseArray.prototype.length = function () {
	    return this._length;
	};

	PromiseArray.prototype.promise = function () {
	    return this._promise;
	};

	PromiseArray.prototype._init = function init(_, resolveValueIfEmpty) {
	    var values = tryConvertToPromise(this._values, this._promise);
	    if (values instanceof Promise) {
	        values = values._target();
	        var bitField = values._bitField;
	        ;
	        this._values = values;

	        if (((bitField & 50397184) === 0)) {
	            this._promise._setAsyncGuaranteed();
	            return values._then(
	                init,
	                this._reject,
	                undefined,
	                this,
	                resolveValueIfEmpty
	           );
	        } else if (((bitField & 33554432) !== 0)) {
	            values = values._value();
	        } else if (((bitField & 16777216) !== 0)) {
	            return this._reject(values._reason());
	        } else {
	            return this._cancel();
	        }
	    }
	    values = util.asArray(values);
	    if (values === null) {
	        var err = apiRejection(
	            "expecting an array or an iterable object but got " + util.classString(values)).reason();
	        this._promise._rejectCallback(err, false);
	        return;
	    }

	    if (values.length === 0) {
	        if (resolveValueIfEmpty === -5) {
	            this._resolveEmptyArray();
	        }
	        else {
	            this._resolve(toResolutionValue(resolveValueIfEmpty));
	        }
	        return;
	    }
	    this._iterate(values);
	};

	PromiseArray.prototype._iterate = function(values) {
	    var len = this.getActualLength(values.length);
	    this._length = len;
	    this._values = this.shouldCopyValues() ? new Array(len) : this._values;
	    var result = this._promise;
	    var isResolved = false;
	    var bitField = null;
	    for (var i = 0; i < len; ++i) {
	        var maybePromise = tryConvertToPromise(values[i], result);

	        if (maybePromise instanceof Promise) {
	            maybePromise = maybePromise._target();
	            bitField = maybePromise._bitField;
	        } else {
	            bitField = null;
	        }

	        if (isResolved) {
	            if (bitField !== null) {
	                maybePromise.suppressUnhandledRejections();
	            }
	        } else if (bitField !== null) {
	            if (((bitField & 50397184) === 0)) {
	                maybePromise._proxy(this, i);
	                this._values[i] = maybePromise;
	            } else if (((bitField & 33554432) !== 0)) {
	                isResolved = this._promiseFulfilled(maybePromise._value(), i);
	            } else if (((bitField & 16777216) !== 0)) {
	                isResolved = this._promiseRejected(maybePromise._reason(), i);
	            } else {
	                isResolved = this._promiseCancelled(i);
	            }
	        } else {
	            isResolved = this._promiseFulfilled(maybePromise, i);
	        }
	    }
	    if (!isResolved) result._setAsyncGuaranteed();
	};

	PromiseArray.prototype._isResolved = function () {
	    return this._values === null;
	};

	PromiseArray.prototype._resolve = function (value) {
	    this._values = null;
	    this._promise._fulfill(value);
	};

	PromiseArray.prototype._cancel = function() {
	    if (this._isResolved() || !this._promise.isCancellable()) return;
	    this._values = null;
	    this._promise._cancel();
	};

	PromiseArray.prototype._reject = function (reason) {
	    this._values = null;
	    this._promise._rejectCallback(reason, false);
	};

	PromiseArray.prototype._promiseFulfilled = function (value, index) {
	    this._values[index] = value;
	    var totalResolved = ++this._totalResolved;
	    if (totalResolved >= this._length) {
	        this._resolve(this._values);
	        return true;
	    }
	    return false;
	};

	PromiseArray.prototype._promiseCancelled = function() {
	    this._cancel();
	    return true;
	};

	PromiseArray.prototype._promiseRejected = function (reason) {
	    this._totalResolved++;
	    this._reject(reason);
	    return true;
	};

	PromiseArray.prototype._resultCancelled = function() {
	    if (this._isResolved()) return;
	    var values = this._values;
	    this._cancel();
	    if (values instanceof Promise) {
	        values.cancel();
	    } else {
	        for (var i = 0; i < values.length; ++i) {
	            if (values[i] instanceof Promise) {
	                values[i].cancel();
	            }
	        }
	    }
	};

	PromiseArray.prototype.shouldCopyValues = function () {
	    return true;
	};

	PromiseArray.prototype.getActualLength = function (len) {
	    return len;
	};

	return PromiseArray;
	};

	},{"./util":36}],24:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL) {
	var THIS = {};
	var util = _dereq_("./util");
	var nodebackForPromise = _dereq_("./nodeback");
	var withAppended = util.withAppended;
	var maybeWrapAsError = util.maybeWrapAsError;
	var canEvaluate = util.canEvaluate;
	var TypeError = _dereq_("./errors").TypeError;
	var defaultSuffix = "Async";
	var defaultPromisified = {__isPromisified__: true};
	var noCopyProps = [
	    "arity",    "length",
	    "name",
	    "arguments",
	    "caller",
	    "callee",
	    "prototype",
	    "__isPromisified__"
	];
	var noCopyPropsPattern = new RegExp("^(?:" + noCopyProps.join("|") + ")$");

	var defaultFilter = function(name) {
	    return util.isIdentifier(name) &&
	        name.charAt(0) !== "_" &&
	        name !== "constructor";
	};

	function propsFilter(key) {
	    return !noCopyPropsPattern.test(key);
	}

	function isPromisified(fn) {
	    try {
	        return fn.__isPromisified__ === true;
	    }
	    catch (e) {
	        return false;
	    }
	}

	function hasPromisified(obj, key, suffix) {
	    var val = util.getDataPropertyOrDefault(obj, key + suffix,
	                                            defaultPromisified);
	    return val ? isPromisified(val) : false;
	}
	function checkValid(ret, suffix, suffixRegexp) {
	    for (var i = 0; i < ret.length; i += 2) {
	        var key = ret[i];
	        if (suffixRegexp.test(key)) {
	            var keyWithoutAsyncSuffix = key.replace(suffixRegexp, "");
	            for (var j = 0; j < ret.length; j += 2) {
	                if (ret[j] === keyWithoutAsyncSuffix) {
	                    throw new TypeError("Cannot promisify an API that has normal methods with '%s'-suffix\u000a\u000a    See http://goo.gl/MqrFmX\u000a"
	                        .replace("%s", suffix));
	                }
	            }
	        }
	    }
	}

	function promisifiableMethods(obj, suffix, suffixRegexp, filter) {
	    var keys = util.inheritedDataKeys(obj);
	    var ret = [];
	    for (var i = 0; i < keys.length; ++i) {
	        var key = keys[i];
	        var value = obj[key];
	        var passesDefaultFilter = filter === defaultFilter
	            ? true : defaultFilter(key, value, obj);
	        if (typeof value === "function" &&
	            !isPromisified(value) &&
	            !hasPromisified(obj, key, suffix) &&
	            filter(key, value, obj, passesDefaultFilter)) {
	            ret.push(key, value);
	        }
	    }
	    checkValid(ret, suffix, suffixRegexp);
	    return ret;
	}

	var escapeIdentRegex = function(str) {
	    return str.replace(/([$])/, "\\$");
	};

	var makeNodePromisifiedEval;
	if (false) {
	var switchCaseArgumentOrder = function(likelyArgumentCount) {
	    var ret = [likelyArgumentCount];
	    var min = Math.max(0, likelyArgumentCount - 1 - 3);
	    for(var i = likelyArgumentCount - 1; i >= min; --i) {
	        ret.push(i);
	    }
	    for(var i = likelyArgumentCount + 1; i <= 3; ++i) {
	        ret.push(i);
	    }
	    return ret;
	};

	var argumentSequence = function(argumentCount) {
	    return util.filledRange(argumentCount, "_arg", "");
	};

	var parameterDeclaration = function(parameterCount) {
	    return util.filledRange(
	        Math.max(parameterCount, 3), "_arg", "");
	};

	var parameterCount = function(fn) {
	    if (typeof fn.length === "number") {
	        return Math.max(Math.min(fn.length, 1023 + 1), 0);
	    }
	    return 0;
	};

	makeNodePromisifiedEval =
	function(callback, receiver, originalName, fn, _, multiArgs) {
	    var newParameterCount = Math.max(0, parameterCount(fn) - 1);
	    var argumentOrder = switchCaseArgumentOrder(newParameterCount);
	    var shouldProxyThis = typeof callback === "string" || receiver === THIS;

	    function generateCallForArgumentCount(count) {
	        var args = argumentSequence(count).join(", ");
	        var comma = count > 0 ? ", " : "";
	        var ret;
	        if (shouldProxyThis) {
	            ret = "ret = callback.call(this, {{args}}, nodeback); break;\n";
	        } else {
	            ret = receiver === undefined
	                ? "ret = callback({{args}}, nodeback); break;\n"
	                : "ret = callback.call(receiver, {{args}}, nodeback); break;\n";
	        }
	        return ret.replace("{{args}}", args).replace(", ", comma);
	    }

	    function generateArgumentSwitchCase() {
	        var ret = "";
	        for (var i = 0; i < argumentOrder.length; ++i) {
	            ret += "case " + argumentOrder[i] +":" +
	                generateCallForArgumentCount(argumentOrder[i]);
	        }

	        ret += "                                                             \n\
	        default:                                                             \n\
	            var args = new Array(len + 1);                                   \n\
	            var i = 0;                                                       \n\
	            for (var i = 0; i < len; ++i) {                                  \n\
	               args[i] = arguments[i];                                       \n\
	            }                                                                \n\
	            args[i] = nodeback;                                              \n\
	            [CodeForCall]                                                    \n\
	            break;                                                           \n\
	        ".replace("[CodeForCall]", (shouldProxyThis
	                                ? "ret = callback.apply(this, args);\n"
	                                : "ret = callback.apply(receiver, args);\n"));
	        return ret;
	    }

	    var getFunctionCode = typeof callback === "string"
	                                ? ("this != null ? this['"+callback+"'] : fn")
	                                : "fn";
	    var body = "'use strict';                                                \n\
	        var ret = function (Parameters) {                                    \n\
	            'use strict';                                                    \n\
	            var len = arguments.length;                                      \n\
	            var promise = new Promise(INTERNAL);                             \n\
	            promise._captureStackTrace();                                    \n\
	            var nodeback = nodebackForPromise(promise, " + multiArgs + ");   \n\
	            var ret;                                                         \n\
	            var callback = tryCatch([GetFunctionCode]);                      \n\
	            switch(len) {                                                    \n\
	                [CodeForSwitchCase]                                          \n\
	            }                                                                \n\
	            if (ret === errorObj) {                                          \n\
	                promise._rejectCallback(maybeWrapAsError(ret.e), true, true);\n\
	            }                                                                \n\
	            if (!promise._isFateSealed()) promise._setAsyncGuaranteed();     \n\
	            return promise;                                                  \n\
	        };                                                                   \n\
	        notEnumerableProp(ret, '__isPromisified__', true);                   \n\
	        return ret;                                                          \n\
	    ".replace("[CodeForSwitchCase]", generateArgumentSwitchCase())
	        .replace("[GetFunctionCode]", getFunctionCode);
	    body = body.replace("Parameters", parameterDeclaration(newParameterCount));
	    return new Function("Promise",
	                        "fn",
	                        "receiver",
	                        "withAppended",
	                        "maybeWrapAsError",
	                        "nodebackForPromise",
	                        "tryCatch",
	                        "errorObj",
	                        "notEnumerableProp",
	                        "INTERNAL",
	                        body)(
	                    Promise,
	                    fn,
	                    receiver,
	                    withAppended,
	                    maybeWrapAsError,
	                    nodebackForPromise,
	                    util.tryCatch,
	                    util.errorObj,
	                    util.notEnumerableProp,
	                    INTERNAL);
	};
	}

	function makeNodePromisifiedClosure(callback, receiver, _, fn, __, multiArgs) {
	    var defaultThis = (function() {return this;})();
	    var method = callback;
	    if (typeof method === "string") {
	        callback = fn;
	    }
	    function promisified() {
	        var _receiver = receiver;
	        if (receiver === THIS) _receiver = this;
	        var promise = new Promise(INTERNAL);
	        promise._captureStackTrace();
	        var cb = typeof method === "string" && this !== defaultThis
	            ? this[method] : callback;
	        var fn = nodebackForPromise(promise, multiArgs);
	        try {
	            cb.apply(_receiver, withAppended(arguments, fn));
	        } catch(e) {
	            promise._rejectCallback(maybeWrapAsError(e), true, true);
	        }
	        if (!promise._isFateSealed()) promise._setAsyncGuaranteed();
	        return promise;
	    }
	    util.notEnumerableProp(promisified, "__isPromisified__", true);
	    return promisified;
	}

	var makeNodePromisified = canEvaluate
	    ? makeNodePromisifiedEval
	    : makeNodePromisifiedClosure;

	function promisifyAll(obj, suffix, filter, promisifier, multiArgs) {
	    var suffixRegexp = new RegExp(escapeIdentRegex(suffix) + "$");
	    var methods =
	        promisifiableMethods(obj, suffix, suffixRegexp, filter);

	    for (var i = 0, len = methods.length; i < len; i+= 2) {
	        var key = methods[i];
	        var fn = methods[i+1];
	        var promisifiedKey = key + suffix;
	        if (promisifier === makeNodePromisified) {
	            obj[promisifiedKey] =
	                makeNodePromisified(key, THIS, key, fn, suffix, multiArgs);
	        } else {
	            var promisified = promisifier(fn, function() {
	                return makeNodePromisified(key, THIS, key,
	                                           fn, suffix, multiArgs);
	            });
	            util.notEnumerableProp(promisified, "__isPromisified__", true);
	            obj[promisifiedKey] = promisified;
	        }
	    }
	    util.toFastProperties(obj);
	    return obj;
	}

	function promisify(callback, receiver, multiArgs) {
	    return makeNodePromisified(callback, receiver, undefined,
	                                callback, null, multiArgs);
	}

	Promise.promisify = function (fn, options) {
	    if (typeof fn !== "function") {
	        throw new TypeError("expecting a function but got " + util.classString(fn));
	    }
	    if (isPromisified(fn)) {
	        return fn;
	    }
	    options = Object(options);
	    var receiver = options.context === undefined ? THIS : options.context;
	    var multiArgs = !!options.multiArgs;
	    var ret = promisify(fn, receiver, multiArgs);
	    util.copyDescriptors(fn, ret, propsFilter);
	    return ret;
	};

	Promise.promisifyAll = function (target, options) {
	    if (typeof target !== "function" && typeof target !== "object") {
	        throw new TypeError("the target of promisifyAll must be an object or a function\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    options = Object(options);
	    var multiArgs = !!options.multiArgs;
	    var suffix = options.suffix;
	    if (typeof suffix !== "string") suffix = defaultSuffix;
	    var filter = options.filter;
	    if (typeof filter !== "function") filter = defaultFilter;
	    var promisifier = options.promisifier;
	    if (typeof promisifier !== "function") promisifier = makeNodePromisified;

	    if (!util.isIdentifier(suffix)) {
	        throw new RangeError("suffix must be a valid identifier\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }

	    var keys = util.inheritedDataKeys(target);
	    for (var i = 0; i < keys.length; ++i) {
	        var value = target[keys[i]];
	        if (keys[i] !== "constructor" &&
	            util.isClass(value)) {
	            promisifyAll(value.prototype, suffix, filter, promisifier,
	                multiArgs);
	            promisifyAll(value, suffix, filter, promisifier, multiArgs);
	        }
	    }

	    return promisifyAll(target, suffix, filter, promisifier, multiArgs);
	};
	};


	},{"./errors":12,"./nodeback":20,"./util":36}],25:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(
	    Promise, PromiseArray, tryConvertToPromise, apiRejection) {
	var util = _dereq_("./util");
	var isObject = util.isObject;
	var es5 = _dereq_("./es5");
	var Es6Map;
	if (typeof Map === "function") Es6Map = Map;

	var mapToEntries = (function() {
	    var index = 0;
	    var size = 0;

	    function extractEntry(value, key) {
	        this[index] = value;
	        this[index + size] = key;
	        index++;
	    }

	    return function mapToEntries(map) {
	        size = map.size;
	        index = 0;
	        var ret = new Array(map.size * 2);
	        map.forEach(extractEntry, ret);
	        return ret;
	    };
	})();

	var entriesToMap = function(entries) {
	    var ret = new Es6Map();
	    var length = entries.length / 2 | 0;
	    for (var i = 0; i < length; ++i) {
	        var key = entries[length + i];
	        var value = entries[i];
	        ret.set(key, value);
	    }
	    return ret;
	};

	function PropertiesPromiseArray(obj) {
	    var isMap = false;
	    var entries;
	    if (Es6Map !== undefined && obj instanceof Es6Map) {
	        entries = mapToEntries(obj);
	        isMap = true;
	    } else {
	        var keys = es5.keys(obj);
	        var len = keys.length;
	        entries = new Array(len * 2);
	        for (var i = 0; i < len; ++i) {
	            var key = keys[i];
	            entries[i] = obj[key];
	            entries[i + len] = key;
	        }
	    }
	    this.constructor$(entries);
	    this._isMap = isMap;
	    this._init$(undefined, -3);
	}
	util.inherits(PropertiesPromiseArray, PromiseArray);

	PropertiesPromiseArray.prototype._init = function () {};

	PropertiesPromiseArray.prototype._promiseFulfilled = function (value, index) {
	    this._values[index] = value;
	    var totalResolved = ++this._totalResolved;
	    if (totalResolved >= this._length) {
	        var val;
	        if (this._isMap) {
	            val = entriesToMap(this._values);
	        } else {
	            val = {};
	            var keyOffset = this.length();
	            for (var i = 0, len = this.length(); i < len; ++i) {
	                val[this._values[i + keyOffset]] = this._values[i];
	            }
	        }
	        this._resolve(val);
	        return true;
	    }
	    return false;
	};

	PropertiesPromiseArray.prototype.shouldCopyValues = function () {
	    return false;
	};

	PropertiesPromiseArray.prototype.getActualLength = function (len) {
	    return len >> 1;
	};

	function props(promises) {
	    var ret;
	    var castValue = tryConvertToPromise(promises);

	    if (!isObject(castValue)) {
	        return apiRejection("cannot await properties of a non-object\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    } else if (castValue instanceof Promise) {
	        ret = castValue._then(
	            Promise.props, undefined, undefined, undefined, undefined);
	    } else {
	        ret = new PropertiesPromiseArray(castValue).promise();
	    }

	    if (castValue instanceof Promise) {
	        ret._propagateFrom(castValue, 2);
	    }
	    return ret;
	}

	Promise.prototype.props = function () {
	    return props(this);
	};

	Promise.props = function (promises) {
	    return props(promises);
	};
	};

	},{"./es5":13,"./util":36}],26:[function(_dereq_,module,exports){
	"use strict";
	function arrayMove(src, srcIndex, dst, dstIndex, len) {
	    for (var j = 0; j < len; ++j) {
	        dst[j + dstIndex] = src[j + srcIndex];
	        src[j + srcIndex] = void 0;
	    }
	}

	function Queue(capacity) {
	    this._capacity = capacity;
	    this._length = 0;
	    this._front = 0;
	}

	Queue.prototype._willBeOverCapacity = function (size) {
	    return this._capacity < size;
	};

	Queue.prototype._pushOne = function (arg) {
	    var length = this.length();
	    this._checkCapacity(length + 1);
	    var i = (this._front + length) & (this._capacity - 1);
	    this[i] = arg;
	    this._length = length + 1;
	};

	Queue.prototype._unshiftOne = function(value) {
	    var capacity = this._capacity;
	    this._checkCapacity(this.length() + 1);
	    var front = this._front;
	    var i = (((( front - 1 ) &
	                    ( capacity - 1) ) ^ capacity ) - capacity );
	    this[i] = value;
	    this._front = i;
	    this._length = this.length() + 1;
	};

	Queue.prototype.unshift = function(fn, receiver, arg) {
	    this._unshiftOne(arg);
	    this._unshiftOne(receiver);
	    this._unshiftOne(fn);
	};

	Queue.prototype.push = function (fn, receiver, arg) {
	    var length = this.length() + 3;
	    if (this._willBeOverCapacity(length)) {
	        this._pushOne(fn);
	        this._pushOne(receiver);
	        this._pushOne(arg);
	        return;
	    }
	    var j = this._front + length - 3;
	    this._checkCapacity(length);
	    var wrapMask = this._capacity - 1;
	    this[(j + 0) & wrapMask] = fn;
	    this[(j + 1) & wrapMask] = receiver;
	    this[(j + 2) & wrapMask] = arg;
	    this._length = length;
	};

	Queue.prototype.shift = function () {
	    var front = this._front,
	        ret = this[front];

	    this[front] = undefined;
	    this._front = (front + 1) & (this._capacity - 1);
	    this._length--;
	    return ret;
	};

	Queue.prototype.length = function () {
	    return this._length;
	};

	Queue.prototype._checkCapacity = function (size) {
	    if (this._capacity < size) {
	        this._resizeTo(this._capacity << 1);
	    }
	};

	Queue.prototype._resizeTo = function (capacity) {
	    var oldCapacity = this._capacity;
	    this._capacity = capacity;
	    var front = this._front;
	    var length = this._length;
	    var moveItemsCount = (front + length) & (oldCapacity - 1);
	    arrayMove(this, 0, this, oldCapacity, moveItemsCount);
	};

	module.exports = Queue;

	},{}],27:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(
	    Promise, INTERNAL, tryConvertToPromise, apiRejection) {
	var util = _dereq_("./util");

	var raceLater = function (promise) {
	    return promise.then(function(array) {
	        return race(array, promise);
	    });
	};

	function race(promises, parent) {
	    var maybePromise = tryConvertToPromise(promises);

	    if (maybePromise instanceof Promise) {
	        return raceLater(maybePromise);
	    } else {
	        promises = util.asArray(promises);
	        if (promises === null)
	            return apiRejection("expecting an array or an iterable object but got " + util.classString(promises));
	    }

	    var ret = new Promise(INTERNAL);
	    if (parent !== undefined) {
	        ret._propagateFrom(parent, 3);
	    }
	    var fulfill = ret._fulfill;
	    var reject = ret._reject;
	    for (var i = 0, len = promises.length; i < len; ++i) {
	        var val = promises[i];

	        if (val === undefined && !(i in promises)) {
	            continue;
	        }

	        Promise.cast(val)._then(fulfill, reject, undefined, ret, null);
	    }
	    return ret;
	}

	Promise.race = function (promises) {
	    return race(promises, undefined);
	};

	Promise.prototype.race = function () {
	    return race(this, undefined);
	};

	};

	},{"./util":36}],28:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise,
	                          PromiseArray,
	                          apiRejection,
	                          tryConvertToPromise,
	                          INTERNAL,
	                          debug) {
	var getDomain = Promise._getDomain;
	var util = _dereq_("./util");
	var tryCatch = util.tryCatch;

	function ReductionPromiseArray(promises, fn, initialValue, _each) {
	    this.constructor$(promises);
	    var domain = getDomain();
	    this._fn = domain === null ? fn : domain.bind(fn);
	    if (initialValue !== undefined) {
	        initialValue = Promise.resolve(initialValue);
	        initialValue._attachCancellationCallback(this);
	    }
	    this._initialValue = initialValue;
	    this._currentCancellable = null;
	    this._eachValues = _each === INTERNAL ? [] : undefined;
	    this._promise._captureStackTrace();
	    this._init$(undefined, -5);
	}
	util.inherits(ReductionPromiseArray, PromiseArray);

	ReductionPromiseArray.prototype._gotAccum = function(accum) {
	    if (this._eachValues !== undefined && accum !== INTERNAL) {
	        this._eachValues.push(accum);
	    }
	};

	ReductionPromiseArray.prototype._eachComplete = function(value) {
	    this._eachValues.push(value);
	    return this._eachValues;
	};

	ReductionPromiseArray.prototype._init = function() {};

	ReductionPromiseArray.prototype._resolveEmptyArray = function() {
	    this._resolve(this._eachValues !== undefined ? this._eachValues
	                                                 : this._initialValue);
	};

	ReductionPromiseArray.prototype.shouldCopyValues = function () {
	    return false;
	};

	ReductionPromiseArray.prototype._resolve = function(value) {
	    this._promise._resolveCallback(value);
	    this._values = null;
	};

	ReductionPromiseArray.prototype._resultCancelled = function(sender) {
	    if (sender === this._initialValue) return this._cancel();
	    if (this._isResolved()) return;
	    this._resultCancelled$();
	    if (this._currentCancellable instanceof Promise) {
	        this._currentCancellable.cancel();
	    }
	    if (this._initialValue instanceof Promise) {
	        this._initialValue.cancel();
	    }
	};

	ReductionPromiseArray.prototype._iterate = function (values) {
	    this._values = values;
	    var value;
	    var i;
	    var length = values.length;
	    if (this._initialValue !== undefined) {
	        value = this._initialValue;
	        i = 0;
	    } else {
	        value = Promise.resolve(values[0]);
	        i = 1;
	    }

	    this._currentCancellable = value;

	    if (!value.isRejected()) {
	        for (; i < length; ++i) {
	            var ctx = {
	                accum: null,
	                value: values[i],
	                index: i,
	                length: length,
	                array: this
	            };
	            value = value._then(gotAccum, undefined, undefined, ctx, undefined);
	        }
	    }

	    if (this._eachValues !== undefined) {
	        value = value
	            ._then(this._eachComplete, undefined, undefined, this, undefined);
	    }
	    value._then(completed, completed, undefined, value, this);
	};

	Promise.prototype.reduce = function (fn, initialValue) {
	    return reduce(this, fn, initialValue, null);
	};

	Promise.reduce = function (promises, fn, initialValue, _each) {
	    return reduce(promises, fn, initialValue, _each);
	};

	function completed(valueOrReason, array) {
	    if (this.isFulfilled()) {
	        array._resolve(valueOrReason);
	    } else {
	        array._reject(valueOrReason);
	    }
	}

	function reduce(promises, fn, initialValue, _each) {
	    if (typeof fn !== "function") {
	        return apiRejection("expecting a function but got " + util.classString(fn));
	    }
	    var array = new ReductionPromiseArray(promises, fn, initialValue, _each);
	    return array.promise();
	}

	function gotAccum(accum) {
	    this.accum = accum;
	    this.array._gotAccum(accum);
	    var value = tryConvertToPromise(this.value, this.array._promise);
	    if (value instanceof Promise) {
	        this.array._currentCancellable = value;
	        return value._then(gotValue, undefined, undefined, this, undefined);
	    } else {
	        return gotValue.call(this, value);
	    }
	}

	function gotValue(value) {
	    var array = this.array;
	    var promise = array._promise;
	    var fn = tryCatch(array._fn);
	    promise._pushContext();
	    var ret;
	    if (array._eachValues !== undefined) {
	        ret = fn.call(promise._boundValue(), value, this.index, this.length);
	    } else {
	        ret = fn.call(promise._boundValue(),
	                              this.accum, value, this.index, this.length);
	    }
	    if (ret instanceof Promise) {
	        array._currentCancellable = ret;
	    }
	    var promiseCreated = promise._popContext();
	    debug.checkForgottenReturns(
	        ret,
	        promiseCreated,
	        array._eachValues !== undefined ? "Promise.each" : "Promise.reduce",
	        promise
	    );
	    return ret;
	}
	};

	},{"./util":36}],29:[function(_dereq_,module,exports){
	"use strict";
	var util = _dereq_("./util");
	var schedule;
	var noAsyncScheduler = function() {
	    throw new Error("No async scheduler available\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	};
	var NativePromise = util.getNativePromise();
	if (util.isNode && typeof MutationObserver === "undefined") {
	    var GlobalSetImmediate = global.setImmediate;
	    var ProcessNextTick = process.nextTick;
	    schedule = util.isRecentNode
	                ? function(fn) { GlobalSetImmediate.call(global, fn); }
	                : function(fn) { ProcessNextTick.call(process, fn); };
	} else if (typeof NativePromise === "function") {
	    var nativePromise = NativePromise.resolve();
	    schedule = function(fn) {
	        nativePromise.then(fn);
	    };
	} else if ((typeof MutationObserver !== "undefined") &&
	          !(typeof window !== "undefined" &&
	            window.navigator &&
	            window.navigator.standalone)) {
	    schedule = (function() {
	        var div = document.createElement("div");
	        var opts = {attributes: true};
	        var toggleScheduled = false;
	        var div2 = document.createElement("div");
	        var o2 = new MutationObserver(function() {
	            div.classList.toggle("foo");
	            toggleScheduled = false;
	        });
	        o2.observe(div2, opts);

	        var scheduleToggle = function() {
	            if (toggleScheduled) return;
	                toggleScheduled = true;
	                div2.classList.toggle("foo");
	            };

	            return function schedule(fn) {
	            var o = new MutationObserver(function() {
	                o.disconnect();
	                fn();
	            });
	            o.observe(div, opts);
	            scheduleToggle();
	        };
	    })();
	} else if (typeof setImmediate !== "undefined") {
	    schedule = function (fn) {
	        setImmediate(fn);
	    };
	} else if (typeof setTimeout !== "undefined") {
	    schedule = function (fn) {
	        setTimeout(fn, 0);
	    };
	} else {
	    schedule = noAsyncScheduler;
	}
	module.exports = schedule;

	},{"./util":36}],30:[function(_dereq_,module,exports){
	"use strict";
	module.exports =
	    function(Promise, PromiseArray, debug) {
	var PromiseInspection = Promise.PromiseInspection;
	var util = _dereq_("./util");

	function SettledPromiseArray(values) {
	    this.constructor$(values);
	}
	util.inherits(SettledPromiseArray, PromiseArray);

	SettledPromiseArray.prototype._promiseResolved = function (index, inspection) {
	    this._values[index] = inspection;
	    var totalResolved = ++this._totalResolved;
	    if (totalResolved >= this._length) {
	        this._resolve(this._values);
	        return true;
	    }
	    return false;
	};

	SettledPromiseArray.prototype._promiseFulfilled = function (value, index) {
	    var ret = new PromiseInspection();
	    ret._bitField = 33554432;
	    ret._settledValueField = value;
	    return this._promiseResolved(index, ret);
	};
	SettledPromiseArray.prototype._promiseRejected = function (reason, index) {
	    var ret = new PromiseInspection();
	    ret._bitField = 16777216;
	    ret._settledValueField = reason;
	    return this._promiseResolved(index, ret);
	};

	Promise.settle = function (promises) {
	    debug.deprecated(".settle()", ".reflect()");
	    return new SettledPromiseArray(promises).promise();
	};

	Promise.prototype.settle = function () {
	    return Promise.settle(this);
	};
	};

	},{"./util":36}],31:[function(_dereq_,module,exports){
	"use strict";
	module.exports =
	function(Promise, PromiseArray, apiRejection) {
	var util = _dereq_("./util");
	var RangeError = _dereq_("./errors").RangeError;
	var AggregateError = _dereq_("./errors").AggregateError;
	var isArray = util.isArray;
	var CANCELLATION = {};


	function SomePromiseArray(values) {
	    this.constructor$(values);
	    this._howMany = 0;
	    this._unwrap = false;
	    this._initialized = false;
	}
	util.inherits(SomePromiseArray, PromiseArray);

	SomePromiseArray.prototype._init = function () {
	    if (!this._initialized) {
	        return;
	    }
	    if (this._howMany === 0) {
	        this._resolve([]);
	        return;
	    }
	    this._init$(undefined, -5);
	    var isArrayResolved = isArray(this._values);
	    if (!this._isResolved() &&
	        isArrayResolved &&
	        this._howMany > this._canPossiblyFulfill()) {
	        this._reject(this._getRangeError(this.length()));
	    }
	};

	SomePromiseArray.prototype.init = function () {
	    this._initialized = true;
	    this._init();
	};

	SomePromiseArray.prototype.setUnwrap = function () {
	    this._unwrap = true;
	};

	SomePromiseArray.prototype.howMany = function () {
	    return this._howMany;
	};

	SomePromiseArray.prototype.setHowMany = function (count) {
	    this._howMany = count;
	};

	SomePromiseArray.prototype._promiseFulfilled = function (value) {
	    this._addFulfilled(value);
	    if (this._fulfilled() === this.howMany()) {
	        this._values.length = this.howMany();
	        if (this.howMany() === 1 && this._unwrap) {
	            this._resolve(this._values[0]);
	        } else {
	            this._resolve(this._values);
	        }
	        return true;
	    }
	    return false;

	};
	SomePromiseArray.prototype._promiseRejected = function (reason) {
	    this._addRejected(reason);
	    return this._checkOutcome();
	};

	SomePromiseArray.prototype._promiseCancelled = function () {
	    if (this._values instanceof Promise || this._values == null) {
	        return this._cancel();
	    }
	    this._addRejected(CANCELLATION);
	    return this._checkOutcome();
	};

	SomePromiseArray.prototype._checkOutcome = function() {
	    if (this.howMany() > this._canPossiblyFulfill()) {
	        var e = new AggregateError();
	        for (var i = this.length(); i < this._values.length; ++i) {
	            if (this._values[i] !== CANCELLATION) {
	                e.push(this._values[i]);
	            }
	        }
	        if (e.length > 0) {
	            this._reject(e);
	        } else {
	            this._cancel();
	        }
	        return true;
	    }
	    return false;
	};

	SomePromiseArray.prototype._fulfilled = function () {
	    return this._totalResolved;
	};

	SomePromiseArray.prototype._rejected = function () {
	    return this._values.length - this.length();
	};

	SomePromiseArray.prototype._addRejected = function (reason) {
	    this._values.push(reason);
	};

	SomePromiseArray.prototype._addFulfilled = function (value) {
	    this._values[this._totalResolved++] = value;
	};

	SomePromiseArray.prototype._canPossiblyFulfill = function () {
	    return this.length() - this._rejected();
	};

	SomePromiseArray.prototype._getRangeError = function (count) {
	    var message = "Input array must contain at least " +
	            this._howMany + " items but contains only " + count + " items";
	    return new RangeError(message);
	};

	SomePromiseArray.prototype._resolveEmptyArray = function () {
	    this._reject(this._getRangeError(0));
	};

	function some(promises, howMany) {
	    if ((howMany | 0) !== howMany || howMany < 0) {
	        return apiRejection("expecting a positive integer\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    var ret = new SomePromiseArray(promises);
	    var promise = ret.promise();
	    ret.setHowMany(howMany);
	    ret.init();
	    return promise;
	}

	Promise.some = function (promises, howMany) {
	    return some(promises, howMany);
	};

	Promise.prototype.some = function (howMany) {
	    return some(this, howMany);
	};

	Promise._SomePromiseArray = SomePromiseArray;
	};

	},{"./errors":12,"./util":36}],32:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise) {
	function PromiseInspection(promise) {
	    if (promise !== undefined) {
	        promise = promise._target();
	        this._bitField = promise._bitField;
	        this._settledValueField = promise._isFateSealed()
	            ? promise._settledValue() : undefined;
	    }
	    else {
	        this._bitField = 0;
	        this._settledValueField = undefined;
	    }
	}

	PromiseInspection.prototype._settledValue = function() {
	    return this._settledValueField;
	};

	var value = PromiseInspection.prototype.value = function () {
	    if (!this.isFulfilled()) {
	        throw new TypeError("cannot get fulfillment value of a non-fulfilled promise\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    return this._settledValue();
	};

	var reason = PromiseInspection.prototype.error =
	PromiseInspection.prototype.reason = function () {
	    if (!this.isRejected()) {
	        throw new TypeError("cannot get rejection reason of a non-rejected promise\u000a\u000a    See http://goo.gl/MqrFmX\u000a");
	    }
	    return this._settledValue();
	};

	var isFulfilled = PromiseInspection.prototype.isFulfilled = function() {
	    return (this._bitField & 33554432) !== 0;
	};

	var isRejected = PromiseInspection.prototype.isRejected = function () {
	    return (this._bitField & 16777216) !== 0;
	};

	var isPending = PromiseInspection.prototype.isPending = function () {
	    return (this._bitField & 50397184) === 0;
	};

	var isResolved = PromiseInspection.prototype.isResolved = function () {
	    return (this._bitField & 50331648) !== 0;
	};

	PromiseInspection.prototype.isCancelled =
	Promise.prototype._isCancelled = function() {
	    return (this._bitField & 65536) === 65536;
	};

	Promise.prototype.isCancelled = function() {
	    return this._target()._isCancelled();
	};

	Promise.prototype.isPending = function() {
	    return isPending.call(this._target());
	};

	Promise.prototype.isRejected = function() {
	    return isRejected.call(this._target());
	};

	Promise.prototype.isFulfilled = function() {
	    return isFulfilled.call(this._target());
	};

	Promise.prototype.isResolved = function() {
	    return isResolved.call(this._target());
	};

	Promise.prototype.value = function() {
	    return value.call(this._target());
	};

	Promise.prototype.reason = function() {
	    var target = this._target();
	    target._unsetRejectionIsUnhandled();
	    return reason.call(target);
	};

	Promise.prototype._value = function() {
	    return this._settledValue();
	};

	Promise.prototype._reason = function() {
	    this._unsetRejectionIsUnhandled();
	    return this._settledValue();
	};

	Promise.PromiseInspection = PromiseInspection;
	};

	},{}],33:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL) {
	var util = _dereq_("./util");
	var errorObj = util.errorObj;
	var isObject = util.isObject;

	function tryConvertToPromise(obj, context) {
	    if (isObject(obj)) {
	        if (obj instanceof Promise) return obj;
	        var then = getThen(obj);
	        if (then === errorObj) {
	            if (context) context._pushContext();
	            var ret = Promise.reject(then.e);
	            if (context) context._popContext();
	            return ret;
	        } else if (typeof then === "function") {
	            if (isAnyBluebirdPromise(obj)) {
	                var ret = new Promise(INTERNAL);
	                obj._then(
	                    ret._fulfill,
	                    ret._reject,
	                    undefined,
	                    ret,
	                    null
	                );
	                return ret;
	            }
	            return doThenable(obj, then, context);
	        }
	    }
	    return obj;
	}

	function doGetThen(obj) {
	    return obj.then;
	}

	function getThen(obj) {
	    try {
	        return doGetThen(obj);
	    } catch (e) {
	        errorObj.e = e;
	        return errorObj;
	    }
	}

	var hasProp = {}.hasOwnProperty;
	function isAnyBluebirdPromise(obj) {
	    return hasProp.call(obj, "_promise0");
	}

	function doThenable(x, then, context) {
	    var promise = new Promise(INTERNAL);
	    var ret = promise;
	    if (context) context._pushContext();
	    promise._captureStackTrace();
	    if (context) context._popContext();
	    var synchronous = true;
	    var result = util.tryCatch(then).call(x, resolve, reject);
	    synchronous = false;

	    if (promise && result === errorObj) {
	        promise._rejectCallback(result.e, true, true);
	        promise = null;
	    }

	    function resolve(value) {
	        if (!promise) return;
	        promise._resolveCallback(value);
	        promise = null;
	    }

	    function reject(reason) {
	        if (!promise) return;
	        promise._rejectCallback(reason, synchronous, true);
	        promise = null;
	    }
	    return ret;
	}

	return tryConvertToPromise;
	};

	},{"./util":36}],34:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function(Promise, INTERNAL, debug) {
	var util = _dereq_("./util");
	var TimeoutError = Promise.TimeoutError;

	function HandleWrapper(handle)  {
	    this.handle = handle;
	}

	HandleWrapper.prototype._resultCancelled = function() {
	    clearTimeout(this.handle);
	};

	var afterValue = function(value) { return delay(+this).thenReturn(value); };
	var delay = Promise.delay = function (ms, value) {
	    var ret;
	    var handle;
	    if (value !== undefined) {
	        ret = Promise.resolve(value)
	                ._then(afterValue, null, null, ms, undefined);
	        if (debug.cancellation() && value instanceof Promise) {
	            ret._setOnCancel(value);
	        }
	    } else {
	        ret = new Promise(INTERNAL);
	        handle = setTimeout(function() { ret._fulfill(); }, +ms);
	        if (debug.cancellation()) {
	            ret._setOnCancel(new HandleWrapper(handle));
	        }
	    }
	    ret._setAsyncGuaranteed();
	    return ret;
	};

	Promise.prototype.delay = function (ms) {
	    return delay(ms, this);
	};

	var afterTimeout = function (promise, message, parent) {
	    var err;
	    if (typeof message !== "string") {
	        if (message instanceof Error) {
	            err = message;
	        } else {
	            err = new TimeoutError("operation timed out");
	        }
	    } else {
	        err = new TimeoutError(message);
	    }
	    util.markAsOriginatingFromRejection(err);
	    promise._attachExtraTrace(err);
	    promise._reject(err);

	    if (parent != null) {
	        parent.cancel();
	    }
	};

	function successClear(value) {
	    clearTimeout(this.handle);
	    return value;
	}

	function failureClear(reason) {
	    clearTimeout(this.handle);
	    throw reason;
	}

	Promise.prototype.timeout = function (ms, message) {
	    ms = +ms;
	    var ret, parent;

	    var handleWrapper = new HandleWrapper(setTimeout(function timeoutTimeout() {
	        if (ret.isPending()) {
	            afterTimeout(ret, message, parent);
	        }
	    }, ms));

	    if (debug.cancellation()) {
	        parent = this.then();
	        ret = parent._then(successClear, failureClear,
	                            undefined, handleWrapper, undefined);
	        ret._setOnCancel(handleWrapper);
	    } else {
	        ret = this._then(successClear, failureClear,
	                            undefined, handleWrapper, undefined);
	    }

	    return ret;
	};

	};

	},{"./util":36}],35:[function(_dereq_,module,exports){
	"use strict";
	module.exports = function (Promise, apiRejection, tryConvertToPromise,
	    createContext, INTERNAL, debug) {
	    var util = _dereq_("./util");
	    var TypeError = _dereq_("./errors").TypeError;
	    var inherits = _dereq_("./util").inherits;
	    var errorObj = util.errorObj;
	    var tryCatch = util.tryCatch;

	    function thrower(e) {
	        setTimeout(function(){throw e;}, 0);
	    }

	    function castPreservingDisposable(thenable) {
	        var maybePromise = tryConvertToPromise(thenable);
	        if (maybePromise !== thenable &&
	            typeof thenable._isDisposable === "function" &&
	            typeof thenable._getDisposer === "function" &&
	            thenable._isDisposable()) {
	            maybePromise._setDisposable(thenable._getDisposer());
	        }
	        return maybePromise;
	    }
	    function dispose(resources, inspection) {
	        var i = 0;
	        var len = resources.length;
	        var ret = new Promise(INTERNAL);
	        function iterator() {
	            if (i >= len) return ret._fulfill();
	            var maybePromise = castPreservingDisposable(resources[i++]);
	            if (maybePromise instanceof Promise &&
	                maybePromise._isDisposable()) {
	                try {
	                    maybePromise = tryConvertToPromise(
	                        maybePromise._getDisposer().tryDispose(inspection),
	                        resources.promise);
	                } catch (e) {
	                    return thrower(e);
	                }
	                if (maybePromise instanceof Promise) {
	                    return maybePromise._then(iterator, thrower,
	                                              null, null, null);
	                }
	            }
	            iterator();
	        }
	        iterator();
	        return ret;
	    }

	    function Disposer(data, promise, context) {
	        this._data = data;
	        this._promise = promise;
	        this._context = context;
	    }

	    Disposer.prototype.data = function () {
	        return this._data;
	    };

	    Disposer.prototype.promise = function () {
	        return this._promise;
	    };

	    Disposer.prototype.resource = function () {
	        if (this.promise().isFulfilled()) {
	            return this.promise().value();
	        }
	        return null;
	    };

	    Disposer.prototype.tryDispose = function(inspection) {
	        var resource = this.resource();
	        var context = this._context;
	        if (context !== undefined) context._pushContext();
	        var ret = resource !== null
	            ? this.doDispose(resource, inspection) : null;
	        if (context !== undefined) context._popContext();
	        this._promise._unsetDisposable();
	        this._data = null;
	        return ret;
	    };

	    Disposer.isDisposer = function (d) {
	        return (d != null &&
	                typeof d.resource === "function" &&
	                typeof d.tryDispose === "function");
	    };

	    function FunctionDisposer(fn, promise, context) {
	        this.constructor$(fn, promise, context);
	    }
	    inherits(FunctionDisposer, Disposer);

	    FunctionDisposer.prototype.doDispose = function (resource, inspection) {
	        var fn = this.data();
	        return fn.call(resource, resource, inspection);
	    };

	    function maybeUnwrapDisposer(value) {
	        if (Disposer.isDisposer(value)) {
	            this.resources[this.index]._setDisposable(value);
	            return value.promise();
	        }
	        return value;
	    }

	    function ResourceList(length) {
	        this.length = length;
	        this.promise = null;
	        this[length-1] = null;
	    }

	    ResourceList.prototype._resultCancelled = function() {
	        var len = this.length;
	        for (var i = 0; i < len; ++i) {
	            var item = this[i];
	            if (item instanceof Promise) {
	                item.cancel();
	            }
	        }
	    };

	    Promise.using = function () {
	        var len = arguments.length;
	        if (len < 2) return apiRejection(
	                        "you must pass at least 2 arguments to Promise.using");
	        var fn = arguments[len - 1];
	        if (typeof fn !== "function") {
	            return apiRejection("expecting a function but got " + util.classString(fn));
	        }
	        var input;
	        var spreadArgs = true;
	        if (len === 2 && Array.isArray(arguments[0])) {
	            input = arguments[0];
	            len = input.length;
	            spreadArgs = false;
	        } else {
	            input = arguments;
	            len--;
	        }
	        var resources = new ResourceList(len);
	        for (var i = 0; i < len; ++i) {
	            var resource = input[i];
	            if (Disposer.isDisposer(resource)) {
	                var disposer = resource;
	                resource = resource.promise();
	                resource._setDisposable(disposer);
	            } else {
	                var maybePromise = tryConvertToPromise(resource);
	                if (maybePromise instanceof Promise) {
	                    resource =
	                        maybePromise._then(maybeUnwrapDisposer, null, null, {
	                            resources: resources,
	                            index: i
	                    }, undefined);
	                }
	            }
	            resources[i] = resource;
	        }

	        var reflectedResources = new Array(resources.length);
	        for (var i = 0; i < reflectedResources.length; ++i) {
	            reflectedResources[i] = Promise.resolve(resources[i]).reflect();
	        }

	        var resultPromise = Promise.all(reflectedResources)
	            .then(function(inspections) {
	                for (var i = 0; i < inspections.length; ++i) {
	                    var inspection = inspections[i];
	                    if (inspection.isRejected()) {
	                        errorObj.e = inspection.error();
	                        return errorObj;
	                    } else if (!inspection.isFulfilled()) {
	                        resultPromise.cancel();
	                        return;
	                    }
	                    inspections[i] = inspection.value();
	                }
	                promise._pushContext();

	                fn = tryCatch(fn);
	                var ret = spreadArgs
	                    ? fn.apply(undefined, inspections) : fn(inspections);
	                var promiseCreated = promise._popContext();
	                debug.checkForgottenReturns(
	                    ret, promiseCreated, "Promise.using", promise);
	                return ret;
	            });

	        var promise = resultPromise.lastly(function() {
	            var inspection = new Promise.PromiseInspection(resultPromise);
	            return dispose(resources, inspection);
	        });
	        resources.promise = promise;
	        promise._setOnCancel(resources);
	        return promise;
	    };

	    Promise.prototype._setDisposable = function (disposer) {
	        this._bitField = this._bitField | 131072;
	        this._disposer = disposer;
	    };

	    Promise.prototype._isDisposable = function () {
	        return (this._bitField & 131072) > 0;
	    };

	    Promise.prototype._getDisposer = function () {
	        return this._disposer;
	    };

	    Promise.prototype._unsetDisposable = function () {
	        this._bitField = this._bitField & (~131072);
	        this._disposer = undefined;
	    };

	    Promise.prototype.disposer = function (fn) {
	        if (typeof fn === "function") {
	            return new FunctionDisposer(fn, this, createContext());
	        }
	        throw new TypeError();
	    };

	};

	},{"./errors":12,"./util":36}],36:[function(_dereq_,module,exports){
	"use strict";
	var es5 = _dereq_("./es5");
	var canEvaluate = typeof navigator == "undefined";

	var errorObj = {e: {}};
	var tryCatchTarget;
	var globalObject = typeof self !== "undefined" ? self :
	    typeof window !== "undefined" ? window :
	    typeof global !== "undefined" ? global :
	    this !== undefined ? this : null;

	function tryCatcher() {
	    try {
	        var target = tryCatchTarget;
	        tryCatchTarget = null;
	        return target.apply(this, arguments);
	    } catch (e) {
	        errorObj.e = e;
	        return errorObj;
	    }
	}
	function tryCatch(fn) {
	    tryCatchTarget = fn;
	    return tryCatcher;
	}

	var inherits = function(Child, Parent) {
	    var hasProp = {}.hasOwnProperty;

	    function T() {
	        this.constructor = Child;
	        this.constructor$ = Parent;
	        for (var propertyName in Parent.prototype) {
	            if (hasProp.call(Parent.prototype, propertyName) &&
	                propertyName.charAt(propertyName.length-1) !== "$"
	           ) {
	                this[propertyName + "$"] = Parent.prototype[propertyName];
	            }
	        }
	    }
	    T.prototype = Parent.prototype;
	    Child.prototype = new T();
	    return Child.prototype;
	};


	function isPrimitive(val) {
	    return val == null || val === true || val === false ||
	        typeof val === "string" || typeof val === "number";

	}

	function isObject(value) {
	    return typeof value === "function" ||
	           typeof value === "object" && value !== null;
	}

	function maybeWrapAsError(maybeError) {
	    if (!isPrimitive(maybeError)) return maybeError;

	    return new Error(safeToString(maybeError));
	}

	function withAppended(target, appendee) {
	    var len = target.length;
	    var ret = new Array(len + 1);
	    var i;
	    for (i = 0; i < len; ++i) {
	        ret[i] = target[i];
	    }
	    ret[i] = appendee;
	    return ret;
	}

	function getDataPropertyOrDefault(obj, key, defaultValue) {
	    if (es5.isES5) {
	        var desc = Object.getOwnPropertyDescriptor(obj, key);

	        if (desc != null) {
	            return desc.get == null && desc.set == null
	                    ? desc.value
	                    : defaultValue;
	        }
	    } else {
	        return {}.hasOwnProperty.call(obj, key) ? obj[key] : undefined;
	    }
	}

	function notEnumerableProp(obj, name, value) {
	    if (isPrimitive(obj)) return obj;
	    var descriptor = {
	        value: value,
	        configurable: true,
	        enumerable: false,
	        writable: true
	    };
	    es5.defineProperty(obj, name, descriptor);
	    return obj;
	}

	function thrower(r) {
	    throw r;
	}

	var inheritedDataKeys = (function() {
	    var excludedPrototypes = [
	        Array.prototype,
	        Object.prototype,
	        Function.prototype
	    ];

	    var isExcludedProto = function(val) {
	        for (var i = 0; i < excludedPrototypes.length; ++i) {
	            if (excludedPrototypes[i] === val) {
	                return true;
	            }
	        }
	        return false;
	    };

	    if (es5.isES5) {
	        var getKeys = Object.getOwnPropertyNames;
	        return function(obj) {
	            var ret = [];
	            var visitedKeys = Object.create(null);
	            while (obj != null && !isExcludedProto(obj)) {
	                var keys;
	                try {
	                    keys = getKeys(obj);
	                } catch (e) {
	                    return ret;
	                }
	                for (var i = 0; i < keys.length; ++i) {
	                    var key = keys[i];
	                    if (visitedKeys[key]) continue;
	                    visitedKeys[key] = true;
	                    var desc = Object.getOwnPropertyDescriptor(obj, key);
	                    if (desc != null && desc.get == null && desc.set == null) {
	                        ret.push(key);
	                    }
	                }
	                obj = es5.getPrototypeOf(obj);
	            }
	            return ret;
	        };
	    } else {
	        var hasProp = {}.hasOwnProperty;
	        return function(obj) {
	            if (isExcludedProto(obj)) return [];
	            var ret = [];

	            /*jshint forin:false */
	            enumeration: for (var key in obj) {
	                if (hasProp.call(obj, key)) {
	                    ret.push(key);
	                } else {
	                    for (var i = 0; i < excludedPrototypes.length; ++i) {
	                        if (hasProp.call(excludedPrototypes[i], key)) {
	                            continue enumeration;
	                        }
	                    }
	                    ret.push(key);
	                }
	            }
	            return ret;
	        };
	    }

	})();

	var thisAssignmentPattern = /this\s*\.\s*\S+\s*=/;
	function isClass(fn) {
	    try {
	        if (typeof fn === "function") {
	            var keys = es5.names(fn.prototype);

	            var hasMethods = es5.isES5 && keys.length > 1;
	            var hasMethodsOtherThanConstructor = keys.length > 0 &&
	                !(keys.length === 1 && keys[0] === "constructor");
	            var hasThisAssignmentAndStaticMethods =
	                thisAssignmentPattern.test(fn + "") && es5.names(fn).length > 0;

	            if (hasMethods || hasMethodsOtherThanConstructor ||
	                hasThisAssignmentAndStaticMethods) {
	                return true;
	            }
	        }
	        return false;
	    } catch (e) {
	        return false;
	    }
	}

	function toFastProperties(obj) {
	    /*jshint -W027,-W055,-W031*/
	    function FakeConstructor() {}
	    FakeConstructor.prototype = obj;
	    var l = 8;
	    while (l--) new FakeConstructor();
	    return obj;
	    eval(obj);
	}

	var rident = /^[a-z$_][a-z$_0-9]*$/i;
	function isIdentifier(str) {
	    return rident.test(str);
	}

	function filledRange(count, prefix, suffix) {
	    var ret = new Array(count);
	    for(var i = 0; i < count; ++i) {
	        ret[i] = prefix + i + suffix;
	    }
	    return ret;
	}

	function safeToString(obj) {
	    try {
	        return obj + "";
	    } catch (e) {
	        return "[no string representation]";
	    }
	}

	function isError(obj) {
	    return obj !== null &&
	           typeof obj === "object" &&
	           typeof obj.message === "string" &&
	           typeof obj.name === "string";
	}

	function markAsOriginatingFromRejection(e) {
	    try {
	        notEnumerableProp(e, "isOperational", true);
	    }
	    catch(ignore) {}
	}

	function originatesFromRejection(e) {
	    if (e == null) return false;
	    return ((e instanceof Error["__BluebirdErrorTypes__"].OperationalError) ||
	        e["isOperational"] === true);
	}

	function canAttachTrace(obj) {
	    return isError(obj) && es5.propertyIsWritable(obj, "stack");
	}

	var ensureErrorObject = (function() {
	    if (!("stack" in new Error())) {
	        return function(value) {
	            if (canAttachTrace(value)) return value;
	            try {throw new Error(safeToString(value));}
	            catch(err) {return err;}
	        };
	    } else {
	        return function(value) {
	            if (canAttachTrace(value)) return value;
	            return new Error(safeToString(value));
	        };
	    }
	})();

	function classString(obj) {
	    return {}.toString.call(obj);
	}

	function copyDescriptors(from, to, filter) {
	    var keys = es5.names(from);
	    for (var i = 0; i < keys.length; ++i) {
	        var key = keys[i];
	        if (filter(key)) {
	            try {
	                es5.defineProperty(to, key, es5.getDescriptor(from, key));
	            } catch (ignore) {}
	        }
	    }
	}

	var asArray = function(v) {
	    if (es5.isArray(v)) {
	        return v;
	    }
	    return null;
	};

	if (typeof Symbol !== "undefined" && Symbol.iterator) {
	    var ArrayFrom = typeof Array.from === "function" ? function(v) {
	        return Array.from(v);
	    } : function(v) {
	        var ret = [];
	        var it = v[Symbol.iterator]();
	        var itResult;
	        while (!((itResult = it.next()).done)) {
	            ret.push(itResult.value);
	        }
	        return ret;
	    };

	    asArray = function(v) {
	        if (es5.isArray(v)) {
	            return v;
	        } else if (v != null && typeof v[Symbol.iterator] === "function") {
	            return ArrayFrom(v);
	        }
	        return null;
	    };
	}

	var isNode = typeof process !== "undefined" &&
	        classString(process).toLowerCase() === "[object process]";

	function env(key, def) {
	    return isNode ? process.env[key] : def;
	}

	function getNativePromise() {
	    if (typeof Promise === "function") {
	        try {
	            var promise = new Promise(function(){});
	            if ({}.toString.call(promise) === "[object Promise]") {
	                return Promise;
	            }
	        } catch (e) {}
	    }
	}

	var ret = {
	    isClass: isClass,
	    isIdentifier: isIdentifier,
	    inheritedDataKeys: inheritedDataKeys,
	    getDataPropertyOrDefault: getDataPropertyOrDefault,
	    thrower: thrower,
	    isArray: es5.isArray,
	    asArray: asArray,
	    notEnumerableProp: notEnumerableProp,
	    isPrimitive: isPrimitive,
	    isObject: isObject,
	    isError: isError,
	    canEvaluate: canEvaluate,
	    errorObj: errorObj,
	    tryCatch: tryCatch,
	    inherits: inherits,
	    withAppended: withAppended,
	    maybeWrapAsError: maybeWrapAsError,
	    toFastProperties: toFastProperties,
	    filledRange: filledRange,
	    toString: safeToString,
	    canAttachTrace: canAttachTrace,
	    ensureErrorObject: ensureErrorObject,
	    originatesFromRejection: originatesFromRejection,
	    markAsOriginatingFromRejection: markAsOriginatingFromRejection,
	    classString: classString,
	    copyDescriptors: copyDescriptors,
	    hasDevTools: typeof chrome !== "undefined" && chrome &&
	                 typeof chrome.loadTimes === "function",
	    isNode: isNode,
	    env: env,
	    global: globalObject,
	    getNativePromise: getNativePromise
	};
	ret.isRecentNode = ret.isNode && (function() {
	    var version = process.versions.node.split(".").map(Number);
	    return (version[0] === 0 && version[1] > 10) || (version[0] > 0);
	})();

	if (ret.isNode) ret.toFastProperties(process);

	try {throw new Error(); } catch (e) {ret.lastLineError = e;}
	module.exports = ret;

	},{"./es5":13}]},{},[4])(4)
	});                    ;if (typeof window !== 'undefined' && window !== null) {                               window.P = window.Promise;                                                     } else if (typeof self !== 'undefined' && self !== null) {                             self.P = self.Promise;                                                         }
	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(20), __webpack_require__(0), __webpack_require__(7).setImmediate))

/***/ },
/* 89 */
/***/ function(module, exports, __webpack_require__) {

	var core  = __webpack_require__(15)
	  , $JSON = core.JSON || (core.JSON = {stringify: JSON.stringify});
	module.exports = function stringify(it){ // eslint-disable-line no-unused-vars
	  return $JSON.stringify.apply($JSON, arguments);
	};

/***/ },
/* 90 */
/***/ function(module, exports, __webpack_require__) {

	__webpack_require__(115);
	module.exports = __webpack_require__(15).Object.assign;

/***/ },
/* 91 */
/***/ function(module, exports, __webpack_require__) {

	__webpack_require__(116);
	var $Object = __webpack_require__(15).Object;
	module.exports = function defineProperty(it, key, desc){
	  return $Object.defineProperty(it, key, desc);
	};

/***/ },
/* 92 */
/***/ function(module, exports) {

	module.exports = function(it){
	  if(typeof it != 'function')throw TypeError(it + ' is not a function!');
	  return it;
	};

/***/ },
/* 93 */
/***/ function(module, exports, __webpack_require__) {

	var isObject = __webpack_require__(24);
	module.exports = function(it){
	  if(!isObject(it))throw TypeError(it + ' is not an object!');
	  return it;
	};

/***/ },
/* 94 */
/***/ function(module, exports, __webpack_require__) {

	// false -> Array#indexOf
	// true  -> Array#includes
	var toIObject = __webpack_require__(50)
	  , toLength  = __webpack_require__(111)
	  , toIndex   = __webpack_require__(110);
	module.exports = function(IS_INCLUDES){
	  return function($this, el, fromIndex){
	    var O      = toIObject($this)
	      , length = toLength(O.length)
	      , index  = toIndex(fromIndex, length)
	      , value;
	    // Array#includes uses SameValueZero equality algorithm
	    if(IS_INCLUDES && el != el)while(length > index){
	      value = O[index++];
	      if(value != value)return true;
	    // Array#toIndex ignores holes, Array#includes - not
	    } else for(;length > index; index++)if(IS_INCLUDES || index in O){
	      if(O[index] === el)return IS_INCLUDES || index || 0;
	    } return !IS_INCLUDES && -1;
	  };
	};

/***/ },
/* 95 */
/***/ function(module, exports) {

	var toString = {}.toString;

	module.exports = function(it){
	  return toString.call(it).slice(8, -1);
	};

/***/ },
/* 96 */
/***/ function(module, exports, __webpack_require__) {

	// optional / simple context binding
	var aFunction = __webpack_require__(92);
	module.exports = function(fn, that, length){
	  aFunction(fn);
	  if(that === undefined)return fn;
	  switch(length){
	    case 1: return function(a){
	      return fn.call(that, a);
	    };
	    case 2: return function(a, b){
	      return fn.call(that, a, b);
	    };
	    case 3: return function(a, b, c){
	      return fn.call(that, a, b, c);
	    };
	  }
	  return function(/* ...args */){
	    return fn.apply(that, arguments);
	  };
	};

/***/ },
/* 97 */
/***/ function(module, exports, __webpack_require__) {

	var isObject = __webpack_require__(24)
	  , document = __webpack_require__(23).document
	  // in old IE typeof document.createElement is 'object'
	  , is = isObject(document) && isObject(document.createElement);
	module.exports = function(it){
	  return is ? document.createElement(it) : {};
	};

/***/ },
/* 98 */
/***/ function(module, exports) {

	// IE 8- don't enum bug keys
	module.exports = (
	  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'
	).split(',');

/***/ },
/* 99 */
/***/ function(module, exports) {

	var hasOwnProperty = {}.hasOwnProperty;
	module.exports = function(it, key){
	  return hasOwnProperty.call(it, key);
	};

/***/ },
/* 100 */
/***/ function(module, exports, __webpack_require__) {

	var dP         = __webpack_require__(48)
	  , createDesc = __webpack_require__(107);
	module.exports = __webpack_require__(16) ? function(object, key, value){
	  return dP.f(object, key, createDesc(1, value));
	} : function(object, key, value){
	  object[key] = value;
	  return object;
	};

/***/ },
/* 101 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = !__webpack_require__(16) && !__webpack_require__(22)(function(){
	  return Object.defineProperty(__webpack_require__(97)('div'), 'a', {get: function(){ return 7; }}).a != 7;
	});

/***/ },
/* 102 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	// 19.1.2.1 Object.assign(target, source, ...)
	var getKeys  = __webpack_require__(105)
	  , gOPS     = __webpack_require__(103)
	  , pIE      = __webpack_require__(106)
	  , toObject = __webpack_require__(112)
	  , IObject  = __webpack_require__(47)
	  , $assign  = Object.assign;

	// should work with symbols and should have deterministic property order (V8 bug)
	module.exports = !$assign || __webpack_require__(22)(function(){
	  var A = {}
	    , B = {}
	    , S = Symbol()
	    , K = 'abcdefghijklmnopqrst';
	  A[S] = 7;
	  K.split('').forEach(function(k){ B[k] = k; });
	  return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;
	}) ? function assign(target, source){ // eslint-disable-line no-unused-vars
	  var T     = toObject(target)
	    , aLen  = arguments.length
	    , index = 1
	    , getSymbols = gOPS.f
	    , isEnum     = pIE.f;
	  while(aLen > index){
	    var S      = IObject(arguments[index++])
	      , keys   = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S)
	      , length = keys.length
	      , j      = 0
	      , key;
	    while(length > j)if(isEnum.call(S, key = keys[j++]))T[key] = S[key];
	  } return T;
	} : $assign;

/***/ },
/* 103 */
/***/ function(module, exports) {

	exports.f = Object.getOwnPropertySymbols;

/***/ },
/* 104 */
/***/ function(module, exports, __webpack_require__) {

	var has          = __webpack_require__(99)
	  , toIObject    = __webpack_require__(50)
	  , arrayIndexOf = __webpack_require__(94)(false)
	  , IE_PROTO     = __webpack_require__(108)('IE_PROTO');

	module.exports = function(object, names){
	  var O      = toIObject(object)
	    , i      = 0
	    , result = []
	    , key;
	  for(key in O)if(key != IE_PROTO)has(O, key) && result.push(key);
	  // Don't enum bug & hidden keys
	  while(names.length > i)if(has(O, key = names[i++])){
	    ~arrayIndexOf(result, key) || result.push(key);
	  }
	  return result;
	};

/***/ },
/* 105 */
/***/ function(module, exports, __webpack_require__) {

	// 19.1.2.14 / 15.2.3.14 Object.keys(O)
	var $keys       = __webpack_require__(104)
	  , enumBugKeys = __webpack_require__(98);

	module.exports = Object.keys || function keys(O){
	  return $keys(O, enumBugKeys);
	};

/***/ },
/* 106 */
/***/ function(module, exports) {

	exports.f = {}.propertyIsEnumerable;

/***/ },
/* 107 */
/***/ function(module, exports) {

	module.exports = function(bitmap, value){
	  return {
	    enumerable  : !(bitmap & 1),
	    configurable: !(bitmap & 2),
	    writable    : !(bitmap & 4),
	    value       : value
	  };
	};

/***/ },
/* 108 */
/***/ function(module, exports, __webpack_require__) {

	var shared = __webpack_require__(109)('keys')
	  , uid    = __webpack_require__(114);
	module.exports = function(key){
	  return shared[key] || (shared[key] = uid(key));
	};

/***/ },
/* 109 */
/***/ function(module, exports, __webpack_require__) {

	var global = __webpack_require__(23)
	  , SHARED = '__core-js_shared__'
	  , store  = global[SHARED] || (global[SHARED] = {});
	module.exports = function(key){
	  return store[key] || (store[key] = {});
	};

/***/ },
/* 110 */
/***/ function(module, exports, __webpack_require__) {

	var toInteger = __webpack_require__(49)
	  , max       = Math.max
	  , min       = Math.min;
	module.exports = function(index, length){
	  index = toInteger(index);
	  return index < 0 ? max(index + length, 0) : min(index, length);
	};

/***/ },
/* 111 */
/***/ function(module, exports, __webpack_require__) {

	// 7.1.15 ToLength
	var toInteger = __webpack_require__(49)
	  , min       = Math.min;
	module.exports = function(it){
	  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991
	};

/***/ },
/* 112 */
/***/ function(module, exports, __webpack_require__) {

	// 7.1.13 ToObject(argument)
	var defined = __webpack_require__(45);
	module.exports = function(it){
	  return Object(defined(it));
	};

/***/ },
/* 113 */
/***/ function(module, exports, __webpack_require__) {

	// 7.1.1 ToPrimitive(input [, PreferredType])
	var isObject = __webpack_require__(24);
	// instead of the ES6 spec version, we didn't implement @@toPrimitive case
	// and the second argument - flag - preferred type is a string
	module.exports = function(it, S){
	  if(!isObject(it))return it;
	  var fn, val;
	  if(S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
	  if(typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it)))return val;
	  if(!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;
	  throw TypeError("Can't convert object to primitive value");
	};

/***/ },
/* 114 */
/***/ function(module, exports) {

	var id = 0
	  , px = Math.random();
	module.exports = function(key){
	  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));
	};

/***/ },
/* 115 */
/***/ function(module, exports, __webpack_require__) {

	// 19.1.3.1 Object.assign(target, source)
	var $export = __webpack_require__(46);

	$export($export.S + $export.F, 'Object', {assign: __webpack_require__(102)});

/***/ },
/* 116 */
/***/ function(module, exports, __webpack_require__) {

	var $export = __webpack_require__(46);
	// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)
	$export($export.S + $export.F * !__webpack_require__(16), 'Object', {defineProperty: __webpack_require__(48).f});

/***/ },
/* 117 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(setImmediate, clearImmediate) {var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_RESULT__;/*
	 * @name Lazy.js
	 *
	 * @fileOverview
	 * Lazy.js is a lazy evaluation library for JavaScript.
	 *
	 * This has been done before. For examples see:
	 *
	 * - [wu.js](http://fitzgen.github.io/wu.js/)
	 * - [Linq.js](http://linqjs.codeplex.com/)
	 * - [from.js](https://github.com/suckgamoni/fromjs/)
	 * - [IxJS](http://rx.codeplex.com/)
	 * - [sloth.js](http://rfw.name/sloth.js/)
	 *
	 * However, at least at present, Lazy.js is faster (on average) than any of
	 * those libraries. It is also more complete, with nearly all of the
	 * functionality of [Underscore](http://underscorejs.org/) and
	 * [Lo-Dash](http://lodash.com/).
	 *
	 * Finding your way around the code
	 * --------------------------------
	 *
	 * At the heart of Lazy.js is the {@link Sequence} object. You create an initial
	 * sequence using {@link Lazy}, which can accept an array, object, or string.
	 * You can then "chain" together methods from this sequence, creating a new
	 * sequence with each call.
	 *
	 * Here's an example:
	 *
	 *     var data = getReallyBigArray();
	 *
	 *     var statistics = Lazy(data)
	 *       .map(transform)
	 *       .filter(validate)
	 *       .reduce(aggregate);
	 *
	 * {@link Sequence} is the foundation of other, more specific sequence types.
	 *
	 * An {@link ArrayLikeSequence} provides indexed access to its elements.
	 *
	 * An {@link ObjectLikeSequence} consists of key/value pairs.
	 *
	 * A {@link StringLikeSequence} is like a string (duh): actually, it is an
	 * {@link ArrayLikeSequence} whose elements happen to be characters.
	 *
	 * An {@link AsyncSequence} is special: it iterates over its elements
	 * asynchronously (so calling `each` generally begins an asynchronous loop and
	 * returns immediately).
	 *
	 * For more information
	 * --------------------
	 *
	 * I wrote a blog post that explains a little bit more about Lazy.js, which you
	 * can read [here](http://philosopherdeveloper.com/posts/introducing-lazy-js.html).
	 *
	 * You can also [create an issue on GitHub](https://github.com/dtao/lazy.js/issues)
	 * if you have any issues with the library. I work through them eventually.
	 *
	 * [@dtao](https://github.com/dtao)
	 */

	(function(root, factory) {
	  if (true) {
	    !(__WEBPACK_AMD_DEFINE_FACTORY__ = (factory), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.call(exports, __webpack_require__, exports, module)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
	  } else if (typeof exports === 'object') {
	    module.exports = factory();
	  } else {
	    root.Lazy = factory();
	  }
	})(this, function(context) {
	  /**
	   * Wraps an object and returns a {@link Sequence}. For `null` or `undefined`,
	   * simply returns an empty sequence (see {@link Lazy.strict} for a stricter
	   * implementation).
	   *
	   * - For **arrays**, Lazy will create a sequence comprising the elements in
	   *   the array (an {@link ArrayLikeSequence}).
	   * - For **objects**, Lazy will create a sequence of key/value pairs
	   *   (an {@link ObjectLikeSequence}).
	   * - For **strings**, Lazy will create a sequence of characters (a
	   *   {@link StringLikeSequence}).
	   *
	   * @public
	   * @param {Array|Object|string} source An array, object, or string to wrap.
	   * @returns {Sequence} The wrapped lazy object.
	   *
	   * @exampleHelpers
	   * // Utility functions to provide to all examples
	   * function increment(x) { return x + 1; }
	   * function isEven(x) { return x % 2 === 0; }
	   * function isPositive(x) { return x > 0; }
	   * function isNegative(x) { return x < 0; }
	   *
	   * @examples
	   * Lazy([1, 2, 4])       // instanceof Lazy.ArrayLikeSequence
	   * Lazy({ foo: "bar" })  // instanceof Lazy.ObjectLikeSequence
	   * Lazy("hello, world!") // instanceof Lazy.StringLikeSequence
	   * Lazy()                // sequence: []
	   * Lazy(null)            // sequence: []
	   */
	  function Lazy(source) {
	    if (source instanceof Array) {
	      return new ArrayWrapper(source);

	    } else if (typeof source === "string") {
	      return new StringWrapper(source);

	    } else if (source instanceof Sequence) {
	      return source;
	    }

	    if (Lazy.extensions) {
	      var extensions = Lazy.extensions, length = extensions.length, result;
	      while (!result && length--) {
	        result = extensions[length](source);
	      }
	      if (result) {
	        return result;
	      }
	    }

	    return new ObjectWrapper(source);
	  }

	  Lazy.VERSION = '0.4.2';

	  /*** Utility methods of questionable value ***/

	  Lazy.noop = function noop() {};
	  Lazy.identity = function identity(x) { return x; };

	  /**
	   * Provides a stricter version of {@link Lazy} which throws an error when
	   * attempting to wrap `null`, `undefined`, or numeric or boolean values as a
	   * sequence.
	   *
	   * @public
	   * @returns {Function} A stricter version of the {@link Lazy} helper function.
	   *
	   * @examples
	   * var Strict = Lazy.strict();
	   *
	   * Strict()                  // throws
	   * Strict(null)              // throws
	   * Strict(true)              // throws
	   * Strict(5)                 // throws
	   * Strict([1, 2, 3])         // instanceof Lazy.ArrayLikeSequence
	   * Strict({ foo: "bar" })    // instanceof Lazy.ObjectLikeSequence
	   * Strict("hello, world!")   // instanceof Lazy.StringLikeSequence
	   *
	   * // Let's also ensure the static functions are still there.
	   * Strict.range(3)           // sequence: [0, 1, 2]
	   * Strict.generate(Date.now) // instanceof Lazy.GeneratedSequence
	   */
	  Lazy.strict = function strict() {
	    function StrictLazy(source) {
	      if (source == null) {
	        throw new Error("You cannot wrap null or undefined using Lazy.");
	      }

	      if (typeof source === "number" || typeof source === "boolean") {
	        throw new Error("You cannot wrap primitive values using Lazy.");
	      }

	      return Lazy(source);
	    };

	    Lazy(Lazy).each(function(property, name) {
	      StrictLazy[name] = property;
	    });

	    return StrictLazy;
	  };

	  /**
	   * The `Sequence` object provides a unified API encapsulating the notion of
	   * zero or more consecutive elements in a collection, stream, etc.
	   *
	   * Lazy evaluation
	   * ---------------
	   *
	   * Generally speaking, creating a sequence should not be an expensive operation,
	   * and should not iterate over an underlying source or trigger any side effects.
	   * This means that chaining together methods that return sequences incurs only
	   * the cost of creating the `Sequence` objects themselves and not the cost of
	   * iterating an underlying data source multiple times.
	   *
	   * The following code, for example, creates 4 sequences and does nothing with
	   * `source`:
	   *
	   *     var seq = Lazy(source) // 1st sequence
	   *       .map(func)           // 2nd
	   *       .filter(pred)        // 3rd
	   *       .reverse();          // 4th
	   *
	   * Lazy's convention is to hold off on iterating or otherwise *doing* anything
	   * (aside from creating `Sequence` objects) until you call `each`:
	   *
	   *     seq.each(function(x) { console.log(x); });
	   *
	   * Defining custom sequences
	   * -------------------------
	   *
	   * Defining your own type of sequence is relatively simple:
	   *
	   * 1. Pass a *method name* and an object containing *function overrides* to
	   *    {@link Sequence.define}. If the object includes a function called `init`,
	   *    this function will be called upon initialization.
	   * 2. The object should include at least either a `getIterator` method or an
	   *    `each` method. The former supports both asynchronous and synchronous
	   *    iteration, but is slightly more cumbersome to implement. The latter
	   *    supports synchronous iteration and can be automatically implemented in
	   *    terms of the former. You can also implement both if you want, e.g. to
	   *    optimize performance. For more info, see {@link Iterator} and
	   *    {@link AsyncSequence}.
	   *
	   * As a trivial example, the following code defines a new method, `sample`,
	   * which randomly may or may not include each element from its parent.
	   *
	   *     Lazy.Sequence.define("sample", {
	   *       each: function(fn) {
	   *         return this.parent.each(function(e) {
	   *           // 50/50 chance of including this element.
	   *           if (Math.random() > 0.5) {
	   *             return fn(e);
	   *           }
	   *         });
	   *       }
	   *     });
	   *
	   * (Of course, the above could also easily have been implemented using
	   * {@link #filter} instead of creating a custom sequence. But I *did* say this
	   * was a trivial example, to be fair.)
	   *
	   * Now it will be possible to create this type of sequence from any parent
	   * sequence by calling the method name you specified. In other words, you can
	   * now do this:
	   *
	   *     Lazy(arr).sample();
	   *     Lazy(arr).map(func).sample();
	   *     Lazy(arr).map(func).filter(pred).sample();
	   *
	   * Etc., etc.
	   *
	   * @public
	   * @constructor
	   */
	  function Sequence() {}

	  /**
	   * Create a new constructor function for a type inheriting from `Sequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `Sequence` prototype so that it can be chained with any other
	   *     sequence methods, like {@link #map}, {@link #filter}, etc.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. **Must** include either `getIterator` or `each` (or
	   *     both). *May* include an `init` method as well. For these overrides,
	   *     `this` will be the new sequence, and `this.parent` will be the base
	   *     sequence from which the new sequence was constructed.
	   * @returns {Function} A constructor for a new type inheriting from `Sequence`.
	   *
	   * @examples
	   * // This sequence type logs every element to the specified logger as it
	   * // iterates over it.
	   * Lazy.Sequence.define("verbose", {
	   *   init: function(logger) {
	   *     this.logger = logger;
	   *   },
	   *
	   *   each: function(fn) {
	   *     var logger = this.logger;
	   *     return this.parent.each(function(e, i) {
	   *       logger(e);
	   *       return fn(e, i);
	   *     });
	   *   }
	   * });
	   *
	   * Lazy([1, 2, 3]).verbose(logger).each(Lazy.noop) // calls logger 3 times
	   */
	  Sequence.define = function define(methodName, overrides) {
	    if (!overrides || (!overrides.getIterator && !overrides.each)) {
	      throw new Error("A custom sequence must implement *at least* getIterator or each!");
	    }

	    return defineSequenceType(Sequence, methodName, overrides);
	  };

	  /**
	   * Gets the number of elements in the sequence. In some cases, this may
	   * require eagerly evaluating the sequence.
	   *
	   * @public
	   * @returns {number} The number of elements in the sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).size();                 // => 3
	   * Lazy([1, 2]).map(Lazy.identity).size(); // => 2
	   * Lazy([1, 2, 3]).reject(isEven).size();  // => 2
	   * Lazy([1, 2, 3]).take(1).size();         // => 1
	   * Lazy({ foo: 1, bar: 2 }).size();        // => 2
	   * Lazy('hello').size();                   // => 5
	   */
	  Sequence.prototype.size = function size() {
	    return this.getIndex().length();
	  };

	  /**
	   * Creates an {@link Iterator} object with two methods, `moveNext` -- returning
	   * true or false -- and `current` -- returning the current value.
	   *
	   * This method is used when asynchronously iterating over sequences. Any type
	   * inheriting from `Sequence` must implement this method or it can't support
	   * asynchronous iteration.
	   *
	   * Note that **this method is not intended to be used directly by application
	   * code.** Rather, it is intended as a means for implementors to potentially
	   * define custom sequence types that support either synchronous or
	   * asynchronous iteration.
	   *
	   * @public
	   * @returns {Iterator} An iterator object.
	   *
	   * @examples
	   * var iterator = Lazy([1, 2]).getIterator();
	   *
	   * iterator.moveNext(); // => true
	   * iterator.current();  // => 1
	   * iterator.moveNext(); // => true
	   * iterator.current();  // => 2
	   * iterator.moveNext(); // => false
	   */
	  Sequence.prototype.getIterator = function getIterator() {
	    return new Iterator(this);
	  };

	  /**
	   * Gets the root sequence underlying the current chain of sequences.
	   */
	  Sequence.prototype.root = function root() {
	    return this.parent.root();
	  };

	  /**
	   * Whether or not the current sequence is an asynchronous one. This is more
	   * accurate than checking `instanceof {@link AsyncSequence}` because, for
	   * example, `Lazy([1, 2, 3]).async().map(Lazy.identity)` returns a sequence
	   * that iterates asynchronously even though it's not an instance of
	   * `AsyncSequence`.
	   *
	   * @returns {boolean} Whether or not the current sequence is an asynchronous one.
	   */
	  Sequence.prototype.isAsync = function isAsync() {
	    return this.parent ? this.parent.isAsync() : false;
	  };

	  /**
	   * Evaluates the sequence and produces the appropriate value (an array in most
	   * cases, an object for {@link ObjectLikeSequence}s or a string for
	   * {@link StringLikeSequence}s).
	   *
	   * @returns {Array|string|Object} The value resulting from fully evaluating
	   *     the sequence.
	   */
	  Sequence.prototype.value = function value() {
	    return this.toArray();
	  };

	  /**
	   * Applies the current transformation chain to a given source, returning the
	   * resulting value.
	   *
	   * @examples
	   * var sequence = Lazy([])
	   *   .map(function(x) { return x * -1; })
	   *   .filter(function(x) { return x % 2 === 0; });
	   *
	   * sequence.apply([1, 2, 3, 4]); // => [-2, -4]
	   */
	  Sequence.prototype.apply = function apply(source) {
	    var root = this.root(),
	        previousSource = root.source,
	        result;

	    try {
	      root.source = source;
	      result = this.value();
	    } finally {
	      root.source = previousSource;
	    }

	    return result;
	  };

	  /**
	   * The Iterator object provides an API for iterating over a sequence.
	   *
	   * The purpose of the `Iterator` type is mainly to offer an agnostic way of
	   * iterating over a sequence -- either synchronous (i.e. with a `while` loop)
	   * or asynchronously (with recursive calls to either `setTimeout` or --- if
	   * available --- `setImmediate`). It is not intended to be used directly by
	   * application code.
	   *
	   * @public
	   * @constructor
	   * @param {Sequence} sequence The sequence to iterate over.
	   */
	  function Iterator(sequence) {
	    this.sequence = sequence;
	    this.index    = -1;
	  }

	  /**
	   * Gets the current item this iterator is pointing to.
	   *
	   * @public
	   * @returns {*} The current item.
	   */
	  Iterator.prototype.current = function current() {
	    return this.cachedIndex && this.cachedIndex.get(this.index);
	  };

	  /**
	   * Moves the iterator to the next item in a sequence, if possible.
	   *
	   * @public
	   * @returns {boolean} True if the iterator is able to move to a new item, or else
	   *     false.
	   */
	  Iterator.prototype.moveNext = function moveNext() {
	    var cachedIndex = this.cachedIndex;

	    if (!cachedIndex) {
	      cachedIndex = this.cachedIndex = this.sequence.getIndex();
	    }

	    if (this.index >= cachedIndex.length() - 1) {
	      return false;
	    }

	    ++this.index;
	    return true;
	  };

	  /**
	   * Creates an array snapshot of a sequence.
	   *
	   * Note that for indefinite sequences, this method may raise an exception or
	   * (worse) cause the environment to hang.
	   *
	   * @public
	   * @returns {Array} An array containing the current contents of the sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).toArray() // => [1, 2, 3]
	   */
	  Sequence.prototype.toArray = function toArray() {
	    return this.reduce(function(arr, element) {
	      arr.push(element);
	      return arr;
	    }, []);
	  };

	  /**
	   * Provides an indexed view into the sequence.
	   *
	   * For sequences that are already indexed, this will simply return the
	   * sequence. For non-indexed sequences, this will eagerly evaluate the
	   * sequence.
	   *
	   * @returns {ArrayLikeSequence} A sequence containing the current contents of
	   *     the sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).filter(isEven)            // instanceof Lazy.Sequence
	   * Lazy([1, 2, 3]).filter(isEven).getIndex() // instanceof Lazy.ArrayLikeSequence
	   */
	  Sequence.prototype.getIndex = function getIndex() {
	    return new ArrayWrapper(this.toArray());
	  };

	  /**
	   * Returns the element at the specified index. Note that, for sequences that
	   * are not {@link ArrayLikeSequence}s, this may require partially evaluating
	   * the sequence, iterating to reach the result. (In other words for such
	   * sequences this method is not O(1).)
	   *
	   * @public
	   * @param {number} i The index to access.
	   * @returns {*} The element.
	   *
	   */
	  Sequence.prototype.get = function get(i) {
	    var element;
	    this.each(function(e, index) {
	      if (index === i) {
	        element = e;
	        return false;
	      }
	    });
	    return element;
	  };

	  /**
	   * Provides an indexed, memoized view into the sequence. This will cache the
	   * result whenever the sequence is first iterated, so that subsequent
	   * iterations will access the same element objects.
	   *
	   * @public
	   * @returns {ArrayLikeSequence} An indexed, memoized sequence containing this
	   *     sequence's elements, cached after the first iteration.
	   *
	   * @example
	   * function createObject() { return new Object(); }
	   *
	   * var plain    = Lazy.generate(createObject, 10),
	   *     memoized = Lazy.generate(createObject, 10).memoize();
	   *
	   * plain.toArray()[0] === plain.toArray()[0];       // => false
	   * memoized.toArray()[0] === memoized.toArray()[0]; // => true
	   */
	  Sequence.prototype.memoize = function memoize() {
	    return new MemoizedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function MemoizedSequence(parent) {
	    this.parent = parent;
	  }

	  // MemoizedSequence needs to have its prototype set up after ArrayLikeSequence

	  /**
	   * Creates an object from a sequence of key/value pairs.
	   *
	   * @public
	   * @returns {Object} An object with keys and values corresponding to the pairs
	   *     of elements in the sequence.
	   *
	   * @examples
	   * var details = [
	   *   ["first", "Dan"],
	   *   ["last", "Tao"],
	   *   ["age", 29]
	   * ];
	   *
	   * Lazy(details).toObject() // => { first: "Dan", last: "Tao", age: 29 }
	   */
	  Sequence.prototype.toObject = function toObject() {
	    return this.reduce(function(object, pair) {
	      object[pair[0]] = pair[1];
	      return object;
	    }, {});
	  };

	  /**
	   * Iterates over this sequence and executes a function for every element.
	   *
	   * @public
	   * @aka forEach
	   * @param {Function} fn The function to call on each element in the sequence.
	   *     Return false from the function to end the iteration.
	   * @returns {boolean} `true` if the iteration evaluated the entire sequence,
	   *     or `false` if iteration was ended early.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4]).each(fn) // calls fn 4 times
	   */
	  Sequence.prototype.each = function each(fn) {
	    var iterator = this.getIterator(),
	        i = -1;

	    while (iterator.moveNext()) {
	      if (fn(iterator.current(), ++i) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  Sequence.prototype.forEach = function forEach(fn) {
	    return this.each(fn);
	  };

	  /**
	   * Creates a new sequence whose values are calculated by passing this sequence's
	   * elements through some mapping function.
	   *
	   * @public
	   * @aka collect
	   * @param {Function} mapFn The mapping function used to project this sequence's
	   *     elements onto a new sequence. This function takes up to two arguments:
	   *     the element, and the current index.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function addIndexToValue(e, i) { return e + i; }
	   *
	   * Lazy([]).map(increment)              // sequence: []
	   * Lazy([1, 2, 3]).map(increment)       // sequence: [2, 3, 4]
	   * Lazy([1, 2, 3]).map(addIndexToValue) // sequence: [1, 3, 5]
	   *
	   * @benchmarks
	   * function increment(x) { return x + 1; }
	   *
	   * var smArr = Lazy.range(10).toArray(),
	   *     lgArr = Lazy.range(100).toArray();
	   *
	   * Lazy(smArr).map(increment).each(Lazy.noop) // lazy - 10 elements
	   * Lazy(lgArr).map(increment).each(Lazy.noop) // lazy - 100 elements
	   * _.each(_.map(smArr, increment), _.noop)    // lodash - 10 elements
	   * _.each(_.map(lgArr, increment), _.noop)    // lodash - 100 elements
	   */
	  Sequence.prototype.map = function map(mapFn) {
	    return new MappedSequence(this, createCallback(mapFn));
	  };

	  Sequence.prototype.collect = function collect(mapFn) {
	    return this.map(mapFn);
	  };

	  /**
	   * @constructor
	   */
	  function MappedSequence(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  MappedSequence.prototype = new Sequence();

	  MappedSequence.prototype.getIterator = function getIterator() {
	    return new MappingIterator(this.parent, this.mapFn);
	  };

	  MappedSequence.prototype.each = function each(fn) {
	    var mapFn = this.mapFn;
	    return this.parent.each(function(e, i) {
	      return fn(mapFn(e, i), i);
	    });
	  };

	  /**
	   * @constructor
	   */
	  function MappingIterator(sequence, mapFn) {
	    this.iterator = sequence.getIterator();
	    this.mapFn    = mapFn;
	    this.index    = -1;
	  }

	  MappingIterator.prototype.current = function current() {
	    return this.mapFn(this.iterator.current(), this.index);
	  };

	  MappingIterator.prototype.moveNext = function moveNext() {
	    if (this.iterator.moveNext()) {
	      ++this.index;
	      return true;
	    }

	    return false;
	  };

	  /**
	   * Creates a new sequence whose values are calculated by accessing the specified
	   * property from each element in this sequence.
	   *
	   * @public
	   * @param {string} propertyName The name of the property to access for every
	   *     element in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var people = [
	   *   { first: "Dan", last: "Tao" },
	   *   { first: "Bob", last: "Smith" }
	   * ];
	   *
	   * Lazy(people).pluck("last") // sequence: ["Tao", "Smith"]
	   */
	  Sequence.prototype.pluck = function pluck(property) {
	    return this.map(property);
	  };

	  /**
	   * Creates a new sequence whose values are calculated by invoking the specified
	   * function on each element in this sequence.
	   *
	   * @public
	   * @param {string} methodName The name of the method to invoke for every element
	   *     in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function Person(first, last) {
	   *   this.fullName = function fullName() {
	   *     return first + " " + last;
	   *   };
	   * }
	   *
	   * var people = [
	   *   new Person("Dan", "Tao"),
	   *   new Person("Bob", "Smith")
	   * ];
	   *
	   * Lazy(people).invoke("fullName") // sequence: ["Dan Tao", "Bob Smith"]
	   */
	  Sequence.prototype.invoke = function invoke(methodName) {
	    return this.map(function(e) {
	      return e[methodName]();
	    });
	  };

	  /**
	   * Creates a new sequence whose values are the elements of this sequence which
	   * satisfy the specified predicate.
	   *
	   * @public
	   * @aka select
	   * @param {Function} filterFn The predicate to call on each element in this
	   *     sequence, which returns true if the element should be included.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5, 6];
	   *
	   * Lazy(numbers).filter(isEven) // sequence: [2, 4, 6]
	   *
	   * @benchmarks
	   * function isEven(x) { return x % 2 === 0; }
	   *
	   * var smArr = Lazy.range(10).toArray(),
	   *     lgArr = Lazy.range(100).toArray();
	   *
	   * Lazy(smArr).filter(isEven).each(Lazy.noop) // lazy - 10 elements
	   * Lazy(lgArr).filter(isEven).each(Lazy.noop) // lazy - 100 elements
	   * _.each(_.filter(smArr, isEven), _.noop)    // lodash - 10 elements
	   * _.each(_.filter(lgArr, isEven), _.noop)    // lodash - 100 elements
	   */
	  Sequence.prototype.filter = function filter(filterFn) {
	    return new FilteredSequence(this, createCallback(filterFn));
	  };

	  Sequence.prototype.select = function select(filterFn) {
	    return this.filter(filterFn);
	  };

	  /**
	   * @constructor
	   */
	  function FilteredSequence(parent, filterFn) {
	    this.parent   = parent;
	    this.filterFn = filterFn;
	  }

	  FilteredSequence.prototype = new Sequence();

	  FilteredSequence.prototype.getIterator = function getIterator() {
	    return new FilteringIterator(this.parent, this.filterFn);
	  };

	  FilteredSequence.prototype.each = function each(fn) {
	    var filterFn = this.filterFn,
	        j = 0;

	    return this.parent.each(function(e, i) {
	      if (filterFn(e, i)) {
	        return fn(e, j++);
	      }
	    });
	  };

	  FilteredSequence.prototype.reverse = function reverse() {
	    return this.parent.reverse().filter(this.filterFn);
	  };

	  /**
	   * @constructor
	   */
	  function FilteringIterator(sequence, filterFn) {
	    this.iterator = sequence.getIterator();
	    this.filterFn = filterFn;
	    this.index    = 0;
	  }

	  FilteringIterator.prototype.current = function current() {
	    return this.value;
	  };

	  FilteringIterator.prototype.moveNext = function moveNext() {
	    var iterator = this.iterator,
	        filterFn = this.filterFn,
	        value;

	    while (iterator.moveNext()) {
	      value = iterator.current();
	      if (filterFn(value, this.index++)) {
	        this.value = value;
	        return true;
	      }
	    }

	    this.value = undefined;
	    return false;
	  };

	  /**
	   * Creates a new sequence whose values exclude the elements of this sequence
	   * identified by the specified predicate.
	   *
	   * @public
	   * @param {Function} rejectFn The predicate to call on each element in this
	   *     sequence, which returns true if the element should be omitted.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).reject(isEven)              // sequence: [1, 3, 5]
	   * Lazy([{ foo: 1 }, { bar: 2 }]).reject('foo')      // sequence: [{ bar: 2 }]
	   * Lazy([{ foo: 1 }, { foo: 2 }]).reject({ foo: 2 }) // sequence: [{ foo: 1 }]
	   */
	  Sequence.prototype.reject = function reject(rejectFn) {
	    rejectFn = createCallback(rejectFn);
	    return this.filter(function(e) { return !rejectFn(e); });
	  };

	  /**
	   * Creates a new sequence whose values have the specified type, as determined
	   * by the `typeof` operator.
	   *
	   * @public
	   * @param {string} type The type of elements to include from the underlying
	   *     sequence, i.e. where `typeof [element] === [type]`.
	   * @returns {Sequence} The new sequence, comprising elements of the specified
	   *     type.
	   *
	   * @examples
	   * Lazy([1, 2, 'foo', 'bar']).ofType('number')  // sequence: [1, 2]
	   * Lazy([1, 2, 'foo', 'bar']).ofType('string')  // sequence: ['foo', 'bar']
	   * Lazy([1, 2, 'foo', 'bar']).ofType('boolean') // sequence: []
	   */
	  Sequence.prototype.ofType = function ofType(type) {
	    return this.filter(function(e) { return typeof e === type; });
	  };

	  /**
	   * Creates a new sequence whose values are the elements of this sequence with
	   * property names and values matching those of the specified object.
	   *
	   * @public
	   * @param {Object} properties The properties that should be found on every
	   *     element that is to be included in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var people = [
	   *   { first: "Dan", last: "Tao" },
	   *   { first: "Bob", last: "Smith" }
	   * ];
	   *
	   * Lazy(people).where({ first: "Dan" }) // sequence: [{ first: "Dan", last: "Tao" }]
	   *
	   * @benchmarks
	   * var animals = ["dog", "cat", "mouse", "horse", "pig", "snake"];
	   *
	   * Lazy(animals).where({ length: 3 }).each(Lazy.noop) // lazy
	   * _.each(_.where(animals, { length: 3 }), _.noop)    // lodash
	   */
	  Sequence.prototype.where = function where(properties) {
	    return this.filter(properties);
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, but to be iterated
	   * in the opposite order.
	   *
	   * Note that in some (but not all) cases, the only way to create such a sequence
	   * may require iterating the entire underlying source when `each` is called.
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).reverse() // sequence: [3, 2, 1]
	   * Lazy([]).reverse()        // sequence: []
	   */
	  Sequence.prototype.reverse = function reverse() {
	    return new ReversedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function ReversedSequence(parent) {
	    this.parent = parent;
	  }

	  ReversedSequence.prototype = new Sequence();

	  ReversedSequence.prototype.getIterator = function getIterator() {
	    return new ReversedIterator(this.parent);
	  };

	  /**
	   * @constuctor
	   */
	  function ReversedIterator(sequence) {
	    this.sequence = sequence;
	  }

	  ReversedIterator.prototype.current = function current() {
	    return this.getIndex().get(this.index);
	  };

	  ReversedIterator.prototype.moveNext = function moveNext() {
	    var index  = this.getIndex(),
	        length = index.length();

	    if (typeof this.index === "undefined") {
	      this.index = length;
	    }

	    return (--this.index >= 0);
	  };

	  ReversedIterator.prototype.getIndex = function getIndex() {
	    if (!this.cachedIndex) {
	      this.cachedIndex = this.sequence.getIndex();
	    }

	    return this.cachedIndex;
	  };

	  /**
	   * Creates a new sequence with all of the elements of this one, plus those of
	   * the given array(s).
	   *
	   * @public
	   * @param {...*} var_args One or more values (or arrays of values) to use for
	   *     additional items after this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var left  = [1, 2, 3];
	   * var right = [4, 5, 6];
	   *
	   * Lazy(left).concat(right)         // sequence: [1, 2, 3, 4, 5, 6]
	   * Lazy(left).concat(Lazy(right))   // sequence: [1, 2, 3, 4, 5, 6]
	   * Lazy(left).concat(right, [7, 8]) // sequence: [1, 2, 3, 4, 5, 6, 7, 8]
	   */
	  Sequence.prototype.concat = function concat(var_args) {
	    return new ConcatenatedSequence(this, arraySlice.call(arguments, 0));
	  };

	  /**
	   * @constructor
	   */
	  function ConcatenatedSequence(parent, arrays) {
	    this.parent = parent;
	    this.arrays = arrays;
	  }

	  ConcatenatedSequence.prototype = new Sequence();

	  ConcatenatedSequence.prototype.each = function each(fn) {
	    var done = false,
	        i = 0;

	    this.parent.each(function(e) {
	      if (fn(e, i++) === false) {
	        done = true;
	        return false;
	      }
	    });

	    if (!done) {
	      Lazy(this.arrays).flatten().each(function(e) {
	        if (fn(e, i++) === false) {
	          return false;
	        }
	      });
	    }
	  };

	  /**
	   * Creates a new sequence comprising the first N elements from this sequence, OR
	   * (if N is `undefined`) simply returns the first element of this sequence.
	   *
	   * @public
	   * @aka head, take
	   * @param {number=} count The number of elements to take from this sequence. If
	   *     this value exceeds the length of the sequence, the resulting sequence
	   *     will be essentially the same as this one.
	   * @returns {*} The new sequence (or the first element from this sequence if
	   *     no count was given).
	   *
	   * @examples
	   * function powerOfTwo(exp) {
	   *   return Math.pow(2, exp);
	   * }
	   *
	   * Lazy.generate(powerOfTwo).first()          // => 1
	   * Lazy.generate(powerOfTwo).first(5)         // sequence: [1, 2, 4, 8, 16]
	   * Lazy.generate(powerOfTwo).skip(2).first()  // => 4
	   * Lazy.generate(powerOfTwo).skip(2).first(2) // sequence: [4, 8]
	   */
	  Sequence.prototype.first = function first(count) {
	    if (typeof count === "undefined") {
	      return getFirst(this);
	    }
	    return new TakeSequence(this, count);
	  };

	  Sequence.prototype.head =
	  Sequence.prototype.take = function (count) {
	    return this.first(count);
	  };

	  /**
	   * @constructor
	   */
	  function TakeSequence(parent, count) {
	    this.parent = parent;
	    this.count  = count;
	  }

	  TakeSequence.prototype = new Sequence();

	  TakeSequence.prototype.getIterator = function getIterator() {
	    return new TakeIterator(this.parent, this.count);
	  };

	  TakeSequence.prototype.each = function each(fn) {
	    var count = this.count,
	        i     = 0;

	    var result;
	    var handle = this.parent.each(function(e) {
	      if (i < count) { result = fn(e, i++); }
	      if (i >= count) { return false; }
	      return result;
	    });

	    if (handle instanceof AsyncHandle) {
	      return handle;
	    }

	    return i === count && result !== false;
	  };

	  /**
	   * @constructor
	   */
	  function TakeIterator(sequence, count) {
	    this.iterator = sequence.getIterator();
	    this.count    = count;
	  }

	  TakeIterator.prototype.current = function current() {
	    return this.iterator.current();
	  };

	  TakeIterator.prototype.moveNext = function moveNext() {
	    return ((--this.count >= 0) && this.iterator.moveNext());
	  };

	  /**
	   * Creates a new sequence comprising the elements from the head of this sequence
	   * that satisfy some predicate. Once an element is encountered that doesn't
	   * satisfy the predicate, iteration will stop.
	   *
	   * @public
	   * @param {Function} predicate
	   * @returns {Sequence} The new sequence
	   *
	   * @examples
	   * function lessThan(x) {
	   *   return function(y) {
	   *     return y < x;
	   *   };
	   * }
	   *
	   * Lazy([1, 2, 3, 4]).takeWhile(lessThan(3)) // sequence: [1, 2]
	   * Lazy([1, 2, 3, 4]).takeWhile(lessThan(0)) // sequence: []
	   */
	  Sequence.prototype.takeWhile = function takeWhile(predicate) {
	    return new TakeWhileSequence(this, predicate);
	  };

	  /**
	   * @constructor
	   */
	  function TakeWhileSequence(parent, predicate) {
	    this.parent    = parent;
	    this.predicate = predicate;
	  }

	  TakeWhileSequence.prototype = new Sequence();

	  TakeWhileSequence.prototype.each = function each(fn) {
	    var predicate = this.predicate,
	        finished = false,
	        j = 0;

	    var result = this.parent.each(function(e, i) {
	      if (!predicate(e, i)) {
	        finished = true;
	        return false;
	      }

	      return fn(e, j++);
	    });

	    if (result instanceof AsyncHandle) {
	      return result;
	    }

	    return finished;
	  };

	  /**
	   * Creates a new sequence comprising all but the last N elements of this
	   * sequence.
	   *
	   * @public
	   * @param {number=} count The number of items to omit from the end of the
	   *     sequence (defaults to 1).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4]).initial()                    // sequence: [1, 2, 3]
	   * Lazy([1, 2, 3, 4]).initial(2)                   // sequence: [1, 2]
	   * Lazy([1, 2, 3]).filter(Lazy.identity).initial() // sequence: [1, 2]
	   */
	  Sequence.prototype.initial = function initial(count) {
	    return new InitialSequence(this, count);
	  };

	  function InitialSequence(parent, count) {
	    this.parent = parent;
	    this.count = typeof count === "number" ? count : 1;
	  }

	  InitialSequence.prototype = new Sequence();

	  InitialSequence.prototype.each = function each(fn) {
	    var index = this.parent.getIndex();
	    return index.take(index.length() - this.count).each(fn);
	  };

	  /**
	   * Creates a new sequence comprising the last N elements of this sequence, OR
	   * (if N is `undefined`) simply returns the last element of this sequence.
	   *
	   * @public
	   * @param {number=} count The number of items to take from the end of the
	   *     sequence.
	   * @returns {*} The new sequence (or the last element from this sequence
	   *     if no count was given).
	   *
	   * @examples
	   * Lazy([1, 2, 3]).last()                 // => 3
	   * Lazy([1, 2, 3]).last(2)                // sequence: [2, 3]
	   * Lazy([1, 2, 3]).filter(isEven).last(2) // sequence: [2]
	   */
	  Sequence.prototype.last = function last(count) {
	    if (typeof count === "undefined") {
	      return this.reverse().first();
	    }
	    return this.reverse().take(count).reverse();
	  };

	  /**
	   * Returns the first element in this sequence with property names and values
	   * matching those of the specified object.
	   *
	   * @public
	   * @param {Object} properties The properties that should be found on some
	   *     element in this sequence.
	   * @returns {*} The found element, or `undefined` if none exists in this
	   *     sequence.
	   *
	   * @examples
	   * var words = ["foo", "bar"];
	   *
	   * Lazy(words).findWhere({ 0: "f" }); // => "foo"
	   * Lazy(words).findWhere({ 0: "z" }); // => undefined
	   */
	  Sequence.prototype.findWhere = function findWhere(properties) {
	    return this.where(properties).first();
	  };

	  /**
	   * Creates a new sequence comprising all but the first N elements of this
	   * sequence.
	   *
	   * @public
	   * @aka skip, tail, rest
	   * @param {number=} count The number of items to omit from the beginning of the
	   *     sequence (defaults to 1).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4]).rest()  // sequence: [2, 3, 4]
	   * Lazy([1, 2, 3, 4]).rest(0) // sequence: [1, 2, 3, 4]
	   * Lazy([1, 2, 3, 4]).rest(2) // sequence: [3, 4]
	   * Lazy([1, 2, 3, 4]).rest(5) // sequence: []
	   */
	  Sequence.prototype.rest = function rest(count) {
	    return new DropSequence(this, count);
	  };

	  Sequence.prototype.skip =
	  Sequence.prototype.tail =
	  Sequence.prototype.drop = function drop(count) {
	    return this.rest(count);
	  };

	  /**
	   * @constructor
	   */
	  function DropSequence(parent, count) {
	    this.parent = parent;
	    this.count  = typeof count === "number" ? count : 1;
	  }

	  DropSequence.prototype = new Sequence();

	  DropSequence.prototype.each = function each(fn) {
	    var count   = this.count,
	        dropped = 0,
	        i       = 0;

	    return this.parent.each(function(e) {
	      if (dropped++ < count) { return; }
	      return fn(e, i++);
	    });
	  };

	  /**
	   * Creates a new sequence comprising the elements from this sequence *after*
	   * those that satisfy some predicate. The sequence starts with the first
	   * element that does not match the predicate.
	   *
	   * @public
	   * @aka skipWhile
	   * @param {Function} predicate
	   * @returns {Sequence} The new sequence
	   */
	  Sequence.prototype.dropWhile = function dropWhile(predicate) {
	    return new DropWhileSequence(this, predicate);
	  };

	  Sequence.prototype.skipWhile = function skipWhile(predicate) {
	    return this.dropWhile(predicate);
	  };

	  /**
	   * @constructor
	   */
	  function DropWhileSequence(parent, predicate) {
	    this.parent    = parent;
	    this.predicate = predicate;
	  }

	  DropWhileSequence.prototype = new Sequence();

	  DropWhileSequence.prototype.each = function each(fn) {
	    var predicate = this.predicate,
	        done      = false;

	    return this.parent.each(function(e) {
	      if (!done) {
	        if (predicate(e)) {
	          return;
	        }

	        done = true;
	      }

	      return fn(e);
	    });
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, but ordered
	   * using the specified comparison function.
	   *
	   * This has essentially the same behavior as calling
	   * [`Array#sort`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort),
	   * but obviously instead of modifying the collection it returns a new
	   * {@link Sequence} object.
	   *
	   * @public
	   * @param {Function=} sortFn The function used to compare elements in the
	   *     sequence. The function will be passed two elements and should return:
	   *     - 1 if the first is greater
	   *     - -1 if the second is greater
	   *     - 0 if the two values are the same
	   * @param {boolean} descending Whether or not the resulting sequence should be
	   *     in descending order (defaults to `false`).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([5, 10, 1]).sort()                // sequence: [1, 5, 10]
	   * Lazy(['foo', 'bar']).sort()            // sequence: ['bar', 'foo']
	   * Lazy(['b', 'c', 'a']).sort(null, true) // sequence: ['c', 'b', 'a']
	   * Lazy([5, 10, 1]).sort(null, true)      // sequence: [10, 5, 1]
	   *
	   * // Sorting w/ custom comparison function
	   * Lazy(['a', 'ab', 'aa', 'ba', 'b', 'abc']).sort(function compare(x, y) {
	   *   if (x.length && (x.length !== y.length)) { return compare(x.length, y.length); }
	   *   if (x === y) { return 0; }
	   *   return x > y ? 1 : -1;
	   * });
	   * // => sequence: ['a', 'b', 'aa', 'ab', 'ba', 'abc']
	   */
	  Sequence.prototype.sort = function sort(sortFn, descending) {
	    sortFn || (sortFn = compare);
	    if (descending) { sortFn = reverseArguments(sortFn); }
	    return new SortedSequence(this, sortFn);
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, but ordered by
	   * the results of the given function.
	   *
	   * You can pass:
	   *
	   * - a *string*, to sort by the named property
	   * - a function, to sort by the result of calling the function on each element
	   *
	   * @public
	   * @param {Function} sortFn The function to call on the elements in this
	   *     sequence, in order to sort them.
	   * @param {boolean} descending Whether or not the resulting sequence should be
	   *     in descending order (defaults to `false`).
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function population(country) {
	   *   return country.pop;
	   * }
	   *
	   * function area(country) {
	   *   return country.sqkm;
	   * }
	   *
	   * var countries = [
	   *   { name: "USA", pop: 320000000, sqkm: 9600000 },
	   *   { name: "Brazil", pop: 194000000, sqkm: 8500000 },
	   *   { name: "Nigeria", pop: 174000000, sqkm: 924000 },
	   *   { name: "China", pop: 1350000000, sqkm: 9700000 },
	   *   { name: "Russia", pop: 143000000, sqkm: 17000000 },
	   *   { name: "Australia", pop: 23000000, sqkm: 7700000 }
	   * ];
	   *
	   * Lazy(countries).sortBy(population).last(3).pluck('name') // sequence: ["Brazil", "USA", "China"]
	   * Lazy(countries).sortBy(area).last(3).pluck('name')       // sequence: ["USA", "China", "Russia"]
	   * Lazy(countries).sortBy(area, true).first(3).pluck('name') // sequence: ["Russia", "China", "USA"]
	   *
	   * @benchmarks
	   * var randoms = Lazy.generate(Math.random).take(100).toArray();
	   *
	   * Lazy(randoms).sortBy(Lazy.identity).each(Lazy.noop) // lazy
	   * _.each(_.sortBy(randoms, Lazy.identity), _.noop)    // lodash
	   */
	  Sequence.prototype.sortBy = function sortBy(sortFn, descending) {
	    sortFn = createComparator(sortFn);
	    if (descending) { sortFn = reverseArguments(sortFn); }
	    return new SortedSequence(this, sortFn);
	  };

	  /**
	   * @constructor
	   */
	  function SortedSequence(parent, sortFn) {
	    this.parent = parent;
	    this.sortFn = sortFn;
	  }

	  SortedSequence.prototype = new Sequence();

	  SortedSequence.prototype.each = function each(fn) {
	    var sortFn = this.sortFn,
	        result = this.parent.toArray();

	    result.sort(sortFn);

	    return forEach(result, fn);
	  };

	  /**
	   * @examples
	   * var items = [{ a: 4 }, { a: 3 }, { a: 5 }];
	   *
	   * Lazy(items).sortBy('a').reverse();
	   * // => sequence: [{ a: 5 }, { a: 4 }, { a: 3 }]
	   *
	   * Lazy(items).sortBy('a').reverse().reverse();
	   * // => sequence: [{ a: 3 }, { a: 4 }, { a: 5 }]
	   */
	  SortedSequence.prototype.reverse = function reverse() {
	    return new SortedSequence(this.parent, reverseArguments(this.sortFn));
	  };

	  /**
	   * Creates a new {@link ObjectLikeSequence} comprising the elements in this
	   * one, grouped together according to some key. The value associated with each
	   * key in the resulting object-like sequence is an array containing all of
	   * the elements in this sequence with that key.
	   *
	   * @public
	   * @param {Function|string} keyFn The function to call on the elements in this
	   *     sequence to obtain a key by which to group them, or a string representing
	   *     a parameter to read from all the elements in this sequence.
	   * @param {Function|string} valFn (Optional) The function to call on the elements
	   *     in this sequence to assign to the value for each instance to appear in the
	   *     group, or a string representing a parameter to read from all the elements
	   *     in this sequence.
	   * @returns {ObjectLikeSequence} The new sequence.
	   *
	   * @examples
	   * function oddOrEven(x) {
	   *   return x % 2 === 0 ? 'even' : 'odd';
	   * }
	   * function square(x) {
	   *   return x*x;
	   * }
	   *
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).groupBy(oddOrEven)                     // sequence: { odd: [1, 3, 5], even: [2, 4] }
	   * Lazy(numbers).groupBy(oddOrEven).get("odd")          // => [1, 3, 5]
	   * Lazy(numbers).groupBy(oddOrEven).get("foo")          // => undefined
	   * Lazy(numbers).groupBy(oddOrEven, square).get("even") // => [4, 16]
	   *
	   * Lazy([
	   *   { name: 'toString' },
	   *   { name: 'toString' }
	   * ]).groupBy('name');
	   * // => sequence: {
	   *   'toString': [
	   *     { name: 'toString' },
	   *     { name: 'toString' }
	   *   ]
	   * }
	   */
	  Sequence.prototype.groupBy = function groupBy(keyFn, valFn) {
	    return new GroupedSequence(this, keyFn, valFn);
	  };

	  /**
	   * @constructor
	   */
	  function GroupedSequence(parent, keyFn, valFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	    this.valFn  = valFn;
	  }

	  // GroupedSequence must have its prototype set after ObjectLikeSequence has
	  // been fully initialized.

	  /**
	   * Creates a new {@link ObjectLikeSequence} comprising the elements in this
	   * one, indexed according to some key.
	   *
	   * @public
	   * @param {Function|string} keyFn The function to call on the elements in this
	   *     sequence to obtain a key by which to index them, or a string
	   *     representing a property to read from all the elements in this sequence.
	   * @param {Function|string} valFn (Optional) The function to call on the elements
	   *     in this sequence to assign to the value of the indexed object, or a string
	   *     representing a parameter to read from all the elements in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var people = [
	   *   { name: 'Bob', age: 25 },
	   *   { name: 'Fred', age: 34 }
	   * ];
	   *
	   * var bob  = people[0],
	   *     fred = people[1];
	   *
	   * Lazy(people).indexBy('name')        // sequence: { 'Bob': bob, 'Fred': fred }
	   * Lazy(people).indexBy('name', 'age') // sequence: { 'Bob': 25, 'Fred': 34 }
	   */
	  Sequence.prototype.indexBy = function(keyFn, valFn) {
	    return new IndexedSequence(this, keyFn, valFn);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedSequence(parent, keyFn, valFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	    this.valFn  = valFn;
	  }

	  // IndexedSequence must have its prototype set after ObjectLikeSequence has
	  // been fully initialized.

	  /**
	   * Creates a new {@link ObjectLikeSequence} containing the unique keys of all
	   * the elements in this sequence, each paired with the number of elements
	   * in this sequence having that key.
	   *
	   * @public
	   * @param {Function|string} keyFn The function to call on the elements in this
	   *     sequence to obtain a key by which to count them, or a string representing
	   *     a parameter to read from all the elements in this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * function oddOrEven(x) {
	   *   return x % 2 === 0 ? 'even' : 'odd';
	   * }
	   *
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).countBy(oddOrEven)            // sequence: { odd: 3, even: 2 }
	   * Lazy(numbers).countBy(oddOrEven).get("odd") // => 3
	   * Lazy(numbers).countBy(oddOrEven).get("foo") // => undefined
	   */
	  Sequence.prototype.countBy = function countBy(keyFn) {
	    return new CountedSequence(this, keyFn);
	  };

	  /**
	   * @constructor
	   */
	  function CountedSequence(parent, keyFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	  }

	  // CountedSequence, like GroupedSequence, must have its prototype set after
	  // ObjectLikeSequence has been fully initialized.

	  /**
	   * Creates a new sequence with every unique element from this one appearing
	   * exactly once (i.e., with duplicates removed).
	   *
	   * @public
	   * @aka unique
	   * @param {Function} keyFn An optional function to produce the key for each
	   *     object. This key is then tested for uniqueness as  opposed to the
	   *     object reference.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 2, 3, 3, 3]).uniq() // sequence: [1, 2, 3]
	   * Lazy([{ name: 'mike' }, 
	   * 	{ name: 'sarah' }, 
	   * 	{ name: 'mike' }
	   * ]).uniq('name')
	   * // sequence: [{ name: 'mike' }, { name: 'sarah' }]
	   *
	   * @benchmarks
	   * function randomOf(array) {
	   *   return function() {
	   *     return array[Math.floor(Math.random() * array.length)];
	   *   };
	   * }
	   *
	   * var mostUnique = Lazy.generate(randomOf(_.range(100)), 100).toArray(),
	   *     someUnique = Lazy.generate(randomOf(_.range(50)), 100).toArray(),
	   *     mostDupes  = Lazy.generate(randomOf(_.range(5)), 100).toArray();
	   *
	   * Lazy(mostUnique).uniq().each(Lazy.noop) // lazy - mostly unique elements
	   * Lazy(someUnique).uniq().each(Lazy.noop) // lazy - some unique elements
	   * Lazy(mostDupes).uniq().each(Lazy.noop)  // lazy - mostly duplicate elements
	   * _.each(_.uniq(mostUnique), _.noop)      // lodash - mostly unique elements
	   * _.each(_.uniq(someUnique), _.noop)      // lodash - some unique elements
	   * _.each(_.uniq(mostDupes), _.noop)       // lodash - mostly duplicate elements
	   */
	  Sequence.prototype.uniq = function uniq(keyFn) {
	    return new UniqueSequence(this, keyFn);
	  };

	  Sequence.prototype.unique = function unique(keyFn) {
	    return this.uniq(keyFn);
	  };

	  /**
	   * @constructor
	   */
	  function UniqueSequence(parent, keyFn) {
	    this.parent = parent;
	    this.keyFn  = keyFn;
	  }

	  UniqueSequence.prototype = new Sequence();

	  UniqueSequence.prototype.each = function each(fn) {
	    var cache = new Set(),
	        keyFn = this.keyFn,
	        i     = 0;

	    if (keyFn) {
	      keyFn = createCallback(keyFn);
	      return this.parent.each(function(e) {
	        if (cache.add(keyFn(e))) {
	          return fn(e, i++);
	        }
	      });

	    } else {
	      return this.parent.each(function(e) {
	        if (cache.add(e)) {
	          return fn(e, i++);
	        }
	      });
	    }
	  };

	  /**
	   * Creates a new sequence by combining the elements from this sequence with
	   * corresponding elements from the specified array(s).
	   *
	   * @public
	   * @param {...Array} var_args One or more arrays of elements to combine with
	   *     those of this sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2]).zip([3, 4]) // sequence: [[1, 3], [2, 4]]
	   *
	   * @benchmarks
	   * var smArrL = Lazy.range(10).toArray(),
	   *     smArrR = Lazy.range(10, 20).toArray(),
	   *     lgArrL = Lazy.range(100).toArray(),
	   *     lgArrR = Lazy.range(100, 200).toArray();
	   *
	   * Lazy(smArrL).zip(smArrR).each(Lazy.noop) // lazy - zipping 10-element arrays
	   * Lazy(lgArrL).zip(lgArrR).each(Lazy.noop) // lazy - zipping 100-element arrays
	   * _.each(_.zip(smArrL, smArrR), _.noop)    // lodash - zipping 10-element arrays
	   * _.each(_.zip(lgArrL, lgArrR), _.noop)    // lodash - zipping 100-element arrays
	   */
	  Sequence.prototype.zip = function zip(var_args) {
	    if (arguments.length === 1) {
	      return new SimpleZippedSequence(this, (/** @type {Array} */ var_args));
	    } else {
	      return new ZippedSequence(this, arraySlice.call(arguments, 0));
	    }
	  };

	  /**
	   * @constructor
	   */
	  function ZippedSequence(parent, arrays) {
	    this.parent = parent;
	    this.arrays = arrays;
	  }

	  ZippedSequence.prototype = new Sequence();

	  ZippedSequence.prototype.each = function each(fn) {
	    var arrays = this.arrays,
	        i = 0;
	    this.parent.each(function(e) {
	      var group = [e];
	      for (var j = 0; j < arrays.length; ++j) {
	        if (arrays[j].length > i) {
	          group.push(arrays[j][i]);
	        }
	      }
	      return fn(group, i++);
	    });
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, in a randomized
	   * order.
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).shuffle().value() // =~ [1, 2, 3, 4, 5]
	   */
	  Sequence.prototype.shuffle = function shuffle() {
	    return new ShuffledSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function ShuffledSequence(parent) {
	    this.parent = parent;
	  }

	  ShuffledSequence.prototype = new Sequence();

	  ShuffledSequence.prototype.each = function each(fn) {
	    var shuffled = this.parent.toArray(),
	        floor = Math.floor,
	        random = Math.random,
	        j = 0;

	    for (var i = shuffled.length - 1; i > 0; --i) {
	      swap(shuffled, i, floor(random() * (i + 1)));
	      if (fn(shuffled[i], j++) === false) {
	        return;
	      }
	    }
	    fn(shuffled[0], j);
	  };

	  /**
	   * Creates a new sequence with every element from this sequence, and with arrays
	   * exploded so that a sequence of arrays (of arrays) becomes a flat sequence of
	   * values.
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, [2, 3], [4, [5]]]).flatten() // sequence: [1, 2, 3, 4, 5]
	   * Lazy([1, Lazy([2, 3])]).flatten()     // sequence: [1, 2, 3]
	   */
	  Sequence.prototype.flatten = function flatten() {
	    return new FlattenedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function FlattenedSequence(parent) {
	    this.parent = parent;
	  }

	  FlattenedSequence.prototype = new Sequence();

	  FlattenedSequence.prototype.each = function each(fn) {
	    var index = 0;

	    return this.parent.each(function recurseVisitor(e) {
	      if (e instanceof Array) {
	        return forEach(e, recurseVisitor);
	      }

	      if (e instanceof Sequence) {
	        return e.each(recurseVisitor);
	      }

	      return fn(e, index++);
	    });
	  };

	  /**
	   * Creates a new sequence with the same elements as this one, except for all
	   * falsy values (`false`, `0`, `""`, `null`, and `undefined`).
	   *
	   * @public
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy(["foo", null, "bar", undefined]).compact() // sequence: ["foo", "bar"]
	   */
	  Sequence.prototype.compact = function compact() {
	    return this.filter(function(e) { return !!e; });
	  };

	  /**
	   * Creates a new sequence with all the elements of this sequence that are not
	   * also among the specified arguments.
	   *
	   * @public
	   * @aka difference
	   * @param {...*} var_args The values, or array(s) of values, to be excluded from the
	   *     resulting sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).without(2, 3)   // sequence: [1, 4, 5]
	   * Lazy([1, 2, 3, 4, 5]).without([4, 5]) // sequence: [1, 2, 3]
	   */
	  Sequence.prototype.without = function without(var_args) {
	    return new WithoutSequence(this, arraySlice.call(arguments, 0));
	  };

	  Sequence.prototype.difference = function difference(var_args) {
	    return this.without.apply(this, arguments);
	  };

	  /**
	   * @constructor
	   */
	  function WithoutSequence(parent, values) {
	    this.parent = parent;
	    this.values = values;
	  }

	  WithoutSequence.prototype = new Sequence();

	  WithoutSequence.prototype.each = function each(fn) {
	    var set = createSet(this.values),
	        i = 0;
	    return this.parent.each(function(e) {
	      if (!set.contains(e)) {
	        return fn(e, i++);
	      }
	    });
	  };

	  /**
	   * Creates a new sequence with all the unique elements either in this sequence
	   * or among the specified arguments.
	   *
	   * @public
	   * @param {...*} var_args The values, or array(s) of values, to be additionally
	   *     included in the resulting sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy(["foo", "bar"]).union([])             // sequence: ["foo", "bar"]
	   * Lazy(["foo", "bar"]).union(["bar", "baz"]) // sequence: ["foo", "bar", "baz"]
	   */
	  Sequence.prototype.union = function union(var_args) {
	    return this.concat(var_args).uniq();
	  };

	  /**
	   * Creates a new sequence with all the elements of this sequence that also
	   * appear among the specified arguments.
	   *
	   * @public
	   * @param {...*} var_args The values, or array(s) of values, in which elements
	   *     from this sequence must also be included to end up in the resulting sequence.
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * Lazy(["foo", "bar"]).intersection([])             // sequence: []
	   * Lazy(["foo", "bar"]).intersection(["bar", "baz"]) // sequence: ["bar"]
	   */
	  Sequence.prototype.intersection = function intersection(var_args) {
	    if (arguments.length === 1 && arguments[0] instanceof Array) {
	      return new SimpleIntersectionSequence(this, (/** @type {Array} */ var_args));
	    } else {
	      return new IntersectionSequence(this, arraySlice.call(arguments, 0));
	    }
	  };

	  /**
	   * @constructor
	   */
	  function IntersectionSequence(parent, arrays) {
	    this.parent = parent;
	    this.arrays = arrays;
	  }

	  IntersectionSequence.prototype = new Sequence();

	  IntersectionSequence.prototype.each = function each(fn) {
	    var sets = Lazy(this.arrays).map(function(values) {
	      return new UniqueMemoizer(Lazy(values).getIterator());
	    });

	    var setIterator = new UniqueMemoizer(sets.getIterator()),
	        i = 0;

	    return this.parent.each(function(e) {
	      var includedInAll = true;
	      setIterator.each(function(set) {
	        if (!set.contains(e)) {
	          includedInAll = false;
	          return false;
	        }
	      });

	      if (includedInAll) {
	        return fn(e, i++);
	      }
	    });
	  };

	  /**
	   * @constructor
	   */
	  function UniqueMemoizer(iterator) {
	    this.iterator     = iterator;
	    this.set          = new Set();
	    this.memo         = [];
	    this.currentValue = undefined;
	  }

	  UniqueMemoizer.prototype.current = function current() {
	    return this.currentValue;
	  };

	  UniqueMemoizer.prototype.moveNext = function moveNext() {
	    var iterator = this.iterator,
	        set = this.set,
	        memo = this.memo,
	        current;

	    while (iterator.moveNext()) {
	      current = iterator.current();
	      if (set.add(current)) {
	        memo.push(current);
	        this.currentValue = current;
	        return true;
	      }
	    }
	    return false;
	  };

	  UniqueMemoizer.prototype.each = function each(fn) {
	    var memo = this.memo,
	        length = memo.length,
	        i = -1;

	    while (++i < length) {
	      if (fn(memo[i], i) === false) {
	        return false;
	      }
	    }

	    while (this.moveNext()) {
	      if (fn(this.currentValue, i++) === false) {
	        break;
	      }
	    }
	  };

	  UniqueMemoizer.prototype.contains = function contains(e) {
	    if (this.set.contains(e)) {
	      return true;
	    }

	    while (this.moveNext()) {
	      if (this.currentValue === e) {
	        return true;
	      }
	    }

	    return false;
	  };

	  /**
	   * Checks whether every element in this sequence satisfies a given predicate.
	   *
	   * @public
	   * @aka all
	   * @param {Function} predicate A function to call on (potentially) every element
	   *     in this sequence.
	   * @returns {boolean} True if `predicate` returns true for every element in the
	   *     sequence (or the sequence is empty). False if `predicate` returns false
	   *     for at least one element.
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * var objects = [{ foo: true }, { foo: false, bar: true }];
	   *
	   * Lazy(numbers).every(isEven)     // => false
	   * Lazy(numbers).every(isPositive) // => true
	   * Lazy(objects).all('foo')        // => false
	   * Lazy(objects).all('bar')        // => false
	   */
	  Sequence.prototype.every = function every(predicate) {
	    predicate = createCallback(predicate);

	    return this.each(function(e, i) {
	      return !!predicate(e, i);
	    });
	  };

	  Sequence.prototype.all = function all(predicate) {
	    return this.every(predicate);
	  };

	  /**
	   * Checks whether at least one element in this sequence satisfies a given
	   * predicate (or, if no predicate is specified, whether the sequence contains at
	   * least one element).
	   *
	   * @public
	   * @aka any
	   * @param {Function=} predicate A function to call on (potentially) every element
	   *     in this sequence.
	   * @returns {boolean} True if `predicate` returns true for at least one element
	   *     in the sequence. False if `predicate` returns false for every element (or
	   *     the sequence is empty).
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).some()           // => true
	   * Lazy(numbers).some(isEven)     // => true
	   * Lazy(numbers).some(isNegative) // => false
	   * Lazy([]).some()                // => false
	   */
	  Sequence.prototype.some = function some(predicate) {
	    predicate = createCallback(predicate, true);

	    var success = false;
	    this.each(function(e) {
	      if (predicate(e)) {
	        success = true;
	        return false;
	      }
	    });
	    return success;
	  };

	  Sequence.prototype.any = function any(predicate) {
	    return this.some(predicate);
	  };

	  /**
	   * Checks whether NO elements in this sequence satisfy the given predicate
	   * (the opposite of {@link Sequence#all}, basically).
	   *
	   * @public
	   * @param {Function=} predicate A function to call on (potentially) every element
	   *     in this sequence.
	   * @returns {boolean} True if `predicate` does not return true for any element
	   *     in the sequence. False if `predicate` returns true for at least one
	   *     element.
	   *
	   * @examples
	   * var numbers = [1, 2, 3, 4, 5];
	   *
	   * Lazy(numbers).none()           // => false
	   * Lazy(numbers).none(isEven)     // => false
	   * Lazy(numbers).none(isNegative) // => true
	   * Lazy([]).none(isEven)          // => true
	   * Lazy([]).none(isNegative)      // => true
	   * Lazy([]).none()                // => true
	   */
	  Sequence.prototype.none = function none(predicate) {
	    return !this.any(predicate);
	  };

	  /**
	   * Checks whether the sequence has no elements.
	   *
	   * @public
	   * @returns {boolean} True if the sequence is empty, false if it contains at
	   *     least one element.
	   *
	   * @examples
	   * Lazy([]).isEmpty()        // => true
	   * Lazy([1, 2, 3]).isEmpty() // => false
	   */
	  Sequence.prototype.isEmpty = function isEmpty() {
	    return !this.any();
	  };

	  /**
	   * Performs (at worst) a linear search from the head of this sequence,
	   * returning the first index at which the specified value is found.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {number} The index within this sequence where the given value is
	   *     located, or -1 if the sequence doesn't contain the value.
	   *
	   * @examples
	   * function reciprocal(x) { return 1 / x; }
	   *
	   * Lazy(["foo", "bar", "baz"]).indexOf("bar")   // => 1
	   * Lazy([1, 2, 3]).indexOf(4)                   // => -1
	   * Lazy([1, 2, 3]).map(reciprocal).indexOf(0.5) // => 1
	   */
	  Sequence.prototype.indexOf = function indexOf(value) {
	    var foundIndex = -1;
	    this.each(function(e, i) {
	      if (e === value) {
	        foundIndex = i;
	        return false;
	      }
	    });
	    return foundIndex;
	  };

	  /**
	   * Performs (at worst) a linear search from the tail of this sequence,
	   * returning the last index at which the specified value is found.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {number} The last index within this sequence where the given value
	   *     is located, or -1 if the sequence doesn't contain the value.
	   *
	   * @examples
	   * Lazy(["a", "b", "c", "b", "a"]).lastIndexOf("b")    // => 3
	   * Lazy([1, 2, 3]).lastIndexOf(0)                      // => -1
	   * Lazy([2, 2, 1, 2, 4]).filter(isEven).lastIndexOf(2) // 2
	   */
	  Sequence.prototype.lastIndexOf = function lastIndexOf(value) {
	    var reversed = this.getIndex().reverse(),
	        index    = reversed.indexOf(value);
	    if (index !== -1) {
	      index = reversed.length() - index - 1;
	    }
	    return index;
	  };

	  /**
	   * Performs a binary search of this sequence, returning the lowest index where
	   * the given value is either found, or where it belongs (if it is not already
	   * in the sequence).
	   *
	   * This method assumes the sequence is in sorted order and will fail otherwise.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {number} An index within this sequence where the given value is
	   *     located, or where it belongs in sorted order.
	   *
	   * @examples
	   * Lazy([1, 3, 6, 9]).sortedIndex(3)                    // => 1
	   * Lazy([1, 3, 6, 9]).sortedIndex(7)                    // => 3
	   * Lazy([5, 10, 15, 20]).filter(isEven).sortedIndex(10) // => 0
	   * Lazy([5, 10, 15, 20]).filter(isEven).sortedIndex(12) // => 1
	   */
	  Sequence.prototype.sortedIndex = function sortedIndex(value) {
	    var indexed = this.getIndex(),
	        lower   = 0,
	        upper   = indexed.length(),
	        i;

	    while (lower < upper) {
	      i = (lower + upper) >>> 1;
	      if (compare(indexed.get(i), value) === -1) {
	        lower = i + 1;
	      } else {
	        upper = i;
	      }
	    }
	    return lower;
	  };

	  /**
	   * Checks whether the given value is in this sequence.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {boolean} True if the sequence contains the value, false if not.
	   *
	   * @examples
	   * var numbers = [5, 10, 15, 20];
	   *
	   * Lazy(numbers).contains(15) // => true
	   * Lazy(numbers).contains(13) // => false
	   */
	  Sequence.prototype.contains = function contains(value) {
	    return this.indexOf(value) !== -1;
	  };

	  /**
	   * Aggregates a sequence into a single value according to some accumulator
	   * function.
	   *
	   * For an asynchronous sequence, instead of immediately returning a result
	   * (which it can't, obviously), this method returns an {@link AsyncHandle}
	   * whose `onComplete` method can be called to supply a callback to handle the
	   * final result once iteration has completed.
	   *
	   * @public
	   * @aka inject, foldl
	   * @param {Function} aggregator The function through which to pass every element
	   *     in the sequence. For every element, the function will be passed the total
	   *     aggregated result thus far and the element itself, and should return a
	   *     new aggregated result.
	   * @param {*=} memo The starting value to use for the aggregated result
	   *     (defaults to the first element in the sequence).
	   * @returns {*} The result of the aggregation, or, for asynchronous sequences,
	   *     an {@link AsyncHandle} whose `onComplete` method accepts a callback to
	   *     handle the final result.
	   *
	   * @examples
	   * function multiply(x, y) { return x * y; }
	   *
	   * var numbers = [1, 2, 3, 4];
	   *
	   * Lazy(numbers).reduce(multiply)    // => 24
	   * Lazy(numbers).reduce(multiply, 5) // => 120
	   */
	  Sequence.prototype.reduce = function reduce(aggregator, memo) {
	    if (arguments.length < 2) {
	      return this.tail().reduce(aggregator, this.head());
	    }

	    var eachResult = this.each(function(e, i) {
	      memo = aggregator(memo, e, i);
	    });

	    // TODO: Think of a way more efficient solution to this problem.
	    if (eachResult instanceof AsyncHandle) {
	      return eachResult.then(function() { return memo; });
	    }

	    return memo;
	  };

	  Sequence.prototype.inject =
	  Sequence.prototype.foldl = function foldl(aggregator, memo) {
	    return this.reduce(aggregator, memo);
	  };

	  /**
	   * Aggregates a sequence, from the tail, into a single value according to some
	   * accumulator function.
	   *
	   * @public
	   * @aka foldr
	   * @param {Function} aggregator The function through which to pass every element
	   *     in the sequence. For every element, the function will be passed the total
	   *     aggregated result thus far and the element itself, and should return a
	   *     new aggregated result.
	   * @param {*} memo The starting value to use for the aggregated result.
	   * @returns {*} The result of the aggregation.
	   *
	   * @examples
	   * function append(s1, s2) {
	   *   return s1 + s2;
	   * }
	   *
	   * function isVowel(str) {
	   *   return "aeiou".indexOf(str) !== -1;
	   * }
	   *
	   * Lazy("abcde").reduceRight(append)                 // => "edcba"
	   * Lazy("abcde").filter(isVowel).reduceRight(append) // => "ea"
	   */
	  Sequence.prototype.reduceRight = function reduceRight(aggregator, memo) {
	    if (arguments.length < 2) {
	      return this.initial(1).reduceRight(aggregator, this.last());
	    }

	    // This bothers me... but frankly, calling reverse().reduce() is potentially
	    // going to eagerly evaluate the sequence anyway; so it's really not an issue.
	    var indexed = this.getIndex(),
	        i = indexed.length() - 1;
	    return indexed.reverse().reduce(function(m, e) {
	      return aggregator(m, e, i--);
	    }, memo);
	  };

	  Sequence.prototype.foldr = function foldr(aggregator, memo) {
	    return this.reduceRight(aggregator, memo);
	  };

	  /**
	   * Groups this sequence into consecutive (overlapping) segments of a specified
	   * length. If the underlying sequence has fewer elements than the specfied
	   * length, then this sequence will be empty.
	   *
	   * @public
	   * @param {number} length The length of each consecutive segment.
	   * @returns {Sequence} The resulting sequence of consecutive segments.
	   *
	   * @examples
	   * Lazy([]).consecutive(2)        // => sequence: []
	   * Lazy([1]).consecutive(2)       // => sequence: []
	   * Lazy([1, 2]).consecutive(2)    // => sequence: [[1, 2]]
	   * Lazy([1, 2, 3]).consecutive(2) // => sequence: [[1, 2], [2, 3]]
	   * Lazy([1, 2, 3]).consecutive(0) // => sequence: [[]]
	   * Lazy([1, 2, 3]).consecutive(1) // => sequence: [[1], [2], [3]]
	   */
	  Sequence.prototype.consecutive = function consecutive(count) {
	    var queue    = new Queue(count);
	    var segments = this.map(function(element) {
	      if (queue.add(element).count === count) {
	        return queue.toArray();
	      }
	    });
	    return segments.compact();
	  };

	  /**
	   * Breaks this sequence into chunks (arrays) of a specified length.
	   *
	   * @public
	   * @param {number} size The size of each chunk.
	   * @returns {Sequence} The resulting sequence of chunks.
	   *
	   * @examples
	   * Lazy([]).chunk(2)        // sequence: []
	   * Lazy([1, 2, 3]).chunk(2) // sequence: [[1, 2], [3]]
	   * Lazy([1, 2, 3]).chunk(1) // sequence: [[1], [2], [3]]
	   * Lazy([1, 2, 3]).chunk(4) // sequence: [[1, 2, 3]]
	   * Lazy([1, 2, 3]).chunk(0) // throws
	   */
	  Sequence.prototype.chunk = function chunk(size) {
	    if (size < 1) {
	      throw new Error("You must specify a positive chunk size.");
	    }

	    return new ChunkedSequence(this, size);
	  };

	  /**
	   * @constructor
	   */
	  function ChunkedSequence(parent, size) {
	    this.parent    = parent;
	    this.chunkSize = size;
	  }

	  ChunkedSequence.prototype = new Sequence();

	  ChunkedSequence.prototype.getIterator = function getIterator() {
	    return new ChunkedIterator(this.parent, this.chunkSize);
	  };

	  /**
	   * @constructor
	   */
	  function ChunkedIterator(sequence, size) {
	    this.iterator = sequence.getIterator();
	    this.size     = size;
	  }

	  ChunkedIterator.prototype.current = function current() {
	    return this.currentChunk;
	  };

	  ChunkedIterator.prototype.moveNext = function moveNext() {
	    var iterator  = this.iterator,
	        chunkSize = this.size,
	        chunk     = [];

	    while (chunk.length < chunkSize && iterator.moveNext()) {
	      chunk.push(iterator.current());
	    }

	    if (chunk.length === 0) {
	      return false;
	    }

	    this.currentChunk = chunk;
	    return true;
	  };

	  /**
	   * Passes each element in the sequence to the specified callback during
	   * iteration. This is like {@link Sequence#each}, except that it can be
	   * inserted anywhere in the middle of a chain of methods to "intercept" the
	   * values in the sequence at that point.
	   *
	   * @public
	   * @param {Function} callback A function to call on every element in the
	   *     sequence during iteration. The return value of this function does not
	   *     matter.
	   * @returns {Sequence} A sequence comprising the same elements as this one.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).tap(fn).each(Lazy.noop); // calls fn 3 times
	   */
	  Sequence.prototype.tap = function tap(callback) {
	    return new TappedSequence(this, callback);
	  };

	  /**
	   * @constructor
	   */
	  function TappedSequence(parent, callback) {
	    this.parent = parent;
	    this.callback = callback;
	  }

	  TappedSequence.prototype = new Sequence();

	  TappedSequence.prototype.each = function each(fn) {
	    var callback = this.callback;
	    return this.parent.each(function(e, i) {
	      callback(e, i);
	      return fn(e, i);
	    });
	  };

	  /**
	   * Seaches for the first element in the sequence satisfying a given predicate.
	   *
	   * @public
	   * @aka detect
	   * @param {Function} predicate A function to call on (potentially) every element
	   *     in the sequence.
	   * @returns {*} The first element in the sequence for which `predicate` returns
	   *     `true`, or `undefined` if no such element is found.
	   *
	   * @examples
	   * function divisibleBy3(x) {
	   *   return x % 3 === 0;
	   * }
	   *
	   * var numbers = [5, 6, 7, 8, 9, 10];
	   *
	   * Lazy(numbers).find(divisibleBy3) // => 6
	   * Lazy(numbers).find(isNegative)   // => undefined
	   */
	  Sequence.prototype.find = function find(predicate) {
	    return this.filter(predicate).first();
	  };

	  Sequence.prototype.detect = function detect(predicate) {
	    return this.find(predicate);
	  };

	  /**
	   * Gets the minimum value in the sequence.
	   *
	   * @public
	   * @param {Function=} valueFn The function by which the value for comparison is
	   *     calculated for each element in the sequence.
	   * @returns {*} The element with the lowest value in the sequence, or
	   *     `Infinity` if the sequence is empty.
	   *
	   * @examples
	   * function negate(x) { return x * -1; }
	   *
	   * Lazy([]).min()                       // => Infinity
	   * Lazy([6, 18, 2, 49, 34]).min()       // => 2
	   * Lazy([6, 18, 2, 49, 34]).min(negate) // => 49
	   */
	  Sequence.prototype.min = function min(valueFn) {
	    if (typeof valueFn !== "undefined") {
	      return this.minBy(valueFn);
	    }

	    return this.reduce(function(x, y) { return y < x ? y : x; }, Infinity);
	  };

	  Sequence.prototype.minBy = function minBy(valueFn) {
	    valueFn = createCallback(valueFn);
	    return this.reduce(function(x, y) { return valueFn(y) < valueFn(x) ? y : x; });
	  };

	  /**
	   * Gets the maximum value in the sequence.
	   *
	   * @public
	   * @param {Function=} valueFn The function by which the value for comparison is
	   *     calculated for each element in the sequence.
	   * @returns {*} The element with the highest value in the sequence, or
	   *     `-Infinity` if the sequence is empty.
	   *
	   * @examples
	   * function reverseDigits(x) {
	   *   return Number(String(x).split('').reverse().join(''));
	   * }
	   *
	   * Lazy([]).max()                              // => -Infinity
	   * Lazy([6, 18, 2, 48, 29]).max()              // => 48
	   * Lazy([6, 18, 2, 48, 29]).max(reverseDigits) // => 29
	   */
	  Sequence.prototype.max = function max(valueFn) {
	    if (typeof valueFn !== "undefined") {
	      return this.maxBy(valueFn);
	    }

	    return this.reduce(function(x, y) { return y > x ? y : x; }, -Infinity);
	  };

	  Sequence.prototype.maxBy = function maxBy(valueFn) {
	    valueFn = createCallback(valueFn);
	    return this.reduce(function(x, y) { return valueFn(y) > valueFn(x) ? y : x; });
	  };

	  /**
	   * Gets the sum of the values in the sequence.
	   *
	   * @public
	   * @param {Function=} valueFn The function used to select the values that will
	   *     be summed up.
	   * @returns {*} The sum.
	   *
	   * @examples
	   * Lazy([]).sum()                     // => 0
	   * Lazy([1, 2, 3, 4]).sum()           // => 10
	   * Lazy([1.2, 3.4]).sum(Math.floor)   // => 4
	   * Lazy(['foo', 'bar']).sum('length') // => 6
	   */
	  Sequence.prototype.sum = function sum(valueFn) {
	    if (typeof valueFn !== "undefined") {
	      return this.sumBy(valueFn);
	    }

	    return this.reduce(function(x, y) { return x + y; }, 0);
	  };

	  Sequence.prototype.sumBy = function sumBy(valueFn) {
	    valueFn = createCallback(valueFn);
	    return this.reduce(function(x, y) { return x + valueFn(y); }, 0);
	  };

	  /**
	   * Creates a string from joining together all of the elements in this sequence,
	   * separated by the given delimiter.
	   *
	   * @public
	   * @aka toString
	   * @param {string=} delimiter The separator to insert between every element from
	   *     this sequence in the resulting string (defaults to `","`).
	   * @returns {string} The delimited string.
	   *
	   * @examples
	   * Lazy([6, 29, 1984]).join("/")  // => "6/29/1984"
	   * Lazy(["a", "b", "c"]).join()   // => "a,b,c"
	   * Lazy(["a", "b", "c"]).join("") // => "abc"
	   * Lazy([1, 2, 3]).join()         // => "1,2,3"
	   * Lazy([1, 2, 3]).join("")       // => "123"
	   * Lazy(["", "", ""]).join(",")   // => ",,"
	   */
	  Sequence.prototype.join = function join(delimiter) {
	    delimiter = typeof delimiter === "string" ? delimiter : ",";

	    return this.reduce(function(str, e, i) {
	      if (i > 0) {
	        str += delimiter;
	      }
	      return str + e;
	    }, "");
	  };

	  Sequence.prototype.toString = function toString(delimiter) {
	    return this.join(delimiter);
	  };

	  /**
	   * Creates a sequence, with the same elements as this one, that will be iterated
	   * over asynchronously when calling `each`.
	   *
	   * @public
	   * @param {number=} interval The approximate period, in milliseconds, that
	   *     should elapse between each element in the resulting sequence. Omitting
	   *     this argument will result in the fastest possible asynchronous iteration.
	   * @returns {AsyncSequence} The new asynchronous sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).async(100).each(fn) // calls fn 3 times asynchronously
	   */
	  Sequence.prototype.async = function async(interval) {
	    return new AsyncSequence(this, interval);
	  };

	  /**
	   * @constructor
	   */
	  function SimpleIntersectionSequence(parent, array) {
	    this.parent = parent;
	    this.array  = array;
	    this.each   = getEachForIntersection(array);
	  }

	  SimpleIntersectionSequence.prototype = new Sequence();

	  SimpleIntersectionSequence.prototype.eachMemoizerCache = function eachMemoizerCache(fn) {
	    var iterator = new UniqueMemoizer(Lazy(this.array).getIterator()),
	        i = 0;

	    return this.parent.each(function(e) {
	      if (iterator.contains(e)) {
	        return fn(e, i++);
	      }
	    });
	  };

	  SimpleIntersectionSequence.prototype.eachArrayCache = function eachArrayCache(fn) {
	    var array = this.array,
	        find  = arrayContains,
	        i = 0;

	    return this.parent.each(function(e) {
	      if (find(array, e)) {
	        return fn(e, i++);
	      }
	    });
	  };

	  function getEachForIntersection(source) {
	    if (source.length < 40) {
	      return SimpleIntersectionSequence.prototype.eachArrayCache;
	    } else {
	      return SimpleIntersectionSequence.prototype.eachMemoizerCache;
	    }
	  }

	  /**
	   * An optimized version of {@link ZippedSequence}, when zipping a sequence with
	   * only one array.
	   *
	   * @param {Sequence} parent The underlying sequence.
	   * @param {Array} array The array with which to zip the sequence.
	   * @constructor
	   */
	  function SimpleZippedSequence(parent, array) {
	    this.parent = parent;
	    this.array  = array;
	  }

	  SimpleZippedSequence.prototype = new Sequence();

	  SimpleZippedSequence.prototype.each = function each(fn) {
	    var array = this.array;
	    return this.parent.each(function(e, i) {
	      return fn([e, array[i]], i);
	    });
	  };

	  /**
	   * An `ArrayLikeSequence` is a {@link Sequence} that provides random access to
	   * its elements. This extends the API for iterating with the additional methods
	   * {@link #get} and {@link #length}, allowing a sequence to act as a "view" into
	   * a collection or other indexed data source.
	   *
	   * The initial sequence created by wrapping an array with `Lazy(array)` is an
	   * `ArrayLikeSequence`.
	   *
	   * All methods of `ArrayLikeSequence` that conceptually should return
	   * something like a array (with indexed access) return another
	   * `ArrayLikeSequence`, for example:
	   *
	   * - {@link Sequence#map}
	   * - {@link ArrayLikeSequence#slice}
	   * - {@link Sequence#take} and {@link Sequence#drop}
	   * - {@link Sequence#reverse}
	   *
	   * The above is not an exhaustive list. There are also certain other cases
	   * where it might be possible to return an `ArrayLikeSequence` (e.g., calling
	   * {@link Sequence#concat} with a single array argument), but this is not
	   * guaranteed by the API.
	   *
	   * Note that in many cases, it is not possible to provide indexed access
	   * without first performing at least a partial iteration of the underlying
	   * sequence. In these cases an `ArrayLikeSequence` will not be returned:
	   *
	   * - {@link Sequence#filter}
	   * - {@link Sequence#uniq}
	   * - {@link Sequence#union}
	   * - {@link Sequence#intersect}
	   *
	   * etc. The above methods only return ordinary {@link Sequence} objects.
	   *
	   * Defining custom array-like sequences
	   * ------------------------------------
	   *
	   * Creating a custom `ArrayLikeSequence` is essentially the same as creating a
	   * custom {@link Sequence}. You just have a couple more methods you need to
	   * implement: `get` and (optionally) `length`.
	   *
	   * Here's an example. Let's define a sequence type called `OffsetSequence` that
	   * offsets each of its parent's elements by a set distance, and circles back to
	   * the beginning after reaching the end. **Remember**: the initialization
	   * function you pass to {@link #define} should always accept a `parent` as its
	   * first parameter.
	   *
	   *     ArrayLikeSequence.define("offset", {
	   *       init: function(parent, offset) {
	   *         this.offset = offset;
	   *       },
	   *
	   *       get: function(i) {
	   *         return this.parent.get((i + this.offset) % this.parent.length());
	   *       }
	   *     });
	   *
	   * It's worth noting a couple of things here.
	   *
	   * First, Lazy's default implementation of `length` simply returns the parent's
	   * length. In this case, since an `OffsetSequence` will always have the same
	   * number of elements as its parent, that implementation is fine; so we don't
	   * need to override it.
	   *
	   * Second, the default implementation of `each` uses `get` and `length` to
	   * essentially create a `for` loop, which is fine here. If you want to implement
	   * `each` your own way, you can do that; but in most cases (as here), you can
	   * probably just stick with the default.
	   *
	   * So we're already done, after only implementing `get`! Pretty easy, huh?
	   *
	   * Now the `offset` method will be chainable from any `ArrayLikeSequence`. So
	   * for example:
	   *
	   *     Lazy([1, 2, 3]).map(mapFn).offset(3);
	   *
	   * ...will work, but:
	   *
	   *     Lazy([1, 2, 3]).filter(mapFn).offset(3);
	   *
	   * ...will not (because `filter` does not return an `ArrayLikeSequence`).
	   *
	   * (Also, as with the example provided for defining custom {@link Sequence}
	   * types, this example really could have been implemented using a function
	   * already available as part of Lazy.js: in this case, {@link Sequence#map}.)
	   *
	   * @public
	   * @constructor
	   *
	   * @examples
	   * Lazy([1, 2, 3])                    // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).map(Lazy.identity) // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).take(2)            // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).drop(2)            // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).reverse()          // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2, 3]).slice(1, 2)        // instanceof Lazy.ArrayLikeSequence
	   */
	  function ArrayLikeSequence() {}

	  ArrayLikeSequence.prototype = new Sequence();

	  /**
	   * Create a new constructor function for a type inheriting from
	   * `ArrayLikeSequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `ArrayLikeSequence` prototype so that it can be chained with any other
	   *     methods that return array-like sequences.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. **Must** include `get`. *May* include `init`,
	   *     `length`, `getIterator`, and `each`. For each function, `this` will be
	   *     the new sequence and `this.parent` will be the source sequence.
	   * @returns {Function} A constructor for a new type inheriting from
	   *     `ArrayLikeSequence`.
	   *
	   * @examples
	   * Lazy.ArrayLikeSequence.define("offset", {
	   *   init: function(offset) {
	   *     this.offset = offset;
	   *   },
	   *
	   *   get: function(i) {
	   *     return this.parent.get((i + this.offset) % this.parent.length());
	   *   }
	   * });
	   *
	   * Lazy([1, 2, 3]).offset(1) // sequence: [2, 3, 1]
	   */
	  ArrayLikeSequence.define = function define(methodName, overrides) {
	    if (!overrides || typeof overrides.get !== 'function') {
	      throw new Error("A custom array-like sequence must implement *at least* get!");
	    }

	    return defineSequenceType(ArrayLikeSequence, methodName, overrides);
	  };

	  /**
	   * Returns the element at the specified index.
	   *
	   * @public
	   * @param {number} i The index to access.
	   * @returns {*} The element.
	   *
	   * @examples
	   * function increment(x) { return x + 1; }
	   *
	   * Lazy([1, 2, 3]).get(1)                // => 2
	   * Lazy([1, 2, 3]).get(-1)               // => undefined
	   * Lazy([1, 2, 3]).map(increment).get(1) // => 3
	   */
	  ArrayLikeSequence.prototype.get = function get(i) {
	    return this.parent.get(i);
	  };

	  /**
	   * Returns the length of the sequence.
	   *
	   * @public
	   * @returns {number} The length.
	   *
	   * @examples
	   * function increment(x) { return x + 1; }
	   *
	   * Lazy([]).length()                       // => 0
	   * Lazy([1, 2, 3]).length()                // => 3
	   * Lazy([1, 2, 3]).map(increment).length() // => 3
	   */
	  ArrayLikeSequence.prototype.length = function length() {
	    return this.parent.length();
	  };

	  /**
	   * Returns the current sequence (since it is already indexed).
	   */
	  ArrayLikeSequence.prototype.getIndex = function getIndex() {
	    return this;
	  };

	  /**
	   * An optimized version of {@link Sequence#getIterator}.
	   */
	  ArrayLikeSequence.prototype.getIterator = function getIterator() {
	    return new IndexedIterator(this);
	  };

	  /**
	   * An optimized version of {@link Iterator} meant to work with already-indexed
	   * sequences.
	   *
	   * @param {ArrayLikeSequence} sequence The sequence to iterate over.
	   * @constructor
	   */
	  function IndexedIterator(sequence) {
	    this.sequence = sequence;
	    this.index    = -1;
	  }

	  IndexedIterator.prototype.current = function current() {
	    return this.sequence.get(this.index);
	  };

	  IndexedIterator.prototype.moveNext = function moveNext() {
	    if (this.index >= this.sequence.length() - 1) {
	      return false;
	    }

	    ++this.index;
	    return true;
	  };

	  /**
	   * An optimized version of {@link Sequence#each}.
	   */
	  ArrayLikeSequence.prototype.each = function each(fn) {
	    var length = this.length(),
	        i = -1;

	    while (++i < length) {
	      if (fn(this.get(i), i) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * Returns a new sequence with the same elements as this one, minus the last
	   * element.
	   *
	   * @public
	   * @returns {ArrayLikeSequence} The new array-like sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).pop() // sequence: [1, 2]
	   * Lazy([]).pop()        // sequence: []
	   */
	  ArrayLikeSequence.prototype.pop = function pop() {
	    return this.initial();
	  };

	  /**
	   * Returns a new sequence with the same elements as this one, minus the first
	   * element.
	   *
	   * @public
	   * @returns {ArrayLikeSequence} The new array-like sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3]).shift() // sequence: [2, 3]
	   * Lazy([]).shift()        // sequence: []
	   */
	  ArrayLikeSequence.prototype.shift = function shift() {
	    return this.drop();
	  };

	  /**
	   * Returns a new sequence comprising the portion of this sequence starting
	   * from the specified starting index and continuing until the specified ending
	   * index or to the end of the sequence.
	   *
	   * @public
	   * @param {number} begin The index at which the new sequence should start.
	   * @param {number=} end The index at which the new sequence should end.
	   * @returns {ArrayLikeSequence} The new array-like sequence.
	   *
	   * @examples
	   * Lazy([1, 2, 3, 4, 5]).slice(0)     // sequence: [1, 2, 3, 4, 5]
	   * Lazy([1, 2, 3, 4, 5]).slice(2)     // sequence: [3, 4, 5]
	   * Lazy([1, 2, 3, 4, 5]).slice(2, 4)  // sequence: [3, 4]
	   * Lazy([1, 2, 3, 4, 5]).slice(-1)    // sequence: [5]
	   * Lazy([1, 2, 3, 4, 5]).slice(1, -1) // sequence: [2, 3, 4]
	   * Lazy([1, 2, 3, 4, 5]).slice(0, 10) // sequence: [1, 2, 3, 4, 5]
	   */
	  ArrayLikeSequence.prototype.slice = function slice(begin, end) {
	    var length = this.length();

	    if (begin < 0) {
	      begin = length + begin;
	    }

	    var result = this.drop(begin);

	    if (typeof end === "number") {
	      if (end < 0) {
	        end = length + end;
	      }
	      result = result.take(end - begin);
	    }

	    return result;
	  };

	  /**
	   * An optimized version of {@link Sequence#map}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).map(Lazy.identity) // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.map = function map(mapFn) {
	    return new IndexedMappedSequence(this, createCallback(mapFn));
	  };

	  /**
	   * @constructor
	   */
	  function IndexedMappedSequence(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  IndexedMappedSequence.prototype = new ArrayLikeSequence();

	  IndexedMappedSequence.prototype.get = function get(i) {
	    if (i < 0 || i >= this.parent.length()) {
	      return undefined;
	    }

	    return this.mapFn(this.parent.get(i), i);
	  };

	  /**
	   * An optimized version of {@link Sequence#filter}.
	   */
	  ArrayLikeSequence.prototype.filter = function filter(filterFn) {
	    return new IndexedFilteredSequence(this, createCallback(filterFn));
	  };

	  /**
	   * @constructor
	   */
	  function IndexedFilteredSequence(parent, filterFn) {
	    this.parent   = parent;
	    this.filterFn = filterFn;
	  }

	  IndexedFilteredSequence.prototype = new FilteredSequence();

	  IndexedFilteredSequence.prototype.each = function each(fn) {
	    var parent = this.parent,
	        filterFn = this.filterFn,
	        length = this.parent.length(),
	        i = -1,
	        j = 0,
	        e;

	    while (++i < length) {
	      e = parent.get(i);
	      if (filterFn(e, i) && fn(e, j++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * An optimized version of {@link Sequence#reverse}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).reverse() // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.reverse = function reverse() {
	    return new IndexedReversedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedReversedSequence(parent) {
	    this.parent = parent;
	  }

	  IndexedReversedSequence.prototype = new ArrayLikeSequence();

	  IndexedReversedSequence.prototype.get = function get(i) {
	    return this.parent.get(this.length() - i - 1);
	  };

	  /**
	   * An optimized version of {@link Sequence#first}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).first(2) // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.first = function first(count) {
	    if (typeof count === "undefined") {
	      return this.get(0);
	    }

	    return new IndexedTakeSequence(this, count);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedTakeSequence(parent, count) {
	    this.parent = parent;
	    this.count  = count;
	  }

	  IndexedTakeSequence.prototype = new ArrayLikeSequence();

	  IndexedTakeSequence.prototype.length = function length() {
	    var parentLength = this.parent.length();
	    return this.count <= parentLength ? this.count : parentLength;
	  };

	  /**
	   * An optimized version of {@link Sequence#rest}, which creates an
	   * {@link ArrayLikeSequence} so that the result still provides random access.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy([1, 2, 3]).rest() // instanceof Lazy.ArrayLikeSequence
	   */
	  ArrayLikeSequence.prototype.rest = function rest(count) {
	    return new IndexedDropSequence(this, count);
	  };

	  /**
	   * @constructor
	   */
	  function IndexedDropSequence(parent, count) {
	    this.parent = parent;
	    this.count  = typeof count === "number" ? count : 1;
	  }

	  IndexedDropSequence.prototype = new ArrayLikeSequence();

	  IndexedDropSequence.prototype.get = function get(i) {
	    return this.parent.get(this.count + i);
	  };

	  IndexedDropSequence.prototype.length = function length() {
	    var parentLength = this.parent.length();
	    return this.count <= parentLength ? parentLength - this.count : 0;
	  };

	  /**
	   * An optimized version of {@link Sequence#concat} that returns another
	   * {@link ArrayLikeSequence} *if* the argument is an array.
	   *
	   * @public
	   * @param {...*} var_args
	   *
	   * @examples
	   * Lazy([1, 2]).concat([3, 4]) // instanceof Lazy.ArrayLikeSequence
	   * Lazy([1, 2]).concat([3, 4]) // sequence: [1, 2, 3, 4]
	   */
	  ArrayLikeSequence.prototype.concat = function concat(var_args) {
	    if (arguments.length === 1 && arguments[0] instanceof Array) {
	      return new IndexedConcatenatedSequence(this, (/** @type {Array} */ var_args));
	    } else {
	      return Sequence.prototype.concat.apply(this, arguments);
	    }
	  };

	  /**
	   * @constructor
	   */
	  function IndexedConcatenatedSequence(parent, other) {
	    this.parent = parent;
	    this.other  = other;
	  }

	  IndexedConcatenatedSequence.prototype = new ArrayLikeSequence();

	  IndexedConcatenatedSequence.prototype.get = function get(i) {
	    var parentLength = this.parent.length();
	    if (i < parentLength) {
	      return this.parent.get(i);
	    } else {
	      return this.other[i - parentLength];
	    }
	  };

	  IndexedConcatenatedSequence.prototype.length = function length() {
	    return this.parent.length() + this.other.length;
	  };

	  /**
	   * An optimized version of {@link Sequence#uniq}.
	   */
	  ArrayLikeSequence.prototype.uniq = function uniq(keyFn) {
	    return new IndexedUniqueSequence(this, createCallback(keyFn));
	  };

	  /**
	   * @param {ArrayLikeSequence} parent
	   * @constructor
	   */
	  function IndexedUniqueSequence(parent, keyFn) {
	    this.parent = parent;
	    this.each   = getEachForParent(parent);
	    this.keyFn  = keyFn;
	  }

	  IndexedUniqueSequence.prototype = new Sequence();

	  IndexedUniqueSequence.prototype.eachArrayCache = function eachArrayCache(fn) {
	    // Basically the same implementation as w/ the set, but using an array because
	    // it's cheaper for smaller sequences.
	    var parent = this.parent,
	        keyFn  = this.keyFn,
	        length = parent.length(),
	        cache  = [],
	        find   = arrayContains,
	        key, value,
	        i = -1,
	        j = 0;

	    while (++i < length) {
	      value = parent.get(i);
	      key = keyFn(value);
	      if (!find(cache, key)) {
	        cache.push(key);
	        if (fn(value, j++) === false) {
	          return false;
	        }
	      }
	    }
	  };

	  IndexedUniqueSequence.prototype.eachSetCache = UniqueSequence.prototype.each;

	  function getEachForParent(parent) {
	    if (parent.length() < 100) {
	      return IndexedUniqueSequence.prototype.eachArrayCache;
	    } else {
	      return UniqueSequence.prototype.each;
	    }
	  }

	  // Now that we've fully initialized the ArrayLikeSequence prototype, we can
	  // set the prototype for MemoizedSequence.

	  MemoizedSequence.prototype = new ArrayLikeSequence();

	  MemoizedSequence.prototype.cache = function cache() {
	    return this.cachedResult || (this.cachedResult = this.parent.toArray());
	  };

	  MemoizedSequence.prototype.get = function get(i) {
	    return this.cache()[i];
	  };

	  MemoizedSequence.prototype.length = function length() {
	    return this.cache().length;
	  };

	  MemoizedSequence.prototype.slice = function slice(begin, end) {
	    return this.cache().slice(begin, end);
	  };

	  MemoizedSequence.prototype.toArray = function toArray() {
	    return this.cache().slice(0);
	  };

	  /**
	   * ArrayWrapper is the most basic {@link Sequence}. It directly wraps an array
	   * and implements the same methods as {@link ArrayLikeSequence}, but more
	   * efficiently.
	   *
	   * @constructor
	   */
	  function ArrayWrapper(source) {
	    this.source = source;
	  }

	  ArrayWrapper.prototype = new ArrayLikeSequence();

	  ArrayWrapper.prototype.root = function root() {
	    return this;
	  };

	  ArrayWrapper.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  /**
	   * Returns the element at the specified index in the source array.
	   *
	   * @param {number} i The index to access.
	   * @returns {*} The element.
	   */
	  ArrayWrapper.prototype.get = function get(i) {
	    return this.source[i];
	  };

	  /**
	   * Returns the length of the source array.
	   *
	   * @returns {number} The length.
	   */
	  ArrayWrapper.prototype.length = function length() {
	    return this.source.length;
	  };

	  /**
	   * An optimized version of {@link Sequence#each}.
	   */
	  ArrayWrapper.prototype.each = function each(fn) {
	    return forEach(this.source, fn);
	  };

	  /**
	   * An optimized version of {@link Sequence#map}.
	   */
	  ArrayWrapper.prototype.map = function map(mapFn) {
	    return new MappedArrayWrapper(this, createCallback(mapFn));
	  };

	  /**
	   * An optimized version of {@link Sequence#filter}.
	   */
	  ArrayWrapper.prototype.filter = function filter(filterFn) {
	    return new FilteredArrayWrapper(this, createCallback(filterFn));
	  };

	  /**
	   * An optimized version of {@link Sequence#uniq}.
	   */
	  ArrayWrapper.prototype.uniq = function uniq(keyFn) {
	    return new UniqueArrayWrapper(this, keyFn);
	  };

	  /**
	   * An optimized version of {@link ArrayLikeSequence#concat}.
	   *
	   * @param {...*} var_args
	   */
	  ArrayWrapper.prototype.concat = function concat(var_args) {
	    if (arguments.length === 1 && arguments[0] instanceof Array) {
	      return new ConcatArrayWrapper(this, (/** @type {Array} */ var_args));
	    } else {
	      return ArrayLikeSequence.prototype.concat.apply(this, arguments);
	    }
	  };

	  /**
	   * An optimized version of {@link Sequence#toArray}.
	   */
	  ArrayWrapper.prototype.toArray = function toArray() {
	    return this.source.slice(0);
	  };

	  /**
	   * @constructor
	   */
	  function MappedArrayWrapper(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  MappedArrayWrapper.prototype = new ArrayLikeSequence();

	  MappedArrayWrapper.prototype.get = function get(i) {
	    var source = this.parent.source;

	    if (i < 0 || i >= source.length) {
	      return undefined;
	    }

	    return this.mapFn(source[i]);
	  };

	  MappedArrayWrapper.prototype.length = function length() {
	    return this.parent.source.length;
	  };

	  MappedArrayWrapper.prototype.each = function each(fn) {
	    var source = this.parent.source,
	        length = source.length,
	        mapFn  = this.mapFn,
	        i = -1;

	    while (++i < length) {
	      if (fn(mapFn(source[i], i), i) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * @constructor
	   */
	  function FilteredArrayWrapper(parent, filterFn) {
	    this.parent   = parent;
	    this.filterFn = filterFn;
	  }

	  FilteredArrayWrapper.prototype = new FilteredSequence();

	  FilteredArrayWrapper.prototype.each = function each(fn) {
	    var source = this.parent.source,
	        filterFn = this.filterFn,
	        length = source.length,
	        i = -1,
	        j = 0,
	        e;

	    while (++i < length) {
	      e = source[i];
	      if (filterFn(e, i) && fn(e, j++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * @constructor
	   */
	  function UniqueArrayWrapper(parent, keyFn) {
	    this.parent = parent;
	    this.each   = getEachForSource(parent.source);
	    this.keyFn  = keyFn;
	  }

	  UniqueArrayWrapper.prototype = new Sequence();

	  UniqueArrayWrapper.prototype.eachNoCache = function eachNoCache(fn) {
	    var source = this.parent.source,
	        keyFn  = this.keyFn,
	        length = source.length,
	        find   = arrayContainsBefore,
	        value,

	        // Yes, this is hideous.
	        // Trying to get performance first, will refactor next!
	        i = -1,
	        k = 0;

	    while (++i < length) {
	      value = source[i];
	      if (!find(source, value, i, keyFn) && fn(value, k++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  UniqueArrayWrapper.prototype.eachArrayCache = function eachArrayCache(fn) {
	    // Basically the same implementation as w/ the set, but using an array because
	    // it's cheaper for smaller sequences.
	    var source = this.parent.source,
	        keyFn  = this.keyFn,
	        length = source.length,
	        cache  = [],
	        find   = arrayContains,
	        key, value,
	        i = -1,
	        j = 0;

	    if (keyFn) {
	      keyFn = createCallback(keyFn);
	      while (++i < length) {
	        value = source[i];
	        key = keyFn(value);
	        if (!find(cache, key)) {
	          cache.push(key);
	          if (fn(value, j++) === false) {
	            return false;
	          }
	        }
	      }

	    } else {
	      while (++i < length) {
	        value = source[i];
	        if (!find(cache, value)) {
	          cache.push(value);
	          if (fn(value, j++) === false) {
	            return false;
	          }
	        }
	      }
	    }

	    return true;
	  };

	  UniqueArrayWrapper.prototype.eachSetCache = UniqueSequence.prototype.each;

	  /**
	   * My latest findings here...
	   *
	   * So I hadn't really given the set-based approach enough credit. The main issue
	   * was that my Set implementation was totally not optimized at all. After pretty
	   * heavily optimizing it (just take a look; it's a monstrosity now!), it now
	   * becomes the fastest option for much smaller values of N.
	   */
	  function getEachForSource(source) {
	    if (source.length < 40) {
	      return UniqueArrayWrapper.prototype.eachNoCache;
	    } else if (source.length < 100) {
	      return UniqueArrayWrapper.prototype.eachArrayCache;
	    } else {
	      return UniqueArrayWrapper.prototype.eachSetCache;
	    }
	  }

	  /**
	   * @constructor
	   */
	  function ConcatArrayWrapper(parent, other) {
	    this.parent = parent;
	    this.other  = other;
	  }

	  ConcatArrayWrapper.prototype = new ArrayLikeSequence();

	  ConcatArrayWrapper.prototype.get = function get(i) {
	    var source = this.parent.source,
	        sourceLength = source.length;

	    if (i < sourceLength) {
	      return source[i];
	    } else {
	      return this.other[i - sourceLength];
	    }
	  };

	  ConcatArrayWrapper.prototype.length = function length() {
	    return this.parent.source.length + this.other.length;
	  };

	  ConcatArrayWrapper.prototype.each = function each(fn) {
	    var source = this.parent.source,
	        sourceLength = source.length,
	        other = this.other,
	        otherLength = other.length,
	        i = 0,
	        j = -1;

	    while (++j < sourceLength) {
	      if (fn(source[j], i++) === false) {
	        return false;
	      }
	    }

	    j = -1;
	    while (++j < otherLength) {
	      if (fn(other[j], i++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * An `ObjectLikeSequence` object represents a sequence of key/value pairs.
	   *
	   * The initial sequence you get by wrapping an object with `Lazy(object)` is
	   * an `ObjectLikeSequence`.
	   *
	   * All methods of `ObjectLikeSequence` that conceptually should return
	   * something like an object return another `ObjectLikeSequence`.
	   *
	   * @public
	   * @constructor
	   *
	   * @examples
	   * var obj = { foo: 'bar' };
	   *
	   * Lazy(obj).assign({ bar: 'baz' })   // instanceof Lazy.ObjectLikeSequence
	   * Lazy(obj).defaults({ bar: 'baz' }) // instanceof Lazy.ObjectLikeSequence
	   * Lazy(obj).invert()                 // instanceof Lazy.ObjectLikeSequence
	   */
	  function ObjectLikeSequence() {}

	  ObjectLikeSequence.prototype = new Sequence();

	  /**
	   * Create a new constructor function for a type inheriting from
	   * `ObjectLikeSequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `ObjectLikeSequence` prototype so that it can be chained with any other
	   *     methods that return object-like sequences.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. **Must** include `each`. *May* include `init` and
	   *     `get` (for looking up an element by key).
	   * @returns {Function} A constructor for a new type inheriting from
	   *     `ObjectLikeSequence`.
	   *
	   * @examples
	   * function downcaseKey(value, key) {
	   *   return [key.toLowerCase(), value];
	   * }
	   *
	   * Lazy.ObjectLikeSequence.define("caseInsensitive", {
	   *   init: function() {
	   *     var downcased = this.parent
	   *       .map(downcaseKey)
	   *       .toObject();
	   *     this.downcased = Lazy(downcased);
	   *   },
	   *
	   *   get: function(key) {
	   *     return this.downcased.get(key.toLowerCase());
	   *   },
	   *
	   *   each: function(fn) {
	   *     return this.downcased.each(fn);
	   *   }
	   * });
	   *
	   * Lazy({ Foo: 'bar' }).caseInsensitive()            // sequence: { foo: 'bar' }
	   * Lazy({ FOO: 'bar' }).caseInsensitive().get('foo') // => 'bar'
	   * Lazy({ FOO: 'bar' }).caseInsensitive().get('FOO') // => 'bar'
	   */
	  ObjectLikeSequence.define = function define(methodName, overrides) {
	    if (!overrides || typeof overrides.each !== 'function') {
	      throw new Error("A custom object-like sequence must implement *at least* each!");
	    }

	    return defineSequenceType(ObjectLikeSequence, methodName, overrides);
	  };

	  ObjectLikeSequence.prototype.value = function value() {
	    return this.toObject();
	  };

	  /**
	   * Gets the element at the specified key in this sequence.
	   *
	   * @public
	   * @param {string} key The key.
	   * @returns {*} The element.
	   *
	   * @examples
	   * Lazy({ foo: "bar" }).get("foo")                          // => "bar"
	   * Lazy({ foo: "bar" }).extend({ foo: "baz" }).get("foo")   // => "baz"
	   * Lazy({ foo: "bar" }).defaults({ bar: "baz" }).get("bar") // => "baz"
	   * Lazy({ foo: "bar" }).invert().get("bar")                 // => "foo"
	   * Lazy({ foo: 1, bar: 2 }).pick(["foo"]).get("foo")        // => 1
	   * Lazy({ foo: 1, bar: 2 }).pick(["foo"]).get("bar")        // => undefined
	   * Lazy({ foo: 1, bar: 2 }).omit(["foo"]).get("bar")        // => 2
	   * Lazy({ foo: 1, bar: 2 }).omit(["foo"]).get("foo")        // => undefined
	   */
	  ObjectLikeSequence.prototype.get = function get(key) {
	    var pair = this.pairs().find(function(pair) {
	      return pair[0] === key;
	    });

	    return pair ? pair[1] : undefined;
	  };

	  /**
	   * Returns a {@link Sequence} whose elements are the keys of this object-like
	   * sequence.
	   *
	   * @public
	   * @returns {Sequence} The sequence based on this sequence's keys.
	   *
	   * @examples
	   * Lazy({ hello: "hola", goodbye: "hasta luego" }).keys() // sequence: ["hello", "goodbye"]
	   */
	  ObjectLikeSequence.prototype.keys = function keys() {
	    return this.map(function(v, k) { return k; });
	  };

	  /**
	   * Returns a {@link Sequence} whose elements are the values of this object-like
	   * sequence.
	   *
	   * @public
	   * @returns {Sequence} The sequence based on this sequence's values.
	   *
	   * @examples
	   * Lazy({ hello: "hola", goodbye: "hasta luego" }).values() // sequence: ["hola", "hasta luego"]
	   */
	  ObjectLikeSequence.prototype.values = function values() {
	    return this.map(function(v, k) { return v; });
	  };

	  /**
	   * Throws an exception. Asynchronous iteration over object-like sequences is
	   * not supported.
	   *
	   * @public
	   * @examples
	   * Lazy({ foo: 'bar' }).async() // throws
	   */
	  ObjectLikeSequence.prototype.async = function async() {
	    throw new Error('An ObjectLikeSequence does not support asynchronous iteration.');
	  };

	  ObjectLikeSequence.prototype.filter = function filter(filterFn) {
	    return new FilteredObjectLikeSequence(this, createCallback(filterFn));
	  };

	  function FilteredObjectLikeSequence(parent, filterFn) {
	    this.parent = parent;
	    this.filterFn = filterFn;
	  }

	  FilteredObjectLikeSequence.prototype = new ObjectLikeSequence();

	  FilteredObjectLikeSequence.prototype.each = function each(fn) {
	    var filterFn = this.filterFn;

	    return this.parent.each(function(v, k) {
	      if (filterFn(v, k)) {
	        return fn(v, k);
	      }
	    });
	  };

	  /**
	   * Returns this same sequence. (Reversing an object-like sequence doesn't make
	   * any sense.)
	   */
	  ObjectLikeSequence.prototype.reverse = function reverse() {
	    return this;
	  };

	  /**
	   * Returns an {@link ObjectLikeSequence} whose elements are the combination of
	   * this sequence and another object. In the case of a key appearing in both this
	   * sequence and the given object, the other object's value will override the
	   * one in this sequence.
	   *
	   * @public
	   * @aka extend
	   * @param {Object} other The other object to assign to this sequence.
	   * @returns {ObjectLikeSequence} A new sequence comprising elements from this
	   *     sequence plus the contents of `other`.
	   *
	   * @examples
	   * Lazy({ "uno": 1, "dos": 2 }).assign({ "tres": 3 }) // sequence: { uno: 1, dos: 2, tres: 3 }
	   * Lazy({ foo: "bar" }).assign({ foo: "baz" });       // sequence: { foo: "baz" }
	   */
	  ObjectLikeSequence.prototype.assign = function assign(other) {
	    return new AssignSequence(this, other);
	  };

	  ObjectLikeSequence.prototype.extend = function extend(other) {
	    return this.assign(other);
	  };

	  /**
	   * @constructor
	   */
	  function AssignSequence(parent, other) {
	    this.parent = parent;
	    this.other  = other;
	  }

	  AssignSequence.prototype = new ObjectLikeSequence();

	  AssignSequence.prototype.get = function get(key) {
	    return this.other[key] || this.parent.get(key);
	  };

	  AssignSequence.prototype.each = function each(fn) {
	    var merged = new Set(),
	        done   = false;

	    Lazy(this.other).each(function(value, key) {
	      if (fn(value, key) === false) {
	        done = true;
	        return false;
	      }

	      merged.add(key);
	    });

	    if (!done) {
	      return this.parent.each(function(value, key) {
	        if (!merged.contains(key) && fn(value, key) === false) {
	          return false;
	        }
	      });
	    }
	  };

	  /**
	   * Returns an {@link ObjectLikeSequence} whose elements are the combination of
	   * this sequence and a 'default' object. In the case of a key appearing in both
	   * this sequence and the given object, this sequence's value will override the
	   * default object's.
	   *
	   * @public
	   * @param {Object} defaults The 'default' object to use for missing keys in this
	   *     sequence.
	   * @returns {ObjectLikeSequence} A new sequence comprising elements from this
	   *     sequence supplemented by the contents of `defaults`.
	   *
	   * @examples
	   * Lazy({ name: "Dan" }).defaults({ name: "User", password: "passw0rd" }) // sequence: { name: "Dan", password: "passw0rd" }
	   */
	  ObjectLikeSequence.prototype.defaults = function defaults(defaults) {
	    return new DefaultsSequence(this, defaults);
	  };

	  /**
	   * @constructor
	   */
	  function DefaultsSequence(parent, defaults) {
	    this.parent   = parent;
	    this.defaults = defaults;
	  }

	  DefaultsSequence.prototype = new ObjectLikeSequence();

	  DefaultsSequence.prototype.get = function get(key) {
	    return this.parent.get(key) || this.defaults[key];
	  };

	  DefaultsSequence.prototype.each = function each(fn) {
	    var merged = new Set(),
	        done   = false;

	    this.parent.each(function(value, key) {
	      if (fn(value, key) === false) {
	        done = true;
	        return false;
	      }

	      if (typeof value !== "undefined") {
	        merged.add(key);
	      }
	    });

	    if (!done) {
	      Lazy(this.defaults).each(function(value, key) {
	        if (!merged.contains(key) && fn(value, key) === false) {
	          return false;
	        }
	      });
	    }
	  };

	  /**
	   * Returns an {@link ObjectLikeSequence} whose values are this sequence's keys,
	   * and whose keys are this sequence's values.
	   *
	   * @public
	   * @returns {ObjectLikeSequence} A new sequence comprising the inverted keys and
	   *     values from this sequence.
	   *
	   * @examples
	   * Lazy({ first: "Dan", last: "Tao" }).invert() // sequence: { Dan: "first", Tao: "last" }
	   */
	  ObjectLikeSequence.prototype.invert = function invert() {
	    return new InvertedSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function InvertedSequence(parent) {
	    this.parent = parent;
	  }

	  InvertedSequence.prototype = new ObjectLikeSequence();

	  InvertedSequence.prototype.each = function each(fn) {
	    this.parent.each(function(value, key) {
	      return fn(key, value);
	    });
	  };

	  /**
	   * Produces an {@link ObjectLikeSequence} consisting of all the recursively
	   * merged values from this and the given object(s) or sequence(s).
	   *
	   * Note that by default this method only merges "vanilla" objects (bags of
	   * key/value pairs), not arrays or any other custom object types. To customize
	   * how merging works, you can provide the mergeFn argument, e.g. to handling
	   * merging arrays, strings, or other types of objects.
	   *
	   * @public
	   * @param {...Object|ObjectLikeSequence} others The other object(s) or
	   *     sequence(s) whose values will be merged into this one.
	   * @param {Function=} mergeFn An optional function used to customize merging
	   *     behavior. The function should take two values as parameters and return
	   *     whatever the "merged" form of those values is. If the function returns
	   *     undefined then the new value will simply replace the old one in the
	   *     final result.
	   * @returns {ObjectLikeSequence} The new sequence consisting of merged values.
	   *
	   * @examples
	   * // These examples are completely stolen from Lo-Dash's documentation:
	   * // lodash.com/docs#merge
	   *
	   * var names = {
	   *   'characters': [
	   *     { 'name': 'barney' },
	   *     { 'name': 'fred' }
	   *   ]
	   * };
	   *
	   * var ages = {
	   *   'characters': [
	   *     { 'age': 36 },
	   *     { 'age': 40 }
	   *   ]
	   * };
	   *
	   * var food = {
	   *   'fruits': ['apple'],
	   *   'vegetables': ['beet']
	   * };
	   *
	   * var otherFood = {
	   *   'fruits': ['banana'],
	   *   'vegetables': ['carrot']
	   * };
	   *
	   * function mergeArrays(a, b) {
	   *   return Array.isArray(a) ? a.concat(b) : undefined;
	   * }
	   *
	   * Lazy(names).merge(ages); // => sequence: { 'characters': [{ 'name': 'barney', 'age': 36 }, { 'name': 'fred', 'age': 40 }] }
	   * Lazy(food).merge(otherFood, mergeArrays); // => sequence: { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] }
	   *
	   * // ----- Now for my own tests: -----
	   *
	   * // merges objects
	   * Lazy({ foo: 1 }).merge({ foo: 2 }); // => sequence: { foo: 2 }
	   * Lazy({ foo: 1 }).merge({ bar: 2 }); // => sequence: { foo: 1, bar: 2 }
	   *
	   * // goes deep
	   * Lazy({ foo: { bar: 1 } }).merge({ foo: { bar: 2 } }); // => sequence: { foo: { bar: 2 } }
	   * Lazy({ foo: { bar: 1 } }).merge({ foo: { baz: 2 } }); // => sequence: { foo: { bar: 1, baz: 2 } }
	   * Lazy({ foo: { bar: 1 } }).merge({ foo: { baz: 2 } }); // => sequence: { foo: { bar: 1, baz: 2 } }
	   *
	   * // gives precedence to later sources
	   * Lazy({ foo: 1 }).merge({ bar: 2 }, { bar: 3 }); // => sequence: { foo: 1, bar: 3 }
	   *
	   * // undefined gets passed over
	   * Lazy({ foo: 1 }).merge({ foo: undefined }); // => sequence: { foo: 1 }
	   *
	   * // null doesn't get passed over
	   * Lazy({ foo: 1 }).merge({ foo: null }); // => sequence: { foo: null }
	   *
	   * // array contents get merged as well
	   * Lazy({ foo: [{ bar: 1 }] }).merge({ foo: [{ baz: 2 }] }); // => sequence: { foo: [{ bar: 1, baz: 2}] }
	   */
	  ObjectLikeSequence.prototype.merge = function merge(var_args) {
	    var mergeFn = arguments.length > 1 && typeof arguments[arguments.length - 1] === "function" ?
	      arrayPop.call(arguments) : null;
	    return new MergedSequence(this, arraySlice.call(arguments, 0), mergeFn);
	  };

	  /**
	   * @constructor
	   */
	  function MergedSequence(parent, others, mergeFn) {
	    this.parent  = parent;
	    this.others  = others;
	    this.mergeFn = mergeFn;
	  }

	  MergedSequence.prototype = new ObjectLikeSequence();

	  MergedSequence.prototype.each = function each(fn) {
	    var others  = this.others,
	        mergeFn = this.mergeFn || mergeObjects,
	        keys    = {};

	    var iteratedFullSource = this.parent.each(function(value, key) {
	      var merged = value;

	      forEach(others, function(other) {
	        if (key in other) {
	          merged = mergeFn(merged, other[key]);
	        }
	      });

	      keys[key] = true;

	      return fn(merged, key);
	    });

	    if (iteratedFullSource === false) {
	      return false;
	    }

	    var remaining = {};

	    forEach(others, function(other) {
	      for (var k in other) {
	        if (!keys[k]) {
	          remaining[k] = mergeFn(remaining[k], other[k]);
	        }
	      }
	    });

	    return Lazy(remaining).each(fn);
	  };

	  /**
	   * @private
	   * @examples
	   * mergeObjects({ foo: 1 }, { bar: 2 }); // => { foo: 1, bar: 2 }
	   * mergeObjects({ foo: { bar: 1 } }, { foo: { baz: 2 } }); // => { foo: { bar: 1, baz: 2 } }
	   * mergeObjects({ foo: { bar: 1 } }, { foo: undefined }); // => { foo: { bar: 1 } }
	   * mergeObjects({ foo: { bar: 1 } }, { foo: null }); // => { foo: null }
	   * mergeObjects({ array: [0, 1, 2] }, { array: [3, 4, 5] }).array; // instanceof Array
	   * mergeObjects({ date: new Date() }, { date: new Date() }).date; // instanceof Date
	   * mergeObjects([{ foo: 1 }], [{ bar: 2 }]); // => [{ foo: 1, bar: 2 }]
	   */
	  function mergeObjects(a, b) {
	    var merged, prop;

	    if (typeof b === 'undefined') {
	      return a;
	    }

	    // Check that we're dealing with two objects or two arrays.
	    if (isVanillaObject(a) && isVanillaObject(b)) {
	      merged = {};
	    } else if (a instanceof Array && b instanceof Array) {
	      merged = [];
	    } else {
	      // Otherwise there's no merging to do -- just replace a w/ b.
	      return b;
	    }

	    for (prop in a) {
	      merged[prop] = mergeObjects(a[prop], b[prop]);
	    }
	    for (prop in b) {
	      if (!merged[prop]) {
	        merged[prop] = b[prop];
	      }
	    }
	    return merged;
	  }

	  /**
	   * Checks whether an object is a "vanilla" object, i.e. {'foo': 'bar'} as
	   * opposed to an array, date, etc.
	   *
	   * @private
	   * @examples
	   * isVanillaObject({foo: 'bar'}); // => true
	   * isVanillaObject(new Date());   // => false
	   * isVanillaObject([1, 2, 3]);    // => false
	   */
	  function isVanillaObject(object) {
	    return object && object.constructor === Object;
	  }

	  /**
	   * Creates a {@link Sequence} consisting of the keys from this sequence whose
	   *     values are functions.
	   *
	   * @public
	   * @aka methods
	   * @returns {Sequence} The new sequence.
	   *
	   * @examples
	   * var dog = {
	   *   name: "Fido",
	   *   breed: "Golden Retriever",
	   *   bark: function() { console.log("Woof!"); },
	   *   wagTail: function() { console.log("TODO: implement robotic dog interface"); }
	   * };
	   *
	   * Lazy(dog).functions() // sequence: ["bark", "wagTail"]
	   */
	  ObjectLikeSequence.prototype.functions = function functions() {
	    return this
	      .filter(function(v, k) { return typeof(v) === "function"; })
	      .map(function(v, k) { return k; });
	  };

	  ObjectLikeSequence.prototype.methods = function methods() {
	    return this.functions();
	  };

	  /**
	   * Creates an {@link ObjectLikeSequence} consisting of the key/value pairs from
	   * this sequence whose keys are included in the given array of property names.
	   *
	   * @public
	   * @param {Array} properties An array of the properties to "pick" from this
	   *     sequence.
	   * @returns {ObjectLikeSequence} The new sequence.
	   *
	   * @examples
	   * var players = {
	   *   "who": "first",
	   *   "what": "second",
	   *   "i don't know": "third"
	   * };
	   *
	   * Lazy(players).pick(["who", "what"]) // sequence: { who: "first", what: "second" }
	   */
	  ObjectLikeSequence.prototype.pick = function pick(properties) {
	    return new PickSequence(this, properties);
	  };

	  /**
	   * @constructor
	   */
	  function PickSequence(parent, properties) {
	    this.parent     = parent;
	    this.properties = properties;
	  }

	  PickSequence.prototype = new ObjectLikeSequence();

	  PickSequence.prototype.get = function get(key) {
	    return arrayContains(this.properties, key) ? this.parent.get(key) : undefined;
	  };

	  PickSequence.prototype.each = function each(fn) {
	    var inArray    = arrayContains,
	        properties = this.properties;

	    return this.parent.each(function(value, key) {
	      if (inArray(properties, key)) {
	        return fn(value, key);
	      }
	    });
	  };

	  /**
	   * Creates an {@link ObjectLikeSequence} consisting of the key/value pairs from
	   * this sequence excluding those with the specified keys.
	   *
	   * @public
	   * @param {Array} properties An array of the properties to *omit* from this
	   *     sequence.
	   * @returns {ObjectLikeSequence} The new sequence.
	   *
	   * @examples
	   * var players = {
	   *   "who": "first",
	   *   "what": "second",
	   *   "i don't know": "third"
	   * };
	   *
	   * Lazy(players).omit(["who", "what"]) // sequence: { "i don't know": "third" }
	   */
	  ObjectLikeSequence.prototype.omit = function omit(properties) {
	    return new OmitSequence(this, properties);
	  };

	  /**
	   * @constructor
	   */
	  function OmitSequence(parent, properties) {
	    this.parent     = parent;
	    this.properties = properties;
	  }

	  OmitSequence.prototype = new ObjectLikeSequence();

	  OmitSequence.prototype.get = function get(key) {
	    return arrayContains(this.properties, key) ? undefined : this.parent.get(key);
	  };

	  OmitSequence.prototype.each = function each(fn) {
	    var inArray    = arrayContains,
	        properties = this.properties;

	    return this.parent.each(function(value, key) {
	      if (!inArray(properties, key)) {
	        return fn(value, key);
	      }
	    });
	  };

	  /**
	   * Maps the key/value pairs in this sequence to arrays.
	   *
	   * @public
	   * @aka toArray
	   * @returns {Sequence} An sequence of `[key, value]` pairs.
	   *
	   * @examples
	   * var colorCodes = {
	   *   red: "#f00",
	   *   green: "#0f0",
	   *   blue: "#00f"
	   * };
	   *
	   * Lazy(colorCodes).pairs() // sequence: [["red", "#f00"], ["green", "#0f0"], ["blue", "#00f"]]
	   */
	  ObjectLikeSequence.prototype.pairs = function pairs() {
	    return this.map(function(v, k) { return [k, v]; });
	  };

	  /**
	   * Creates an array from the key/value pairs in this sequence.
	   *
	   * @public
	   * @returns {Array} An array of `[key, value]` elements.
	   *
	   * @examples
	   * var colorCodes = {
	   *   red: "#f00",
	   *   green: "#0f0",
	   *   blue: "#00f"
	   * };
	   *
	   * Lazy(colorCodes).toArray() // => [["red", "#f00"], ["green", "#0f0"], ["blue", "#00f"]]
	   */
	  ObjectLikeSequence.prototype.toArray = function toArray() {
	    return this.pairs().toArray();
	  };

	  /**
	   * Creates an object with the key/value pairs from this sequence.
	   *
	   * @public
	   * @returns {Object} An object with the same key/value pairs as this sequence.
	   *
	   * @examples
	   * var colorCodes = {
	   *   red: "#f00",
	   *   green: "#0f0",
	   *   blue: "#00f"
	   * };
	   *
	   * Lazy(colorCodes).toObject() // => { red: "#f00", green: "#0f0", blue: "#00f" }
	   */
	  ObjectLikeSequence.prototype.toObject = function toObject() {
	    return this.reduce(function(object, value, key) {
	      object[key] = value;
	      return object;
	    }, {});
	  };

	  // Now that we've fully initialized the ObjectLikeSequence prototype, we can
	  // actually set the prototypes for GroupedSequence, IndexedSequence, and
	  // CountedSequence.

	  GroupedSequence.prototype = new ObjectLikeSequence();

	  GroupedSequence.prototype.each = function each(fn) {
	    var keyFn   = createCallback(this.keyFn),
	        valFn   = createCallback(this.valFn),
	        result;

	    result = this.parent.reduce(function(grouped,e) {
	      var key = keyFn(e),
	          val = valFn(e);
	      if (!(grouped[key] instanceof Array)) {
	        grouped[key] = [val];
	      } else {
	        grouped[key].push(val);
	      }
	      return grouped;
	    },{});

	    return transform(function(grouped) {
	      for (var key in grouped) {
	        if (fn(grouped[key], key) === false) {
	          return false;
	        }
	      }
	    }, result);
	  };

	  IndexedSequence.prototype = new ObjectLikeSequence();

	  IndexedSequence.prototype.each = function each(fn) {
	    var keyFn   = createCallback(this.keyFn),
	        valFn   = createCallback(this.valFn),
	        indexed = {};

	    return this.parent.each(function(e) {
	      var key = keyFn(e),
	          val = valFn(e);

	      if (!indexed[key]) {
	        indexed[key] = val;
	        return fn(val, key);
	      }
	    });
	  };

	  CountedSequence.prototype = new ObjectLikeSequence();

	  CountedSequence.prototype.each = function each(fn) {
	    var keyFn   = createCallback(this.keyFn),
	        counted = {};

	    this.parent.each(function(e) {
	      var key = keyFn(e);
	      if (!counted[key]) {
	        counted[key] = 1;
	      } else {
	        counted[key] += 1;
	      }
	    });

	    for (var key in counted) {
	      if (fn(counted[key], key) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * Watches for all changes to a specified property (or properties) of an
	   * object and produces a sequence whose elements have the properties
	   * `{ property, value }` indicating which property changed and what it was
	   * changed to.
	   *
	   * Note that this method **only works on directly wrapped objects**; it will
	   * *not* work on any arbitrary {@link ObjectLikeSequence}.
	   *
	   * @public
	   * @param {(string|Array)=} propertyNames A property name or array of property
	   *     names to watch. If this parameter is `undefined`, all of the object's
	   *     current (enumerable) properties will be watched.
	   * @returns {Sequence} A sequence comprising `{ property, value }` objects
	   *     describing each change to the specified property/properties.
	   *
	   * @examples
	   * var obj = {},
	   *     changes = [];
	   *
	   * Lazy(obj).watch('foo').each(function(change) {
	   *   changes.push(change);
	   * });
	   *
	   * obj.foo = 1;
	   * obj.bar = 2;
	   * obj.foo = 3;
	   *
	   * obj.foo; // => 3
	   * changes; // => [{ property: 'foo', value: 1 }, { property: 'foo', value: 3 }]
	   */
	  ObjectLikeSequence.prototype.watch = function watch(propertyNames) {
	    throw new Error('You can only call #watch on a directly wrapped object.');
	  };

	  /**
	   * @constructor
	   */
	  function ObjectWrapper(source) {
	    this.source = source;
	  }

	  ObjectWrapper.prototype = new ObjectLikeSequence();

	  ObjectWrapper.prototype.root = function root() {
	    return this;
	  };

	  ObjectWrapper.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  ObjectWrapper.prototype.get = function get(key) {
	    return this.source[key];
	  };

	  ObjectWrapper.prototype.each = function each(fn) {
	    var source = this.source,
	        key;

	    for (key in source) {
	      if (fn(source[key], key) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  /**
	   * A `StringLikeSequence` represents a sequence of characters.
	   *
	   * The initial sequence you get by wrapping a string with `Lazy(string)` is a
	   * `StringLikeSequence`.
	   *
	   * All methods of `StringLikeSequence` that conceptually should return
	   * something like a string return another `StringLikeSequence`.
	   *
	   * @public
	   * @constructor
	   *
	   * @examples
	   * function upcase(str) { return str.toUpperCase(); }
	   *
	   * Lazy('foo')               // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').toUpperCase() // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').reverse()     // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').take(2)       // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').drop(1)       // instanceof Lazy.StringLikeSequence
	   * Lazy('foo').substring(1)  // instanceof Lazy.StringLikeSequence
	   *
	   * // Note that `map` does not create a `StringLikeSequence` because there's
	   * // no guarantee the mapping function will return characters. In the event
	   * // you do want to map a string onto a string-like sequence, use
	   * // `mapString`:
	   * Lazy('foo').map(Lazy.identity)       // instanceof Lazy.ArrayLikeSequence
	   * Lazy('foo').mapString(Lazy.identity) // instanceof Lazy.StringLikeSequence
	   */
	  function StringLikeSequence() {}

	  StringLikeSequence.prototype = new ArrayLikeSequence();

	  /**
	   * Create a new constructor function for a type inheriting from
	   * `StringLikeSequence`.
	   *
	   * @public
	   * @param {string|Array.<string>} methodName The name(s) of the method(s) to be
	   *     used for constructing the new sequence. The method will be attached to
	   *     the `StringLikeSequence` prototype so that it can be chained with any other
	   *     methods that return string-like sequences.
	   * @param {Object} overrides An object containing function overrides for this
	   *     new sequence type. Has the same requirements as
	   *     {@link ArrayLikeSequence.define}.
	   * @returns {Function} A constructor for a new type inheriting from
	   *     `StringLikeSequence`.
	   *
	   * @examples
	   * Lazy.StringLikeSequence.define("zomg", {
	   *   length: function() {
	   *     return this.parent.length() + "!!ZOMG!!!1".length;
	   *   },
	   *
	   *   get: function(i) {
	   *     if (i < this.parent.length()) {
	   *       return this.parent.get(i);
	   *     }
	   *     return "!!ZOMG!!!1".charAt(i - this.parent.length());
	   *   }
	   * });
	   *
	   * Lazy('foo').zomg() // sequence: "foo!!ZOMG!!!1"
	   */
	  StringLikeSequence.define = function define(methodName, overrides) {
	    if (!overrides || typeof overrides.get !== 'function') {
	      throw new Error("A custom string-like sequence must implement *at least* get!");
	    }

	    return defineSequenceType(StringLikeSequence, methodName, overrides);
	  };

	  StringLikeSequence.prototype.value = function value() {
	    return this.toString();
	  };

	  /**
	   * Returns an {@link IndexedIterator} that will step over each character in this
	   * sequence one by one.
	   *
	   * @returns {IndexedIterator} The iterator.
	   */
	  StringLikeSequence.prototype.getIterator = function getIterator() {
	    return new CharIterator(this);
	  };

	  /**
	   * @constructor
	   */
	  function CharIterator(source) {
	    this.source = Lazy(source);
	    this.index = -1;
	  }

	  CharIterator.prototype.current = function current() {
	    return this.source.charAt(this.index);
	  };

	  CharIterator.prototype.moveNext = function moveNext() {
	    return (++this.index < this.source.length());
	  };

	  /**
	   * Returns the character at the given index of this sequence, or the empty
	   * string if the specified index lies outside the bounds of the sequence.
	   *
	   * @public
	   * @param {number} i The index of this sequence.
	   * @returns {string} The character at the specified index.
	   *
	   * @examples
	   * Lazy("foo").charAt(0)  // => "f"
	   * Lazy("foo").charAt(-1) // => ""
	   * Lazy("foo").charAt(10) // => ""
	   */
	  StringLikeSequence.prototype.charAt = function charAt(i) {
	    return this.get(i);
	  };

	  /**
	   * Returns the character code at the given index of this sequence, or `NaN` if
	   * the index lies outside the bounds of the sequence.
	   *
	   * @public
	   * @param {number} i The index of the character whose character code you want.
	   * @returns {number} The character code.
	   *
	   * @examples
	   * Lazy("abc").charCodeAt(0)  // => 97
	   * Lazy("abc").charCodeAt(-1) // => NaN
	   * Lazy("abc").charCodeAt(10) // => NaN
	   */
	  StringLikeSequence.prototype.charCodeAt = function charCodeAt(i) {
	    var char = this.charAt(i);
	    if (!char) { return NaN; }

	    return char.charCodeAt(0);
	  };

	  /**
	   * Returns a {@link StringLikeSequence} comprising the characters from *this*
	   * sequence starting at `start` and ending at `stop` (exclusive), or---if
	   * `stop` is `undefined`, including the rest of the sequence.
	   *
	   * @public
	   * @param {number} start The index where this sequence should begin.
	   * @param {number=} stop The index (exclusive) where this sequence should end.
	   * @returns {StringLikeSequence} The new sequence.
	   *
	   * @examples
	   * Lazy("foo").substring(1)      // sequence: "oo"
	   * Lazy("foo").substring(-1)     // sequence: "foo"
	   * Lazy("hello").substring(1, 3) // sequence: "el"
	   * Lazy("hello").substring(1, 9) // sequence: "ello"
	   */
	  StringLikeSequence.prototype.substring = function substring(start, stop) {
	    return new StringSegment(this, start, stop);
	  };

	  /**
	   * @constructor
	   */
	  function StringSegment(parent, start, stop) {
	    this.parent = parent;
	    this.start  = Math.max(0, start);
	    this.stop   = stop;
	  }

	  StringSegment.prototype = new StringLikeSequence();

	  StringSegment.prototype.get = function get(i) {
	    return this.parent.get(i + this.start);
	  };

	  StringSegment.prototype.length = function length() {
	    return (typeof this.stop === "number" ? this.stop : this.parent.length()) - this.start;
	  };

	  /**
	   * An optimized version of {@link Sequence#first} that returns another
	   * {@link StringLikeSequence} (or just the first character, if `count` is
	   * undefined).
	   *
	   * @public
	   * @examples
	   * Lazy('foo').first()                // => 'f'
	   * Lazy('fo').first(2)                // sequence: 'fo'
	   * Lazy('foo').first(10)              // sequence: 'foo'
	   * Lazy('foo').toUpperCase().first()  // => 'F'
	   * Lazy('foo').toUpperCase().first(2) // sequence: 'FO'
	   */
	  StringLikeSequence.prototype.first = function first(count) {
	    if (typeof count === "undefined") {
	      return this.charAt(0);
	    }

	    return this.substring(0, count);
	  };

	  /**
	   * An optimized version of {@link Sequence#last} that returns another
	   * {@link StringLikeSequence} (or just the last character, if `count` is
	   * undefined).
	   *
	   * @public
	   * @examples
	   * Lazy('foo').last()                // => 'o'
	   * Lazy('foo').last(2)               // sequence: 'oo'
	   * Lazy('foo').last(10)              // sequence: 'foo'
	   * Lazy('foo').toUpperCase().last()  // => 'O'
	   * Lazy('foo').toUpperCase().last(2) // sequence: 'OO'
	   */
	  StringLikeSequence.prototype.last = function last(count) {
	    if (typeof count === "undefined") {
	      return this.charAt(this.length() - 1);
	    }

	    return this.substring(this.length() - count);
	  };

	  StringLikeSequence.prototype.drop = function drop(count) {
	    return this.substring(count);
	  };

	  /**
	   * Finds the index of the first occurrence of the given substring within this
	   * sequence, starting from the specified index (or the beginning of the
	   * sequence).
	   *
	   * @public
	   * @param {string} substring The substring to search for.
	   * @param {number=} startIndex The index from which to start the search.
	   * @returns {number} The first index where the given substring is found, or
	   *     -1 if it isn't in the sequence.
	   *
	   * @examples
	   * Lazy('canal').indexOf('a')    // => 1
	   * Lazy('canal').indexOf('a', 2) // => 3
	   * Lazy('canal').indexOf('ana')  // => 1
	   * Lazy('canal').indexOf('andy') // => -1
	   * Lazy('canal').indexOf('x')    // => -1
	   */
	  StringLikeSequence.prototype.indexOf = function indexOf(substring, startIndex) {
	    return this.toString().indexOf(substring, startIndex);
	  };

	  /**
	   * Finds the index of the last occurrence of the given substring within this
	   * sequence, starting from the specified index (or the end of the sequence)
	   * and working backwards.
	   *
	   * @public
	   * @param {string} substring The substring to search for.
	   * @param {number=} startIndex The index from which to start the search.
	   * @returns {number} The last index where the given substring is found, or
	   *     -1 if it isn't in the sequence.
	   *
	   * @examples
	   * Lazy('canal').lastIndexOf('a')    // => 3
	   * Lazy('canal').lastIndexOf('a', 2) // => 1
	   * Lazy('canal').lastIndexOf('ana')  // => 1
	   * Lazy('canal').lastIndexOf('andy') // => -1
	   * Lazy('canal').lastIndexOf('x')    // => -1
	   */
	  StringLikeSequence.prototype.lastIndexOf = function lastIndexOf(substring, startIndex) {
	    return this.toString().lastIndexOf(substring, startIndex);
	  };

	  /**
	   * Checks if this sequence contains a given substring.
	   *
	   * @public
	   * @param {string} substring The substring to check for.
	   * @returns {boolean} Whether or not this sequence contains `substring`.
	   *
	   * @examples
	   * Lazy('hello').contains('ell') // => true
	   * Lazy('hello').contains('')    // => true
	   * Lazy('hello').contains('abc') // => false
	   */
	  StringLikeSequence.prototype.contains = function contains(substring) {
	    return this.indexOf(substring) !== -1;
	  };

	  /**
	   * Checks if this sequence ends with a given suffix.
	   *
	   * @public
	   * @param {string} suffix The suffix to check for.
	   * @returns {boolean} Whether or not this sequence ends with `suffix`.
	   *
	   * @examples
	   * Lazy('foo').endsWith('oo')  // => true
	   * Lazy('foo').endsWith('')    // => true
	   * Lazy('foo').endsWith('abc') // => false
	   */
	  StringLikeSequence.prototype.endsWith = function endsWith(suffix) {
	    return this.substring(this.length() - suffix.length).toString() === suffix;
	  };

	  /**
	   * Checks if this sequence starts with a given prefix.
	   *
	   * @public
	   * @param {string} prefix The prefix to check for.
	   * @returns {boolean} Whether or not this sequence starts with `prefix`.
	   *
	   * @examples
	   * Lazy('foo').startsWith('fo')  // => true
	   * Lazy('foo').startsWith('')    // => true
	   * Lazy('foo').startsWith('abc') // => false
	   */
	  StringLikeSequence.prototype.startsWith = function startsWith(prefix) {
	    return this.substring(0, prefix.length).toString() === prefix;
	  };

	  /**
	   * Converts all of the characters in this string to uppercase.
	   *
	   * @public
	   * @returns {StringLikeSequence} A new sequence with the same characters as
	   *     this sequence, all uppercase.
	   *
	   * @examples
	   * function nextLetter(a) {
	   *   return String.fromCharCode(a.charCodeAt(0) + 1);
	   * }
	   *
	   * Lazy('foo').toUpperCase()                       // sequence: 'FOO'
	   * Lazy('foo').substring(1).toUpperCase()          // sequence: 'OO'
	   * Lazy('abc').mapString(nextLetter).toUpperCase() // sequence: 'BCD'
	   */
	  StringLikeSequence.prototype.toUpperCase = function toUpperCase() {
	    return this.mapString(function(char) { return char.toUpperCase(); });
	  };

	  /**
	   * Converts all of the characters in this string to lowercase.
	   *
	   * @public
	   * @returns {StringLikeSequence} A new sequence with the same characters as
	   *     this sequence, all lowercase.
	   *
	   * @examples
	   * function nextLetter(a) {
	   *   return String.fromCharCode(a.charCodeAt(0) + 1);
	   * }
	   *
	   * Lazy('FOO').toLowerCase()                       // sequence: 'foo'
	   * Lazy('FOO').substring(1).toLowerCase()          // sequence: 'oo'
	   * Lazy('ABC').mapString(nextLetter).toLowerCase() // sequence: 'bcd'
	   */
	  StringLikeSequence.prototype.toLowerCase = function toLowerCase() {
	    return this.mapString(function(char) { return char.toLowerCase(); });
	  };

	  /**
	   * Maps the characters of this sequence onto a new {@link StringLikeSequence}.
	   *
	   * @public
	   * @param {Function} mapFn The function used to map characters from this
	   *     sequence onto the new sequence.
	   * @returns {StringLikeSequence} The new sequence.
	   *
	   * @examples
	   * function upcase(char) { return char.toUpperCase(); }
	   *
	   * Lazy("foo").mapString(upcase)               // sequence: "FOO"
	   * Lazy("foo").mapString(upcase).charAt(0)     // => "F"
	   * Lazy("foo").mapString(upcase).charCodeAt(0) // => 70
	   * Lazy("foo").mapString(upcase).substring(1)  // sequence: "OO"
	   */
	  StringLikeSequence.prototype.mapString = function mapString(mapFn) {
	    return new MappedStringLikeSequence(this, mapFn);
	  };

	  /**
	   * @constructor
	   */
	  function MappedStringLikeSequence(parent, mapFn) {
	    this.parent = parent;
	    this.mapFn  = mapFn;
	  }

	  MappedStringLikeSequence.prototype = new StringLikeSequence();
	  MappedStringLikeSequence.prototype.get = IndexedMappedSequence.prototype.get;
	  MappedStringLikeSequence.prototype.length = IndexedMappedSequence.prototype.length;

	  /**
	   * Returns a copy of this sequence that reads back to front.
	   *
	   * @public
	   *
	   * @examples
	   * Lazy("abcdefg").reverse() // sequence: "gfedcba"
	   */
	  StringLikeSequence.prototype.reverse = function reverse() {
	    return new ReversedStringLikeSequence(this);
	  };

	  /**
	   * @constructor
	   */
	  function ReversedStringLikeSequence(parent) {
	    this.parent = parent;
	  }

	  ReversedStringLikeSequence.prototype = new StringLikeSequence();
	  ReversedStringLikeSequence.prototype.get = IndexedReversedSequence.prototype.get;
	  ReversedStringLikeSequence.prototype.length = IndexedReversedSequence.prototype.length;

	  StringLikeSequence.prototype.toString = function toString() {
	    return this.join("");
	  };

	  /**
	   * Creates a {@link Sequence} comprising all of the matches for the specified
	   * pattern in the underlying string.
	   *
	   * @public
	   * @param {RegExp} pattern The pattern to match.
	   * @returns {Sequence} A sequence of all the matches.
	   *
	   * @examples
	   * Lazy("abracadabra").match(/a[bcd]/) // sequence: ["ab", "ac", "ad", "ab"]
	   * Lazy("fee fi fo fum").match(/\w+/)  // sequence: ["fee", "fi", "fo", "fum"]
	   * Lazy("hello").match(/xyz/)          // sequence: []
	   */
	  StringLikeSequence.prototype.match = function match(pattern) {
	    return new StringMatchSequence(this, pattern);
	  };

	  /**
	   * @constructor
	   */
	  function StringMatchSequence(parent, pattern) {
	    this.parent = parent;
	    this.pattern = pattern;
	  }

	  StringMatchSequence.prototype = new Sequence();

	  StringMatchSequence.prototype.getIterator = function getIterator() {
	    return new StringMatchIterator(this.parent.toString(), this.pattern);
	  };

	  /**
	   * @constructor
	   */
	  function StringMatchIterator(source, pattern) {
	    this.source  = source;
	    this.pattern = cloneRegex(pattern);
	  }

	  StringMatchIterator.prototype.current = function current() {
	    return this.match[0];
	  };

	  StringMatchIterator.prototype.moveNext = function moveNext() {
	    return !!(this.match = this.pattern.exec(this.source));
	  };

	  /**
	   * Creates a {@link Sequence} comprising all of the substrings of this string
	   * separated by the given delimiter, which can be either a string or a regular
	   * expression.
	   *
	   * @public
	   * @param {string|RegExp} delimiter The delimiter to use for recognizing
	   *     substrings.
	   * @returns {Sequence} A sequence of all the substrings separated by the given
	   *     delimiter.
	   *
	   * @examples
	   * Lazy("foo").split("")                      // sequence: ["f", "o", "o"]
	   * Lazy("yo dawg").split(" ")                 // sequence: ["yo", "dawg"]
	   * Lazy("bah bah\tblack  sheep").split(/\s+/) // sequence: ["bah", "bah", "black", "sheep"]
	   */
	  StringLikeSequence.prototype.split = function split(delimiter) {
	    return new SplitStringSequence(this, delimiter);
	  };

	  /**
	   * @constructor
	   */
	  function SplitStringSequence(parent, pattern) {
	    this.parent = parent;
	    this.pattern = pattern;
	  }

	  SplitStringSequence.prototype = new Sequence();

	  SplitStringSequence.prototype.getIterator = function getIterator() {
	    var source = this.parent.toString();

	    if (this.pattern instanceof RegExp) {
	      if (this.pattern.source === "" || this.pattern.source === "(?:)") {
	        return new CharIterator(source);
	      } else {
	        return new SplitWithRegExpIterator(source, this.pattern);
	      }
	    } else if (this.pattern === "") {
	      return new CharIterator(source);
	    } else {
	      return new SplitWithStringIterator(source, this.pattern);
	    }
	  };

	  /**
	   * @constructor
	   */
	  function SplitWithRegExpIterator(source, pattern) {
	    this.source  = source;
	    this.pattern = cloneRegex(pattern);
	  }

	  SplitWithRegExpIterator.prototype.current = function current() {
	    return this.source.substring(this.start, this.end);
	  };

	  SplitWithRegExpIterator.prototype.moveNext = function moveNext() {
	    if (!this.pattern) {
	      return false;
	    }

	    var match = this.pattern.exec(this.source);

	    if (match) {
	      this.start = this.nextStart ? this.nextStart : 0;
	      this.end = match.index;
	      this.nextStart = match.index + match[0].length;
	      return true;

	    } else if (this.pattern) {
	      this.start = this.nextStart;
	      this.end = undefined;
	      this.nextStart = undefined;
	      this.pattern = undefined;
	      return true;
	    }

	    return false;
	  };

	  /**
	   * @constructor
	   */
	  function SplitWithStringIterator(source, delimiter) {
	    this.source = source;
	    this.delimiter = delimiter;
	  }

	  SplitWithStringIterator.prototype.current = function current() {
	    return this.source.substring(this.leftIndex, this.rightIndex);
	  };

	  SplitWithStringIterator.prototype.moveNext = function moveNext() {
	    if (!this.finished) {
	      this.leftIndex = typeof this.leftIndex !== "undefined" ?
	        this.rightIndex + this.delimiter.length :
	        0;
	      this.rightIndex = this.source.indexOf(this.delimiter, this.leftIndex);
	    }

	    if (this.rightIndex === -1) {
	      this.finished = true;
	      this.rightIndex = undefined;
	      return true;
	    }

	    return !this.finished;
	  };

	  /**
	   * Wraps a string exposing {@link #match} and {@link #split} methods that return
	   * {@link Sequence} objects instead of arrays, improving on the efficiency of
	   * JavaScript's built-in `String#split` and `String.match` methods and
	   * supporting asynchronous iteration.
	   *
	   * @param {string} source The string to wrap.
	   * @constructor
	   */
	  function StringWrapper(source) {
	    this.source = source;
	  }

	  StringWrapper.prototype = new StringLikeSequence();

	  StringWrapper.prototype.root = function root() {
	    return this;
	  };

	  StringWrapper.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  StringWrapper.prototype.get = function get(i) {
	    return this.source.charAt(i);
	  };

	  StringWrapper.prototype.length = function length() {
	    return this.source.length;
	  };

	  StringWrapper.prototype.toString = function toString() {
	    return this.source;
	  };

	  /**
	   * A `GeneratedSequence` does not wrap an in-memory colllection but rather
	   * determines its elements on-the-fly during iteration according to a generator
	   * function.
	   *
	   * You create a `GeneratedSequence` by calling {@link Lazy.generate}.
	   *
	   * @public
	   * @constructor
	   * @param {function(number):*} generatorFn A function which accepts an index
	   *     and returns a value for the element at that position in the sequence.
	   * @param {number=} length The length of the sequence. If this argument is
	   *     omitted, the sequence will go on forever.
	   */
	  function GeneratedSequence(generatorFn, length) {
	    this.get = generatorFn;
	    this.fixedLength = length;
	  }

	  GeneratedSequence.prototype = new Sequence();

	  GeneratedSequence.prototype.isAsync = function isAsync() {
	    return false;
	  };

	  /**
	   * Returns the length of this sequence.
	   *
	   * @public
	   * @returns {number} The length, or `undefined` if this is an indefinite
	   *     sequence.
	   */
	  GeneratedSequence.prototype.length = function length() {
	    return this.fixedLength;
	  };

	  /**
	   * Iterates over the sequence produced by invoking this sequence's generator
	   * function up to its specified length, or, if length is `undefined`,
	   * indefinitely (in which case the sequence will go on forever--you would need
	   * to call, e.g., {@link Sequence#take} to limit iteration).
	   *
	   * @public
	   * @param {Function} fn The function to call on each output from the generator
	   *     function.
	   */
	  GeneratedSequence.prototype.each = function each(fn) {
	    var generatorFn = this.get,
	        length = this.fixedLength,
	        i = 0;

	    while (typeof length === "undefined" || i < length) {
	      if (fn(generatorFn(i), i++) === false) {
	        return false;
	      }
	    }

	    return true;
	  };

	  GeneratedSequence.prototype.getIterator = function getIterator() {
	    return new GeneratedIterator(this);
	  };

	  /**
	   * Iterates over a generated sequence. (This allows generated sequences to be
	   * iterated asynchronously.)
	   *
	   * @param {GeneratedSequence} sequence The generated sequence to iterate over.
	   * @constructor
	   */
	  function GeneratedIterator(sequence) {
	    this.sequence     = sequence;
	    this.index        = 0;
	    this.currentValue = null;
	  }

	  GeneratedIterator.prototype.current = function current() {
	    return this.currentValue;
	  };

	  GeneratedIterator.prototype.moveNext = function moveNext() {
	    var sequence = this.sequence;

	    if (typeof sequence.fixedLength === "number" && this.index >= sequence.fixedLength) {
	      return false;
	    }

	    this.currentValue = sequence.get(this.index++);
	    return true;
	  };

	  /**
	   * An `AsyncSequence` iterates over its elements asynchronously when
	   * {@link #each} is called.
	   *
	   * You get an `AsyncSequence` by calling {@link Sequence#async} on any
	   * sequence. Note that some sequence types may not support asynchronous
	   * iteration.
	   *
	   * Returning values
	   * ----------------
	   *
	   * Because of its asynchronous nature, an `AsyncSequence` cannot be used in the
	   * same way as other sequences for functions that return values directly (e.g.,
	   * `reduce`, `max`, `any`, even `toArray`).
	   *
	   * Instead, these methods return an `AsyncHandle` whose `onComplete` method
	   * accepts a callback that will be called with the final result once iteration
	   * has finished.
	   *
	   * Defining custom asynchronous sequences
	   * --------------------------------------
	   *
	   * There are plenty of ways to define an asynchronous sequence. Here's one.
	   *
	   * 1. First, implement an {@link Iterator}. This is an object whose prototype
	   *    has the methods {@link Iterator#moveNext} (which returns a `boolean`) and
	   *    {@link current} (which returns the current value).
	   * 2. Next, create a simple wrapper that inherits from `AsyncSequence`, whose
	   *    `getIterator` function returns an instance of the iterator type you just
	   *    defined.
	   *
	   * The default implementation for {@link #each} on an `AsyncSequence` is to
	   * create an iterator and then asynchronously call {@link Iterator#moveNext}
	   * (using `setImmediate`, if available, otherwise `setTimeout`) until the iterator
	   * can't move ahead any more.
	   *
	   * @public
	   * @constructor
	   * @param {Sequence} parent A {@link Sequence} to wrap, to expose asynchronous
	   *     iteration.
	   * @param {number=} interval How many milliseconds should elapse between each
	   *     element when iterating over this sequence. If this argument is omitted,
	   *     asynchronous iteration will be executed as fast as possible.
	   */
	  function AsyncSequence(parent, interval) {
	    if (parent instanceof AsyncSequence) {
	      throw new Error("Sequence is already asynchronous!");
	    }

	    this.parent         = parent;
	    this.interval       = interval;
	    this.onNextCallback = getOnNextCallback(interval);
	    this.cancelCallback = getCancelCallback(interval);
	  }

	  AsyncSequence.prototype = new Sequence();

	  AsyncSequence.prototype.isAsync = function isAsync() {
	    return true;
	  };

	  /**
	   * Throws an exception. You cannot manually iterate over an asynchronous
	   * sequence.
	   *
	   * @public
	   * @example
	   * Lazy([1, 2, 3]).async().getIterator() // throws
	   */
	  AsyncSequence.prototype.getIterator = function getIterator() {
	    throw new Error('An AsyncSequence does not support synchronous iteration.');
	  };

	  /**
	   * An asynchronous version of {@link Sequence#each}.
	   *
	   * @public
	   * @param {Function} fn The function to invoke asynchronously on each element in
	   *     the sequence one by one.
	   * @returns {AsyncHandle} An {@link AsyncHandle} providing the ability to
	   *     cancel the asynchronous iteration (by calling `cancel()`) as well as
	   *     supply callback(s) for when an error is encountered (`onError`) or when
	   *     iteration is complete (`onComplete`).
	   */
	  AsyncSequence.prototype.each = function each(fn) {
	    var iterator = this.parent.getIterator(),
	        onNextCallback = this.onNextCallback,
	        cancelCallback = this.cancelCallback,
	        i = 0;

	    var handle = new AsyncHandle(function cancel() {
	      if (cancellationId) {
	        cancelCallback(cancellationId);
	      }
	    });

	    var cancellationId = onNextCallback(function iterate() {
	      cancellationId = null;

	      try {
	        if (iterator.moveNext() && fn(iterator.current(), i++) !== false) {
	          cancellationId = onNextCallback(iterate);

	        } else {
	          handle._resolve();
	        }

	      } catch (e) {
	        handle._reject(e);
	      }
	    });

	    return handle;
	  };

	  /**
	   * An `AsyncHandle` provides a [Promises/A+](http://promises-aplus.github.io/promises-spec/)
	   * compliant interface for an {@link AsyncSequence} that is currently (or was)
	   * iterating over its elements.
	   *
	   * In addition to behaving as a promise, an `AsyncHandle` provides the ability
	   * to {@link AsyncHandle#cancel} iteration (if `cancelFn` is provided)
	   * and also offers convenient {@link AsyncHandle#onComplete} and
	   * {@link AsyncHandle#onError} methods to attach listeners for when iteration
	   * is complete or an error is thrown during iteration.
	   *
	   * @public
	   * @param {Function} cancelFn A function to cancel asynchronous iteration.
	   *     This is passed in to support different cancellation mechanisms for
	   *     different forms of asynchronous sequences (e.g., timeout-based
	   *     sequences, sequences based on I/O, etc.).
	   * @constructor
	   *
	   * @example
	   * // Create a sequence of 100,000 random numbers, in chunks of 100.
	   * var sequence = Lazy.generate(Math.random)
	   *   .chunk(100)
	   *   .async()
	   *   .take(1000);
	   *
	   * // Reduce-style operations -- i.e., operations that return a *value* (as
	   * // opposed to a *sequence*) -- return an AsyncHandle for async sequences.
	   * var handle = sequence.toArray();
	   *
	   * handle.onComplete(function(array) {
	   *   // Do something w/ 1,000-element array.
	   * });
	   *
	   * // Since an AsyncHandle is a promise, you can also use it to create
	   * // subsequent promises using `then` (see the Promises/A+ spec for more
	   * // info).
	   * var flattened = handle.then(function(array) {
	   *   return Lazy(array).flatten();
	   * });
	   */
	  function AsyncHandle(cancelFn) {
	    this.resolveListeners = [];
	    this.rejectListeners = [];
	    this.state = PENDING;
	    this.cancelFn = cancelFn;
	  }

	  // Async handle states
	  var PENDING  = 1,
	      RESOLVED = 2,
	      REJECTED = 3;

	  AsyncHandle.prototype.then = function then(onFulfilled, onRejected) {
	    var promise = new AsyncHandle(this.cancelFn);

	    this.resolveListeners.push(function(value) {
	      try {
	        if (typeof onFulfilled !== 'function') {
	          resolve(promise, value);
	          return;
	        }

	        resolve(promise, onFulfilled(value));

	      } catch (e) {
	        promise._reject(e);
	      }
	    });

	    this.rejectListeners.push(function(reason) {
	      try {
	        if (typeof onRejected !== 'function') {
	          promise._reject(reason);
	          return;
	        }

	        resolve(promise, onRejected(reason));

	      } catch (e) {
	        promise._reject(e);
	      }
	    });

	    if (this.state === RESOLVED) {
	      this._resolve(this.value);
	    }

	    if (this.state === REJECTED) {
	      this._reject(this.reason);
	    }

	    return promise;
	  };

	  AsyncHandle.prototype._resolve = function _resolve(value) {
	    if (this.state === REJECTED) {
	      return;
	    }

	    if (this.state === PENDING) {
	      this.state = RESOLVED;
	      this.value = value;
	    }

	    consumeListeners(this.resolveListeners, this.value);
	  };

	  AsyncHandle.prototype._reject = function _reject(reason) {
	    if (this.state === RESOLVED) {
	      return;
	    }

	    if (this.state === PENDING) {
	      this.state = REJECTED;
	      this.reason = reason;
	    }

	    consumeListeners(this.rejectListeners, this.reason);
	  };

	  /**
	   * Cancels asynchronous iteration.
	   *
	   * @public
	   */
	  AsyncHandle.prototype.cancel = function cancel() {
	    if (this.cancelFn) {
	      this.cancelFn();
	      this.cancelFn = null;
	      this._resolve(false);
	    }
	  };

	  /**
	   * Updates the handle with a callback to execute when iteration is completed.
	   *
	   * @public
	   * @param {Function} callback The function to call when the asynchronous
	   *     iteration is completed.
	   * @return {AsyncHandle} A reference to the handle (for chaining).
	   */
	  AsyncHandle.prototype.onComplete = function onComplete(callback) {
	    this.resolveListeners.push(callback);
	    return this;
	  };

	  /**
	   * Updates the handle with a callback to execute if/when any error is
	   * encountered during asynchronous iteration.
	   *
	   * @public
	   * @param {Function} callback The function to call, with any associated error
	   *     object, when an error occurs.
	   * @return {AsyncHandle} A reference to the handle (for chaining).
	   */
	  AsyncHandle.prototype.onError = function onError(callback) {
	    this.rejectListeners.push(callback);
	    return this;
	  };

	  /**
	   * Promise resolution procedure:
	   * http://promises-aplus.github.io/promises-spec/#the_promise_resolution_procedure
	   */
	  function resolve(promise, x) {
	    if (promise === x) {
	      promise._reject(new TypeError('Cannot resolve a promise to itself'));
	      return;
	    }

	    if (x instanceof AsyncHandle) {
	      x.then(
	        function(value) { resolve(promise, value); },
	        function(reason) { promise._reject(reason); }
	      );
	      return;
	    }

	    var then;
	    try {
	      then = (/function|object/).test(typeof x) && x != null && x.then;
	    } catch (e) {
	      promise._reject(e);
	      return;
	    }

	    var thenableState = PENDING;
	    if (typeof then === 'function') {
	      try {
	        then.call(
	          x,
	          function resolvePromise(value) {
	            if (thenableState !== PENDING) {
	              return;
	            }
	            thenableState = RESOLVED;
	            resolve(promise, value);
	          },
	          function rejectPromise(reason) {
	            if (thenableState !== PENDING) {
	              return;
	            }
	            thenableState = REJECTED;
	            promise._reject(reason);
	          }
	        );
	      } catch (e) {
	        if (thenableState !== PENDING) {
	          return;
	        }

	        promise._reject(e);
	      }

	      return;
	    }

	    promise._resolve(x);
	  }

	  function consumeListeners(listeners, value, callback) {
	    callback || (callback = getOnNextCallback());

	    callback(function() {
	      if (listeners.length > 0) {
	        listeners.shift()(value);
	        consumeListeners(listeners, value, callback);
	      }
	    });
	  }

	  function getOnNextCallback(interval) {
	    if (typeof interval === "undefined") {
	      if (typeof setImmediate === "function") {
	        return setImmediate;
	      }
	    }

	    interval = interval || 0;
	    return function(fn) {
	      return setTimeout(fn, interval);
	    };
	  }

	  function getCancelCallback(interval) {
	    if (typeof interval === "undefined") {
	      if (typeof clearImmediate === "function") {
	        return clearImmediate;
	      }
	    }

	    return clearTimeout;
	  }

	  /**
	   * Transform a value, whether the value is retrieved asynchronously or directly.
	   *
	   * @private
	   * @param {Function} fn The function that transforms the value.
	   * @param {*} value The value to be transformed. This can be an {@link AsyncHandle} when the value
	   *     is retrieved asynchronously, otherwise it can be anything.
	   * @returns {*} An {@link AsyncHandle} when `value` is also an {@link AsyncHandle}, otherwise
	   *     whatever `fn` resulted in.
	   */
	  function transform(fn, value) {
	    if (value instanceof AsyncHandle) {
	      return value.then(function() { fn(value); });
	    }
	    return fn(value);
	  }

	  /**
	   * An async version of {@link Sequence#reverse}.
	   */
	  AsyncSequence.prototype.reverse = function reverse() {
	    return this.parent.reverse().async();
	  };

	  /**
	   * A version of {@link Sequence#find} which returns an {@link AsyncHandle}.
	   *
	   * @public
	   * @param {Function} predicate A function to call on (potentially) every element
	   *     in the sequence.
	   * @returns {AsyncHandle} An {@link AsyncHandle} (promise) which resolves to
	   *     the found element, once it is detected, or else `undefined`.
	   */
	  AsyncSequence.prototype.find = function find(predicate) {
	    var found;

	    var handle = this.each(function(e, i) {
	      if (predicate(e, i)) {
	        found = e;
	        return false;
	      }
	    });

	    return handle.then(function() { return found; });
	  };

	  /**
	   * A version of {@link Sequence#indexOf} which returns an {@link AsyncHandle}.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {AsyncHandle} An {@link AsyncHandle} (promise) which resolves to
	   *     the found index, once it is detected, or -1.
	   */
	  AsyncSequence.prototype.indexOf = function indexOf(value) {
	    var foundIndex = -1;

	    var handle = this.each(function(e, i) {
	      if (e === value) {
	        foundIndex = i;
	        return false;
	      }
	    });

	    return handle.then(function() {
	      return foundIndex;
	    });
	  };

	  /**
	   * A version of {@link Sequence#contains} which returns an {@link AsyncHandle}.
	   *
	   * @public
	   * @param {*} value The element to search for in the sequence.
	   * @returns {AsyncHandle} An {@link AsyncHandle} (promise) which resolves to
	   *     either `true` or `false` to indicate whether the element was found.
	   */
	  AsyncSequence.prototype.contains = function contains(value) {
	    var found = false;

	    var handle = this.each(function(e) {
	      if (e === value) {
	        found = true;
	        return false;
	      }
	    });

	    return handle.then(function() {
	      return found;
	    });
	  };

	  /**
	   * Just return the same sequence for `AsyncSequence#async` (I see no harm in this).
	   */
	  AsyncSequence.prototype.async = function async() {
	    return this;
	  };

	  /**
	   * See {@link ObjectLikeSequence#watch} for docs.
	   */
	  ObjectWrapper.prototype.watch = function watch(propertyNames) {
	    return new WatchedPropertySequence(this.source, propertyNames);
	  };

	  function WatchedPropertySequence(object, propertyNames) {
	    this.listeners = [];

	    if (!propertyNames) {
	      propertyNames = Lazy(object).keys().toArray();
	    } else if (!(propertyNames instanceof Array)) {
	      propertyNames = [propertyNames];
	    }

	    var listeners = this.listeners,
	        index     = 0;

	    Lazy(propertyNames).each(function(propertyName) {
	      var propertyValue = object[propertyName];

	      Object.defineProperty(object, propertyName, {
	        get: function() {
	          return propertyValue;
	        },

	        set: function(value) {
	          for (var i = listeners.length - 1; i >= 0; --i) {
	            if (listeners[i]({ property: propertyName, value: value }, index) === false) {
	              listeners.splice(i, 1);
	            }
	          }
	          propertyValue = value;
	          ++index;
	        }
	      });
	    });
	  }

	  WatchedPropertySequence.prototype = new AsyncSequence();

	  WatchedPropertySequence.prototype.each = function each(fn) {
	    this.listeners.push(fn);
	  };

	  /**
	   * A StreamLikeSequence comprises a sequence of 'chunks' of data, which are
	   * typically multiline strings.
	   *
	   * @constructor
	   */
	  function StreamLikeSequence() {}

	  StreamLikeSequence.prototype = new AsyncSequence();

	  StreamLikeSequence.prototype.isAsync = function isAsync() {
	    return true;
	  };

	  StreamLikeSequence.prototype.split = function split(delimiter) {
	    return new SplitStreamSequence(this, delimiter);
	  };

	  /**
	   * @constructor
	   */
	  function SplitStreamSequence(parent, delimiter) {
	    this.parent    = parent;
	    this.delimiter = delimiter;
	    this.each      = this.getEachForDelimiter(delimiter);
	  }

	  SplitStreamSequence.prototype = new Sequence();

	  SplitStreamSequence.prototype.getEachForDelimiter = function getEachForDelimiter(delimiter) {
	    if (delimiter instanceof RegExp) {
	      return this.regexEach;
	    }

	    return this.stringEach;
	  };

	  SplitStreamSequence.prototype.regexEach = function each(fn) {
	    var delimiter = cloneRegex(this.delimiter),
	        buffer = '',
	        start = 0, end,
	        index = 0;

	    var handle = this.parent.each(function(chunk) {
	      buffer += chunk;

	      var match;
	      while (match = delimiter.exec(buffer)) {
	        end = match.index;
	        if (fn(buffer.substring(start, end), index++) === false) {
	          return false;
	        }
	        start = end + match[0].length;
	      }

	      buffer = buffer.substring(start);
	      start = 0;
	    });

	    handle.onComplete(function() {
	      if (buffer.length > 0) {
	        fn(buffer, index++);
	      }
	    });

	    return handle;
	  };

	  SplitStreamSequence.prototype.stringEach = function each(fn) {
	    var delimiter  = this.delimiter,
	        pieceIndex = 0,
	        buffer = '',
	        bufferIndex = 0;

	    var handle = this.parent.each(function(chunk) {
	      buffer += chunk;
	      var delimiterIndex;
	      while ((delimiterIndex = buffer.indexOf(delimiter)) >= 0) {
	        var piece = buffer.substr(0,delimiterIndex);
	        buffer = buffer.substr(delimiterIndex+delimiter.length);
	        if (fn(piece,pieceIndex++) === false) {
	          return false;
	        }
	      }
	      return true;
	    });

	    handle.onComplete(function() {
	      fn(buffer, pieceIndex++);
	    });

	    return handle;
	  };

	  StreamLikeSequence.prototype.lines = function lines() {
	    return this.split("\n");
	  };

	  StreamLikeSequence.prototype.match = function match(pattern) {
	    return new MatchedStreamSequence(this, pattern);
	  };

	  /**
	   * @constructor
	   */
	  function MatchedStreamSequence(parent, pattern) {
	    this.parent  = parent;
	    this.pattern = cloneRegex(pattern);
	  }

	  MatchedStreamSequence.prototype = new AsyncSequence();

	  MatchedStreamSequence.prototype.each = function each(fn) {
	    var pattern = this.pattern,
	        done      = false,
	        i         = 0;

	    return this.parent.each(function(chunk) {
	      Lazy(chunk).match(pattern).each(function(match) {
	        if (fn(match, i++) === false) {
	          done = true;
	          return false;
	        }
	      });

	      return !done;
	    });
	  };

	  /**
	   * Defines a wrapper for custom {@link StreamLikeSequence}s. This is useful
	   * if you want a way to handle a stream of events as a sequence, but you can't
	   * use Lazy's existing interface (i.e., you're wrapping an object from a
	   * library with its own custom events).
	   *
	   * This method defines a *factory*: that is, it produces a function that can
	   * be used to wrap objects and return a {@link Sequence}. Hopefully the
	   * example will make this clear.
	   *
	   * @public
	   * @param {Function} initializer An initialization function called on objects
	   *     created by this factory. `this` will be bound to the created object,
	   *     which is an instance of {@link StreamLikeSequence}. Use `emit` to
	   *     generate data for the sequence.
	   * @returns {Function} A function that creates a new {@link StreamLikeSequence},
	   *     initializes it using the specified function, and returns it.
	   *
	   * @example
	   * var factory = Lazy.createWrapper(function(eventSource) {
	   *   var sequence = this;
	   *
	   *   eventSource.handleEvent(function(data) {
	   *     sequence.emit(data);
	   *   });
	   * });
	   *
	   * var eventEmitter = {
	   *   triggerEvent: function(data) {
	   *     eventEmitter.eventHandler(data);
	   *   },
	   *   handleEvent: function(handler) {
	   *     eventEmitter.eventHandler = handler;
	   *   },
	   *   eventHandler: function() {}
	   * };
	   *
	   * var events = [];
	   *
	   * factory(eventEmitter).each(function(e) {
	   *   events.push(e);
	   * });
	   *
	   * eventEmitter.triggerEvent('foo');
	   * eventEmitter.triggerEvent('bar');
	   *
	   * events // => ['foo', 'bar']
	   */
	  Lazy.createWrapper = function createWrapper(initializer) {
	    var ctor = function() {
	      this.listeners = [];
	    };

	    ctor.prototype = new StreamLikeSequence();

	    ctor.prototype.each = function(listener) {
	      this.listeners.push(listener);
	    };

	    ctor.prototype.emit = function(data) {
	      var listeners = this.listeners;

	      for (var len = listeners.length, i = len - 1; i >= 0; --i) {
	        if (listeners[i](data) === false) {
	          listeners.splice(i, 1);
	        }
	      }
	    };

	    return function() {
	      var sequence = new ctor();
	      initializer.apply(sequence, arguments);
	      return sequence;
	    };
	  };

	  /**
	   * Creates a {@link GeneratedSequence} using the specified generator function
	   * and (optionally) length.
	   *
	   * @public
	   * @param {function(number):*} generatorFn The function used to generate the
	   *     sequence. This function accepts an index as a parameter and should return
	   *     a value for that index in the resulting sequence.
	   * @param {number=} length The length of the sequence, for sequences with a
	   *     definite length.
	   * @returns {GeneratedSequence} The generated sequence.
	   *
	   * @examples
	   * var randomNumbers = Lazy.generate(Math.random);
	   * var countingNumbers = Lazy.generate(function(i) { return i + 1; }, 5);
	   *
	   * randomNumbers          // instanceof Lazy.GeneratedSequence
	   * randomNumbers.length() // => undefined
	   * countingNumbers          // sequence: [1, 2, 3, 4, 5]
	   * countingNumbers.length() // => 5
	   */
	  Lazy.generate = function generate(generatorFn, length) {
	    return new GeneratedSequence(generatorFn, length);
	  };

	  /**
	   * Creates a sequence from a given starting value, up to a specified stopping
	   * value, incrementing by a given step. Invalid values for any of these
	   * arguments (e.g., a step of 0) result in an empty sequence.
	   *
	   * @public
	   * @returns {GeneratedSequence} The sequence defined by the given ranges.
	   *
	   * @examples
	   * Lazy.range(3)         // sequence: [0, 1, 2]
	   * Lazy.range(1, 4)      // sequence: [1, 2, 3]
	   * Lazy.range(2, 10, 2)  // sequence: [2, 4, 6, 8]
	   * Lazy.range(5, 1, 2)   // sequence: []
	   * Lazy.range(5, 15, -2) // sequence: []
	   * Lazy.range(3, 10, 3)  // sequence: [3, 6, 9]
	   * Lazy.range(5, 2)      // sequence: [5, 4, 3]
	   * Lazy.range(7, 2, -2)  // sequence: [7, 5, 3]
	   * Lazy.range(3, 5, 0)   // sequence: []
	   */
	  Lazy.range = function range() {
	    var start = arguments.length > 1 ? arguments[0] : 0,
	        stop  = arguments.length > 1 ? arguments[1] : arguments[0],
	        step  = arguments.length > 2 && arguments[2];

	    if (step === false) {
	      step = stop > start ? 1 : -1;
	    }

	    if (step === 0) {
	      return Lazy([]);
	    }

	    return Lazy.generate(function(i) { return start + (step * i); })
	      .take(Math.ceil((stop - start) / step));
	  };

	  /**
	   * Creates a sequence consisting of the given value repeated a specified number
	   * of times.
	   *
	   * @public
	   * @param {*} value The value to repeat.
	   * @param {number=} count The number of times the value should be repeated in
	   *     the sequence. If this argument is omitted, the value will repeat forever.
	   * @returns {GeneratedSequence} The sequence containing the repeated value.
	   *
	   * @examples
	   * Lazy.repeat("hi", 3)          // sequence: ["hi", "hi", "hi"]
	   * Lazy.repeat("young")          // instanceof Lazy.GeneratedSequence
	   * Lazy.repeat("young").length() // => undefined
	   * Lazy.repeat("young").take(3)  // sequence: ["young", "young", "young"]
	   */
	  Lazy.repeat = function repeat(value, count) {
	    return Lazy.generate(function() { return value; }, count);
	  };

	  Lazy.Sequence           = Sequence;
	  Lazy.ArrayLikeSequence  = ArrayLikeSequence;
	  Lazy.ObjectLikeSequence = ObjectLikeSequence;
	  Lazy.StringLikeSequence = StringLikeSequence;
	  Lazy.StreamLikeSequence = StreamLikeSequence;
	  Lazy.GeneratedSequence  = GeneratedSequence;
	  Lazy.AsyncSequence      = AsyncSequence;
	  Lazy.AsyncHandle        = AsyncHandle;

	  /*** Useful utility methods ***/

	  /**
	   * Creates a shallow copy of an array or object.
	   *
	   * @examples
	   * var array  = [1, 2, 3], clonedArray,
	   *     object = { foo: 1, bar: 2 }, clonedObject;
	   *
	   * clonedArray = Lazy.clone(array); // => [1, 2, 3]
	   * clonedArray.push(4); // clonedArray == [1, 2, 3, 4]
	   * array; // => [1, 2, 3]
	   *
	   * clonedObject = Lazy.clone(object); // => { foo: 1, bar: 2 }
	   * clonedObject.baz = 3; // clonedObject == { foo: 1, bar: 2, baz: 3 }
	   * object; // => { foo: 1, bar: 2 }
	   */
	  Lazy.clone = function clone(target) {
	    return Lazy(target).value();
	  };

	  /**
	   * Marks a method as deprecated, so calling it will issue a console warning.
	   */
	  Lazy.deprecate = function deprecate(message, fn) {
	    return function() {
	      console.warn(message);
	      return fn.apply(this, arguments);
	    };
	  };

	  var arrayPop   = Array.prototype.pop,
	      arraySlice = Array.prototype.slice;

	  /**
	   * Creates a callback... you know, Lo-Dash style.
	   *
	   * - for functions, just returns the function
	   * - for strings, returns a pluck-style callback
	   * - for objects, returns a where-style callback
	   *
	   * @private
	   * @param {Function|string|Object} callback A function, string, or object to
	   *     convert to a callback.
	   * @param {*} defaultReturn If the callback is undefined, a default return
	   *     value to use for the function.
	   * @returns {Function} The callback function.
	   *
	   * @examples
	   * createCallback(function() {})                  // instanceof Function
	   * createCallback('foo')                          // instanceof Function
	   * createCallback('foo')({ foo: 'bar'})           // => 'bar'
	   * createCallback({ foo: 'bar' })({ foo: 'bar' }) // => true
	   * createCallback({ foo: 'bar' })({ foo: 'baz' }) // => false
	   */
	  function createCallback(callback, defaultValue) {
	    switch (typeof callback) {
	      case "function":
	        return callback;

	      case "string":
	        return function(e) {
	          return e[callback];
	        };

	      case "object":
	        return function(e) {
	          return Lazy(callback).all(function(value, key) {
	            return e[key] === value;
	          });
	        };

	      case "undefined":
	        return defaultValue ?
	          function() { return defaultValue; } :
	          Lazy.identity;

	      default:
	        throw new Error("Don't know how to make a callback from a " + typeof callback + "!");
	    }
	  }

	  /**
	   * Takes a function that returns a value for one argument and produces a
	   * function that compares two arguments.
	   *
	   * @private
	   * @param {Function|string|Object} callback A function, string, or object to
	   *     convert to a callback using `createCallback`.
	   * @returns {Function} A function that accepts two values and returns 1 if
	   *     the first is greater, -1 if the second is greater, or 0 if they are
	   *     equivalent.
	   *
	   * @examples
	   * createComparator('a')({ a: 1 }, { a: 2 });       // => -1
	   * createComparator('a')({ a: 6 }, { a: 2 });       // => 1
	   * createComparator('a')({ a: 1 }, { a: 1 });       // => 0
	   * createComparator()(3, 5);                        // => -1
	   * createComparator()(7, 5);                        // => 1
	   * createComparator()(3, 3);                        // => 0
	   */
	  function createComparator(callback, descending) {
	    if (!callback) { return compare; }

	    callback = createCallback(callback);

	    return function(x, y) {
	      return compare(callback(x), callback(y));
	    };
	  }

	  /**
	   * Takes a function and returns a function with the same logic but the
	   * arguments reversed. Only applies to functions w/ arity=2 as this is private
	   * and I can do what I want.
	   *
	   * @private
	   * @param {Function} fn The function to "reverse"
	   * @returns {Function} The "reversed" function
	   *
	   * @examples
	   * reverseArguments(function(x, y) { return x + y; })('a', 'b'); // => 'ba'
	   */
	  function reverseArguments(fn) {
	    return function(x, y) { return fn(y, x); };
	  }

	  /**
	   * Creates a Set containing the specified values.
	   *
	   * @param {...Array} values One or more array(s) of values used to populate the
	   *     set.
	   * @returns {Set} A new set containing the values passed in.
	   */
	  function createSet(values) {
	    var set = new Set();
	    Lazy(values || []).flatten().each(function(e) {
	      set.add(e);
	    });
	    return set;
	  }

	  /**
	   * Compares two elements for sorting purposes.
	   *
	   * @private
	   * @param {*} x The left element to compare.
	   * @param {*} y The right element to compare.
	   * @returns {number} 1 if x > y, -1 if x < y, or 0 if x and y are equal.
	   *
	   * @examples
	   * compare(1, 2)     // => -1
	   * compare(1, 1)     // => 0
	   * compare(2, 1)     // => 1
	   * compare('a', 'b') // => -1
	   */
	  function compare(x, y) {
	    if (x === y) {
	      return 0;
	    }

	    return x > y ? 1 : -1;
	  }

	  /**
	   * Iterates over every element in an array.
	   *
	   * @param {Array} array The array.
	   * @param {Function} fn The function to call on every element, which can return
	   *     false to stop the iteration early.
	   * @returns {boolean} True if every element in the entire sequence was iterated,
	   *     otherwise false.
	   */
	  function forEach(array, fn) {
	    var i = -1,
	        len = array.length;

	    while (++i < len) {
	      if (fn(array[i], i) === false) {
	        return false;
	      }
	    }

	    return true;
	  }

	  function getFirst(sequence) {
	    var result;
	    sequence.each(function(e) {
	      result = e;
	      return false;
	    });
	    return result;
	  }

	  /**
	   * Checks if an element exists in an array.
	   *
	   * @private
	   * @param {Array} array
	   * @param {*} element
	   * @returns {boolean} Whether or not the element exists in the array.
	   *
	   * @examples
	   * arrayContains([1, 2], 2)              // => true
	   * arrayContains([1, 2], 3)              // => false
	   * arrayContains([undefined], undefined) // => true
	   * arrayContains([NaN], NaN)             // => true
	   */
	  function arrayContains(array, element) {
	    var i = -1,
	        length = array.length;

	    // Special handling for NaN
	    if (element !== element) {
	      while (++i < length) {
	        if (array[i] !== array[i]) {
	          return true;
	        }
	      }
	      return false;
	    }

	    while (++i < length) {
	      if (array[i] === element) {
	        return true;
	      }
	    }
	    return false;
	  }

	  /**
	   * Checks if an element exists in an array before a given index.
	   *
	   * @private
	   * @param {Array} array
	   * @param {*} element
	   * @param {number} index
	   * @param {Function} keyFn
	   * @returns {boolean}
	   *
	   * @examples
	   * arrayContainsBefore([1, 2, 3], 3, 2) // => false
	   * arrayContainsBefore([1, 2, 3], 3, 3) // => true
	   */
	  function arrayContainsBefore(array, element, index, keyFn) {
	    var i = -1;

	    if (keyFn) {
	      keyFn = createCallback(keyFn);
	      while (++i < index) {
	        if (keyFn(array[i]) === keyFn(element)) {
	          return true;
	        }
	      }

	    } else {
	      while (++i < index) {
	        if (array[i] === element) {
	          return true;
	        }
	      }
	    }

	    return false;
	  }

	  /**
	   * Swaps the elements at two specified positions of an array.
	   *
	   * @private
	   * @param {Array} array
	   * @param {number} i
	   * @param {number} j
	   *
	   * @examples
	   * var array = [1, 2, 3, 4, 5];
	   *
	   * swap(array, 2, 3) // array == [1, 2, 4, 3, 5]
	   */
	  function swap(array, i, j) {
	    var temp = array[i];
	    array[i] = array[j];
	    array[j] = temp;
	  }

	  /**
	   * "Clones" a regular expression (but makes it always global).
	   *
	   * @private
	   * @param {RegExp|string} pattern
	   * @returns {RegExp}
	   */
	  function cloneRegex(pattern) {
	    return eval("" + pattern + (!pattern.global ? "g" : ""));
	  };

	  /**
	   * A collection of unique elements.
	   *
	   * @private
	   * @constructor
	   *
	   * @examples
	   * var set  = new Set(),
	   *     obj1 = {},
	   *     obj2 = {},
	   *     fn1 = function fn1() {},
	   *     fn2 = function fn2() {};
	   *
	   * set.add('foo')            // => true
	   * set.add('foo')            // => false
	   * set.add(1)                // => true
	   * set.add(1)                // => false
	   * set.add('1')              // => true
	   * set.add('1')              // => false
	   * set.add(obj1)             // => true
	   * set.add(obj1)             // => false
	   * set.add(obj2)             // => true
	   * set.add(fn1)              // => true
	   * set.add(fn2)              // => true
	   * set.add(fn2)              // => false
	   * set.contains('__proto__') // => false
	   * set.add('__proto__')      // => true
	   * set.add('__proto__')      // => false
	   * set.contains('add')       // => false
	   * set.add('add')            // => true
	   * set.add('add')            // => false
	   * set.contains(undefined)   // => false
	   * set.add(undefined)        // => true
	   * set.contains(undefined)   // => true
	   * set.contains('undefined') // => false
	   * set.add('undefined')      // => true
	   * set.contains('undefined') // => true
	   * set.contains(NaN)         // => false
	   * set.add(NaN)              // => true
	   * set.contains(NaN)         // => true
	   * set.contains('NaN')       // => false
	   * set.add('NaN')            // => true
	   * set.contains('NaN')       // => true
	   * set.contains('@foo')      // => false
	   * set.add('@foo')           // => true
	   * set.contains('@foo')      // => true
	   */
	  function Set() {
	    this.table   = {};
	    this.objects = [];
	  }

	  /**
	   * Attempts to add a unique value to the set.
	   *
	   * @param {*} value The value to add.
	   * @returns {boolean} True if the value was added to the set (meaning an equal
	   *     value was not already present), or else false.
	   */
	  Set.prototype.add = function add(value) {
	    var table = this.table,
	        type  = typeof value,

	        // only applies for strings
	        firstChar,

	        // only applies for objects
	        objects;

	    switch (type) {
	      case "number":
	      case "boolean":
	      case "undefined":
	        if (!table[value]) {
	          table[value] = true;
	          return true;
	        }
	        return false;

	      case "string":
	        // Essentially, escape the first character if it could possibly collide
	        // with a number, boolean, or undefined (or a string that happens to start
	        // with the escape character!), OR if it could override a special property
	        // such as '__proto__' or 'constructor'.
	        switch (value.charAt(0)) {
	          case "_": // e.g., __proto__
	          case "f": // for 'false'
	          case "t": // for 'true'
	          case "c": // for 'constructor'
	          case "u": // for 'undefined'
	          case "@": // escaped
	          case "0":
	          case "1":
	          case "2":
	          case "3":
	          case "4":
	          case "5":
	          case "6":
	          case "7":
	          case "8":
	          case "9":
	          case "N": // for NaN
	            value = "@" + value;
	        }
	        if (!table[value]) {
	          table[value] = true;
	          return true;
	        }
	        return false;

	      default:
	        // For objects and functions, we can't really do anything other than store
	        // them in an array and do a linear search for reference equality.
	        objects = this.objects;
	        if (!arrayContains(objects, value)) {
	          objects.push(value);
	          return true;
	        }
	        return false;
	    }
	  };

	  /**
	   * Checks whether the set contains a value.
	   *
	   * @param {*} value The value to check for.
	   * @returns {boolean} True if the set contains the value, or else false.
	   */
	  Set.prototype.contains = function contains(value) {
	    var type = typeof value,

	        // only applies for strings
	        firstChar;

	    switch (type) {
	      case "number":
	      case "boolean":
	      case "undefined":
	        return !!this.table[value];

	      case "string":
	        // Essentially, escape the first character if it could possibly collide
	        // with a number, boolean, or undefined (or a string that happens to start
	        // with the escape character!), OR if it could override a special property
	        // such as '__proto__' or 'constructor'.
	        switch (value.charAt(0)) {
	          case "_": // e.g., __proto__
	          case "f": // for 'false'
	          case "t": // for 'true'
	          case "c": // for 'constructor'
	          case "u": // for 'undefined'
	          case "@": // escaped
	          case "0":
	          case "1":
	          case "2":
	          case "3":
	          case "4":
	          case "5":
	          case "6":
	          case "7":
	          case "8":
	          case "9":
	          case "N": // for NaN
	            value = "@" + value;
	        }
	        return !!this.table[value];

	      default:
	        // For objects and functions, we can't really do anything other than store
	        // them in an array and do a linear search for reference equality.
	        return arrayContains(this.objects, value);
	    }
	  };

	  /**
	   * A "rolling" queue, with a fixed capacity. As items are added to the head,
	   * excess items are dropped from the tail.
	   *
	   * @private
	   * @constructor
	   *
	   * @examples
	   * var queue = new Queue(3);
	   *
	   * queue.add(1).toArray()        // => [1]
	   * queue.add(2).toArray()        // => [1, 2]
	   * queue.add(3).toArray()        // => [1, 2, 3]
	   * queue.add(4).toArray()        // => [2, 3, 4]
	   * queue.add(5).add(6).toArray() // => [4, 5, 6]
	   * queue.add(7).add(8).toArray() // => [6, 7, 8]
	   *
	   * // also want to check corner cases
	   * new Queue(1).add('foo').add('bar').toArray() // => ['bar']
	   * new Queue(0).add('foo').toArray()            // => []
	   * new Queue(-1)                                // throws
	   *
	   * @benchmarks
	   * function populateQueue(count, capacity) {
	   *   var q = new Queue(capacity);
	   *   for (var i = 0; i < count; ++i) {
	   *     q.add(i);
	   *   }
	   * }
	   *
	   * function populateArray(count, capacity) {
	   *   var arr = [];
	   *   for (var i = 0; i < count; ++i) {
	   *     if (arr.length === capacity) { arr.shift(); }
	   *     arr.push(i);
	   *   }
	   * }
	   *
	   * populateQueue(100, 10); // populating a Queue
	   * populateArray(100, 10); // populating an Array
	   */
	  function Queue(capacity) {
	    this.contents = new Array(capacity);
	    this.start    = 0;
	    this.count    = 0;
	  }

	  /**
	   * Adds an item to the queue, and returns the queue.
	   */
	  Queue.prototype.add = function add(element) {
	    var contents = this.contents,
	        capacity = contents.length,
	        start    = this.start;

	    if (this.count === capacity) {
	      contents[start] = element;
	      this.start = (start + 1) % capacity;

	    } else {
	      contents[this.count++] = element;
	    }

	    return this;
	  };

	  /**
	   * Returns an array containing snapshot of the queue's contents.
	   */
	  Queue.prototype.toArray = function toArray() {
	    var contents = this.contents,
	        start    = this.start,
	        count    = this.count;

	    var snapshot = contents.slice(start, start + count);
	    if (snapshot.length < count) {
	      snapshot = snapshot.concat(contents.slice(0, count - snapshot.length));
	    }

	    return snapshot;
	  };

	  /**
	   * Shared base method for defining new sequence types.
	   */
	  function defineSequenceType(base, name, overrides) {
	    /** @constructor */
	    var ctor = function ctor() {};

	    // Make this type inherit from the specified base.
	    ctor.prototype = new base();

	    // Attach overrides to the new sequence type's prototype.
	    for (var override in overrides) {
	      ctor.prototype[override] = overrides[override];
	    }

	    // Define a factory method that sets the new sequence's parent to the caller
	    // and (optionally) applies any additional initialization logic.
	    // Expose this as a chainable method so that we can do:
	    // Lazy(...).map(...).filter(...).blah(...);
	    var factory = function factory() {
	      var sequence = new ctor();

	      // Every sequence needs a reference to its parent in order to work.
	      sequence.parent = this;

	      // If a custom init function was supplied, call it now.
	      if (sequence.init) {
	        sequence.init.apply(sequence, arguments);
	      }

	      return sequence;
	    };

	    var methodNames = typeof name === 'string' ? [name] : name;
	    for (var i = 0; i < methodNames.length; ++i) {
	      base.prototype[methodNames[i]] = factory;
	    }

	    return ctor;
	  }

	  return Lazy;
	});

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(7).setImmediate, __webpack_require__(7).clearImmediate))

/***/ },
/* 118 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(module, global) {var __WEBPACK_AMD_DEFINE_RESULT__;/**
	 * @license
	 * lodash <https://lodash.com/>
	 * Copyright jQuery Foundation and other contributors <https://jquery.org/>
	 * Released under MIT license <https://lodash.com/license>
	 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
	 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
	 */
	;(function() {

	  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
	  var undefined;

	  /** Used as the semantic version number. */
	  var VERSION = '4.12.0';

	  /** Used as the size to enable large array optimizations. */
	  var LARGE_ARRAY_SIZE = 200;

	  /** Used as the `TypeError` message for "Functions" methods. */
	  var FUNC_ERROR_TEXT = 'Expected a function';

	  /** Used to stand-in for `undefined` hash values. */
	  var HASH_UNDEFINED = '__lodash_hash_undefined__';

	  /** Used as the internal argument placeholder. */
	  var PLACEHOLDER = '__lodash_placeholder__';

	  /** Used to compose bitmasks for 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,
	      FLIP_FLAG = 512;

	  /** Used to compose bitmasks for comparison styles. */
	  var UNORDERED_COMPARE_FLAG = 1,
	      PARTIAL_COMPARE_FLAG = 2;

	  /** Used as default options for `_.truncate`. */
	  var DEFAULT_TRUNC_LENGTH = 30,
	      DEFAULT_TRUNC_OMISSION = '...';

	  /** Used to detect hot functions by number of calls within a span of milliseconds. */
	  var HOT_COUNT = 150,
	      HOT_SPAN = 16;

	  /** Used to indicate the type of lazy iteratees. */
	  var LAZY_FILTER_FLAG = 1,
	      LAZY_MAP_FLAG = 2,
	      LAZY_WHILE_FLAG = 3;

	  /** Used as references for various `Number` constants. */
	  var INFINITY = 1 / 0,
	      MAX_SAFE_INTEGER = 9007199254740991,
	      MAX_INTEGER = 1.7976931348623157e+308,
	      NAN = 0 / 0;

	  /** Used as references for the maximum length and index of an array. */
	  var MAX_ARRAY_LENGTH = 4294967295,
	      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
	      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;

	  /** `Object#toString` result references. */
	  var argsTag = '[object Arguments]',
	      arrayTag = '[object Array]',
	      boolTag = '[object Boolean]',
	      dateTag = '[object Date]',
	      errorTag = '[object Error]',
	      funcTag = '[object Function]',
	      genTag = '[object GeneratorFunction]',
	      mapTag = '[object Map]',
	      numberTag = '[object Number]',
	      objectTag = '[object Object]',
	      promiseTag = '[object Promise]',
	      regexpTag = '[object RegExp]',
	      setTag = '[object Set]',
	      stringTag = '[object String]',
	      symbolTag = '[object Symbol]',
	      weakMapTag = '[object WeakMap]',
	      weakSetTag = '[object WeakSet]';

	  var arrayBufferTag = '[object ArrayBuffer]',
	      dataViewTag = '[object DataView]',
	      float32Tag = '[object Float32Array]',
	      float64Tag = '[object Float64Array]',
	      int8Tag = '[object Int8Array]',
	      int16Tag = '[object Int16Array]',
	      int32Tag = '[object Int32Array]',
	      uint8Tag = '[object Uint8Array]',
	      uint8ClampedTag = '[object Uint8ClampedArray]',
	      uint16Tag = '[object Uint16Array]',
	      uint32Tag = '[object Uint32Array]';

	  /** Used to match empty string literals in compiled template source. */
	  var reEmptyStringLeading = /\b__p \+= '';/g,
	      reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
	      reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;

	  /** Used to match HTML entities and HTML characters. */
	  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39|#96);/g,
	      reUnescapedHtml = /[&<>"'`]/g,
	      reHasEscapedHtml = RegExp(reEscapedHtml.source),
	      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);

	  /** Used to match template delimiters. */
	  var reEscape = /<%-([\s\S]+?)%>/g,
	      reEvaluate = /<%([\s\S]+?)%>/g,
	      reInterpolate = /<%=([\s\S]+?)%>/g;

	  /** Used to match property names within property paths. */
	  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
	      reIsPlainProp = /^\w*$/,
	      rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]/g;

	  /**
	   * Used to match `RegExp`
	   * [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns).
	   */
	  var reRegExpChar = /[\\^$.*+?()[\]{}|]/g,
	      reHasRegExpChar = RegExp(reRegExpChar.source);

	  /** Used to match leading and trailing whitespace. */
	  var reTrim = /^\s+|\s+$/g,
	      reTrimStart = /^\s+/,
	      reTrimEnd = /\s+$/;

	  /** Used to match non-compound words composed of alphanumeric characters. */
	  var reBasicWord = /[a-zA-Z0-9]+/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 = /^0x/i;

	  /** Used to detect bad signed hexadecimal string values. */
	  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;

	  /** Used to detect binary string values. */
	  var reIsBinary = /^0b[01]+$/i;

	  /** Used to detect host constructors (Safari). */
	  var reIsHostCtor = /^\[object .+?Constructor\]$/;

	  /** Used to detect octal string values. */
	  var reIsOctal = /^0o[0-7]+$/i;

	  /** Used to detect unsigned integer values. */
	  var reIsUint = /^(?:0|[1-9]\d*)$/;

	  /** Used to match latin-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 compose unicode character classes. */
	  var rsAstralRange = '\\ud800-\\udfff',
	      rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23',
	      rsComboSymbolsRange = '\\u20d0-\\u20f0',
	      rsDingbatRange = '\\u2700-\\u27bf',
	      rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff',
	      rsMathOpRange = '\\xac\\xb1\\xd7\\xf7',
	      rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf',
	      rsPunctuationRange = '\\u2000-\\u206f',
	      rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000',
	      rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde',
	      rsVarRange = '\\ufe0e\\ufe0f',
	      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;

	  /** Used to compose unicode capture groups. */
	  var rsApos = "['\u2019]",
	      rsAstral = '[' + rsAstralRange + ']',
	      rsBreak = '[' + rsBreakRange + ']',
	      rsCombo = '[' + rsComboMarksRange + rsComboSymbolsRange + ']',
	      rsDigits = '\\d+',
	      rsDingbat = '[' + rsDingbatRange + ']',
	      rsLower = '[' + rsLowerRange + ']',
	      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',
	      rsFitz = '\\ud83c[\\udffb-\\udfff]',
	      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
	      rsNonAstral = '[^' + rsAstralRange + ']',
	      rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
	      rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
	      rsUpper = '[' + rsUpperRange + ']',
	      rsZWJ = '\\u200d';

	  /** Used to compose unicode regexes. */
	  var rsLowerMisc = '(?:' + rsLower + '|' + rsMisc + ')',
	      rsUpperMisc = '(?:' + rsUpper + '|' + rsMisc + ')',
	      rsOptLowerContr = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
	      rsOptUpperContr = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
	      reOptMod = rsModifier + '?',
	      rsOptVar = '[' + rsVarRange + ']?',
	      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
	      rsSeq = rsOptVar + reOptMod + rsOptJoin,
	      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,
	      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';

	  /** Used to match apostrophes. */
	  var reApos = RegExp(rsApos, 'g');

	  /**
	   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and
	   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).
	   */
	  var reComboMark = RegExp(rsCombo, 'g');

	  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
	  var reComplexSymbol = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');

	  /** Used to match complex or compound words. */
	  var reComplexWord = RegExp([
	    rsUpper + '?' + rsLower + '+' + rsOptLowerContr + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
	    rsUpperMisc + '+' + rsOptUpperContr + '(?=' + [rsBreak, rsUpper + rsLowerMisc, '$'].join('|') + ')',
	    rsUpper + '?' + rsLowerMisc + '+' + rsOptLowerContr,
	    rsUpper + '+' + rsOptUpperContr,
	    rsDigits,
	    rsEmoji
	  ].join('|'), 'g');

	  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
	  var reHasComplexSymbol = RegExp('[' + rsZWJ + rsAstralRange  + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']');

	  /** Used to detect strings that need a more robust regexp to match words. */
	  var reHasComplexWord = /[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;

	  /** Used to assign default `context` object properties. */
	  var contextProps = [
	    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',
	    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',
	    'Promise', 'Reflect', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError',
	    'Uint8Array', 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',
	    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'
	  ];

	  /** Used to make template sourceURLs easier to identify. */
	  var templateCounter = -1;

	  /** Used to identify `toStringTag` values of typed arrays. */
	  var typedArrayTags = {};
	  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
	  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
	  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
	  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
	  typedArrayTags[uint32Tag] = true;
	  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
	  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
	  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
	  typedArrayTags[errorTag] = typedArrayTags[funcTag] =
	  typedArrayTags[mapTag] = typedArrayTags[numberTag] =
	  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
	  typedArrayTags[setTag] = typedArrayTags[stringTag] =
	  typedArrayTags[weakMapTag] = false;

	  /** Used to identify `toStringTag` values supported by `_.clone`. */
	  var cloneableTags = {};
	  cloneableTags[argsTag] = cloneableTags[arrayTag] =
	  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
	  cloneableTags[boolTag] = cloneableTags[dateTag] =
	  cloneableTags[float32Tag] = cloneableTags[float64Tag] =
	  cloneableTags[int8Tag] = cloneableTags[int16Tag] =
	  cloneableTags[int32Tag] = cloneableTags[mapTag] =
	  cloneableTags[numberTag] = cloneableTags[objectTag] =
	  cloneableTags[regexpTag] = cloneableTags[setTag] =
	  cloneableTags[stringTag] = cloneableTags[symbolTag] =
	  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
	  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
	  cloneableTags[errorTag] = cloneableTags[funcTag] =
	  cloneableTags[weakMapTag] = false;

	  /** Used to map latin-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 string literals. */
	  var stringEscapes = {
	    '\\': '\\',
	    "'": "'",
	    '\n': 'n',
	    '\r': 'r',
	    '\u2028': 'u2028',
	    '\u2029': 'u2029'
	  };

	  /** Built-in method references without a dependency on `root`. */
	  var freeParseFloat = parseFloat,
	      freeParseInt = parseInt;

	  /** Detect free variable `exports`. */
	  var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
	    ? exports
	    : undefined;

	  /** Detect free variable `module`. */
	  var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
	    ? module
	    : undefined;

	  /** Detect the popular CommonJS extension `module.exports`. */
	  var moduleExports = (freeModule && freeModule.exports === freeExports)
	    ? freeExports
	    : undefined;

	  /** Detect free variable `global` from Node.js. */
	  var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);

	  /** Detect free variable `self`. */
	  var freeSelf = checkGlobal(objectTypes[typeof self] && self);

	  /** Detect free variable `window`. */
	  var freeWindow = checkGlobal(objectTypes[typeof window] && window);

	  /** Detect `this` as the global object. */
	  var thisGlobal = checkGlobal(objectTypes[typeof this] && this);

	  /**
	   * 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 !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
	      freeSelf || thisGlobal || Function('return this')();

	  /*--------------------------------------------------------------------------*/

	  /**
	   * Adds the key-value `pair` to `map`.
	   *
	   * @private
	   * @param {Object} map The map to modify.
	   * @param {Array} pair The key-value pair to add.
	   * @returns {Object} Returns `map`.
	   */
	  function addMapEntry(map, pair) {
	    // Don't return `Map#set` because it doesn't return the map instance in IE 11.
	    map.set(pair[0], pair[1]);
	    return map;
	  }

	  /**
	   * Adds `value` to `set`.
	   *
	   * @private
	   * @param {Object} set The set to modify.
	   * @param {*} value The value to add.
	   * @returns {Object} Returns `set`.
	   */
	  function addSetEntry(set, value) {
	    set.add(value);
	    return set;
	  }

	  /**
	   * A faster alternative to `Function#apply`, this function invokes `func`
	   * with the `this` binding of `thisArg` and the arguments of `args`.
	   *
	   * @private
	   * @param {Function} func The function to invoke.
	   * @param {*} thisArg The `this` binding of `func`.
	   * @param {Array} args The arguments to invoke `func` with.
	   * @returns {*} Returns the result of `func`.
	   */
	  function apply(func, thisArg, args) {
	    var length = args.length;
	    switch (length) {
	      case 0: return func.call(thisArg);
	      case 1: return func.call(thisArg, args[0]);
	      case 2: return func.call(thisArg, args[0], args[1]);
	      case 3: return func.call(thisArg, args[0], args[1], args[2]);
	    }
	    return func.apply(thisArg, args);
	  }

	  /**
	   * A specialized version of `baseAggregator` for arrays.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} setter The function to set `accumulator` values.
	   * @param {Function} iteratee The iteratee to transform keys.
	   * @param {Object} accumulator The initial aggregated object.
	   * @returns {Function} Returns `accumulator`.
	   */
	  function arrayAggregator(array, setter, iteratee, accumulator) {
	    var index = -1,
	        length = array.length;

	    while (++index < length) {
	      var value = array[index];
	      setter(accumulator, value, iteratee(value), array);
	    }
	    return accumulator;
	  }

	  /**
	   * A specialized version of `_.forEach` for arrays without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @returns {Array} Returns `array`.
	   */
	  function arrayEach(array, iteratee) {
	    var index = -1,
	        length = array.length;

	    while (++index < length) {
	      if (iteratee(array[index], index, array) === false) {
	        break;
	      }
	    }
	    return array;
	  }

	  /**
	   * A specialized version of `_.forEachRight` for arrays without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @returns {Array} Returns `array`.
	   */
	  function arrayEachRight(array, iteratee) {
	    var length = array.length;

	    while (length--) {
	      if (iteratee(array[length], length, array) === false) {
	        break;
	      }
	    }
	    return array;
	  }

	  /**
	   * A specialized version of `_.every` for arrays without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} predicate The function invoked per iteration.
	   * @returns {boolean} Returns `true` if all elements pass the predicate check,
	   *  else `false`.
	   */
	  function arrayEvery(array, predicate) {
	    var index = -1,
	        length = array.length;

	    while (++index < length) {
	      if (!predicate(array[index], index, array)) {
	        return false;
	      }
	    }
	    return true;
	  }

	  /**
	   * A specialized version of `_.filter` for arrays without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} predicate The function invoked per iteration.
	   * @returns {Array} Returns the new filtered array.
	   */
	  function arrayFilter(array, predicate) {
	    var index = -1,
	        length = array.length,
	        resIndex = 0,
	        result = [];

	    while (++index < length) {
	      var value = array[index];
	      if (predicate(value, index, array)) {
	        result[resIndex++] = value;
	      }
	    }
	    return result;
	  }

	  /**
	   * A specialized version of `_.includes` for arrays without support for
	   * specifying an index to search from.
	   *
	   * @private
	   * @param {Array} array The array to search.
	   * @param {*} target The value to search for.
	   * @returns {boolean} Returns `true` if `target` is found, else `false`.
	   */
	  function arrayIncludes(array, value) {
	    return !!array.length && baseIndexOf(array, value, 0) > -1;
	  }

	  /**
	   * This function is like `arrayIncludes` except that it accepts a comparator.
	   *
	   * @private
	   * @param {Array} array The array to search.
	   * @param {*} target The value to search for.
	   * @param {Function} comparator The comparator invoked per element.
	   * @returns {boolean} Returns `true` if `target` is found, else `false`.
	   */
	  function arrayIncludesWith(array, value, comparator) {
	    var index = -1,
	        length = array.length;

	    while (++index < length) {
	      if (comparator(value, array[index])) {
	        return true;
	      }
	    }
	    return false;
	  }

	  /**
	   * A specialized version of `_.map` for arrays without support for iteratee
	   * shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @returns {Array} Returns the new mapped array.
	   */
	  function arrayMap(array, iteratee) {
	    var index = -1,
	        length = array.length,
	        result = Array(length);

	    while (++index < length) {
	      result[index] = iteratee(array[index], index, array);
	    }
	    return result;
	  }

	  /**
	   * Appends the elements of `values` to `array`.
	   *
	   * @private
	   * @param {Array} array The array to modify.
	   * @param {Array} values The values to append.
	   * @returns {Array} Returns `array`.
	   */
	  function arrayPush(array, values) {
	    var index = -1,
	        length = values.length,
	        offset = array.length;

	    while (++index < length) {
	      array[offset + index] = values[index];
	    }
	    return array;
	  }

	  /**
	   * A specialized version of `_.reduce` for arrays without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @param {*} [accumulator] The initial value.
	   * @param {boolean} [initAccum] Specify using the first element of `array` as
	   *  the initial value.
	   * @returns {*} Returns the accumulated value.
	   */
	  function arrayReduce(array, iteratee, accumulator, initAccum) {
	    var index = -1,
	        length = array.length;

	    if (initAccum && length) {
	      accumulator = array[++index];
	    }
	    while (++index < length) {
	      accumulator = iteratee(accumulator, array[index], index, array);
	    }
	    return accumulator;
	  }

	  /**
	   * A specialized version of `_.reduceRight` for arrays without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @param {*} [accumulator] The initial value.
	   * @param {boolean} [initAccum] Specify using the last element of `array` as
	   *  the initial value.
	   * @returns {*} Returns the accumulated value.
	   */
	  function arrayReduceRight(array, iteratee, accumulator, initAccum) {
	    var length = array.length;
	    if (initAccum && length) {
	      accumulator = array[--length];
	    }
	    while (length--) {
	      accumulator = iteratee(accumulator, array[length], length, array);
	    }
	    return accumulator;
	  }

	  /**
	   * A specialized version of `_.some` for arrays without support for iteratee
	   * shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} predicate The function invoked per iteration.
	   * @returns {boolean} Returns `true` if any element passes the predicate check,
	   *  else `false`.
	   */
	  function arraySome(array, predicate) {
	    var index = -1,
	        length = array.length;

	    while (++index < length) {
	      if (predicate(array[index], index, array)) {
	        return true;
	      }
	    }
	    return false;
	  }

	  /**
	   * The base implementation of methods like `_.find` and `_.findKey`, without
	   * support for iteratee shorthands, which iterates over `collection` using
	   * `eachFunc`.
	   *
	   * @private
	   * @param {Array|Object} 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 `_.findIndex` and `_.findLastIndex` without
	   * support for iteratee shorthands.
	   *
	   * @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 `fromIndex` bounds checks.
	   *
	   * @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;
	  }

	  /**
	   * This function is like `baseIndexOf` except that it accepts a comparator.
	   *
	   * @private
	   * @param {Array} array The array to search.
	   * @param {*} value The value to search for.
	   * @param {number} fromIndex The index to search from.
	   * @param {Function} comparator The comparator invoked per element.
	   * @returns {number} Returns the index of the matched value, else `-1`.
	   */
	  function baseIndexOfWith(array, value, fromIndex, comparator) {
	    var index = fromIndex - 1,
	        length = array.length;

	    while (++index < length) {
	      if (comparator(array[index], value)) {
	        return index;
	      }
	    }
	    return -1;
	  }

	  /**
	   * The base implementation of `_.mean` and `_.meanBy` without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @returns {number} Returns the mean.
	   */
	  function baseMean(array, iteratee) {
	    var length = array ? array.length : 0;
	    return length ? (baseSum(array, iteratee) / length) : NAN;
	  }

	  /**
	   * The base implementation of `_.reduce` and `_.reduceRight`, without support
	   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
	   *
	   * @private
	   * @param {Array|Object} collection The collection to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @param {*} accumulator The initial value.
	   * @param {boolean} initAccum Specify using the first or last element of
	   *  `collection` as the initial value.
	   * @param {Function} eachFunc The function to iterate over `collection`.
	   * @returns {*} Returns the accumulated value.
	   */
	  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
	    eachFunc(collection, function(value, index, collection) {
	      accumulator = initAccum
	        ? (initAccum = false, value)
	        : iteratee(accumulator, value, index, collection);
	    });
	    return accumulator;
	  }

	  /**
	   * The base implementation of `_.sortBy` which uses `comparer` to define the
	   * sort order of `array` and replaces criteria objects with their corresponding
	   * values.
	   *
	   * @private
	   * @param {Array} array The array to sort.
	   * @param {Function} comparer The function to define sort order.
	   * @returns {Array} Returns `array`.
	   */
	  function baseSortBy(array, comparer) {
	    var length = array.length;

	    array.sort(comparer);
	    while (length--) {
	      array[length] = array[length].value;
	    }
	    return array;
	  }

	  /**
	   * The base implementation of `_.sum` and `_.sumBy` without support for
	   * iteratee shorthands.
	   *
	   * @private
	   * @param {Array} array The array to iterate over.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @returns {number} Returns the sum.
	   */
	  function baseSum(array, iteratee) {
	    var result,
	        index = -1,
	        length = array.length;

	    while (++index < length) {
	      var current = iteratee(array[index]);
	      if (current !== undefined) {
	        result = result === undefined ? current : (result + current);
	      }
	    }
	    return result;
	  }

	  /**
	   * The base implementation of `_.times` without support for iteratee shorthands
	   * or max array length checks.
	   *
	   * @private
	   * @param {number} n The number of times to invoke `iteratee`.
	   * @param {Function} iteratee The function invoked per iteration.
	   * @returns {Array} Returns the array of results.
	   */
	  function baseTimes(n, iteratee) {
	    var index = -1,
	        result = Array(n);

	    while (++index < n) {
	      result[index] = iteratee(index);
	    }
	    return result;
	  }

	  /**
	   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
	   * of key-value pairs for `object` corresponding to the property names of `props`.
	   *
	   * @private
	   * @param {Object} object The object to query.
	   * @param {Array} props The property names to get values for.
	   * @returns {Object} Returns the key-value pairs.
	   */
	  function baseToPairs(object, props) {
	    return arrayMap(props, function(key) {
	      return [key, object[key]];
	    });
	  }

	  /**
	   * The base implementation of `_.unary` without support for storing wrapper metadata.
	   *
	   * @private
	   * @param {Function} func The function to cap arguments for.
	   * @returns {Function} Returns the new capped function.
	   */
	  function baseUnary(func) {
	    return function(value) {
	      return func(value);
	    };
	  }

	  /**
	   * The base implementation of `_.values` and `_.valuesIn` which creates an
	   * array of `object` property values corresponding to the property names
	   * of `props`.
	   *
	   * @private
	   * @param {Object} object The object to query.
	   * @param {Array} props The property names to get values for.
	   * @returns {Object} Returns the array of property values.
	   */
	  function baseValues(object, props) {
	    return arrayMap(props, function(key) {
	      return object[key];
	    });
	  }

	  /**
	   * Checks if a cache value for `key` exists.
	   *
	   * @private
	   * @param {Object} cache The cache to query.
	   * @param {string} key The key of the entry to check.
	   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
	   */
	  function cacheHas(cache, key) {
	    return cache.has(key);
	  }

	  /**
	   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol
	   * that is not found in the character symbols.
	   *
	   * @private
	   * @param {Array} strSymbols The string symbols to inspect.
	   * @param {Array} chrSymbols The character symbols to find.
	   * @returns {number} Returns the index of the first unmatched string symbol.
	   */
	  function charsStartIndex(strSymbols, chrSymbols) {
	    var index = -1,
	        length = strSymbols.length;

	    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
	    return index;
	  }

	  /**
	   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol
	   * that is not found in the character symbols.
	   *
	   * @private
	   * @param {Array} strSymbols The string symbols to inspect.
	   * @param {Array} chrSymbols The character symbols to find.
	   * @returns {number} Returns the index of the last unmatched string symbol.
	   */
	  function charsEndIndex(strSymbols, chrSymbols) {
	    var index = strSymbols.length;

	    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
	    return index;
	  }

	  /**
	   * Checks if `value` is a global object.
	   *
	   * @private
	   * @param {*} value The value to check.
	   * @returns {null|Object} Returns `value` if it's a global object, else `null`.
	   */
	  function checkGlobal(value) {
	    return (value && value.Object === Object) ? value : null;
	  }

	  /**
	   * Gets the number of `placeholder` occurrences in `array`.
	   *
	   * @private
	   * @param {Array} array The array to inspect.
	   * @param {*} placeholder The placeholder to search for.
	   * @returns {number} Returns the placeholder count.
	   */
	  function countHolders(array, placeholder) {
	    var length = array.length,
	        result = 0;

	    while (length--) {
	      if (array[length] === placeholder) {
	        result++;
	      }
	    }
	    return result;
	  }

	  /**
	   * Used by `_.deburr` to convert latin-1 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 `_.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 a host object in IE < 9.
	   *
	   * @private
	   * @param {*} value The value to check.
	   * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
	   */
	  function isHostObject(value) {
	    // Many host objects are `Object` objects that can coerce to strings
	    // despite having improperly defined `toString` methods.
	    var result = false;
	    if (value != null && typeof value.toString != 'function') {
	      try {
	        result = !!(value + '');
	      } catch (e) {}
	    }
	    return result;
	  }

	  /**
	   * Converts `iterator` to an array.
	   *
	   * @private
	   * @param {Object} iterator The iterator to convert.
	   * @returns {Array} Returns the converted array.
	   */
	  function iteratorToArray(iterator) {
	    var data,
	        result = [];

	    while (!(data = iterator.next()).done) {
	      result.push(data.value);
	    }
	    return result;
	  }

	  /**
	   * Converts `map` to its key-value pairs.
	   *
	   * @private
	   * @param {Object} map The map to convert.
	   * @returns {Array} Returns the key-value pairs.
	   */
	  function mapToArray(map) {
	    var index = -1,
	        result = Array(map.size);

	    map.forEach(function(value, key) {
	      result[++index] = [key, value];
	    });
	    return result;
	  }

	  /**
	   * Replaces all `placeholder` elements in `array` with an internal placeholder
	   * and returns an array of their indexes.
	   *
	   * @private
	   * @param {Array} array The array to modify.
	   * @param {*} placeholder The placeholder to replace.
	   * @returns {Array} Returns the new array of placeholder indexes.
	   */
	  function replaceHolders(array, placeholder) {
	    var index = -1,
	        length = array.length,
	        resIndex = 0,
	        result = [];

	    while (++index < length) {
	      var value = array[index];
	      if (value === placeholder || value === PLACEHOLDER) {
	        array[index] = PLACEHOLDER;
	        result[resIndex++] = index;
	      }
	    }
	    return result;
	  }

	  /**
	   * Converts `set` to an array of its values.
	   *
	   * @private
	   * @param {Object} set The set to convert.
	   * @returns {Array} Returns the values.
	   */
	  function setToArray(set) {
	    var index = -1,
	        result = Array(set.size);

	    set.forEach(function(value) {
	      result[++index] = value;
	    });
	    return result;
	  }

	  /**
	   * Converts `set` to its value-value pairs.
	   *
	   * @private
	   * @param {Object} set The set to convert.
	   * @returns {Array} Returns the value-value pairs.
	   */
	  function setToPairs(set) {
	    var index = -1,
	        result = Array(set.size);

	    set.forEach(function(value) {
	      result[++index] = [value, value];
	    });
	    return result;
	  }

	  /**
	   * Gets the number of symbols in `string`.
	   *
	   * @private
	   * @param {string} string The string to inspect.
	   * @returns {number} Returns the string size.
	   */
	  function stringSize(string) {
	    if (!(string && reHasComplexSymbol.test(string))) {
	      return string.length;
	    }
	    var result = reComplexSymbol.lastIndex = 0;
	    while (reComplexSymbol.test(string)) {
	      result++;
	    }
	    return result;
	  }

	  /**
	   * Converts `string` to an array.
	   *
	   * @private
	   * @param {string} string The string to convert.
	   * @returns {Array} Returns the converted array.
	   */
	  function stringToArray(string) {
	    return string.match(reComplexSymbol);
	  }

	  /**
	   * 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 `context` object.
	   *
	   * @static
	   * @memberOf _
	   * @since 1.1.0
	   * @category Util
	   * @param {Object} [context=root] The context object.
	   * @returns {Function} Returns a new `lodash` function.
	   * @example
	   *
	   * _.mixin({ 'foo': _.constant('foo') });
	   *
	   * var lodash = _.runInContext();
	   * lodash.mixin({ 'bar': lodash.constant('bar') });
	   *
	   * _.isFunction(_.foo);
	   * // => true
	   * _.isFunction(_.bar);
	   * // => false
	   *
	   * lodash.isFunction(lodash.foo);
	   * // => false
	   * lodash.isFunction(lodash.bar);
	   * // => true
	   *
	   * // Use `context` to mock `Date#getTime` use in `_.now`.
	   * var mock = _.runInContext({
	   *   'Date': function() {
	   *     return { 'getTime': getTimeMock };
	   *   }
	   * });
	   *
	   * // Create a suped-up `defer` in Node.js.
	   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
	   */
	  function runInContext(context) {
	    context = context ? _.defaults({}, context, _.pick(root, contextProps)) : root;

	    /** Built-in constructor references. */
	    var Date = context.Date,
	        Error = context.Error,
	        Math = context.Math,
	        RegExp = context.RegExp,
	        TypeError = context.TypeError;

	    /** Used for built-in method references. */
	    var arrayProto = context.Array.prototype,
	        objectProto = context.Object.prototype,
	        stringProto = context.String.prototype;

	    /** Used to resolve the decompiled source of functions. */
	    var funcToString = context.Function.prototype.toString;

	    /** Used to check objects for own properties. */
	    var hasOwnProperty = objectProto.hasOwnProperty;

	    /** Used to generate unique IDs. */
	    var idCounter = 0;

	    /** Used to infer the `Object` constructor. */
	    var objectCtorString = funcToString.call(Object);

	    /**
	     * Used to resolve the
	     * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
	     * of values.
	     */
	    var objectToString = objectProto.toString;

	    /** Used to restore the original `_` reference in `_.noConflict`. */
	    var oldDash = root._;

	    /** Used to detect if a method is native. */
	    var reIsNative = RegExp('^' +
	      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
	      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
	    );

	    /** Built-in value references. */
	    var Buffer = moduleExports ? context.Buffer : undefined,
	        Reflect = context.Reflect,
	        Symbol = context.Symbol,
	        Uint8Array = context.Uint8Array,
	        clearTimeout = context.clearTimeout,
	        enumerate = Reflect ? Reflect.enumerate : undefined,
	        getOwnPropertySymbols = Object.getOwnPropertySymbols,
	        iteratorSymbol = typeof (iteratorSymbol = Symbol && Symbol.iterator) == 'symbol' ? iteratorSymbol : undefined,
	        objectCreate = Object.create,
	        propertyIsEnumerable = objectProto.propertyIsEnumerable,
	        setTimeout = context.setTimeout,
	        splice = arrayProto.splice;

	    /* Built-in method references for those with the same name as other `lodash` methods. */
	    var nativeCeil = Math.ceil,
	        nativeFloor = Math.floor,
	        nativeGetPrototype = Object.getPrototypeOf,
	        nativeIsFinite = context.isFinite,
	        nativeJoin = arrayProto.join,
	        nativeKeys = Object.keys,
	        nativeMax = Math.max,
	        nativeMin = Math.min,
	        nativeParseInt = context.parseInt,
	        nativeRandom = Math.random,
	        nativeReplace = stringProto.replace,
	        nativeReverse = arrayProto.reverse,
	        nativeSplit = stringProto.split;

	    /* Built-in method references that are verified to be native. */
	    var DataView = getNative(context, 'DataView'),
	        Map = getNative(context, 'Map'),
	        Promise = getNative(context, 'Promise'),
	        Set = getNative(context, 'Set'),
	        WeakMap = getNative(context, 'WeakMap'),
	        nativeCreate = getNative(Object, 'create');

	    /** Used to store function metadata. */
	    var metaMap = WeakMap && new WeakMap;

	    /** Detect if properties shadowing those on `Object.prototype` are non-enumerable. */
	    var nonEnumShadows = !propertyIsEnumerable.call({ 'valueOf': 1 }, 'valueOf');

	    /** Used to lookup unminified function names. */
	    var realNames = {};

	    /** Used to detect maps, sets, and weakmaps. */
	    var dataViewCtorString = toSource(DataView),
	        mapCtorString = toSource(Map),
	        promiseCtorString = toSource(Promise),
	        setCtorString = toSource(Set),
	        weakMapCtorString = toSource(WeakMap);

	    /** Used to convert symbols to primitives and strings. */
	    var symbolProto = Symbol ? Symbol.prototype : undefined,
	        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,
	        symbolToString = symbolProto ? symbolProto.toString : undefined;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates a `lodash` object which wraps `value` to enable implicit method
	     * chain sequences. Methods that operate on and return arrays, collections,
	     * and functions can be chained together. Methods that retrieve a single value
	     * or may return a primitive value will automatically end the chain sequence
	     * and return the unwrapped value. Otherwise, the value must be unwrapped
	     * with `_#value`.
	     *
	     * Explicit chain sequences, which must be unwrapped with `_#value`, may be
	     * enabled using `_.chain`.
	     *
	     * The execution of chained methods is lazy, that is, it's deferred until
	     * `_#value` is implicitly or explicitly called.
	     *
	     * Lazy evaluation allows several methods to support shortcut fusion.
	     * Shortcut fusion is an optimization to merge iteratee calls; this avoids
	     * the creation of intermediate arrays and can greatly reduce the number of
	     * iteratee executions. Sections of a chain sequence qualify for shortcut
	     * fusion if the section is applied to an array of at least `200` elements
	     * and any iteratees accept only one argument. The heuristic for whether a
	     * section qualifies for shortcut fusion is subject to change.
	     *
	     * Chaining is supported in custom builds as long as the `_#value` method is
	     * directly or indirectly included in the build.
	     *
	     * In addition to lodash methods, wrappers have `Array` and `String` methods.
	     *
	     * The wrapper `Array` methods are:
	     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`
	     *
	     * The wrapper `String` methods are:
	     * `replace` and `split`
	     *
	     * The wrapper methods that support shortcut fusion are:
	     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,
	     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,
	     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`
	     *
	     * The chainable wrapper methods are:
	     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,
	     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,
	     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,
	     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,
	     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,
	     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,
	     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,
	     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,
	     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,
	     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,
	     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,
	     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,
	     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,
	     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,
	     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,
	     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,
	     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,
	     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,
	     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,
	     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,
	     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,
	     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,
	     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,
	     * `zipObject`, `zipObjectDeep`, and `zipWith`
	     *
	     * The wrapper methods that are **not** chainable by default are:
	     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,
	     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `deburr`, `divide`, `each`,
	     * `eachRight`, `endsWith`, `eq`, `escape`, `escapeRegExp`, `every`, `find`,
	     * `findIndex`, `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `first`,
	     * `floor`, `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`,
	     * `forOwnRight`, `get`, `gt`, `gte`, `has`, `hasIn`, `head`, `identity`,
	     * `includes`, `indexOf`, `inRange`, `invoke`, `isArguments`, `isArray`,
	     * `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`, `isBoolean`,
	     * `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`, `isEqualWith`,
	     * `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`, `isMap`,
	     * `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`, `isNumber`,
	     * `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`, `isSafeInteger`,
	     * `isSet`, `isString`, `isUndefined`, `isTypedArray`, `isWeakMap`, `isWeakSet`,
	     * `join`, `kebabCase`, `last`, `lastIndexOf`, `lowerCase`, `lowerFirst`,
	     * `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`, `min`, `minBy`, `multiply`,
	     * `noConflict`, `noop`, `now`, `nth`, `pad`, `padEnd`, `padStart`, `parseInt`,
	     * `pop`, `random`, `reduce`, `reduceRight`, `repeat`, `result`, `round`,
	     * `runInContext`, `sample`, `shift`, `size`, `snakeCase`, `some`, `sortedIndex`,
	     * `sortedIndexBy`, `sortedLastIndex`, `sortedLastIndexBy`, `startCase`,
	     * `startsWith`, `subtract`, `sum`, `sumBy`, `template`, `times`, `toFinite`,
	     * `toInteger`, `toJSON`, `toLength`, `toLower`, `toNumber`, `toSafeInteger`,
	     * `toString`, `toUpper`, `trim`, `trimEnd`, `trimStart`, `truncate`, `unescape`,
	     * `uniqueId`, `upperCase`, `upperFirst`, `value`, and `words`
	     *
	     * @name _
	     * @constructor
	     * @category Seq
	     * @param {*} value The value to wrap in a `lodash` instance.
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * function square(n) {
	     *   return n * n;
	     * }
	     *
	     * var wrapped = _([1, 2, 3]);
	     *
	     * // Returns an unwrapped value.
	     * wrapped.reduce(_.add);
	     * // => 6
	     *
	     * // Returns a wrapped value.
	     * var squares = wrapped.map(square);
	     *
	     * _.isArray(squares);
	     * // => false
	     *
	     * _.isArray(squares.value());
	     * // => true
	     */
	    function lodash(value) {
	      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
	        if (value instanceof LodashWrapper) {
	          return value;
	        }
	        if (hasOwnProperty.call(value, '__wrapped__')) {
	          return wrapperClone(value);
	        }
	      }
	      return new LodashWrapper(value);
	    }

	    /**
	     * The function whose prototype chain sequence wrappers inherit from.
	     *
	     * @private
	     */
	    function baseLodash() {
	      // No operation performed.
	    }

	    /**
	     * The base constructor for creating `lodash` wrapper objects.
	     *
	     * @private
	     * @param {*} value The value to wrap.
	     * @param {boolean} [chainAll] Enable explicit method chain sequences.
	     */
	    function LodashWrapper(value, chainAll) {
	      this.__wrapped__ = value;
	      this.__actions__ = [];
	      this.__chain__ = !!chainAll;
	      this.__index__ = 0;
	      this.__values__ = undefined;
	    }

	    /**
	     * By default, the template delimiters used by lodash are like those in
	     * embedded Ruby (ERB). Change the following template settings to use
	     * alternative delimiters.
	     *
	     * @static
	     * @memberOf _
	     * @type {Object}
	     */
	    lodash.templateSettings = {

	      /**
	       * Used to detect `data` property values to be HTML-escaped.
	       *
	       * @memberOf _.templateSettings
	       * @type {RegExp}
	       */
	      'escape': reEscape,

	      /**
	       * Used to detect code to be evaluated.
	       *
	       * @memberOf _.templateSettings
	       * @type {RegExp}
	       */
	      'evaluate': reEvaluate,

	      /**
	       * Used to detect `data` property values to inject.
	       *
	       * @memberOf _.templateSettings
	       * @type {RegExp}
	       */
	      'interpolate': reInterpolate,

	      /**
	       * Used to reference the data object in the template text.
	       *
	       * @memberOf _.templateSettings
	       * @type {string}
	       */
	      'variable': '',

	      /**
	       * Used to import variables into the compiled template.
	       *
	       * @memberOf _.templateSettings
	       * @type {Object}
	       */
	      'imports': {

	        /**
	         * A reference to the `lodash` function.
	         *
	         * @memberOf _.templateSettings.imports
	         * @type {Function}
	         */
	        '_': lodash
	      }
	    };

	    // Ensure wrappers are instances of `baseLodash`.
	    lodash.prototype = baseLodash.prototype;
	    lodash.prototype.constructor = lodash;

	    LodashWrapper.prototype = baseCreate(baseLodash.prototype);
	    LodashWrapper.prototype.constructor = LodashWrapper;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
	     *
	     * @private
	     * @constructor
	     * @param {*} value The value to wrap.
	     */
	    function LazyWrapper(value) {
	      this.__wrapped__ = value;
	      this.__actions__ = [];
	      this.__dir__ = 1;
	      this.__filtered__ = false;
	      this.__iteratees__ = [];
	      this.__takeCount__ = MAX_ARRAY_LENGTH;
	      this.__views__ = [];
	    }

	    /**
	     * Creates a clone of the lazy wrapper object.
	     *
	     * @private
	     * @name clone
	     * @memberOf LazyWrapper
	     * @returns {Object} Returns the cloned `LazyWrapper` object.
	     */
	    function lazyClone() {
	      var result = new LazyWrapper(this.__wrapped__);
	      result.__actions__ = copyArray(this.__actions__);
	      result.__dir__ = this.__dir__;
	      result.__filtered__ = this.__filtered__;
	      result.__iteratees__ = copyArray(this.__iteratees__);
	      result.__takeCount__ = this.__takeCount__;
	      result.__views__ = copyArray(this.__views__);
	      return result;
	    }

	    /**
	     * Reverses the direction of lazy iteration.
	     *
	     * @private
	     * @name reverse
	     * @memberOf LazyWrapper
	     * @returns {Object} Returns the new reversed `LazyWrapper` object.
	     */
	    function lazyReverse() {
	      if (this.__filtered__) {
	        var result = new LazyWrapper(this);
	        result.__dir__ = -1;
	        result.__filtered__ = true;
	      } else {
	        result = this.clone();
	        result.__dir__ *= -1;
	      }
	      return result;
	    }

	    /**
	     * Extracts the unwrapped value from its lazy wrapper.
	     *
	     * @private
	     * @name value
	     * @memberOf LazyWrapper
	     * @returns {*} Returns the unwrapped value.
	     */
	    function lazyValue() {
	      var array = this.__wrapped__.value(),
	          dir = this.__dir__,
	          isArr = isArray(array),
	          isRight = dir < 0,
	          arrLength = isArr ? array.length : 0,
	          view = getView(0, arrLength, this.__views__),
	          start = view.start,
	          end = view.end,
	          length = end - start,
	          index = isRight ? end : (start - 1),
	          iteratees = this.__iteratees__,
	          iterLength = iteratees.length,
	          resIndex = 0,
	          takeCount = nativeMin(length, this.__takeCount__);

	      if (!isArr || arrLength < LARGE_ARRAY_SIZE ||
	          (arrLength == length && takeCount == length)) {
	        return baseWrapperValue(array, this.__actions__);
	      }
	      var result = [];

	      outer:
	      while (length-- && resIndex < takeCount) {
	        index += dir;

	        var iterIndex = -1,
	            value = array[index];

	        while (++iterIndex < iterLength) {
	          var data = iteratees[iterIndex],
	              iteratee = data.iteratee,
	              type = data.type,
	              computed = iteratee(value);

	          if (type == LAZY_MAP_FLAG) {
	            value = computed;
	          } else if (!computed) {
	            if (type == LAZY_FILTER_FLAG) {
	              continue outer;
	            } else {
	              break outer;
	            }
	          }
	        }
	        result[resIndex++] = value;
	      }
	      return result;
	    }

	    // Ensure `LazyWrapper` is an instance of `baseLodash`.
	    LazyWrapper.prototype = baseCreate(baseLodash.prototype);
	    LazyWrapper.prototype.constructor = LazyWrapper;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates a hash object.
	     *
	     * @private
	     * @constructor
	     * @param {Array} [entries] The key-value pairs to cache.
	     */
	    function Hash(entries) {
	      var index = -1,
	          length = entries ? entries.length : 0;

	      this.clear();
	      while (++index < length) {
	        var entry = entries[index];
	        this.set(entry[0], entry[1]);
	      }
	    }

	    /**
	     * Removes all key-value entries from the hash.
	     *
	     * @private
	     * @name clear
	     * @memberOf Hash
	     */
	    function hashClear() {
	      this.__data__ = nativeCreate ? nativeCreate(null) : {};
	    }

	    /**
	     * Removes `key` and its value from the hash.
	     *
	     * @private
	     * @name delete
	     * @memberOf Hash
	     * @param {Object} hash The hash to modify.
	     * @param {string} key The key of the value to remove.
	     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
	     */
	    function hashDelete(key) {
	      return this.has(key) && delete this.__data__[key];
	    }

	    /**
	     * Gets the hash value for `key`.
	     *
	     * @private
	     * @name get
	     * @memberOf Hash
	     * @param {string} key The key of the value to get.
	     * @returns {*} Returns the entry value.
	     */
	    function hashGet(key) {
	      var data = this.__data__;
	      if (nativeCreate) {
	        var result = data[key];
	        return result === HASH_UNDEFINED ? undefined : result;
	      }
	      return hasOwnProperty.call(data, key) ? data[key] : undefined;
	    }

	    /**
	     * Checks if a hash value for `key` exists.
	     *
	     * @private
	     * @name has
	     * @memberOf Hash
	     * @param {string} key The key of the entry to check.
	     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
	     */
	    function hashHas(key) {
	      var data = this.__data__;
	      return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);
	    }

	    /**
	     * Sets the hash `key` to `value`.
	     *
	     * @private
	     * @name set
	     * @memberOf Hash
	     * @param {string} key The key of the value to set.
	     * @param {*} value The value to set.
	     * @returns {Object} Returns the hash instance.
	     */
	    function hashSet(key, value) {
	      var data = this.__data__;
	      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;
	      return this;
	    }

	    // Add methods to `Hash`.
	    Hash.prototype.clear = hashClear;
	    Hash.prototype['delete'] = hashDelete;
	    Hash.prototype.get = hashGet;
	    Hash.prototype.has = hashHas;
	    Hash.prototype.set = hashSet;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates an list cache object.
	     *
	     * @private
	     * @constructor
	     * @param {Array} [entries] The key-value pairs to cache.
	     */
	    function ListCache(entries) {
	      var index = -1,
	          length = entries ? entries.length : 0;

	      this.clear();
	      while (++index < length) {
	        var entry = entries[index];
	        this.set(entry[0], entry[1]);
	      }
	    }

	    /**
	     * Removes all key-value entries from the list cache.
	     *
	     * @private
	     * @name clear
	     * @memberOf ListCache
	     */
	    function listCacheClear() {
	      this.__data__ = [];
	    }

	    /**
	     * Removes `key` and its value from the list cache.
	     *
	     * @private
	     * @name delete
	     * @memberOf ListCache
	     * @param {string} key The key of the value to remove.
	     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
	     */
	    function listCacheDelete(key) {
	      var data = this.__data__,
	          index = assocIndexOf(data, key);

	      if (index < 0) {
	        return false;
	      }
	      var lastIndex = data.length - 1;
	      if (index == lastIndex) {
	        data.pop();
	      } else {
	        splice.call(data, index, 1);
	      }
	      return true;
	    }

	    /**
	     * Gets the list cache value for `key`.
	     *
	     * @private
	     * @name get
	     * @memberOf ListCache
	     * @param {string} key The key of the value to get.
	     * @returns {*} Returns the entry value.
	     */
	    function listCacheGet(key) {
	      var data = this.__data__,
	          index = assocIndexOf(data, key);

	      return index < 0 ? undefined : data[index][1];
	    }

	    /**
	     * Checks if a list cache value for `key` exists.
	     *
	     * @private
	     * @name has
	     * @memberOf ListCache
	     * @param {string} key The key of the entry to check.
	     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
	     */
	    function listCacheHas(key) {
	      return assocIndexOf(this.__data__, key) > -1;
	    }

	    /**
	     * Sets the list cache `key` to `value`.
	     *
	     * @private
	     * @name set
	     * @memberOf ListCache
	     * @param {string} key The key of the value to set.
	     * @param {*} value The value to set.
	     * @returns {Object} Returns the list cache instance.
	     */
	    function listCacheSet(key, value) {
	      var data = this.__data__,
	          index = assocIndexOf(data, key);

	      if (index < 0) {
	        data.push([key, value]);
	      } else {
	        data[index][1] = value;
	      }
	      return this;
	    }

	    // Add methods to `ListCache`.
	    ListCache.prototype.clear = listCacheClear;
	    ListCache.prototype['delete'] = listCacheDelete;
	    ListCache.prototype.get = listCacheGet;
	    ListCache.prototype.has = listCacheHas;
	    ListCache.prototype.set = listCacheSet;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates a map cache object to store key-value pairs.
	     *
	     * @private
	     * @constructor
	     * @param {Array} [entries] The key-value pairs to cache.
	     */
	    function MapCache(entries) {
	      var index = -1,
	          length = entries ? entries.length : 0;

	      this.clear();
	      while (++index < length) {
	        var entry = entries[index];
	        this.set(entry[0], entry[1]);
	      }
	    }

	    /**
	     * Removes all key-value entries from the map.
	     *
	     * @private
	     * @name clear
	     * @memberOf MapCache
	     */
	    function mapCacheClear() {
	      this.__data__ = {
	        'hash': new Hash,
	        'map': new (Map || ListCache),
	        'string': new Hash
	      };
	    }

	    /**
	     * Removes `key` and its value from the map.
	     *
	     * @private
	     * @name delete
	     * @memberOf MapCache
	     * @param {string} key The key of the value to remove.
	     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
	     */
	    function mapCacheDelete(key) {
	      return getMapData(this, key)['delete'](key);
	    }

	    /**
	     * Gets the map value for `key`.
	     *
	     * @private
	     * @name get
	     * @memberOf MapCache
	     * @param {string} key The key of the value to get.
	     * @returns {*} Returns the entry value.
	     */
	    function mapCacheGet(key) {
	      return getMapData(this, key).get(key);
	    }

	    /**
	     * Checks if a map value for `key` exists.
	     *
	     * @private
	     * @name has
	     * @memberOf MapCache
	     * @param {string} key The key of the entry to check.
	     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
	     */
	    function mapCacheHas(key) {
	      return getMapData(this, key).has(key);
	    }

	    /**
	     * Sets the map `key` to `value`.
	     *
	     * @private
	     * @name set
	     * @memberOf MapCache
	     * @param {string} key The key of the value to set.
	     * @param {*} value The value to set.
	     * @returns {Object} Returns the map cache instance.
	     */
	    function mapCacheSet(key, value) {
	      getMapData(this, key).set(key, value);
	      return this;
	    }

	    // Add methods to `MapCache`.
	    MapCache.prototype.clear = mapCacheClear;
	    MapCache.prototype['delete'] = mapCacheDelete;
	    MapCache.prototype.get = mapCacheGet;
	    MapCache.prototype.has = mapCacheHas;
	    MapCache.prototype.set = mapCacheSet;

	    /*------------------------------------------------------------------------*/

	    /**
	     *
	     * Creates an array cache object to store unique values.
	     *
	     * @private
	     * @constructor
	     * @param {Array} [values] The values to cache.
	     */
	    function SetCache(values) {
	      var index = -1,
	          length = values ? values.length : 0;

	      this.__data__ = new MapCache;
	      while (++index < length) {
	        this.add(values[index]);
	      }
	    }

	    /**
	     * Adds `value` to the array cache.
	     *
	     * @private
	     * @name add
	     * @memberOf SetCache
	     * @alias push
	     * @param {*} value The value to cache.
	     * @returns {Object} Returns the cache instance.
	     */
	    function setCacheAdd(value) {
	      this.__data__.set(value, HASH_UNDEFINED);
	      return this;
	    }

	    /**
	     * Checks if `value` is in the array cache.
	     *
	     * @private
	     * @name has
	     * @memberOf SetCache
	     * @param {*} value The value to search for.
	     * @returns {number} Returns `true` if `value` is found, else `false`.
	     */
	    function setCacheHas(value) {
	      return this.__data__.has(value);
	    }

	    // Add methods to `SetCache`.
	    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
	    SetCache.prototype.has = setCacheHas;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates a stack cache object to store key-value pairs.
	     *
	     * @private
	     * @constructor
	     * @param {Array} [entries] The key-value pairs to cache.
	     */
	    function Stack(entries) {
	      this.__data__ = new ListCache(entries);
	    }

	    /**
	     * Removes all key-value entries from the stack.
	     *
	     * @private
	     * @name clear
	     * @memberOf Stack
	     */
	    function stackClear() {
	      this.__data__ = new ListCache;
	    }

	    /**
	     * Removes `key` and its value from the stack.
	     *
	     * @private
	     * @name delete
	     * @memberOf Stack
	     * @param {string} key The key of the value to remove.
	     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
	     */
	    function stackDelete(key) {
	      return this.__data__['delete'](key);
	    }

	    /**
	     * Gets the stack value for `key`.
	     *
	     * @private
	     * @name get
	     * @memberOf Stack
	     * @param {string} key The key of the value to get.
	     * @returns {*} Returns the entry value.
	     */
	    function stackGet(key) {
	      return this.__data__.get(key);
	    }

	    /**
	     * Checks if a stack value for `key` exists.
	     *
	     * @private
	     * @name has
	     * @memberOf Stack
	     * @param {string} key The key of the entry to check.
	     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
	     */
	    function stackHas(key) {
	      return this.__data__.has(key);
	    }

	    /**
	     * Sets the stack `key` to `value`.
	     *
	     * @private
	     * @name set
	     * @memberOf Stack
	     * @param {string} key The key of the value to set.
	     * @param {*} value The value to set.
	     * @returns {Object} Returns the stack cache instance.
	     */
	    function stackSet(key, value) {
	      var cache = this.__data__;
	      if (cache instanceof ListCache && cache.__data__.length == LARGE_ARRAY_SIZE) {
	        cache = this.__data__ = new MapCache(cache.__data__);
	      }
	      cache.set(key, value);
	      return this;
	    }

	    // Add methods to `Stack`.
	    Stack.prototype.clear = stackClear;
	    Stack.prototype['delete'] = stackDelete;
	    Stack.prototype.get = stackGet;
	    Stack.prototype.has = stackHas;
	    Stack.prototype.set = stackSet;

	    /*------------------------------------------------------------------------*/

	    /**
	     * Used by `_.defaults` to customize its `_.assignIn` use.
	     *
	     * @private
	     * @param {*} objValue The destination value.
	     * @param {*} srcValue The source value.
	     * @param {string} key The key of the property to assign.
	     * @param {Object} object The parent object of `objValue`.
	     * @returns {*} Returns the value to assign.
	     */
	    function assignInDefaults(objValue, srcValue, key, object) {
	      if (objValue === undefined ||
	          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {
	        return srcValue;
	      }
	      return objValue;
	    }

	    /**
	     * This function is like `assignValue` except that it doesn't assign
	     * `undefined` values.
	     *
	     * @private
	     * @param {Object} object The object to modify.
	     * @param {string} key The key of the property to assign.
	     * @param {*} value The value to assign.
	     */
	    function assignMergeValue(object, key, value) {
	      if ((value !== undefined && !eq(object[key], value)) ||
	          (typeof key == 'number' && value === undefined && !(key in object))) {
	        object[key] = value;
	      }
	    }

	    /**
	     * Assigns `value` to `key` of `object` if the existing value is not equivalent
	     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons.
	     *
	     * @private
	     * @param {Object} object The object to modify.
	     * @param {string} key The key of the property to assign.
	     * @param {*} value The value to assign.
	     */
	    function assignValue(object, key, value) {
	      var objValue = object[key];
	      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||
	          (value === undefined && !(key in object))) {
	        object[key] = value;
	      }
	    }

	    /**
	     * Gets the index at which the `key` is found in `array` of key-value pairs.
	     *
	     * @private
	     * @param {Array} array The array to search.
	     * @param {*} key The key to search for.
	     * @returns {number} Returns the index of the matched value, else `-1`.
	     */
	    function assocIndexOf(array, key) {
	      var length = array.length;
	      while (length--) {
	        if (eq(array[length][0], key)) {
	          return length;
	        }
	      }
	      return -1;
	    }

	    /**
	     * Aggregates elements of `collection` on `accumulator` with keys transformed
	     * by `iteratee` and values set by `setter`.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} setter The function to set `accumulator` values.
	     * @param {Function} iteratee The iteratee to transform keys.
	     * @param {Object} accumulator The initial aggregated object.
	     * @returns {Function} Returns `accumulator`.
	     */
	    function baseAggregator(collection, setter, iteratee, accumulator) {
	      baseEach(collection, function(value, key, collection) {
	        setter(accumulator, value, iteratee(value), collection);
	      });
	      return accumulator;
	    }

	    /**
	     * The base implementation of `_.assign` without support for multiple sources
	     * or `customizer` functions.
	     *
	     * @private
	     * @param {Object} object The destination object.
	     * @param {Object} source The source object.
	     * @returns {Object} Returns `object`.
	     */
	    function baseAssign(object, source) {
	      return object && copyObject(source, keys(source), object);
	    }

	    /**
	     * The base implementation of `_.at` without support for individual paths.
	     *
	     * @private
	     * @param {Object} object The object to iterate over.
	     * @param {string[]} paths The property paths of elements to pick.
	     * @returns {Array} Returns the picked elements.
	     */
	    function baseAt(object, paths) {
	      var index = -1,
	          isNil = object == null,
	          length = paths.length,
	          result = Array(length);

	      while (++index < length) {
	        result[index] = isNil ? undefined : get(object, paths[index]);
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.clamp` which doesn't coerce arguments to numbers.
	     *
	     * @private
	     * @param {number} number The number to clamp.
	     * @param {number} [lower] The lower bound.
	     * @param {number} upper The upper bound.
	     * @returns {number} Returns the clamped number.
	     */
	    function baseClamp(number, lower, upper) {
	      if (number === number) {
	        if (upper !== undefined) {
	          number = number <= upper ? number : upper;
	        }
	        if (lower !== undefined) {
	          number = number >= lower ? number : lower;
	        }
	      }
	      return number;
	    }

	    /**
	     * The base implementation of `_.clone` and `_.cloneDeep` which tracks
	     * traversed objects.
	     *
	     * @private
	     * @param {*} value The value to clone.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @param {boolean} [isFull] Specify a clone including symbols.
	     * @param {Function} [customizer] The function to customize cloning.
	     * @param {string} [key] The key of `value`.
	     * @param {Object} [object] The parent object of `value`.
	     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.
	     * @returns {*} Returns the cloned value.
	     */
	    function baseClone(value, isDeep, isFull, customizer, key, object, stack) {
	      var result;
	      if (customizer) {
	        result = object ? customizer(value, key, object, stack) : customizer(value);
	      }
	      if (result !== undefined) {
	        return result;
	      }
	      if (!isObject(value)) {
	        return value;
	      }
	      var isArr = isArray(value);
	      if (isArr) {
	        result = initCloneArray(value);
	        if (!isDeep) {
	          return copyArray(value, result);
	        }
	      } else {
	        var tag = getTag(value),
	            isFunc = tag == funcTag || tag == genTag;

	        if (isBuffer(value)) {
	          return cloneBuffer(value, isDeep);
	        }
	        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
	          if (isHostObject(value)) {
	            return object ? value : {};
	          }
	          result = initCloneObject(isFunc ? {} : value);
	          if (!isDeep) {
	            return copySymbols(value, baseAssign(result, value));
	          }
	        } else {
	          if (!cloneableTags[tag]) {
	            return object ? value : {};
	          }
	          result = initCloneByTag(value, tag, baseClone, isDeep);
	        }
	      }
	      // Check for circular references and return its corresponding clone.
	      stack || (stack = new Stack);
	      var stacked = stack.get(value);
	      if (stacked) {
	        return stacked;
	      }
	      stack.set(value, result);

	      if (!isArr) {
	        var props = isFull ? getAllKeys(value) : keys(value);
	      }
	      // Recursively populate clone (susceptible to call stack limits).
	      arrayEach(props || value, function(subValue, key) {
	        if (props) {
	          key = subValue;
	          subValue = value[key];
	        }
	        assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));
	      });
	      return result;
	    }

	    /**
	     * The base implementation of `_.conforms` which doesn't clone `source`.
	     *
	     * @private
	     * @param {Object} source The object of property predicates to conform to.
	     * @returns {Function} Returns the new spec function.
	     */
	    function baseConforms(source) {
	      var props = keys(source),
	          length = props.length;

	      return function(object) {
	        if (object == null) {
	          return !length;
	        }
	        var index = length;
	        while (index--) {
	          var key = props[index],
	              predicate = source[key],
	              value = object[key];

	          if ((value === undefined &&
	              !(key in Object(object))) || !predicate(value)) {
	            return false;
	          }
	        }
	        return true;
	      };
	    }

	    /**
	     * The base implementation of `_.create` without support for assigning
	     * properties to the created object.
	     *
	     * @private
	     * @param {Object} prototype The object to inherit from.
	     * @returns {Object} Returns the new object.
	     */
	    function baseCreate(proto) {
	      return isObject(proto) ? objectCreate(proto) : {};
	    }

	    /**
	     * The base implementation of `_.delay` and `_.defer` which accepts an array
	     * of `func` arguments.
	     *
	     * @private
	     * @param {Function} func The function to delay.
	     * @param {number} wait The number of milliseconds to delay invocation.
	     * @param {Object} args The arguments to 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 methods like `_.difference` without support
	     * for excluding multiple arrays or iteratee shorthands.
	     *
	     * @private
	     * @param {Array} array The array to inspect.
	     * @param {Array} values The values to exclude.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of filtered values.
	     */
	    function baseDifference(array, values, iteratee, comparator) {
	      var index = -1,
	          includes = arrayIncludes,
	          isCommon = true,
	          length = array.length,
	          result = [],
	          valuesLength = values.length;

	      if (!length) {
	        return result;
	      }
	      if (iteratee) {
	        values = arrayMap(values, baseUnary(iteratee));
	      }
	      if (comparator) {
	        includes = arrayIncludesWith;
	        isCommon = false;
	      }
	      else if (values.length >= LARGE_ARRAY_SIZE) {
	        includes = cacheHas;
	        isCommon = false;
	        values = new SetCache(values);
	      }
	      outer:
	      while (++index < length) {
	        var value = array[index],
	            computed = iteratee ? iteratee(value) : value;

	        value = (comparator || value !== 0) ? value : 0;
	        if (isCommon && computed === computed) {
	          var valuesIndex = valuesLength;
	          while (valuesIndex--) {
	            if (values[valuesIndex] === computed) {
	              continue outer;
	            }
	          }
	          result.push(value);
	        }
	        else if (!includes(values, computed, comparator)) {
	          result.push(value);
	        }
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.forEach` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @returns {Array|Object} Returns `collection`.
	     */
	    var baseEach = createBaseEach(baseForOwn);

	    /**
	     * The base implementation of `_.forEachRight` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @returns {Array|Object} Returns `collection`.
	     */
	    var baseEachRight = createBaseEach(baseForOwnRight, true);

	    /**
	     * The base implementation of `_.every` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} predicate The function invoked per iteration.
	     * @returns {boolean} Returns `true` if all elements pass the predicate check,
	     *  else `false`
	     */
	    function baseEvery(collection, predicate) {
	      var result = true;
	      baseEach(collection, function(value, index, collection) {
	        result = !!predicate(value, index, collection);
	        return result;
	      });
	      return result;
	    }

	    /**
	     * The base implementation of methods like `_.max` and `_.min` which accepts a
	     * `comparator` to determine the extremum value.
	     *
	     * @private
	     * @param {Array} array The array to iterate over.
	     * @param {Function} iteratee The iteratee invoked per iteration.
	     * @param {Function} comparator The comparator used to compare values.
	     * @returns {*} Returns the extremum value.
	     */
	    function baseExtremum(array, iteratee, comparator) {
	      var index = -1,
	          length = array.length;

	      while (++index < length) {
	        var value = array[index],
	            current = iteratee(value);

	        if (current != null && (computed === undefined
	              ? (current === current && !isSymbol(current))
	              : comparator(current, computed)
	            )) {
	          var computed = current,
	              result = value;
	        }
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.fill` without an iteratee call guard.
	     *
	     * @private
	     * @param {Array} array The array to fill.
	     * @param {*} value The value to fill `array` with.
	     * @param {number} [start=0] The start position.
	     * @param {number} [end=array.length] The end position.
	     * @returns {Array} Returns `array`.
	     */
	    function baseFill(array, value, start, end) {
	      var length = array.length;

	      start = toInteger(start);
	      if (start < 0) {
	        start = -start > length ? 0 : (length + start);
	      }
	      end = (end === undefined || end > length) ? length : toInteger(end);
	      if (end < 0) {
	        end += length;
	      }
	      end = start > end ? 0 : toLength(end);
	      while (start < end) {
	        array[start++] = value;
	      }
	      return array;
	    }

	    /**
	     * The base implementation of `_.filter` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} predicate The function invoked per iteration.
	     * @returns {Array} Returns the new filtered array.
	     */
	    function baseFilter(collection, predicate) {
	      var result = [];
	      baseEach(collection, function(value, index, collection) {
	        if (predicate(value, index, collection)) {
	          result.push(value);
	        }
	      });
	      return result;
	    }

	    /**
	     * The base implementation of `_.flatten` with support for restricting flattening.
	     *
	     * @private
	     * @param {Array} array The array to flatten.
	     * @param {number} depth The maximum recursion depth.
	     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
	     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
	     * @param {Array} [result=[]] The initial result value.
	     * @returns {Array} Returns the new flattened array.
	     */
	    function baseFlatten(array, depth, predicate, isStrict, result) {
	      var index = -1,
	          length = array.length;

	      predicate || (predicate = isFlattenable);
	      result || (result = []);

	      while (++index < length) {
	        var value = array[index];
	        if (depth > 0 && predicate(value)) {
	          if (depth > 1) {
	            // Recursively flatten arrays (susceptible to call stack limits).
	            baseFlatten(value, depth - 1, predicate, isStrict, result);
	          } else {
	            arrayPush(result, value);
	          }
	        } else if (!isStrict) {
	          result[result.length] = value;
	        }
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `baseForOwn` which iterates over `object`
	     * properties returned by `keysFunc` and invokes `iteratee` for each property.
	     * Iteratee functions may exit iteration early by explicitly returning `false`.
	     *
	     * @private
	     * @param {Object} object The object to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @param {Function} keysFunc The function to get the keys of `object`.
	     * @returns {Object} Returns `object`.
	     */
	    var baseFor = createBaseFor();

	    /**
	     * This function is like `baseFor` except that it iterates over properties
	     * in the opposite order.
	     *
	     * @private
	     * @param {Object} object The object to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @param {Function} keysFunc The function to get the keys of `object`.
	     * @returns {Object} Returns `object`.
	     */
	    var baseForRight = createBaseFor(true);

	    /**
	     * The base implementation of `_.forOwn` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Object} object The object to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @returns {Object} Returns `object`.
	     */
	    function baseForOwn(object, iteratee) {
	      return object && baseFor(object, iteratee, keys);
	    }

	    /**
	     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Object} object The object to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @returns {Object} Returns `object`.
	     */
	    function baseForOwnRight(object, iteratee) {
	      return object && baseForRight(object, iteratee, keys);
	    }

	    /**
	     * The base implementation of `_.functions` which creates an array of
	     * `object` function property names filtered from `props`.
	     *
	     * @private
	     * @param {Object} object The object to inspect.
	     * @param {Array} props The property names to filter.
	     * @returns {Array} Returns the function names.
	     */
	    function baseFunctions(object, props) {
	      return arrayFilter(props, function(key) {
	        return isFunction(object[key]);
	      });
	    }

	    /**
	     * The base implementation of `_.get` without support for default values.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the property to get.
	     * @returns {*} Returns the resolved value.
	     */
	    function baseGet(object, path) {
	      path = isKey(path, object) ? [path] : castPath(path);

	      var index = 0,
	          length = path.length;

	      while (object != null && index < length) {
	        object = object[toKey(path[index++])];
	      }
	      return (index && index == length) ? object : undefined;
	    }

	    /**
	     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
	     * `keysFunc` and `symbolsFunc` to get the enumerable property names and
	     * symbols of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Function} keysFunc The function to get the keys of `object`.
	     * @param {Function} symbolsFunc The function to get the symbols of `object`.
	     * @returns {Array} Returns the array of property names and symbols.
	     */
	    function baseGetAllKeys(object, keysFunc, symbolsFunc) {
	      var result = keysFunc(object);
	      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
	    }

	    /**
	     * The base implementation of `_.gt` which doesn't coerce arguments to numbers.
	     *
	     * @private
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if `value` is greater than `other`,
	     *  else `false`.
	     */
	    function baseGt(value, other) {
	      return value > other;
	    }

	    /**
	     * The base implementation of `_.has` without support for deep paths.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} key The key to check.
	     * @returns {boolean} Returns `true` if `key` exists, else `false`.
	     */
	    function baseHas(object, key) {
	      // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`,
	      // that are composed entirely of index properties, return `false` for
	      // `hasOwnProperty` checks of them.
	      return hasOwnProperty.call(object, key) ||
	        (typeof object == 'object' && key in object && getPrototype(object) === null);
	    }

	    /**
	     * The base implementation of `_.hasIn` without support for deep paths.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} key The key to check.
	     * @returns {boolean} Returns `true` if `key` exists, else `false`.
	     */
	    function baseHasIn(object, key) {
	      return key in Object(object);
	    }

	    /**
	     * The base implementation of `_.inRange` which doesn't coerce arguments to numbers.
	     *
	     * @private
	     * @param {number} number The number to check.
	     * @param {number} start The start of the range.
	     * @param {number} end The end of the range.
	     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
	     */
	    function baseInRange(number, start, end) {
	      return number >= nativeMin(start, end) && number < nativeMax(start, end);
	    }

	    /**
	     * The base implementation of methods like `_.intersection`, without support
	     * for iteratee shorthands, that accepts an array of arrays to inspect.
	     *
	     * @private
	     * @param {Array} arrays The arrays to inspect.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of shared values.
	     */
	    function baseIntersection(arrays, iteratee, comparator) {
	      var includes = comparator ? arrayIncludesWith : arrayIncludes,
	          length = arrays[0].length,
	          othLength = arrays.length,
	          othIndex = othLength,
	          caches = Array(othLength),
	          maxLength = Infinity,
	          result = [];

	      while (othIndex--) {
	        var array = arrays[othIndex];
	        if (othIndex && iteratee) {
	          array = arrayMap(array, baseUnary(iteratee));
	        }
	        maxLength = nativeMin(array.length, maxLength);
	        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))
	          ? new SetCache(othIndex && array)
	          : undefined;
	      }
	      array = arrays[0];

	      var index = -1,
	          seen = caches[0];

	      outer:
	      while (++index < length && result.length < maxLength) {
	        var value = array[index],
	            computed = iteratee ? iteratee(value) : value;

	        value = (comparator || value !== 0) ? value : 0;
	        if (!(seen
	              ? cacheHas(seen, computed)
	              : includes(result, computed, comparator)
	            )) {
	          othIndex = othLength;
	          while (--othIndex) {
	            var cache = caches[othIndex];
	            if (!(cache
	                  ? cacheHas(cache, computed)
	                  : includes(arrays[othIndex], computed, comparator))
	                ) {
	              continue outer;
	            }
	          }
	          if (seen) {
	            seen.push(computed);
	          }
	          result.push(value);
	        }
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.invert` and `_.invertBy` which inverts
	     * `object` with values transformed by `iteratee` and set by `setter`.
	     *
	     * @private
	     * @param {Object} object The object to iterate over.
	     * @param {Function} setter The function to set `accumulator` values.
	     * @param {Function} iteratee The iteratee to transform values.
	     * @param {Object} accumulator The initial inverted object.
	     * @returns {Function} Returns `accumulator`.
	     */
	    function baseInverter(object, setter, iteratee, accumulator) {
	      baseForOwn(object, function(value, key, object) {
	        setter(accumulator, iteratee(value), key, object);
	      });
	      return accumulator;
	    }

	    /**
	     * The base implementation of `_.invoke` without support for individual
	     * method arguments.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the method to invoke.
	     * @param {Array} args The arguments to invoke the method with.
	     * @returns {*} Returns the result of the invoked method.
	     */
	    function baseInvoke(object, path, args) {
	      if (!isKey(path, object)) {
	        path = castPath(path);
	        object = parent(object, path);
	        path = last(path);
	      }
	      var func = object == null ? object : object[toKey(path)];
	      return func == null ? undefined : apply(func, object, args);
	    }

	    /**
	     * The base implementation of `_.isEqual` which supports partial comparisons
	     * and tracks traversed objects.
	     *
	     * @private
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @param {Function} [customizer] The function to customize comparisons.
	     * @param {boolean} [bitmask] The bitmask of comparison flags.
	     *  The bitmask may be composed of the following flags:
	     *     1 - Unordered comparison
	     *     2 - Partial comparison
	     * @param {Object} [stack] Tracks traversed `value` and `other` objects.
	     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
	     */
	    function baseIsEqual(value, other, customizer, bitmask, stack) {
	      if (value === other) {
	        return true;
	      }
	      if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
	        return value !== value && other !== other;
	      }
	      return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack);
	    }

	    /**
	     * A specialized version of `baseIsEqual` for arrays and objects which performs
	     * deep comparisons and tracks traversed objects enabling objects with circular
	     * references to be compared.
	     *
	     * @private
	     * @param {Object} object The object to compare.
	     * @param {Object} other The other object to compare.
	     * @param {Function} equalFunc The function to determine equivalents of values.
	     * @param {Function} [customizer] The function to customize comparisons.
	     * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual`
	     *  for more details.
	     * @param {Object} [stack] Tracks traversed `object` and `other` objects.
	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
	     */
	    function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) {
	      var objIsArr = isArray(object),
	          othIsArr = isArray(other),
	          objTag = arrayTag,
	          othTag = arrayTag;

	      if (!objIsArr) {
	        objTag = getTag(object);
	        objTag = objTag == argsTag ? objectTag : objTag;
	      }
	      if (!othIsArr) {
	        othTag = getTag(other);
	        othTag = othTag == argsTag ? objectTag : othTag;
	      }
	      var objIsObj = objTag == objectTag && !isHostObject(object),
	          othIsObj = othTag == objectTag && !isHostObject(other),
	          isSameTag = objTag == othTag;

	      if (isSameTag && !objIsObj) {
	        stack || (stack = new Stack);
	        return (objIsArr || isTypedArray(object))
	          ? equalArrays(object, other, equalFunc, customizer, bitmask, stack)
	          : equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack);
	      }
	      if (!(bitmask & PARTIAL_COMPARE_FLAG)) {
	        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
	            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');

	        if (objIsWrapped || othIsWrapped) {
	          var objUnwrapped = objIsWrapped ? object.value() : object,
	              othUnwrapped = othIsWrapped ? other.value() : other;

	          stack || (stack = new Stack);
	          return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack);
	        }
	      }
	      if (!isSameTag) {
	        return false;
	      }
	      stack || (stack = new Stack);
	      return equalObjects(object, other, equalFunc, customizer, bitmask, stack);
	    }

	    /**
	     * The base implementation of `_.isMatch` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Object} object The object to inspect.
	     * @param {Object} source The object of property values to match.
	     * @param {Array} matchData The property names, values, and compare flags to match.
	     * @param {Function} [customizer] The function to customize comparisons.
	     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
	     */
	    function baseIsMatch(object, source, matchData, customizer) {
	      var index = matchData.length,
	          length = index,
	          noCustomizer = !customizer;

	      if (object == null) {
	        return !length;
	      }
	      object = Object(object);
	      while (index--) {
	        var data = matchData[index];
	        if ((noCustomizer && data[2])
	              ? data[1] !== object[data[0]]
	              : !(data[0] in object)
	            ) {
	          return false;
	        }
	      }
	      while (++index < length) {
	        data = matchData[index];
	        var key = data[0],
	            objValue = object[key],
	            srcValue = data[1];

	        if (noCustomizer && data[2]) {
	          if (objValue === undefined && !(key in object)) {
	            return false;
	          }
	        } else {
	          var stack = new Stack;
	          if (customizer) {
	            var result = customizer(objValue, srcValue, key, object, source, stack);
	          }
	          if (!(result === undefined
	                ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack)
	                : result
	              )) {
	            return false;
	          }
	        }
	      }
	      return true;
	    }

	    /**
	     * The base implementation of `_.iteratee`.
	     *
	     * @private
	     * @param {*} [value=_.identity] The value to convert to an iteratee.
	     * @returns {Function} Returns the iteratee.
	     */
	    function baseIteratee(value) {
	      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
	      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
	      if (typeof value == 'function') {
	        return value;
	      }
	      if (value == null) {
	        return identity;
	      }
	      if (typeof value == 'object') {
	        return isArray(value)
	          ? baseMatchesProperty(value[0], value[1])
	          : baseMatches(value);
	      }
	      return property(value);
	    }

	    /**
	     * The base implementation of `_.keys` which doesn't skip the constructor
	     * property of prototypes or treat sparse arrays as dense.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property names.
	     */
	    function baseKeys(object) {
	      return nativeKeys(Object(object));
	    }

	    /**
	     * The base implementation of `_.keysIn` which doesn't skip the constructor
	     * property of prototypes or treat sparse arrays as dense.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property names.
	     */
	    function baseKeysIn(object) {
	      object = object == null ? object : Object(object);

	      var result = [];
	      for (var key in object) {
	        result.push(key);
	      }
	      return result;
	    }

	    // Fallback for IE < 9 with es6-shim.
	    if (enumerate && !propertyIsEnumerable.call({ 'valueOf': 1 }, 'valueOf')) {
	      baseKeysIn = function(object) {
	        return iteratorToArray(enumerate(object));
	      };
	    }

	    /**
	     * The base implementation of `_.lt` which doesn't coerce arguments to numbers.
	     *
	     * @private
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if `value` is less than `other`,
	     *  else `false`.
	     */
	    function baseLt(value, other) {
	      return value < other;
	    }

	    /**
	     * The base implementation of `_.map` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} iteratee The function invoked per iteration.
	     * @returns {Array} Returns the new mapped array.
	     */
	    function baseMap(collection, iteratee) {
	      var index = -1,
	          result = isArrayLike(collection) ? Array(collection.length) : [];

	      baseEach(collection, function(value, key, collection) {
	        result[++index] = iteratee(value, key, collection);
	      });
	      return result;
	    }

	    /**
	     * The base implementation of `_.matches` which doesn't clone `source`.
	     *
	     * @private
	     * @param {Object} source The object of property values to match.
	     * @returns {Function} Returns the new spec function.
	     */
	    function baseMatches(source) {
	      var matchData = getMatchData(source);
	      if (matchData.length == 1 && matchData[0][2]) {
	        return matchesStrictComparable(matchData[0][0], matchData[0][1]);
	      }
	      return function(object) {
	        return object === source || baseIsMatch(object, source, matchData);
	      };
	    }

	    /**
	     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
	     *
	     * @private
	     * @param {string} path The path of the property to get.
	     * @param {*} srcValue The value to match.
	     * @returns {Function} Returns the new spec function.
	     */
	    function baseMatchesProperty(path, srcValue) {
	      if (isKey(path) && isStrictComparable(srcValue)) {
	        return matchesStrictComparable(toKey(path), srcValue);
	      }
	      return function(object) {
	        var objValue = get(object, path);
	        return (objValue === undefined && objValue === srcValue)
	          ? hasIn(object, path)
	          : baseIsEqual(srcValue, objValue, undefined, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG);
	      };
	    }

	    /**
	     * The base implementation of `_.merge` without support for multiple sources.
	     *
	     * @private
	     * @param {Object} object The destination object.
	     * @param {Object} source The source object.
	     * @param {number} srcIndex The index of `source`.
	     * @param {Function} [customizer] The function to customize merged values.
	     * @param {Object} [stack] Tracks traversed source values and their merged
	     *  counterparts.
	     */
	    function baseMerge(object, source, srcIndex, customizer, stack) {
	      if (object === source) {
	        return;
	      }
	      if (!(isArray(source) || isTypedArray(source))) {
	        var props = keysIn(source);
	      }
	      arrayEach(props || source, function(srcValue, key) {
	        if (props) {
	          key = srcValue;
	          srcValue = source[key];
	        }
	        if (isObject(srcValue)) {
	          stack || (stack = new Stack);
	          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
	        }
	        else {
	          var newValue = customizer
	            ? customizer(object[key], srcValue, (key + ''), object, source, stack)
	            : undefined;

	          if (newValue === undefined) {
	            newValue = srcValue;
	          }
	          assignMergeValue(object, key, newValue);
	        }
	      });
	    }

	    /**
	     * A specialized version of `baseMerge` for arrays and objects which performs
	     * deep merges and tracks traversed objects enabling objects with circular
	     * references to be merged.
	     *
	     * @private
	     * @param {Object} object The destination object.
	     * @param {Object} source The source object.
	     * @param {string} key The key of the value to merge.
	     * @param {number} srcIndex The index of `source`.
	     * @param {Function} mergeFunc The function to merge values.
	     * @param {Function} [customizer] The function to customize assigned values.
	     * @param {Object} [stack] Tracks traversed source values and their merged
	     *  counterparts.
	     */
	    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
	      var objValue = object[key],
	          srcValue = source[key],
	          stacked = stack.get(srcValue);

	      if (stacked) {
	        assignMergeValue(object, key, stacked);
	        return;
	      }
	      var newValue = customizer
	        ? customizer(objValue, srcValue, (key + ''), object, source, stack)
	        : undefined;

	      var isCommon = newValue === undefined;

	      if (isCommon) {
	        newValue = srcValue;
	        if (isArray(srcValue) || isTypedArray(srcValue)) {
	          if (isArray(objValue)) {
	            newValue = objValue;
	          }
	          else if (isArrayLikeObject(objValue)) {
	            newValue = copyArray(objValue);
	          }
	          else {
	            isCommon = false;
	            newValue = baseClone(srcValue, true);
	          }
	        }
	        else if (isPlainObject(srcValue) || isArguments(srcValue)) {
	          if (isArguments(objValue)) {
	            newValue = toPlainObject(objValue);
	          }
	          else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
	            isCommon = false;
	            newValue = baseClone(srcValue, true);
	          }
	          else {
	            newValue = objValue;
	          }
	        }
	        else {
	          isCommon = false;
	        }
	      }
	      stack.set(srcValue, newValue);

	      if (isCommon) {
	        // Recursively merge objects and arrays (susceptible to call stack limits).
	        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);
	      }
	      stack['delete'](srcValue);
	      assignMergeValue(object, key, newValue);
	    }

	    /**
	     * The base implementation of `_.nth` which doesn't coerce `n` to an integer.
	     *
	     * @private
	     * @param {Array} array The array to query.
	     * @param {number} n The index of the element to return.
	     * @returns {*} Returns the nth element of `array`.
	     */
	    function baseNth(array, n) {
	      var length = array.length;
	      if (!length) {
	        return;
	      }
	      n += n < 0 ? length : 0;
	      return isIndex(n, length) ? array[n] : undefined;
	    }

	    /**
	     * The base implementation of `_.orderBy` without param guards.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
	     * @param {string[]} orders The sort orders of `iteratees`.
	     * @returns {Array} Returns the new sorted array.
	     */
	    function baseOrderBy(collection, iteratees, orders) {
	      var index = -1;
	      iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee()));

	      var result = baseMap(collection, function(value, key, collection) {
	        var criteria = arrayMap(iteratees, function(iteratee) {
	          return iteratee(value);
	        });
	        return { 'criteria': criteria, 'index': ++index, 'value': value };
	      });

	      return baseSortBy(result, function(object, other) {
	        return compareMultiple(object, other, orders);
	      });
	    }

	    /**
	     * The base implementation of `_.pick` without support for individual
	     * property identifiers.
	     *
	     * @private
	     * @param {Object} object The source object.
	     * @param {string[]} props The property identifiers to pick.
	     * @returns {Object} Returns the new object.
	     */
	    function basePick(object, props) {
	      object = Object(object);
	      return arrayReduce(props, function(result, key) {
	        if (key in object) {
	          result[key] = object[key];
	        }
	        return result;
	      }, {});
	    }

	    /**
	     * The base implementation of  `_.pickBy` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Object} object The source object.
	     * @param {Function} predicate The function invoked per property.
	     * @returns {Object} Returns the new object.
	     */
	    function basePickBy(object, predicate) {
	      var index = -1,
	          props = getAllKeysIn(object),
	          length = props.length,
	          result = {};

	      while (++index < length) {
	        var key = props[index],
	            value = object[key];

	        if (predicate(value, key)) {
	          result[key] = value;
	        }
	      }
	      return 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 accessor 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 accessor function.
	     */
	    function basePropertyDeep(path) {
	      return function(object) {
	        return baseGet(object, path);
	      };
	    }

	    /**
	     * The base implementation of `_.pullAllBy` without support for iteratee
	     * shorthands.
	     *
	     * @private
	     * @param {Array} array The array to modify.
	     * @param {Array} values The values to remove.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns `array`.
	     */
	    function basePullAll(array, values, iteratee, comparator) {
	      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,
	          index = -1,
	          length = values.length,
	          seen = array;

	      if (iteratee) {
	        seen = arrayMap(array, baseUnary(iteratee));
	      }
	      while (++index < length) {
	        var fromIndex = 0,
	            value = values[index],
	            computed = iteratee ? iteratee(value) : value;

	        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {
	          if (seen !== array) {
	            splice.call(seen, fromIndex, 1);
	          }
	          splice.call(array, fromIndex, 1);
	        }
	      }
	      return array;
	    }

	    /**
	     * The base implementation of `_.pullAt` without support for individual
	     * indexes or capturing the removed elements.
	     *
	     * @private
	     * @param {Array} array The array to modify.
	     * @param {number[]} indexes The indexes of elements to remove.
	     * @returns {Array} Returns `array`.
	     */
	    function basePullAt(array, indexes) {
	      var length = array ? indexes.length : 0,
	          lastIndex = length - 1;

	      while (length--) {
	        var index = indexes[length];
	        if (length == lastIndex || index !== previous) {
	          var previous = index;
	          if (isIndex(index)) {
	            splice.call(array, index, 1);
	          }
	          else if (!isKey(index, array)) {
	            var path = castPath(index),
	                object = parent(array, path);

	            if (object != null) {
	              delete object[toKey(last(path))];
	            }
	          }
	          else {
	            delete array[toKey(index)];
	          }
	        }
	      }
	      return array;
	    }

	    /**
	     * The base implementation of `_.random` without support for returning
	     * floating-point numbers.
	     *
	     * @private
	     * @param {number} lower The lower bound.
	     * @param {number} upper The upper bound.
	     * @returns {number} Returns the random number.
	     */
	    function baseRandom(lower, upper) {
	      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));
	    }

	    /**
	     * The base implementation of `_.range` and `_.rangeRight` which doesn't
	     * coerce arguments to numbers.
	     *
	     * @private
	     * @param {number} start The start of the range.
	     * @param {number} end The end of the range.
	     * @param {number} step The value to increment or decrement by.
	     * @param {boolean} [fromRight] Specify iterating from right to left.
	     * @returns {Array} Returns the range of numbers.
	     */
	    function baseRange(start, end, step, fromRight) {
	      var index = -1,
	          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
	          result = Array(length);

	      while (length--) {
	        result[fromRight ? length : ++index] = start;
	        start += step;
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.repeat` which doesn't coerce arguments.
	     *
	     * @private
	     * @param {string} string The string to repeat.
	     * @param {number} n The number of times to repeat the string.
	     * @returns {string} Returns the repeated string.
	     */
	    function baseRepeat(string, n) {
	      var result = '';
	      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {
	        return result;
	      }
	      // Leverage the exponentiation by squaring algorithm for a faster repeat.
	      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
	      do {
	        if (n % 2) {
	          result += string;
	        }
	        n = nativeFloor(n / 2);
	        if (n) {
	          string += string;
	        }
	      } while (n);

	      return result;
	    }

	    /**
	     * The base implementation of `_.set`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the property to set.
	     * @param {*} value The value to set.
	     * @param {Function} [customizer] The function to customize path creation.
	     * @returns {Object} Returns `object`.
	     */
	    function baseSet(object, path, value, customizer) {
	      path = isKey(path, object) ? [path] : castPath(path);

	      var index = -1,
	          length = path.length,
	          lastIndex = length - 1,
	          nested = object;

	      while (nested != null && ++index < length) {
	        var key = toKey(path[index]);
	        if (isObject(nested)) {
	          var newValue = value;
	          if (index != lastIndex) {
	            var objValue = nested[key];
	            newValue = customizer ? customizer(objValue, key, nested) : undefined;
	            if (newValue === undefined) {
	              newValue = objValue == null
	                ? (isIndex(path[index + 1]) ? [] : {})
	                : objValue;
	            }
	          }
	          assignValue(nested, key, newValue);
	        }
	        nested = nested[key];
	      }
	      return object;
	    }

	    /**
	     * The base implementation of `setData` without support for hot loop detection.
	     *
	     * @private
	     * @param {Function} func The function to associate metadata with.
	     * @param {*} data The metadata.
	     * @returns {Function} Returns `func`.
	     */
	    var baseSetData = !metaMap ? identity : function(func, data) {
	      metaMap.set(func, data);
	      return func;
	    };

	    /**
	     * The base implementation of `_.slice` without an iteratee call guard.
	     *
	     * @private
	     * @param {Array} array The array to slice.
	     * @param {number} [start=0] The start position.
	     * @param {number} [end=array.length] The end position.
	     * @returns {Array} Returns the slice of `array`.
	     */
	    function baseSlice(array, start, end) {
	      var index = -1,
	          length = array.length;

	      if (start < 0) {
	        start = -start > length ? 0 : (length + start);
	      }
	      end = end > length ? length : end;
	      if (end < 0) {
	        end += length;
	      }
	      length = start > end ? 0 : ((end - start) >>> 0);
	      start >>>= 0;

	      var result = Array(length);
	      while (++index < length) {
	        result[index] = array[index + start];
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.some` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} predicate The function invoked per iteration.
	     * @returns {boolean} Returns `true` if any element passes the predicate check,
	     *  else `false`.
	     */
	    function baseSome(collection, predicate) {
	      var result;

	      baseEach(collection, function(value, index, collection) {
	        result = predicate(value, index, collection);
	        return !result;
	      });
	      return !!result;
	    }

	    /**
	     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which
	     * performs a binary search of `array` to determine the index at which `value`
	     * should be inserted into `array` in order to maintain its sort order.
	     *
	     * @private
	     * @param {Array} array The sorted array to inspect.
	     * @param {*} value The value to evaluate.
	     * @param {boolean} [retHighest] Specify returning the highest qualified index.
	     * @returns {number} Returns the index at which `value` should be inserted
	     *  into `array`.
	     */
	    function baseSortedIndex(array, value, retHighest) {
	      var low = 0,
	          high = array ? array.length : low;

	      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
	        while (low < high) {
	          var mid = (low + high) >>> 1,
	              computed = array[mid];

	          if (computed !== null && !isSymbol(computed) &&
	              (retHighest ? (computed <= value) : (computed < value))) {
	            low = mid + 1;
	          } else {
	            high = mid;
	          }
	        }
	        return high;
	      }
	      return baseSortedIndexBy(array, value, identity, retHighest);
	    }

	    /**
	     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`
	     * which invokes `iteratee` for `value` and each element of `array` to compute
	     * their sort ranking. The iteratee is invoked with one argument; (value).
	     *
	     * @private
	     * @param {Array} array The sorted array to inspect.
	     * @param {*} value The value to evaluate.
	     * @param {Function} iteratee The iteratee invoked per element.
	     * @param {boolean} [retHighest] Specify returning the highest qualified index.
	     * @returns {number} Returns the index at which `value` should be inserted
	     *  into `array`.
	     */
	    function baseSortedIndexBy(array, value, iteratee, retHighest) {
	      value = iteratee(value);

	      var low = 0,
	          high = array ? array.length : 0,
	          valIsNaN = value !== value,
	          valIsNull = value === null,
	          valIsSymbol = isSymbol(value),
	          valIsUndefined = value === undefined;

	      while (low < high) {
	        var mid = nativeFloor((low + high) / 2),
	            computed = iteratee(array[mid]),
	            othIsDefined = computed !== undefined,
	            othIsNull = computed === null,
	            othIsReflexive = computed === computed,
	            othIsSymbol = isSymbol(computed);

	        if (valIsNaN) {
	          var setLow = retHighest || othIsReflexive;
	        } else if (valIsUndefined) {
	          setLow = othIsReflexive && (retHighest || othIsDefined);
	        } else if (valIsNull) {
	          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);
	        } else if (valIsSymbol) {
	          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);
	        } else if (othIsNull || othIsSymbol) {
	          setLow = false;
	        } else {
	          setLow = retHighest ? (computed <= value) : (computed < value);
	        }
	        if (setLow) {
	          low = mid + 1;
	        } else {
	          high = mid;
	        }
	      }
	      return nativeMin(high, MAX_ARRAY_INDEX);
	    }

	    /**
	     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without
	     * support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array} array The array to inspect.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @returns {Array} Returns the new duplicate free array.
	     */
	    function baseSortedUniq(array, iteratee) {
	      var index = -1,
	          length = array.length,
	          resIndex = 0,
	          result = [];

	      while (++index < length) {
	        var value = array[index],
	            computed = iteratee ? iteratee(value) : value;

	        if (!index || !eq(computed, seen)) {
	          var seen = computed;
	          result[resIndex++] = value === 0 ? 0 : value;
	        }
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.toNumber` which doesn't ensure correct
	     * conversions of binary, hexadecimal, or octal string values.
	     *
	     * @private
	     * @param {*} value The value to process.
	     * @returns {number} Returns the number.
	     */
	    function baseToNumber(value) {
	      if (typeof value == 'number') {
	        return value;
	      }
	      if (isSymbol(value)) {
	        return NAN;
	      }
	      return +value;
	    }

	    /**
	     * The base implementation of `_.toString` which doesn't convert nullish
	     * values to empty strings.
	     *
	     * @private
	     * @param {*} value The value to process.
	     * @returns {string} Returns the string.
	     */
	    function baseToString(value) {
	      // Exit early for strings to avoid a performance hit in some environments.
	      if (typeof value == 'string') {
	        return value;
	      }
	      if (isSymbol(value)) {
	        return symbolToString ? symbolToString.call(value) : '';
	      }
	      var result = (value + '');
	      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
	    }

	    /**
	     * The base implementation of `_.uniqBy` without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array} array The array to inspect.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new duplicate free array.
	     */
	    function baseUniq(array, iteratee, comparator) {
	      var index = -1,
	          includes = arrayIncludes,
	          length = array.length,
	          isCommon = true,
	          result = [],
	          seen = result;

	      if (comparator) {
	        isCommon = false;
	        includes = arrayIncludesWith;
	      }
	      else if (length >= LARGE_ARRAY_SIZE) {
	        var set = iteratee ? null : createSet(array);
	        if (set) {
	          return setToArray(set);
	        }
	        isCommon = false;
	        includes = cacheHas;
	        seen = new SetCache;
	      }
	      else {
	        seen = iteratee ? [] : result;
	      }
	      outer:
	      while (++index < length) {
	        var value = array[index],
	            computed = iteratee ? iteratee(value) : value;

	        value = (comparator || value !== 0) ? value : 0;
	        if (isCommon && computed === computed) {
	          var seenIndex = seen.length;
	          while (seenIndex--) {
	            if (seen[seenIndex] === computed) {
	              continue outer;
	            }
	          }
	          if (iteratee) {
	            seen.push(computed);
	          }
	          result.push(value);
	        }
	        else if (!includes(seen, computed, comparator)) {
	          if (seen !== result) {
	            seen.push(computed);
	          }
	          result.push(value);
	        }
	      }
	      return result;
	    }

	    /**
	     * The base implementation of `_.unset`.
	     *
	     * @private
	     * @param {Object} object The object to modify.
	     * @param {Array|string} path The path of the property to unset.
	     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
	     */
	    function baseUnset(object, path) {
	      path = isKey(path, object) ? [path] : castPath(path);
	      object = parent(object, path);

	      var key = toKey(last(path));
	      return !(object != null && baseHas(object, key)) || delete object[key];
	    }

	    /**
	     * The base implementation of `_.update`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the property to update.
	     * @param {Function} updater The function to produce the updated value.
	     * @param {Function} [customizer] The function to customize path creation.
	     * @returns {Object} Returns `object`.
	     */
	    function baseUpdate(object, path, updater, customizer) {
	      return baseSet(object, path, updater(baseGet(object, path)), customizer);
	    }

	    /**
	     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`
	     * without support for iteratee shorthands.
	     *
	     * @private
	     * @param {Array} array The array to query.
	     * @param {Function} predicate The function invoked per iteration.
	     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
	     * @param {boolean} [fromRight] Specify iterating from right to left.
	     * @returns {Array} Returns the slice of `array`.
	     */
	    function baseWhile(array, predicate, isDrop, fromRight) {
	      var length = array.length,
	          index = fromRight ? length : -1;

	      while ((fromRight ? index-- : ++index < length) &&
	        predicate(array[index], index, array)) {}

	      return isDrop
	        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
	        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
	    }

	    /**
	     * The base implementation of `wrapperValue` which returns the result of
	     * performing a sequence of actions on the unwrapped `value`, where each
	     * successive action is supplied the return value of the previous.
	     *
	     * @private
	     * @param {*} value The unwrapped value.
	     * @param {Array} actions Actions to perform to resolve the unwrapped value.
	     * @returns {*} Returns the resolved value.
	     */
	    function baseWrapperValue(value, actions) {
	      var result = value;
	      if (result instanceof LazyWrapper) {
	        result = result.value();
	      }
	      return arrayReduce(actions, function(result, action) {
	        return action.func.apply(action.thisArg, arrayPush([result], action.args));
	      }, result);
	    }

	    /**
	     * The base implementation of methods like `_.xor`, without support for
	     * iteratee shorthands, that accepts an array of arrays to inspect.
	     *
	     * @private
	     * @param {Array} arrays The arrays to inspect.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of values.
	     */
	    function baseXor(arrays, iteratee, comparator) {
	      var index = -1,
	          length = arrays.length;

	      while (++index < length) {
	        var result = result
	          ? arrayPush(
	              baseDifference(result, arrays[index], iteratee, comparator),
	              baseDifference(arrays[index], result, iteratee, comparator)
	            )
	          : arrays[index];
	      }
	      return (result && result.length) ? baseUniq(result, iteratee, comparator) : [];
	    }

	    /**
	     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
	     *
	     * @private
	     * @param {Array} props The property identifiers.
	     * @param {Array} values The property values.
	     * @param {Function} assignFunc The function to assign values.
	     * @returns {Object} Returns the new object.
	     */
	    function baseZipObject(props, values, assignFunc) {
	      var index = -1,
	          length = props.length,
	          valsLength = values.length,
	          result = {};

	      while (++index < length) {
	        var value = index < valsLength ? values[index] : undefined;
	        assignFunc(result, props[index], value);
	      }
	      return result;
	    }

	    /**
	     * Casts `value` to an empty array if it's not an array like object.
	     *
	     * @private
	     * @param {*} value The value to inspect.
	     * @returns {Array|Object} Returns the cast array-like object.
	     */
	    function castArrayLikeObject(value) {
	      return isArrayLikeObject(value) ? value : [];
	    }

	    /**
	     * Casts `value` to `identity` if it's not a function.
	     *
	     * @private
	     * @param {*} value The value to inspect.
	     * @returns {Function} Returns cast function.
	     */
	    function castFunction(value) {
	      return typeof value == 'function' ? value : identity;
	    }

	    /**
	     * Casts `value` to a path array if it's not one.
	     *
	     * @private
	     * @param {*} value The value to inspect.
	     * @returns {Array} Returns the cast property path array.
	     */
	    function castPath(value) {
	      return isArray(value) ? value : stringToPath(value);
	    }

	    /**
	     * Casts `array` to a slice if it's needed.
	     *
	     * @private
	     * @param {Array} array The array to inspect.
	     * @param {number} start The start position.
	     * @param {number} [end=array.length] The end position.
	     * @returns {Array} Returns the cast slice.
	     */
	    function castSlice(array, start, end) {
	      var length = array.length;
	      end = end === undefined ? length : end;
	      return (!start && end >= length) ? array : baseSlice(array, start, end);
	    }

	    /**
	     * Creates a clone of  `buffer`.
	     *
	     * @private
	     * @param {Buffer} buffer The buffer to clone.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @returns {Buffer} Returns the cloned buffer.
	     */
	    function cloneBuffer(buffer, isDeep) {
	      if (isDeep) {
	        return buffer.slice();
	      }
	      var result = new buffer.constructor(buffer.length);
	      buffer.copy(result);
	      return result;
	    }

	    /**
	     * Creates a clone of `arrayBuffer`.
	     *
	     * @private
	     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.
	     * @returns {ArrayBuffer} Returns the cloned array buffer.
	     */
	    function cloneArrayBuffer(arrayBuffer) {
	      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);
	      new Uint8Array(result).set(new Uint8Array(arrayBuffer));
	      return result;
	    }

	    /**
	     * Creates a clone of `dataView`.
	     *
	     * @private
	     * @param {Object} dataView The data view to clone.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @returns {Object} Returns the cloned data view.
	     */
	    function cloneDataView(dataView, isDeep) {
	      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
	      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
	    }

	    /**
	     * Creates a clone of `map`.
	     *
	     * @private
	     * @param {Object} map The map to clone.
	     * @param {Function} cloneFunc The function to clone values.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @returns {Object} Returns the cloned map.
	     */
	    function cloneMap(map, isDeep, cloneFunc) {
	      var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);
	      return arrayReduce(array, addMapEntry, new map.constructor);
	    }

	    /**
	     * Creates a clone of `regexp`.
	     *
	     * @private
	     * @param {Object} regexp The regexp to clone.
	     * @returns {Object} Returns the cloned regexp.
	     */
	    function cloneRegExp(regexp) {
	      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
	      result.lastIndex = regexp.lastIndex;
	      return result;
	    }

	    /**
	     * Creates a clone of `set`.
	     *
	     * @private
	     * @param {Object} set The set to clone.
	     * @param {Function} cloneFunc The function to clone values.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @returns {Object} Returns the cloned set.
	     */
	    function cloneSet(set, isDeep, cloneFunc) {
	      var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);
	      return arrayReduce(array, addSetEntry, new set.constructor);
	    }

	    /**
	     * Creates a clone of the `symbol` object.
	     *
	     * @private
	     * @param {Object} symbol The symbol object to clone.
	     * @returns {Object} Returns the cloned symbol object.
	     */
	    function cloneSymbol(symbol) {
	      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
	    }

	    /**
	     * Creates a clone of `typedArray`.
	     *
	     * @private
	     * @param {Object} typedArray The typed array to clone.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @returns {Object} Returns the cloned typed array.
	     */
	    function cloneTypedArray(typedArray, isDeep) {
	      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
	      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
	    }

	    /**
	     * Compares values to sort them in ascending order.
	     *
	     * @private
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {number} Returns the sort order indicator for `value`.
	     */
	    function compareAscending(value, other) {
	      if (value !== other) {
	        var valIsDefined = value !== undefined,
	            valIsNull = value === null,
	            valIsReflexive = value === value,
	            valIsSymbol = isSymbol(value);

	        var othIsDefined = other !== undefined,
	            othIsNull = other === null,
	            othIsReflexive = other === other,
	            othIsSymbol = isSymbol(other);

	        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||
	            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||
	            (valIsNull && othIsDefined && othIsReflexive) ||
	            (!valIsDefined && othIsReflexive) ||
	            !valIsReflexive) {
	          return 1;
	        }
	        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||
	            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||
	            (othIsNull && valIsDefined && valIsReflexive) ||
	            (!othIsDefined && valIsReflexive) ||
	            !othIsReflexive) {
	          return -1;
	        }
	      }
	      return 0;
	    }

	    /**
	     * Used by `_.orderBy` to compare multiple properties of a value to another
	     * and stable sort them.
	     *
	     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,
	     * specify an order of "desc" for descending or "asc" for ascending sort order
	     * of corresponding values.
	     *
	     * @private
	     * @param {Object} object The object to compare.
	     * @param {Object} other The other object to compare.
	     * @param {boolean[]|string[]} orders The order to sort by for each property.
	     * @returns {number} Returns the sort order indicator for `object`.
	     */
	    function compareMultiple(object, other, orders) {
	      var index = -1,
	          objCriteria = object.criteria,
	          othCriteria = other.criteria,
	          length = objCriteria.length,
	          ordersLength = orders.length;

	      while (++index < length) {
	        var result = compareAscending(objCriteria[index], othCriteria[index]);
	        if (result) {
	          if (index >= ordersLength) {
	            return result;
	          }
	          var order = orders[index];
	          return result * (order == 'desc' ? -1 : 1);
	        }
	      }
	      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
	      // that causes it, under certain circumstances, to provide the same value for
	      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
	      // for more details.
	      //
	      // This also ensures a stable sort in V8 and other engines.
	      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
	      return object.index - other.index;
	    }

	    /**
	     * Creates an array that is the composition of partially applied arguments,
	     * placeholders, and provided arguments into a single array of arguments.
	     *
	     * @private
	     * @param {Array} args The provided arguments.
	     * @param {Array} partials The arguments to prepend to those provided.
	     * @param {Array} holders The `partials` placeholder indexes.
	     * @params {boolean} [isCurried] Specify composing for a curried function.
	     * @returns {Array} Returns the new array of composed arguments.
	     */
	    function composeArgs(args, partials, holders, isCurried) {
	      var argsIndex = -1,
	          argsLength = args.length,
	          holdersLength = holders.length,
	          leftIndex = -1,
	          leftLength = partials.length,
	          rangeLength = nativeMax(argsLength - holdersLength, 0),
	          result = Array(leftLength + rangeLength),
	          isUncurried = !isCurried;

	      while (++leftIndex < leftLength) {
	        result[leftIndex] = partials[leftIndex];
	      }
	      while (++argsIndex < holdersLength) {
	        if (isUncurried || argsIndex < argsLength) {
	          result[holders[argsIndex]] = args[argsIndex];
	        }
	      }
	      while (rangeLength--) {
	        result[leftIndex++] = args[argsIndex++];
	      }
	      return result;
	    }

	    /**
	     * This function is like `composeArgs` except that the arguments composition
	     * is tailored for `_.partialRight`.
	     *
	     * @private
	     * @param {Array} args The provided arguments.
	     * @param {Array} partials The arguments to append to those provided.
	     * @param {Array} holders The `partials` placeholder indexes.
	     * @params {boolean} [isCurried] Specify composing for a curried function.
	     * @returns {Array} Returns the new array of composed arguments.
	     */
	    function composeArgsRight(args, partials, holders, isCurried) {
	      var argsIndex = -1,
	          argsLength = args.length,
	          holdersIndex = -1,
	          holdersLength = holders.length,
	          rightIndex = -1,
	          rightLength = partials.length,
	          rangeLength = nativeMax(argsLength - holdersLength, 0),
	          result = Array(rangeLength + rightLength),
	          isUncurried = !isCurried;

	      while (++argsIndex < rangeLength) {
	        result[argsIndex] = args[argsIndex];
	      }
	      var offset = argsIndex;
	      while (++rightIndex < rightLength) {
	        result[offset + rightIndex] = partials[rightIndex];
	      }
	      while (++holdersIndex < holdersLength) {
	        if (isUncurried || argsIndex < argsLength) {
	          result[offset + holders[holdersIndex]] = args[argsIndex++];
	        }
	      }
	      return result;
	    }

	    /**
	     * Copies the values of `source` to `array`.
	     *
	     * @private
	     * @param {Array} source The array to copy values from.
	     * @param {Array} [array=[]] The array to copy values to.
	     * @returns {Array} Returns `array`.
	     */
	    function copyArray(source, array) {
	      var index = -1,
	          length = source.length;

	      array || (array = Array(length));
	      while (++index < length) {
	        array[index] = source[index];
	      }
	      return array;
	    }

	    /**
	     * Copies properties of `source` to `object`.
	     *
	     * @private
	     * @param {Object} source The object to copy properties from.
	     * @param {Array} props The property identifiers to copy.
	     * @param {Object} [object={}] The object to copy properties to.
	     * @param {Function} [customizer] The function to customize copied values.
	     * @returns {Object} Returns `object`.
	     */
	    function copyObject(source, props, object, customizer) {
	      object || (object = {});

	      var index = -1,
	          length = props.length;

	      while (++index < length) {
	        var key = props[index];

	        var newValue = customizer
	          ? customizer(object[key], source[key], key, object, source)
	          : source[key];

	        assignValue(object, key, newValue);
	      }
	      return object;
	    }

	    /**
	     * Copies own symbol properties of `source` to `object`.
	     *
	     * @private
	     * @param {Object} source The object to copy symbols from.
	     * @param {Object} [object={}] The object to copy symbols to.
	     * @returns {Object} Returns `object`.
	     */
	    function copySymbols(source, object) {
	      return copyObject(source, getSymbols(source), object);
	    }

	    /**
	     * Creates a function like `_.groupBy`.
	     *
	     * @private
	     * @param {Function} setter The function to set accumulator values.
	     * @param {Function} [initializer] The accumulator object initializer.
	     * @returns {Function} Returns the new aggregator function.
	     */
	    function createAggregator(setter, initializer) {
	      return function(collection, iteratee) {
	        var func = isArray(collection) ? arrayAggregator : baseAggregator,
	            accumulator = initializer ? initializer() : {};

	        return func(collection, setter, getIteratee(iteratee), accumulator);
	      };
	    }

	    /**
	     * Creates a function like `_.assign`.
	     *
	     * @private
	     * @param {Function} assigner The function to assign values.
	     * @returns {Function} Returns the new assigner function.
	     */
	    function createAssigner(assigner) {
	      return rest(function(object, sources) {
	        var index = -1,
	            length = sources.length,
	            customizer = length > 1 ? sources[length - 1] : undefined,
	            guard = length > 2 ? sources[2] : undefined;

	        customizer = (assigner.length > 3 && typeof customizer == 'function')
	          ? (length--, customizer)
	          : undefined;

	        if (guard && isIterateeCall(sources[0], sources[1], guard)) {
	          customizer = length < 3 ? undefined : customizer;
	          length = 1;
	        }
	        object = Object(object);
	        while (++index < length) {
	          var source = sources[index];
	          if (source) {
	            assigner(object, source, index, customizer);
	          }
	        }
	        return object;
	      });
	    }

	    /**
	     * Creates a `baseEach` or `baseEachRight` function.
	     *
	     * @private
	     * @param {Function} eachFunc The function to iterate over a collection.
	     * @param {boolean} [fromRight] Specify iterating from right to left.
	     * @returns {Function} Returns the new base function.
	     */
	    function createBaseEach(eachFunc, fromRight) {
	      return function(collection, iteratee) {
	        if (collection == null) {
	          return collection;
	        }
	        if (!isArrayLike(collection)) {
	          return eachFunc(collection, iteratee);
	        }
	        var length = collection.length,
	            index = fromRight ? length : -1,
	            iterable = Object(collection);

	        while ((fromRight ? index-- : ++index < length)) {
	          if (iteratee(iterable[index], index, iterable) === false) {
	            break;
	          }
	        }
	        return collection;
	      };
	    }

	    /**
	     * Creates a base function for methods like `_.forIn` and `_.forOwn`.
	     *
	     * @private
	     * @param {boolean} [fromRight] Specify iterating from right to left.
	     * @returns {Function} Returns the new base function.
	     */
	    function createBaseFor(fromRight) {
	      return function(object, iteratee, keysFunc) {
	        var index = -1,
	            iterable = Object(object),
	            props = keysFunc(object),
	            length = props.length;

	        while (length--) {
	          var key = props[fromRight ? length : ++index];
	          if (iteratee(iterable[key], key, iterable) === false) {
	            break;
	          }
	        }
	        return object;
	      };
	    }

	    /**
	     * Creates a function that wraps `func` to invoke it with the optional `this`
	     * binding of `thisArg`.
	     *
	     * @private
	     * @param {Function} func The function to wrap.
	     * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
	     *  for more details.
	     * @param {*} [thisArg] The `this` binding of `func`.
	     * @returns {Function} Returns the new wrapped function.
	     */
	    function createBaseWrapper(func, bitmask, thisArg) {
	      var isBind = bitmask & BIND_FLAG,
	          Ctor = createCtorWrapper(func);

	      function wrapper() {
	        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
	        return fn.apply(isBind ? thisArg : this, arguments);
	      }
	      return wrapper;
	    }

	    /**
	     * Creates a function like `_.lowerFirst`.
	     *
	     * @private
	     * @param {string} methodName The name of the `String` case method to use.
	     * @returns {Function} Returns the new case function.
	     */
	    function createCaseFirst(methodName) {
	      return function(string) {
	        string = toString(string);

	        var strSymbols = reHasComplexSymbol.test(string)
	          ? stringToArray(string)
	          : undefined;

	        var chr = strSymbols
	          ? strSymbols[0]
	          : string.charAt(0);

	        var trailing = strSymbols
	          ? castSlice(strSymbols, 1).join('')
	          : string.slice(1);

	        return chr[methodName]() + trailing;
	      };
	    }

	    /**
	     * Creates a function like `_.camelCase`.
	     *
	     * @private
	     * @param {Function} callback The function to combine each word.
	     * @returns {Function} Returns the new compounder function.
	     */
	    function createCompounder(callback) {
	      return function(string) {
	        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');
	      };
	    }

	    /**
	     * Creates a function that produces an instance of `Ctor` regardless of
	     * whether it was invoked as part of a `new` expression or by `call` or `apply`.
	     *
	     * @private
	     * @param {Function} Ctor The constructor to wrap.
	     * @returns {Function} Returns the new wrapped function.
	     */
	    function 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 function that wraps `func` to enable currying.
	     *
	     * @private
	     * @param {Function} func The function to wrap.
	     * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
	     *  for more details.
	     * @param {number} arity The arity of `func`.
	     * @returns {Function} Returns the new wrapped function.
	     */
	    function createCurryWrapper(func, bitmask, arity) {
	      var Ctor = createCtorWrapper(func);

	      function wrapper() {
	        var length = arguments.length,
	            args = Array(length),
	            index = length,
	            placeholder = getHolder(wrapper);

	        while (index--) {
	          args[index] = arguments[index];
	        }
	        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)
	          ? []
	          : replaceHolders(args, placeholder);

	        length -= holders.length;
	        if (length < arity) {
	          return createRecurryWrapper(
	            func, bitmask, createHybridWrapper, wrapper.placeholder, undefined,
	            args, holders, undefined, undefined, arity - length);
	        }
	        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
	        return apply(fn, this, args);
	      }
	      return wrapper;
	    }

	    /**
	     * Creates a `_.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 rest(function(funcs) {
	        funcs = baseFlatten(funcs, 1);

	        var length = funcs.length,
	            index = length,
	            prereq = LodashWrapper.prototype.thru;

	        if (fromRight) {
	          funcs.reverse();
	        }
	        while (index--) {
	          var func = funcs[index];
	          if (typeof func != 'function') {
	            throw new TypeError(FUNC_ERROR_TEXT);
	          }
	          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {
	            var wrapper = new LodashWrapper([], true);
	          }
	        }
	        index = wrapper ? index : length;
	        while (++index < length) {
	          func = funcs[index];

	          var funcName = getFuncName(func),
	              data = funcName == 'wrapper' ? getData(func) : undefined;

	          if (data && isLaziable(data[0]) &&
	                data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) &&
	                !data[4].length && data[9] == 1
	              ) {
	            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
	          } else {
	            wrapper = (func.length == 1 && isLaziable(func))
	              ? wrapper[funcName]()
	              : wrapper.thru(func);
	          }
	        }
	        return function() {
	          var args = arguments,
	              value = args[0];

	          if (wrapper && args.length == 1 &&
	              isArray(value) && value.length >= LARGE_ARRAY_SIZE) {
	            return wrapper.plant(value).value();
	          }
	          var index = 0,
	              result = length ? funcs[index].apply(this, args) : value;

	          while (++index < length) {
	            result = funcs[index].call(this, result);
	          }
	          return result;
	        };
	      });
	    }

	    /**
	     * Creates a function that wraps `func` to invoke it with optional `this`
	     * binding of `thisArg`, partial application, and currying.
	     *
	     * @private
	     * @param {Function|string} func The function or method name to wrap.
	     * @param {number} bitmask The bitmask of wrapper 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,
	          isCurried = bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG),
	          isFlip = bitmask & FLIP_FLAG,
	          Ctor = isBindKey ? undefined : createCtorWrapper(func);

	      function wrapper() {
	        var length = arguments.length,
	            args = Array(length),
	            index = length;

	        while (index--) {
	          args[index] = arguments[index];
	        }
	        if (isCurried) {
	          var placeholder = getHolder(wrapper),
	              holdersCount = countHolders(args, placeholder);
	        }
	        if (partials) {
	          args = composeArgs(args, partials, holders, isCurried);
	        }
	        if (partialsRight) {
	          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);
	        }
	        length -= holdersCount;
	        if (isCurried && length < arity) {
	          var newHolders = replaceHolders(args, placeholder);
	          return createRecurryWrapper(
	            func, bitmask, createHybridWrapper, wrapper.placeholder, thisArg,
	            args, newHolders, argPos, ary, arity - length
	          );
	        }
	        var thisBinding = isBind ? thisArg : this,
	            fn = isBindKey ? thisBinding[func] : func;

	        length = args.length;
	        if (argPos) {
	          args = reorder(args, argPos);
	        } else if (isFlip && length > 1) {
	          args.reverse();
	        }
	        if (isAry && ary < length) {
	          args.length = ary;
	        }
	        if (this && this !== root && this instanceof wrapper) {
	          fn = Ctor || createCtorWrapper(fn);
	        }
	        return fn.apply(thisBinding, args);
	      }
	      return wrapper;
	    }

	    /**
	     * Creates a function like `_.invertBy`.
	     *
	     * @private
	     * @param {Function} setter The function to set accumulator values.
	     * @param {Function} toIteratee The function to resolve iteratees.
	     * @returns {Function} Returns the new inverter function.
	     */
	    function createInverter(setter, toIteratee) {
	      return function(object, iteratee) {
	        return baseInverter(object, setter, toIteratee(iteratee), {});
	      };
	    }

	    /**
	     * Creates a function that performs a mathematical operation on two values.
	     *
	     * @private
	     * @param {Function} operator The function to perform the operation.
	     * @returns {Function} Returns the new mathematical operation function.
	     */
	    function createMathOperation(operator) {
	      return function(value, other) {
	        var result;
	        if (value === undefined && other === undefined) {
	          return 0;
	        }
	        if (value !== undefined) {
	          result = value;
	        }
	        if (other !== undefined) {
	          if (result === undefined) {
	            return other;
	          }
	          if (typeof value == 'string' || typeof other == 'string') {
	            value = baseToString(value);
	            other = baseToString(other);
	          } else {
	            value = baseToNumber(value);
	            other = baseToNumber(other);
	          }
	          result = operator(value, other);
	        }
	        return result;
	      };
	    }

	    /**
	     * Creates a function like `_.over`.
	     *
	     * @private
	     * @param {Function} arrayFunc The function to iterate over iteratees.
	     * @returns {Function} Returns the new over function.
	     */
	    function createOver(arrayFunc) {
	      return rest(function(iteratees) {
	        iteratees = (iteratees.length == 1 && isArray(iteratees[0]))
	          ? arrayMap(iteratees[0], baseUnary(getIteratee()))
	          : arrayMap(baseFlatten(iteratees, 1, isFlattenableIteratee), baseUnary(getIteratee()));

	        return rest(function(args) {
	          var thisArg = this;
	          return arrayFunc(iteratees, function(iteratee) {
	            return apply(iteratee, thisArg, args);
	          });
	        });
	      });
	    }

	    /**
	     * Creates the padding for `string` based on `length`. The `chars` string
	     * is truncated if the number of characters exceeds `length`.
	     *
	     * @private
	     * @param {number} length The padding length.
	     * @param {string} [chars=' '] The string used as padding.
	     * @returns {string} Returns the padding for `string`.
	     */
	    function createPadding(length, chars) {
	      chars = chars === undefined ? ' ' : baseToString(chars);

	      var charsLength = chars.length;
	      if (charsLength < 2) {
	        return charsLength ? baseRepeat(chars, length) : chars;
	      }
	      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));
	      return reHasComplexSymbol.test(chars)
	        ? castSlice(stringToArray(result), 0, length).join('')
	        : result.slice(0, length);
	    }

	    /**
	     * Creates a function that wraps `func` to invoke it with the `this` binding
	     * of `thisArg` and `partials` prepended to the arguments it receives.
	     *
	     * @private
	     * @param {Function} func The function to wrap.
	     * @param {number} bitmask The bitmask of wrapper 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 wrapped function.
	     */
	    function createPartialWrapper(func, bitmask, thisArg, partials) {
	      var isBind = bitmask & BIND_FLAG,
	          Ctor = createCtorWrapper(func);

	      function wrapper() {
	        var argsIndex = -1,
	            argsLength = arguments.length,
	            leftIndex = -1,
	            leftLength = partials.length,
	            args = Array(leftLength + argsLength),
	            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;

	        while (++leftIndex < leftLength) {
	          args[leftIndex] = partials[leftIndex];
	        }
	        while (argsLength--) {
	          args[leftIndex++] = arguments[++argsIndex];
	        }
	        return apply(fn, isBind ? thisArg : this, args);
	      }
	      return wrapper;
	    }

	    /**
	     * Creates a `_.range` or `_.rangeRight` function.
	     *
	     * @private
	     * @param {boolean} [fromRight] Specify iterating from right to left.
	     * @returns {Function} Returns the new range function.
	     */
	    function createRange(fromRight) {
	      return function(start, end, step) {
	        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {
	          end = step = undefined;
	        }
	        // Ensure the sign of `-0` is preserved.
	        start = toNumber(start);
	        start = start === start ? start : 0;
	        if (end === undefined) {
	          end = start;
	          start = 0;
	        } else {
	          end = toNumber(end) || 0;
	        }
	        step = step === undefined ? (start < end ? 1 : -1) : (toNumber(step) || 0);
	        return baseRange(start, end, step, fromRight);
	      };
	    }

	    /**
	     * Creates a function that performs a relational operation on two values.
	     *
	     * @private
	     * @param {Function} operator The function to perform the operation.
	     * @returns {Function} Returns the new relational operation function.
	     */
	    function createRelationalOperation(operator) {
	      return function(value, other) {
	        if (!(typeof value == 'string' && typeof other == 'string')) {
	          value = toNumber(value);
	          other = toNumber(other);
	        }
	        return operator(value, other);
	      };
	    }

	    /**
	     * Creates a function that wraps `func` to continue currying.
	     *
	     * @private
	     * @param {Function} func The function to wrap.
	     * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
	     *  for more details.
	     * @param {Function} wrapFunc The function to create the `func` wrapper.
	     * @param {*} placeholder The placeholder value.
	     * @param {*} [thisArg] The `this` binding of `func`.
	     * @param {Array} [partials] The arguments to prepend to those provided to
	     *  the new function.
	     * @param {Array} [holders] The `partials` placeholder indexes.
	     * @param {Array} [argPos] The argument positions of the new function.
	     * @param {number} [ary] The arity cap of `func`.
	     * @param {number} [arity] The arity of `func`.
	     * @returns {Function} Returns the new wrapped function.
	     */
	    function createRecurryWrapper(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {
	      var isCurry = bitmask & CURRY_FLAG,
	          newHolders = isCurry ? holders : undefined,
	          newHoldersRight = isCurry ? undefined : holders,
	          newPartials = isCurry ? partials : undefined,
	          newPartialsRight = isCurry ? undefined : partials;

	      bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG);
	      bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG);

	      if (!(bitmask & CURRY_BOUND_FLAG)) {
	        bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
	      }
	      var newData = [
	        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,
	        newHoldersRight, argPos, ary, arity
	      ];

	      var result = wrapFunc.apply(undefined, newData);
	      if (isLaziable(func)) {
	        setData(result, newData);
	      }
	      result.placeholder = placeholder;
	      return result;
	    }

	    /**
	     * Creates a function like `_.round`.
	     *
	     * @private
	     * @param {string} methodName The name of the `Math` method to use when rounding.
	     * @returns {Function} Returns the new round function.
	     */
	    function createRound(methodName) {
	      var func = Math[methodName];
	      return function(number, precision) {
	        number = toNumber(number);
	        precision = toInteger(precision);
	        if (precision) {
	          // Shift with exponential notation to avoid floating-point issues.
	          // See [MDN](https://mdn.io/round#Examples) for more details.
	          var pair = (toString(number) + 'e').split('e'),
	              value = func(pair[0] + 'e' + (+pair[1] + precision));

	          pair = (toString(value) + 'e').split('e');
	          return +(pair[0] + 'e' + (+pair[1] - precision));
	        }
	        return func(number);
	      };
	    }

	    /**
	     * Creates a set of `values`.
	     *
	     * @private
	     * @param {Array} values The values to add to the set.
	     * @returns {Object} Returns the new set.
	     */
	    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {
	      return new Set(values);
	    };

	    /**
	     * Creates a `_.toPairs` or `_.toPairsIn` function.
	     *
	     * @private
	     * @param {Function} keysFunc The function to get the keys of a given object.
	     * @returns {Function} Returns the new pairs function.
	     */
	    function createToPairs(keysFunc) {
	      return function(object) {
	        var tag = getTag(object);
	        if (tag == mapTag) {
	          return mapToArray(object);
	        }
	        if (tag == setTag) {
	          return setToPairs(object);
	        }
	        return baseToPairs(object, keysFunc(object));
	      };
	    }

	    /**
	     * Creates a function that either curries or invokes `func` with optional
	     * `this` binding and partially applied arguments.
	     *
	     * @private
	     * @param {Function|string} func The function or method name to wrap.
	     * @param {number} bitmask The bitmask of wrapper flags.
	     *  The bitmask may be composed of the following flags:
	     *     1 - `_.bind`
	     *     2 - `_.bindKey`
	     *     4 - `_.curry` or `_.curryRight` of a bound function
	     *     8 - `_.curry`
	     *    16 - `_.curryRight`
	     *    32 - `_.partial`
	     *    64 - `_.partialRight`
	     *   128 - `_.rearg`
	     *   256 - `_.ary`
	     *   512 - `_.flip`
	     * @param {*} [thisArg] The `this` binding of `func`.
	     * @param {Array} [partials] The arguments to be partially applied.
	     * @param {Array} [holders] The `partials` placeholder indexes.
	     * @param {Array} [argPos] The argument positions of the new function.
	     * @param {number} [ary] The arity cap of `func`.
	     * @param {number} [arity] The arity of `func`.
	     * @returns {Function} Returns the new wrapped function.
	     */
	    function 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;
	      }
	      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);
	      arity = arity === undefined ? arity : toInteger(arity);
	      length -= holders ? holders.length : 0;

	      if (bitmask & PARTIAL_RIGHT_FLAG) {
	        var partialsRight = partials,
	            holdersRight = holders;

	        partials = holders = undefined;
	      }
	      var data = isBindKey ? undefined : getData(func);

	      var newData = [
	        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
	        argPos, ary, arity
	      ];

	      if (data) {
	        mergeData(newData, data);
	      }
	      func = newData[0];
	      bitmask = newData[1];
	      thisArg = newData[2];
	      partials = newData[3];
	      holders = newData[4];
	      arity = newData[9] = newData[9] == null
	        ? (isBindKey ? 0 : func.length)
	        : nativeMax(newData[9] - length, 0);

	      if (!arity && bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG)) {
	        bitmask &= ~(CURRY_FLAG | CURRY_RIGHT_FLAG);
	      }
	      if (!bitmask || bitmask == BIND_FLAG) {
	        var result = createBaseWrapper(func, bitmask, thisArg);
	      } else if (bitmask == CURRY_FLAG || bitmask == CURRY_RIGHT_FLAG) {
	        result = createCurryWrapper(func, bitmask, arity);
	      } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !holders.length) {
	        result = createPartialWrapper(func, bitmask, thisArg, partials);
	      } 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 comparisons.
	     * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
	     *  for more details.
	     * @param {Object} stack Tracks traversed `array` and `other` objects.
	     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
	     */
	    function equalArrays(array, other, equalFunc, customizer, bitmask, stack) {
	      var isPartial = bitmask & PARTIAL_COMPARE_FLAG,
	          arrLength = array.length,
	          othLength = other.length;

	      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
	        return false;
	      }
	      // Assume cyclic values are equal.
	      var stacked = stack.get(array);
	      if (stacked) {
	        return stacked == other;
	      }
	      var index = -1,
	          result = true,
	          seen = (bitmask & UNORDERED_COMPARE_FLAG) ? new SetCache : undefined;

	      stack.set(array, other);

	      // Ignore non-index properties.
	      while (++index < arrLength) {
	        var arrValue = array[index],
	            othValue = other[index];

	        if (customizer) {
	          var compared = isPartial
	            ? customizer(othValue, arrValue, index, other, array, stack)
	            : customizer(arrValue, othValue, index, array, other, stack);
	        }
	        if (compared !== undefined) {
	          if (compared) {
	            continue;
	          }
	          result = false;
	          break;
	        }
	        // Recursively compare arrays (susceptible to call stack limits).
	        if (seen) {
	          if (!arraySome(other, function(othValue, othIndex) {
	                if (!seen.has(othIndex) &&
	                    (arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack))) {
	                  return seen.add(othIndex);
	                }
	              })) {
	            result = false;
	            break;
	          }
	        } else if (!(
	              arrValue === othValue ||
	                equalFunc(arrValue, othValue, customizer, bitmask, stack)
	            )) {
	          result = false;
	          break;
	        }
	      }
	      stack['delete'](array);
	      return result;
	    }

	    /**
	     * A specialized version of `baseIsEqualDeep` for comparing objects of
	     * the same `toStringTag`.
	     *
	     * **Note:** This function only supports comparing values with tags of
	     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
	     *
	     * @private
	     * @param {Object} object The object to compare.
	     * @param {Object} other The other object to compare.
	     * @param {string} tag The `toStringTag` of the objects to compare.
	     * @param {Function} equalFunc The function to determine equivalents of values.
	     * @param {Function} customizer The function to customize comparisons.
	     * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
	     *  for more details.
	     * @param {Object} stack Tracks traversed `object` and `other` objects.
	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
	     */
	    function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) {
	      switch (tag) {
	        case dataViewTag:
	          if ((object.byteLength != other.byteLength) ||
	              (object.byteOffset != other.byteOffset)) {
	            return false;
	          }
	          object = object.buffer;
	          other = other.buffer;

	        case arrayBufferTag:
	          if ((object.byteLength != other.byteLength) ||
	              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
	            return false;
	          }
	          return true;

	        case boolTag:
	        case dateTag:
	          // 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 objects,
	          // as equal. See http://www.ecma-international.org/ecma-262/6.0/#sec-regexp.prototype.tostring
	          // for more details.
	          return object == (other + '');

	        case mapTag:
	          var convert = mapToArray;

	        case setTag:
	          var isPartial = bitmask & PARTIAL_COMPARE_FLAG;
	          convert || (convert = setToArray);

	          if (object.size != other.size && !isPartial) {
	            return false;
	          }
	          // Assume cyclic values are equal.
	          var stacked = stack.get(object);
	          if (stacked) {
	            return stacked == other;
	          }
	          bitmask |= UNORDERED_COMPARE_FLAG;
	          stack.set(object, other);

	          // Recursively compare objects (susceptible to call stack limits).
	          return equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack);

	        case symbolTag:
	          if (symbolValueOf) {
	            return symbolValueOf.call(object) == symbolValueOf.call(other);
	          }
	      }
	      return false;
	    }

	    /**
	     * A specialized version of `baseIsEqualDeep` for objects with support for
	     * partial deep comparisons.
	     *
	     * @private
	     * @param {Object} object The object to compare.
	     * @param {Object} other The other object to compare.
	     * @param {Function} equalFunc The function to determine equivalents of values.
	     * @param {Function} customizer The function to customize comparisons.
	     * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`
	     *  for more details.
	     * @param {Object} stack Tracks traversed `object` and `other` objects.
	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
	     */
	    function equalObjects(object, other, equalFunc, customizer, bitmask, stack) {
	      var isPartial = bitmask & PARTIAL_COMPARE_FLAG,
	          objProps = keys(object),
	          objLength = objProps.length,
	          othProps = keys(other),
	          othLength = othProps.length;

	      if (objLength != othLength && !isPartial) {
	        return false;
	      }
	      var index = objLength;
	      while (index--) {
	        var key = objProps[index];
	        if (!(isPartial ? key in other : baseHas(other, key))) {
	          return false;
	        }
	      }
	      // Assume cyclic values are equal.
	      var stacked = stack.get(object);
	      if (stacked) {
	        return stacked == other;
	      }
	      var result = true;
	      stack.set(object, other);

	      var skipCtor = isPartial;
	      while (++index < objLength) {
	        key = objProps[index];
	        var objValue = object[key],
	            othValue = other[key];

	        if (customizer) {
	          var compared = isPartial
	            ? customizer(othValue, objValue, key, other, object, stack)
	            : customizer(objValue, othValue, key, object, other, stack);
	        }
	        // Recursively compare objects (susceptible to call stack limits).
	        if (!(compared === undefined
	              ? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack))
	              : compared
	            )) {
	          result = false;
	          break;
	        }
	        skipCtor || (skipCtor = key == 'constructor');
	      }
	      if (result && !skipCtor) {
	        var objCtor = object.constructor,
	            othCtor = other.constructor;

	        // Non `Object` object instances with different constructors are not equal.
	        if (objCtor != othCtor &&
	            ('constructor' in object && 'constructor' in other) &&
	            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
	              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
	          result = false;
	        }
	      }
	      stack['delete'](object);
	      return result;
	    }

	    /**
	     * Creates an array of own enumerable property names and symbols of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property names and symbols.
	     */
	    function getAllKeys(object) {
	      return baseGetAllKeys(object, keys, getSymbols);
	    }

	    /**
	     * Creates an array of own and inherited enumerable property names and
	     * symbols of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property names and symbols.
	     */
	    function getAllKeysIn(object) {
	      return baseGetAllKeys(object, keysIn, getSymbolsIn);
	    }

	    /**
	     * Gets metadata for `func`.
	     *
	     * @private
	     * @param {Function} func The function to query.
	     * @returns {*} Returns the metadata for `func`.
	     */
	    var getData = !metaMap ? noop : function(func) {
	      return metaMap.get(func);
	    };

	    /**
	     * Gets the name of `func`.
	     *
	     * @private
	     * @param {Function} func The function to query.
	     * @returns {string} Returns the function name.
	     */
	    function getFuncName(func) {
	      var result = (func.name + ''),
	          array = realNames[result],
	          length = hasOwnProperty.call(realNames, result) ? array.length : 0;

	      while (length--) {
	        var data = array[length],
	            otherFunc = data.func;
	        if (otherFunc == null || otherFunc == func) {
	          return data.name;
	        }
	      }
	      return result;
	    }

	    /**
	     * Gets the argument placeholder value for `func`.
	     *
	     * @private
	     * @param {Function} func The function to inspect.
	     * @returns {*} Returns the placeholder value.
	     */
	    function getHolder(func) {
	      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;
	      return object.placeholder;
	    }

	    /**
	     * Gets the appropriate "iteratee" function. If `_.iteratee` is customized,
	     * this function returns the custom method, otherwise it returns `baseIteratee`.
	     * If arguments are provided, the chosen function is invoked with them and
	     * its result is returned.
	     *
	     * @private
	     * @param {*} [value] The value to convert to an iteratee.
	     * @param {number} [arity] The arity of the created iteratee.
	     * @returns {Function} Returns the chosen function or its result.
	     */
	    function getIteratee() {
	      var result = lodash.iteratee || iteratee;
	      result = result === iteratee ? baseIteratee : result;
	      return arguments.length ? result(arguments[0], arguments[1]) : result;
	    }

	    /**
	     * Gets the "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 data for `map`.
	     *
	     * @private
	     * @param {Object} map The map to query.
	     * @param {string} key The reference key.
	     * @returns {*} Returns the map data.
	     */
	    function getMapData(map, key) {
	      var data = map.__data__;
	      return isKeyable(key)
	        ? data[typeof key == 'string' ? 'string' : 'hash']
	        : data.map;
	    }

	    /**
	     * Gets the property names, values, and compare flags of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the match data of `object`.
	     */
	    function getMatchData(object) {
	      var result = toPairs(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[key];
	      return isNative(value) ? value : undefined;
	    }

	    /**
	     * Gets the `[[Prototype]]` of `value`.
	     *
	     * @private
	     * @param {*} value The value to query.
	     * @returns {null|Object} Returns the `[[Prototype]]`.
	     */
	    function getPrototype(value) {
	      return nativeGetPrototype(Object(value));
	    }

	    /**
	     * Creates an array of the own enumerable symbol properties of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of symbols.
	     */
	    function getSymbols(object) {
	      // Coerce `object` to an object to avoid non-object errors in V8.
	      // See https://bugs.chromium.org/p/v8/issues/detail?id=3443 for more details.
	      return getOwnPropertySymbols(Object(object));
	    }

	    // Fallback for IE < 11.
	    if (!getOwnPropertySymbols) {
	      getSymbols = function() {
	        return [];
	      };
	    }

	    /**
	     * Creates an array of the own and inherited enumerable symbol properties
	     * of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of symbols.
	     */
	    var getSymbolsIn = !getOwnPropertySymbols ? getSymbols : function(object) {
	      var result = [];
	      while (object) {
	        arrayPush(result, getSymbols(object));
	        object = getPrototype(object);
	      }
	      return result;
	    };

	    /**
	     * Gets the `toStringTag` of `value`.
	     *
	     * @private
	     * @param {*} value The value to query.
	     * @returns {string} Returns the `toStringTag`.
	     */
	    function getTag(value) {
	      return objectToString.call(value);
	    }

	    // Fallback for data views, maps, sets, and weak maps in IE 11,
	    // for data views in Edge, and promises in Node.js.
	    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
	        (Map && getTag(new Map) != mapTag) ||
	        (Promise && getTag(Promise.resolve()) != promiseTag) ||
	        (Set && getTag(new Set) != setTag) ||
	        (WeakMap && getTag(new WeakMap) != weakMapTag)) {
	      getTag = function(value) {
	        var result = objectToString.call(value),
	            Ctor = result == objectTag ? value.constructor : undefined,
	            ctorString = Ctor ? toSource(Ctor) : undefined;

	        if (ctorString) {
	          switch (ctorString) {
	            case dataViewCtorString: return dataViewTag;
	            case mapCtorString: return mapTag;
	            case promiseCtorString: return promiseTag;
	            case setCtorString: return setTag;
	            case weakMapCtorString: return weakMapTag;
	          }
	        }
	        return result;
	      };
	    }

	    /**
	     * Gets the view, applying any `transforms` to the `start` and `end` positions.
	     *
	     * @private
	     * @param {number} start The start of the view.
	     * @param {number} end The end of the view.
	     * @param {Array} transforms The transformations to apply to the view.
	     * @returns {Object} Returns an object containing the `start` and `end`
	     *  positions of the view.
	     */
	    function getView(start, end, transforms) {
	      var index = -1,
	          length = transforms.length;

	      while (++index < length) {
	        var data = transforms[index],
	            size = data.size;

	        switch (data.type) {
	          case 'drop':      start += size; break;
	          case 'dropRight': end -= size; break;
	          case 'take':      end = nativeMin(end, start + size); break;
	          case 'takeRight': start = nativeMax(start, end - size); break;
	        }
	      }
	      return { 'start': start, 'end': end };
	    }

	    /**
	     * Checks if `path` exists on `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path to check.
	     * @param {Function} hasFunc The function to check properties.
	     * @returns {boolean} Returns `true` if `path` exists, else `false`.
	     */
	    function hasPath(object, path, hasFunc) {
	      path = isKey(path, object) ? [path] : castPath(path);

	      var result,
	          index = -1,
	          length = path.length;

	      while (++index < length) {
	        var key = toKey(path[index]);
	        if (!(result = object != null && hasFunc(object, key))) {
	          break;
	        }
	        object = object[key];
	      }
	      if (result) {
	        return result;
	      }
	      var length = object ? object.length : 0;
	      return !!length && isLength(length) && isIndex(key, length) &&
	        (isArray(object) || isString(object) || isArguments(object));
	    }

	    /**
	     * Initializes an array clone.
	     *
	     * @private
	     * @param {Array} array The array to clone.
	     * @returns {Array} Returns the initialized clone.
	     */
	    function initCloneArray(array) {
	      var length = array.length,
	          result = array.constructor(length);

	      // Add properties assigned by `RegExp#exec`.
	      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
	        result.index = array.index;
	        result.input = array.input;
	      }
	      return result;
	    }

	    /**
	     * Initializes an object clone.
	     *
	     * @private
	     * @param {Object} object The object to clone.
	     * @returns {Object} Returns the initialized clone.
	     */
	    function initCloneObject(object) {
	      return (typeof object.constructor == 'function' && !isPrototype(object))
	        ? baseCreate(getPrototype(object))
	        : {};
	    }

	    /**
	     * Initializes an object clone based on its `toStringTag`.
	     *
	     * **Note:** This function only supports cloning values with tags of
	     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
	     *
	     * @private
	     * @param {Object} object The object to clone.
	     * @param {string} tag The `toStringTag` of the object to clone.
	     * @param {Function} cloneFunc The function to clone values.
	     * @param {boolean} [isDeep] Specify a deep clone.
	     * @returns {Object} Returns the initialized clone.
	     */
	    function initCloneByTag(object, tag, cloneFunc, isDeep) {
	      var Ctor = object.constructor;
	      switch (tag) {
	        case arrayBufferTag:
	          return cloneArrayBuffer(object);

	        case boolTag:
	        case dateTag:
	          return new Ctor(+object);

	        case dataViewTag:
	          return cloneDataView(object, isDeep);

	        case float32Tag: case float64Tag:
	        case int8Tag: case int16Tag: case int32Tag:
	        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
	          return cloneTypedArray(object, isDeep);

	        case mapTag:
	          return cloneMap(object, isDeep, cloneFunc);

	        case numberTag:
	        case stringTag:
	          return new Ctor(object);

	        case regexpTag:
	          return cloneRegExp(object);

	        case setTag:
	          return cloneSet(object, isDeep, cloneFunc);

	        case symbolTag:
	          return cloneSymbol(object);
	      }
	    }

	    /**
	     * Creates an array of index keys for `object` values of arrays,
	     * `arguments` objects, and strings, otherwise `null` is returned.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @returns {Array|null} Returns index keys, else `null`.
	     */
	    function indexKeys(object) {
	      var length = object ? object.length : undefined;
	      if (isLength(length) &&
	          (isArray(object) || isString(object) || isArguments(object))) {
	        return baseTimes(length, String);
	      }
	      return null;
	    }

	    /**
	     * Checks if `value` is a flattenable `arguments` object or array.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
	     */
	    function isFlattenable(value) {
	      return isArray(value) || isArguments(value);
	    }

	    /**
	     * Checks if `value` is a flattenable array and not a `_.matchesProperty`
	     * iteratee shorthand.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
	     */
	    function isFlattenableIteratee(value) {
	      return isArray(value) && !(value.length == 2 && !isFunction(value[0]));
	    }

	    /**
	     * Checks if `value` is a valid array-like index.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
	     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
	     */
	    function isIndex(value, length) {
	      length = length == null ? MAX_SAFE_INTEGER : length;
	      return !!length &&
	        (typeof value == 'number' || reIsUint.test(value)) &&
	        (value > -1 && value % 1 == 0 && value < length);
	    }

	    /**
	     * Checks if the given arguments are from an iteratee call.
	     *
	     * @private
	     * @param {*} value The potential iteratee value argument.
	     * @param {*} index The potential iteratee index or key argument.
	     * @param {*} object The potential iteratee object argument.
	     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
	     *  else `false`.
	     */
	    function isIterateeCall(value, index, object) {
	      if (!isObject(object)) {
	        return false;
	      }
	      var type = typeof index;
	      if (type == 'number'
	            ? (isArrayLike(object) && isIndex(index, object.length))
	            : (type == 'string' && index in object)
	          ) {
	        return eq(object[index], value);
	      }
	      return false;
	    }

	    /**
	     * Checks if `value` is a property name and not a property path.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @param {Object} [object] The object to query keys on.
	     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
	     */
	    function isKey(value, object) {
	      if (isArray(value)) {
	        return false;
	      }
	      var type = typeof value;
	      if (type == 'number' || type == 'symbol' || type == 'boolean' ||
	          value == null || isSymbol(value)) {
	        return true;
	      }
	      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
	        (object != null && value in Object(object));
	    }

	    /**
	     * Checks if `value` is suitable for use as unique object key.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
	     */
	    function isKeyable(value) {
	      var type = typeof value;
	      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
	        ? (value !== '__proto__')
	        : (value === null);
	    }

	    /**
	     * Checks if `func` has a lazy counterpart.
	     *
	     * @private
	     * @param {Function} func The function to check.
	     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,
	     *  else `false`.
	     */
	    function isLaziable(func) {
	      var funcName = getFuncName(func),
	          other = lodash[funcName];

	      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {
	        return false;
	      }
	      if (func === other) {
	        return true;
	      }
	      var data = getData(other);
	      return !!data && func === data[0];
	    }

	    /**
	     * Checks if `value` is likely a prototype object.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
	     */
	    function isPrototype(value) {
	      var Ctor = value && value.constructor,
	          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;

	      return value === proto;
	    }

	    /**
	     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
	     *
	     * @private
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` if suitable for strict
	     *  equality comparisons, else `false`.
	     */
	    function isStrictComparable(value) {
	      return value === value && !isObject(value);
	    }

	    /**
	     * A specialized version of `matchesProperty` for source values suitable
	     * for strict equality comparisons, i.e. `===`.
	     *
	     * @private
	     * @param {string} key The key of the property to get.
	     * @param {*} srcValue The value to match.
	     * @returns {Function} Returns the new spec function.
	     */
	    function matchesStrictComparable(key, srcValue) {
	      return function(object) {
	        if (object == null) {
	          return false;
	        }
	        return object[key] === srcValue &&
	          (srcValue !== undefined || (key in Object(object)));
	      };
	    }

	    /**
	     * Merges the function metadata of `source` into `data`.
	     *
	     * Merging metadata reduces the number of wrappers used to invoke a function.
	     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`
	     * may be applied regardless of execution order. Methods like `_.ary` and
	     * `_.rearg` modify function arguments, making the order in which they are
	     * executed important, preventing the merging of metadata. However, we make
	     * an exception for a safe combined case where curried functions have `_.ary`
	     * and or `_.rearg` applied.
	     *
	     * @private
	     * @param {Array} data The destination metadata.
	     * @param {Array} source The source metadata.
	     * @returns {Array} Returns `data`.
	     */
	    function mergeData(data, source) {
	      var bitmask = data[1],
	          srcBitmask = source[1],
	          newBitmask = bitmask | srcBitmask,
	          isCommon = newBitmask < (BIND_FLAG | BIND_KEY_FLAG | ARY_FLAG);

	      var isCombo =
	        ((srcBitmask == ARY_FLAG) && (bitmask == CURRY_FLAG)) ||
	        ((srcBitmask == ARY_FLAG) && (bitmask == REARG_FLAG) && (data[7].length <= source[8])) ||
	        ((srcBitmask == (ARY_FLAG | REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == CURRY_FLAG));

	      // Exit early if metadata can't be merged.
	      if (!(isCommon || isCombo)) {
	        return data;
	      }
	      // Use source `thisArg` if available.
	      if (srcBitmask & BIND_FLAG) {
	        data[2] = source[2];
	        // Set when currying a bound function.
	        newBitmask |= bitmask & BIND_FLAG ? 0 : CURRY_BOUND_FLAG;
	      }
	      // Compose partial arguments.
	      var value = source[3];
	      if (value) {
	        var partials = data[3];
	        data[3] = partials ? composeArgs(partials, value, source[4]) : value;
	        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];
	      }
	      // Compose partial right arguments.
	      value = source[5];
	      if (value) {
	        partials = data[5];
	        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;
	        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];
	      }
	      // Use source `argPos` if available.
	      value = source[7];
	      if (value) {
	        data[7] = value;
	      }
	      // Use source `ary` if it's smaller.
	      if (srcBitmask & ARY_FLAG) {
	        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);
	      }
	      // Use source `arity` if one is not provided.
	      if (data[9] == null) {
	        data[9] = source[9];
	      }
	      // Use source `func` and merge bitmasks.
	      data[0] = source[0];
	      data[1] = newBitmask;

	      return data;
	    }

	    /**
	     * Used by `_.defaultsDeep` to customize its `_.merge` use.
	     *
	     * @private
	     * @param {*} objValue The destination value.
	     * @param {*} srcValue The source value.
	     * @param {string} key The key of the property to merge.
	     * @param {Object} object The parent object of `objValue`.
	     * @param {Object} source The parent object of `srcValue`.
	     * @param {Object} [stack] Tracks traversed source values and their merged
	     *  counterparts.
	     * @returns {*} Returns the value to assign.
	     */
	    function mergeDefaults(objValue, srcValue, key, object, source, stack) {
	      if (isObject(objValue) && isObject(srcValue)) {
	        baseMerge(objValue, srcValue, undefined, mergeDefaults, stack.set(srcValue, objValue));
	      }
	      return objValue;
	    }

	    /**
	     * Gets the parent value at `path` of `object`.
	     *
	     * @private
	     * @param {Object} object The object to query.
	     * @param {Array} path The path to get the parent value of.
	     * @returns {*} Returns the parent value.
	     */
	    function parent(object, path) {
	      return path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
	    }

	    /**
	     * Reorder `array` according to the specified indexes where the element at
	     * the first index is assigned as the first element, the element at
	     * the second index is assigned as the second element, and so on.
	     *
	     * @private
	     * @param {Array} array The array to reorder.
	     * @param {Array} indexes The arranged array indexes.
	     * @returns {Array} Returns `array`.
	     */
	    function reorder(array, indexes) {
	      var arrLength = array.length,
	          length = nativeMin(indexes.length, arrLength),
	          oldArray = copyArray(array);

	      while (length--) {
	        var index = indexes[length];
	        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;
	      }
	      return array;
	    }

	    /**
	     * Sets metadata for `func`.
	     *
	     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short
	     * period of time, it will trip its breaker and transition to an identity
	     * function to avoid garbage collection pauses in V8. See
	     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)
	     * for more details.
	     *
	     * @private
	     * @param {Function} func The function to associate metadata with.
	     * @param {*} data The metadata.
	     * @returns {Function} Returns `func`.
	     */
	    var setData = (function() {
	      var count = 0,
	          lastCalled = 0;

	      return function(key, value) {
	        var stamp = now(),
	            remaining = HOT_SPAN - (stamp - lastCalled);

	        lastCalled = stamp;
	        if (remaining > 0) {
	          if (++count >= HOT_COUNT) {
	            return key;
	          }
	        } else {
	          count = 0;
	        }
	        return baseSetData(key, value);
	      };
	    }());

	    /**
	     * Converts `string` to a property path array.
	     *
	     * @private
	     * @param {string} string The string to convert.
	     * @returns {Array} Returns the property path array.
	     */
	    var stringToPath = memoize(function(string) {
	      var result = [];
	      toString(string).replace(rePropName, function(match, number, quote, string) {
	        result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
	      });
	      return result;
	    });

	    /**
	     * Converts `value` to a string key if it's not a string or symbol.
	     *
	     * @private
	     * @param {*} value The value to inspect.
	     * @returns {string|symbol} Returns the key.
	     */
	    function toKey(value) {
	      if (typeof value == 'string' || isSymbol(value)) {
	        return value;
	      }
	      var result = (value + '');
	      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
	    }

	    /**
	     * Converts `func` to its source code.
	     *
	     * @private
	     * @param {Function} func The function to process.
	     * @returns {string} Returns the source code.
	     */
	    function toSource(func) {
	      if (func != null) {
	        try {
	          return funcToString.call(func);
	        } catch (e) {}
	        try {
	          return (func + '');
	        } catch (e) {}
	      }
	      return '';
	    }

	    /**
	     * Creates a clone of `wrapper`.
	     *
	     * @private
	     * @param {Object} wrapper The wrapper to clone.
	     * @returns {Object} Returns the cloned wrapper.
	     */
	    function wrapperClone(wrapper) {
	      if (wrapper instanceof LazyWrapper) {
	        return wrapper.clone();
	      }
	      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);
	      result.__actions__ = copyArray(wrapper.__actions__);
	      result.__index__  = wrapper.__index__;
	      result.__values__ = wrapper.__values__;
	      return result;
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates an array of elements split into groups the length of `size`.
	     * If `array` can't be split evenly, the final chunk will be the remaining
	     * elements.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to process.
	     * @param {number} [size=1] The length of each chunk
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the new array of chunks.
	     * @example
	     *
	     * _.chunk(['a', 'b', 'c', 'd'], 2);
	     * // => [['a', 'b'], ['c', 'd']]
	     *
	     * _.chunk(['a', 'b', 'c', 'd'], 3);
	     * // => [['a', 'b', 'c'], ['d']]
	     */
	    function chunk(array, size, guard) {
	      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {
	        size = 1;
	      } else {
	        size = nativeMax(toInteger(size), 0);
	      }
	      var length = array ? array.length : 0;
	      if (!length || size < 1) {
	        return [];
	      }
	      var index = 0,
	          resIndex = 0,
	          result = Array(nativeCeil(length / size));

	      while (index < length) {
	        result[resIndex++] = baseSlice(array, index, (index += size));
	      }
	      return result;
	    }

	    /**
	     * Creates an array with all falsey values removed. The values `false`, `null`,
	     * `0`, `""`, `undefined`, and `NaN` are falsey.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to compact.
	     * @returns {Array} Returns the new array of filtered values.
	     * @example
	     *
	     * _.compact([0, 1, false, 2, '', 3]);
	     * // => [1, 2, 3]
	     */
	    function compact(array) {
	      var index = -1,
	          length = array ? array.length : 0,
	          resIndex = 0,
	          result = [];

	      while (++index < length) {
	        var value = array[index];
	        if (value) {
	          result[resIndex++] = value;
	        }
	      }
	      return result;
	    }

	    /**
	     * Creates a new array concatenating `array` with any additional arrays
	     * and/or values.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to concatenate.
	     * @param {...*} [values] The values to concatenate.
	     * @returns {Array} Returns the new concatenated array.
	     * @example
	     *
	     * var array = [1];
	     * var other = _.concat(array, 2, [3], [[4]]);
	     *
	     * console.log(other);
	     * // => [1, 2, 3, [4]]
	     *
	     * console.log(array);
	     * // => [1]
	     */
	    function concat() {
	      var length = arguments.length,
	          args = Array(length ? length - 1 : 0),
	          array = arguments[0],
	          index = length;

	      while (index--) {
	        args[index - 1] = arguments[index];
	      }
	      return length
	        ? arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1))
	        : [];
	    }

	    /**
	     * Creates an array of unique `array` values not included in the other given
	     * arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons. The order of result values is determined by the
	     * order they occur in the first array.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {...Array} [values] The values to exclude.
	     * @returns {Array} Returns the new array of filtered values.
	     * @see _.without, _.xor
	     * @example
	     *
	     * _.difference([3, 2, 1], [4, 2]);
	     * // => [3, 1]
	     */
	    var difference = rest(function(array, values) {
	      return isArrayLikeObject(array)
	        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))
	        : [];
	    });

	    /**
	     * This method is like `_.difference` except that it accepts `iteratee` which
	     * is invoked for each element of `array` and `values` to generate the criterion
	     * by which they're compared. Result values are chosen from the first array.
	     * The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {...Array} [values] The values to exclude.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Array} Returns the new array of filtered values.
	     * @example
	     *
	     * _.differenceBy([3.1, 2.2, 1.3], [4.4, 2.5], Math.floor);
	     * // => [3.1, 1.3]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');
	     * // => [{ 'x': 2 }]
	     */
	    var differenceBy = rest(function(array, values) {
	      var iteratee = last(values);
	      if (isArrayLikeObject(iteratee)) {
	        iteratee = undefined;
	      }
	      return isArrayLikeObject(array)
	        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee))
	        : [];
	    });

	    /**
	     * This method is like `_.difference` except that it accepts `comparator`
	     * which is invoked to compare elements of `array` to `values`. Result values
	     * are chosen from the first array. The comparator is invoked with two arguments:
	     * (arrVal, othVal).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {...Array} [values] The values to exclude.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of filtered values.
	     * @example
	     *
	     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
	     *
	     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);
	     * // => [{ 'x': 2, 'y': 1 }]
	     */
	    var differenceWith = rest(function(array, values) {
	      var comparator = last(values);
	      if (isArrayLikeObject(comparator)) {
	        comparator = undefined;
	      }
	      return isArrayLikeObject(array)
	        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)
	        : [];
	    });

	    /**
	     * Creates a slice of `array` with `n` elements dropped from the beginning.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.5.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {number} [n=1] The number of elements to drop.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * _.drop([1, 2, 3]);
	     * // => [2, 3]
	     *
	     * _.drop([1, 2, 3], 2);
	     * // => [3]
	     *
	     * _.drop([1, 2, 3], 5);
	     * // => []
	     *
	     * _.drop([1, 2, 3], 0);
	     * // => [1, 2, 3]
	     */
	    function drop(array, n, guard) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return [];
	      }
	      n = (guard || n === undefined) ? 1 : toInteger(n);
	      return baseSlice(array, n < 0 ? 0 : n, length);
	    }

	    /**
	     * Creates a slice of `array` with `n` elements dropped from the end.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {number} [n=1] The number of elements to drop.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * _.dropRight([1, 2, 3]);
	     * // => [1, 2]
	     *
	     * _.dropRight([1, 2, 3], 2);
	     * // => [1]
	     *
	     * _.dropRight([1, 2, 3], 5);
	     * // => []
	     *
	     * _.dropRight([1, 2, 3], 0);
	     * // => [1, 2, 3]
	     */
	    function dropRight(array, n, guard) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return [];
	      }
	      n = (guard || n === undefined) ? 1 : toInteger(n);
	      n = length - n;
	      return baseSlice(array, 0, n < 0 ? 0 : n);
	    }

	    /**
	     * Creates a slice of `array` excluding elements dropped from the end.
	     * Elements are dropped until `predicate` returns falsey. The predicate is
	     * invoked with three arguments: (value, index, array).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'active': true },
	     *   { 'user': 'fred',    'active': false },
	     *   { 'user': 'pebbles', 'active': false }
	     * ];
	     *
	     * _.dropRightWhile(users, function(o) { return !o.active; });
	     * // => objects for ['barney']
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });
	     * // => objects for ['barney', 'fred']
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.dropRightWhile(users, ['active', false]);
	     * // => objects for ['barney']
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.dropRightWhile(users, 'active');
	     * // => objects for ['barney', 'fred', 'pebbles']
	     */
	    function dropRightWhile(array, predicate) {
	      return (array && array.length)
	        ? baseWhile(array, getIteratee(predicate, 3), true, true)
	        : [];
	    }

	    /**
	     * Creates a slice of `array` excluding elements dropped from the beginning.
	     * Elements are dropped until `predicate` returns falsey. The predicate is
	     * invoked with three arguments: (value, index, array).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'active': false },
	     *   { 'user': 'fred',    'active': false },
	     *   { 'user': 'pebbles', 'active': true }
	     * ];
	     *
	     * _.dropWhile(users, function(o) { return !o.active; });
	     * // => objects for ['pebbles']
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.dropWhile(users, { 'user': 'barney', 'active': false });
	     * // => objects for ['fred', 'pebbles']
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.dropWhile(users, ['active', false]);
	     * // => objects for ['pebbles']
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.dropWhile(users, 'active');
	     * // => objects for ['barney', 'fred', 'pebbles']
	     */
	    function dropWhile(array, predicate) {
	      return (array && array.length)
	        ? baseWhile(array, getIteratee(predicate, 3), true)
	        : [];
	    }

	    /**
	     * Fills elements of `array` with `value` from `start` up to, but not
	     * including, `end`.
	     *
	     * **Note:** This method mutates `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.2.0
	     * @category Array
	     * @param {Array} array The array to fill.
	     * @param {*} value The value to fill `array` with.
	     * @param {number} [start=0] The start position.
	     * @param {number} [end=array.length] The end position.
	     * @returns {Array} Returns `array`.
	     * @example
	     *
	     * var array = [1, 2, 3];
	     *
	     * _.fill(array, 'a');
	     * console.log(array);
	     * // => ['a', 'a', 'a']
	     *
	     * _.fill(Array(3), 2);
	     * // => [2, 2, 2]
	     *
	     * _.fill([4, 6, 8, 10], '*', 1, 3);
	     * // => [4, '*', '*', 10]
	     */
	    function fill(array, value, start, end) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return [];
	      }
	      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {
	        start = 0;
	        end = length;
	      }
	      return baseFill(array, value, start, end);
	    }

	    /**
	     * This method is like `_.find` except that it returns the index of the first
	     * element `predicate` returns truthy for instead of the element itself.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.1.0
	     * @category Array
	     * @param {Array} array The array to search.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {number} Returns the index of the found element, else `-1`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'active': false },
	     *   { 'user': 'fred',    'active': false },
	     *   { 'user': 'pebbles', 'active': true }
	     * ];
	     *
	     * _.findIndex(users, function(o) { return o.user == 'barney'; });
	     * // => 0
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.findIndex(users, { 'user': 'fred', 'active': false });
	     * // => 1
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.findIndex(users, ['active', false]);
	     * // => 0
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.findIndex(users, 'active');
	     * // => 2
	     */
	    function findIndex(array, predicate) {
	      return (array && array.length)
	        ? baseFindIndex(array, getIteratee(predicate, 3))
	        : -1;
	    }

	    /**
	     * This method is like `_.findIndex` except that it iterates over elements
	     * of `collection` from right to left.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Array
	     * @param {Array} array The array to search.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {number} Returns the index of the found element, else `-1`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'active': true },
	     *   { 'user': 'fred',    'active': false },
	     *   { 'user': 'pebbles', 'active': false }
	     * ];
	     *
	     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });
	     * // => 2
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.findLastIndex(users, { 'user': 'barney', 'active': true });
	     * // => 0
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.findLastIndex(users, ['active', false]);
	     * // => 2
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.findLastIndex(users, 'active');
	     * // => 0
	     */
	    function findLastIndex(array, predicate) {
	      return (array && array.length)
	        ? baseFindIndex(array, getIteratee(predicate, 3), true)
	        : -1;
	    }

	    /**
	     * Flattens `array` a single level deep.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to flatten.
	     * @returns {Array} Returns the new flattened array.
	     * @example
	     *
	     * _.flatten([1, [2, [3, [4]], 5]]);
	     * // => [1, 2, [3, [4]], 5]
	     */
	    function flatten(array) {
	      var length = array ? array.length : 0;
	      return length ? baseFlatten(array, 1) : [];
	    }

	    /**
	     * Recursively flattens `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to flatten.
	     * @returns {Array} Returns the new flattened array.
	     * @example
	     *
	     * _.flattenDeep([1, [2, [3, [4]], 5]]);
	     * // => [1, 2, 3, 4, 5]
	     */
	    function flattenDeep(array) {
	      var length = array ? array.length : 0;
	      return length ? baseFlatten(array, INFINITY) : [];
	    }

	    /**
	     * Recursively flatten `array` up to `depth` times.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.4.0
	     * @category Array
	     * @param {Array} array The array to flatten.
	     * @param {number} [depth=1] The maximum recursion depth.
	     * @returns {Array} Returns the new flattened array.
	     * @example
	     *
	     * var array = [1, [2, [3, [4]], 5]];
	     *
	     * _.flattenDepth(array, 1);
	     * // => [1, 2, [3, [4]], 5]
	     *
	     * _.flattenDepth(array, 2);
	     * // => [1, 2, 3, [4], 5]
	     */
	    function flattenDepth(array, depth) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return [];
	      }
	      depth = depth === undefined ? 1 : toInteger(depth);
	      return baseFlatten(array, depth);
	    }

	    /**
	     * The inverse of `_.toPairs`; this method returns an object composed
	     * from key-value `pairs`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} pairs The key-value pairs.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * _.fromPairs([['fred', 30], ['barney', 40]]);
	     * // => { 'fred': 30, 'barney': 40 }
	     */
	    function fromPairs(pairs) {
	      var index = -1,
	          length = pairs ? pairs.length : 0,
	          result = {};

	      while (++index < length) {
	        var pair = pairs[index];
	        result[pair[0]] = pair[1];
	      }
	      return result;
	    }

	    /**
	     * Gets the first element of `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @alias first
	     * @category Array
	     * @param {Array} array The array to query.
	     * @returns {*} Returns the first element of `array`.
	     * @example
	     *
	     * _.head([1, 2, 3]);
	     * // => 1
	     *
	     * _.head([]);
	     * // => undefined
	     */
	    function head(array) {
	      return (array && array.length) ? array[0] : undefined;
	    }

	    /**
	     * Gets the index at which the first occurrence of `value` is found in `array`
	     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons. If `fromIndex` is negative, it's used as the
	     * offset from the end of `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to search.
	     * @param {*} value The value to search for.
	     * @param {number} [fromIndex=0] The index to search from.
	     * @returns {number} Returns the index of the matched value, else `-1`.
	     * @example
	     *
	     * _.indexOf([1, 2, 1, 2], 2);
	     * // => 1
	     *
	     * // Search from the `fromIndex`.
	     * _.indexOf([1, 2, 1, 2], 2, 2);
	     * // => 3
	     */
	    function indexOf(array, value, fromIndex) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return -1;
	      }
	      fromIndex = toInteger(fromIndex);
	      if (fromIndex < 0) {
	        fromIndex = nativeMax(length + fromIndex, 0);
	      }
	      return baseIndexOf(array, value, fromIndex);
	    }

	    /**
	     * Gets all but the last element of `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * _.initial([1, 2, 3]);
	     * // => [1, 2]
	     */
	    function initial(array) {
	      return dropRight(array, 1);
	    }

	    /**
	     * Creates an array of unique values that are included in all given arrays
	     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons. The order of result values is determined by the
	     * order they occur in the first array.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @returns {Array} Returns the new array of intersecting values.
	     * @example
	     *
	     * _.intersection([2, 1], [4, 2], [1, 2]);
	     * // => [2]
	     */
	    var intersection = rest(function(arrays) {
	      var mapped = arrayMap(arrays, castArrayLikeObject);
	      return (mapped.length && mapped[0] === arrays[0])
	        ? baseIntersection(mapped)
	        : [];
	    });

	    /**
	     * This method is like `_.intersection` except that it accepts `iteratee`
	     * which is invoked for each element of each `arrays` to generate the criterion
	     * by which they're compared. Result values are chosen from the first array.
	     * The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Array} Returns the new array of intersecting values.
	     * @example
	     *
	     * _.intersectionBy([2.1, 1.2], [4.3, 2.4], Math.floor);
	     * // => [2.1]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
	     * // => [{ 'x': 1 }]
	     */
	    var intersectionBy = rest(function(arrays) {
	      var iteratee = last(arrays),
	          mapped = arrayMap(arrays, castArrayLikeObject);

	      if (iteratee === last(mapped)) {
	        iteratee = undefined;
	      } else {
	        mapped.pop();
	      }
	      return (mapped.length && mapped[0] === arrays[0])
	        ? baseIntersection(mapped, getIteratee(iteratee))
	        : [];
	    });

	    /**
	     * This method is like `_.intersection` except that it accepts `comparator`
	     * which is invoked to compare elements of `arrays`. Result values are chosen
	     * from the first array. The comparator is invoked with two arguments:
	     * (arrVal, othVal).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of intersecting values.
	     * @example
	     *
	     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
	     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
	     *
	     * _.intersectionWith(objects, others, _.isEqual);
	     * // => [{ 'x': 1, 'y': 2 }]
	     */
	    var intersectionWith = rest(function(arrays) {
	      var comparator = last(arrays),
	          mapped = arrayMap(arrays, castArrayLikeObject);

	      if (comparator === last(mapped)) {
	        comparator = undefined;
	      } else {
	        mapped.pop();
	      }
	      return (mapped.length && mapped[0] === arrays[0])
	        ? baseIntersection(mapped, undefined, comparator)
	        : [];
	    });

	    /**
	     * Converts all elements in `array` into a string separated by `separator`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to convert.
	     * @param {string} [separator=','] The element separator.
	     * @returns {string} Returns the joined string.
	     * @example
	     *
	     * _.join(['a', 'b', 'c'], '~');
	     * // => 'a~b~c'
	     */
	    function join(array, separator) {
	      return array ? nativeJoin.call(array, separator) : '';
	    }

	    /**
	     * Gets the last element of `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @returns {*} Returns the last element of `array`.
	     * @example
	     *
	     * _.last([1, 2, 3]);
	     * // => 3
	     */
	    function last(array) {
	      var length = array ? array.length : 0;
	      return length ? array[length - 1] : undefined;
	    }

	    /**
	     * This method is like `_.indexOf` except that it iterates over elements of
	     * `array` from right to left.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to search.
	     * @param {*} value The value to search for.
	     * @param {number} [fromIndex=array.length-1] The index to search from.
	     * @returns {number} Returns the index of the matched value, else `-1`.
	     * @example
	     *
	     * _.lastIndexOf([1, 2, 1, 2], 2);
	     * // => 3
	     *
	     * // Search from the `fromIndex`.
	     * _.lastIndexOf([1, 2, 1, 2], 2, 2);
	     * // => 1
	     */
	    function lastIndexOf(array, value, fromIndex) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return -1;
	      }
	      var index = length;
	      if (fromIndex !== undefined) {
	        index = toInteger(fromIndex);
	        index = (
	          index < 0
	            ? nativeMax(length + index, 0)
	            : nativeMin(index, length - 1)
	        ) + 1;
	      }
	      if (value !== value) {
	        return indexOfNaN(array, index, true);
	      }
	      while (index--) {
	        if (array[index] === value) {
	          return index;
	        }
	      }
	      return -1;
	    }

	    /**
	     * Gets the element at `n` index of `array`. If `n` is negative, the nth
	     * element from the end is returned.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.11.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {number} [n=0] The index of the element to return.
	     * @returns {*} Returns the nth element of `array`.
	     * @example
	     *
	     * var array = ['a', 'b', 'c', 'd'];
	     *
	     * _.nth(array, 1);
	     * // => 'b'
	     *
	     * _.nth(array, -2);
	     * // => 'c';
	     */
	    function nth(array, n) {
	      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;
	    }

	    /**
	     * Removes all given values from `array` using
	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons.
	     *
	     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`
	     * to remove elements from an array by predicate.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @param {...*} [values] The values to remove.
	     * @returns {Array} Returns `array`.
	     * @example
	     *
	     * var array = [1, 2, 3, 1, 2, 3];
	     *
	     * _.pull(array, 2, 3);
	     * console.log(array);
	     * // => [1, 1]
	     */
	    var pull = rest(pullAll);

	    /**
	     * This method is like `_.pull` except that it accepts an array of values to remove.
	     *
	     * **Note:** Unlike `_.difference`, this method mutates `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @param {Array} values The values to remove.
	     * @returns {Array} Returns `array`.
	     * @example
	     *
	     * var array = [1, 2, 3, 1, 2, 3];
	     *
	     * _.pullAll(array, [2, 3]);
	     * console.log(array);
	     * // => [1, 1]
	     */
	    function pullAll(array, values) {
	      return (array && array.length && values && values.length)
	        ? basePullAll(array, values)
	        : array;
	    }

	    /**
	     * This method is like `_.pullAll` except that it accepts `iteratee` which is
	     * invoked for each element of `array` and `values` to generate the criterion
	     * by which they're compared. The iteratee is invoked with one argument: (value).
	     *
	     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @param {Array} values The values to remove.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Array} Returns `array`.
	     * @example
	     *
	     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];
	     *
	     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');
	     * console.log(array);
	     * // => [{ 'x': 2 }]
	     */
	    function pullAllBy(array, values, iteratee) {
	      return (array && array.length && values && values.length)
	        ? basePullAll(array, values, getIteratee(iteratee))
	        : array;
	    }

	    /**
	     * This method is like `_.pullAll` except that it accepts `comparator` which
	     * is invoked to compare elements of `array` to `values`. The comparator is
	     * invoked with two arguments: (arrVal, othVal).
	     *
	     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.6.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @param {Array} values The values to remove.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns `array`.
	     * @example
	     *
	     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];
	     *
	     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);
	     * console.log(array);
	     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]
	     */
	    function pullAllWith(array, values, comparator) {
	      return (array && array.length && values && values.length)
	        ? basePullAll(array, values, undefined, comparator)
	        : array;
	    }

	    /**
	     * Removes elements from `array` corresponding to `indexes` and returns an
	     * array of removed elements.
	     *
	     * **Note:** Unlike `_.at`, this method mutates `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @param {...(number|number[])} [indexes] The indexes of elements to remove.
	     * @returns {Array} Returns the new array of removed elements.
	     * @example
	     *
	     * var array = [5, 10, 15, 20];
	     * var evens = _.pullAt(array, 1, 3);
	     *
	     * console.log(array);
	     * // => [5, 15]
	     *
	     * console.log(evens);
	     * // => [10, 20]
	     */
	    var pullAt = rest(function(array, indexes) {
	      indexes = baseFlatten(indexes, 1);

	      var length = array ? array.length : 0,
	          result = baseAt(array, indexes);

	      basePullAt(array, arrayMap(indexes, function(index) {
	        return isIndex(index, length) ? +index : index;
	      }).sort(compareAscending));

	      return result;
	    });

	    /**
	     * Removes all elements from `array` that `predicate` returns truthy for
	     * and returns an array of the removed elements. The predicate is invoked
	     * with three arguments: (value, index, array).
	     *
	     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`
	     * to pull elements from an array by value.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the new array of removed elements.
	     * @example
	     *
	     * var array = [1, 2, 3, 4];
	     * var evens = _.remove(array, function(n) {
	     *   return n % 2 == 0;
	     * });
	     *
	     * console.log(array);
	     * // => [1, 3]
	     *
	     * console.log(evens);
	     * // => [2, 4]
	     */
	    function remove(array, predicate) {
	      var result = [];
	      if (!(array && array.length)) {
	        return result;
	      }
	      var index = -1,
	          indexes = [],
	          length = array.length;

	      predicate = getIteratee(predicate, 3);
	      while (++index < length) {
	        var value = array[index];
	        if (predicate(value, index, array)) {
	          result.push(value);
	          indexes.push(index);
	        }
	      }
	      basePullAt(array, indexes);
	      return result;
	    }

	    /**
	     * Reverses `array` so that the first element becomes the last, the second
	     * element becomes the second to last, and so on.
	     *
	     * **Note:** This method mutates `array` and is based on
	     * [`Array#reverse`](https://mdn.io/Array/reverse).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to modify.
	     * @returns {Array} Returns `array`.
	     * @example
	     *
	     * var array = [1, 2, 3];
	     *
	     * _.reverse(array);
	     * // => [3, 2, 1]
	     *
	     * console.log(array);
	     * // => [3, 2, 1]
	     */
	    function reverse(array) {
	      return array ? nativeReverse.call(array) : array;
	    }

	    /**
	     * Creates a slice of `array` from `start` up to, but not including, `end`.
	     *
	     * **Note:** This method is used instead of
	     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are
	     * returned.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to slice.
	     * @param {number} [start=0] The start position.
	     * @param {number} [end=array.length] The end position.
	     * @returns {Array} Returns the slice of `array`.
	     */
	    function slice(array, start, end) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return [];
	      }
	      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {
	        start = 0;
	        end = length;
	      }
	      else {
	        start = start == null ? 0 : toInteger(start);
	        end = end === undefined ? length : toInteger(end);
	      }
	      return baseSlice(array, start, end);
	    }

	    /**
	     * Uses a binary search to determine the lowest index at which `value`
	     * should be inserted into `array` in order to maintain its sort order.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The sorted array to inspect.
	     * @param {*} value The value to evaluate.
	     * @returns {number} Returns the index at which `value` should be inserted
	     *  into `array`.
	     * @example
	     *
	     * _.sortedIndex([30, 50], 40);
	     * // => 1
	     *
	     * _.sortedIndex([4, 5], 4);
	     * // => 0
	     */
	    function sortedIndex(array, value) {
	      return baseSortedIndex(array, value);
	    }

	    /**
	     * This method is like `_.sortedIndex` except that it accepts `iteratee`
	     * which is invoked for `value` and each element of `array` to compute their
	     * sort ranking. The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The sorted array to inspect.
	     * @param {*} value The value to evaluate.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {number} Returns the index at which `value` should be inserted
	     *  into `array`.
	     * @example
	     *
	     * var dict = { 'thirty': 30, 'forty': 40, 'fifty': 50 };
	     *
	     * _.sortedIndexBy(['thirty', 'fifty'], 'forty', _.propertyOf(dict));
	     * // => 1
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.sortedIndexBy([{ 'x': 4 }, { 'x': 5 }], { 'x': 4 }, 'x');
	     * // => 0
	     */
	    function sortedIndexBy(array, value, iteratee) {
	      return baseSortedIndexBy(array, value, getIteratee(iteratee));
	    }

	    /**
	     * This method is like `_.indexOf` except that it performs a binary
	     * search on a sorted `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to search.
	     * @param {*} value The value to search for.
	     * @returns {number} Returns the index of the matched value, else `-1`.
	     * @example
	     *
	     * _.sortedIndexOf([1, 1, 2, 2], 2);
	     * // => 2
	     */
	    function sortedIndexOf(array, value) {
	      var length = array ? array.length : 0;
	      if (length) {
	        var index = baseSortedIndex(array, value);
	        if (index < length && eq(array[index], value)) {
	          return index;
	        }
	      }
	      return -1;
	    }

	    /**
	     * This method is like `_.sortedIndex` except that it returns the highest
	     * index at which `value` should be inserted into `array` in order to
	     * maintain its sort order.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The sorted array to inspect.
	     * @param {*} value The value to evaluate.
	     * @returns {number} Returns the index at which `value` should be inserted
	     *  into `array`.
	     * @example
	     *
	     * _.sortedLastIndex([4, 5], 4);
	     * // => 1
	     */
	    function sortedLastIndex(array, value) {
	      return baseSortedIndex(array, value, true);
	    }

	    /**
	     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`
	     * which is invoked for `value` and each element of `array` to compute their
	     * sort ranking. The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The sorted array to inspect.
	     * @param {*} value The value to evaluate.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {number} Returns the index at which `value` should be inserted
	     *  into `array`.
	     * @example
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.sortedLastIndexBy([{ 'x': 4 }, { 'x': 5 }], { 'x': 4 }, 'x');
	     * // => 1
	     */
	    function sortedLastIndexBy(array, value, iteratee) {
	      return baseSortedIndexBy(array, value, getIteratee(iteratee), true);
	    }

	    /**
	     * This method is like `_.lastIndexOf` except that it performs a binary
	     * search on a sorted `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to search.
	     * @param {*} value The value to search for.
	     * @returns {number} Returns the index of the matched value, else `-1`.
	     * @example
	     *
	     * _.sortedLastIndexOf([1, 1, 2, 2], 2);
	     * // => 3
	     */
	    function sortedLastIndexOf(array, value) {
	      var length = array ? array.length : 0;
	      if (length) {
	        var index = baseSortedIndex(array, value, true) - 1;
	        if (eq(array[index], value)) {
	          return index;
	        }
	      }
	      return -1;
	    }

	    /**
	     * This method is like `_.uniq` except that it's designed and optimized
	     * for sorted arrays.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @returns {Array} Returns the new duplicate free array.
	     * @example
	     *
	     * _.sortedUniq([1, 1, 2]);
	     * // => [1, 2]
	     */
	    function sortedUniq(array) {
	      return (array && array.length)
	        ? baseSortedUniq(array)
	        : [];
	    }

	    /**
	     * This method is like `_.uniqBy` except that it's designed and optimized
	     * for sorted arrays.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {Function} [iteratee] The iteratee invoked per element.
	     * @returns {Array} Returns the new duplicate free array.
	     * @example
	     *
	     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);
	     * // => [1.1, 2.3]
	     */
	    function sortedUniqBy(array, iteratee) {
	      return (array && array.length)
	        ? baseSortedUniq(array, getIteratee(iteratee))
	        : [];
	    }

	    /**
	     * Gets all but the first element of `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * _.tail([1, 2, 3]);
	     * // => [2, 3]
	     */
	    function tail(array) {
	      return drop(array, 1);
	    }

	    /**
	     * Creates a slice of `array` with `n` elements taken from the beginning.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {number} [n=1] The number of elements to take.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * _.take([1, 2, 3]);
	     * // => [1]
	     *
	     * _.take([1, 2, 3], 2);
	     * // => [1, 2]
	     *
	     * _.take([1, 2, 3], 5);
	     * // => [1, 2, 3]
	     *
	     * _.take([1, 2, 3], 0);
	     * // => []
	     */
	    function take(array, n, guard) {
	      if (!(array && array.length)) {
	        return [];
	      }
	      n = (guard || n === undefined) ? 1 : toInteger(n);
	      return baseSlice(array, 0, n < 0 ? 0 : n);
	    }

	    /**
	     * Creates a slice of `array` with `n` elements taken from the end.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {number} [n=1] The number of elements to take.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * _.takeRight([1, 2, 3]);
	     * // => [3]
	     *
	     * _.takeRight([1, 2, 3], 2);
	     * // => [2, 3]
	     *
	     * _.takeRight([1, 2, 3], 5);
	     * // => [1, 2, 3]
	     *
	     * _.takeRight([1, 2, 3], 0);
	     * // => []
	     */
	    function takeRight(array, n, guard) {
	      var length = array ? array.length : 0;
	      if (!length) {
	        return [];
	      }
	      n = (guard || n === undefined) ? 1 : toInteger(n);
	      n = length - n;
	      return baseSlice(array, n < 0 ? 0 : n, length);
	    }

	    /**
	     * Creates a slice of `array` with elements taken from the end. Elements are
	     * taken until `predicate` returns falsey. The predicate is invoked with
	     * three arguments: (value, index, array).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'active': true },
	     *   { 'user': 'fred',    'active': false },
	     *   { 'user': 'pebbles', 'active': false }
	     * ];
	     *
	     * _.takeRightWhile(users, function(o) { return !o.active; });
	     * // => objects for ['fred', 'pebbles']
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });
	     * // => objects for ['pebbles']
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.takeRightWhile(users, ['active', false]);
	     * // => objects for ['fred', 'pebbles']
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.takeRightWhile(users, 'active');
	     * // => []
	     */
	    function takeRightWhile(array, predicate) {
	      return (array && array.length)
	        ? baseWhile(array, getIteratee(predicate, 3), false, true)
	        : [];
	    }

	    /**
	     * Creates a slice of `array` with elements taken from the beginning. Elements
	     * are taken until `predicate` returns falsey. The predicate is invoked with
	     * three arguments: (value, index, array).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Array
	     * @param {Array} array The array to query.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the slice of `array`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'active': false },
	     *   { 'user': 'fred',    'active': false},
	     *   { 'user': 'pebbles', 'active': true }
	     * ];
	     *
	     * _.takeWhile(users, function(o) { return !o.active; });
	     * // => objects for ['barney', 'fred']
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.takeWhile(users, { 'user': 'barney', 'active': false });
	     * // => objects for ['barney']
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.takeWhile(users, ['active', false]);
	     * // => objects for ['barney', 'fred']
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.takeWhile(users, 'active');
	     * // => []
	     */
	    function takeWhile(array, predicate) {
	      return (array && array.length)
	        ? baseWhile(array, getIteratee(predicate, 3))
	        : [];
	    }

	    /**
	     * Creates an array of unique values, in order, from all given arrays using
	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @returns {Array} Returns the new array of combined values.
	     * @example
	     *
	     * _.union([2, 1], [4, 2], [1, 2]);
	     * // => [2, 1, 4]
	     */
	    var union = rest(function(arrays) {
	      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));
	    });

	    /**
	     * This method is like `_.union` except that it accepts `iteratee` which is
	     * invoked for each element of each `arrays` to generate the criterion by
	     * which uniqueness is computed. The iteratee is invoked with one argument:
	     * (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Array} Returns the new array of combined values.
	     * @example
	     *
	     * _.unionBy([2.1, 1.2], [4.3, 2.4], Math.floor);
	     * // => [2.1, 1.2, 4.3]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
	     * // => [{ 'x': 1 }, { 'x': 2 }]
	     */
	    var unionBy = rest(function(arrays) {
	      var iteratee = last(arrays);
	      if (isArrayLikeObject(iteratee)) {
	        iteratee = undefined;
	      }
	      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee));
	    });

	    /**
	     * This method is like `_.union` except that it accepts `comparator` which
	     * is invoked to compare elements of `arrays`. The comparator is invoked
	     * with two arguments: (arrVal, othVal).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of combined values.
	     * @example
	     *
	     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
	     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
	     *
	     * _.unionWith(objects, others, _.isEqual);
	     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
	     */
	    var unionWith = rest(function(arrays) {
	      var comparator = last(arrays);
	      if (isArrayLikeObject(comparator)) {
	        comparator = undefined;
	      }
	      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);
	    });

	    /**
	     * Creates a duplicate-free version of an array, using
	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons, in which only the first occurrence of each
	     * element is kept.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @returns {Array} Returns the new duplicate free array.
	     * @example
	     *
	     * _.uniq([2, 1, 2]);
	     * // => [2, 1]
	     */
	    function uniq(array) {
	      return (array && array.length)
	        ? baseUniq(array)
	        : [];
	    }

	    /**
	     * This method is like `_.uniq` except that it accepts `iteratee` which is
	     * invoked for each element in `array` to generate the criterion by which
	     * uniqueness is computed. The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Array} Returns the new duplicate free array.
	     * @example
	     *
	     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);
	     * // => [2.1, 1.2]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
	     * // => [{ 'x': 1 }, { 'x': 2 }]
	     */
	    function uniqBy(array, iteratee) {
	      return (array && array.length)
	        ? baseUniq(array, getIteratee(iteratee))
	        : [];
	    }

	    /**
	     * This method is like `_.uniq` except that it accepts `comparator` which
	     * is invoked to compare elements of `array`. The comparator is invoked with
	     * two arguments: (arrVal, othVal).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new duplicate free array.
	     * @example
	     *
	     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 },  { 'x': 1, 'y': 2 }];
	     *
	     * _.uniqWith(objects, _.isEqual);
	     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]
	     */
	    function uniqWith(array, comparator) {
	      return (array && array.length)
	        ? baseUniq(array, undefined, comparator)
	        : [];
	    }

	    /**
	     * This method is like `_.zip` except that it accepts an array of grouped
	     * elements and creates an array regrouping the elements to their pre-zip
	     * configuration.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.2.0
	     * @category Array
	     * @param {Array} array The array of grouped elements to process.
	     * @returns {Array} Returns the new array of regrouped elements.
	     * @example
	     *
	     * var zipped = _.zip(['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 length = 0;
	      array = arrayFilter(array, function(group) {
	        if (isArrayLikeObject(group)) {
	          length = nativeMax(group.length, length);
	          return true;
	        }
	      });
	      return baseTimes(length, function(index) {
	        return arrayMap(array, baseProperty(index));
	      });
	    }

	    /**
	     * This method is like `_.unzip` except that it accepts `iteratee` to specify
	     * how regrouped values should be combined. The iteratee is invoked with the
	     * elements of each group: (...group).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.8.0
	     * @category Array
	     * @param {Array} array The array of grouped elements to process.
	     * @param {Function} [iteratee=_.identity] The function to combine
	     *  regrouped values.
	     * @returns {Array} Returns the new array of regrouped elements.
	     * @example
	     *
	     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);
	     * // => [[1, 10, 100], [2, 20, 200]]
	     *
	     * _.unzipWith(zipped, _.add);
	     * // => [3, 30, 300]
	     */
	    function unzipWith(array, iteratee) {
	      if (!(array && array.length)) {
	        return [];
	      }
	      var result = unzip(array);
	      if (iteratee == null) {
	        return result;
	      }
	      return arrayMap(result, function(group) {
	        return apply(iteratee, undefined, group);
	      });
	    }

	    /**
	     * Creates an array excluding all given values using
	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * for equality comparisons.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {Array} array The array to inspect.
	     * @param {...*} [values] The values to exclude.
	     * @returns {Array} Returns the new array of filtered values.
	     * @see _.difference, _.xor
	     * @example
	     *
	     * _.without([1, 2, 1, 3], 1, 2);
	     * // => [3]
	     */
	    var without = rest(function(array, values) {
	      return isArrayLikeObject(array)
	        ? baseDifference(array, values)
	        : [];
	    });

	    /**
	     * Creates an array of unique values that is the
	     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
	     * of the given arrays. The order of result values is determined by the order
	     * they occur in the arrays.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.4.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @returns {Array} Returns the new array of filtered values.
	     * @see _.difference, _.without
	     * @example
	     *
	     * _.xor([2, 1], [4, 2]);
	     * // => [1, 4]
	     */
	    var xor = rest(function(arrays) {
	      return baseXor(arrayFilter(arrays, isArrayLikeObject));
	    });

	    /**
	     * This method is like `_.xor` except that it accepts `iteratee` which is
	     * invoked for each element of each `arrays` to generate the criterion by
	     * which by which they're compared. The iteratee is invoked with one argument:
	     * (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Array} Returns the new array of filtered values.
	     * @example
	     *
	     * _.xorBy([2.1, 1.2], [4.3, 2.4], Math.floor);
	     * // => [1.2, 4.3]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
	     * // => [{ 'x': 2 }]
	     */
	    var xorBy = rest(function(arrays) {
	      var iteratee = last(arrays);
	      if (isArrayLikeObject(iteratee)) {
	        iteratee = undefined;
	      }
	      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee));
	    });

	    /**
	     * This method is like `_.xor` except that it accepts `comparator` which is
	     * invoked to compare elements of `arrays`. The comparator is invoked with
	     * two arguments: (arrVal, othVal).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to inspect.
	     * @param {Function} [comparator] The comparator invoked per element.
	     * @returns {Array} Returns the new array of filtered values.
	     * @example
	     *
	     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
	     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
	     *
	     * _.xorWith(objects, others, _.isEqual);
	     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
	     */
	    var xorWith = rest(function(arrays) {
	      var comparator = last(arrays);
	      if (isArrayLikeObject(comparator)) {
	        comparator = undefined;
	      }
	      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);
	    });

	    /**
	     * Creates an array of grouped elements, the first of which contains the
	     * first elements of the given arrays, the second of which contains the
	     * second elements of the given arrays, and so on.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to process.
	     * @returns {Array} Returns the new array of grouped elements.
	     * @example
	     *
	     * _.zip(['fred', 'barney'], [30, 40], [true, false]);
	     * // => [['fred', 30, true], ['barney', 40, false]]
	     */
	    var zip = rest(unzip);

	    /**
	     * This method is like `_.fromPairs` except that it accepts two arrays,
	     * one of property identifiers and one of corresponding values.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.4.0
	     * @category Array
	     * @param {Array} [props=[]] The property identifiers.
	     * @param {Array} [values=[]] The property values.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * _.zipObject(['a', 'b'], [1, 2]);
	     * // => { 'a': 1, 'b': 2 }
	     */
	    function zipObject(props, values) {
	      return baseZipObject(props || [], values || [], assignValue);
	    }

	    /**
	     * This method is like `_.zipObject` except that it supports property paths.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.1.0
	     * @category Array
	     * @param {Array} [props=[]] The property identifiers.
	     * @param {Array} [values=[]] The property values.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);
	     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }
	     */
	    function zipObjectDeep(props, values) {
	      return baseZipObject(props || [], values || [], baseSet);
	    }

	    /**
	     * This method is like `_.zip` except that it accepts `iteratee` to specify
	     * how grouped values should be combined. The iteratee is invoked with the
	     * elements of each group: (...group).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.8.0
	     * @category Array
	     * @param {...Array} [arrays] The arrays to process.
	     * @param {Function} [iteratee=_.identity] The function to combine grouped values.
	     * @returns {Array} Returns the new array of grouped elements.
	     * @example
	     *
	     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {
	     *   return a + b + c;
	     * });
	     * // => [111, 222]
	     */
	    var zipWith = rest(function(arrays) {
	      var length = arrays.length,
	          iteratee = length > 1 ? arrays[length - 1] : undefined;

	      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;
	      return unzipWith(arrays, iteratee);
	    });

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates a `lodash` wrapper instance that wraps `value` with explicit method
	     * chain sequences enabled. The result of such sequences must be unwrapped
	     * with `_#value`.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.3.0
	     * @category Seq
	     * @param {*} value The value to wrap.
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'age': 36 },
	     *   { 'user': 'fred',    'age': 40 },
	     *   { 'user': 'pebbles', 'age': 1 }
	     * ];
	     *
	     * var youngest = _
	     *   .chain(users)
	     *   .sortBy('age')
	     *   .map(function(o) {
	     *     return o.user + ' is ' + o.age;
	     *   })
	     *   .head()
	     *   .value();
	     * // => 'pebbles is 1'
	     */
	    function chain(value) {
	      var result = lodash(value);
	      result.__chain__ = true;
	      return result;
	    }

	    /**
	     * This method invokes `interceptor` and returns `value`. The interceptor
	     * is invoked with one argument; (value). The purpose of this method is to
	     * "tap into" a method chain sequence in order to modify intermediate results.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Seq
	     * @param {*} value The value to provide to `interceptor`.
	     * @param {Function} interceptor The function to invoke.
	     * @returns {*} Returns `value`.
	     * @example
	     *
	     * _([1, 2, 3])
	     *  .tap(function(array) {
	     *    // Mutate input array.
	     *    array.pop();
	     *  })
	     *  .reverse()
	     *  .value();
	     * // => [2, 1]
	     */
	    function tap(value, interceptor) {
	      interceptor(value);
	      return value;
	    }

	    /**
	     * This method is like `_.tap` except that it returns the result of `interceptor`.
	     * The purpose of this method is to "pass thru" values replacing intermediate
	     * results in a method chain sequence.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Seq
	     * @param {*} value The value to provide to `interceptor`.
	     * @param {Function} interceptor The function to invoke.
	     * @returns {*} Returns the result of `interceptor`.
	     * @example
	     *
	     * _('  abc  ')
	     *  .chain()
	     *  .trim()
	     *  .thru(function(value) {
	     *    return [value];
	     *  })
	     *  .value();
	     * // => ['abc']
	     */
	    function thru(value, interceptor) {
	      return interceptor(value);
	    }

	    /**
	     * This method is the wrapper version of `_.at`.
	     *
	     * @name at
	     * @memberOf _
	     * @since 1.0.0
	     * @category Seq
	     * @param {...(string|string[])} [paths] The property paths of elements to pick.
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
	     *
	     * _(object).at(['a[0].b.c', 'a[1]']).value();
	     * // => [3, 4]
	     *
	     * _(['a', 'b', 'c']).at(0, 2).value();
	     * // => ['a', 'c']
	     */
	    var wrapperAt = rest(function(paths) {
	      paths = baseFlatten(paths, 1);
	      var length = paths.length,
	          start = length ? paths[0] : 0,
	          value = this.__wrapped__,
	          interceptor = function(object) { return baseAt(object, paths); };

	      if (length > 1 || this.__actions__.length ||
	          !(value instanceof LazyWrapper) || !isIndex(start)) {
	        return this.thru(interceptor);
	      }
	      value = value.slice(start, +start + (length ? 1 : 0));
	      value.__actions__.push({
	        'func': thru,
	        'args': [interceptor],
	        'thisArg': undefined
	      });
	      return new LodashWrapper(value, this.__chain__).thru(function(array) {
	        if (length && !array.length) {
	          array.push(undefined);
	        }
	        return array;
	      });
	    });

	    /**
	     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.
	     *
	     * @name chain
	     * @memberOf _
	     * @since 0.1.0
	     * @category Seq
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney', 'age': 36 },
	     *   { 'user': 'fred',   'age': 40 }
	     * ];
	     *
	     * // A sequence without explicit chaining.
	     * _(users).head();
	     * // => { 'user': 'barney', 'age': 36 }
	     *
	     * // A sequence with explicit chaining.
	     * _(users)
	     *   .chain()
	     *   .head()
	     *   .pick('user')
	     *   .value();
	     * // => { 'user': 'barney' }
	     */
	    function wrapperChain() {
	      return chain(this);
	    }

	    /**
	     * Executes the chain sequence and returns the wrapped result.
	     *
	     * @name commit
	     * @memberOf _
	     * @since 3.2.0
	     * @category Seq
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * var array = [1, 2];
	     * var wrapped = _(array).push(3);
	     *
	     * console.log(array);
	     * // => [1, 2]
	     *
	     * wrapped = wrapped.commit();
	     * console.log(array);
	     * // => [1, 2, 3]
	     *
	     * wrapped.last();
	     * // => 3
	     *
	     * console.log(array);
	     * // => [1, 2, 3]
	     */
	    function wrapperCommit() {
	      return new LodashWrapper(this.value(), this.__chain__);
	    }

	    /**
	     * Gets the next value on a wrapped object following the
	     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).
	     *
	     * @name next
	     * @memberOf _
	     * @since 4.0.0
	     * @category Seq
	     * @returns {Object} Returns the next iterator value.
	     * @example
	     *
	     * var wrapped = _([1, 2]);
	     *
	     * wrapped.next();
	     * // => { 'done': false, 'value': 1 }
	     *
	     * wrapped.next();
	     * // => { 'done': false, 'value': 2 }
	     *
	     * wrapped.next();
	     * // => { 'done': true, 'value': undefined }
	     */
	    function wrapperNext() {
	      if (this.__values__ === undefined) {
	        this.__values__ = toArray(this.value());
	      }
	      var done = this.__index__ >= this.__values__.length,
	          value = done ? undefined : this.__values__[this.__index__++];

	      return { 'done': done, 'value': value };
	    }

	    /**
	     * Enables the wrapper to be iterable.
	     *
	     * @name Symbol.iterator
	     * @memberOf _
	     * @since 4.0.0
	     * @category Seq
	     * @returns {Object} Returns the wrapper object.
	     * @example
	     *
	     * var wrapped = _([1, 2]);
	     *
	     * wrapped[Symbol.iterator]() === wrapped;
	     * // => true
	     *
	     * Array.from(wrapped);
	     * // => [1, 2]
	     */
	    function wrapperToIterator() {
	      return this;
	    }

	    /**
	     * Creates a clone of the chain sequence planting `value` as the wrapped value.
	     *
	     * @name plant
	     * @memberOf _
	     * @since 3.2.0
	     * @category Seq
	     * @param {*} value The value to plant.
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * function square(n) {
	     *   return n * n;
	     * }
	     *
	     * var wrapped = _([1, 2]).map(square);
	     * var other = wrapped.plant([3, 4]);
	     *
	     * other.value();
	     * // => [9, 16]
	     *
	     * wrapped.value();
	     * // => [1, 4]
	     */
	    function wrapperPlant(value) {
	      var result,
	          parent = this;

	      while (parent instanceof baseLodash) {
	        var clone = wrapperClone(parent);
	        clone.__index__ = 0;
	        clone.__values__ = undefined;
	        if (result) {
	          previous.__wrapped__ = clone;
	        } else {
	          result = clone;
	        }
	        var previous = clone;
	        parent = parent.__wrapped__;
	      }
	      previous.__wrapped__ = value;
	      return result;
	    }

	    /**
	     * This method is the wrapper version of `_.reverse`.
	     *
	     * **Note:** This method mutates the wrapped array.
	     *
	     * @name reverse
	     * @memberOf _
	     * @since 0.1.0
	     * @category Seq
	     * @returns {Object} Returns the new `lodash` wrapper instance.
	     * @example
	     *
	     * var array = [1, 2, 3];
	     *
	     * _(array).reverse().value()
	     * // => [3, 2, 1]
	     *
	     * console.log(array);
	     * // => [3, 2, 1]
	     */
	    function wrapperReverse() {
	      var value = this.__wrapped__;
	      if (value instanceof LazyWrapper) {
	        var wrapped = value;
	        if (this.__actions__.length) {
	          wrapped = new LazyWrapper(this);
	        }
	        wrapped = wrapped.reverse();
	        wrapped.__actions__.push({
	          'func': thru,
	          'args': [reverse],
	          'thisArg': undefined
	        });
	        return new LodashWrapper(wrapped, this.__chain__);
	      }
	      return this.thru(reverse);
	    }

	    /**
	     * Executes the chain sequence to resolve the unwrapped value.
	     *
	     * @name value
	     * @memberOf _
	     * @since 0.1.0
	     * @alias toJSON, valueOf
	     * @category Seq
	     * @returns {*} Returns the resolved unwrapped value.
	     * @example
	     *
	     * _([1, 2, 3]).value();
	     * // => [1, 2, 3]
	     */
	    function wrapperValue() {
	      return baseWrapperValue(this.__wrapped__, this.__actions__);
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Creates an object composed of keys generated from the results of running
	     * each element of `collection` thru `iteratee`. The corresponding value of
	     * each key is the number of times the key was returned by `iteratee`. The
	     * iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.5.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee to transform keys.
	     * @returns {Object} Returns the composed aggregate object.
	     * @example
	     *
	     * _.countBy([6.1, 4.2, 6.3], Math.floor);
	     * // => { '4': 1, '6': 2 }
	     *
	     * _.countBy(['one', 'two', 'three'], 'length');
	     * // => { '3': 2, '5': 1 }
	     */
	    var countBy = createAggregator(function(result, value, key) {
	      hasOwnProperty.call(result, key) ? ++result[key] : (result[key] = 1);
	    });

	    /**
	     * Checks if `predicate` returns truthy for **all** elements of `collection`.
	     * Iteration is stopped once `predicate` returns falsey. The predicate is
	     * invoked with three arguments: (value, index|key, collection).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {boolean} Returns `true` if all elements pass the predicate check,
	     *  else `false`.
	     * @example
	     *
	     * _.every([true, 1, null, 'yes'], Boolean);
	     * // => false
	     *
	     * var users = [
	     *   { 'user': 'barney', 'age': 36, 'active': false },
	     *   { 'user': 'fred',   'age': 40, 'active': false }
	     * ];
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.every(users, { 'user': 'barney', 'active': false });
	     * // => false
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.every(users, ['active', false]);
	     * // => true
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.every(users, 'active');
	     * // => false
	     */
	    function every(collection, predicate, guard) {
	      var func = isArray(collection) ? arrayEvery : baseEvery;
	      if (guard && isIterateeCall(collection, predicate, guard)) {
	        predicate = undefined;
	      }
	      return func(collection, getIteratee(predicate, 3));
	    }

	    /**
	     * Iterates over elements of `collection`, returning an array of all elements
	     * `predicate` returns truthy for. The predicate is invoked with three
	     * arguments: (value, index|key, collection).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the new filtered array.
	     * @see _.reject
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney', 'age': 36, 'active': true },
	     *   { 'user': 'fred',   'age': 40, 'active': false }
	     * ];
	     *
	     * _.filter(users, function(o) { return !o.active; });
	     * // => objects for ['fred']
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.filter(users, { 'age': 36, 'active': true });
	     * // => objects for ['barney']
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.filter(users, ['active', false]);
	     * // => objects for ['fred']
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.filter(users, 'active');
	     * // => objects for ['barney']
	     */
	    function filter(collection, predicate) {
	      var func = isArray(collection) ? arrayFilter : baseFilter;
	      return func(collection, getIteratee(predicate, 3));
	    }

	    /**
	     * Iterates over elements of `collection`, returning the first element
	     * `predicate` returns truthy for. The predicate is invoked with three
	     * arguments: (value, index|key, collection).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to search.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {*} Returns the matched element, else `undefined`.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'age': 36, 'active': true },
	     *   { 'user': 'fred',    'age': 40, 'active': false },
	     *   { 'user': 'pebbles', 'age': 1,  'active': true }
	     * ];
	     *
	     * _.find(users, function(o) { return o.age < 40; });
	     * // => object for 'barney'
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.find(users, { 'age': 1, 'active': true });
	     * // => object for 'pebbles'
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.find(users, ['active', false]);
	     * // => object for 'fred'
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.find(users, 'active');
	     * // => object for 'barney'
	     */
	    function find(collection, predicate) {
	      predicate = getIteratee(predicate, 3);
	      if (isArray(collection)) {
	        var index = baseFindIndex(collection, predicate);
	        return index > -1 ? collection[index] : undefined;
	      }
	      return baseFind(collection, predicate, baseEach);
	    }

	    /**
	     * This method is like `_.find` except that it iterates over elements of
	     * `collection` from right to left.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to search.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {*} Returns the matched element, else `undefined`.
	     * @example
	     *
	     * _.findLast([1, 2, 3, 4], function(n) {
	     *   return n % 2 == 1;
	     * });
	     * // => 3
	     */
	    function findLast(collection, predicate) {
	      predicate = getIteratee(predicate, 3);
	      if (isArray(collection)) {
	        var index = baseFindIndex(collection, predicate, true);
	        return index > -1 ? collection[index] : undefined;
	      }
	      return baseFind(collection, predicate, baseEachRight);
	    }

	    /**
	     * Creates a flattened array of values by running each element in `collection`
	     * thru `iteratee` and flattening the mapped results. The iteratee is invoked
	     * with three arguments: (value, index|key, collection).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the new flattened array.
	     * @example
	     *
	     * function duplicate(n) {
	     *   return [n, n];
	     * }
	     *
	     * _.flatMap([1, 2], duplicate);
	     * // => [1, 1, 2, 2]
	     */
	    function flatMap(collection, iteratee) {
	      return baseFlatten(map(collection, iteratee), 1);
	    }

	    /**
	     * This method is like `_.flatMap` except that it recursively flattens the
	     * mapped results.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.7.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the new flattened array.
	     * @example
	     *
	     * function duplicate(n) {
	     *   return [[[n, n]]];
	     * }
	     *
	     * _.flatMapDeep([1, 2], duplicate);
	     * // => [1, 1, 2, 2]
	     */
	    function flatMapDeep(collection, iteratee) {
	      return baseFlatten(map(collection, iteratee), INFINITY);
	    }

	    /**
	     * This method is like `_.flatMap` except that it recursively flattens the
	     * mapped results up to `depth` times.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.7.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The function invoked per iteration.
	     * @param {number} [depth=1] The maximum recursion depth.
	     * @returns {Array} Returns the new flattened array.
	     * @example
	     *
	     * function duplicate(n) {
	     *   return [[[n, n]]];
	     * }
	     *
	     * _.flatMapDepth([1, 2], duplicate, 2);
	     * // => [[1, 1], [2, 2]]
	     */
	    function flatMapDepth(collection, iteratee, depth) {
	      depth = depth === undefined ? 1 : toInteger(depth);
	      return baseFlatten(map(collection, iteratee), depth);
	    }

	    /**
	     * Iterates over elements of `collection` and invokes `iteratee` for each element.
	     * The iteratee is invoked with three arguments: (value, index|key, collection).
	     * Iteratee functions may exit iteration early by explicitly returning `false`.
	     *
	     * **Note:** As with other "Collections" methods, objects with a "length"
	     * property are iterated like arrays. To avoid this behavior use `_.forIn`
	     * or `_.forOwn` for object iteration.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @alias each
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Array|Object} Returns `collection`.
	     * @see _.forEachRight
	     * @example
	     *
	     * _([1, 2]).forEach(function(value) {
	     *   console.log(value);
	     * });
	     * // => Logs `1` then `2`.
	     *
	     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {
	     *   console.log(key);
	     * });
	     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
	     */
	    function forEach(collection, iteratee) {
	      var func = isArray(collection) ? arrayEach : baseEach;
	      return func(collection, getIteratee(iteratee, 3));
	    }

	    /**
	     * This method is like `_.forEach` except that it iterates over elements of
	     * `collection` from right to left.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @alias eachRight
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Array|Object} Returns `collection`.
	     * @see _.forEach
	     * @example
	     *
	     * _.forEachRight([1, 2], function(value) {
	     *   console.log(value);
	     * });
	     * // => Logs `2` then `1`.
	     */
	    function forEachRight(collection, iteratee) {
	      var func = isArray(collection) ? arrayEachRight : baseEachRight;
	      return func(collection, getIteratee(iteratee, 3));
	    }

	    /**
	     * Creates an object composed of keys generated from the results of running
	     * each element of `collection` thru `iteratee`. The order of grouped values
	     * is determined by the order they occur in `collection`. The corresponding
	     * value of each key is an array of elements responsible for generating the
	     * key. The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee to transform keys.
	     * @returns {Object} Returns the composed aggregate object.
	     * @example
	     *
	     * _.groupBy([6.1, 4.2, 6.3], Math.floor);
	     * // => { '4': [4.2], '6': [6.1, 6.3] }
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.groupBy(['one', 'two', 'three'], 'length');
	     * // => { '3': ['one', 'two'], '5': ['three'] }
	     */
	    var groupBy = createAggregator(function(result, value, key) {
	      if (hasOwnProperty.call(result, key)) {
	        result[key].push(value);
	      } else {
	        result[key] = [value];
	      }
	    });

	    /**
	     * Checks if `value` is in `collection`. If `collection` is a string, it's
	     * checked for a substring of `value`, otherwise
	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * is used for equality comparisons. If `fromIndex` is negative, it's used as
	     * the offset from the end of `collection`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object|string} collection The collection to search.
	     * @param {*} value The value to search for.
	     * @param {number} [fromIndex=0] The index to search from.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
	     * @returns {boolean} Returns `true` if `value` is found, else `false`.
	     * @example
	     *
	     * _.includes([1, 2, 3], 1);
	     * // => true
	     *
	     * _.includes([1, 2, 3], 1, 2);
	     * // => false
	     *
	     * _.includes({ 'user': 'fred', 'age': 40 }, 'fred');
	     * // => true
	     *
	     * _.includes('pebbles', 'eb');
	     * // => true
	     */
	    function includes(collection, value, fromIndex, guard) {
	      collection = isArrayLike(collection) ? collection : values(collection);
	      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;

	      var length = collection.length;
	      if (fromIndex < 0) {
	        fromIndex = nativeMax(length + fromIndex, 0);
	      }
	      return isString(collection)
	        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)
	        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);
	    }

	    /**
	     * Invokes the method at `path` of each element in `collection`, returning
	     * an array of the results of each invoked method. Any additional arguments
	     * are provided to each invoked method. If `methodName` is a function, it's
	     * invoked for and `this` bound to, each element in `collection`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|string} path The path of the method to invoke or
	     *  the function invoked per iteration.
	     * @param {...*} [args] The arguments to invoke each method with.
	     * @returns {Array} Returns the array of results.
	     * @example
	     *
	     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');
	     * // => [[1, 5, 7], [1, 2, 3]]
	     *
	     * _.invokeMap([123, 456], String.prototype.split, '');
	     * // => [['1', '2', '3'], ['4', '5', '6']]
	     */
	    var invokeMap = rest(function(collection, path, args) {
	      var index = -1,
	          isFunc = typeof path == 'function',
	          isProp = isKey(path),
	          result = isArrayLike(collection) ? Array(collection.length) : [];

	      baseEach(collection, function(value) {
	        var func = isFunc ? path : ((isProp && value != null) ? value[path] : undefined);
	        result[++index] = func ? apply(func, value, args) : baseInvoke(value, path, args);
	      });
	      return result;
	    });

	    /**
	     * Creates an object composed of keys generated from the results of running
	     * each element of `collection` thru `iteratee`. The corresponding value of
	     * each key is the last element responsible for generating the key. The
	     * iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee to transform keys.
	     * @returns {Object} Returns the composed aggregate object.
	     * @example
	     *
	     * var array = [
	     *   { 'dir': 'left', 'code': 97 },
	     *   { 'dir': 'right', 'code': 100 }
	     * ];
	     *
	     * _.keyBy(array, function(o) {
	     *   return String.fromCharCode(o.code);
	     * });
	     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
	     *
	     * _.keyBy(array, 'dir');
	     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
	     */
	    var keyBy = createAggregator(function(result, value, key) {
	      result[key] = value;
	    });

	    /**
	     * Creates an array of values by running each element in `collection` thru
	     * `iteratee`. The iteratee is invoked with three arguments:
	     * (value, index|key, collection).
	     *
	     * Many lodash methods are guarded to work as iteratees for methods like
	     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
	     *
	     * The guarded methods are:
	     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,
	     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,
	     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,
	     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the new mapped array.
	     * @example
	     *
	     * function square(n) {
	     *   return n * n;
	     * }
	     *
	     * _.map([4, 8], square);
	     * // => [16, 64]
	     *
	     * _.map({ 'a': 4, 'b': 8 }, square);
	     * // => [16, 64] (iteration order is not guaranteed)
	     *
	     * var users = [
	     *   { 'user': 'barney' },
	     *   { 'user': 'fred' }
	     * ];
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.map(users, 'user');
	     * // => ['barney', 'fred']
	     */
	    function map(collection, iteratee) {
	      var func = isArray(collection) ? arrayMap : baseMap;
	      return func(collection, getIteratee(iteratee, 3));
	    }

	    /**
	     * This method is like `_.sortBy` except that it allows specifying the sort
	     * orders of the iteratees to sort by. If `orders` is unspecified, all values
	     * are sorted in ascending order. Otherwise, specify an order of "desc" for
	     * descending or "asc" for ascending sort order of corresponding values.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]
	     *  The iteratees to sort by.
	     * @param {string[]} [orders] The sort orders of `iteratees`.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
	     * @returns {Array} Returns the new sorted array.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'fred',   'age': 48 },
	     *   { 'user': 'barney', 'age': 34 },
	     *   { 'user': 'fred',   'age': 40 },
	     *   { 'user': 'barney', 'age': 36 }
	     * ];
	     *
	     * // Sort by `user` in ascending order and by `age` in descending order.
	     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);
	     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
	     */
	    function orderBy(collection, iteratees, orders, guard) {
	      if (collection == null) {
	        return [];
	      }
	      if (!isArray(iteratees)) {
	        iteratees = iteratees == null ? [] : [iteratees];
	      }
	      orders = guard ? undefined : orders;
	      if (!isArray(orders)) {
	        orders = orders == null ? [] : [orders];
	      }
	      return baseOrderBy(collection, iteratees, orders);
	    }

	    /**
	     * Creates an array of elements split into two groups, the first of which
	     * contains elements `predicate` returns truthy for, the second of which
	     * contains elements `predicate` returns falsey for. The predicate is
	     * invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the array of grouped elements.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney',  'age': 36, 'active': false },
	     *   { 'user': 'fred',    'age': 40, 'active': true },
	     *   { 'user': 'pebbles', 'age': 1,  'active': false }
	     * ];
	     *
	     * _.partition(users, function(o) { return o.active; });
	     * // => objects for [['fred'], ['barney', 'pebbles']]
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.partition(users, { 'age': 1, 'active': false });
	     * // => objects for [['pebbles'], ['barney', 'fred']]
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.partition(users, ['active', false]);
	     * // => objects for [['barney', 'pebbles'], ['fred']]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.partition(users, 'active');
	     * // => objects for [['fred'], ['barney', 'pebbles']]
	     */
	    var partition = createAggregator(function(result, value, key) {
	      result[key ? 0 : 1].push(value);
	    }, function() { return [[], []]; });

	    /**
	     * Reduces `collection` to a value which is the accumulated result of running
	     * each element in `collection` thru `iteratee`, where each successive
	     * invocation is supplied the return value of the previous. If `accumulator`
	     * is not given, the first element of `collection` is used as the initial
	     * value. The iteratee is invoked with four arguments:
	     * (accumulator, value, index|key, collection).
	     *
	     * Many lodash methods are guarded to work as iteratees for methods like
	     * `_.reduce`, `_.reduceRight`, and `_.transform`.
	     *
	     * The guarded methods are:
	     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,
	     * and `sortBy`
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @param {*} [accumulator] The initial value.
	     * @returns {*} Returns the accumulated value.
	     * @see _.reduceRight
	     * @example
	     *
	     * _.reduce([1, 2], function(sum, n) {
	     *   return sum + n;
	     * }, 0);
	     * // => 3
	     *
	     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
	     *   (result[value] || (result[value] = [])).push(key);
	     *   return result;
	     * }, {});
	     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)
	     */
	    function reduce(collection, iteratee, accumulator) {
	      var func = isArray(collection) ? arrayReduce : baseReduce,
	          initAccum = arguments.length < 3;

	      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);
	    }

	    /**
	     * This method is like `_.reduce` except that it iterates over elements of
	     * `collection` from right to left.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @param {*} [accumulator] The initial value.
	     * @returns {*} Returns the accumulated value.
	     * @see _.reduce
	     * @example
	     *
	     * var array = [[0, 1], [2, 3], [4, 5]];
	     *
	     * _.reduceRight(array, function(flattened, other) {
	     *   return flattened.concat(other);
	     * }, []);
	     * // => [4, 5, 2, 3, 0, 1]
	     */
	    function reduceRight(collection, iteratee, accumulator) {
	      var func = isArray(collection) ? arrayReduceRight : baseReduce,
	          initAccum = arguments.length < 3;

	      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);
	    }

	    /**
	     * The opposite of `_.filter`; this method returns the elements of `collection`
	     * that `predicate` does **not** return truthy for.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Array} Returns the new filtered array.
	     * @see _.filter
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney', 'age': 36, 'active': false },
	     *   { 'user': 'fred',   'age': 40, 'active': true }
	     * ];
	     *
	     * _.reject(users, function(o) { return !o.active; });
	     * // => objects for ['fred']
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.reject(users, { 'age': 40, 'active': true });
	     * // => objects for ['barney']
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.reject(users, ['active', false]);
	     * // => objects for ['fred']
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.reject(users, 'active');
	     * // => objects for ['barney']
	     */
	    function reject(collection, predicate) {
	      var func = isArray(collection) ? arrayFilter : baseFilter;
	      predicate = getIteratee(predicate, 3);
	      return func(collection, function(value, index, collection) {
	        return !predicate(value, index, collection);
	      });
	    }

	    /**
	     * Gets a random element from `collection`.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to sample.
	     * @returns {*} Returns the random element.
	     * @example
	     *
	     * _.sample([1, 2, 3, 4]);
	     * // => 2
	     */
	    function sample(collection) {
	      var array = isArrayLike(collection) ? collection : values(collection),
	          length = array.length;

	      return length > 0 ? array[baseRandom(0, length - 1)] : undefined;
	    }

	    /**
	     * Gets `n` random elements at unique keys from `collection` up to the
	     * size of `collection`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to sample.
	     * @param {number} [n=1] The number of elements to sample.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the random elements.
	     * @example
	     *
	     * _.sampleSize([1, 2, 3], 2);
	     * // => [3, 1]
	     *
	     * _.sampleSize([1, 2, 3], 4);
	     * // => [2, 3, 1]
	     */
	    function sampleSize(collection, n, guard) {
	      var index = -1,
	          result = toArray(collection),
	          length = result.length,
	          lastIndex = length - 1;

	      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {
	        n = 1;
	      } else {
	        n = baseClamp(toInteger(n), 0, length);
	      }
	      while (++index < n) {
	        var rand = baseRandom(index, lastIndex),
	            value = result[rand];

	        result[rand] = result[index];
	        result[index] = value;
	      }
	      result.length = n;
	      return result;
	    }

	    /**
	     * Creates an array of shuffled values, using a version of the
	     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to shuffle.
	     * @returns {Array} Returns the new shuffled array.
	     * @example
	     *
	     * _.shuffle([1, 2, 3, 4]);
	     * // => [4, 1, 3, 2]
	     */
	    function shuffle(collection) {
	      return sampleSize(collection, MAX_ARRAY_LENGTH);
	    }

	    /**
	     * Gets the size of `collection` by returning its length for array-like
	     * values or the number of own enumerable string keyed properties for objects.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to inspect.
	     * @returns {number} Returns the collection size.
	     * @example
	     *
	     * _.size([1, 2, 3]);
	     * // => 3
	     *
	     * _.size({ 'a': 1, 'b': 2 });
	     * // => 2
	     *
	     * _.size('pebbles');
	     * // => 7
	     */
	    function size(collection) {
	      if (collection == null) {
	        return 0;
	      }
	      if (isArrayLike(collection)) {
	        var result = collection.length;
	        return (result && isString(collection)) ? stringSize(collection) : result;
	      }
	      if (isObjectLike(collection)) {
	        var tag = getTag(collection);
	        if (tag == mapTag || tag == setTag) {
	          return collection.size;
	        }
	      }
	      return keys(collection).length;
	    }

	    /**
	     * Checks if `predicate` returns truthy for **any** element of `collection`.
	     * Iteration is stopped once `predicate` returns truthy. The predicate is
	     * invoked with three arguments: (value, index|key, collection).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {boolean} Returns `true` if any element passes the predicate check,
	     *  else `false`.
	     * @example
	     *
	     * _.some([null, 0, 'yes', false], Boolean);
	     * // => true
	     *
	     * var users = [
	     *   { 'user': 'barney', 'active': true },
	     *   { 'user': 'fred',   'active': false }
	     * ];
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.some(users, { 'user': 'barney', 'active': false });
	     * // => false
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.some(users, ['active', false]);
	     * // => true
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.some(users, 'active');
	     * // => true
	     */
	    function some(collection, predicate, guard) {
	      var func = isArray(collection) ? arraySome : baseSome;
	      if (guard && isIterateeCall(collection, predicate, guard)) {
	        predicate = undefined;
	      }
	      return func(collection, getIteratee(predicate, 3));
	    }

	    /**
	     * Creates an array of elements, sorted in ascending order by the results of
	     * running each element in a collection thru each iteratee. This method
	     * performs a stable sort, that is, it preserves the original sort order of
	     * equal elements. The iteratees are invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Collection
	     * @param {Array|Object} collection The collection to iterate over.
	     * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])}
	     *  [iteratees=[_.identity]] The iteratees to sort by.
	     * @returns {Array} Returns the new sorted array.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'fred',   'age': 48 },
	     *   { 'user': 'barney', 'age': 36 },
	     *   { 'user': 'fred',   'age': 40 },
	     *   { 'user': 'barney', 'age': 34 }
	     * ];
	     *
	     * _.sortBy(users, function(o) { return o.user; });
	     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
	     *
	     * _.sortBy(users, ['user', 'age']);
	     * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]
	     *
	     * _.sortBy(users, 'user', function(o) {
	     *   return Math.floor(o.age / 10);
	     * });
	     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
	     */
	    var sortBy = rest(function(collection, iteratees) {
	      if (collection == null) {
	        return [];
	      }
	      var length = iteratees.length;
	      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {
	        iteratees = [];
	      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {
	        iteratees = [iteratees[0]];
	      }
	      iteratees = (iteratees.length == 1 && isArray(iteratees[0]))
	        ? iteratees[0]
	        : baseFlatten(iteratees, 1, isFlattenableIteratee);

	      return baseOrderBy(collection, iteratees, []);
	    });

	    /*------------------------------------------------------------------------*/

	    /**
	     * Gets the timestamp of the number of milliseconds that have elapsed since
	     * the Unix epoch (1 January 1970 00:00:00 UTC).
	     *
	     * @static
	     * @memberOf _
	     * @since 2.4.0
	     * @type {Function}
	     * @category Date
	     * @returns {number} Returns the timestamp.
	     * @example
	     *
	     * _.defer(function(stamp) {
	     *   console.log(_.now() - stamp);
	     * }, _.now());
	     * // => Logs the number of milliseconds it took for the deferred function to be invoked.
	     */
	    var now = Date.now;

	    /*------------------------------------------------------------------------*/

	    /**
	     * The opposite of `_.before`; this method creates a function that invokes
	     * `func` once it's called `n` or more times.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {number} n The number of calls before `func` is invoked.
	     * @param {Function} func The function to restrict.
	     * @returns {Function} Returns the new restricted function.
	     * @example
	     *
	     * var saves = ['profile', 'settings'];
	     *
	     * var done = _.after(saves.length, function() {
	     *   console.log('done saving!');
	     * });
	     *
	     * _.forEach(saves, function(type) {
	     *   asyncSave({ 'type': type, 'complete': done });
	     * });
	     * // => Logs 'done saving!' after the two async saves have completed.
	     */
	    function after(n, func) {
	      if (typeof func != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      n = toInteger(n);
	      return function() {
	        if (--n < 1) {
	          return func.apply(this, arguments);
	        }
	      };
	    }

	    /**
	     * Creates a function that invokes `func`, with up to `n` arguments,
	     * ignoring any additional arguments.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Function
	     * @param {Function} func The function to cap arguments for.
	     * @param {number} [n=func.length] The arity cap.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Function} Returns the new capped function.
	     * @example
	     *
	     * _.map(['6', '8', '10'], _.ary(parseInt, 1));
	     * // => [6, 8, 10]
	     */
	    function ary(func, n, guard) {
	      n = guard ? undefined : n;
	      n = (func && n == null) ? func.length : n;
	      return 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's called less than `n` times. Subsequent
	     * calls to the created function return the result of the last `func` invocation.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Function
	     * @param {number} n The number of calls at which `func` is no longer invoked.
	     * @param {Function} func The function to restrict.
	     * @returns {Function} Returns the new restricted function.
	     * @example
	     *
	     * jQuery(element).on('click', _.before(5, addContactToList));
	     * // => allows adding up to 4 contacts to the list
	     */
	    function before(n, func) {
	      var result;
	      if (typeof func != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      n = toInteger(n);
	      return function() {
	        if (--n > 0) {
	          result = func.apply(this, arguments);
	        }
	        if (n <= 1) {
	          func = undefined;
	        }
	        return result;
	      };
	    }

	    /**
	     * Creates a function that invokes `func` with the `this` binding of `thisArg`
	     * and `partials` prepended to the arguments it receives.
	     *
	     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,
	     * may be used as a placeholder for partially applied arguments.
	     *
	     * **Note:** Unlike native `Function#bind` this method doesn't set the "length"
	     * property of bound functions.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to bind.
	     * @param {*} thisArg The `this` binding of `func`.
	     * @param {...*} [partials] The arguments to be partially applied.
	     * @returns {Function} Returns the new bound function.
	     * @example
	     *
	     * var greet = function(greeting, punctuation) {
	     *   return greeting + ' ' + this.user + punctuation;
	     * };
	     *
	     * var object = { 'user': 'fred' };
	     *
	     * var bound = _.bind(greet, object, 'hi');
	     * bound('!');
	     * // => 'hi fred!'
	     *
	     * // Bound with placeholders.
	     * var bound = _.bind(greet, object, _, '!');
	     * bound('hi');
	     * // => 'hi fred!'
	     */
	    var bind = rest(function(func, thisArg, partials) {
	      var bitmask = BIND_FLAG;
	      if (partials.length) {
	        var holders = replaceHolders(partials, getHolder(bind));
	        bitmask |= PARTIAL_FLAG;
	      }
	      return createWrapper(func, bitmask, thisArg, partials, holders);
	    });

	    /**
	     * Creates a function that invokes the method at `object[key]` with `partials`
	     * prepended to the arguments it receives.
	     *
	     * This method differs from `_.bind` by allowing bound functions to reference
	     * methods that may be redefined or don't yet exist. See
	     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
	     * for more details.
	     *
	     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic
	     * builds, may be used as a placeholder for partially applied arguments.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.10.0
	     * @category Function
	     * @param {Object} object The object to invoke the method on.
	     * @param {string} key The key of the method.
	     * @param {...*} [partials] The arguments to be partially applied.
	     * @returns {Function} Returns the new bound function.
	     * @example
	     *
	     * var object = {
	     *   'user': 'fred',
	     *   'greet': function(greeting, punctuation) {
	     *     return greeting + ' ' + this.user + punctuation;
	     *   }
	     * };
	     *
	     * var bound = _.bindKey(object, 'greet', 'hi');
	     * bound('!');
	     * // => 'hi fred!'
	     *
	     * object.greet = function(greeting, punctuation) {
	     *   return greeting + 'ya ' + this.user + punctuation;
	     * };
	     *
	     * bound('!');
	     * // => 'hiya fred!'
	     *
	     * // Bound with placeholders.
	     * var bound = _.bindKey(object, 'greet', _, '!');
	     * bound('hi');
	     * // => 'hiya fred!'
	     */
	    var bindKey = rest(function(object, key, partials) {
	      var bitmask = BIND_FLAG | BIND_KEY_FLAG;
	      if (partials.length) {
	        var holders = replaceHolders(partials, getHolder(bindKey));
	        bitmask |= PARTIAL_FLAG;
	      }
	      return createWrapper(key, bitmask, object, partials, holders);
	    });

	    /**
	     * Creates a function that accepts arguments of `func` and either invokes
	     * `func` returning its result, if at least `arity` number of arguments have
	     * been provided, or returns a function that accepts the remaining `func`
	     * arguments, and so on. The arity of `func` may be specified if `func.length`
	     * is not sufficient.
	     *
	     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,
	     * may be used as a placeholder for provided arguments.
	     *
	     * **Note:** This method doesn't set the "length" property of curried functions.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Function
	     * @param {Function} func The function to curry.
	     * @param {number} [arity=func.length] The arity of `func`.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Function} Returns the new curried function.
	     * @example
	     *
	     * var abc = function(a, b, c) {
	     *   return [a, b, c];
	     * };
	     *
	     * var curried = _.curry(abc);
	     *
	     * curried(1)(2)(3);
	     * // => [1, 2, 3]
	     *
	     * curried(1, 2)(3);
	     * // => [1, 2, 3]
	     *
	     * curried(1, 2, 3);
	     * // => [1, 2, 3]
	     *
	     * // Curried with placeholders.
	     * curried(1)(_, 3)(2);
	     * // => [1, 2, 3]
	     */
	    function curry(func, arity, guard) {
	      arity = guard ? undefined : arity;
	      var result = createWrapper(func, CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);
	      result.placeholder = curry.placeholder;
	      return result;
	    }

	    /**
	     * This method is like `_.curry` except that arguments are applied to `func`
	     * in the manner of `_.partialRight` instead of `_.partial`.
	     *
	     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic
	     * builds, may be used as a placeholder for provided arguments.
	     *
	     * **Note:** This method doesn't set the "length" property of curried functions.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Function
	     * @param {Function} func The function to curry.
	     * @param {number} [arity=func.length] The arity of `func`.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Function} Returns the new curried function.
	     * @example
	     *
	     * var abc = function(a, b, c) {
	     *   return [a, b, c];
	     * };
	     *
	     * var curried = _.curryRight(abc);
	     *
	     * curried(3)(2)(1);
	     * // => [1, 2, 3]
	     *
	     * curried(2, 3)(1);
	     * // => [1, 2, 3]
	     *
	     * curried(1, 2, 3);
	     * // => [1, 2, 3]
	     *
	     * // Curried with placeholders.
	     * curried(3)(1, _)(2);
	     * // => [1, 2, 3]
	     */
	    function curryRight(func, arity, guard) {
	      arity = guard ? undefined : arity;
	      var result = createWrapper(func, CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);
	      result.placeholder = curryRight.placeholder;
	      return result;
	    }

	    /**
	     * Creates a debounced function that delays invoking `func` until after `wait`
	     * milliseconds have elapsed since the last time the debounced function was
	     * invoked. The debounced function comes with a `cancel` method to cancel
	     * delayed `func` invocations and a `flush` method to immediately invoke them.
	     * Provide an options object to indicate whether `func` should be invoked on
	     * the leading and/or trailing edge of the `wait` timeout. The `func` is invoked
	     * with the last arguments provided to the debounced function. Subsequent calls
	     * to the debounced function return the result of the last `func` invocation.
	     *
	     * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
	     * on the trailing edge of the timeout only if the debounced function is
	     * invoked more than once during the `wait` timeout.
	     *
	     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
	     * for details over the differences between `_.debounce` and `_.throttle`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to debounce.
	     * @param {number} [wait=0] The number of milliseconds to delay.
	     * @param {Object} [options={}] The options object.
	     * @param {boolean} [options.leading=false]
	     *  Specify invoking on the leading edge of the timeout.
	     * @param {number} [options.maxWait]
	     *  The maximum time `func` is allowed to be delayed before it's invoked.
	     * @param {boolean} [options.trailing=true]
	     *  Specify invoking on the trailing edge of the timeout.
	     * @returns {Function} Returns the new debounced function.
	     * @example
	     *
	     * // Avoid costly calculations while the window size is in flux.
	     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
	     *
	     * // Invoke `sendMail` when clicked, debouncing subsequent calls.
	     * jQuery(element).on('click', _.debounce(sendMail, 300, {
	     *   'leading': true,
	     *   'trailing': false
	     * }));
	     *
	     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
	     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
	     * var source = new EventSource('/stream');
	     * jQuery(source).on('message', debounced);
	     *
	     * // Cancel the trailing debounced invocation.
	     * jQuery(window).on('popstate', debounced.cancel);
	     */
	    function debounce(func, wait, options) {
	      var lastArgs,
	          lastThis,
	          maxWait,
	          result,
	          timerId,
	          lastCallTime = 0,
	          lastInvokeTime = 0,
	          leading = false,
	          maxing = false,
	          trailing = true;

	      if (typeof func != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      wait = toNumber(wait) || 0;
	      if (isObject(options)) {
	        leading = !!options.leading;
	        maxing = 'maxWait' in options;
	        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
	        trailing = 'trailing' in options ? !!options.trailing : trailing;
	      }

	      function invokeFunc(time) {
	        var args = lastArgs,
	            thisArg = lastThis;

	        lastArgs = lastThis = undefined;
	        lastInvokeTime = time;
	        result = func.apply(thisArg, args);
	        return result;
	      }

	      function leadingEdge(time) {
	        // Reset any `maxWait` timer.
	        lastInvokeTime = time;
	        // Start the timer for the trailing edge.
	        timerId = setTimeout(timerExpired, wait);
	        // Invoke the leading edge.
	        return leading ? invokeFunc(time) : result;
	      }

	      function remainingWait(time) {
	        var timeSinceLastCall = time - lastCallTime,
	            timeSinceLastInvoke = time - lastInvokeTime,
	            result = wait - timeSinceLastCall;

	        return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;
	      }

	      function shouldInvoke(time) {
	        var timeSinceLastCall = time - lastCallTime,
	            timeSinceLastInvoke = time - lastInvokeTime;

	        // Either this is the first call, activity has stopped and we're at the
	        // trailing edge, the system time has gone backwards and we're treating
	        // it as the trailing edge, or we've hit the `maxWait` limit.
	        return (!lastCallTime || (timeSinceLastCall >= wait) ||
	          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));
	      }

	      function timerExpired() {
	        var time = now();
	        if (shouldInvoke(time)) {
	          return trailingEdge(time);
	        }
	        // Restart the timer.
	        timerId = setTimeout(timerExpired, remainingWait(time));
	      }

	      function trailingEdge(time) {
	        clearTimeout(timerId);
	        timerId = undefined;

	        // Only invoke if we have `lastArgs` which means `func` has been
	        // debounced at least once.
	        if (trailing && lastArgs) {
	          return invokeFunc(time);
	        }
	        lastArgs = lastThis = undefined;
	        return result;
	      }

	      function cancel() {
	        if (timerId !== undefined) {
	          clearTimeout(timerId);
	        }
	        lastCallTime = lastInvokeTime = 0;
	        lastArgs = lastThis = timerId = undefined;
	      }

	      function flush() {
	        return timerId === undefined ? result : trailingEdge(now());
	      }

	      function debounced() {
	        var time = now(),
	            isInvoking = shouldInvoke(time);

	        lastArgs = arguments;
	        lastThis = this;
	        lastCallTime = time;

	        if (isInvoking) {
	          if (timerId === undefined) {
	            return leadingEdge(lastCallTime);
	          }
	          if (maxing) {
	            // Handle invocations in a tight loop.
	            clearTimeout(timerId);
	            timerId = setTimeout(timerExpired, wait);
	            return invokeFunc(lastCallTime);
	          }
	        }
	        if (timerId === undefined) {
	          timerId = setTimeout(timerExpired, wait);
	        }
	        return result;
	      }
	      debounced.cancel = cancel;
	      debounced.flush = flush;
	      return debounced;
	    }

	    /**
	     * Defers invoking the `func` until the current call stack has cleared. Any
	     * additional arguments are provided to `func` when it's invoked.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to defer.
	     * @param {...*} [args] The arguments to invoke `func` with.
	     * @returns {number} Returns the timer id.
	     * @example
	     *
	     * _.defer(function(text) {
	     *   console.log(text);
	     * }, 'deferred');
	     * // => Logs 'deferred' after one or more milliseconds.
	     */
	    var defer = rest(function(func, args) {
	      return baseDelay(func, 1, args);
	    });

	    /**
	     * Invokes `func` after `wait` milliseconds. Any additional arguments are
	     * provided to `func` when it's invoked.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to delay.
	     * @param {number} wait The number of milliseconds to delay invocation.
	     * @param {...*} [args] The arguments to invoke `func` with.
	     * @returns {number} Returns the timer id.
	     * @example
	     *
	     * _.delay(function(text) {
	     *   console.log(text);
	     * }, 1000, 'later');
	     * // => Logs 'later' after one second.
	     */
	    var delay = rest(function(func, wait, args) {
	      return baseDelay(func, toNumber(wait) || 0, args);
	    });

	    /**
	     * Creates a function that invokes `func` with arguments reversed.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Function
	     * @param {Function} func The function to flip arguments for.
	     * @returns {Function} Returns the new flipped function.
	     * @example
	     *
	     * var flipped = _.flip(function() {
	     *   return _.toArray(arguments);
	     * });
	     *
	     * flipped('a', 'b', 'c', 'd');
	     * // => ['d', 'c', 'b', 'a']
	     */
	    function flip(func) {
	      return createWrapper(func, FLIP_FLAG);
	    }

	    /**
	     * Creates a function that memoizes the result of `func`. If `resolver` is
	     * provided, it determines the cache key for storing the result based on the
	     * arguments provided to the memoized function. By default, the first argument
	     * provided to the memoized function is used as the map cache key. The `func`
	     * is invoked with the `this` binding of the memoized function.
	     *
	     * **Note:** The cache is exposed as the `cache` property on the memoized
	     * function. Its creation may be customized by replacing the `_.memoize.Cache`
	     * constructor with one whose instances implement the
	     * [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object)
	     * method interface of `delete`, `get`, `has`, and `set`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to have its output memoized.
	     * @param {Function} [resolver] The function to resolve the cache key.
	     * @returns {Function} Returns the new memoized function.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': 2 };
	     * var other = { 'c': 3, 'd': 4 };
	     *
	     * var values = _.memoize(_.values);
	     * values(object);
	     * // => [1, 2]
	     *
	     * values(other);
	     * // => [3, 4]
	     *
	     * object.a = 2;
	     * values(object);
	     * // => [1, 2]
	     *
	     * // Modify the result cache.
	     * values.cache.set(object, ['a', 'b']);
	     * values(object);
	     * // => ['a', 'b']
	     *
	     * // Replace `_.memoize.Cache`.
	     * _.memoize.Cache = WeakMap;
	     */
	    function memoize(func, resolver) {
	      if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      var memoized = function() {
	        var args = arguments,
	            key = resolver ? resolver.apply(this, args) : args[0],
	            cache = memoized.cache;

	        if (cache.has(key)) {
	          return cache.get(key);
	        }
	        var result = func.apply(this, args);
	        memoized.cache = cache.set(key, result);
	        return result;
	      };
	      memoized.cache = new (memoize.Cache || MapCache);
	      return memoized;
	    }

	    // Assign cache to `_.memoize`.
	    memoize.Cache = MapCache;

	    /**
	     * Creates a function that negates the result of the predicate `func`. The
	     * `func` predicate is invoked with the `this` binding and arguments of the
	     * created function.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Function
	     * @param {Function} predicate The predicate to negate.
	     * @returns {Function} Returns the new negated function.
	     * @example
	     *
	     * function isEven(n) {
	     *   return n % 2 == 0;
	     * }
	     *
	     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
	     * // => [1, 3, 5]
	     */
	    function negate(predicate) {
	      if (typeof predicate != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      return function() {
	        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 invocation. The `func` is
	     * invoked with the `this` binding and arguments of the created function.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to restrict.
	     * @returns {Function} Returns the new restricted function.
	     * @example
	     *
	     * var initialize = _.once(createApplication);
	     * initialize();
	     * initialize();
	     * // `initialize` invokes `createApplication` once
	     */
	    function once(func) {
	      return before(2, func);
	    }

	    /**
	     * Creates a function that invokes `func` with arguments transformed by
	     * corresponding `transforms`.
	     *
	     * @static
	     * @since 4.0.0
	     * @memberOf _
	     * @category Function
	     * @param {Function} func The function to wrap.
	     * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])}
	     *  [transforms[_.identity]] The functions to transform.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * function doubled(n) {
	     *   return n * 2;
	     * }
	     *
	     * function square(n) {
	     *   return n * n;
	     * }
	     *
	     * var func = _.overArgs(function(x, y) {
	     *   return [x, y];
	     * }, square, doubled);
	     *
	     * func(9, 3);
	     * // => [81, 6]
	     *
	     * func(10, 5);
	     * // => [100, 10]
	     */
	    var overArgs = rest(function(func, transforms) {
	      transforms = (transforms.length == 1 && isArray(transforms[0]))
	        ? arrayMap(transforms[0], baseUnary(getIteratee()))
	        : arrayMap(baseFlatten(transforms, 1, isFlattenableIteratee), baseUnary(getIteratee()));

	      var funcsLength = transforms.length;
	      return rest(function(args) {
	        var index = -1,
	            length = nativeMin(args.length, funcsLength);

	        while (++index < length) {
	          args[index] = transforms[index].call(this, args[index]);
	        }
	        return apply(func, this, args);
	      });
	    });

	    /**
	     * Creates a function that invokes `func` with `partials` prepended to the
	     * arguments it receives. This method is like `_.bind` except it does **not**
	     * alter the `this` binding.
	     *
	     * The `_.partial.placeholder` value, which defaults to `_` in monolithic
	     * builds, may be used as a placeholder for partially applied arguments.
	     *
	     * **Note:** This method doesn't set the "length" property of partially
	     * applied functions.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.2.0
	     * @category Function
	     * @param {Function} func The function to partially apply arguments to.
	     * @param {...*} [partials] The arguments to be partially applied.
	     * @returns {Function} Returns the new partially applied function.
	     * @example
	     *
	     * var greet = function(greeting, name) {
	     *   return greeting + ' ' + name;
	     * };
	     *
	     * var sayHelloTo = _.partial(greet, 'hello');
	     * sayHelloTo('fred');
	     * // => 'hello fred'
	     *
	     * // Partially applied with placeholders.
	     * var greetFred = _.partial(greet, _, 'fred');
	     * greetFred('hi');
	     * // => 'hi fred'
	     */
	    var partial = rest(function(func, partials) {
	      var holders = replaceHolders(partials, getHolder(partial));
	      return createWrapper(func, PARTIAL_FLAG, undefined, partials, holders);
	    });

	    /**
	     * This method is like `_.partial` except that partially applied arguments
	     * are appended to the arguments it receives.
	     *
	     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic
	     * builds, may be used as a placeholder for partially applied arguments.
	     *
	     * **Note:** This method doesn't set the "length" property of partially
	     * applied functions.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.0.0
	     * @category Function
	     * @param {Function} func The function to partially apply arguments to.
	     * @param {...*} [partials] The arguments to be partially applied.
	     * @returns {Function} Returns the new partially applied function.
	     * @example
	     *
	     * var greet = function(greeting, name) {
	     *   return greeting + ' ' + name;
	     * };
	     *
	     * var greetFred = _.partialRight(greet, 'fred');
	     * greetFred('hi');
	     * // => 'hi fred'
	     *
	     * // Partially applied with placeholders.
	     * var sayHelloTo = _.partialRight(greet, 'hello', _);
	     * sayHelloTo('fred');
	     * // => 'hello fred'
	     */
	    var partialRight = rest(function(func, partials) {
	      var holders = replaceHolders(partials, getHolder(partialRight));
	      return createWrapper(func, PARTIAL_RIGHT_FLAG, undefined, partials, holders);
	    });

	    /**
	     * Creates a function that invokes `func` with arguments arranged according
	     * to the specified `indexes` where the argument value at the first index is
	     * provided as the first argument, the argument value at the second index is
	     * provided as the second argument, and so on.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Function
	     * @param {Function} func The function to rearrange arguments for.
	     * @param {...(number|number[])} indexes The arranged argument indexes.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var rearged = _.rearg(function(a, b, c) {
	     *   return [a, b, c];
	     * }, 2, 0, 1);
	     *
	     * rearged('b', 'c', 'a')
	     * // => ['a', 'b', 'c']
	     */
	    var rearg = rest(function(func, indexes) {
	      return createWrapper(func, REARG_FLAG, undefined, undefined, undefined, baseFlatten(indexes, 1));
	    });

	    /**
	     * Creates a function that invokes `func` with the `this` binding of the
	     * created function and arguments from `start` and beyond provided as
	     * an array.
	     *
	     * **Note:** This method is based on the
	     * [rest parameter](https://mdn.io/rest_parameters).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Function
	     * @param {Function} func The function to apply a rest parameter to.
	     * @param {number} [start=func.length-1] The start position of the rest parameter.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var say = _.rest(function(what, names) {
	     *   return what + ' ' + _.initial(names).join(', ') +
	     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
	     * });
	     *
	     * say('hello', 'fred', 'barney', 'pebbles');
	     * // => 'hello fred, barney, & pebbles'
	     */
	    function rest(func, start) {
	      if (typeof func != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      start = nativeMax(start === undefined ? (func.length - 1) : toInteger(start), 0);
	      return function() {
	        var args = arguments,
	            index = -1,
	            length = nativeMax(args.length - start, 0),
	            array = Array(length);

	        while (++index < length) {
	          array[index] = args[start + index];
	        }
	        switch (start) {
	          case 0: return func.call(this, array);
	          case 1: return func.call(this, args[0], array);
	          case 2: return func.call(this, args[0], args[1], array);
	        }
	        var otherArgs = Array(start + 1);
	        index = -1;
	        while (++index < start) {
	          otherArgs[index] = args[index];
	        }
	        otherArgs[start] = array;
	        return apply(func, this, otherArgs);
	      };
	    }

	    /**
	     * Creates a function that invokes `func` with the `this` binding of the
	     * create function and an array of arguments much like
	     * [`Function#apply`](http://www.ecma-international.org/ecma-262/6.0/#sec-function.prototype.apply).
	     *
	     * **Note:** This method is based on the
	     * [spread operator](https://mdn.io/spread_operator).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.2.0
	     * @category Function
	     * @param {Function} func The function to spread arguments over.
	     * @param {number} [start=0] The start position of the spread.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var say = _.spread(function(who, what) {
	     *   return who + ' says ' + what;
	     * });
	     *
	     * say(['fred', 'hello']);
	     * // => 'fred says hello'
	     *
	     * var numbers = Promise.all([
	     *   Promise.resolve(40),
	     *   Promise.resolve(36)
	     * ]);
	     *
	     * numbers.then(_.spread(function(x, y) {
	     *   return x + y;
	     * }));
	     * // => a Promise of 76
	     */
	    function spread(func, start) {
	      if (typeof func != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      start = start === undefined ? 0 : nativeMax(toInteger(start), 0);
	      return rest(function(args) {
	        var array = args[start],
	            otherArgs = castSlice(args, 0, start);

	        if (array) {
	          arrayPush(otherArgs, array);
	        }
	        return apply(func, this, otherArgs);
	      });
	    }

	    /**
	     * Creates a throttled function that only invokes `func` at most once per
	     * every `wait` milliseconds. The throttled function comes with a `cancel`
	     * method to cancel delayed `func` invocations and a `flush` method to
	     * immediately invoke them. Provide an options object to indicate whether
	     * `func` should be invoked on the leading and/or trailing edge of the `wait`
	     * timeout. The `func` is invoked with the last arguments provided to the
	     * throttled function. Subsequent calls to the throttled function return the
	     * result of the last `func` invocation.
	     *
	     * **Note:** If `leading` and `trailing` options are `true`, `func` is
	     * invoked on the trailing edge of the timeout only if the throttled function
	     * is invoked more than once during the `wait` timeout.
	     *
	     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
	     * for details over the differences between `_.throttle` and `_.debounce`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Function
	     * @param {Function} func The function to throttle.
	     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
	     * @param {Object} [options={}] The options object.
	     * @param {boolean} [options.leading=true]
	     *  Specify invoking on the leading edge of the timeout.
	     * @param {boolean} [options.trailing=true]
	     *  Specify invoking on the trailing edge of the timeout.
	     * @returns {Function} Returns the new throttled function.
	     * @example
	     *
	     * // Avoid excessively updating the position while scrolling.
	     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
	     *
	     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.
	     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });
	     * jQuery(element).on('click', throttled);
	     *
	     * // Cancel the trailing throttled invocation.
	     * jQuery(window).on('popstate', throttled.cancel);
	     */
	    function throttle(func, wait, options) {
	      var leading = true,
	          trailing = true;

	      if (typeof func != 'function') {
	        throw new TypeError(FUNC_ERROR_TEXT);
	      }
	      if (isObject(options)) {
	        leading = 'leading' in options ? !!options.leading : leading;
	        trailing = 'trailing' in options ? !!options.trailing : trailing;
	      }
	      return debounce(func, wait, {
	        'leading': leading,
	        'maxWait': wait,
	        'trailing': trailing
	      });
	    }

	    /**
	     * Creates a function that accepts up to one argument, ignoring any
	     * additional arguments.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Function
	     * @param {Function} func The function to cap arguments for.
	     * @returns {Function} Returns the new capped function.
	     * @example
	     *
	     * _.map(['6', '8', '10'], _.unary(parseInt));
	     * // => [6, 8, 10]
	     */
	    function unary(func) {
	      return ary(func, 1);
	    }

	    /**
	     * Creates a function that provides `value` to 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 _
	     * @since 0.1.0
	     * @category Function
	     * @param {*} value The value to wrap.
	     * @param {Function} [wrapper=identity] The wrapper function.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var p = _.wrap(_.escape, function(func, text) {
	     *   return '<p>' + func(text) + '</p>';
	     * });
	     *
	     * p('fred, barney, & pebbles');
	     * // => '<p>fred, barney, &amp; pebbles</p>'
	     */
	    function wrap(value, wrapper) {
	      wrapper = wrapper == null ? identity : wrapper;
	      return partial(wrapper, value);
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Casts `value` as an array if it's not one.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.4.0
	     * @category Lang
	     * @param {*} value The value to inspect.
	     * @returns {Array} Returns the cast array.
	     * @example
	     *
	     * _.castArray(1);
	     * // => [1]
	     *
	     * _.castArray({ 'a': 1 });
	     * // => [{ 'a': 1 }]
	     *
	     * _.castArray('abc');
	     * // => ['abc']
	     *
	     * _.castArray(null);
	     * // => [null]
	     *
	     * _.castArray(undefined);
	     * // => [undefined]
	     *
	     * _.castArray();
	     * // => []
	     *
	     * var array = [1, 2, 3];
	     * console.log(_.castArray(array) === array);
	     * // => true
	     */
	    function castArray() {
	      if (!arguments.length) {
	        return [];
	      }
	      var value = arguments[0];
	      return isArray(value) ? value : [value];
	    }

	    /**
	     * Creates a shallow clone of `value`.
	     *
	     * **Note:** This method is loosely based on the
	     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)
	     * and supports cloning arrays, array buffers, booleans, date objects, maps,
	     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed
	     * arrays. The own enumerable properties of `arguments` objects are cloned
	     * as plain objects. An empty object is returned for uncloneable values such
	     * as error objects, functions, DOM nodes, and WeakMaps.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to clone.
	     * @returns {*} Returns the cloned value.
	     * @see _.cloneDeep
	     * @example
	     *
	     * var objects = [{ 'a': 1 }, { 'b': 2 }];
	     *
	     * var shallow = _.clone(objects);
	     * console.log(shallow[0] === objects[0]);
	     * // => true
	     */
	    function clone(value) {
	      return baseClone(value, false, true);
	    }

	    /**
	     * This method is like `_.clone` except that it accepts `customizer` which
	     * is invoked to produce the cloned value. If `customizer` returns `undefined`,
	     * cloning is handled by the method instead. The `customizer` is invoked with
	     * up to four arguments; (value [, index|key, object, stack]).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to clone.
	     * @param {Function} [customizer] The function to customize cloning.
	     * @returns {*} Returns the cloned value.
	     * @see _.cloneDeepWith
	     * @example
	     *
	     * function customizer(value) {
	     *   if (_.isElement(value)) {
	     *     return value.cloneNode(false);
	     *   }
	     * }
	     *
	     * var el = _.cloneWith(document.body, customizer);
	     *
	     * console.log(el === document.body);
	     * // => false
	     * console.log(el.nodeName);
	     * // => 'BODY'
	     * console.log(el.childNodes.length);
	     * // => 0
	     */
	    function cloneWith(value, customizer) {
	      return baseClone(value, false, true, customizer);
	    }

	    /**
	     * This method is like `_.clone` except that it recursively clones `value`.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.0.0
	     * @category Lang
	     * @param {*} value The value to recursively clone.
	     * @returns {*} Returns the deep cloned value.
	     * @see _.clone
	     * @example
	     *
	     * var objects = [{ 'a': 1 }, { 'b': 2 }];
	     *
	     * var deep = _.cloneDeep(objects);
	     * console.log(deep[0] === objects[0]);
	     * // => false
	     */
	    function cloneDeep(value) {
	      return baseClone(value, true, true);
	    }

	    /**
	     * This method is like `_.cloneWith` except that it recursively clones `value`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to recursively clone.
	     * @param {Function} [customizer] The function to customize cloning.
	     * @returns {*} Returns the deep cloned value.
	     * @see _.cloneWith
	     * @example
	     *
	     * function customizer(value) {
	     *   if (_.isElement(value)) {
	     *     return value.cloneNode(true);
	     *   }
	     * }
	     *
	     * var el = _.cloneDeepWith(document.body, customizer);
	     *
	     * console.log(el === document.body);
	     * // => false
	     * console.log(el.nodeName);
	     * // => 'BODY'
	     * console.log(el.childNodes.length);
	     * // => 20
	     */
	    function cloneDeepWith(value, customizer) {
	      return baseClone(value, true, true, customizer);
	    }

	    /**
	     * Performs a
	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
	     * comparison between two values to determine if they are equivalent.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
	     * @example
	     *
	     * var object = { 'user': 'fred' };
	     * var other = { 'user': 'fred' };
	     *
	     * _.eq(object, object);
	     * // => true
	     *
	     * _.eq(object, other);
	     * // => false
	     *
	     * _.eq('a', 'a');
	     * // => true
	     *
	     * _.eq('a', Object('a'));
	     * // => false
	     *
	     * _.eq(NaN, NaN);
	     * // => true
	     */
	    function eq(value, other) {
	      return value === other || (value !== value && other !== other);
	    }

	    /**
	     * Checks if `value` is greater than `other`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.9.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if `value` is greater than `other`,
	     *  else `false`.
	     * @see _.lt
	     * @example
	     *
	     * _.gt(3, 1);
	     * // => true
	     *
	     * _.gt(3, 3);
	     * // => false
	     *
	     * _.gt(1, 3);
	     * // => false
	     */
	    var gt = createRelationalOperation(baseGt);

	    /**
	     * Checks if `value` is greater than or equal to `other`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.9.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if `value` is greater than or equal to
	     *  `other`, else `false`.
	     * @see _.lte
	     * @example
	     *
	     * _.gte(3, 1);
	     * // => true
	     *
	     * _.gte(3, 3);
	     * // => true
	     *
	     * _.gte(1, 3);
	     * // => false
	     */
	    var gte = createRelationalOperation(function(value, other) {
	      return value >= other;
	    });

	    /**
	     * Checks if `value` is likely an `arguments` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isArguments(function() { return arguments; }());
	     * // => true
	     *
	     * _.isArguments([1, 2, 3]);
	     * // => false
	     */
	    function isArguments(value) {
	      // Safari 8.1 incorrectly makes `arguments.callee` enumerable in strict mode.
	      return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&
	        (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);
	    }

	    /**
	     * Checks if `value` is classified as an `Array` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @type {Function}
	     * @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(document.body.children);
	     * // => false
	     *
	     * _.isArray('abc');
	     * // => false
	     *
	     * _.isArray(_.noop);
	     * // => false
	     */
	    var isArray = Array.isArray;

	    /**
	     * Checks if `value` is classified as an `ArrayBuffer` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.3.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isArrayBuffer(new ArrayBuffer(2));
	     * // => true
	     *
	     * _.isArrayBuffer(new Array(2));
	     * // => false
	     */
	    function isArrayBuffer(value) {
	      return isObjectLike(value) && objectToString.call(value) == arrayBufferTag;
	    }

	    /**
	     * Checks if `value` is array-like. A value is considered array-like if it's
	     * not a function and has a `value.length` that's an integer greater than or
	     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
	     * @example
	     *
	     * _.isArrayLike([1, 2, 3]);
	     * // => true
	     *
	     * _.isArrayLike(document.body.children);
	     * // => true
	     *
	     * _.isArrayLike('abc');
	     * // => true
	     *
	     * _.isArrayLike(_.noop);
	     * // => false
	     */
	    function isArrayLike(value) {
	      return value != null && isLength(getLength(value)) && !isFunction(value);
	    }

	    /**
	     * This method is like `_.isArrayLike` except that it also checks if `value`
	     * is an object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is an array-like object,
	     *  else `false`.
	     * @example
	     *
	     * _.isArrayLikeObject([1, 2, 3]);
	     * // => true
	     *
	     * _.isArrayLikeObject(document.body.children);
	     * // => true
	     *
	     * _.isArrayLikeObject('abc');
	     * // => false
	     *
	     * _.isArrayLikeObject(_.noop);
	     * // => false
	     */
	    function isArrayLikeObject(value) {
	      return isObjectLike(value) && isArrayLike(value);
	    }

	    /**
	     * Checks if `value` is classified as a boolean primitive or object.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isBoolean(false);
	     * // => true
	     *
	     * _.isBoolean(null);
	     * // => false
	     */
	    function isBoolean(value) {
	      return value === true || value === false ||
	        (isObjectLike(value) && objectToString.call(value) == boolTag);
	    }

	    /**
	     * Checks if `value` is a buffer.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.3.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.
	     * @example
	     *
	     * _.isBuffer(new Buffer(2));
	     * // => true
	     *
	     * _.isBuffer(new Uint8Array(2));
	     * // => false
	     */
	    var isBuffer = !Buffer ? constant(false) : function(value) {
	      return value instanceof Buffer;
	    };

	    /**
	     * Checks if `value` is classified as a `Date` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isDate(new Date);
	     * // => true
	     *
	     * _.isDate('Mon April 23 2012');
	     * // => false
	     */
	    function isDate(value) {
	      return isObjectLike(value) && objectToString.call(value) == dateTag;
	    }

	    /**
	     * Checks if `value` is likely a DOM element.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a DOM element,
	     *  else `false`.
	     * @example
	     *
	     * _.isElement(document.body);
	     * // => true
	     *
	     * _.isElement('<body>');
	     * // => false
	     */
	    function isElement(value) {
	      return !!value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value);
	    }

	    /**
	     * Checks if `value` is an empty object, collection, map, or set.
	     *
	     * Objects are considered empty if they have no own enumerable string keyed
	     * properties.
	     *
	     * Array-like values such as `arguments` objects, arrays, buffers, strings, or
	     * jQuery-like collections are considered empty if they have a `length` of `0`.
	     * Similarly, maps and sets are considered empty if they have a `size` of `0`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is empty, else `false`.
	     * @example
	     *
	     * _.isEmpty(null);
	     * // => true
	     *
	     * _.isEmpty(true);
	     * // => true
	     *
	     * _.isEmpty(1);
	     * // => true
	     *
	     * _.isEmpty([1, 2, 3]);
	     * // => false
	     *
	     * _.isEmpty({ 'a': 1 });
	     * // => false
	     */
	    function isEmpty(value) {
	      if (isArrayLike(value) &&
	          (isArray(value) || isString(value) || isFunction(value.splice) ||
	            isArguments(value) || isBuffer(value))) {
	        return !value.length;
	      }
	      if (isObjectLike(value)) {
	        var tag = getTag(value);
	        if (tag == mapTag || tag == setTag) {
	          return !value.size;
	        }
	      }
	      for (var key in value) {
	        if (hasOwnProperty.call(value, key)) {
	          return false;
	        }
	      }
	      return !(nonEnumShadows && keys(value).length);
	    }

	    /**
	     * Performs a deep comparison between two values to determine if they are
	     * equivalent.
	     *
	     * **Note:** This method supports comparing arrays, array buffers, booleans,
	     * date objects, error objects, maps, numbers, `Object` objects, regexes,
	     * sets, strings, symbols, and typed arrays. `Object` objects are compared
	     * by their own, not inherited, enumerable properties. Functions and DOM
	     * nodes are **not** supported.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if the values are equivalent,
	     *  else `false`.
	     * @example
	     *
	     * var object = { 'user': 'fred' };
	     * var other = { 'user': 'fred' };
	     *
	     * _.isEqual(object, other);
	     * // => true
	     *
	     * object === other;
	     * // => false
	     */
	    function isEqual(value, other) {
	      return baseIsEqual(value, other);
	    }

	    /**
	     * This method is like `_.isEqual` except that it accepts `customizer` which
	     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
	     * are handled by the method instead. The `customizer` is invoked with up to
	     * six arguments: (objValue, othValue [, index|key, object, other, stack]).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @param {Function} [customizer] The function to customize comparisons.
	     * @returns {boolean} Returns `true` if the values are equivalent,
	     *  else `false`.
	     * @example
	     *
	     * function isGreeting(value) {
	     *   return /^h(?:i|ello)$/.test(value);
	     * }
	     *
	     * function customizer(objValue, othValue) {
	     *   if (isGreeting(objValue) && isGreeting(othValue)) {
	     *     return true;
	     *   }
	     * }
	     *
	     * var array = ['hello', 'goodbye'];
	     * var other = ['hi', 'goodbye'];
	     *
	     * _.isEqualWith(array, other, customizer);
	     * // => true
	     */
	    function isEqualWith(value, other, customizer) {
	      customizer = typeof customizer == 'function' ? customizer : undefined;
	      var result = customizer ? customizer(value, other) : undefined;
	      return result === undefined ? baseIsEqual(value, other, customizer) : !!result;
	    }

	    /**
	     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,
	     * `SyntaxError`, `TypeError`, or `URIError` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is an error object,
	     *  else `false`.
	     * @example
	     *
	     * _.isError(new Error);
	     * // => true
	     *
	     * _.isError(Error);
	     * // => false
	     */
	    function isError(value) {
	      if (!isObjectLike(value)) {
	        return false;
	      }
	      return (objectToString.call(value) == errorTag) ||
	        (typeof value.message == 'string' && typeof value.name == 'string');
	    }

	    /**
	     * Checks if `value` is a finite primitive number.
	     *
	     * **Note:** This method is based on
	     * [`Number.isFinite`](https://mdn.io/Number/isFinite).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a finite number,
	     *  else `false`.
	     * @example
	     *
	     * _.isFinite(3);
	     * // => true
	     *
	     * _.isFinite(Number.MIN_VALUE);
	     * // => true
	     *
	     * _.isFinite(Infinity);
	     * // => false
	     *
	     * _.isFinite('3');
	     * // => false
	     */
	    function isFinite(value) {
	      return typeof value == 'number' && nativeIsFinite(value);
	    }

	    /**
	     * Checks if `value` is classified as a `Function` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is 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 Safari 8 which returns 'object' for typed array and weak map constructors,
	      // and PhantomJS 1.9 which returns 'function' for `NodeList` instances.
	      var tag = isObject(value) ? objectToString.call(value) : '';
	      return tag == funcTag || tag == genTag;
	    }

	    /**
	     * Checks if `value` is an integer.
	     *
	     * **Note:** This method is based on
	     * [`Number.isInteger`](https://mdn.io/Number/isInteger).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.
	     * @example
	     *
	     * _.isInteger(3);
	     * // => true
	     *
	     * _.isInteger(Number.MIN_VALUE);
	     * // => false
	     *
	     * _.isInteger(Infinity);
	     * // => false
	     *
	     * _.isInteger('3');
	     * // => false
	     */
	    function isInteger(value) {
	      return typeof value == 'number' && value == toInteger(value);
	    }

	    /**
	     * Checks if `value` is a valid array-like length.
	     *
	     * **Note:** This function is loosely based on
	     * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a valid length,
	     *  else `false`.
	     * @example
	     *
	     * _.isLength(3);
	     * // => true
	     *
	     * _.isLength(Number.MIN_VALUE);
	     * // => false
	     *
	     * _.isLength(Infinity);
	     * // => false
	     *
	     * _.isLength('3');
	     * // => false
	     */
	    function isLength(value) {
	      return typeof value == 'number' &&
	        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
	    }

	    /**
	     * Checks if `value` is the
	     * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types)
	     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is an object, else `false`.
	     * @example
	     *
	     * _.isObject({});
	     * // => true
	     *
	     * _.isObject([1, 2, 3]);
	     * // => true
	     *
	     * _.isObject(_.noop);
	     * // => true
	     *
	     * _.isObject(null);
	     * // => false
	     */
	    function isObject(value) {
	      var type = typeof value;
	      return !!value && (type == 'object' || type == 'function');
	    }

	    /**
	     * Checks if `value` is object-like. A value is object-like if it's not `null`
	     * and has a `typeof` result of "object".
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
	     * @example
	     *
	     * _.isObjectLike({});
	     * // => true
	     *
	     * _.isObjectLike([1, 2, 3]);
	     * // => true
	     *
	     * _.isObjectLike(_.noop);
	     * // => false
	     *
	     * _.isObjectLike(null);
	     * // => false
	     */
	    function isObjectLike(value) {
	      return !!value && typeof value == 'object';
	    }

	    /**
	     * Checks if `value` is classified as a `Map` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.3.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isMap(new Map);
	     * // => true
	     *
	     * _.isMap(new WeakMap);
	     * // => false
	     */
	    function isMap(value) {
	      return isObjectLike(value) && getTag(value) == mapTag;
	    }

	    /**
	     * Performs a partial deep comparison between `object` and `source` to
	     * determine if `object` contains equivalent property values. This method is
	     * equivalent to a `_.matches` function when `source` is partially applied.
	     *
	     * **Note:** This method supports comparing the same values as `_.isEqual`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Lang
	     * @param {Object} object The object to inspect.
	     * @param {Object} source The object of property values to match.
	     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
	     * @example
	     *
	     * var object = { 'user': 'fred', 'age': 40 };
	     *
	     * _.isMatch(object, { 'age': 40 });
	     * // => true
	     *
	     * _.isMatch(object, { 'age': 36 });
	     * // => false
	     */
	    function isMatch(object, source) {
	      return object === source || baseIsMatch(object, source, getMatchData(source));
	    }

	    /**
	     * This method is like `_.isMatch` except that it accepts `customizer` which
	     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
	     * are handled by the method instead. The `customizer` is invoked with five
	     * arguments: (objValue, srcValue, index|key, object, source).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {Object} object The object to inspect.
	     * @param {Object} source The object of property values to match.
	     * @param {Function} [customizer] The function to customize comparisons.
	     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
	     * @example
	     *
	     * function isGreeting(value) {
	     *   return /^h(?:i|ello)$/.test(value);
	     * }
	     *
	     * function customizer(objValue, srcValue) {
	     *   if (isGreeting(objValue) && isGreeting(srcValue)) {
	     *     return true;
	     *   }
	     * }
	     *
	     * var object = { 'greeting': 'hello' };
	     * var source = { 'greeting': 'hi' };
	     *
	     * _.isMatchWith(object, source, customizer);
	     * // => true
	     */
	    function isMatchWith(object, source, customizer) {
	      customizer = typeof customizer == 'function' ? customizer : undefined;
	      return baseIsMatch(object, source, getMatchData(source), customizer);
	    }

	    /**
	     * Checks if `value` is `NaN`.
	     *
	     * **Note:** This method is based on
	     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as
	     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for
	     * `undefined` and other non-number values.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
	     * @example
	     *
	     * _.isNaN(NaN);
	     * // => true
	     *
	     * _.isNaN(new Number(NaN));
	     * // => true
	     *
	     * isNaN(undefined);
	     * // => true
	     *
	     * _.isNaN(undefined);
	     * // => false
	     */
	    function isNaN(value) {
	      // An `NaN` primitive is the only value that is not equal to itself.
	      // Perform the `toStringTag` check first to avoid errors with some
	      // ActiveX objects in IE.
	      return isNumber(value) && value != +value;
	    }

	    /**
	     * Checks if `value` is a native function.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a native function,
	     *  else `false`.
	     * @example
	     *
	     * _.isNative(Array.prototype.push);
	     * // => true
	     *
	     * _.isNative(_);
	     * // => false
	     */
	    function isNative(value) {
	      if (!isObject(value)) {
	        return false;
	      }
	      var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;
	      return pattern.test(toSource(value));
	    }

	    /**
	     * Checks if `value` is `null`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
	     * @example
	     *
	     * _.isNull(null);
	     * // => true
	     *
	     * _.isNull(void 0);
	     * // => false
	     */
	    function isNull(value) {
	      return value === null;
	    }

	    /**
	     * Checks if `value` is `null` or `undefined`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.
	     * @example
	     *
	     * _.isNil(null);
	     * // => true
	     *
	     * _.isNil(void 0);
	     * // => true
	     *
	     * _.isNil(NaN);
	     * // => false
	     */
	    function isNil(value) {
	      return value == null;
	    }

	    /**
	     * Checks if `value` is classified as a `Number` primitive or object.
	     *
	     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are
	     * classified as numbers, use the `_.isFinite` method.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isNumber(3);
	     * // => true
	     *
	     * _.isNumber(Number.MIN_VALUE);
	     * // => true
	     *
	     * _.isNumber(Infinity);
	     * // => true
	     *
	     * _.isNumber('3');
	     * // => false
	     */
	    function isNumber(value) {
	      return typeof value == 'number' ||
	        (isObjectLike(value) && objectToString.call(value) == numberTag);
	    }

	    /**
	     * Checks if `value` is a plain object, that is, an object created by the
	     * `Object` constructor or one with a `[[Prototype]]` of `null`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.8.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a plain object,
	     *  else `false`.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     * }
	     *
	     * _.isPlainObject(new Foo);
	     * // => false
	     *
	     * _.isPlainObject([1, 2, 3]);
	     * // => false
	     *
	     * _.isPlainObject({ 'x': 0, 'y': 0 });
	     * // => true
	     *
	     * _.isPlainObject(Object.create(null));
	     * // => true
	     */
	    function isPlainObject(value) {
	      if (!isObjectLike(value) ||
	          objectToString.call(value) != objectTag || isHostObject(value)) {
	        return false;
	      }
	      var proto = getPrototype(value);
	      if (proto === null) {
	        return true;
	      }
	      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
	      return (typeof Ctor == 'function' &&
	        Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString);
	    }

	    /**
	     * Checks if `value` is classified as a `RegExp` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.1.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isRegExp(/abc/);
	     * // => true
	     *
	     * _.isRegExp('/abc/');
	     * // => false
	     */
	    function isRegExp(value) {
	      return isObject(value) && objectToString.call(value) == regexpTag;
	    }

	    /**
	     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754
	     * double precision number which isn't the result of a rounded unsafe integer.
	     *
	     * **Note:** This method is based on
	     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is a safe integer,
	     *  else `false`.
	     * @example
	     *
	     * _.isSafeInteger(3);
	     * // => true
	     *
	     * _.isSafeInteger(Number.MIN_VALUE);
	     * // => false
	     *
	     * _.isSafeInteger(Infinity);
	     * // => false
	     *
	     * _.isSafeInteger('3');
	     * // => false
	     */
	    function isSafeInteger(value) {
	      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;
	    }

	    /**
	     * Checks if `value` is classified as a `Set` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.3.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isSet(new Set);
	     * // => true
	     *
	     * _.isSet(new WeakSet);
	     * // => false
	     */
	    function isSet(value) {
	      return isObjectLike(value) && getTag(value) == setTag;
	    }

	    /**
	     * Checks if `value` is classified as a `String` primitive or object.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isString('abc');
	     * // => true
	     *
	     * _.isString(1);
	     * // => false
	     */
	    function isString(value) {
	      return typeof value == 'string' ||
	        (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);
	    }

	    /**
	     * Checks if `value` is classified as a `Symbol` primitive or object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isSymbol(Symbol.iterator);
	     * // => true
	     *
	     * _.isSymbol('abc');
	     * // => false
	     */
	    function isSymbol(value) {
	      return typeof value == 'symbol' ||
	        (isObjectLike(value) && objectToString.call(value) == symbolTag);
	    }

	    /**
	     * Checks if `value` is classified as a typed array.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isTypedArray(new Uint8Array);
	     * // => true
	     *
	     * _.isTypedArray([]);
	     * // => false
	     */
	    function isTypedArray(value) {
	      return isObjectLike(value) &&
	        isLength(value.length) && !!typedArrayTags[objectToString.call(value)];
	    }

	    /**
	     * Checks if `value` is `undefined`.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.
	     * @example
	     *
	     * _.isUndefined(void 0);
	     * // => true
	     *
	     * _.isUndefined(null);
	     * // => false
	     */
	    function isUndefined(value) {
	      return value === undefined;
	    }

	    /**
	     * Checks if `value` is classified as a `WeakMap` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.3.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isWeakMap(new WeakMap);
	     * // => true
	     *
	     * _.isWeakMap(new Map);
	     * // => false
	     */
	    function isWeakMap(value) {
	      return isObjectLike(value) && getTag(value) == weakMapTag;
	    }

	    /**
	     * Checks if `value` is classified as a `WeakSet` object.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.3.0
	     * @category Lang
	     * @param {*} value The value to check.
	     * @returns {boolean} Returns `true` if `value` is correctly classified,
	     *  else `false`.
	     * @example
	     *
	     * _.isWeakSet(new WeakSet);
	     * // => true
	     *
	     * _.isWeakSet(new Set);
	     * // => false
	     */
	    function isWeakSet(value) {
	      return isObjectLike(value) && objectToString.call(value) == weakSetTag;
	    }

	    /**
	     * Checks if `value` is less than `other`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.9.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if `value` is less than `other`,
	     *  else `false`.
	     * @see _.gt
	     * @example
	     *
	     * _.lt(1, 3);
	     * // => true
	     *
	     * _.lt(3, 3);
	     * // => false
	     *
	     * _.lt(3, 1);
	     * // => false
	     */
	    var lt = createRelationalOperation(baseLt);

	    /**
	     * Checks if `value` is less than or equal to `other`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.9.0
	     * @category Lang
	     * @param {*} value The value to compare.
	     * @param {*} other The other value to compare.
	     * @returns {boolean} Returns `true` if `value` is less than or equal to
	     *  `other`, else `false`.
	     * @see _.gte
	     * @example
	     *
	     * _.lte(1, 3);
	     * // => true
	     *
	     * _.lte(3, 3);
	     * // => true
	     *
	     * _.lte(3, 1);
	     * // => false
	     */
	    var lte = createRelationalOperation(function(value, other) {
	      return value <= other;
	    });

	    /**
	     * Converts `value` to an array.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Lang
	     * @param {*} value The value to convert.
	     * @returns {Array} Returns the converted array.
	     * @example
	     *
	     * _.toArray({ 'a': 1, 'b': 2 });
	     * // => [1, 2]
	     *
	     * _.toArray('abc');
	     * // => ['a', 'b', 'c']
	     *
	     * _.toArray(1);
	     * // => []
	     *
	     * _.toArray(null);
	     * // => []
	     */
	    function toArray(value) {
	      if (!value) {
	        return [];
	      }
	      if (isArrayLike(value)) {
	        return isString(value) ? stringToArray(value) : copyArray(value);
	      }
	      if (iteratorSymbol && value[iteratorSymbol]) {
	        return iteratorToArray(value[iteratorSymbol]());
	      }
	      var tag = getTag(value),
	          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);

	      return func(value);
	    }

	    /**
	     * Converts `value` to a finite number.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.12.0
	     * @category Lang
	     * @param {*} value The value to convert.
	     * @returns {number} Returns the converted number.
	     * @example
	     *
	     * _.toFinite(3.2);
	     * // => 3.2
	     *
	     * _.toFinite(Number.MIN_VALUE);
	     * // => 5e-324
	     *
	     * _.toFinite(Infinity);
	     * // => 1.7976931348623157e+308
	     *
	     * _.toFinite('3.2');
	     * // => 3.2
	     */
	    function toFinite(value) {
	      if (!value) {
	        return value === 0 ? value : 0;
	      }
	      value = toNumber(value);
	      if (value === INFINITY || value === -INFINITY) {
	        var sign = (value < 0 ? -1 : 1);
	        return sign * MAX_INTEGER;
	      }
	      return value === value ? value : 0;
	    }

	    /**
	     * Converts `value` to an integer.
	     *
	     * **Note:** This function is loosely based on
	     * [`ToInteger`](http://www.ecma-international.org/ecma-262/6.0/#sec-tointeger).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to convert.
	     * @returns {number} Returns the converted integer.
	     * @example
	     *
	     * _.toInteger(3.2);
	     * // => 3
	     *
	     * _.toInteger(Number.MIN_VALUE);
	     * // => 0
	     *
	     * _.toInteger(Infinity);
	     * // => 1.7976931348623157e+308
	     *
	     * _.toInteger('3.2');
	     * // => 3
	     */
	    function toInteger(value) {
	      var result = toFinite(value),
	          remainder = result % 1;

	      return result === result ? (remainder ? result - remainder : result) : 0;
	    }

	    /**
	     * Converts `value` to an integer suitable for use as the length of an
	     * array-like object.
	     *
	     * **Note:** This method is based on
	     * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to convert.
	     * @returns {number} Returns the converted integer.
	     * @example
	     *
	     * _.toLength(3.2);
	     * // => 3
	     *
	     * _.toLength(Number.MIN_VALUE);
	     * // => 0
	     *
	     * _.toLength(Infinity);
	     * // => 4294967295
	     *
	     * _.toLength('3.2');
	     * // => 3
	     */
	    function toLength(value) {
	      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;
	    }

	    /**
	     * Converts `value` to a number.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to process.
	     * @returns {number} Returns the number.
	     * @example
	     *
	     * _.toNumber(3.2);
	     * // => 3.2
	     *
	     * _.toNumber(Number.MIN_VALUE);
	     * // => 5e-324
	     *
	     * _.toNumber(Infinity);
	     * // => Infinity
	     *
	     * _.toNumber('3.2');
	     * // => 3.2
	     */
	    function toNumber(value) {
	      if (typeof value == 'number') {
	        return value;
	      }
	      if (isSymbol(value)) {
	        return NAN;
	      }
	      if (isObject(value)) {
	        var other = isFunction(value.valueOf) ? value.valueOf() : value;
	        value = isObject(other) ? (other + '') : other;
	      }
	      if (typeof value != 'string') {
	        return value === 0 ? value : +value;
	      }
	      value = value.replace(reTrim, '');
	      var isBinary = reIsBinary.test(value);
	      return (isBinary || reIsOctal.test(value))
	        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
	        : (reIsBadHex.test(value) ? NAN : +value);
	    }

	    /**
	     * Converts `value` to a plain object flattening inherited enumerable string
	     * keyed properties of `value` to own properties of the plain object.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Lang
	     * @param {*} value The value to convert.
	     * @returns {Object} Returns the converted plain object.
	     * @example
	     *
	     * function Foo() {
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.assign({ 'a': 1 }, new Foo);
	     * // => { 'a': 1, 'b': 2 }
	     *
	     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));
	     * // => { 'a': 1, 'b': 2, 'c': 3 }
	     */
	    function toPlainObject(value) {
	      return copyObject(value, keysIn(value));
	    }

	    /**
	     * Converts `value` to a safe integer. A safe integer can be compared and
	     * represented correctly.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to convert.
	     * @returns {number} Returns the converted integer.
	     * @example
	     *
	     * _.toSafeInteger(3.2);
	     * // => 3
	     *
	     * _.toSafeInteger(Number.MIN_VALUE);
	     * // => 0
	     *
	     * _.toSafeInteger(Infinity);
	     * // => 9007199254740991
	     *
	     * _.toSafeInteger('3.2');
	     * // => 3
	     */
	    function toSafeInteger(value) {
	      return baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);
	    }

	    /**
	     * Converts `value` to a string. An empty string is returned for `null`
	     * and `undefined` values. The sign of `-0` is preserved.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Lang
	     * @param {*} value The value to process.
	     * @returns {string} Returns the string.
	     * @example
	     *
	     * _.toString(null);
	     * // => ''
	     *
	     * _.toString(-0);
	     * // => '-0'
	     *
	     * _.toString([1, 2, 3]);
	     * // => '1,2,3'
	     */
	    function toString(value) {
	      return value == null ? '' : baseToString(value);
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Assigns own enumerable string keyed properties of source objects to the
	     * destination object. Source objects are applied from left to right.
	     * Subsequent sources overwrite property assignments of previous sources.
	     *
	     * **Note:** This method mutates `object` and is loosely based on
	     * [`Object.assign`](https://mdn.io/Object/assign).
	     *
	     * @static
	     * @memberOf _
	     * @since 0.10.0
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} [sources] The source objects.
	     * @returns {Object} Returns `object`.
	     * @see _.assignIn
	     * @example
	     *
	     * function Foo() {
	     *   this.c = 3;
	     * }
	     *
	     * function Bar() {
	     *   this.e = 5;
	     * }
	     *
	     * Foo.prototype.d = 4;
	     * Bar.prototype.f = 6;
	     *
	     * _.assign({ 'a': 1 }, new Foo, new Bar);
	     * // => { 'a': 1, 'c': 3, 'e': 5 }
	     */
	    var assign = createAssigner(function(object, source) {
	      if (nonEnumShadows || isPrototype(source) || isArrayLike(source)) {
	        copyObject(source, keys(source), object);
	        return;
	      }
	      for (var key in source) {
	        if (hasOwnProperty.call(source, key)) {
	          assignValue(object, key, source[key]);
	        }
	      }
	    });

	    /**
	     * This method is like `_.assign` except that it iterates over own and
	     * inherited source properties.
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @alias extend
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} [sources] The source objects.
	     * @returns {Object} Returns `object`.
	     * @see _.assign
	     * @example
	     *
	     * function Foo() {
	     *   this.b = 2;
	     * }
	     *
	     * function Bar() {
	     *   this.d = 4;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     * Bar.prototype.e = 5;
	     *
	     * _.assignIn({ 'a': 1 }, new Foo, new Bar);
	     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5 }
	     */
	    var assignIn = createAssigner(function(object, source) {
	      if (nonEnumShadows || isPrototype(source) || isArrayLike(source)) {
	        copyObject(source, keysIn(source), object);
	        return;
	      }
	      for (var key in source) {
	        assignValue(object, key, source[key]);
	      }
	    });

	    /**
	     * This method is like `_.assignIn` except that it accepts `customizer`
	     * which is invoked to produce the assigned values. If `customizer` returns
	     * `undefined`, assignment is handled by the method instead. The `customizer`
	     * is invoked with five arguments: (objValue, srcValue, key, object, source).
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @alias extendWith
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} sources The source objects.
	     * @param {Function} [customizer] The function to customize assigned values.
	     * @returns {Object} Returns `object`.
	     * @see _.assignWith
	     * @example
	     *
	     * function customizer(objValue, srcValue) {
	     *   return _.isUndefined(objValue) ? srcValue : objValue;
	     * }
	     *
	     * var defaults = _.partialRight(_.assignInWith, customizer);
	     *
	     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
	     * // => { 'a': 1, 'b': 2 }
	     */
	    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {
	      copyObject(source, keysIn(source), object, customizer);
	    });

	    /**
	     * This method is like `_.assign` except that it accepts `customizer`
	     * which is invoked to produce the assigned values. If `customizer` returns
	     * `undefined`, assignment is handled by the method instead. The `customizer`
	     * is invoked with five arguments: (objValue, srcValue, key, object, source).
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} sources The source objects.
	     * @param {Function} [customizer] The function to customize assigned values.
	     * @returns {Object} Returns `object`.
	     * @see _.assignInWith
	     * @example
	     *
	     * function customizer(objValue, srcValue) {
	     *   return _.isUndefined(objValue) ? srcValue : objValue;
	     * }
	     *
	     * var defaults = _.partialRight(_.assignWith, customizer);
	     *
	     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
	     * // => { 'a': 1, 'b': 2 }
	     */
	    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {
	      copyObject(source, keys(source), object, customizer);
	    });

	    /**
	     * Creates an array of values corresponding to `paths` of `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.0.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {...(string|string[])} [paths] The property paths of elements to pick.
	     * @returns {Array} Returns the picked values.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
	     *
	     * _.at(object, ['a[0].b.c', 'a[1]']);
	     * // => [3, 4]
	     *
	     * _.at(['a', 'b', 'c'], 0, 2);
	     * // => ['a', 'c']
	     */
	    var at = rest(function(object, paths) {
	      return baseAt(object, baseFlatten(paths, 1));
	    });

	    /**
	     * Creates an object that inherits from the `prototype` object. If a
	     * `properties` object is given, its own enumerable string keyed properties
	     * are assigned to the created object.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.3.0
	     * @category Object
	     * @param {Object} prototype The object to inherit from.
	     * @param {Object} [properties] The properties to assign to the object.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * function Shape() {
	     *   this.x = 0;
	     *   this.y = 0;
	     * }
	     *
	     * function Circle() {
	     *   Shape.call(this);
	     * }
	     *
	     * Circle.prototype = _.create(Shape.prototype, {
	     *   'constructor': Circle
	     * });
	     *
	     * var circle = new Circle;
	     * circle instanceof Circle;
	     * // => true
	     *
	     * circle instanceof Shape;
	     * // => true
	     */
	    function create(prototype, properties) {
	      var result = baseCreate(prototype);
	      return properties ? baseAssign(result, properties) : result;
	    }

	    /**
	     * Assigns own and inherited enumerable string keyed properties of source
	     * objects to the destination object for all destination properties that
	     * resolve to `undefined`. Source objects are applied from left to right.
	     * Once a property is set, additional values of the same property are ignored.
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} [sources] The source objects.
	     * @returns {Object} Returns `object`.
	     * @see _.defaultsDeep
	     * @example
	     *
	     * _.defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
	     * // => { 'user': 'barney', 'age': 36 }
	     */
	    var defaults = rest(function(args) {
	      args.push(undefined, assignInDefaults);
	      return apply(assignInWith, undefined, args);
	    });

	    /**
	     * This method is like `_.defaults` except that it recursively assigns
	     * default properties.
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.10.0
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} [sources] The source objects.
	     * @returns {Object} Returns `object`.
	     * @see _.defaults
	     * @example
	     *
	     * _.defaultsDeep({ 'user': { 'name': 'barney' } }, { 'user': { 'name': 'fred', 'age': 36 } });
	     * // => { 'user': { 'name': 'barney', 'age': 36 } }
	     *
	     */
	    var defaultsDeep = rest(function(args) {
	      args.push(undefined, mergeDefaults);
	      return apply(mergeWith, undefined, args);
	    });

	    /**
	     * This method is like `_.find` except that it returns the key of the first
	     * element `predicate` returns truthy for instead of the element itself.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.1.0
	     * @category Object
	     * @param {Object} object The object to search.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {string|undefined} Returns the key of the matched element,
	     *  else `undefined`.
	     * @example
	     *
	     * var users = {
	     *   'barney':  { 'age': 36, 'active': true },
	     *   'fred':    { 'age': 40, 'active': false },
	     *   'pebbles': { 'age': 1,  'active': true }
	     * };
	     *
	     * _.findKey(users, function(o) { return o.age < 40; });
	     * // => 'barney' (iteration order is not guaranteed)
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.findKey(users, { 'age': 1, 'active': true });
	     * // => 'pebbles'
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.findKey(users, ['active', false]);
	     * // => 'fred'
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.findKey(users, 'active');
	     * // => 'barney'
	     */
	    function findKey(object, predicate) {
	      return baseFind(object, getIteratee(predicate, 3), baseForOwn, true);
	    }

	    /**
	     * This method is like `_.findKey` except that it iterates over elements of
	     * a collection in the opposite order.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Object
	     * @param {Object} object The object to search.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per iteration.
	     * @returns {string|undefined} Returns the key of the matched element,
	     *  else `undefined`.
	     * @example
	     *
	     * var users = {
	     *   'barney':  { 'age': 36, 'active': true },
	     *   'fred':    { 'age': 40, 'active': false },
	     *   'pebbles': { 'age': 1,  'active': true }
	     * };
	     *
	     * _.findLastKey(users, function(o) { return o.age < 40; });
	     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.findLastKey(users, { 'age': 36, 'active': true });
	     * // => 'barney'
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.findLastKey(users, ['active', false]);
	     * // => 'fred'
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.findLastKey(users, 'active');
	     * // => 'pebbles'
	     */
	    function findLastKey(object, predicate) {
	      return baseFind(object, getIteratee(predicate, 3), baseForOwnRight, true);
	    }

	    /**
	     * Iterates over own and inherited enumerable string keyed properties of an
	     * object and invokes `iteratee` for each property. The iteratee is invoked
	     * with three arguments: (value, key, object). Iteratee functions may exit
	     * iteration early by explicitly returning `false`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.3.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Object} Returns `object`.
	     * @see _.forInRight
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.forIn(new Foo, function(value, key) {
	     *   console.log(key);
	     * });
	     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).
	     */
	    function forIn(object, iteratee) {
	      return object == null
	        ? object
	        : baseFor(object, getIteratee(iteratee, 3), keysIn);
	    }

	    /**
	     * This method is like `_.forIn` except that it iterates over properties of
	     * `object` in the opposite order.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Object} Returns `object`.
	     * @see _.forIn
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.forInRight(new Foo, function(value, key) {
	     *   console.log(key);
	     * });
	     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.
	     */
	    function forInRight(object, iteratee) {
	      return object == null
	        ? object
	        : baseForRight(object, getIteratee(iteratee, 3), keysIn);
	    }

	    /**
	     * Iterates over own enumerable string keyed properties of an object and
	     * invokes `iteratee` for each property. The iteratee is invoked with three
	     * arguments: (value, key, object). Iteratee functions may exit iteration
	     * early by explicitly returning `false`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.3.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Object} Returns `object`.
	     * @see _.forOwnRight
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.forOwn(new Foo, function(value, key) {
	     *   console.log(key);
	     * });
	     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
	     */
	    function forOwn(object, iteratee) {
	      return object && baseForOwn(object, getIteratee(iteratee, 3));
	    }

	    /**
	     * This method is like `_.forOwn` except that it iterates over properties of
	     * `object` in the opposite order.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.0.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Object} Returns `object`.
	     * @see _.forOwn
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.forOwnRight(new Foo, function(value, key) {
	     *   console.log(key);
	     * });
	     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.
	     */
	    function forOwnRight(object, iteratee) {
	      return object && baseForOwnRight(object, getIteratee(iteratee, 3));
	    }

	    /**
	     * Creates an array of function property names from own enumerable properties
	     * of `object`.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The object to inspect.
	     * @returns {Array} Returns the function names.
	     * @see _.functionsIn
	     * @example
	     *
	     * function Foo() {
	     *   this.a = _.constant('a');
	     *   this.b = _.constant('b');
	     * }
	     *
	     * Foo.prototype.c = _.constant('c');
	     *
	     * _.functions(new Foo);
	     * // => ['a', 'b']
	     */
	    function functions(object) {
	      return object == null ? [] : baseFunctions(object, keys(object));
	    }

	    /**
	     * Creates an array of function property names from own and inherited
	     * enumerable properties of `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The object to inspect.
	     * @returns {Array} Returns the function names.
	     * @see _.functions
	     * @example
	     *
	     * function Foo() {
	     *   this.a = _.constant('a');
	     *   this.b = _.constant('b');
	     * }
	     *
	     * Foo.prototype.c = _.constant('c');
	     *
	     * _.functionsIn(new Foo);
	     * // => ['a', 'b', 'c']
	     */
	    function functionsIn(object) {
	      return object == null ? [] : baseFunctions(object, keysIn(object));
	    }

	    /**
	     * Gets the value at `path` of `object`. If the resolved value is
	     * `undefined`, the `defaultValue` is used in its place.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.7.0
	     * @category Object
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the property to get.
	     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
	     * @returns {*} Returns the resolved value.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
	     *
	     * _.get(object, 'a[0].b.c');
	     * // => 3
	     *
	     * _.get(object, ['a', '0', 'b', 'c']);
	     * // => 3
	     *
	     * _.get(object, 'a.b.c', 'default');
	     * // => 'default'
	     */
	    function get(object, path, defaultValue) {
	      var result = object == null ? undefined : baseGet(object, path);
	      return result === undefined ? defaultValue : result;
	    }

	    /**
	     * Checks if `path` is a direct property of `object`.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path to check.
	     * @returns {boolean} Returns `true` if `path` exists, else `false`.
	     * @example
	     *
	     * var object = { 'a': { 'b': 2 } };
	     * var other = _.create({ 'a': _.create({ 'b': 2 }) });
	     *
	     * _.has(object, 'a');
	     * // => true
	     *
	     * _.has(object, 'a.b');
	     * // => true
	     *
	     * _.has(object, ['a', 'b']);
	     * // => true
	     *
	     * _.has(other, 'a');
	     * // => false
	     */
	    function has(object, path) {
	      return object != null && hasPath(object, path, baseHas);
	    }

	    /**
	     * Checks if `path` is a direct or inherited property of `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path to check.
	     * @returns {boolean} Returns `true` if `path` exists, else `false`.
	     * @example
	     *
	     * var object = _.create({ 'a': _.create({ 'b': 2 }) });
	     *
	     * _.hasIn(object, 'a');
	     * // => true
	     *
	     * _.hasIn(object, 'a.b');
	     * // => true
	     *
	     * _.hasIn(object, ['a', 'b']);
	     * // => true
	     *
	     * _.hasIn(object, 'b');
	     * // => false
	     */
	    function hasIn(object, path) {
	      return object != null && hasPath(object, path, baseHasIn);
	    }

	    /**
	     * Creates an object composed of the inverted keys and values of `object`.
	     * If `object` contains duplicate values, subsequent values overwrite
	     * property assignments of previous values.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.7.0
	     * @category Object
	     * @param {Object} object The object to invert.
	     * @returns {Object} Returns the new inverted object.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': 2, 'c': 1 };
	     *
	     * _.invert(object);
	     * // => { '1': 'c', '2': 'b' }
	     */
	    var invert = createInverter(function(result, value, key) {
	      result[value] = key;
	    }, constant(identity));

	    /**
	     * This method is like `_.invert` except that the inverted object is generated
	     * from the results of running each element of `object` thru `iteratee`. The
	     * corresponding inverted value of each inverted key is an array of keys
	     * responsible for generating the inverted value. The iteratee is invoked
	     * with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.1.0
	     * @category Object
	     * @param {Object} object The object to invert.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {Object} Returns the new inverted object.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': 2, 'c': 1 };
	     *
	     * _.invertBy(object);
	     * // => { '1': ['a', 'c'], '2': ['b'] }
	     *
	     * _.invertBy(object, function(value) {
	     *   return 'group' + value;
	     * });
	     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }
	     */
	    var invertBy = createInverter(function(result, value, key) {
	      if (hasOwnProperty.call(result, value)) {
	        result[value].push(key);
	      } else {
	        result[value] = [key];
	      }
	    }, getIteratee);

	    /**
	     * Invokes the method at `path` of `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the method to invoke.
	     * @param {...*} [args] The arguments to invoke the method with.
	     * @returns {*} Returns the result of the invoked method.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };
	     *
	     * _.invoke(object, 'a[0].b.c.slice', 1, 3);
	     * // => [2, 3]
	     */
	    var invoke = rest(baseInvoke);

	    /**
	     * Creates an array of the own enumerable property names of `object`.
	     *
	     * **Note:** Non-object values are coerced to objects. See the
	     * [ES spec](http://ecma-international.org/ecma-262/6.0/#sec-object.keys)
	     * for more details.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property names.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.keys(new Foo);
	     * // => ['a', 'b'] (iteration order is not guaranteed)
	     *
	     * _.keys('hi');
	     * // => ['0', '1']
	     */
	    function keys(object) {
	      var isProto = isPrototype(object);
	      if (!(isProto || isArrayLike(object))) {
	        return baseKeys(object);
	      }
	      var indexes = indexKeys(object),
	          skipIndexes = !!indexes,
	          result = indexes || [],
	          length = result.length;

	      for (var key in object) {
	        if (baseHas(object, key) &&
	            !(skipIndexes && (key == 'length' || isIndex(key, length))) &&
	            !(isProto && key == 'constructor')) {
	          result.push(key);
	        }
	      }
	      return result;
	    }

	    /**
	     * Creates an array of the own and inherited enumerable property names of `object`.
	     *
	     * **Note:** Non-object values are coerced to objects.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Object
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property names.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.keysIn(new Foo);
	     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
	     */
	    function keysIn(object) {
	      var index = -1,
	          isProto = isPrototype(object),
	          props = baseKeysIn(object),
	          propsLength = props.length,
	          indexes = indexKeys(object),
	          skipIndexes = !!indexes,
	          result = indexes || [],
	          length = result.length;

	      while (++index < propsLength) {
	        var key = props[index];
	        if (!(skipIndexes && (key == 'length' || 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
	     * string keyed property of `object` thru `iteratee`. The iteratee is invoked
	     * with three arguments: (value, key, object).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.8.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Object} Returns the new mapped object.
	     * @see _.mapValues
	     * @example
	     *
	     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {
	     *   return key + value;
	     * });
	     * // => { 'a1': 1, 'b2': 2 }
	     */
	    function mapKeys(object, iteratee) {
	      var result = {};
	      iteratee = getIteratee(iteratee, 3);

	      baseForOwn(object, function(value, key, object) {
	        result[iteratee(value, key, object)] = value;
	      });
	      return result;
	    }

	    /**
	     * Creates an object with the same keys as `object` and values generated
	     * by running each own enumerable string keyed property of `object` thru
	     * `iteratee`. The iteratee is invoked with three arguments:
	     * (value, key, object).
	     *
	     * @static
	     * @memberOf _
	     * @since 2.4.0
	     * @category Object
	     * @param {Object} object The object to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The function invoked per iteration.
	     * @returns {Object} Returns the new mapped object.
	     * @see _.mapKeys
	     * @example
	     *
	     * var users = {
	     *   'fred':    { 'user': 'fred',    'age': 40 },
	     *   'pebbles': { 'user': 'pebbles', 'age': 1 }
	     * };
	     *
	     * _.mapValues(users, function(o) { return o.age; });
	     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.mapValues(users, 'age');
	     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
	     */
	    function mapValues(object, iteratee) {
	      var result = {};
	      iteratee = getIteratee(iteratee, 3);

	      baseForOwn(object, function(value, key, object) {
	        result[key] = iteratee(value, key, object);
	      });
	      return result;
	    }

	    /**
	     * This method is like `_.assign` except that it recursively merges own and
	     * inherited enumerable string keyed properties of source objects into the
	     * destination object. Source properties that resolve to `undefined` are
	     * skipped if a destination value exists. Array and plain object properties
	     * are merged recursively. Other objects and value types are overridden by
	     * assignment. Source objects are applied from left to right. Subsequent
	     * sources overwrite property assignments of previous sources.
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.5.0
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} [sources] The source objects.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * var 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 }] }
	     */
	    var merge = createAssigner(function(object, source, srcIndex) {
	      baseMerge(object, source, srcIndex);
	    });

	    /**
	     * This method is like `_.merge` except that it accepts `customizer` which
	     * is invoked to produce the merged values of the destination and source
	     * properties. If `customizer` returns `undefined`, merging is handled by the
	     * method instead. The `customizer` is invoked with seven arguments:
	     * (objValue, srcValue, key, object, source, stack).
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The destination object.
	     * @param {...Object} sources The source objects.
	     * @param {Function} customizer The function to customize assigned values.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * function customizer(objValue, srcValue) {
	     *   if (_.isArray(objValue)) {
	     *     return objValue.concat(srcValue);
	     *   }
	     * }
	     *
	     * var object = {
	     *   'fruits': ['apple'],
	     *   'vegetables': ['beet']
	     * };
	     *
	     * var other = {
	     *   'fruits': ['banana'],
	     *   'vegetables': ['carrot']
	     * };
	     *
	     * _.mergeWith(object, other, customizer);
	     * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] }
	     */
	    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {
	      baseMerge(object, source, srcIndex, customizer);
	    });

	    /**
	     * The opposite of `_.pick`; this method creates an object composed of the
	     * own and inherited enumerable string keyed properties of `object` that are
	     * not omitted.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The source object.
	     * @param {...(string|string[])} [props] The property identifiers to omit.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': '2', 'c': 3 };
	     *
	     * _.omit(object, ['a', 'c']);
	     * // => { 'b': '2' }
	     */
	    var omit = rest(function(object, props) {
	      if (object == null) {
	        return {};
	      }
	      props = arrayMap(baseFlatten(props, 1), toKey);
	      return basePick(object, baseDifference(getAllKeysIn(object), props));
	    });

	    /**
	     * The opposite of `_.pickBy`; this method creates an object composed of
	     * the own and inherited enumerable string keyed properties of `object` that
	     * `predicate` doesn't return truthy for. The predicate is invoked with two
	     * arguments: (value, key).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The source object.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per property.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': '2', 'c': 3 };
	     *
	     * _.omitBy(object, _.isNumber);
	     * // => { 'b': '2' }
	     */
	    function omitBy(object, predicate) {
	      predicate = getIteratee(predicate);
	      return basePickBy(object, function(value, key) {
	        return !predicate(value, key);
	      });
	    }

	    /**
	     * Creates an object composed of the picked `object` properties.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The source object.
	     * @param {...(string|string[])} [props] The property identifiers to pick.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': '2', 'c': 3 };
	     *
	     * _.pick(object, ['a', 'c']);
	     * // => { 'a': 1, 'c': 3 }
	     */
	    var pick = rest(function(object, props) {
	      return object == null ? {} : basePick(object, arrayMap(baseFlatten(props, 1), toKey));
	    });

	    /**
	     * Creates an object composed of the `object` properties `predicate` returns
	     * truthy for. The predicate is invoked with two arguments: (value, key).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The source object.
	     * @param {Array|Function|Object|string} [predicate=_.identity]
	     *  The function invoked per property.
	     * @returns {Object} Returns the new object.
	     * @example
	     *
	     * var object = { 'a': 1, 'b': '2', 'c': 3 };
	     *
	     * _.pickBy(object, _.isNumber);
	     * // => { 'a': 1, 'c': 3 }
	     */
	    function pickBy(object, predicate) {
	      return object == null ? {} : basePickBy(object, getIteratee(predicate));
	    }

	    /**
	     * This method is like `_.get` except that if the resolved value is a
	     * function it's invoked with the `this` binding of its parent object and
	     * its result is returned.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The object to query.
	     * @param {Array|string} path The path of the property to resolve.
	     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
	     * @returns {*} Returns the resolved value.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };
	     *
	     * _.result(object, 'a[0].b.c1');
	     * // => 3
	     *
	     * _.result(object, 'a[0].b.c2');
	     * // => 4
	     *
	     * _.result(object, 'a[0].b.c3', 'default');
	     * // => 'default'
	     *
	     * _.result(object, 'a[0].b.c3', _.constant('default'));
	     * // => 'default'
	     */
	    function result(object, path, defaultValue) {
	      path = isKey(path, object) ? [path] : castPath(path);

	      var index = -1,
	          length = path.length;

	      // Ensure the loop is entered when path is empty.
	      if (!length) {
	        object = undefined;
	        length = 1;
	      }
	      while (++index < length) {
	        var value = object == null ? undefined : object[toKey(path[index])];
	        if (value === undefined) {
	          index = length;
	          value = defaultValue;
	        }
	        object = isFunction(value) ? value.call(object) : value;
	      }
	      return object;
	    }

	    /**
	     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,
	     * it's created. Arrays are created for missing index properties while objects
	     * are created for all other missing properties. Use `_.setWith` to customize
	     * `path` creation.
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.7.0
	     * @category Object
	     * @param {Object} object The object to modify.
	     * @param {Array|string} path The path of the property to set.
	     * @param {*} value The value to set.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
	     *
	     * _.set(object, 'a[0].b.c', 4);
	     * console.log(object.a[0].b.c);
	     * // => 4
	     *
	     * _.set(object, ['x', '0', 'y', 'z'], 5);
	     * console.log(object.x[0].y.z);
	     * // => 5
	     */
	    function set(object, path, value) {
	      return object == null ? object : baseSet(object, path, value);
	    }

	    /**
	     * This method is like `_.set` except that it accepts `customizer` which is
	     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
	     * path creation is handled by the method instead. The `customizer` is invoked
	     * with three arguments: (nsValue, key, nsObject).
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The object to modify.
	     * @param {Array|string} path The path of the property to set.
	     * @param {*} value The value to set.
	     * @param {Function} [customizer] The function to customize assigned values.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * var object = {};
	     *
	     * _.setWith(object, '[0][1]', 'a', Object);
	     * // => { '0': { '1': 'a' } }
	     */
	    function setWith(object, path, value, customizer) {
	      customizer = typeof customizer == 'function' ? customizer : undefined;
	      return object == null ? object : baseSet(object, path, value, customizer);
	    }

	    /**
	     * Creates an array of own enumerable string keyed-value pairs for `object`
	     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its
	     * entries are returned.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @alias entries
	     * @category Object
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the key-value pairs.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.toPairs(new Foo);
	     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
	     */
	    var toPairs = createToPairs(keys);

	    /**
	     * Creates an array of own and inherited enumerable string keyed-value pairs
	     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map
	     * or set, its entries are returned.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @alias entriesIn
	     * @category Object
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the key-value pairs.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.toPairsIn(new Foo);
	     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)
	     */
	    var toPairsIn = createToPairs(keysIn);

	    /**
	     * An alternative to `_.reduce`; this method transforms `object` to a new
	     * `accumulator` object which is the result of running each of its own
	     * enumerable string keyed properties thru `iteratee`, with each invocation
	     * potentially mutating the `accumulator` object. The iteratee is invoked
	     * with four arguments: (accumulator, value, key, object). Iteratee functions
	     * may exit iteration early by explicitly returning `false`.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.3.0
	     * @category Object
	     * @param {Array|Object} object The object to iterate over.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @param {*} [accumulator] The custom accumulator value.
	     * @returns {*} Returns the accumulated value.
	     * @example
	     *
	     * _.transform([2, 3, 4], function(result, n) {
	     *   result.push(n *= n);
	     *   return n % 2 == 0;
	     * }, []);
	     * // => [4, 9]
	     *
	     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
	     *   (result[value] || (result[value] = [])).push(key);
	     * }, {});
	     * // => { '1': ['a', 'c'], '2': ['b'] }
	     */
	    function transform(object, iteratee, accumulator) {
	      var isArr = isArray(object) || isTypedArray(object);
	      iteratee = getIteratee(iteratee, 4);

	      if (accumulator == null) {
	        if (isArr || isObject(object)) {
	          var Ctor = object.constructor;
	          if (isArr) {
	            accumulator = isArray(object) ? new Ctor : [];
	          } else {
	            accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};
	          }
	        } else {
	          accumulator = {};
	        }
	      }
	      (isArr ? arrayEach : baseForOwn)(object, function(value, index, object) {
	        return iteratee(accumulator, value, index, object);
	      });
	      return accumulator;
	    }

	    /**
	     * Removes the property at `path` of `object`.
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Object
	     * @param {Object} object The object to modify.
	     * @param {Array|string} path The path of the property to unset.
	     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': 7 } }] };
	     * _.unset(object, 'a[0].b.c');
	     * // => true
	     *
	     * console.log(object);
	     * // => { 'a': [{ 'b': {} }] };
	     *
	     * _.unset(object, ['a', '0', 'b', 'c']);
	     * // => true
	     *
	     * console.log(object);
	     * // => { 'a': [{ 'b': {} }] };
	     */
	    function unset(object, path) {
	      return object == null ? true : baseUnset(object, path);
	    }

	    /**
	     * This method is like `_.set` except that accepts `updater` to produce the
	     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`
	     * is invoked with one argument: (value).
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.6.0
	     * @category Object
	     * @param {Object} object The object to modify.
	     * @param {Array|string} path The path of the property to set.
	     * @param {Function} updater The function to produce the updated value.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
	     *
	     * _.update(object, 'a[0].b.c', function(n) { return n * n; });
	     * console.log(object.a[0].b.c);
	     * // => 9
	     *
	     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });
	     * console.log(object.x[0].y.z);
	     * // => 0
	     */
	    function update(object, path, updater) {
	      return object == null ? object : baseUpdate(object, path, castFunction(updater));
	    }

	    /**
	     * This method is like `_.update` except that it accepts `customizer` which is
	     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
	     * path creation is handled by the method instead. The `customizer` is invoked
	     * with three arguments: (nsValue, key, nsObject).
	     *
	     * **Note:** This method mutates `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.6.0
	     * @category Object
	     * @param {Object} object The object to modify.
	     * @param {Array|string} path The path of the property to set.
	     * @param {Function} updater The function to produce the updated value.
	     * @param {Function} [customizer] The function to customize assigned values.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * var object = {};
	     *
	     * _.updateWith(object, '[0][1]', _.constant('a'), Object);
	     * // => { '0': { '1': 'a' } }
	     */
	    function updateWith(object, path, updater, customizer) {
	      customizer = typeof customizer == 'function' ? customizer : undefined;
	      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);
	    }

	    /**
	     * Creates an array of the own enumerable string keyed property values of `object`.
	     *
	     * **Note:** Non-object values are coerced to objects.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Object
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property values.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.values(new Foo);
	     * // => [1, 2] (iteration order is not guaranteed)
	     *
	     * _.values('hi');
	     * // => ['h', 'i']
	     */
	    function values(object) {
	      return object ? baseValues(object, keys(object)) : [];
	    }

	    /**
	     * Creates an array of the own and inherited enumerable string keyed property
	     * values of `object`.
	     *
	     * **Note:** Non-object values are coerced to objects.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Object
	     * @param {Object} object The object to query.
	     * @returns {Array} Returns the array of property values.
	     * @example
	     *
	     * function Foo() {
	     *   this.a = 1;
	     *   this.b = 2;
	     * }
	     *
	     * Foo.prototype.c = 3;
	     *
	     * _.valuesIn(new Foo);
	     * // => [1, 2, 3] (iteration order is not guaranteed)
	     */
	    function valuesIn(object) {
	      return object == null ? [] : baseValues(object, keysIn(object));
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Clamps `number` within the inclusive `lower` and `upper` bounds.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Number
	     * @param {number} number The number to clamp.
	     * @param {number} [lower] The lower bound.
	     * @param {number} upper The upper bound.
	     * @returns {number} Returns the clamped number.
	     * @example
	     *
	     * _.clamp(-10, -5, 5);
	     * // => -5
	     *
	     * _.clamp(10, -5, 5);
	     * // => 5
	     */
	    function clamp(number, lower, upper) {
	      if (upper === undefined) {
	        upper = lower;
	        lower = undefined;
	      }
	      if (upper !== undefined) {
	        upper = toNumber(upper);
	        upper = upper === upper ? upper : 0;
	      }
	      if (lower !== undefined) {
	        lower = toNumber(lower);
	        lower = lower === lower ? lower : 0;
	      }
	      return baseClamp(toNumber(number), lower, upper);
	    }

	    /**
	     * Checks if `n` is between `start` and up to, but not including, `end`. If
	     * `end` is not specified, it's set to `start` with `start` then set to `0`.
	     * If `start` is greater than `end` the params are swapped to support
	     * negative ranges.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.3.0
	     * @category Number
	     * @param {number} number The number to check.
	     * @param {number} [start=0] The start of the range.
	     * @param {number} end The end of the range.
	     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
	     * @see _.range, _.rangeRight
	     * @example
	     *
	     * _.inRange(3, 2, 4);
	     * // => true
	     *
	     * _.inRange(4, 8);
	     * // => true
	     *
	     * _.inRange(4, 2);
	     * // => false
	     *
	     * _.inRange(2, 2);
	     * // => false
	     *
	     * _.inRange(1.2, 2);
	     * // => true
	     *
	     * _.inRange(5.2, 4);
	     * // => false
	     *
	     * _.inRange(-3, -2, -6);
	     * // => true
	     */
	    function inRange(number, start, end) {
	      start = toNumber(start) || 0;
	      if (end === undefined) {
	        end = start;
	        start = 0;
	      } else {
	        end = toNumber(end) || 0;
	      }
	      number = toNumber(number);
	      return baseInRange(number, start, end);
	    }

	    /**
	     * Produces a random number between the inclusive `lower` and `upper` bounds.
	     * If only one argument is provided a number between `0` and the given number
	     * is returned. If `floating` is `true`, or either `lower` or `upper` are
	     * floats, a floating-point number is returned instead of an integer.
	     *
	     * **Note:** JavaScript follows the IEEE-754 standard for resolving
	     * floating-point values which can produce unexpected results.
	     *
	     * @static
	     * @memberOf _
	     * @since 0.7.0
	     * @category Number
	     * @param {number} [lower=0] The lower bound.
	     * @param {number} [upper=1] The upper bound.
	     * @param {boolean} [floating] Specify returning a floating-point number.
	     * @returns {number} Returns the random number.
	     * @example
	     *
	     * _.random(0, 5);
	     * // => an integer between 0 and 5
	     *
	     * _.random(5);
	     * // => also an integer between 0 and 5
	     *
	     * _.random(5, true);
	     * // => a floating-point number between 0 and 5
	     *
	     * _.random(1.2, 5.2);
	     * // => a floating-point number between 1.2 and 5.2
	     */
	    function random(lower, upper, floating) {
	      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {
	        upper = floating = undefined;
	      }
	      if (floating === undefined) {
	        if (typeof upper == 'boolean') {
	          floating = upper;
	          upper = undefined;
	        }
	        else if (typeof lower == 'boolean') {
	          floating = lower;
	          lower = undefined;
	        }
	      }
	      if (lower === undefined && upper === undefined) {
	        lower = 0;
	        upper = 1;
	      }
	      else {
	        lower = toNumber(lower) || 0;
	        if (upper === undefined) {
	          upper = lower;
	          lower = 0;
	        } else {
	          upper = toNumber(upper) || 0;
	        }
	      }
	      if (lower > upper) {
	        var temp = lower;
	        lower = upper;
	        upper = temp;
	      }
	      if (floating || lower % 1 || upper % 1) {
	        var rand = nativeRandom();
	        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);
	      }
	      return baseRandom(lower, upper);
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the camel cased string.
	     * @example
	     *
	     * _.camelCase('Foo Bar');
	     * // => 'fooBar'
	     *
	     * _.camelCase('--foo-bar--');
	     * // => 'fooBar'
	     *
	     * _.camelCase('__FOO_BAR__');
	     * // => 'fooBar'
	     */
	    var camelCase = createCompounder(function(result, word, index) {
	      word = word.toLowerCase();
	      return result + (index ? capitalize(word) : word);
	    });

	    /**
	     * Converts the first character of `string` to upper case and the remaining
	     * to lower case.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to capitalize.
	     * @returns {string} Returns the capitalized string.
	     * @example
	     *
	     * _.capitalize('FRED');
	     * // => 'Fred'
	     */
	    function capitalize(string) {
	      return upperFirst(toString(string).toLowerCase());
	    }

	    /**
	     * Deburrs `string` by converting
	     * [latin-1 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 _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to deburr.
	     * @returns {string} Returns the deburred string.
	     * @example
	     *
	     * _.deburr('déjà vu');
	     * // => 'deja vu'
	     */
	    function deburr(string) {
	      string = toString(string);
	      return string && string.replace(reLatin1, deburrLetter).replace(reComboMark, '');
	    }

	    /**
	     * Checks if `string` ends with the given target string.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to 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 = toString(string);
	      target = baseToString(target);

	      var length = string.length;
	      position = position === undefined
	        ? length
	        : baseClamp(toInteger(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 IE < 9, they can break out of
	     * attribute values or HTML comments. See [#59](https://html5sec.org/#59),
	     * [#102](https://html5sec.org/#102), [#108](https://html5sec.org/#108), and
	     * [#133](https://html5sec.org/#133) of the
	     * [HTML5 Security Cheatsheet](https://html5sec.org/) for more details.
	     *
	     * When working with HTML you should always
	     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce
	     * XSS vectors.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category String
	     * @param {string} [string=''] The string to escape.
	     * @returns {string} Returns the escaped string.
	     * @example
	     *
	     * _.escape('fred, barney, & pebbles');
	     * // => 'fred, barney, &amp; pebbles'
	     */
	    function escape(string) {
	      string = toString(string);
	      return (string && reHasUnescapedHtml.test(string))
	        ? string.replace(reUnescapedHtml, escapeHtmlChar)
	        : string;
	    }

	    /**
	     * Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+",
	     * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to escape.
	     * @returns {string} Returns the escaped string.
	     * @example
	     *
	     * _.escapeRegExp('[lodash](https://lodash.com/)');
	     * // => '\[lodash\]\(https://lodash\.com/\)'
	     */
	    function escapeRegExp(string) {
	      string = toString(string);
	      return (string && reHasRegExpChar.test(string))
	        ? string.replace(reRegExpChar, '\\$&')
	        : string;
	    }

	    /**
	     * Converts `string` to
	     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the kebab cased string.
	     * @example
	     *
	     * _.kebabCase('Foo Bar');
	     * // => 'foo-bar'
	     *
	     * _.kebabCase('fooBar');
	     * // => 'foo-bar'
	     *
	     * _.kebabCase('__FOO_BAR__');
	     * // => 'foo-bar'
	     */
	    var kebabCase = createCompounder(function(result, word, index) {
	      return result + (index ? '-' : '') + word.toLowerCase();
	    });

	    /**
	     * Converts `string`, as space separated words, to lower case.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the lower cased string.
	     * @example
	     *
	     * _.lowerCase('--Foo-Bar--');
	     * // => 'foo bar'
	     *
	     * _.lowerCase('fooBar');
	     * // => 'foo bar'
	     *
	     * _.lowerCase('__FOO_BAR__');
	     * // => 'foo bar'
	     */
	    var lowerCase = createCompounder(function(result, word, index) {
	      return result + (index ? ' ' : '') + word.toLowerCase();
	    });

	    /**
	     * Converts the first character of `string` to lower case.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the converted string.
	     * @example
	     *
	     * _.lowerFirst('Fred');
	     * // => 'fred'
	     *
	     * _.lowerFirst('FRED');
	     * // => 'fRED'
	     */
	    var lowerFirst = createCaseFirst('toLowerCase');

	    /**
	     * Pads `string` on the left and right sides if it's shorter than `length`.
	     * Padding characters are truncated if they can't be evenly divided by `length`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to pad.
	     * @param {number} [length=0] The padding length.
	     * @param {string} [chars=' '] The string used as padding.
	     * @returns {string} Returns the padded string.
	     * @example
	     *
	     * _.pad('abc', 8);
	     * // => '  abc   '
	     *
	     * _.pad('abc', 8, '_-');
	     * // => '_-abc_-_'
	     *
	     * _.pad('abc', 3);
	     * // => 'abc'
	     */
	    function pad(string, length, chars) {
	      string = toString(string);
	      length = toInteger(length);

	      var strLength = length ? stringSize(string) : 0;
	      if (!length || strLength >= length) {
	        return string;
	      }
	      var mid = (length - strLength) / 2;
	      return (
	        createPadding(nativeFloor(mid), chars) +
	        string +
	        createPadding(nativeCeil(mid), chars)
	      );
	    }

	    /**
	     * Pads `string` on the right side if it's shorter than `length`. Padding
	     * characters are truncated if they exceed `length`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to pad.
	     * @param {number} [length=0] The padding length.
	     * @param {string} [chars=' '] The string used as padding.
	     * @returns {string} Returns the padded string.
	     * @example
	     *
	     * _.padEnd('abc', 6);
	     * // => 'abc   '
	     *
	     * _.padEnd('abc', 6, '_-');
	     * // => 'abc_-_'
	     *
	     * _.padEnd('abc', 3);
	     * // => 'abc'
	     */
	    function padEnd(string, length, chars) {
	      string = toString(string);
	      length = toInteger(length);

	      var strLength = length ? stringSize(string) : 0;
	      return (length && strLength < length)
	        ? (string + createPadding(length - strLength, chars))
	        : string;
	    }

	    /**
	     * Pads `string` on the left side if it's shorter than `length`. Padding
	     * characters are truncated if they exceed `length`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to pad.
	     * @param {number} [length=0] The padding length.
	     * @param {string} [chars=' '] The string used as padding.
	     * @returns {string} Returns the padded string.
	     * @example
	     *
	     * _.padStart('abc', 6);
	     * // => '   abc'
	     *
	     * _.padStart('abc', 6, '_-');
	     * // => '_-_abc'
	     *
	     * _.padStart('abc', 3);
	     * // => 'abc'
	     */
	    function padStart(string, length, chars) {
	      string = toString(string);
	      length = toInteger(length);

	      var strLength = length ? stringSize(string) : 0;
	      return (length && strLength < length)
	        ? (createPadding(length - strLength, chars) + string)
	        : string;
	    }

	    /**
	     * Converts `string` to an integer of the specified radix. If `radix` is
	     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a
	     * hexadecimal, in which case a `radix` of `16` is used.
	     *
	     * **Note:** This method aligns with the
	     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.
	     *
	     * @static
	     * @memberOf _
	     * @since 1.1.0
	     * @category String
	     * @param {string} string The string to convert.
	     * @param {number} [radix=10] The radix to interpret `value` by.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {number} Returns the converted integer.
	     * @example
	     *
	     * _.parseInt('08');
	     * // => 8
	     *
	     * _.map(['6', '08', '10'], _.parseInt);
	     * // => [6, 8, 10]
	     */
	    function parseInt(string, radix, guard) {
	      // Chrome fails to trim leading <BOM> whitespace characters.
	      // See https://bugs.chromium.org/p/v8/issues/detail?id=3109 for more details.
	      if (guard || radix == null) {
	        radix = 0;
	      } else if (radix) {
	        radix = +radix;
	      }
	      string = toString(string).replace(reTrim, '');
	      return nativeParseInt(string, radix || (reHasHexPrefix.test(string) ? 16 : 10));
	    }

	    /**
	     * Repeats the given string `n` times.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to repeat.
	     * @param {number} [n=1] The number of times to repeat the string.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {string} Returns the repeated string.
	     * @example
	     *
	     * _.repeat('*', 3);
	     * // => '***'
	     *
	     * _.repeat('abc', 2);
	     * // => 'abcabc'
	     *
	     * _.repeat('abc', 0);
	     * // => ''
	     */
	    function repeat(string, n, guard) {
	      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {
	        n = 1;
	      } else {
	        n = toInteger(n);
	      }
	      return baseRepeat(toString(string), n);
	    }

	    /**
	     * Replaces matches for `pattern` in `string` with `replacement`.
	     *
	     * **Note:** This method is based on
	     * [`String#replace`](https://mdn.io/String/replace).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to modify.
	     * @param {RegExp|string} pattern The pattern to replace.
	     * @param {Function|string} replacement The match replacement.
	     * @returns {string} Returns the modified string.
	     * @example
	     *
	     * _.replace('Hi Fred', 'Fred', 'Barney');
	     * // => 'Hi Barney'
	     */
	    function replace() {
	      var args = arguments,
	          string = toString(args[0]);

	      return args.length < 3 ? string : nativeReplace.call(string, args[1], args[2]);
	    }

	    /**
	     * Converts `string` to
	     * [snake case](https://en.wikipedia.org/wiki/Snake_case).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the snake cased string.
	     * @example
	     *
	     * _.snakeCase('Foo Bar');
	     * // => 'foo_bar'
	     *
	     * _.snakeCase('fooBar');
	     * // => 'foo_bar'
	     *
	     * _.snakeCase('--FOO-BAR--');
	     * // => 'foo_bar'
	     */
	    var snakeCase = createCompounder(function(result, word, index) {
	      return result + (index ? '_' : '') + word.toLowerCase();
	    });

	    /**
	     * Splits `string` by `separator`.
	     *
	     * **Note:** This method is based on
	     * [`String#split`](https://mdn.io/String/split).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to split.
	     * @param {RegExp|string} separator The separator pattern to split by.
	     * @param {number} [limit] The length to truncate results to.
	     * @returns {Array} Returns the string segments.
	     * @example
	     *
	     * _.split('a-b-c', '-', 2);
	     * // => ['a', 'b']
	     */
	    function split(string, separator, limit) {
	      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {
	        separator = limit = undefined;
	      }
	      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;
	      if (!limit) {
	        return [];
	      }
	      string = toString(string);
	      if (string && (
	            typeof separator == 'string' ||
	            (separator != null && !isRegExp(separator))
	          )) {
	        separator = baseToString(separator);
	        if (separator == '' && reHasComplexSymbol.test(string)) {
	          return castSlice(stringToArray(string), 0, limit);
	        }
	      }
	      return nativeSplit.call(string, separator, limit);
	    }

	    /**
	     * Converts `string` to
	     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
	     *
	     * @static
	     * @memberOf _
	     * @since 3.1.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the start cased string.
	     * @example
	     *
	     * _.startCase('--foo-bar--');
	     * // => 'Foo Bar'
	     *
	     * _.startCase('fooBar');
	     * // => 'Foo Bar'
	     *
	     * _.startCase('__FOO_BAR__');
	     * // => 'FOO BAR'
	     */
	    var startCase = createCompounder(function(result, word, index) {
	      return result + (index ? ' ' : '') + upperFirst(word);
	    });

	    /**
	     * Checks if `string` starts with the given target string.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to 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 = toString(string);
	      position = baseClamp(toInteger(position), 0, string.length);
	      return string.lastIndexOf(baseToString(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 given, it takes precedence over `_.templateSettings` values.
	     *
	     * **Note:** In the development build `_.template` utilizes
	     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
	     * for easier debugging.
	     *
	     * For more information on precompiling templates see
	     * [lodash's custom builds documentation](https://lodash.com/custom-builds).
	     *
	     * For more information on Chrome extension sandboxes see
	     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category String
	     * @param {string} [string=''] The template string.
	     * @param {Object} [options={}] The options object.
	     * @param {RegExp} [options.escape=_.templateSettings.escape]
	     *  The HTML "escape" delimiter.
	     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]
	     *  The "evaluate" delimiter.
	     * @param {Object} [options.imports=_.templateSettings.imports]
	     *  An object to import into the template as free variables.
	     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]
	     *  The "interpolate" delimiter.
	     * @param {string} [options.sourceURL='lodash.templateSources[n]']
	     *  The sourceURL of the compiled template.
	     * @param {string} [options.variable='obj']
	     *  The data object variable name.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Function} Returns the compiled template function.
	     * @example
	     *
	     * // Use the "interpolate" delimiter to create a compiled template.
	     * var compiled = _.template('hello <%= user %>!');
	     * compiled({ 'user': 'fred' });
	     * // => 'hello fred!'
	     *
	     * // Use the HTML "escape" delimiter to escape data property values.
	     * var compiled = _.template('<b><%- value %></b>');
	     * compiled({ 'value': '<script>' });
	     * // => '<b>&lt;script&gt;</b>'
	     *
	     * // Use the "evaluate" delimiter to execute JavaScript and generate HTML.
	     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');
	     * compiled({ 'users': ['fred', 'barney'] });
	     * // => '<li>fred</li><li>barney</li>'
	     *
	     * // Use the internal `print` function in "evaluate" delimiters.
	     * var compiled = _.template('<% print("hello " + user); %>!');
	     * compiled({ 'user': 'barney' });
	     * // => 'hello barney!'
	     *
	     * // Use the ES delimiter as an alternative to the default "interpolate" delimiter.
	     * var compiled = _.template('hello ${ user }!');
	     * compiled({ 'user': 'pebbles' });
	     * // => 'hello pebbles!'
	     *
	     * // Use backslashes to treat delimiters as plain text.
	     * var compiled = _.template('<%= "\\<%- value %\\>" %>');
	     * compiled({ 'value': 'ignored' });
	     * // => '<%- value %>'
	     *
	     * // Use the `imports` option to import `jQuery` as `jq`.
	     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';
	     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });
	     * compiled({ 'users': ['fred', 'barney'] });
	     * // => '<li>fred</li><li>barney</li>'
	     *
	     * // Use the `sourceURL` option to specify a custom sourceURL for the template.
	     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });
	     * compiled(data);
	     * // => Find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector.
	     *
	     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.
	     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
	     * compiled.source;
	     * // => function(data) {
	     * //   var __t, __p = '';
	     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
	     * //   return __p;
	     * // }
	     *
	     * // Use custom template delimiters.
	     * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
	     * var compiled = _.template('hello {{ user }}!');
	     * compiled({ 'user': 'mustache' });
	     * // => 'hello mustache!'
	     *
	     * // Use the `source` property to inline compiled templates for meaningful
	     * // line numbers in error messages and stack traces.
	     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\
	     *   var JST = {\
	     *     "main": ' + _.template(mainText).source + '\
	     *   };\
	     * ');
	     */
	    function template(string, options, guard) {
	      // Based on John Resig's `tmpl` implementation
	      // (http://ejohn.org/blog/javascript-micro-templating/)
	      // and Laura Doktorova's doT.js (https://github.com/olado/doT).
	      var settings = lodash.templateSettings;

	      if (guard && isIterateeCall(string, options, guard)) {
	        options = undefined;
	      }
	      string = toString(string);
	      options = assignInWith({}, options, settings, assignInDefaults);

	      var imports = assignInWith({}, options.imports, settings.imports, assignInDefaults),
	          importsKeys = keys(imports),
	          importsValues = baseValues(imports, importsKeys);

	      var isEscaping,
	          isEvaluating,
	          index = 0,
	          interpolate = options.interpolate || reNoMatch,
	          source = "__p += '";

	      // Compile the regexp to match each delimiter.
	      var reDelimiters = RegExp(
	        (options.escape || reNoMatch).source + '|' +
	        interpolate.source + '|' +
	        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +
	        (options.evaluate || reNoMatch).source + '|$'
	      , 'g');

	      // Use a sourceURL for easier debugging.
	      var sourceURL = '//# sourceURL=' +
	        ('sourceURL' in options
	          ? options.sourceURL
	          : ('lodash.templateSources[' + (++templateCounter) + ']')
	        ) + '\n';

	      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {
	        interpolateValue || (interpolateValue = esTemplateValue);

	        // Escape characters that can't be included in string literals.
	        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);

	        // Replace delimiters with snippets.
	        if (escapeValue) {
	          isEscaping = true;
	          source += "' +\n__e(" + escapeValue + ") +\n'";
	        }
	        if (evaluateValue) {
	          isEvaluating = true;
	          source += "';\n" + evaluateValue + ";\n__p += '";
	        }
	        if (interpolateValue) {
	          source += "' +\n((__t = (" + interpolateValue + ")) == null ? '' : __t) +\n'";
	        }
	        index = offset + match.length;

	        // The JS engine embedded in Adobe products needs `match` returned in
	        // order to produce the correct `offset` value.
	        return match;
	      });

	      source += "';\n";

	      // If `variable` is not specified wrap a with-statement around the generated
	      // code to add the data object to the top of the scope chain.
	      var variable = options.variable;
	      if (!variable) {
	        source = 'with (obj) {\n' + source + '\n}\n';
	      }
	      // Cleanup code by stripping empty strings.
	      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)
	        .replace(reEmptyStringMiddle, '$1')
	        .replace(reEmptyStringTrailing, '$1;');

	      // Frame code as the function body.
	      source = 'function(' + (variable || 'obj') + ') {\n' +
	        (variable
	          ? ''
	          : 'obj || (obj = {});\n'
	        ) +
	        "var __t, __p = ''" +
	        (isEscaping
	           ? ', __e = _.escape'
	           : ''
	        ) +
	        (isEvaluating
	          ? ', __j = Array.prototype.join;\n' +
	            "function print() { __p += __j.call(arguments, '') }\n"
	          : ';\n'
	        ) +
	        source +
	        'return __p\n}';

	      var result = attempt(function() {
	        return Function(importsKeys, sourceURL + 'return ' + source)
	          .apply(undefined, importsValues);
	      });

	      // Provide the compiled function's source by its `toString` method or
	      // the `source` property as a convenience for inlining compiled templates.
	      result.source = source;
	      if (isError(result)) {
	        throw result;
	      }
	      return result;
	    }

	    /**
	     * Converts `string`, as a whole, to lower case just like
	     * [String#toLowerCase](https://mdn.io/toLowerCase).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the lower cased string.
	     * @example
	     *
	     * _.toLower('--Foo-Bar--');
	     * // => '--foo-bar--'
	     *
	     * _.toLower('fooBar');
	     * // => 'foobar'
	     *
	     * _.toLower('__FOO_BAR__');
	     * // => '__foo_bar__'
	     */
	    function toLower(value) {
	      return toString(value).toLowerCase();
	    }

	    /**
	     * Converts `string`, as a whole, to upper case just like
	     * [String#toUpperCase](https://mdn.io/toUpperCase).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the upper cased string.
	     * @example
	     *
	     * _.toUpper('--foo-bar--');
	     * // => '--FOO-BAR--'
	     *
	     * _.toUpper('fooBar');
	     * // => 'FOOBAR'
	     *
	     * _.toUpper('__foo_bar__');
	     * // => '__FOO_BAR__'
	     */
	    function toUpper(value) {
	      return toString(value).toUpperCase();
	    }

	    /**
	     * Removes leading and trailing whitespace or specified characters from `string`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to trim.
	     * @param {string} [chars=whitespace] The characters to trim.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {string} Returns the trimmed string.
	     * @example
	     *
	     * _.trim('  abc  ');
	     * // => 'abc'
	     *
	     * _.trim('-_-abc-_-', '_-');
	     * // => 'abc'
	     *
	     * _.map(['  foo  ', '  bar  '], _.trim);
	     * // => ['foo', 'bar']
	     */
	    function trim(string, chars, guard) {
	      string = toString(string);
	      if (string && (guard || chars === undefined)) {
	        return string.replace(reTrim, '');
	      }
	      if (!string || !(chars = baseToString(chars))) {
	        return string;
	      }
	      var strSymbols = stringToArray(string),
	          chrSymbols = stringToArray(chars),
	          start = charsStartIndex(strSymbols, chrSymbols),
	          end = charsEndIndex(strSymbols, chrSymbols) + 1;

	      return castSlice(strSymbols, start, end).join('');
	    }

	    /**
	     * Removes trailing whitespace or specified characters from `string`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to trim.
	     * @param {string} [chars=whitespace] The characters to trim.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {string} Returns the trimmed string.
	     * @example
	     *
	     * _.trimEnd('  abc  ');
	     * // => '  abc'
	     *
	     * _.trimEnd('-_-abc-_-', '_-');
	     * // => '-_-abc'
	     */
	    function trimEnd(string, chars, guard) {
	      string = toString(string);
	      if (string && (guard || chars === undefined)) {
	        return string.replace(reTrimEnd, '');
	      }
	      if (!string || !(chars = baseToString(chars))) {
	        return string;
	      }
	      var strSymbols = stringToArray(string),
	          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;

	      return castSlice(strSymbols, 0, end).join('');
	    }

	    /**
	     * Removes leading whitespace or specified characters from `string`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to trim.
	     * @param {string} [chars=whitespace] The characters to trim.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {string} Returns the trimmed string.
	     * @example
	     *
	     * _.trimStart('  abc  ');
	     * // => 'abc  '
	     *
	     * _.trimStart('-_-abc-_-', '_-');
	     * // => 'abc-_-'
	     */
	    function trimStart(string, chars, guard) {
	      string = toString(string);
	      if (string && (guard || chars === undefined)) {
	        return string.replace(reTrimStart, '');
	      }
	      if (!string || !(chars = baseToString(chars))) {
	        return string;
	      }
	      var strSymbols = stringToArray(string),
	          start = charsStartIndex(strSymbols, stringToArray(chars));

	      return castSlice(strSymbols, start).join('');
	    }

	    /**
	     * Truncates `string` if it's longer than the given maximum string length.
	     * The last characters of the truncated string are replaced with the omission
	     * string which defaults to "...".
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to truncate.
	     * @param {Object} [options={}] The options object.
	     * @param {number} [options.length=30] The maximum string length.
	     * @param {string} [options.omission='...'] The string to indicate text is omitted.
	     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.
	     * @returns {string} Returns the truncated string.
	     * @example
	     *
	     * _.truncate('hi-diddly-ho there, neighborino');
	     * // => 'hi-diddly-ho there, neighbo...'
	     *
	     * _.truncate('hi-diddly-ho there, neighborino', {
	     *   'length': 24,
	     *   'separator': ' '
	     * });
	     * // => 'hi-diddly-ho there,...'
	     *
	     * _.truncate('hi-diddly-ho there, neighborino', {
	     *   'length': 24,
	     *   'separator': /,? +/
	     * });
	     * // => 'hi-diddly-ho there...'
	     *
	     * _.truncate('hi-diddly-ho there, neighborino', {
	     *   'omission': ' [...]'
	     * });
	     * // => 'hi-diddly-ho there, neig [...]'
	     */
	    function truncate(string, options) {
	      var length = DEFAULT_TRUNC_LENGTH,
	          omission = DEFAULT_TRUNC_OMISSION;

	      if (isObject(options)) {
	        var separator = 'separator' in options ? options.separator : separator;
	        length = 'length' in options ? toInteger(options.length) : length;
	        omission = 'omission' in options ? baseToString(options.omission) : omission;
	      }
	      string = toString(string);

	      var strLength = string.length;
	      if (reHasComplexSymbol.test(string)) {
	        var strSymbols = stringToArray(string);
	        strLength = strSymbols.length;
	      }
	      if (length >= strLength) {
	        return string;
	      }
	      var end = length - stringSize(omission);
	      if (end < 1) {
	        return omission;
	      }
	      var result = strSymbols
	        ? castSlice(strSymbols, 0, end).join('')
	        : string.slice(0, end);

	      if (separator === undefined) {
	        return result + omission;
	      }
	      if (strSymbols) {
	        end += (result.length - end);
	      }
	      if (isRegExp(separator)) {
	        if (string.slice(end).search(separator)) {
	          var match,
	              substring = result;

	          if (!separator.global) {
	            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');
	          }
	          separator.lastIndex = 0;
	          while ((match = separator.exec(substring))) {
	            var newEnd = match.index;
	          }
	          result = result.slice(0, newEnd === undefined ? end : newEnd);
	        }
	      } else if (string.indexOf(baseToString(separator), end) != end) {
	        var index = result.lastIndexOf(separator);
	        if (index > -1) {
	          result = result.slice(0, index);
	        }
	      }
	      return result + omission;
	    }

	    /**
	     * The inverse of `_.escape`; this method converts the HTML entities
	     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, `&#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 _
	     * @since 0.6.0
	     * @category String
	     * @param {string} [string=''] The string to unescape.
	     * @returns {string} Returns the unescaped string.
	     * @example
	     *
	     * _.unescape('fred, barney, &amp; pebbles');
	     * // => 'fred, barney, & pebbles'
	     */
	    function unescape(string) {
	      string = toString(string);
	      return (string && reHasEscapedHtml.test(string))
	        ? string.replace(reEscapedHtml, unescapeHtmlChar)
	        : string;
	    }

	    /**
	     * Converts `string`, as space separated words, to upper case.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the upper cased string.
	     * @example
	     *
	     * _.upperCase('--foo-bar');
	     * // => 'FOO BAR'
	     *
	     * _.upperCase('fooBar');
	     * // => 'FOO BAR'
	     *
	     * _.upperCase('__foo_bar__');
	     * // => 'FOO BAR'
	     */
	    var upperCase = createCompounder(function(result, word, index) {
	      return result + (index ? ' ' : '') + word.toUpperCase();
	    });

	    /**
	     * Converts the first character of `string` to upper case.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category String
	     * @param {string} [string=''] The string to convert.
	     * @returns {string} Returns the converted string.
	     * @example
	     *
	     * _.upperFirst('fred');
	     * // => 'Fred'
	     *
	     * _.upperFirst('FRED');
	     * // => 'FRED'
	     */
	    var upperFirst = createCaseFirst('toUpperCase');

	    /**
	     * Splits `string` into an array of its words.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category String
	     * @param {string} [string=''] The string to inspect.
	     * @param {RegExp|string} [pattern] The pattern to match words.
	     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
	     * @returns {Array} Returns the words of `string`.
	     * @example
	     *
	     * _.words('fred, barney, & pebbles');
	     * // => ['fred', 'barney', 'pebbles']
	     *
	     * _.words('fred, barney, & pebbles', /[^, ]+/g);
	     * // => ['fred', 'barney', '&', 'pebbles']
	     */
	    function words(string, pattern, guard) {
	      string = toString(string);
	      pattern = guard ? undefined : pattern;

	      if (pattern === undefined) {
	        pattern = reHasComplexWord.test(string) ? reComplexWord : reBasicWord;
	      }
	      return string.match(pattern) || [];
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Attempts to invoke `func`, returning either the result or the caught error
	     * object. Any additional arguments are provided to `func` when it's invoked.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Util
	     * @param {Function} func The function to attempt.
	     * @param {...*} [args] The arguments to invoke `func` with.
	     * @returns {*} Returns the `func` result or error object.
	     * @example
	     *
	     * // Avoid throwing errors for invalid selectors.
	     * var elements = _.attempt(function(selector) {
	     *   return document.querySelectorAll(selector);
	     * }, '>_>');
	     *
	     * if (_.isError(elements)) {
	     *   elements = [];
	     * }
	     */
	    var attempt = rest(function(func, args) {
	      try {
	        return apply(func, undefined, args);
	      } catch (e) {
	        return isError(e) ? e : new Error(e);
	      }
	    });

	    /**
	     * Binds methods of an object to the object itself, overwriting the existing
	     * method.
	     *
	     * **Note:** This method doesn't set the "length" property of bound functions.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @param {Object} object The object to bind and assign the bound methods to.
	     * @param {...(string|string[])} methodNames The object method names to bind.
	     * @returns {Object} Returns `object`.
	     * @example
	     *
	     * var view = {
	     *   'label': 'docs',
	     *   'onClick': function() {
	     *     console.log('clicked ' + this.label);
	     *   }
	     * };
	     *
	     * _.bindAll(view, 'onClick');
	     * jQuery(element).on('click', view.onClick);
	     * // => Logs 'clicked docs' when clicked.
	     */
	    var bindAll = rest(function(object, methodNames) {
	      arrayEach(baseFlatten(methodNames, 1), function(key) {
	        key = toKey(key);
	        object[key] = bind(object[key], object);
	      });
	      return object;
	    });

	    /**
	     * Creates a function that iterates over `pairs` and invokes the corresponding
	     * function of the first predicate to return truthy. The predicate-function
	     * pairs are invoked with the `this` binding and arguments of the created
	     * function.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {Array} pairs The predicate-function pairs.
	     * @returns {Function} Returns the new composite function.
	     * @example
	     *
	     * var func = _.cond([
	     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],
	     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],
	     *   [_.constant(true),                _.constant('no match')]
	     * ]);
	     *
	     * func({ 'a': 1, 'b': 2 });
	     * // => 'matches A'
	     *
	     * func({ 'a': 0, 'b': 1 });
	     * // => 'matches B'
	     *
	     * func({ 'a': '1', 'b': '2' });
	     * // => 'no match'
	     */
	    function cond(pairs) {
	      var length = pairs ? pairs.length : 0,
	          toIteratee = getIteratee();

	      pairs = !length ? [] : arrayMap(pairs, function(pair) {
	        if (typeof pair[1] != 'function') {
	          throw new TypeError(FUNC_ERROR_TEXT);
	        }
	        return [toIteratee(pair[0]), pair[1]];
	      });

	      return rest(function(args) {
	        var index = -1;
	        while (++index < length) {
	          var pair = pairs[index];
	          if (apply(pair[0], this, args)) {
	            return apply(pair[1], this, args);
	          }
	        }
	      });
	    }

	    /**
	     * Creates a function that invokes the predicate properties of `source` with
	     * the corresponding property values of a given object, returning `true` if
	     * all predicates return truthy, else `false`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {Object} source The object of property predicates to conform to.
	     * @returns {Function} Returns the new spec function.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney', 'age': 36 },
	     *   { 'user': 'fred',   'age': 40 }
	     * ];
	     *
	     * _.filter(users, _.conforms({ 'age': _.partial(_.gt, _, 38) }));
	     * // => [{ 'user': 'fred', 'age': 40 }]
	     */
	    function conforms(source) {
	      return baseConforms(baseClone(source, true));
	    }

	    /**
	     * Creates a function that returns `value`.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.4.0
	     * @category Util
	     * @param {*} value The value to return from the new function.
	     * @returns {Function} Returns the new constant function.
	     * @example
	     *
	     * var object = { 'user': 'fred' };
	     * var getter = _.constant(object);
	     *
	     * getter() === object;
	     * // => true
	     */
	    function constant(value) {
	      return function() {
	        return value;
	      };
	    }

	    /**
	     * Creates a function that returns the result of invoking the given functions
	     * with the `this` binding of the created function, where each successive
	     * invocation is supplied the return value of the previous.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Util
	     * @param {...(Function|Function[])} [funcs] Functions to invoke.
	     * @returns {Function} Returns the new composite function.
	     * @see _.flowRight
	     * @example
	     *
	     * function square(n) {
	     *   return n * n;
	     * }
	     *
	     * var addSquare = _.flow(_.add, square);
	     * addSquare(1, 2);
	     * // => 9
	     */
	    var flow = createFlow();

	    /**
	     * This method is like `_.flow` except that it creates a function that
	     * invokes the given functions from right to left.
	     *
	     * @static
	     * @since 3.0.0
	     * @memberOf _
	     * @category Util
	     * @param {...(Function|Function[])} [funcs] Functions to invoke.
	     * @returns {Function} Returns the new composite function.
	     * @see _.flow
	     * @example
	     *
	     * function square(n) {
	     *   return n * n;
	     * }
	     *
	     * var addSquare = _.flowRight(square, _.add);
	     * addSquare(1, 2);
	     * // => 9
	     */
	    var flowRight = createFlow(true);

	    /**
	     * This method returns the first argument given to it.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @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 invokes `func` with the arguments of the created
	     * function. If `func` is a property name, the created function returns the
	     * property value for a given element. If `func` is an array or object, the
	     * created function returns `true` for elements that contain the equivalent
	     * source properties, otherwise it returns `false`.
	     *
	     * @static
	     * @since 4.0.0
	     * @memberOf _
	     * @category Util
	     * @param {*} [func=_.identity] The value to convert to a callback.
	     * @returns {Function} Returns the callback.
	     * @example
	     *
	     * var users = [
	     *   { 'user': 'barney', 'age': 36, 'active': true },
	     *   { 'user': 'fred',   'age': 40, 'active': false }
	     * ];
	     *
	     * // The `_.matches` iteratee shorthand.
	     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));
	     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]
	     *
	     * // The `_.matchesProperty` iteratee shorthand.
	     * _.filter(users, _.iteratee(['user', 'fred']));
	     * // => [{ 'user': 'fred', 'age': 40 }]
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.map(users, _.iteratee('user'));
	     * // => ['barney', 'fred']
	     *
	     * // Create custom iteratee shorthands.
	     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {
	     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {
	     *     return func.test(string);
	     *   };
	     * });
	     *
	     * _.filter(['abc', 'def'], /ef/);
	     * // => ['def']
	     */
	    function iteratee(func) {
	      return baseIteratee(typeof func == 'function' ? func : baseClone(func, true));
	    }

	    /**
	     * Creates a function that performs a partial deep comparison between a given
	     * object and `source`, returning `true` if the given object has equivalent
	     * property values, else `false`. The created function is equivalent to
	     * `_.isMatch` with a `source` partially applied.
	     *
	     * **Note:** This method supports comparing the same values as `_.isEqual`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Util
	     * @param {Object} source The object of property values to match.
	     * @returns {Function} Returns the new spec function.
	     * @example
	     *
	     * var 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 performs a partial deep comparison between the
	     * value at `path` of a given object to `srcValue`, returning `true` if the
	     * object value is equivalent, else `false`.
	     *
	     * **Note:** This method supports comparing the same values as `_.isEqual`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.2.0
	     * @category Util
	     * @param {Array|string} path The path of the property to get.
	     * @param {*} srcValue The value to match.
	     * @returns {Function} Returns the new spec function.
	     * @example
	     *
	     * var 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` of a given object.
	     * Any additional arguments are provided to the invoked method.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.7.0
	     * @category Util
	     * @param {Array|string} path The path of the method to invoke.
	     * @param {...*} [args] The arguments to invoke the method with.
	     * @returns {Function} Returns the new invoker function.
	     * @example
	     *
	     * var objects = [
	     *   { 'a': { 'b': _.constant(2) } },
	     *   { 'a': { 'b': _.constant(1) } }
	     * ];
	     *
	     * _.map(objects, _.method('a.b'));
	     * // => [2, 1]
	     *
	     * _.map(objects, _.method(['a', 'b']));
	     * // => [2, 1]
	     */
	    var method = rest(function(path, args) {
	      return function(object) {
	        return baseInvoke(object, path, args);
	      };
	    });

	    /**
	     * The opposite of `_.method`; this method creates a function that invokes
	     * the method at a given path of `object`. Any additional arguments are
	     * provided to the invoked method.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.7.0
	     * @category Util
	     * @param {Object} object The object to query.
	     * @param {...*} [args] The arguments to invoke the method with.
	     * @returns {Function} Returns the new invoker function.
	     * @example
	     *
	     * var array = _.times(3, _.constant),
	     *     object = { 'a': array, 'b': array, 'c': array };
	     *
	     * _.map(['a[2]', 'c[0]'], _.methodOf(object));
	     * // => [2, 0]
	     *
	     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));
	     * // => [2, 0]
	     */
	    var methodOf = rest(function(object, args) {
	      return function(path) {
	        return baseInvoke(object, path, args);
	      };
	    });

	    /**
	     * Adds all own enumerable string keyed function properties of a source
	     * object to the destination object. If `object` is a function, then methods
	     * are added to its prototype as well.
	     *
	     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to
	     * avoid conflicts caused by modifying the original.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @param {Function|Object} [object=lodash] The destination object.
	     * @param {Object} source The object of functions to add.
	     * @param {Object} [options={}] The options object.
	     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.
	     * @returns {Function|Object} Returns `object`.
	     * @example
	     *
	     * function vowels(string) {
	     *   return _.filter(string, function(v) {
	     *     return /[aeiou]/i.test(v);
	     *   });
	     * }
	     *
	     * _.mixin({ 'vowels': vowels });
	     * _.vowels('fred');
	     * // => ['e']
	     *
	     * _('fred').vowels().value();
	     * // => ['e']
	     *
	     * _.mixin({ 'vowels': vowels }, { 'chain': false });
	     * _('fred').vowels();
	     * // => ['e']
	     */
	    function mixin(object, source, options) {
	      var props = keys(source),
	          methodNames = baseFunctions(source, props);

	      if (options == null &&
	          !(isObject(source) && (methodNames.length || !props.length))) {
	        options = source;
	        source = object;
	        object = this;
	        methodNames = baseFunctions(source, keys(source));
	      }
	      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,
	          isFunc = isFunction(object);

	      arrayEach(methodNames, function(methodName) {
	        var func = source[methodName];
	        object[methodName] = func;
	        if (isFunc) {
	          object.prototype[methodName] = function() {
	            var chainAll = this.__chain__;
	            if (chain || chainAll) {
	              var result = object(this.__wrapped__),
	                  actions = result.__actions__ = copyArray(this.__actions__);

	              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
	              result.__chain__ = chainAll;
	              return result;
	            }
	            return func.apply(object, arrayPush([this.value()], arguments));
	          };
	        }
	      });

	      return object;
	    }

	    /**
	     * Reverts the `_` variable to its previous value and returns a reference to
	     * the `lodash` function.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @returns {Function} Returns the `lodash` function.
	     * @example
	     *
	     * var lodash = _.noConflict();
	     */
	    function noConflict() {
	      if (root._ === this) {
	        root._ = oldDash;
	      }
	      return this;
	    }

	    /**
	     * A no-operation function that returns `undefined` regardless of the
	     * arguments it receives.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.3.0
	     * @category Util
	     * @example
	     *
	     * var object = { 'user': 'fred' };
	     *
	     * _.noop(object) === undefined;
	     * // => true
	     */
	    function noop() {
	      // No operation performed.
	    }

	    /**
	     * Creates a function that gets the argument at `n` index. If `n` is negative,
	     * the nth argument from the end is returned.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {number} [n=0] The index of the argument to return.
	     * @returns {Function} Returns the new pass-thru function.
	     * @example
	     *
	     * var func = _.nthArg(1);
	     * func('a', 'b', 'c', 'd');
	     * // => 'b'
	     *
	     * var func = _.nthArg(-2);
	     * func('a', 'b', 'c', 'd');
	     * // => 'c'
	     */
	    function nthArg(n) {
	      n = toInteger(n);
	      return rest(function(args) {
	        return baseNth(args, n);
	      });
	    }

	    /**
	     * Creates a function that invokes `iteratees` with the arguments it receives
	     * and returns their results.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])}
	     *  [iteratees=[_.identity]] The iteratees to invoke.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var func = _.over(Math.max, Math.min);
	     *
	     * func(1, 2, 3, 4);
	     * // => [4, 1]
	     */
	    var over = createOver(arrayMap);

	    /**
	     * Creates a function that checks if **all** of the `predicates` return
	     * truthy when invoked with the arguments it receives.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])}
	     *  [predicates=[_.identity]] The predicates to check.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var func = _.overEvery(Boolean, isFinite);
	     *
	     * func('1');
	     * // => true
	     *
	     * func(null);
	     * // => false
	     *
	     * func(NaN);
	     * // => false
	     */
	    var overEvery = createOver(arrayEvery);

	    /**
	     * Creates a function that checks if **any** of the `predicates` return
	     * truthy when invoked with the arguments it receives.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])}
	     *  [predicates=[_.identity]] The predicates to check.
	     * @returns {Function} Returns the new function.
	     * @example
	     *
	     * var func = _.overSome(Boolean, isFinite);
	     *
	     * func('1');
	     * // => true
	     *
	     * func(null);
	     * // => true
	     *
	     * func(NaN);
	     * // => false
	     */
	    var overSome = createOver(arraySome);

	    /**
	     * Creates a function that returns the value at `path` of a given object.
	     *
	     * @static
	     * @memberOf _
	     * @since 2.4.0
	     * @category Util
	     * @param {Array|string} path The path of the property to get.
	     * @returns {Function} Returns the new accessor function.
	     * @example
	     *
	     * var objects = [
	     *   { 'a': { 'b': 2 } },
	     *   { 'a': { 'b': 1 } }
	     * ];
	     *
	     * _.map(objects, _.property('a.b'));
	     * // => [2, 1]
	     *
	     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
	     * // => [1, 2]
	     */
	    function property(path) {
	      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
	    }

	    /**
	     * The opposite of `_.property`; this method creates a function that returns
	     * the value at a given path of `object`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.0.0
	     * @category Util
	     * @param {Object} object The object to query.
	     * @returns {Function} Returns the new accessor function.
	     * @example
	     *
	     * var array = [0, 1, 2],
	     *     object = { 'a': array, 'b': array, 'c': array };
	     *
	     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));
	     * // => [2, 0]
	     *
	     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));
	     * // => [2, 0]
	     */
	    function propertyOf(object) {
	      return function(path) {
	        return object == null ? undefined : baseGet(object, path);
	      };
	    }

	    /**
	     * Creates an array of numbers (positive and/or negative) progressing from
	     * `start` up to, but not including, `end`. A step of `-1` is used if a negative
	     * `start` is specified without an `end` or `step`. If `end` is not specified,
	     * it's set to `start` with `start` then set to `0`.
	     *
	     * **Note:** JavaScript follows the IEEE-754 standard for resolving
	     * floating-point values which can produce unexpected results.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @param {number} [start=0] The start of the range.
	     * @param {number} end The end of the range.
	     * @param {number} [step=1] The value to increment or decrement by.
	     * @returns {Array} Returns the range of numbers.
	     * @see _.inRange, _.rangeRight
	     * @example
	     *
	     * _.range(4);
	     * // => [0, 1, 2, 3]
	     *
	     * _.range(-4);
	     * // => [0, -1, -2, -3]
	     *
	     * _.range(1, 5);
	     * // => [1, 2, 3, 4]
	     *
	     * _.range(0, 20, 5);
	     * // => [0, 5, 10, 15]
	     *
	     * _.range(0, -4, -1);
	     * // => [0, -1, -2, -3]
	     *
	     * _.range(1, 4, 0);
	     * // => [1, 1, 1]
	     *
	     * _.range(0);
	     * // => []
	     */
	    var range = createRange();

	    /**
	     * This method is like `_.range` except that it populates values in
	     * descending order.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {number} [start=0] The start of the range.
	     * @param {number} end The end of the range.
	     * @param {number} [step=1] The value to increment or decrement by.
	     * @returns {Array} Returns the range of numbers.
	     * @see _.inRange, _.range
	     * @example
	     *
	     * _.rangeRight(4);
	     * // => [3, 2, 1, 0]
	     *
	     * _.rangeRight(-4);
	     * // => [-3, -2, -1, 0]
	     *
	     * _.rangeRight(1, 5);
	     * // => [4, 3, 2, 1]
	     *
	     * _.rangeRight(0, 20, 5);
	     * // => [15, 10, 5, 0]
	     *
	     * _.rangeRight(0, -4, -1);
	     * // => [-3, -2, -1, 0]
	     *
	     * _.rangeRight(1, 4, 0);
	     * // => [1, 1, 1]
	     *
	     * _.rangeRight(0);
	     * // => []
	     */
	    var rangeRight = createRange(true);

	    /**
	     * Invokes the iteratee `n` times, returning an array of the results of
	     * each invocation. The iteratee is invoked with one argument; (index).
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @param {number} n The number of times to invoke `iteratee`.
	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
	     * @returns {Array} Returns the array of results.
	     * @example
	     *
	     * _.times(3, String);
	     * // => ['0', '1', '2']
	     *
	     *  _.times(4, _.constant(true));
	     * // => [true, true, true, true]
	     */
	    function times(n, iteratee) {
	      n = toInteger(n);
	      if (n < 1 || n > MAX_SAFE_INTEGER) {
	        return [];
	      }
	      var index = MAX_ARRAY_LENGTH,
	          length = nativeMin(n, MAX_ARRAY_LENGTH);

	      iteratee = getIteratee(iteratee);
	      n -= MAX_ARRAY_LENGTH;

	      var result = baseTimes(length, iteratee);
	      while (++index < n) {
	        iteratee(index);
	      }
	      return result;
	    }

	    /**
	     * Converts `value` to a property path array.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Util
	     * @param {*} value The value to convert.
	     * @returns {Array} Returns the new property path array.
	     * @example
	     *
	     * _.toPath('a.b.c');
	     * // => ['a', 'b', 'c']
	     *
	     * _.toPath('a[0].b.c');
	     * // => ['a', '0', 'b', 'c']
	     *
	     * var path = ['a', 'b', 'c'],
	     *     newPath = _.toPath(path);
	     *
	     * console.log(newPath);
	     * // => ['a', 'b', 'c']
	     *
	     * console.log(path === newPath);
	     * // => false
	     */
	    function toPath(value) {
	      if (isArray(value)) {
	        return arrayMap(value, toKey);
	      }
	      return isSymbol(value) ? [value] : copyArray(stringToPath(value));
	    }

	    /**
	     * Generates a unique ID. If `prefix` is given, the ID is appended to it.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Util
	     * @param {string} [prefix=''] The value to prefix the ID with.
	     * @returns {string} Returns the unique ID.
	     * @example
	     *
	     * _.uniqueId('contact_');
	     * // => 'contact_104'
	     *
	     * _.uniqueId();
	     * // => '105'
	     */
	    function uniqueId(prefix) {
	      var id = ++idCounter;
	      return toString(prefix) + id;
	    }

	    /*------------------------------------------------------------------------*/

	    /**
	     * Adds two numbers.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.4.0
	     * @category Math
	     * @param {number} augend The first number in an addition.
	     * @param {number} addend The second number in an addition.
	     * @returns {number} Returns the total.
	     * @example
	     *
	     * _.add(6, 4);
	     * // => 10
	     */
	    var add = createMathOperation(function(augend, addend) {
	      return augend + addend;
	    });

	    /**
	     * Computes `number` rounded up to `precision`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.10.0
	     * @category Math
	     * @param {number} number The number to round up.
	     * @param {number} [precision=0] The precision to round up to.
	     * @returns {number} Returns the rounded up number.
	     * @example
	     *
	     * _.ceil(4.006);
	     * // => 5
	     *
	     * _.ceil(6.004, 2);
	     * // => 6.01
	     *
	     * _.ceil(6040, -2);
	     * // => 6100
	     */
	    var ceil = createRound('ceil');

	    /**
	     * Divide two numbers.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.7.0
	     * @category Math
	     * @param {number} dividend The first number in a division.
	     * @param {number} divisor The second number in a division.
	     * @returns {number} Returns the quotient.
	     * @example
	     *
	     * _.divide(6, 4);
	     * // => 1.5
	     */
	    var divide = createMathOperation(function(dividend, divisor) {
	      return dividend / divisor;
	    });

	    /**
	     * Computes `number` rounded down to `precision`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.10.0
	     * @category Math
	     * @param {number} number The number to round down.
	     * @param {number} [precision=0] The precision to round down to.
	     * @returns {number} Returns the rounded down number.
	     * @example
	     *
	     * _.floor(4.006);
	     * // => 4
	     *
	     * _.floor(0.046, 2);
	     * // => 0.04
	     *
	     * _.floor(4060, -2);
	     * // => 4000
	     */
	    var floor = createRound('floor');

	    /**
	     * Computes the maximum value of `array`. If `array` is empty or falsey,
	     * `undefined` is returned.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @returns {*} Returns the maximum value.
	     * @example
	     *
	     * _.max([4, 2, 8, 6]);
	     * // => 8
	     *
	     * _.max([]);
	     * // => undefined
	     */
	    function max(array) {
	      return (array && array.length)
	        ? baseExtremum(array, identity, baseGt)
	        : undefined;
	    }

	    /**
	     * This method is like `_.max` except that it accepts `iteratee` which is
	     * invoked for each element in `array` to generate the criterion by which
	     * the value is ranked. The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {*} Returns the maximum value.
	     * @example
	     *
	     * var objects = [{ 'n': 1 }, { 'n': 2 }];
	     *
	     * _.maxBy(objects, function(o) { return o.n; });
	     * // => { 'n': 2 }
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.maxBy(objects, 'n');
	     * // => { 'n': 2 }
	     */
	    function maxBy(array, iteratee) {
	      return (array && array.length)
	        ? baseExtremum(array, getIteratee(iteratee), baseGt)
	        : undefined;
	    }

	    /**
	     * Computes the mean of the values in `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @returns {number} Returns the mean.
	     * @example
	     *
	     * _.mean([4, 2, 8, 6]);
	     * // => 5
	     */
	    function mean(array) {
	      return baseMean(array, identity);
	    }

	    /**
	     * This method is like `_.mean` except that it accepts `iteratee` which is
	     * invoked for each element in `array` to generate the value to be averaged.
	     * The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.7.0
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {number} Returns the mean.
	     * @example
	     *
	     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
	     *
	     * _.meanBy(objects, function(o) { return o.n; });
	     * // => 5
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.meanBy(objects, 'n');
	     * // => 5
	     */
	    function meanBy(array, iteratee) {
	      return baseMean(array, getIteratee(iteratee));
	    }

	    /**
	     * Computes the minimum value of `array`. If `array` is empty or falsey,
	     * `undefined` is returned.
	     *
	     * @static
	     * @since 0.1.0
	     * @memberOf _
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @returns {*} Returns the minimum value.
	     * @example
	     *
	     * _.min([4, 2, 8, 6]);
	     * // => 2
	     *
	     * _.min([]);
	     * // => undefined
	     */
	    function min(array) {
	      return (array && array.length)
	        ? baseExtremum(array, identity, baseLt)
	        : undefined;
	    }

	    /**
	     * This method is like `_.min` except that it accepts `iteratee` which is
	     * invoked for each element in `array` to generate the criterion by which
	     * the value is ranked. The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {*} Returns the minimum value.
	     * @example
	     *
	     * var objects = [{ 'n': 1 }, { 'n': 2 }];
	     *
	     * _.minBy(objects, function(o) { return o.n; });
	     * // => { 'n': 1 }
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.minBy(objects, 'n');
	     * // => { 'n': 1 }
	     */
	    function minBy(array, iteratee) {
	      return (array && array.length)
	        ? baseExtremum(array, getIteratee(iteratee), baseLt)
	        : undefined;
	    }

	    /**
	     * Multiply two numbers.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.7.0
	     * @category Math
	     * @param {number} multiplier The first number in a multiplication.
	     * @param {number} multiplicand The second number in a multiplication.
	     * @returns {number} Returns the product.
	     * @example
	     *
	     * _.multiply(6, 4);
	     * // => 24
	     */
	    var multiply = createMathOperation(function(multiplier, multiplicand) {
	      return multiplier * multiplicand;
	    });

	    /**
	     * Computes `number` rounded to `precision`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.10.0
	     * @category Math
	     * @param {number} number The number to round.
	     * @param {number} [precision=0] The precision to round to.
	     * @returns {number} Returns the rounded number.
	     * @example
	     *
	     * _.round(4.006);
	     * // => 4
	     *
	     * _.round(4.006, 2);
	     * // => 4.01
	     *
	     * _.round(4060, -2);
	     * // => 4100
	     */
	    var round = createRound('round');

	    /**
	     * Subtract two numbers.
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Math
	     * @param {number} minuend The first number in a subtraction.
	     * @param {number} subtrahend The second number in a subtraction.
	     * @returns {number} Returns the difference.
	     * @example
	     *
	     * _.subtract(6, 4);
	     * // => 2
	     */
	    var subtract = createMathOperation(function(minuend, subtrahend) {
	      return minuend - subtrahend;
	    });

	    /**
	     * Computes the sum of the values in `array`.
	     *
	     * @static
	     * @memberOf _
	     * @since 3.4.0
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @returns {number} Returns the sum.
	     * @example
	     *
	     * _.sum([4, 2, 8, 6]);
	     * // => 20
	     */
	    function sum(array) {
	      return (array && array.length)
	        ? baseSum(array, identity)
	        : 0;
	    }

	    /**
	     * This method is like `_.sum` except that it accepts `iteratee` which is
	     * invoked for each element in `array` to generate the value to be summed.
	     * The iteratee is invoked with one argument: (value).
	     *
	     * @static
	     * @memberOf _
	     * @since 4.0.0
	     * @category Math
	     * @param {Array} array The array to iterate over.
	     * @param {Array|Function|Object|string} [iteratee=_.identity]
	     *  The iteratee invoked per element.
	     * @returns {number} Returns the sum.
	     * @example
	     *
	     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
	     *
	     * _.sumBy(objects, function(o) { return o.n; });
	     * // => 20
	     *
	     * // The `_.property` iteratee shorthand.
	     * _.sumBy(objects, 'n');
	     * // => 20
	     */
	    function sumBy(array, iteratee) {
	      return (array && array.length)
	        ? baseSum(array, getIteratee(iteratee))
	        : 0;
	    }

	    /*------------------------------------------------------------------------*/

	    // Add methods that return wrapped values in chain sequences.
	    lodash.after = after;
	    lodash.ary = ary;
	    lodash.assign = assign;
	    lodash.assignIn = assignIn;
	    lodash.assignInWith = assignInWith;
	    lodash.assignWith = assignWith;
	    lodash.at = at;
	    lodash.before = before;
	    lodash.bind = bind;
	    lodash.bindAll = bindAll;
	    lodash.bindKey = bindKey;
	    lodash.castArray = castArray;
	    lodash.chain = chain;
	    lodash.chunk = chunk;
	    lodash.compact = compact;
	    lodash.concat = concat;
	    lodash.cond = cond;
	    lodash.conforms = conforms;
	    lodash.constant = constant;
	    lodash.countBy = countBy;
	    lodash.create = create;
	    lodash.curry = curry;
	    lodash.curryRight = curryRight;
	    lodash.debounce = debounce;
	    lodash.defaults = defaults;
	    lodash.defaultsDeep = defaultsDeep;
	    lodash.defer = defer;
	    lodash.delay = delay;
	    lodash.difference = difference;
	    lodash.differenceBy = differenceBy;
	    lodash.differenceWith = differenceWith;
	    lodash.drop = drop;
	    lodash.dropRight = dropRight;
	    lodash.dropRightWhile = dropRightWhile;
	    lodash.dropWhile = dropWhile;
	    lodash.fill = fill;
	    lodash.filter = filter;
	    lodash.flatMap = flatMap;
	    lodash.flatMapDeep = flatMapDeep;
	    lodash.flatMapDepth = flatMapDepth;
	    lodash.flatten = flatten;
	    lodash.flattenDeep = flattenDeep;
	    lodash.flattenDepth = flattenDepth;
	    lodash.flip = flip;
	    lodash.flow = flow;
	    lodash.flowRight = flowRight;
	    lodash.fromPairs = fromPairs;
	    lodash.functions = functions;
	    lodash.functionsIn = functionsIn;
	    lodash.groupBy = groupBy;
	    lodash.initial = initial;
	    lodash.intersection = intersection;
	    lodash.intersectionBy = intersectionBy;
	    lodash.intersectionWith = intersectionWith;
	    lodash.invert = invert;
	    lodash.invertBy = invertBy;
	    lodash.invokeMap = invokeMap;
	    lodash.iteratee = iteratee;
	    lodash.keyBy = keyBy;
	    lodash.keys = keys;
	    lodash.keysIn = keysIn;
	    lodash.map = map;
	    lodash.mapKeys = mapKeys;
	    lodash.mapValues = mapValues;
	    lodash.matches = matches;
	    lodash.matchesProperty = matchesProperty;
	    lodash.memoize = memoize;
	    lodash.merge = merge;
	    lodash.mergeWith = mergeWith;
	    lodash.method = method;
	    lodash.methodOf = methodOf;
	    lodash.mixin = mixin;
	    lodash.negate = negate;
	    lodash.nthArg = nthArg;
	    lodash.omit = omit;
	    lodash.omitBy = omitBy;
	    lodash.once = once;
	    lodash.orderBy = orderBy;
	    lodash.over = over;
	    lodash.overArgs = overArgs;
	    lodash.overEvery = overEvery;
	    lodash.overSome = overSome;
	    lodash.partial = partial;
	    lodash.partialRight = partialRight;
	    lodash.partition = partition;
	    lodash.pick = pick;
	    lodash.pickBy = pickBy;
	    lodash.property = property;
	    lodash.propertyOf = propertyOf;
	    lodash.pull = pull;
	    lodash.pullAll = pullAll;
	    lodash.pullAllBy = pullAllBy;
	    lodash.pullAllWith = pullAllWith;
	    lodash.pullAt = pullAt;
	    lodash.range = range;
	    lodash.rangeRight = rangeRight;
	    lodash.rearg = rearg;
	    lodash.reject = reject;
	    lodash.remove = remove;
	    lodash.rest = rest;
	    lodash.reverse = reverse;
	    lodash.sampleSize = sampleSize;
	    lodash.set = set;
	    lodash.setWith = setWith;
	    lodash.shuffle = shuffle;
	    lodash.slice = slice;
	    lodash.sortBy = sortBy;
	    lodash.sortedUniq = sortedUniq;
	    lodash.sortedUniqBy = sortedUniqBy;
	    lodash.split = split;
	    lodash.spread = spread;
	    lodash.tail = tail;
	    lodash.take = take;
	    lodash.takeRight = takeRight;
	    lodash.takeRightWhile = takeRightWhile;
	    lodash.takeWhile = takeWhile;
	    lodash.tap = tap;
	    lodash.throttle = throttle;
	    lodash.thru = thru;
	    lodash.toArray = toArray;
	    lodash.toPairs = toPairs;
	    lodash.toPairsIn = toPairsIn;
	    lodash.toPath = toPath;
	    lodash.toPlainObject = toPlainObject;
	    lodash.transform = transform;
	    lodash.unary = unary;
	    lodash.union = union;
	    lodash.unionBy = unionBy;
	    lodash.unionWith = unionWith;
	    lodash.uniq = uniq;
	    lodash.uniqBy = uniqBy;
	    lodash.uniqWith = uniqWith;
	    lodash.unset = unset;
	    lodash.unzip = unzip;
	    lodash.unzipWith = unzipWith;
	    lodash.update = update;
	    lodash.updateWith = updateWith;
	    lodash.values = values;
	    lodash.valuesIn = valuesIn;
	    lodash.without = without;
	    lodash.words = words;
	    lodash.wrap = wrap;
	    lodash.xor = xor;
	    lodash.xorBy = xorBy;
	    lodash.xorWith = xorWith;
	    lodash.zip = zip;
	    lodash.zipObject = zipObject;
	    lodash.zipObjectDeep = zipObjectDeep;
	    lodash.zipWith = zipWith;

	    // Add aliases.
	    lodash.entries = toPairs;
	    lodash.entriesIn = toPairsIn;
	    lodash.extend = assignIn;
	    lodash.extendWith = assignInWith;

	    // Add methods to `lodash.prototype`.
	    mixin(lodash, lodash);

	    /*------------------------------------------------------------------------*/

	    // Add methods that return unwrapped values in chain sequences.
	    lodash.add = add;
	    lodash.attempt = attempt;
	    lodash.camelCase = camelCase;
	    lodash.capitalize = capitalize;
	    lodash.ceil = ceil;
	    lodash.clamp = clamp;
	    lodash.clone = clone;
	    lodash.cloneDeep = cloneDeep;
	    lodash.cloneDeepWith = cloneDeepWith;
	    lodash.cloneWith = cloneWith;
	    lodash.deburr = deburr;
	    lodash.divide = divide;
	    lodash.endsWith = endsWith;
	    lodash.eq = eq;
	    lodash.escape = escape;
	    lodash.escapeRegExp = escapeRegExp;
	    lodash.every = every;
	    lodash.find = find;
	    lodash.findIndex = findIndex;
	    lodash.findKey = findKey;
	    lodash.findLast = findLast;
	    lodash.findLastIndex = findLastIndex;
	    lodash.findLastKey = findLastKey;
	    lodash.floor = floor;
	    lodash.forEach = forEach;
	    lodash.forEachRight = forEachRight;
	    lodash.forIn = forIn;
	    lodash.forInRight = forInRight;
	    lodash.forOwn = forOwn;
	    lodash.forOwnRight = forOwnRight;
	    lodash.get = get;
	    lodash.gt = gt;
	    lodash.gte = gte;
	    lodash.has = has;
	    lodash.hasIn = hasIn;
	    lodash.head = head;
	    lodash.identity = identity;
	    lodash.includes = includes;
	    lodash.indexOf = indexOf;
	    lodash.inRange = inRange;
	    lodash.invoke = invoke;
	    lodash.isArguments = isArguments;
	    lodash.isArray = isArray;
	    lodash.isArrayBuffer = isArrayBuffer;
	    lodash.isArrayLike = isArrayLike;
	    lodash.isArrayLikeObject = isArrayLikeObject;
	    lodash.isBoolean = isBoolean;
	    lodash.isBuffer = isBuffer;
	    lodash.isDate = isDate;
	    lodash.isElement = isElement;
	    lodash.isEmpty = isEmpty;
	    lodash.isEqual = isEqual;
	    lodash.isEqualWith = isEqualWith;
	    lodash.isError = isError;
	    lodash.isFinite = isFinite;
	    lodash.isFunction = isFunction;
	    lodash.isInteger = isInteger;
	    lodash.isLength = isLength;
	    lodash.isMap = isMap;
	    lodash.isMatch = isMatch;
	    lodash.isMatchWith = isMatchWith;
	    lodash.isNaN = isNaN;
	    lodash.isNative = isNative;
	    lodash.isNil = isNil;
	    lodash.isNull = isNull;
	    lodash.isNumber = isNumber;
	    lodash.isObject = isObject;
	    lodash.isObjectLike = isObjectLike;
	    lodash.isPlainObject = isPlainObject;
	    lodash.isRegExp = isRegExp;
	    lodash.isSafeInteger = isSafeInteger;
	    lodash.isSet = isSet;
	    lodash.isString = isString;
	    lodash.isSymbol = isSymbol;
	    lodash.isTypedArray = isTypedArray;
	    lodash.isUndefined = isUndefined;
	    lodash.isWeakMap = isWeakMap;
	    lodash.isWeakSet = isWeakSet;
	    lodash.join = join;
	    lodash.kebabCase = kebabCase;
	    lodash.last = last;
	    lodash.lastIndexOf = lastIndexOf;
	    lodash.lowerCase = lowerCase;
	    lodash.lowerFirst = lowerFirst;
	    lodash.lt = lt;
	    lodash.lte = lte;
	    lodash.max = max;
	    lodash.maxBy = maxBy;
	    lodash.mean = mean;
	    lodash.meanBy = meanBy;
	    lodash.min = min;
	    lodash.minBy = minBy;
	    lodash.multiply = multiply;
	    lodash.nth = nth;
	    lodash.noConflict = noConflict;
	    lodash.noop = noop;
	    lodash.now = now;
	    lodash.pad = pad;
	    lodash.padEnd = padEnd;
	    lodash.padStart = padStart;
	    lodash.parseInt = parseInt;
	    lodash.random = random;
	    lodash.reduce = reduce;
	    lodash.reduceRight = reduceRight;
	    lodash.repeat = repeat;
	    lodash.replace = replace;
	    lodash.result = result;
	    lodash.round = round;
	    lodash.runInContext = runInContext;
	    lodash.sample = sample;
	    lodash.size = size;
	    lodash.snakeCase = snakeCase;
	    lodash.some = some;
	    lodash.sortedIndex = sortedIndex;
	    lodash.sortedIndexBy = sortedIndexBy;
	    lodash.sortedIndexOf = sortedIndexOf;
	    lodash.sortedLastIndex = sortedLastIndex;
	    lodash.sortedLastIndexBy = sortedLastIndexBy;
	    lodash.sortedLastIndexOf = sortedLastIndexOf;
	    lodash.startCase = startCase;
	    lodash.startsWith = startsWith;
	    lodash.subtract = subtract;
	    lodash.sum = sum;
	    lodash.sumBy = sumBy;
	    lodash.template = template;
	    lodash.times = times;
	    lodash.toFinite = toFinite;
	    lodash.toInteger = toInteger;
	    lodash.toLength = toLength;
	    lodash.toLower = toLower;
	    lodash.toNumber = toNumber;
	    lodash.toSafeInteger = toSafeInteger;
	    lodash.toString = toString;
	    lodash.toUpper = toUpper;
	    lodash.trim = trim;
	    lodash.trimEnd = trimEnd;
	    lodash.trimStart = trimStart;
	    lodash.truncate = truncate;
	    lodash.unescape = unescape;
	    lodash.uniqueId = uniqueId;
	    lodash.upperCase = upperCase;
	    lodash.upperFirst = upperFirst;

	    // Add aliases.
	    lodash.each = forEach;
	    lodash.eachRight = forEachRight;
	    lodash.first = head;

	    mixin(lodash, (function() {
	      var source = {};
	      baseForOwn(lodash, function(func, methodName) {
	        if (!hasOwnProperty.call(lodash.prototype, methodName)) {
	          source[methodName] = func;
	        }
	      });
	      return source;
	    }()), { 'chain': false });

	    /*------------------------------------------------------------------------*/

	    /**
	     * The semantic version number.
	     *
	     * @static
	     * @memberOf _
	     * @type {string}
	     */
	    lodash.VERSION = VERSION;

	    // Assign default placeholders.
	    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {
	      lodash[methodName].placeholder = lodash;
	    });

	    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
	    arrayEach(['drop', 'take'], function(methodName, index) {
	      LazyWrapper.prototype[methodName] = function(n) {
	        var filtered = this.__filtered__;
	        if (filtered && !index) {
	          return new LazyWrapper(this);
	        }
	        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);

	        var result = this.clone();
	        if (filtered) {
	          result.__takeCount__ = nativeMin(n, result.__takeCount__);
	        } else {
	          result.__views__.push({
	            'size': nativeMin(n, MAX_ARRAY_LENGTH),
	            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')
	          });
	        }
	        return result;
	      };

	      LazyWrapper.prototype[methodName + 'Right'] = function(n) {
	        return this.reverse()[methodName](n).reverse();
	      };
	    });

	    // Add `LazyWrapper` methods that accept an `iteratee` value.
	    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {
	      var type = index + 1,
	          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;

	      LazyWrapper.prototype[methodName] = function(iteratee) {
	        var result = this.clone();
	        result.__iteratees__.push({
	          'iteratee': getIteratee(iteratee, 3),
	          'type': type
	        });
	        result.__filtered__ = result.__filtered__ || isFilter;
	        return result;
	      };
	    });

	    // Add `LazyWrapper` methods for `_.head` and `_.last`.
	    arrayEach(['head', 'last'], function(methodName, index) {
	      var takeName = 'take' + (index ? 'Right' : '');

	      LazyWrapper.prototype[methodName] = function() {
	        return this[takeName](1).value()[0];
	      };
	    });

	    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.
	    arrayEach(['initial', 'tail'], function(methodName, index) {
	      var dropName = 'drop' + (index ? '' : 'Right');

	      LazyWrapper.prototype[methodName] = function() {
	        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);
	      };
	    });

	    LazyWrapper.prototype.compact = function() {
	      return this.filter(identity);
	    };

	    LazyWrapper.prototype.find = function(predicate) {
	      return this.filter(predicate).head();
	    };

	    LazyWrapper.prototype.findLast = function(predicate) {
	      return this.reverse().find(predicate);
	    };

	    LazyWrapper.prototype.invokeMap = rest(function(path, args) {
	      if (typeof path == 'function') {
	        return new LazyWrapper(this);
	      }
	      return this.map(function(value) {
	        return baseInvoke(value, path, args);
	      });
	    });

	    LazyWrapper.prototype.reject = function(predicate) {
	      predicate = getIteratee(predicate, 3);
	      return this.filter(function(value) {
	        return !predicate(value);
	      });
	    };

	    LazyWrapper.prototype.slice = function(start, end) {
	      start = toInteger(start);

	      var result = this;
	      if (result.__filtered__ && (start > 0 || end < 0)) {
	        return new LazyWrapper(result);
	      }
	      if (start < 0) {
	        result = result.takeRight(-start);
	      } else if (start) {
	        result = result.drop(start);
	      }
	      if (end !== undefined) {
	        end = toInteger(end);
	        result = end < 0 ? result.dropRight(-end) : result.take(end - start);
	      }
	      return result;
	    };

	    LazyWrapper.prototype.takeRightWhile = function(predicate) {
	      return this.reverse().takeWhile(predicate).reverse();
	    };

	    LazyWrapper.prototype.toArray = function() {
	      return this.take(MAX_ARRAY_LENGTH);
	    };

	    // Add `LazyWrapper` methods to `lodash.prototype`.
	    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
	      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),
	          isTaker = /^(?:head|last)$/.test(methodName),
	          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],
	          retUnwrapped = isTaker || /^find/.test(methodName);

	      if (!lodashFunc) {
	        return;
	      }
	      lodash.prototype[methodName] = function() {
	        var value = this.__wrapped__,
	            args = isTaker ? [1] : arguments,
	            isLazy = value instanceof LazyWrapper,
	            iteratee = args[0],
	            useLazy = isLazy || isArray(value);

	        var interceptor = function(value) {
	          var result = lodashFunc.apply(lodash, arrayPush([value], args));
	          return (isTaker && chainAll) ? result[0] : result;
	        };

	        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {
	          // Avoid lazy use if the iteratee has a "length" value other than `1`.
	          isLazy = useLazy = false;
	        }
	        var chainAll = this.__chain__,
	            isHybrid = !!this.__actions__.length,
	            isUnwrapped = retUnwrapped && !chainAll,
	            onlyLazy = isLazy && !isHybrid;

	        if (!retUnwrapped && useLazy) {
	          value = onlyLazy ? value : new LazyWrapper(this);
	          var result = func.apply(value, args);
	          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });
	          return new LodashWrapper(result, chainAll);
	        }
	        if (isUnwrapped && onlyLazy) {
	          return func.apply(this, args);
	        }
	        result = this.thru(interceptor);
	        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;
	      };
	    });

	    // Add `Array` methods to `lodash.prototype`.
	    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {
	      var func = arrayProto[methodName],
	          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',
	          retUnwrapped = /^(?:pop|shift)$/.test(methodName);

	      lodash.prototype[methodName] = function() {
	        var args = arguments;
	        if (retUnwrapped && !this.__chain__) {
	          var value = this.value();
	          return func.apply(isArray(value) ? value : [], args);
	        }
	        return this[chainName](function(value) {
	          return func.apply(isArray(value) ? value : [], args);
	        });
	      };
	    });

	    // Map minified method names to their real names.
	    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
	      var lodashFunc = lodash[methodName];
	      if (lodashFunc) {
	        var key = (lodashFunc.name + ''),
	            names = realNames[key] || (realNames[key] = []);

	        names.push({ 'name': methodName, 'func': lodashFunc });
	      }
	    });

	    realNames[createHybridWrapper(undefined, BIND_KEY_FLAG).name] = [{
	      'name': 'wrapper',
	      'func': undefined
	    }];

	    // Add methods to `LazyWrapper`.
	    LazyWrapper.prototype.clone = lazyClone;
	    LazyWrapper.prototype.reverse = lazyReverse;
	    LazyWrapper.prototype.value = lazyValue;

	    // Add chain sequence methods to the `lodash` wrapper.
	    lodash.prototype.at = wrapperAt;
	    lodash.prototype.chain = wrapperChain;
	    lodash.prototype.commit = wrapperCommit;
	    lodash.prototype.next = wrapperNext;
	    lodash.prototype.plant = wrapperPlant;
	    lodash.prototype.reverse = wrapperReverse;
	    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;

	    if (iteratorSymbol) {
	      lodash.prototype[iteratorSymbol] = wrapperToIterator;
	    }
	    return lodash;
	  }

	  /*--------------------------------------------------------------------------*/

	  // Export lodash.
	  var _ = runInContext();

	  // Expose Lodash on the free variable `window` or `self` when available so it's
	  // globally accessible, even when bundled with Browserify, Webpack, etc. This
	  // also prevents errors in cases where Lodash is loaded by a script tag in the
	  // presence of an AMD loader. See http://requirejs.org/docs/errors.html#mismatch
	  // for more details. Use `_.noConflict` to remove Lodash from the global object.
	  (freeWindow || freeSelf || {})._ = _;

	  // Some AMD build optimizers like r.js check for condition patterns like the following:
	  if (true) {
	    // 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.
	    if (moduleExports) {
	      (freeModule.exports = _)._ = _;
	    }
	    // Export for CommonJS support.
	    freeExports._ = _;
	  }
	  else {
	    // Export to the global object.
	    root._ = _;
	  }
	}.call(this));

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(41)(module), __webpack_require__(0)))

/***/ },
/* 119 */
/***/ function(module, exports) {

	module.exports = after

	function after(count, callback, err_cb) {
	    var bail = false
	    err_cb = err_cb || noop
	    proxy.count = count

	    return (count === 0) ? callback() : proxy

	    function proxy(err, result) {
	        if (proxy.count <= 0) {
	            throw new Error('after called too many times')
	        }
	        --proxy.count

	        // after first error, rest are passed to err_cb
	        if (err) {
	            bail = true
	            callback(err)
	            // future error callbacks will go to error handler
	            callback = err_cb
	        } else if (proxy.count === 0 && !bail) {
	            callback(null, result)
	        }
	    }
	}

	function noop() {}


/***/ },
/* 120 */
/***/ function(module, exports) {

	/**
	 * An abstraction for slicing an arraybuffer even when
	 * ArrayBuffer.prototype.slice is not supported
	 *
	 * @api public
	 */

	module.exports = function(arraybuffer, start, end) {
	  var bytes = arraybuffer.byteLength;
	  start = start || 0;
	  end = end || bytes;

	  if (arraybuffer.slice) { return arraybuffer.slice(start, end); }

	  if (start < 0) { start += bytes; }
	  if (end < 0) { end += bytes; }
	  if (end > bytes) { end = bytes; }

	  if (start >= bytes || start >= end || bytes === 0) {
	    return new ArrayBuffer(0);
	  }

	  var abv = new Uint8Array(arraybuffer);
	  var result = new Uint8Array(end - start);
	  for (var i = start, ii = 0; i < end; i++, ii++) {
	    result[ii] = abv[i];
	  }
	  return result.buffer;
	};


/***/ },
/* 121 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	var _stringify = __webpack_require__(42);

	var _stringify2 = _interopRequireDefault(_stringify);

	var _classCallCheck2 = __webpack_require__(43);

	var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);

	var _createClass2 = __webpack_require__(44);

	var _createClass3 = _interopRequireDefault(_createClass2);

	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

	var _ = __webpack_require__(118);
	var Lazy = __webpack_require__(117);
	var EventEmitter = __webpack_require__(37).EventEmitter;
	var Promise = __webpack_require__(88);
	var Buffer = __webpack_require__(25).Buffer;
	var Node = __webpack_require__(122);

	var MaxBatchSize = 10; // How many items to keep per local batch
	var MaxHistory = 256; // How many items to fetch on join

	var Log = function () {
	  function Log(ipfs, id, name, opts) {
	    (0, _classCallCheck3.default)(this, Log);

	    this.id = id;
	    this.name = name;
	    this._ipfs = ipfs;
	    this._items = opts && opts.items ? opts.items : [];
	    this.options = opts || { maxHistory: MaxHistory };
	    if (!this.options.maxHistory) this.options.maxHistory = MaxHistory;
	    this._currentBatch = [];
	    this._heads = [];
	  }

	  (0, _createClass3.default)(Log, [{
	    key: 'add',
	    value: function add(data) {
	      var _this = this;

	      if (this._currentBatch.length >= MaxBatchSize) this._commit();

	      return Node.create(this._ipfs, data, this._heads).then(function (node) {
	        _this._heads = [node.hash];
	        _this._currentBatch[_this._currentBatch.length] = node;
	        return node;
	      });
	    }
	  }, {
	    key: 'join',
	    value: function join(other) {
	      var _this2 = this;

	      var diff = _.differenceWith(other.items, this._currentBatch, Node.equals);
	      var others = _.differenceWith(other.items, this._items, Node.equals);
	      var final = _.unionWith(this._currentBatch, others, Node.equals);
	      this._items = this._items.concat(final);
	      this._currentBatch = [];

	      // Fetch history
	      var nexts = _.flatten(other.items.map(function (f) {
	        return f.next;
	      }));
	      return Promise.map(nexts, function (f) {
	        var all = _this2.items.map(function (a) {
	          return a.hash;
	        });
	        return _this2._fetchRecursive(_this2._ipfs, f, all, _this2.options.maxHistory, 0).then(function (history) {
	          var h = _.differenceWith(history, _this2._items, Node.equals);
	          h.forEach(function (b) {
	            return _this2._insert(b);
	          });
	          return h;
	        });
	      }, { concurrency: 1 }).then(function (r) {
	        _this2._heads = Log.findHeads(_this2);
	        return _.flatten(r).concat(diff);
	      });
	    }
	  }, {
	    key: 'clear',
	    value: function clear() {
	      this._items = [];
	      this._currentBatch = [];
	    }

	    // Returns entries after initialization

	  }, {
	    key: 'load',
	    value: function load() {
	      return Promise.resolve([]);
	    }
	  }, {
	    key: '_insert',
	    value: function _insert(node) {
	      var _this3 = this;

	      var indices = Lazy(node.next).map(function (next) {
	        return Lazy(_this3._items).map(function (f) {
	          return f.hash;
	        }).indexOf(next);
	      }); // Find the item's parent's indices
	      var index = indices.toArray().length > 0 ? Math.max(indices.max() + 1, 0) : 0; // find the largest index (latest parent)
	      this._items.splice(index, 0, node);
	      return node;
	    }
	  }, {
	    key: '_commit',
	    value: function _commit() {
	      this._items = this._items.concat(this._currentBatch);
	      this._currentBatch = [];
	    }
	  }, {
	    key: '_fetchRecursive',
	    value: function _fetchRecursive(ipfs, hash, all, amount, depth) {
	      var _this4 = this;

	      var isReferenced = function isReferenced(list, item) {
	        return Lazy(list).reverse().find(function (f) {
	          return f === item;
	        }) !== undefined;
	      };
	      var result = [];

	      // If the given hash is in the given log (all) or if we're at maximum depth, return
	      if (isReferenced(all, hash) || depth >= amount) return Promise.resolve(result);

	      // Create the node and add it to the result
	      return Node.fromIpfsHash(ipfs, hash).then(function (node) {
	        result.push(node);
	        all.push(hash);
	        depth++;

	        return Promise.map(node.next, function (f) {
	          return _this4._fetchRecursive(ipfs, f, all, amount, depth);
	        }, { concurrency: 1 }).then(function (res) {
	          return _.flatten(res.concat(result));
	        });
	      });
	    }
	  }, {
	    key: 'items',
	    get: function get() {
	      return this._items.concat(this._currentBatch);
	    }
	  }, {
	    key: 'snapshot',
	    get: function get() {
	      return {
	        id: this.id,
	        items: this._currentBatch.map(function (f) {
	          return f.hash;
	        })
	      };
	    }
	  }], [{
	    key: 'getIpfsHash',
	    value: function getIpfsHash(ipfs, log) {
	      if (!ipfs) throw new Error("Ipfs instance not defined");
	      var data = new Buffer((0, _stringify2.default)(log.snapshot));
	      return ipfs.object.put(data).then(function (res) {
	        // console.log("RES", res.toJSON())
	        return res.toJSON().Hash;
	      });
	    }
	  }, {
	    key: 'fromJson',
	    value: function fromJson(ipfs, json) {
	      return Promise.all(json.items.map(function (f) {
	        return Node.fromIpfsHash(ipfs, f);
	      })).then(function (items) {
	        return new Log(ipfs, json.id, '', { items: items });
	      });
	    }
	  }, {
	    key: 'fromIpfsHash',
	    value: function fromIpfsHash(ipfs, hash) {
	      if (!ipfs) throw new Error("Ipfs instance not defined");
	      if (!hash) throw new Error("Invalid hash: " + hash);
	      return ipfs.object.get(hash, { enc: 'base58' }).then(function (res) {
	        // console.log("RES", res)
	        return Log.fromJson(ipfs, JSON.parse(res.toJSON().Data));
	      });
	    }
	  }, {
	    key: 'findHeads',
	    value: function findHeads(log) {
	      return Lazy(log.items).reverse().filter(function (f) {
	        return !Log.isReferencedInChain(log, f);
	      }).map(function (f) {
	        return f.hash;
	      }).toArray();
	    }
	  }, {
	    key: 'isReferencedInChain',
	    value: function isReferencedInChain(log, item) {
	      return Lazy(log.items).reverse().find(function (e) {
	        return e.hasChild(item);
	      }) !== undefined;
	    }
	  }, {
	    key: 'batchSize',
	    get: function get() {
	      return MaxBatchSize;
	    }
	  }]);
	  return Log;
	}();

	module.exports = Log;

/***/ },
/* 122 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	var _stringify = __webpack_require__(42);

	var _stringify2 = _interopRequireDefault(_stringify);

	var _assign = __webpack_require__(86);

	var _assign2 = _interopRequireDefault(_assign);

	var _classCallCheck2 = __webpack_require__(43);

	var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);

	var _createClass2 = __webpack_require__(44);

	var _createClass3 = _interopRequireDefault(_createClass2);

	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

	var Buffer = __webpack_require__(25).Buffer;

	var Node = function () {
	  function Node(payload, next) {
	    (0, _classCallCheck3.default)(this, Node);

	    this.payload = payload || null;
	    this.hash = null;
	    this.next = next ? next instanceof Array ? next : [next] : [];

	    // Convert instances of Node to its hash
	    this.next = this.next.map(function (f) {
	      if (f instanceof Node) return f.hash;
	      return f;
	    });
	  }

	  (0, _createClass3.default)(Node, [{
	    key: 'hasChild',
	    value: function hasChild(a) {
	      for (var i = 0; i < this.next.length; i++) {
	        if (this.next[i] === a.hash) return true;
	      }
	      return false;
	    }
	  }, {
	    key: 'asJson',
	    get: function get() {
	      var res = { payload: this.payload };
	      var next = this.next.map(function (f) {
	        if (f instanceof Node) return f.hash;
	        return f;
	      });
	      (0, _assign2.default)(res, { next: next });
	      return res;
	    }
	  }], [{
	    key: 'create',
	    value: function create(ipfs, data, next) {
	      if (!ipfs) throw new Error("Node requires ipfs instance");
	      var node = new Node(data, next);
	      return Node.getIpfsHash(ipfs, node).then(function (hash) {
	        node.hash = hash;
	        return node;
	      });
	    }
	  }, {
	    key: 'fromIpfsHash',
	    value: function fromIpfsHash(ipfs, hash) {
	      if (!ipfs) throw new Error("Node requires ipfs instance");
	      if (!hash) throw new Error("Invalid hash: " + hash);
	      return ipfs.object.get(hash, { enc: 'base58' }).then(function (obj) {
	        var f = void 0;
	        try {
	          f = JSON.parse(obj.toJSON().Data);
	        } catch (e) {
	          console.log("--------------");
	          console.log(e);
	          console.log(obj.toJSON());
	        }
	        // const f = JSON.parse(obj.toJSON().Data)
	        return Node.create(ipfs, f.payload, f.next);
	      });
	    }
	  }, {
	    key: 'getIpfsHash',
	    value: function getIpfsHash(ipfs, node) {
	      if (!ipfs) throw new Error("Node requires ipfs instance");
	      return ipfs.object.put(new Buffer((0, _stringify2.default)(node.asJson))).then(function (res) {
	        return res.toJSON().Hash;
	      });
	    }
	  }, {
	    key: 'equals',
	    value: function equals(a, b) {
	      return a.hash === b.hash;
	    }
	  }]);
	  return Node;
	}();

	module.exports = Node;

/***/ },
/* 123 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	// const IpfsApi = require('ipfs-api');

	var IPFS = __webpack_require__(85);
	var Logger = __webpack_require__(21);
	var logger = Logger.create("orbit-db example", { color: Logger.Colors.Green, showTimestamp: false, showLevel: false });
	var OrbitDB = __webpack_require__(84);

	var network = 'QmYPobvobKsyoCKTw476yTui611XABf927KxUPCf4gRLRr'; // 'localhost:3333'
	var username = 'user1';
	var password = '';
	var channel = 'browsertest1';
	var key = 'greeting';
	var value = 'Hello world';

	try {
	  var ipfs = new IPFS();
	  OrbitDB.connect(network, username, password, ipfs).then(function (orbit) {
	    orbit.kvstore(channel).then(function (db) {
	      var count = 1;
	      var query = function query() {
	        var startTime = new Date().getTime();
	        db.put(key, value + " " + count).then(function (res) {
	          var endTime = new Date().getTime();
	          logger.debug('db.put (#' + count + ') took ' + (endTime - startTime) + ' ms\n');
	          count++;

	          var result = db.get(key);
	          logger.debug("---------------------------------------------------");
	          logger.debug("Key | Value");
	          logger.debug("---------------------------------------------------");
	          logger.debug(key + ' | ' + result);
	          logger.debug("---------------------------------------------------");
	          console.log('\n');
	        }).catch(function (e) {
	          return logger.error(e.stack);
	        });
	      };
	      setInterval(query, 1000);
	    });
	  });
	} catch (e) {
	  logger.error(e.stack);
	}

/***/ },
/* 124 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	var _stringify = __webpack_require__(51);

	var _stringify2 = _interopRequireDefault(_stringify);

	var _promise = __webpack_require__(52);

	var _promise2 = _interopRequireDefault(_promise);

	var _classCallCheck2 = __webpack_require__(53);

	var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);

	var _createClass2 = __webpack_require__(54);

	var _createClass3 = _interopRequireDefault(_createClass2);

	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

	var io = __webpack_require__(197);
	var logger = __webpack_require__(21).create("orbit-db.Pubsub");

	var Pubsub = function () {
	  function Pubsub() {
	    (0, _classCallCheck3.default)(this, Pubsub);

	    this._socket = null;
	    this._subscriptions = {};
	  }

	  (0, _createClass3.default)(Pubsub, [{
	    key: 'connect',
	    value: function connect(host, port, username, password) {
	      var _this = this;

	      return new _promise2.default(function (resolve, reject) {
	        if (!_this._socket) _this._socket = io.connect('http://' + host + ':' + port, { 'forceNew': true });

	        _this._socket.on('connect', resolve);
	        _this._socket.on('connect_error', function (err) {
	          return reject(new Error('Connection refused to Pubsub at \'' + host + ':' + port + '\''));
	        });
	        _this._socket.on('disconnect', function (socket) {
	          return logger.warn('Disconnected from Pubsub at \'http://' + host + ':' + port + '\'');
	        });
	        _this._socket.on('error', function (e) {
	          return logger.error('Pubsub socket error:', e);
	        });
	        _this._socket.on('message', _this._handleMessage.bind(_this));
	        _this._socket.on('subscribed', _this._handleMessage.bind(_this));
	      });
	    }
	  }, {
	    key: 'disconnect',
	    value: function disconnect() {
	      if (this._socket) this._socket.disconnect();
	    }
	  }, {
	    key: 'subscribe',
	    value: function subscribe(hash, password, callback) {
	      if (!this._subscriptions[hash]) {
	        this._subscriptions[hash] = { callback: callback };
	        this._socket.emit('subscribe', { channel: hash }); // calls back with 'subscribed' event
	      }
	    }
	  }, {
	    key: 'unsubscribe',
	    value: function unsubscribe(hash) {
	      if (this._subscriptions[hash]) {
	        this._socket.emit('unsubscribe', { channel: hash });
	        delete this._subscriptions[hash];
	      }
	    }
	  }, {
	    key: 'publish',
	    value: function publish(hash, message) {
	      if (this._subscriptions[hash]) this._socket.send((0, _stringify2.default)({ channel: hash, message: message }));
	    }
	  }, {
	    key: '_handleMessage',
	    value: function _handleMessage(hash, message) {
	      if (this._subscriptions[hash] && this._subscriptions[hash].callback) this._subscriptions[hash].callback(hash, message);
	    }
	  }]);
	  return Pubsub;
	}();

	module.exports = Pubsub;

/***/ },
/* 125 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = { "default": __webpack_require__(131), __esModule: true };

/***/ },
/* 126 */
/***/ function(module, exports) {

	
	/**
	 * Expose `Backoff`.
	 */

	module.exports = Backoff;

	/**
	 * Initialize backoff timer with `opts`.
	 *
	 * - `min` initial timeout in milliseconds [100]
	 * - `max` max timeout [10000]
	 * - `jitter` [0]
	 * - `factor` [2]
	 *
	 * @param {Object} opts
	 * @api public
	 */

	function Backoff(opts) {
	  opts = opts || {};
	  this.ms = opts.min || 100;
	  this.max = opts.max || 10000;
	  this.factor = opts.factor || 2;
	  this.jitter = opts.jitter > 0 && opts.jitter <= 1 ? opts.jitter : 0;
	  this.attempts = 0;
	}

	/**
	 * Return the backoff duration.
	 *
	 * @return {Number}
	 * @api public
	 */

	Backoff.prototype.duration = function(){
	  var ms = this.ms * Math.pow(this.factor, this.attempts++);
	  if (this.jitter) {
	    var rand =  Math.random();
	    var deviation = Math.floor(rand * this.jitter * ms);
	    ms = (Math.floor(rand * 10) & 1) == 0  ? ms - deviation : ms + deviation;
	  }
	  return Math.min(ms, this.max) | 0;
	};

	/**
	 * Reset the number of attempts.
	 *
	 * @api public
	 */

	Backoff.prototype.reset = function(){
	  this.attempts = 0;
	};

	/**
	 * Set the minimum duration
	 *
	 * @api public
	 */

	Backoff.prototype.setMin = function(min){
	  this.ms = min;
	};

	/**
	 * Set the maximum duration
	 *
	 * @api public
	 */

	Backoff.prototype.setMax = function(max){
	  this.max = max;
	};

	/**
	 * Set the jitter
	 *
	 * @api public
	 */

	Backoff.prototype.setJitter = function(jitter){
	  this.jitter = jitter;
	};



/***/ },
/* 127 */
/***/ function(module, exports) {

	/*
	 * base64-arraybuffer
	 * https://github.com/niklasvh/base64-arraybuffer
	 *
	 * Copyright (c) 2012 Niklas von Hertzen
	 * Licensed under the MIT license.
	 */
	(function(chars){
	  "use strict";

	  exports.encode = function(arraybuffer) {
	    var bytes = new Uint8Array(arraybuffer),
	    i, len = bytes.length, base64 = "";

	    for (i = 0; i < len; i+=3) {
	      base64 += chars[bytes[i] >> 2];
	      base64 += chars[((bytes[i] & 3) << 4) | (bytes[i + 1] >> 4)];
	      base64 += chars[((bytes[i + 1] & 15) << 2) | (bytes[i + 2] >> 6)];
	      base64 += chars[bytes[i + 2] & 63];
	    }

	    if ((len % 3) === 2) {
	      base64 = base64.substring(0, base64.length - 1) + "=";
	    } else if (len % 3 === 1) {
	      base64 = base64.substring(0, base64.length - 2) + "==";
	    }

	    return base64;
	  };

	  exports.decode =  function(base64) {
	    var bufferLength = base64.length * 0.75,
	    len = base64.length, i, p = 0,
	    encoded1, encoded2, encoded3, encoded4;

	    if (base64[base64.length - 1] === "=") {
	      bufferLength--;
	      if (base64[base64.length - 2] === "=") {
	        bufferLength--;
	      }
	    }

	    var arraybuffer = new ArrayBuffer(bufferLength),
	    bytes = new Uint8Array(arraybuffer);

	    for (i = 0; i < len; i+=4) {
	      encoded1 = chars.indexOf(base64[i]);
	      encoded2 = chars.indexOf(base64[i+1]);
	      encoded3 = chars.indexOf(base64[i+2]);
	      encoded4 = chars.indexOf(base64[i+3]);

	      bytes[p++] = (encoded1 << 2) | (encoded2 >> 4);
	      bytes[p++] = ((encoded2 & 15) << 4) | (encoded3 >> 2);
	      bytes[p++] = ((encoded3 & 3) << 6) | (encoded4 & 63);
	    }

	    return arraybuffer;
	  };
	})("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/");


/***/ },
/* 128 */
/***/ function(module, exports) {

	"use strict";
	'use strict'

	exports.toByteArray = toByteArray
	exports.fromByteArray = fromByteArray

	var lookup = []
	var revLookup = []
	var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array

	function init () {
	  var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'
	  for (var i = 0, len = code.length; i < len; ++i) {
	    lookup[i] = code[i]
	    revLookup[code.charCodeAt(i)] = i
	  }

	  revLookup['-'.charCodeAt(0)] = 62
	  revLookup['_'.charCodeAt(0)] = 63
	}

	init()

	function toByteArray (b64) {
	  var i, j, l, tmp, placeHolders, arr
	  var len = b64.length

	  if (len % 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
	  placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0

	  // base64 is 4/3 + up to two characters of the original data
	  arr = new Arr(len * 3 / 4 - placeHolders)

	  // if there are placeholders, only get up to the last complete 4 chars
	  l = placeHolders > 0 ? len - 4 : len

	  var L = 0

	  for (i = 0, j = 0; i < l; i += 4, j += 3) {
	    tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)]
	    arr[L++] = (tmp >> 16) & 0xFF
	    arr[L++] = (tmp >> 8) & 0xFF
	    arr[L++] = tmp & 0xFF
	  }

	  if (placeHolders === 2) {
	    tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4)
	    arr[L++] = tmp & 0xFF
	  } else if (placeHolders === 1) {
	    tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2)
	    arr[L++] = (tmp >> 8) & 0xFF
	    arr[L++] = tmp & 0xFF
	  }

	  return arr
	}

	function tripletToBase64 (num) {
	  return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F]
	}

	function encodeChunk (uint8, start, end) {
	  var tmp
	  var output = []
	  for (var i = start; i < end; i += 3) {
	    tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2])
	    output.push(tripletToBase64(tmp))
	  }
	  return output.join('')
	}

	function fromByteArray (uint8) {
	  var tmp
	  var len = uint8.length
	  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes
	  var output = ''
	  var parts = []
	  var maxChunkLength = 16383 // must be multiple of 3

	  // go through the array every three bytes, we'll deal with trailing stuff later
	  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
	    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))
	  }

	  // pad the end with zeros, but make sure to not forget the extra bytes
	  if (extraBytes === 1) {
	    tmp = uint8[len - 1]
	    output += lookup[tmp >> 2]
	    output += lookup[(tmp << 4) & 0x3F]
	    output += '=='
	  } else if (extraBytes === 2) {
	    tmp = (uint8[len - 2] << 8) + (uint8[len - 1])
	    output += lookup[tmp >> 10]
	    output += lookup[(tmp >> 4) & 0x3F]
	    output += lookup[(tmp << 2) & 0x3F]
	    output += '='
	  }

	  parts.push(output)

	  return parts.join('')
	}


/***/ },
/* 129 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * Create a blob builder even when vendor prefixes exist
	 */

	var BlobBuilder = global.BlobBuilder
	  || global.WebKitBlobBuilder
	  || global.MSBlobBuilder
	  || global.MozBlobBuilder;

	/**
	 * Check if Blob constructor is supported
	 */

	var blobSupported = (function() {
	  try {
	    var a = new Blob(['hi']);
	    return a.size === 2;
	  } catch(e) {
	    return false;
	  }
	})();

	/**
	 * Check if Blob constructor supports ArrayBufferViews
	 * Fails in Safari 6, so we need to map to ArrayBuffers there.
	 */

	var blobSupportsArrayBufferView = blobSupported && (function() {
	  try {
	    var b = new Blob([new Uint8Array([1,2])]);
	    return b.size === 2;
	  } catch(e) {
	    return false;
	  }
	})();

	/**
	 * Check if BlobBuilder is supported
	 */

	var blobBuilderSupported = BlobBuilder
	  && BlobBuilder.prototype.append
	  && BlobBuilder.prototype.getBlob;

	/**
	 * Helper function that maps ArrayBufferViews to ArrayBuffers
	 * Used by BlobBuilder constructor and old browsers that didn't
	 * support it in the Blob constructor.
	 */

	function mapArrayBufferViews(ary) {
	  for (var i = 0; i < ary.length; i++) {
	    var chunk = ary[i];
	    if (chunk.buffer instanceof ArrayBuffer) {
	      var buf = chunk.buffer;

	      // if this is a subarray, make a copy so we only
	      // include the subarray region from the underlying buffer
	      if (chunk.byteLength !== buf.byteLength) {
	        var copy = new Uint8Array(chunk.byteLength);
	        copy.set(new Uint8Array(buf, chunk.byteOffset, chunk.byteLength));
	        buf = copy.buffer;
	      }

	      ary[i] = buf;
	    }
	  }
	}

	function BlobBuilderConstructor(ary, options) {
	  options = options || {};

	  var bb = new BlobBuilder();
	  mapArrayBufferViews(ary);

	  for (var i = 0; i < ary.length; i++) {
	    bb.append(ary[i]);
	  }

	  return (options.type) ? bb.getBlob(options.type) : bb.getBlob();
	};

	function BlobConstructor(ary, options) {
	  mapArrayBufferViews(ary);
	  return new Blob(ary, options || {});
	};

	module.exports = (function() {
	  if (blobSupported) {
	    return blobSupportsArrayBufferView ? global.Blob : BlobConstructor;
	  } else if (blobBuilderSupported) {
	    return BlobBuilderConstructor;
	  } else {
	    return undefined;
	  }
	})();

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 130 */
/***/ function(module, exports, __webpack_require__) {

	var core  = __webpack_require__(5)
	  , $JSON = core.JSON || (core.JSON = {stringify: JSON.stringify});
	module.exports = function stringify(it){ // eslint-disable-line no-unused-vars
	  return $JSON.stringify.apply($JSON, arguments);
	};

/***/ },
/* 131 */
/***/ function(module, exports, __webpack_require__) {

	__webpack_require__(162);
	var $Object = __webpack_require__(5).Object;
	module.exports = function defineProperty(it, key, desc){
	  return $Object.defineProperty(it, key, desc);
	};

/***/ },
/* 132 */
/***/ function(module, exports, __webpack_require__) {

	__webpack_require__(163);
	__webpack_require__(165);
	__webpack_require__(166);
	__webpack_require__(164);
	module.exports = __webpack_require__(5).Promise;

/***/ },
/* 133 */
/***/ function(module, exports) {

	module.exports = function(){ /* empty */ };

/***/ },
/* 134 */
/***/ function(module, exports) {

	module.exports = function(it, Constructor, name, forbiddenField){
	  if(!(it instanceof Constructor) || (forbiddenField !== undefined && forbiddenField in it)){
	    throw TypeError(name + ': incorrect invocation!');
	  } return it;
	};

/***/ },
/* 135 */
/***/ function(module, exports, __webpack_require__) {

	// false -> Array#indexOf
	// true  -> Array#includes
	var toIObject = __webpack_require__(19)
	  , toLength  = __webpack_require__(66)
	  , toIndex   = __webpack_require__(158);
	module.exports = function(IS_INCLUDES){
	  return function($this, el, fromIndex){
	    var O      = toIObject($this)
	      , length = toLength(O.length)
	      , index  = toIndex(fromIndex, length)
	      , value;
	    // Array#includes uses SameValueZero equality algorithm
	    if(IS_INCLUDES && el != el)while(length > index){
	      value = O[index++];
	      if(value != value)return true;
	    // Array#toIndex ignores holes, Array#includes - not
	    } else for(;length > index; index++)if(IS_INCLUDES || index in O){
	      if(O[index] === el)return IS_INCLUDES || index || 0;
	    } return !IS_INCLUDES && -1;
	  };
	};

/***/ },
/* 136 */
/***/ function(module, exports, __webpack_require__) {

	var ctx         = __webpack_require__(10)
	  , call        = __webpack_require__(140)
	  , isArrayIter = __webpack_require__(139)
	  , anObject    = __webpack_require__(4)
	  , toLength    = __webpack_require__(66)
	  , getIterFn   = __webpack_require__(160)
	  , BREAK       = {}
	  , RETURN      = {};
	var exports = module.exports = function(iterable, entries, fn, that, ITERATOR){
	  var iterFn = ITERATOR ? function(){ return iterable; } : getIterFn(iterable)
	    , f      = ctx(fn, that, entries ? 2 : 1)
	    , index  = 0
	    , length, step, iterator, result;
	  if(typeof iterFn != 'function')throw TypeError(iterable + ' is not iterable!');
	  // fast case for arrays with default iterator
	  if(isArrayIter(iterFn))for(length = toLength(iterable.length); length > index; index++){
	    result = entries ? f(anObject(step = iterable[index])[0], step[1]) : f(iterable[index]);
	    if(result === BREAK || result === RETURN)return result;
	  } else for(iterator = iterFn.call(iterable); !(step = iterator.next()).done; ){
	    result = call(iterator, f, step.value, entries);
	    if(result === BREAK || result === RETURN)return result;
	  }
	};
	exports.BREAK  = BREAK;
	exports.RETURN = RETURN;

/***/ },
/* 137 */
/***/ function(module, exports) {

	// fast apply, http://jsperf.lnkit.com/fast-apply/5
	module.exports = function(fn, args, that){
	  var un = that === undefined;
	  switch(args.length){
	    case 0: return un ? fn()
	                      : fn.call(that);
	    case 1: return un ? fn(args[0])
	                      : fn.call(that, args[0]);
	    case 2: return un ? fn(args[0], args[1])
	                      : fn.call(that, args[0], args[1]);
	    case 3: return un ? fn(args[0], args[1], args[2])
	                      : fn.call(that, args[0], args[1], args[2]);
	    case 4: return un ? fn(args[0], args[1], args[2], args[3])
	                      : fn.call(that, args[0], args[1], args[2], args[3]);
	  } return              fn.apply(that, args);
	};

/***/ },
/* 138 */
/***/ function(module, exports, __webpack_require__) {

	// fallback for non-array-like ES3 and non-enumerable old V8 strings
	var cof = __webpack_require__(18);
	module.exports = Object('z').propertyIsEnumerable(0) ? Object : function(it){
	  return cof(it) == 'String' ? it.split('') : Object(it);
	};

/***/ },
/* 139 */
/***/ function(module, exports, __webpack_require__) {

	// check on default Array iterator
	var Iterators  = __webpack_require__(13)
	  , ITERATOR   = __webpack_require__(1)('iterator')
	  , ArrayProto = Array.prototype;

	module.exports = function(it){
	  return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);
	};

/***/ },
/* 140 */
/***/ function(module, exports, __webpack_require__) {

	// call something on iterator step with safe closing on error
	var anObject = __webpack_require__(4);
	module.exports = function(iterator, fn, value, entries){
	  try {
	    return entries ? fn(anObject(value)[0], value[1]) : fn(value);
	  // 7.4.6 IteratorClose(iterator, completion)
	  } catch(e){
	    var ret = iterator['return'];
	    if(ret !== undefined)anObject(ret.call(iterator));
	    throw e;
	  }
	};

/***/ },
/* 141 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	var create         = __webpack_require__(145)
	  , descriptor     = __webpack_require__(30)
	  , setToStringTag = __webpack_require__(31)
	  , IteratorPrototype = {};

	// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()
	__webpack_require__(8)(IteratorPrototype, __webpack_require__(1)('iterator'), function(){ return this; });

	module.exports = function(Constructor, NAME, next){
	  Constructor.prototype = create(IteratorPrototype, {next: descriptor(1, next)});
	  setToStringTag(Constructor, NAME + ' Iterator');
	};

/***/ },
/* 142 */
/***/ function(module, exports, __webpack_require__) {

	var ITERATOR     = __webpack_require__(1)('iterator')
	  , SAFE_CLOSING = false;

	try {
	  var riter = [7][ITERATOR]();
	  riter['return'] = function(){ SAFE_CLOSING = true; };
	  Array.from(riter, function(){ throw 2; });
	} catch(e){ /* empty */ }

	module.exports = function(exec, skipClosing){
	  if(!skipClosing && !SAFE_CLOSING)return false;
	  var safe = false;
	  try {
	    var arr  = [7]
	      , iter = arr[ITERATOR]();
	    iter.next = function(){ return {done: safe = true}; };
	    arr[ITERATOR] = function(){ return iter; };
	    exec(arr);
	  } catch(e){ /* empty */ }
	  return safe;
	};

/***/ },
/* 143 */
/***/ function(module, exports) {

	module.exports = function(done, value){
	  return {value: value, done: !!done};
	};

/***/ },
/* 144 */
/***/ function(module, exports, __webpack_require__) {

	var global    = __webpack_require__(2)
	  , macrotask = __webpack_require__(65).set
	  , Observer  = global.MutationObserver || global.WebKitMutationObserver
	  , process   = global.process
	  , Promise   = global.Promise
	  , isNode    = __webpack_require__(18)(process) == 'process';

	module.exports = function(){
	  var head, last, notify;

	  var flush = function(){
	    var parent, fn;
	    if(isNode && (parent = process.domain))parent.exit();
	    while(head){
	      fn   = head.fn;
	      head = head.next;
	      try {
	        fn();
	      } catch(e){
	        if(head)notify();
	        else last = undefined;
	        throw e;
	      }
	    } last = undefined;
	    if(parent)parent.enter();
	  };

	  // Node.js
	  if(isNode){
	    notify = function(){
	      process.nextTick(flush);
	    };
	  // browsers with MutationObserver
	  } else if(Observer){
	    var toggle = true
	      , node   = document.createTextNode('');
	    new Observer(flush).observe(node, {characterData: true}); // eslint-disable-line no-new
	    notify = function(){
	      node.data = toggle = !toggle;
	    };
	  // environments with maybe non-completely correct, but existent Promise
	  } else if(Promise && Promise.resolve){
	    var promise = Promise.resolve();
	    notify = function(){
	      promise.then(flush);
	    };
	  // for other environments - macrotask based on:
	  // - setImmediate
	  // - MessageChannel
	  // - window.postMessag
	  // - onreadystatechange
	  // - setTimeout
	  } else {
	    notify = function(){
	      // strange IE + webpack dev server bug - use .call(global)
	      macrotask.call(global, flush);
	    };
	  }

	  return function(fn){
	    var task = {fn: fn, next: undefined};
	    if(last)last.next = task;
	    if(!head){
	      head = task;
	      notify();
	    } last = task;
	  };
	};

/***/ },
/* 145 */
/***/ function(module, exports, __webpack_require__) {

	// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])
	var anObject    = __webpack_require__(4)
	  , dPs         = __webpack_require__(146)
	  , enumBugKeys = __webpack_require__(58)
	  , IE_PROTO    = __webpack_require__(32)('IE_PROTO')
	  , Empty       = function(){ /* empty */ }
	  , PROTOTYPE   = 'prototype';

	// Create object with fake `null` prototype: use iframe Object with cleared prototype
	var createDict = function(){
	  // Thrash, waste and sodomy: IE GC bug
	  var iframe = __webpack_require__(28)('iframe')
	    , i      = enumBugKeys.length
	    , gt     = '>'
	    , iframeDocument;
	  iframe.style.display = 'none';
	  __webpack_require__(60).appendChild(iframe);
	  iframe.src = 'javascript:'; // eslint-disable-line no-script-url
	  // createDict = iframe.contentWindow.Object;
	  // html.removeChild(iframe);
	  iframeDocument = iframe.contentWindow.document;
	  iframeDocument.open();
	  iframeDocument.write('<script>document.F=Object</script' + gt);
	  iframeDocument.close();
	  createDict = iframeDocument.F;
	  while(i--)delete createDict[PROTOTYPE][enumBugKeys[i]];
	  return createDict();
	};

	module.exports = Object.create || function create(O, Properties){
	  var result;
	  if(O !== null){
	    Empty[PROTOTYPE] = anObject(O);
	    result = new Empty;
	    Empty[PROTOTYPE] = null;
	    // add "__proto__" for Object.getPrototypeOf polyfill
	    result[IE_PROTO] = O;
	  } else result = createDict();
	  return Properties === undefined ? result : dPs(result, Properties);
	};

/***/ },
/* 146 */
/***/ function(module, exports, __webpack_require__) {

	var dP       = __webpack_require__(14)
	  , anObject = __webpack_require__(4)
	  , getKeys  = __webpack_require__(150);

	module.exports = __webpack_require__(6) ? Object.defineProperties : function defineProperties(O, Properties){
	  anObject(O);
	  var keys   = getKeys(Properties)
	    , length = keys.length
	    , i = 0
	    , P;
	  while(length > i)dP.f(O, P = keys[i++], Properties[P]);
	  return O;
	};

/***/ },
/* 147 */
/***/ function(module, exports, __webpack_require__) {

	var pIE            = __webpack_require__(151)
	  , createDesc     = __webpack_require__(30)
	  , toIObject      = __webpack_require__(19)
	  , toPrimitive    = __webpack_require__(67)
	  , has            = __webpack_require__(11)
	  , IE8_DOM_DEFINE = __webpack_require__(61)
	  , gOPD           = Object.getOwnPropertyDescriptor;

	exports.f = __webpack_require__(6) ? gOPD : function getOwnPropertyDescriptor(O, P){
	  O = toIObject(O);
	  P = toPrimitive(P, true);
	  if(IE8_DOM_DEFINE)try {
	    return gOPD(O, P);
	  } catch(e){ /* empty */ }
	  if(has(O, P))return createDesc(!pIE.f.call(O, P), O[P]);
	};

/***/ },
/* 148 */
/***/ function(module, exports, __webpack_require__) {

	// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)
	var has         = __webpack_require__(11)
	  , toObject    = __webpack_require__(159)
	  , IE_PROTO    = __webpack_require__(32)('IE_PROTO')
	  , ObjectProto = Object.prototype;

	module.exports = Object.getPrototypeOf || function(O){
	  O = toObject(O);
	  if(has(O, IE_PROTO))return O[IE_PROTO];
	  if(typeof O.constructor == 'function' && O instanceof O.constructor){
	    return O.constructor.prototype;
	  } return O instanceof Object ? ObjectProto : null;
	};

/***/ },
/* 149 */
/***/ function(module, exports, __webpack_require__) {

	var has          = __webpack_require__(11)
	  , toIObject    = __webpack_require__(19)
	  , arrayIndexOf = __webpack_require__(135)(false)
	  , IE_PROTO     = __webpack_require__(32)('IE_PROTO');

	module.exports = function(object, names){
	  var O      = toIObject(object)
	    , i      = 0
	    , result = []
	    , key;
	  for(key in O)if(key != IE_PROTO)has(O, key) && result.push(key);
	  // Don't enum bug & hidden keys
	  while(names.length > i)if(has(O, key = names[i++])){
	    ~arrayIndexOf(result, key) || result.push(key);
	  }
	  return result;
	};

/***/ },
/* 150 */
/***/ function(module, exports, __webpack_require__) {

	// 19.1.2.14 / 15.2.3.14 Object.keys(O)
	var $keys       = __webpack_require__(149)
	  , enumBugKeys = __webpack_require__(58);

	module.exports = Object.keys || function keys(O){
	  return $keys(O, enumBugKeys);
	};

/***/ },
/* 151 */
/***/ function(module, exports) {

	exports.f = {}.propertyIsEnumerable;

/***/ },
/* 152 */
/***/ function(module, exports, __webpack_require__) {

	var hide = __webpack_require__(8);
	module.exports = function(target, src, safe){
	  for(var key in src){
	    if(safe && target[key])target[key] = src[key];
	    else hide(target, key, src[key]);
	  } return target;
	};

/***/ },
/* 153 */
/***/ function(module, exports, __webpack_require__) {

	module.exports = __webpack_require__(8);

/***/ },
/* 154 */
/***/ function(module, exports, __webpack_require__) {

	// Works with __proto__ only. Old v8 can't work with null proto objects.
	/* eslint-disable no-proto */
	var isObject = __webpack_require__(12)
	  , anObject = __webpack_require__(4);
	var check = function(O, proto){
	  anObject(O);
	  if(!isObject(proto) && proto !== null)throw TypeError(proto + ": can't set as prototype!");
	};
	module.exports = {
	  set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line
	    function(test, buggy, set){
	      try {
	        set = __webpack_require__(10)(Function.call, __webpack_require__(147).f(Object.prototype, '__proto__').set, 2);
	        set(test, []);
	        buggy = !(test instanceof Array);
	      } catch(e){ buggy = true; }
	      return function setPrototypeOf(O, proto){
	        check(O, proto);
	        if(buggy)O.__proto__ = proto;
	        else set(O, proto);
	        return O;
	      };
	    }({}, false) : undefined),
	  check: check
	};

/***/ },
/* 155 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	var global      = __webpack_require__(2)
	  , core        = __webpack_require__(5)
	  , dP          = __webpack_require__(14)
	  , DESCRIPTORS = __webpack_require__(6)
	  , SPECIES     = __webpack_require__(1)('species');

	module.exports = function(KEY){
	  var C = typeof core[KEY] == 'function' ? core[KEY] : global[KEY];
	  if(DESCRIPTORS && C && !C[SPECIES])dP.f(C, SPECIES, {
	    configurable: true,
	    get: function(){ return this; }
	  });
	};

/***/ },
/* 156 */
/***/ function(module, exports, __webpack_require__) {

	// 7.3.20 SpeciesConstructor(O, defaultConstructor)
	var anObject  = __webpack_require__(4)
	  , aFunction = __webpack_require__(26)
	  , SPECIES   = __webpack_require__(1)('species');
	module.exports = function(O, D){
	  var C = anObject(O).constructor, S;
	  return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? D : aFunction(S);
	};

/***/ },
/* 157 */
/***/ function(module, exports, __webpack_require__) {

	var toInteger = __webpack_require__(33)
	  , defined   = __webpack_require__(27);
	// true  -> String#at
	// false -> String#codePointAt
	module.exports = function(TO_STRING){
	  return function(that, pos){
	    var s = String(defined(that))
	      , i = toInteger(pos)
	      , l = s.length
	      , a, b;
	    if(i < 0 || i >= l)return TO_STRING ? '' : undefined;
	    a = s.charCodeAt(i);
	    return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff
	      ? TO_STRING ? s.charAt(i) : a
	      : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;
	  };
	};

/***/ },
/* 158 */
/***/ function(module, exports, __webpack_require__) {

	var toInteger = __webpack_require__(33)
	  , max       = Math.max
	  , min       = Math.min;
	module.exports = function(index, length){
	  index = toInteger(index);
	  return index < 0 ? max(index + length, 0) : min(index, length);
	};

/***/ },
/* 159 */
/***/ function(module, exports, __webpack_require__) {

	// 7.1.13 ToObject(argument)
	var defined = __webpack_require__(27);
	module.exports = function(it){
	  return Object(defined(it));
	};

/***/ },
/* 160 */
/***/ function(module, exports, __webpack_require__) {

	var classof   = __webpack_require__(57)
	  , ITERATOR  = __webpack_require__(1)('iterator')
	  , Iterators = __webpack_require__(13);
	module.exports = __webpack_require__(5).getIteratorMethod = function(it){
	  if(it != undefined)return it[ITERATOR]
	    || it['@@iterator']
	    || Iterators[classof(it)];
	};

/***/ },
/* 161 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	var addToUnscopables = __webpack_require__(133)
	  , step             = __webpack_require__(143)
	  , Iterators        = __webpack_require__(13)
	  , toIObject        = __webpack_require__(19);

	// 22.1.3.4 Array.prototype.entries()
	// 22.1.3.13 Array.prototype.keys()
	// 22.1.3.29 Array.prototype.values()
	// 22.1.3.30 Array.prototype[@@iterator]()
	module.exports = __webpack_require__(62)(Array, 'Array', function(iterated, kind){
	  this._t = toIObject(iterated); // target
	  this._i = 0;                   // next index
	  this._k = kind;                // kind
	// 22.1.5.2.1 %ArrayIteratorPrototype%.next()
	}, function(){
	  var O     = this._t
	    , kind  = this._k
	    , index = this._i++;
	  if(!O || index >= O.length){
	    this._t = undefined;
	    return step(1);
	  }
	  if(kind == 'keys'  )return step(0, index);
	  if(kind == 'values')return step(0, O[index]);
	  return step(0, [index, O[index]]);
	}, 'values');

	// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)
	Iterators.Arguments = Iterators.Array;

	addToUnscopables('keys');
	addToUnscopables('values');
	addToUnscopables('entries');

/***/ },
/* 162 */
/***/ function(module, exports, __webpack_require__) {

	var $export = __webpack_require__(29);
	// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)
	$export($export.S + $export.F * !__webpack_require__(6), 'Object', {defineProperty: __webpack_require__(14).f});

/***/ },
/* 163 */
/***/ function(module, exports) {

	

/***/ },
/* 164 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	var LIBRARY            = __webpack_require__(63)
	  , global             = __webpack_require__(2)
	  , ctx                = __webpack_require__(10)
	  , classof            = __webpack_require__(57)
	  , $export            = __webpack_require__(29)
	  , isObject           = __webpack_require__(12)
	  , anObject           = __webpack_require__(4)
	  , aFunction          = __webpack_require__(26)
	  , anInstance         = __webpack_require__(134)
	  , forOf              = __webpack_require__(136)
	  , setProto           = __webpack_require__(154).set
	  , speciesConstructor = __webpack_require__(156)
	  , task               = __webpack_require__(65).set
	  , microtask          = __webpack_require__(144)()
	  , PROMISE            = 'Promise'
	  , TypeError          = global.TypeError
	  , process            = global.process
	  , $Promise           = global[PROMISE]
	  , process            = global.process
	  , isNode             = classof(process) == 'process'
	  , empty              = function(){ /* empty */ }
	  , Internal, GenericPromiseCapability, Wrapper;

	var USE_NATIVE = !!function(){
	  try {
	    // correct subclassing with @@species support
	    var promise     = $Promise.resolve(1)
	      , FakePromise = (promise.constructor = {})[__webpack_require__(1)('species')] = function(exec){ exec(empty, empty); };
	    // unhandled rejections tracking support, NodeJS Promise without it fails @@species test
	    return (isNode || typeof PromiseRejectionEvent == 'function') && promise.then(empty) instanceof FakePromise;
	  } catch(e){ /* empty */ }
	}();

	// helpers
	var sameConstructor = function(a, b){
	  // with library wrapper special case
	  return a === b || a === $Promise && b === Wrapper;
	};
	var isThenable = function(it){
	  var then;
	  return isObject(it) && typeof (then = it.then) == 'function' ? then : false;
	};
	var newPromiseCapability = function(C){
	  return sameConstructor($Promise, C)
	    ? new PromiseCapability(C)
	    : new GenericPromiseCapability(C);
	};
	var PromiseCapability = GenericPromiseCapability = function(C){
	  var resolve, reject;
	  this.promise = new C(function($$resolve, $$reject){
	    if(resolve !== undefined || reject !== undefined)throw TypeError('Bad Promise constructor');
	    resolve = $$resolve;
	    reject  = $$reject;
	  });
	  this.resolve = aFunction(resolve);
	  this.reject  = aFunction(reject);
	};
	var perform = function(exec){
	  try {
	    exec();
	  } catch(e){
	    return {error: e};
	  }
	};
	var notify = function(promise, isReject){
	  if(promise._n)return;
	  promise._n = true;
	  var chain = promise._c;
	  microtask(function(){
	    var value = promise._v
	      , ok    = promise._s == 1
	      , i     = 0;
	    var run = function(reaction){
	      var handler = ok ? reaction.ok : reaction.fail
	        , resolve = reaction.resolve
	        , reject  = reaction.reject
	        , domain  = reaction.domain
	        , result, then;
	      try {
	        if(handler){
	          if(!ok){
	            if(promise._h == 2)onHandleUnhandled(promise);
	            promise._h = 1;
	          }
	          if(handler === true)result = value;
	          else {
	            if(domain)domain.enter();
	            result = handler(value);
	            if(domain)domain.exit();
	          }
	          if(result === reaction.promise){
	            reject(TypeError('Promise-chain cycle'));
	          } else if(then = isThenable(result)){
	            then.call(result, resolve, reject);
	          } else resolve(result);
	        } else reject(value);
	      } catch(e){
	        reject(e);
	      }
	    };
	    while(chain.length > i)run(chain[i++]); // variable length - can't use forEach
	    promise._c = [];
	    promise._n = false;
	    if(isReject && !promise._h)onUnhandled(promise);
	  });
	};
	var onUnhandled = function(promise){
	  task.call(global, function(){
	    var value = promise._v
	      , abrupt, handler, console;
	    if(isUnhandled(promise)){
	      abrupt = perform(function(){
	        if(isNode){
	          process.emit('unhandledRejection', value, promise);
	        } else if(handler = global.onunhandledrejection){
	          handler({promise: promise, reason: value});
	        } else if((console = global.console) && console.error){
	          console.error('Unhandled promise rejection', value);
	        }
	      });
	      // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should
	      promise._h = isNode || isUnhandled(promise) ? 2 : 1;
	    } promise._a = undefined;
	    if(abrupt)throw abrupt.error;
	  });
	};
	var isUnhandled = function(promise){
	  if(promise._h == 1)return false;
	  var chain = promise._a || promise._c
	    , i     = 0
	    , reaction;
	  while(chain.length > i){
	    reaction = chain[i++];
	    if(reaction.fail || !isUnhandled(reaction.promise))return false;
	  } return true;
	};
	var onHandleUnhandled = function(promise){
	  task.call(global, function(){
	    var handler;
	    if(isNode){
	      process.emit('rejectionHandled', promise);
	    } else if(handler = global.onrejectionhandled){
	      handler({promise: promise, reason: promise._v});
	    }
	  });
	};
	var $reject = function(value){
	  var promise = this;
	  if(promise._d)return;
	  promise._d = true;
	  promise = promise._w || promise; // unwrap
	  promise._v = value;
	  promise._s = 2;
	  if(!promise._a)promise._a = promise._c.slice();
	  notify(promise, true);
	};
	var $resolve = function(value){
	  var promise = this
	    , then;
	  if(promise._d)return;
	  promise._d = true;
	  promise = promise._w || promise; // unwrap
	  try {
	    if(promise === value)throw TypeError("Promise can't be resolved itself");
	    if(then = isThenable(value)){
	      microtask(function(){
	        var wrapper = {_w: promise, _d: false}; // wrap
	        try {
	          then.call(value, ctx($resolve, wrapper, 1), ctx($reject, wrapper, 1));
	        } catch(e){
	          $reject.call(wrapper, e);
	        }
	      });
	    } else {
	      promise._v = value;
	      promise._s = 1;
	      notify(promise, false);
	    }
	  } catch(e){
	    $reject.call({_w: promise, _d: false}, e); // wrap
	  }
	};

	// constructor polyfill
	if(!USE_NATIVE){
	  // 25.4.3.1 Promise(executor)
	  $Promise = function Promise(executor){
	    anInstance(this, $Promise, PROMISE, '_h');
	    aFunction(executor);
	    Internal.call(this);
	    try {
	      executor(ctx($resolve, this, 1), ctx($reject, this, 1));
	    } catch(err){
	      $reject.call(this, err);
	    }
	  };
	  Internal = function Promise(executor){
	    this._c = [];             // <- awaiting reactions
	    this._a = undefined;      // <- checked in isUnhandled reactions
	    this._s = 0;              // <- state
	    this._d = false;          // <- done
	    this._v = undefined;      // <- value
	    this._h = 0;              // <- rejection state, 0 - default, 1 - handled, 2 - unhandled
	    this._n = false;          // <- notify
	  };
	  Internal.prototype = __webpack_require__(152)($Promise.prototype, {
	    // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected)
	    then: function then(onFulfilled, onRejected){
	      var reaction    = newPromiseCapability(speciesConstructor(this, $Promise));
	      reaction.ok     = typeof onFulfilled == 'function' ? onFulfilled : true;
	      reaction.fail   = typeof onRejected == 'function' && onRejected;
	      reaction.domain = isNode ? process.domain : undefined;
	      this._c.push(reaction);
	      if(this._a)this._a.push(reaction);
	      if(this._s)notify(this, false);
	      return reaction.promise;
	    },
	    // 25.4.5.1 Promise.prototype.catch(onRejected)
	    'catch': function(onRejected){
	      return this.then(undefined, onRejected);
	    }
	  });
	  PromiseCapability = function(){
	    var promise  = new Internal;
	    this.promise = promise;
	    this.resolve = ctx($resolve, promise, 1);
	    this.reject  = ctx($reject, promise, 1);
	  };
	}

	$export($export.G + $export.W + $export.F * !USE_NATIVE, {Promise: $Promise});
	__webpack_require__(31)($Promise, PROMISE);
	__webpack_require__(155)(PROMISE);
	Wrapper = __webpack_require__(5)[PROMISE];

	// statics
	$export($export.S + $export.F * !USE_NATIVE, PROMISE, {
	  // 25.4.4.5 Promise.reject(r)
	  reject: function reject(r){
	    var capability = newPromiseCapability(this)
	      , $$reject   = capability.reject;
	    $$reject(r);
	    return capability.promise;
	  }
	});
	$export($export.S + $export.F * (LIBRARY || !USE_NATIVE), PROMISE, {
	  // 25.4.4.6 Promise.resolve(x)
	  resolve: function resolve(x){
	    // instanceof instead of internal slot check because we should fix it without replacement native Promise core
	    if(x instanceof $Promise && sameConstructor(x.constructor, this))return x;
	    var capability = newPromiseCapability(this)
	      , $$resolve  = capability.resolve;
	    $$resolve(x);
	    return capability.promise;
	  }
	});
	$export($export.S + $export.F * !(USE_NATIVE && __webpack_require__(142)(function(iter){
	  $Promise.all(iter)['catch'](empty);
	})), PROMISE, {
	  // 25.4.4.1 Promise.all(iterable)
	  all: function all(iterable){
	    var C          = this
	      , capability = newPromiseCapability(C)
	      , resolve    = capability.resolve
	      , reject     = capability.reject;
	    var abrupt = perform(function(){
	      var values    = []
	        , index     = 0
	        , remaining = 1;
	      forOf(iterable, false, function(promise){
	        var $index        = index++
	          , alreadyCalled = false;
	        values.push(undefined);
	        remaining++;
	        C.resolve(promise).then(function(value){
	          if(alreadyCalled)return;
	          alreadyCalled  = true;
	          values[$index] = value;
	          --remaining || resolve(values);
	        }, reject);
	      });
	      --remaining || resolve(values);
	    });
	    if(abrupt)reject(abrupt.error);
	    return capability.promise;
	  },
	  // 25.4.4.4 Promise.race(iterable)
	  race: function race(iterable){
	    var C          = this
	      , capability = newPromiseCapability(C)
	      , reject     = capability.reject;
	    var abrupt = perform(function(){
	      forOf(iterable, false, function(promise){
	        C.resolve(promise).then(capability.resolve, reject);
	      });
	    });
	    if(abrupt)reject(abrupt.error);
	    return capability.promise;
	  }
	});

/***/ },
/* 165 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';
	var $at  = __webpack_require__(157)(true);

	// 21.1.3.27 String.prototype[@@iterator]()
	__webpack_require__(62)(String, 'String', function(iterated){
	  this._t = String(iterated); // target
	  this._i = 0;                // next index
	// 21.1.5.2.1 %StringIteratorPrototype%.next()
	}, function(){
	  var O     = this._t
	    , index = this._i
	    , point;
	  if(index >= O.length)return {value: undefined, done: true};
	  point = $at(O, index);
	  this._i += point.length;
	  return {value: point, done: false};
	});

/***/ },
/* 166 */
/***/ function(module, exports, __webpack_require__) {

	__webpack_require__(161);
	var global        = __webpack_require__(2)
	  , hide          = __webpack_require__(8)
	  , Iterators     = __webpack_require__(13)
	  , TO_STRING_TAG = __webpack_require__(1)('toStringTag');

	for(var collections = ['NodeList', 'DOMTokenList', 'MediaList', 'StyleSheetList', 'CSSRuleList'], i = 0; i < 5; i++){
	  var NAME       = collections[i]
	    , Collection = global[NAME]
	    , proto      = Collection && Collection.prototype;
	  if(proto && !proto[TO_STRING_TAG])hide(proto, TO_STRING_TAG, NAME);
	  Iterators[NAME] = Iterators.Array;
	}

/***/ },
/* 167 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const isEqual = __webpack_require__(168).isEqual;

	class GCounter {
	  constructor(id, payload) {
	    this.id = id;
	    this._counters = payload ? payload : {};
	    this._counters[this.id] = this._counters[this.id] ? this._counters[this.id] : 0;
	  }

	  increment(amount) {
	    if(!amount) amount = 1;
	    this._counters[this.id] = this._counters[this.id] + amount;
	  }

	  get value() {
	    return Object.keys(this._counters)
	      .map((f) => this._counters[f])
	      .reduce((previousValue, currentValue) => previousValue + currentValue, 0);
	  }

	  get payload() {
	    return { id: this.id, counters: this._counters };
	  }

	  compare(other) {
	    if(other.id !== this.id)
	      return false;

	    return isEqual(other._counters, this._counters);
	  }

	  merge(other) {
	    Object.keys(other._counters).forEach((f) => {
	      this._counters[f] = Math.max(this._counters[f] ? this._counters[f] : 0, other._counters[f]);
	    });
	  }

	  static from(payload) {
	    return new GCounter(payload.id, payload.counters);
	  }

	}

	module.exports = GCounter;


/***/ },
/* 168 */
/***/ function(module, exports) {

	"use strict";
	'use strict';

	exports.isEqual = (a, b) => {
	  const propsA = Object.getOwnPropertyNames(a);
	  const propsB = Object.getOwnPropertyNames(b);

	  if(propsA.length !== propsB.length)
	    return false;

	  for(let i = 0; i < propsA.length; i ++) {
	    const prop = propsA[i];
	    if(a[prop] !== b[prop])
	      return false;
	  }

	  return true;
	}


/***/ },
/* 169 */
/***/ function(module, exports, __webpack_require__) {

	
	/**
	 * This is the common logic for both the Node.js and web browser
	 * implementations of `debug()`.
	 *
	 * Expose `debug()` as the module.
	 */

	exports = module.exports = debug;
	exports.coerce = coerce;
	exports.disable = disable;
	exports.enable = enable;
	exports.enabled = enabled;
	exports.humanize = __webpack_require__(186);

	/**
	 * The currently active debug mode names, and names to skip.
	 */

	exports.names = [];
	exports.skips = [];

	/**
	 * Map of special "%n" handling functions, for the debug "format" argument.
	 *
	 * Valid key names are a single, lowercased letter, i.e. "n".
	 */

	exports.formatters = {};

	/**
	 * Previously assigned color.
	 */

	var prevColor = 0;

	/**
	 * Previous log timestamp.
	 */

	var prevTime;

	/**
	 * Select a color.
	 *
	 * @return {Number}
	 * @api private
	 */

	function selectColor() {
	  return exports.colors[prevColor++ % exports.colors.length];
	}

	/**
	 * Create a debugger with the given `namespace`.
	 *
	 * @param {String} namespace
	 * @return {Function}
	 * @api public
	 */

	function debug(namespace) {

	  // define the `disabled` version
	  function disabled() {
	  }
	  disabled.enabled = false;

	  // define the `enabled` version
	  function enabled() {

	    var self = enabled;

	    // set `diff` timestamp
	    var curr = +new Date();
	    var ms = curr - (prevTime || curr);
	    self.diff = ms;
	    self.prev = prevTime;
	    self.curr = curr;
	    prevTime = curr;

	    // add the `color` if not set
	    if (null == self.useColors) self.useColors = exports.useColors();
	    if (null == self.color && self.useColors) self.color = selectColor();

	    var args = Array.prototype.slice.call(arguments);

	    args[0] = exports.coerce(args[0]);

	    if ('string' !== typeof args[0]) {
	      // anything else let's inspect with %o
	      args = ['%o'].concat(args);
	    }

	    // apply any `formatters` transformations
	    var index = 0;
	    args[0] = args[0].replace(/%([a-z%])/g, function(match, format) {
	      // if we encounter an escaped % then don't increase the array index
	      if (match === '%%') return match;
	      index++;
	      var formatter = exports.formatters[format];
	      if ('function' === typeof formatter) {
	        var val = args[index];
	        match = formatter.call(self, val);

	        // now we need to remove `args[index]` since it's inlined in the `format`
	        args.splice(index, 1);
	        index--;
	      }
	      return match;
	    });

	    if ('function' === typeof exports.formatArgs) {
	      args = exports.formatArgs.apply(self, args);
	    }
	    var logFn = enabled.log || exports.log || console.log.bind(console);
	    logFn.apply(self, args);
	  }
	  enabled.enabled = true;

	  var fn = exports.enabled(namespace) ? enabled : disabled;

	  fn.namespace = namespace;

	  return fn;
	}

	/**
	 * Enables a debug mode by namespaces. This can include modes
	 * separated by a colon and wildcards.
	 *
	 * @param {String} namespaces
	 * @api public
	 */

	function enable(namespaces) {
	  exports.save(namespaces);

	  var split = (namespaces || '').split(/[\s,]+/);
	  var len = split.length;

	  for (var i = 0; i < len; i++) {
	    if (!split[i]) continue; // ignore empty strings
	    namespaces = split[i].replace(/\*/g, '.*?');
	    if (namespaces[0] === '-') {
	      exports.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));
	    } else {
	      exports.names.push(new RegExp('^' + namespaces + '$'));
	    }
	  }
	}

	/**
	 * Disable debug output.
	 *
	 * @api public
	 */

	function disable() {
	  exports.enable('');
	}

	/**
	 * Returns true if the given mode name is enabled, false otherwise.
	 *
	 * @param {String} name
	 * @return {Boolean}
	 * @api public
	 */

	function enabled(name) {
	  var i, len;
	  for (i = 0, len = exports.skips.length; i < len; i++) {
	    if (exports.skips[i].test(name)) {
	      return false;
	    }
	  }
	  for (i = 0, len = exports.names.length; i < len; i++) {
	    if (exports.names[i].test(name)) {
	      return true;
	    }
	  }
	  return false;
	}

	/**
	 * Coerce `val`.
	 *
	 * @param {Mixed} val
	 * @return {Mixed}
	 * @api private
	 */

	function coerce(val) {
	  if (val instanceof Error) return val.stack || val.message;
	  return val;
	}


/***/ },
/* 170 */
/***/ function(module, exports, __webpack_require__) {

	
	module.exports =  __webpack_require__(171);


/***/ },
/* 171 */
/***/ function(module, exports, __webpack_require__) {

	
	module.exports = __webpack_require__(172);

	/**
	 * Exports parser
	 *
	 * @api public
	 *
	 */
	module.exports.parser = __webpack_require__(9);


/***/ },
/* 172 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * Module dependencies.
	 */

	var transports = __webpack_require__(69);
	var Emitter = __webpack_require__(36);
	var debug = __webpack_require__(3)('engine.io-client:socket');
	var index = __webpack_require__(71);
	var parser = __webpack_require__(9);
	var parseuri = __webpack_require__(76);
	var parsejson = __webpack_require__(195);
	var parseqs = __webpack_require__(39);

	/**
	 * Module exports.
	 */

	module.exports = Socket;

	/**
	 * Noop function.
	 *
	 * @api private
	 */

	function noop(){}

	/**
	 * Socket constructor.
	 *
	 * @param {String|Object} uri or options
	 * @param {Object} options
	 * @api public
	 */

	function Socket(uri, opts){
	  if (!(this instanceof Socket)) return new Socket(uri, opts);

	  opts = opts || {};

	  if (uri && 'object' == typeof uri) {
	    opts = uri;
	    uri = null;
	  }

	  if (uri) {
	    uri = parseuri(uri);
	    opts.hostname = uri.host;
	    opts.secure = uri.protocol == 'https' || uri.protocol == 'wss';
	    opts.port = uri.port;
	    if (uri.query) opts.query = uri.query;
	  } else if (opts.host) {
	    opts.hostname = parseuri(opts.host).host;
	  }

	  this.secure = null != opts.secure ? opts.secure :
	    (global.location && 'https:' == location.protocol);

	  if (opts.hostname && !opts.port) {
	    // if no port is specified manually, use the protocol default
	    opts.port = this.secure ? '443' : '80';
	  }

	  this.agent = opts.agent || false;
	  this.hostname = opts.hostname ||
	    (global.location ? location.hostname : 'localhost');
	  this.port = opts.port || (global.location && location.port ?
	       location.port :
	       (this.secure ? 443 : 80));
	  this.query = opts.query || {};
	  if ('string' == typeof this.query) this.query = parseqs.decode(this.query);
	  this.upgrade = false !== opts.upgrade;
	  this.path = (opts.path || '/engine.io').replace(/\/$/, '') + '/';
	  this.forceJSONP = !!opts.forceJSONP;
	  this.jsonp = false !== opts.jsonp;
	  this.forceBase64 = !!opts.forceBase64;
	  this.enablesXDR = !!opts.enablesXDR;
	  this.timestampParam = opts.timestampParam || 't';
	  this.timestampRequests = opts.timestampRequests;
	  this.transports = opts.transports || ['polling', 'websocket'];
	  this.readyState = '';
	  this.writeBuffer = [];
	  this.policyPort = opts.policyPort || 843;
	  this.rememberUpgrade = opts.rememberUpgrade || false;
	  this.binaryType = null;
	  this.onlyBinaryUpgrades = opts.onlyBinaryUpgrades;
	  this.perMessageDeflate = false !== opts.perMessageDeflate ? (opts.perMessageDeflate || {}) : false;

	  if (true === this.perMessageDeflate) this.perMessageDeflate = {};
	  if (this.perMessageDeflate && null == this.perMessageDeflate.threshold) {
	    this.perMessageDeflate.threshold = 1024;
	  }

	  // SSL options for Node.js client
	  this.pfx = opts.pfx || null;
	  this.key = opts.key || null;
	  this.passphrase = opts.passphrase || null;
	  this.cert = opts.cert || null;
	  this.ca = opts.ca || null;
	  this.ciphers = opts.ciphers || null;
	  this.rejectUnauthorized = opts.rejectUnauthorized === undefined ? true : opts.rejectUnauthorized;

	  // other options for Node.js client
	  var freeGlobal = typeof global == 'object' && global;
	  if (freeGlobal.global === freeGlobal) {
	    if (opts.extraHeaders && Object.keys(opts.extraHeaders).length > 0) {
	      this.extraHeaders = opts.extraHeaders;
	    }
	  }

	  this.open();
	}

	Socket.priorWebsocketSuccess = false;

	/**
	 * Mix in `Emitter`.
	 */

	Emitter(Socket.prototype);

	/**
	 * Protocol version.
	 *
	 * @api public
	 */

	Socket.protocol = parser.protocol; // this is an int

	/**
	 * Expose deps for legacy compatibility
	 * and standalone browser access.
	 */

	Socket.Socket = Socket;
	Socket.Transport = __webpack_require__(34);
	Socket.transports = __webpack_require__(69);
	Socket.parser = __webpack_require__(9);

	/**
	 * Creates transport of the given type.
	 *
	 * @param {String} transport name
	 * @return {Transport}
	 * @api private
	 */

	Socket.prototype.createTransport = function (name) {
	  debug('creating transport "%s"', name);
	  var query = clone(this.query);

	  // append engine.io protocol identifier
	  query.EIO = parser.protocol;

	  // transport name
	  query.transport = name;

	  // session id if we already have one
	  if (this.id) query.sid = this.id;

	  var transport = new transports[name]({
	    agent: this.agent,
	    hostname: this.hostname,
	    port: this.port,
	    secure: this.secure,
	    path: this.path,
	    query: query,
	    forceJSONP: this.forceJSONP,
	    jsonp: this.jsonp,
	    forceBase64: this.forceBase64,
	    enablesXDR: this.enablesXDR,
	    timestampRequests: this.timestampRequests,
	    timestampParam: this.timestampParam,
	    policyPort: this.policyPort,
	    socket: this,
	    pfx: this.pfx,
	    key: this.key,
	    passphrase: this.passphrase,
	    cert: this.cert,
	    ca: this.ca,
	    ciphers: this.ciphers,
	    rejectUnauthorized: this.rejectUnauthorized,
	    perMessageDeflate: this.perMessageDeflate,
	    extraHeaders: this.extraHeaders
	  });

	  return transport;
	};

	function clone (obj) {
	  var o = {};
	  for (var i in obj) {
	    if (obj.hasOwnProperty(i)) {
	      o[i] = obj[i];
	    }
	  }
	  return o;
	}

	/**
	 * Initializes transport to use and starts probe.
	 *
	 * @api private
	 */
	Socket.prototype.open = function () {
	  var transport;
	  if (this.rememberUpgrade && Socket.priorWebsocketSuccess && this.transports.indexOf('websocket') != -1) {
	    transport = 'websocket';
	  } else if (0 === this.transports.length) {
	    // Emit error on next tick so it can be listened to
	    var self = this;
	    setTimeout(function() {
	      self.emit('error', 'No transports available');
	    }, 0);
	    return;
	  } else {
	    transport = this.transports[0];
	  }
	  this.readyState = 'opening';

	  // Retry with the next transport if the transport is disabled (jsonp: false)
	  try {
	    transport = this.createTransport(transport);
	  } catch (e) {
	    this.transports.shift();
	    this.open();
	    return;
	  }

	  transport.open();
	  this.setTransport(transport);
	};

	/**
	 * Sets the current transport. Disables the existing one (if any).
	 *
	 * @api private
	 */

	Socket.prototype.setTransport = function(transport){
	  debug('setting transport %s', transport.name);
	  var self = this;

	  if (this.transport) {
	    debug('clearing existing transport %s', this.transport.name);
	    this.transport.removeAllListeners();
	  }

	  // set up transport
	  this.transport = transport;

	  // set up transport listeners
	  transport
	  .on('drain', function(){
	    self.onDrain();
	  })
	  .on('packet', function(packet){
	    self.onPacket(packet);
	  })
	  .on('error', function(e){
	    self.onError(e);
	  })
	  .on('close', function(){
	    self.onClose('transport close');
	  });
	};

	/**
	 * Probes a transport.
	 *
	 * @param {String} transport name
	 * @api private
	 */

	Socket.prototype.probe = function (name) {
	  debug('probing transport "%s"', name);
	  var transport = this.createTransport(name, { probe: 1 })
	    , failed = false
	    , self = this;

	  Socket.priorWebsocketSuccess = false;

	  function onTransportOpen(){
	    if (self.onlyBinaryUpgrades) {
	      var upgradeLosesBinary = !this.supportsBinary && self.transport.supportsBinary;
	      failed = failed || upgradeLosesBinary;
	    }
	    if (failed) return;

	    debug('probe transport "%s" opened', name);
	    transport.send([{ type: 'ping', data: 'probe' }]);
	    transport.once('packet', function (msg) {
	      if (failed) return;
	      if ('pong' == msg.type && 'probe' == msg.data) {
	        debug('probe transport "%s" pong', name);
	        self.upgrading = true;
	        self.emit('upgrading', transport);
	        if (!transport) return;
	        Socket.priorWebsocketSuccess = 'websocket' == transport.name;

	        debug('pausing current transport "%s"', self.transport.name);
	        self.transport.pause(function () {
	          if (failed) return;
	          if ('closed' == self.readyState) return;
	          debug('changing transport and sending upgrade packet');

	          cleanup();

	          self.setTransport(transport);
	          transport.send([{ type: 'upgrade' }]);
	          self.emit('upgrade', transport);
	          transport = null;
	          self.upgrading = false;
	          self.flush();
	        });
	      } else {
	        debug('probe transport "%s" failed', name);
	        var err = new Error('probe error');
	        err.transport = transport.name;
	        self.emit('upgradeError', err);
	      }
	    });
	  }

	  function freezeTransport() {
	    if (failed) return;

	    // Any callback called by transport should be ignored since now
	    failed = true;

	    cleanup();

	    transport.close();
	    transport = null;
	  }

	  //Handle any error that happens while probing
	  function onerror(err) {
	    var error = new Error('probe error: ' + err);
	    error.transport = transport.name;

	    freezeTransport();

	    debug('probe transport "%s" failed because of error: %s', name, err);

	    self.emit('upgradeError', error);
	  }

	  function onTransportClose(){
	    onerror("transport closed");
	  }

	  //When the socket is closed while we're probing
	  function onclose(){
	    onerror("socket closed");
	  }

	  //When the socket is upgraded while we're probing
	  function onupgrade(to){
	    if (transport && to.name != transport.name) {
	      debug('"%s" works - aborting "%s"', to.name, transport.name);
	      freezeTransport();
	    }
	  }

	  //Remove all listeners on the transport and on self
	  function cleanup(){
	    transport.removeListener('open', onTransportOpen);
	    transport.removeListener('error', onerror);
	    transport.removeListener('close', onTransportClose);
	    self.removeListener('close', onclose);
	    self.removeListener('upgrading', onupgrade);
	  }

	  transport.once('open', onTransportOpen);
	  transport.once('error', onerror);
	  transport.once('close', onTransportClose);

	  this.once('close', onclose);
	  this.once('upgrading', onupgrade);

	  transport.open();

	};

	/**
	 * Called when connection is deemed open.
	 *
	 * @api public
	 */

	Socket.prototype.onOpen = function () {
	  debug('socket open');
	  this.readyState = 'open';
	  Socket.priorWebsocketSuccess = 'websocket' == this.transport.name;
	  this.emit('open');
	  this.flush();

	  // we check for `readyState` in case an `open`
	  // listener already closed the socket
	  if ('open' == this.readyState && this.upgrade && this.transport.pause) {
	    debug('starting upgrade probes');
	    for (var i = 0, l = this.upgrades.length; i < l; i++) {
	      this.probe(this.upgrades[i]);
	    }
	  }
	};

	/**
	 * Handles a packet.
	 *
	 * @api private
	 */

	Socket.prototype.onPacket = function (packet) {
	  if ('opening' == this.readyState || 'open' == this.readyState) {
	    debug('socket receive: type "%s", data "%s"', packet.type, packet.data);

	    this.emit('packet', packet);

	    // Socket is live - any packet counts
	    this.emit('heartbeat');

	    switch (packet.type) {
	      case 'open':
	        this.onHandshake(parsejson(packet.data));
	        break;

	      case 'pong':
	        this.setPing();
	        this.emit('pong');
	        break;

	      case 'error':
	        var err = new Error('server error');
	        err.code = packet.data;
	        this.onError(err);
	        break;

	      case 'message':
	        this.emit('data', packet.data);
	        this.emit('message', packet.data);
	        break;
	    }
	  } else {
	    debug('packet received with socket readyState "%s"', this.readyState);
	  }
	};

	/**
	 * Called upon handshake completion.
	 *
	 * @param {Object} handshake obj
	 * @api private
	 */

	Socket.prototype.onHandshake = function (data) {
	  this.emit('handshake', data);
	  this.id = data.sid;
	  this.transport.query.sid = data.sid;
	  this.upgrades = this.filterUpgrades(data.upgrades);
	  this.pingInterval = data.pingInterval;
	  this.pingTimeout = data.pingTimeout;
	  this.onOpen();
	  // In case open handler closes socket
	  if  ('closed' == this.readyState) return;
	  this.setPing();

	  // Prolong liveness of socket on heartbeat
	  this.removeListener('heartbeat', this.onHeartbeat);
	  this.on('heartbeat', this.onHeartbeat);
	};

	/**
	 * Resets ping timeout.
	 *
	 * @api private
	 */

	Socket.prototype.onHeartbeat = function (timeout) {
	  clearTimeout(this.pingTimeoutTimer);
	  var self = this;
	  self.pingTimeoutTimer = setTimeout(function () {
	    if ('closed' == self.readyState) return;
	    self.onClose('ping timeout');
	  }, timeout || (self.pingInterval + self.pingTimeout));
	};

	/**
	 * Pings server every `this.pingInterval` and expects response
	 * within `this.pingTimeout` or closes connection.
	 *
	 * @api private
	 */

	Socket.prototype.setPing = function () {
	  var self = this;
	  clearTimeout(self.pingIntervalTimer);
	  self.pingIntervalTimer = setTimeout(function () {
	    debug('writing ping packet - expecting pong within %sms', self.pingTimeout);
	    self.ping();
	    self.onHeartbeat(self.pingTimeout);
	  }, self.pingInterval);
	};

	/**
	* Sends a ping packet.
	*
	* @api private
	*/

	Socket.prototype.ping = function () {
	  var self = this;
	  this.sendPacket('ping', function(){
	    self.emit('ping');
	  });
	};

	/**
	 * Called on `drain` event
	 *
	 * @api private
	 */

	Socket.prototype.onDrain = function() {
	  this.writeBuffer.splice(0, this.prevBufferLen);

	  // setting prevBufferLen = 0 is very important
	  // for example, when upgrading, upgrade packet is sent over,
	  // and a nonzero prevBufferLen could cause problems on `drain`
	  this.prevBufferLen = 0;

	  if (0 === this.writeBuffer.length) {
	    this.emit('drain');
	  } else {
	    this.flush();
	  }
	};

	/**
	 * Flush write buffers.
	 *
	 * @api private
	 */

	Socket.prototype.flush = function () {
	  if ('closed' != this.readyState && this.transport.writable &&
	    !this.upgrading && this.writeBuffer.length) {
	    debug('flushing %d packets in socket', this.writeBuffer.length);
	    this.transport.send(this.writeBuffer);
	    // keep track of current length of writeBuffer
	    // splice writeBuffer and callbackBuffer on `drain`
	    this.prevBufferLen = this.writeBuffer.length;
	    this.emit('flush');
	  }
	};

	/**
	 * Sends a message.
	 *
	 * @param {String} message.
	 * @param {Function} callback function.
	 * @param {Object} options.
	 * @return {Socket} for chaining.
	 * @api public
	 */

	Socket.prototype.write =
	Socket.prototype.send = function (msg, options, fn) {
	  this.sendPacket('message', msg, options, fn);
	  return this;
	};

	/**
	 * Sends a packet.
	 *
	 * @param {String} packet type.
	 * @param {String} data.
	 * @param {Object} options.
	 * @param {Function} callback function.
	 * @api private
	 */

	Socket.prototype.sendPacket = function (type, data, options, fn) {
	  if('function' == typeof data) {
	    fn = data;
	    data = undefined;
	  }

	  if ('function' == typeof options) {
	    fn = options;
	    options = null;
	  }

	  if ('closing' == this.readyState || 'closed' == this.readyState) {
	    return;
	  }

	  options = options || {};
	  options.compress = false !== options.compress;

	  var packet = {
	    type: type,
	    data: data,
	    options: options
	  };
	  this.emit('packetCreate', packet);
	  this.writeBuffer.push(packet);
	  if (fn) this.once('flush', fn);
	  this.flush();
	};

	/**
	 * Closes the connection.
	 *
	 * @api private
	 */

	Socket.prototype.close = function () {
	  if ('opening' == this.readyState || 'open' == this.readyState) {
	    this.readyState = 'closing';

	    var self = this;

	    if (this.writeBuffer.length) {
	      this.once('drain', function() {
	        if (this.upgrading) {
	          waitForUpgrade();
	        } else {
	          close();
	        }
	      });
	    } else if (this.upgrading) {
	      waitForUpgrade();
	    } else {
	      close();
	    }
	  }

	  function close() {
	    self.onClose('forced close');
	    debug('socket closing - telling transport to close');
	    self.transport.close();
	  }

	  function cleanupAndClose() {
	    self.removeListener('upgrade', cleanupAndClose);
	    self.removeListener('upgradeError', cleanupAndClose);
	    close();
	  }

	  function waitForUpgrade() {
	    // wait for upgrade to finish since we can't send packets while pausing a transport
	    self.once('upgrade', cleanupAndClose);
	    self.once('upgradeError', cleanupAndClose);
	  }

	  return this;
	};

	/**
	 * Called upon transport error
	 *
	 * @api private
	 */

	Socket.prototype.onError = function (err) {
	  debug('socket error %j', err);
	  Socket.priorWebsocketSuccess = false;
	  this.emit('error', err);
	  this.onClose('transport error', err);
	};

	/**
	 * Called upon transport close.
	 *
	 * @api private
	 */

	Socket.prototype.onClose = function (reason, desc) {
	  if ('opening' == this.readyState || 'open' == this.readyState || 'closing' == this.readyState) {
	    debug('socket close with reason: "%s"', reason);
	    var self = this;

	    // clear timers
	    clearTimeout(this.pingIntervalTimer);
	    clearTimeout(this.pingTimeoutTimer);

	    // stop event from firing again for transport
	    this.transport.removeAllListeners('close');

	    // ensure transport won't stay open
	    this.transport.close();

	    // ignore further transport communication
	    this.transport.removeAllListeners();

	    // set ready state
	    this.readyState = 'closed';

	    // clear session id
	    this.id = null;

	    // emit close event
	    this.emit('close', reason, desc);

	    // clean buffers after, so users can still
	    // grab the buffers on `close` event
	    self.writeBuffer = [];
	    self.prevBufferLen = 0;
	  }
	};

	/**
	 * Filters upgrades, returning only those matching client transports.
	 *
	 * @param {Array} server upgrades
	 * @api private
	 *
	 */

	Socket.prototype.filterUpgrades = function (upgrades) {
	  var filteredUpgrades = [];
	  for (var i = 0, j = upgrades.length; i<j; i++) {
	    if (~index(this.transports, upgrades[i])) filteredUpgrades.push(upgrades[i]);
	  }
	  return filteredUpgrades;
	};

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 173 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {
	/**
	 * Module requirements.
	 */

	var Polling = __webpack_require__(70);
	var inherit = __webpack_require__(17);

	/**
	 * Module exports.
	 */

	module.exports = JSONPPolling;

	/**
	 * Cached regular expressions.
	 */

	var rNewline = /\n/g;
	var rEscapedNewline = /\\n/g;

	/**
	 * Global JSONP callbacks.
	 */

	var callbacks;

	/**
	 * Callbacks count.
	 */

	var index = 0;

	/**
	 * Noop.
	 */

	function empty () { }

	/**
	 * JSONP Polling constructor.
	 *
	 * @param {Object} opts.
	 * @api public
	 */

	function JSONPPolling (opts) {
	  Polling.call(this, opts);

	  this.query = this.query || {};

	  // define global callbacks array if not present
	  // we do this here (lazily) to avoid unneeded global pollution
	  if (!callbacks) {
	    // we need to consider multiple engines in the same page
	    if (!global.___eio) global.___eio = [];
	    callbacks = global.___eio;
	  }

	  // callback identifier
	  this.index = callbacks.length;

	  // add callback to jsonp global
	  var self = this;
	  callbacks.push(function (msg) {
	    self.onData(msg);
	  });

	  // append to query string
	  this.query.j = this.index;

	  // prevent spurious errors from being emitted when the window is unloaded
	  if (global.document && global.addEventListener) {
	    global.addEventListener('beforeunload', function () {
	      if (self.script) self.script.onerror = empty;
	    }, false);
	  }
	}

	/**
	 * Inherits from Polling.
	 */

	inherit(JSONPPolling, Polling);

	/*
	 * JSONP only supports binary as base64 encoded strings
	 */

	JSONPPolling.prototype.supportsBinary = false;

	/**
	 * Closes the socket.
	 *
	 * @api private
	 */

	JSONPPolling.prototype.doClose = function () {
	  if (this.script) {
	    this.script.parentNode.removeChild(this.script);
	    this.script = null;
	  }

	  if (this.form) {
	    this.form.parentNode.removeChild(this.form);
	    this.form = null;
	    this.iframe = null;
	  }

	  Polling.prototype.doClose.call(this);
	};

	/**
	 * Starts a poll cycle.
	 *
	 * @api private
	 */

	JSONPPolling.prototype.doPoll = function () {
	  var self = this;
	  var script = document.createElement('script');

	  if (this.script) {
	    this.script.parentNode.removeChild(this.script);
	    this.script = null;
	  }

	  script.async = true;
	  script.src = this.uri();
	  script.onerror = function(e){
	    self.onError('jsonp poll error',e);
	  };

	  var insertAt = document.getElementsByTagName('script')[0];
	  if (insertAt) {
	    insertAt.parentNode.insertBefore(script, insertAt);
	  }
	  else {
	    (document.head || document.body).appendChild(script);
	  }
	  this.script = script;

	  var isUAgecko = 'undefined' != typeof navigator && /gecko/i.test(navigator.userAgent);
	  
	  if (isUAgecko) {
	    setTimeout(function () {
	      var iframe = document.createElement('iframe');
	      document.body.appendChild(iframe);
	      document.body.removeChild(iframe);
	    }, 100);
	  }
	};

	/**
	 * Writes with a hidden iframe.
	 *
	 * @param {String} data to send
	 * @param {Function} called upon flush.
	 * @api private
	 */

	JSONPPolling.prototype.doWrite = function (data, fn) {
	  var self = this;

	  if (!this.form) {
	    var form = document.createElement('form');
	    var area = document.createElement('textarea');
	    var id = this.iframeId = 'eio_iframe_' + this.index;
	    var iframe;

	    form.className = 'socketio';
	    form.style.position = 'absolute';
	    form.style.top = '-1000px';
	    form.style.left = '-1000px';
	    form.target = id;
	    form.method = 'POST';
	    form.setAttribute('accept-charset', 'utf-8');
	    area.name = 'd';
	    form.appendChild(area);
	    document.body.appendChild(form);

	    this.form = form;
	    this.area = area;
	  }

	  this.form.action = this.uri();

	  function complete () {
	    initIframe();
	    fn();
	  }

	  function initIframe () {
	    if (self.iframe) {
	      try {
	        self.form.removeChild(self.iframe);
	      } catch (e) {
	        self.onError('jsonp polling iframe removal error', e);
	      }
	    }

	    try {
	      // ie6 dynamic iframes with target="" support (thanks Chris Lambacher)
	      var html = '<iframe src="javascript:0" name="'+ self.iframeId +'">';
	      iframe = document.createElement(html);
	    } catch (e) {
	      iframe = document.createElement('iframe');
	      iframe.name = self.iframeId;
	      iframe.src = 'javascript:0';
	    }

	    iframe.id = self.iframeId;

	    self.form.appendChild(iframe);
	    self.iframe = iframe;
	  }

	  initIframe();

	  // escape \n to prevent it from being converted into \r\n by some UAs
	  // double escaping is required for escaped new lines because unescaping of new lines can be done safely on server-side
	  data = data.replace(rEscapedNewline, '\\\n');
	  this.area.value = data.replace(rNewline, '\\n');

	  try {
	    this.form.submit();
	  } catch(e) {}

	  if (this.iframe.attachEvent) {
	    this.iframe.onreadystatechange = function(){
	      if (self.iframe.readyState == 'complete') {
	        complete();
	      }
	    };
	  } else {
	    this.iframe.onload = complete;
	  }
	};

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 174 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * Module requirements.
	 */

	var XMLHttpRequest = __webpack_require__(35);
	var Polling = __webpack_require__(70);
	var Emitter = __webpack_require__(36);
	var inherit = __webpack_require__(17);
	var debug = __webpack_require__(3)('engine.io-client:polling-xhr');

	/**
	 * Module exports.
	 */

	module.exports = XHR;
	module.exports.Request = Request;

	/**
	 * Empty function
	 */

	function empty(){}

	/**
	 * XHR Polling constructor.
	 *
	 * @param {Object} opts
	 * @api public
	 */

	function XHR(opts){
	  Polling.call(this, opts);

	  if (global.location) {
	    var isSSL = 'https:' == location.protocol;
	    var port = location.port;

	    // some user agents have empty `location.port`
	    if (!port) {
	      port = isSSL ? 443 : 80;
	    }

	    this.xd = opts.hostname != global.location.hostname ||
	      port != opts.port;
	    this.xs = opts.secure != isSSL;
	  } else {
	    this.extraHeaders = opts.extraHeaders;
	  }
	}

	/**
	 * Inherits from Polling.
	 */

	inherit(XHR, Polling);

	/**
	 * XHR supports binary
	 */

	XHR.prototype.supportsBinary = true;

	/**
	 * Creates a request.
	 *
	 * @param {String} method
	 * @api private
	 */

	XHR.prototype.request = function(opts){
	  opts = opts || {};
	  opts.uri = this.uri();
	  opts.xd = this.xd;
	  opts.xs = this.xs;
	  opts.agent = this.agent || false;
	  opts.supportsBinary = this.supportsBinary;
	  opts.enablesXDR = this.enablesXDR;

	  // SSL options for Node.js client
	  opts.pfx = this.pfx;
	  opts.key = this.key;
	  opts.passphrase = this.passphrase;
	  opts.cert = this.cert;
	  opts.ca = this.ca;
	  opts.ciphers = this.ciphers;
	  opts.rejectUnauthorized = this.rejectUnauthorized;

	  // other options for Node.js client
	  opts.extraHeaders = this.extraHeaders;

	  return new Request(opts);
	};

	/**
	 * Sends data.
	 *
	 * @param {String} data to send.
	 * @param {Function} called upon flush.
	 * @api private
	 */

	XHR.prototype.doWrite = function(data, fn){
	  var isBinary = typeof data !== 'string' && data !== undefined;
	  var req = this.request({ method: 'POST', data: data, isBinary: isBinary });
	  var self = this;
	  req.on('success', fn);
	  req.on('error', function(err){
	    self.onError('xhr post error', err);
	  });
	  this.sendXhr = req;
	};

	/**
	 * Starts a poll cycle.
	 *
	 * @api private
	 */

	XHR.prototype.doPoll = function(){
	  debug('xhr poll');
	  var req = this.request();
	  var self = this;
	  req.on('data', function(data){
	    self.onData(data);
	  });
	  req.on('error', function(err){
	    self.onError('xhr poll error', err);
	  });
	  this.pollXhr = req;
	};

	/**
	 * Request constructor
	 *
	 * @param {Object} options
	 * @api public
	 */

	function Request(opts){
	  this.method = opts.method || 'GET';
	  this.uri = opts.uri;
	  this.xd = !!opts.xd;
	  this.xs = !!opts.xs;
	  this.async = false !== opts.async;
	  this.data = undefined != opts.data ? opts.data : null;
	  this.agent = opts.agent;
	  this.isBinary = opts.isBinary;
	  this.supportsBinary = opts.supportsBinary;
	  this.enablesXDR = opts.enablesXDR;

	  // SSL options for Node.js client
	  this.pfx = opts.pfx;
	  this.key = opts.key;
	  this.passphrase = opts.passphrase;
	  this.cert = opts.cert;
	  this.ca = opts.ca;
	  this.ciphers = opts.ciphers;
	  this.rejectUnauthorized = opts.rejectUnauthorized;

	  // other options for Node.js client
	  this.extraHeaders = opts.extraHeaders;

	  this.create();
	}

	/**
	 * Mix in `Emitter`.
	 */

	Emitter(Request.prototype);

	/**
	 * Creates the XHR object and sends the request.
	 *
	 * @api private
	 */

	Request.prototype.create = function(){
	  var opts = { agent: this.agent, xdomain: this.xd, xscheme: this.xs, enablesXDR: this.enablesXDR };

	  // SSL options for Node.js client
	  opts.pfx = this.pfx;
	  opts.key = this.key;
	  opts.passphrase = this.passphrase;
	  opts.cert = this.cert;
	  opts.ca = this.ca;
	  opts.ciphers = this.ciphers;
	  opts.rejectUnauthorized = this.rejectUnauthorized;

	  var xhr = this.xhr = new XMLHttpRequest(opts);
	  var self = this;

	  try {
	    debug('xhr open %s: %s', this.method, this.uri);
	    xhr.open(this.method, this.uri, this.async);
	    try {
	      if (this.extraHeaders) {
	        xhr.setDisableHeaderCheck(true);
	        for (var i in this.extraHeaders) {
	          if (this.extraHeaders.hasOwnProperty(i)) {
	            xhr.setRequestHeader(i, this.extraHeaders[i]);
	          }
	        }
	      }
	    } catch (e) {}
	    if (this.supportsBinary) {
	      // This has to be done after open because Firefox is stupid
	      // http://stackoverflow.com/questions/13216903/get-binary-data-with-xmlhttprequest-in-a-firefox-extension
	      xhr.responseType = 'arraybuffer';
	    }

	    if ('POST' == this.method) {
	      try {
	        if (this.isBinary) {
	          xhr.setRequestHeader('Content-type', 'application/octet-stream');
	        } else {
	          xhr.setRequestHeader('Content-type', 'text/plain;charset=UTF-8');
	        }
	      } catch (e) {}
	    }

	    // ie6 check
	    if ('withCredentials' in xhr) {
	      xhr.withCredentials = true;
	    }

	    if (this.hasXDR()) {
	      xhr.onload = function(){
	        self.onLoad();
	      };
	      xhr.onerror = function(){
	        self.onError(xhr.responseText);
	      };
	    } else {
	      xhr.onreadystatechange = function(){
	        if (4 != xhr.readyState) return;
	        if (200 == xhr.status || 1223 == xhr.status) {
	          self.onLoad();
	        } else {
	          // make sure the `error` event handler that's user-set
	          // does not throw in the same tick and gets caught here
	          setTimeout(function(){
	            self.onError(xhr.status);
	          }, 0);
	        }
	      };
	    }

	    debug('xhr data %s', this.data);
	    xhr.send(this.data);
	  } catch (e) {
	    // Need to defer since .create() is called directly fhrom the constructor
	    // and thus the 'error' event can only be only bound *after* this exception
	    // occurs.  Therefore, also, we cannot throw here at all.
	    setTimeout(function() {
	      self.onError(e);
	    }, 0);
	    return;
	  }

	  if (global.document) {
	    this.index = Request.requestsCount++;
	    Request.requests[this.index] = this;
	  }
	};

	/**
	 * Called upon successful response.
	 *
	 * @api private
	 */

	Request.prototype.onSuccess = function(){
	  this.emit('success');
	  this.cleanup();
	};

	/**
	 * Called if we have data.
	 *
	 * @api private
	 */

	Request.prototype.onData = function(data){
	  this.emit('data', data);
	  this.onSuccess();
	};

	/**
	 * Called upon error.
	 *
	 * @api private
	 */

	Request.prototype.onError = function(err){
	  this.emit('error', err);
	  this.cleanup(true);
	};

	/**
	 * Cleans up house.
	 *
	 * @api private
	 */

	Request.prototype.cleanup = function(fromError){
	  if ('undefined' == typeof this.xhr || null === this.xhr) {
	    return;
	  }
	  // xmlhttprequest
	  if (this.hasXDR()) {
	    this.xhr.onload = this.xhr.onerror = empty;
	  } else {
	    this.xhr.onreadystatechange = empty;
	  }

	  if (fromError) {
	    try {
	      this.xhr.abort();
	    } catch(e) {}
	  }

	  if (global.document) {
	    delete Request.requests[this.index];
	  }

	  this.xhr = null;
	};

	/**
	 * Called upon load.
	 *
	 * @api private
	 */

	Request.prototype.onLoad = function(){
	  var data;
	  try {
	    var contentType;
	    try {
	      contentType = this.xhr.getResponseHeader('Content-Type').split(';')[0];
	    } catch (e) {}
	    if (contentType === 'application/octet-stream') {
	      data = this.xhr.response;
	    } else {
	      if (!this.supportsBinary) {
	        data = this.xhr.responseText;
	      } else {
	        try {
	          data = String.fromCharCode.apply(null, new Uint8Array(this.xhr.response));
	        } catch (e) {
	          var ui8Arr = new Uint8Array(this.xhr.response);
	          var dataArray = [];
	          for (var idx = 0, length = ui8Arr.length; idx < length; idx++) {
	            dataArray.push(ui8Arr[idx]);
	          }

	          data = String.fromCharCode.apply(null, dataArray);
	        }
	      }
	    }
	  } catch (e) {
	    this.onError(e);
	  }
	  if (null != data) {
	    this.onData(data);
	  }
	};

	/**
	 * Check if it has XDomainRequest.
	 *
	 * @api private
	 */

	Request.prototype.hasXDR = function(){
	  return 'undefined' !== typeof global.XDomainRequest && !this.xs && this.enablesXDR;
	};

	/**
	 * Aborts the request.
	 *
	 * @api public
	 */

	Request.prototype.abort = function(){
	  this.cleanup();
	};

	/**
	 * Aborts pending requests when unloading the window. This is needed to prevent
	 * memory leaks (e.g. when using IE) and to ensure that no spurious error is
	 * emitted.
	 */

	if (global.document) {
	  Request.requestsCount = 0;
	  Request.requests = {};
	  if (global.attachEvent) {
	    global.attachEvent('onunload', unloadHandler);
	  } else if (global.addEventListener) {
	    global.addEventListener('beforeunload', unloadHandler, false);
	  }
	}

	function unloadHandler() {
	  for (var i in Request.requests) {
	    if (Request.requests.hasOwnProperty(i)) {
	      Request.requests[i].abort();
	    }
	  }
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 175 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * Module dependencies.
	 */

	var Transport = __webpack_require__(34);
	var parser = __webpack_require__(9);
	var parseqs = __webpack_require__(39);
	var inherit = __webpack_require__(17);
	var yeast = __webpack_require__(83);
	var debug = __webpack_require__(3)('engine.io-client:websocket');
	var BrowserWebSocket = global.WebSocket || global.MozWebSocket;

	/**
	 * Get either the `WebSocket` or `MozWebSocket` globals
	 * in the browser or try to resolve WebSocket-compatible
	 * interface exposed by `ws` for Node-like environment.
	 */

	var WebSocket = BrowserWebSocket;
	if (!WebSocket && typeof window === 'undefined') {
	  try {
	    WebSocket = __webpack_require__(206);
	  } catch (e) { }
	}

	/**
	 * Module exports.
	 */

	module.exports = WS;

	/**
	 * WebSocket transport constructor.
	 *
	 * @api {Object} connection options
	 * @api public
	 */

	function WS(opts){
	  var forceBase64 = (opts && opts.forceBase64);
	  if (forceBase64) {
	    this.supportsBinary = false;
	  }
	  this.perMessageDeflate = opts.perMessageDeflate;
	  Transport.call(this, opts);
	}

	/**
	 * Inherits from Transport.
	 */

	inherit(WS, Transport);

	/**
	 * Transport name.
	 *
	 * @api public
	 */

	WS.prototype.name = 'websocket';

	/*
	 * WebSockets support binary
	 */

	WS.prototype.supportsBinary = true;

	/**
	 * Opens socket.
	 *
	 * @api private
	 */

	WS.prototype.doOpen = function(){
	  if (!this.check()) {
	    // let probe timeout
	    return;
	  }

	  var self = this;
	  var uri = this.uri();
	  var protocols = void(0);
	  var opts = {
	    agent: this.agent,
	    perMessageDeflate: this.perMessageDeflate
	  };

	  // SSL options for Node.js client
	  opts.pfx = this.pfx;
	  opts.key = this.key;
	  opts.passphrase = this.passphrase;
	  opts.cert = this.cert;
	  opts.ca = this.ca;
	  opts.ciphers = this.ciphers;
	  opts.rejectUnauthorized = this.rejectUnauthorized;
	  if (this.extraHeaders) {
	    opts.headers = this.extraHeaders;
	  }

	  this.ws = BrowserWebSocket ? new WebSocket(uri) : new WebSocket(uri, protocols, opts);

	  if (this.ws.binaryType === undefined) {
	    this.supportsBinary = false;
	  }

	  if (this.ws.supports && this.ws.supports.binary) {
	    this.supportsBinary = true;
	    this.ws.binaryType = 'buffer';
	  } else {
	    this.ws.binaryType = 'arraybuffer';
	  }

	  this.addEventListeners();
	};

	/**
	 * Adds event listeners to the socket
	 *
	 * @api private
	 */

	WS.prototype.addEventListeners = function(){
	  var self = this;

	  this.ws.onopen = function(){
	    self.onOpen();
	  };
	  this.ws.onclose = function(){
	    self.onClose();
	  };
	  this.ws.onmessage = function(ev){
	    self.onData(ev.data);
	  };
	  this.ws.onerror = function(e){
	    self.onError('websocket error', e);
	  };
	};

	/**
	 * Override `onData` to use a timer on iOS.
	 * See: https://gist.github.com/mloughran/2052006
	 *
	 * @api private
	 */

	if ('undefined' != typeof navigator
	  && /iPad|iPhone|iPod/i.test(navigator.userAgent)) {
	  WS.prototype.onData = function(data){
	    var self = this;
	    setTimeout(function(){
	      Transport.prototype.onData.call(self, data);
	    }, 0);
	  };
	}

	/**
	 * Writes data to socket.
	 *
	 * @param {Array} array of packets.
	 * @api private
	 */

	WS.prototype.write = function(packets){
	  var self = this;
	  this.writable = false;

	  // encodePacket efficient as it uses WS framing
	  // no need for encodePayload
	  var total = packets.length;
	  for (var i = 0, l = total; i < l; i++) {
	    (function(packet) {
	      parser.encodePacket(packet, self.supportsBinary, function(data) {
	        if (!BrowserWebSocket) {
	          // always create a new object (GH-437)
	          var opts = {};
	          if (packet.options) {
	            opts.compress = packet.options.compress;
	          }

	          if (self.perMessageDeflate) {
	            var len = 'string' == typeof data ? global.Buffer.byteLength(data) : data.length;
	            if (len < self.perMessageDeflate.threshold) {
	              opts.compress = false;
	            }
	          }
	        }

	        //Sometimes the websocket has already been closed but the browser didn't
	        //have a chance of informing us about it yet, in that case send will
	        //throw an error
	        try {
	          if (BrowserWebSocket) {
	            // TypeError is thrown when passing the second argument on Safari
	            self.ws.send(data);
	          } else {
	            self.ws.send(data, opts);
	          }
	        } catch (e){
	          debug('websocket closed before onclose event');
	        }

	        --total || done();
	      });
	    })(packets[i]);
	  }

	  function done(){
	    self.emit('flush');

	    // fake drain
	    // defer to next tick to allow Socket to clear writeBuffer
	    setTimeout(function(){
	      self.writable = true;
	      self.emit('drain');
	    }, 0);
	  }
	};

	/**
	 * Called upon close
	 *
	 * @api private
	 */

	WS.prototype.onClose = function(){
	  Transport.prototype.onClose.call(this);
	};

	/**
	 * Closes socket.
	 *
	 * @api private
	 */

	WS.prototype.doClose = function(){
	  if (typeof this.ws !== 'undefined') {
	    this.ws.close();
	  }
	};

	/**
	 * Generates uri for connection.
	 *
	 * @api private
	 */

	WS.prototype.uri = function(){
	  var query = this.query || {};
	  var schema = this.secure ? 'wss' : 'ws';
	  var port = '';

	  // avoid port if default for schema
	  if (this.port && (('wss' == schema && this.port != 443)
	    || ('ws' == schema && this.port != 80))) {
	    port = ':' + this.port;
	  }

	  // append timestamp to URI
	  if (this.timestampRequests) {
	    query[this.timestampParam] = yeast();
	  }

	  // communicate binary support capabilities
	  if (!this.supportsBinary) {
	    query.b64 = 1;
	  }

	  query = parseqs.encode(query);

	  // prepend ? to query
	  if (query.length) {
	    query = '?' + query;
	  }

	  var ipv6 = this.hostname.indexOf(':') !== -1;
	  return schema + '://' + (ipv6 ? '[' + this.hostname + ']' : this.hostname) + port + this.path + query;
	};

	/**
	 * Feature detection for WebSocket.
	 *
	 * @return {Boolean} whether this transport is available.
	 * @api public
	 */

	WS.prototype.check = function(){
	  return !!WebSocket && !('__initialize' in WebSocket && this.name === WS.prototype.name);
	};

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 176 */
/***/ function(module, exports) {

	
	/**
	 * Gets the keys for an object.
	 *
	 * @return {Array} keys
	 * @api private
	 */

	module.exports = Object.keys || function keys (obj){
	  var arr = [];
	  var has = Object.prototype.hasOwnProperty;

	  for (var i in obj) {
	    if (has.call(obj, i)) {
	      arr.push(i);
	    }
	  }
	  return arr;
	};


/***/ },
/* 177 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {
	/*
	 * Module requirements.
	 */

	var isArray = __webpack_require__(178);

	/**
	 * Module exports.
	 */

	module.exports = hasBinary;

	/**
	 * Checks for binary data.
	 *
	 * Right now only Buffer and ArrayBuffer are supported..
	 *
	 * @param {Object} anything
	 * @api public
	 */

	function hasBinary(data) {

	  function _hasBinary(obj) {
	    if (!obj) return false;

	    if ( (global.Buffer && global.Buffer.isBuffer(obj)) ||
	         (global.ArrayBuffer && obj instanceof ArrayBuffer) ||
	         (global.Blob && obj instanceof Blob) ||
	         (global.File && obj instanceof File)
	        ) {
	      return true;
	    }

	    if (isArray(obj)) {
	      for (var i = 0; i < obj.length; i++) {
	          if (_hasBinary(obj[i])) {
	              return true;
	          }
	      }
	    } else if (obj && 'object' == typeof obj) {
	      if (obj.toJSON) {
	        obj = obj.toJSON();
	      }

	      for (var key in obj) {
	        if (Object.prototype.hasOwnProperty.call(obj, key) && _hasBinary(obj[key])) {
	          return true;
	        }
	      }
	    }

	    return false;
	  }

	  return _hasBinary(data);
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 178 */
/***/ function(module, exports) {

	module.exports = Array.isArray || function (arr) {
	  return Object.prototype.toString.call(arr) == '[object Array]';
	};


/***/ },
/* 179 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {
	/*
	 * Module requirements.
	 */

	var isArray = __webpack_require__(180);

	/**
	 * Module exports.
	 */

	module.exports = hasBinary;

	/**
	 * Checks for binary data.
	 *
	 * Right now only Buffer and ArrayBuffer are supported..
	 *
	 * @param {Object} anything
	 * @api public
	 */

	function hasBinary(data) {

	  function _hasBinary(obj) {
	    if (!obj) return false;

	    if ( (global.Buffer && global.Buffer.isBuffer && global.Buffer.isBuffer(obj)) ||
	         (global.ArrayBuffer && obj instanceof ArrayBuffer) ||
	         (global.Blob && obj instanceof Blob) ||
	         (global.File && obj instanceof File)
	        ) {
	      return true;
	    }

	    if (isArray(obj)) {
	      for (var i = 0; i < obj.length; i++) {
	          if (_hasBinary(obj[i])) {
	              return true;
	          }
	      }
	    } else if (obj && 'object' == typeof obj) {
	      // see: https://github.com/Automattic/has-binary/pull/4
	      if (obj.toJSON && 'function' == typeof obj.toJSON) {
	        obj = obj.toJSON();
	      }

	      for (var key in obj) {
	        if (Object.prototype.hasOwnProperty.call(obj, key) && _hasBinary(obj[key])) {
	          return true;
	        }
	      }
	    }

	    return false;
	  }

	  return _hasBinary(data);
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 180 */
/***/ function(module, exports) {

	module.exports = Array.isArray || function (arr) {
	  return Object.prototype.toString.call(arr) == '[object Array]';
	};


/***/ },
/* 181 */
/***/ function(module, exports) {

	
	/**
	 * Module exports.
	 *
	 * Logic borrowed from Modernizr:
	 *
	 *   - https://github.com/Modernizr/Modernizr/blob/master/feature-detects/cors.js
	 */

	try {
	  module.exports = typeof XMLHttpRequest !== 'undefined' &&
	    'withCredentials' in new XMLHttpRequest();
	} catch (err) {
	  // if XMLHttp support is disabled in IE then it will throw
	  // when trying to create
	  module.exports = false;
	}


/***/ },
/* 182 */
/***/ 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
	}


/***/ },
/* 183 */
/***/ 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
	  }
	}


/***/ },
/* 184 */
/***/ function(module, exports) {

	var toString = {}.toString;

	module.exports = Array.isArray || function (arr) {
	  return toString.call(arr) == '[object Array]';
	};


/***/ },
/* 185 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(module, global) {var __WEBPACK_AMD_DEFINE_RESULT__;/*! JSON v3.3.2 | http://bestiejs.github.io/json3 | Copyright 2012-2014, Kit Cambridge | http://kit.mit-license.org */
	;(function () {
	  // Detect the `define` function exposed by asynchronous module loaders. The
	  // strict `define` check is necessary for compatibility with `r.js`.
	  var isLoader = "function" === "function" && __webpack_require__(205);

	  // A set of types used to distinguish objects from primitives.
	  var objectTypes = {
	    "function": true,
	    "object": true
	  };

	  // Detect the `exports` object exposed by CommonJS implementations.
	  var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;

	  // Use the `global` object exposed by Node (including Browserify via
	  // `insert-module-globals`), Narwhal, and Ringo as the default context,
	  // and the `window` object in browsers. Rhino exports a `global` function
	  // instead.
	  var root = objectTypes[typeof window] && window || this,
	      freeGlobal = freeExports && objectTypes[typeof module] && module && !module.nodeType && typeof global == "object" && global;

	  if (freeGlobal && (freeGlobal["global"] === freeGlobal || freeGlobal["window"] === freeGlobal || freeGlobal["self"] === freeGlobal)) {
	    root = freeGlobal;
	  }

	  // Public: Initializes JSON 3 using the given `context` object, attaching the
	  // `stringify` and `parse` functions to the specified `exports` object.
	  function runInContext(context, exports) {
	    context || (context = root["Object"]());
	    exports || (exports = root["Object"]());

	    // Native constructor aliases.
	    var Number = context["Number"] || root["Number"],
	        String = context["String"] || root["String"],
	        Object = context["Object"] || root["Object"],
	        Date = context["Date"] || root["Date"],
	        SyntaxError = context["SyntaxError"] || root["SyntaxError"],
	        TypeError = context["TypeError"] || root["TypeError"],
	        Math = context["Math"] || root["Math"],
	        nativeJSON = context["JSON"] || root["JSON"];

	    // Delegate to the native `stringify` and `parse` implementations.
	    if (typeof nativeJSON == "object" && nativeJSON) {
	      exports.stringify = nativeJSON.stringify;
	      exports.parse = nativeJSON.parse;
	    }

	    // Convenience aliases.
	    var objectProto = Object.prototype,
	        getClass = objectProto.toString,
	        isProperty, forEach, undef;

	    // Test the `Date#getUTC*` methods. Based on work by @Yaffle.
	    var isExtended = new Date(-3509827334573292);
	    try {
	      // The `getUTCFullYear`, `Month`, and `Date` methods return nonsensical
	      // results for certain dates in Opera >= 10.53.
	      isExtended = isExtended.getUTCFullYear() == -109252 && isExtended.getUTCMonth() === 0 && isExtended.getUTCDate() === 1 &&
	        // Safari < 2.0.2 stores the internal millisecond time value correctly,
	        // but clips the values returned by the date methods to the range of
	        // signed 32-bit integers ([-2 ** 31, 2 ** 31 - 1]).
	        isExtended.getUTCHours() == 10 && isExtended.getUTCMinutes() == 37 && isExtended.getUTCSeconds() == 6 && isExtended.getUTCMilliseconds() == 708;
	    } catch (exception) {}

	    // Internal: Determines whether the native `JSON.stringify` and `parse`
	    // implementations are spec-compliant. Based on work by Ken Snyder.
	    function has(name) {
	      if (has[name] !== undef) {
	        // Return cached feature test result.
	        return has[name];
	      }
	      var isSupported;
	      if (name == "bug-string-char-index") {
	        // IE <= 7 doesn't support accessing string characters using square
	        // bracket notation. IE 8 only supports this for primitives.
	        isSupported = "a"[0] != "a";
	      } else if (name == "json") {
	        // Indicates whether both `JSON.stringify` and `JSON.parse` are
	        // supported.
	        isSupported = has("json-stringify") && has("json-parse");
	      } else {
	        var value, serialized = '{"a":[1,true,false,null,"\\u0000\\b\\n\\f\\r\\t"]}';
	        // Test `JSON.stringify`.
	        if (name == "json-stringify") {
	          var stringify = exports.stringify, stringifySupported = typeof stringify == "function" && isExtended;
	          if (stringifySupported) {
	            // A test function object with a custom `toJSON` method.
	            (value = function () {
	              return 1;
	            }).toJSON = value;
	            try {
	              stringifySupported =
	                // Firefox 3.1b1 and b2 serialize string, number, and boolean
	                // primitives as object literals.
	                stringify(0) === "0" &&
	                // FF 3.1b1, b2, and JSON 2 serialize wrapped primitives as object
	                // literals.
	                stringify(new Number()) === "0" &&
	                stringify(new String()) == '""' &&
	                // FF 3.1b1, 2 throw an error if the value is `null`, `undefined`, or
	                // does not define a canonical JSON representation (this applies to
	                // objects with `toJSON` properties as well, *unless* they are nested
	                // within an object or array).
	                stringify(getClass) === undef &&
	                // IE 8 serializes `undefined` as `"undefined"`. Safari <= 5.1.7 and
	                // FF 3.1b3 pass this test.
	                stringify(undef) === undef &&
	                // Safari <= 5.1.7 and FF 3.1b3 throw `Error`s and `TypeError`s,
	                // respectively, if the value is omitted entirely.
	                stringify() === undef &&
	                // FF 3.1b1, 2 throw an error if the given value is not a number,
	                // string, array, object, Boolean, or `null` literal. This applies to
	                // objects with custom `toJSON` methods as well, unless they are nested
	                // inside object or array literals. YUI 3.0.0b1 ignores custom `toJSON`
	                // methods entirely.
	                stringify(value) === "1" &&
	                stringify([value]) == "[1]" &&
	                // Prototype <= 1.6.1 serializes `[undefined]` as `"[]"` instead of
	                // `"[null]"`.
	                stringify([undef]) == "[null]" &&
	                // YUI 3.0.0b1 fails to serialize `null` literals.
	                stringify(null) == "null" &&
	                // FF 3.1b1, 2 halts serialization if an array contains a function:
	                // `[1, true, getClass, 1]` serializes as "[1,true,],". FF 3.1b3
	                // elides non-JSON values from objects and arrays, unless they
	                // define custom `toJSON` methods.
	                stringify([undef, getClass, null]) == "[null,null,null]" &&
	                // Simple serialization test. FF 3.1b1 uses Unicode escape sequences
	                // where character escape codes are expected (e.g., `\b` => `\u0008`).
	                stringify({ "a": [value, true, false, null, "\x00\b\n\f\r\t"] }) == serialized &&
	                // FF 3.1b1 and b2 ignore the `filter` and `width` arguments.
	                stringify(null, value) === "1" &&
	                stringify([1, 2], null, 1) == "[\n 1,\n 2\n]" &&
	                // JSON 2, Prototype <= 1.7, and older WebKit builds incorrectly
	                // serialize extended years.
	                stringify(new Date(-8.64e15)) == '"-271821-04-20T00:00:00.000Z"' &&
	                // The milliseconds are optional in ES 5, but required in 5.1.
	                stringify(new Date(8.64e15)) == '"+275760-09-13T00:00:00.000Z"' &&
	                // Firefox <= 11.0 incorrectly serializes years prior to 0 as negative
	                // four-digit years instead of six-digit years. Credits: @Yaffle.
	                stringify(new Date(-621987552e5)) == '"-000001-01-01T00:00:00.000Z"' &&
	                // Safari <= 5.1.5 and Opera >= 10.53 incorrectly serialize millisecond
	                // values less than 1000. Credits: @Yaffle.
	                stringify(new Date(-1)) == '"1969-12-31T23:59:59.999Z"';
	            } catch (exception) {
	              stringifySupported = false;
	            }
	          }
	          isSupported = stringifySupported;
	        }
	        // Test `JSON.parse`.
	        if (name == "json-parse") {
	          var parse = exports.parse;
	          if (typeof parse == "function") {
	            try {
	              // FF 3.1b1, b2 will throw an exception if a bare literal is provided.
	              // Conforming implementations should also coerce the initial argument to
	              // a string prior to parsing.
	              if (parse("0") === 0 && !parse(false)) {
	                // Simple parsing test.
	                value = parse(serialized);
	                var parseSupported = value["a"].length == 5 && value["a"][0] === 1;
	                if (parseSupported) {
	                  try {
	                    // Safari <= 5.1.2 and FF 3.1b1 allow unescaped tabs in strings.
	                    parseSupported = !parse('"\t"');
	                  } catch (exception) {}
	                  if (parseSupported) {
	                    try {
	                      // FF 4.0 and 4.0.1 allow leading `+` signs and leading
	                      // decimal points. FF 4.0, 4.0.1, and IE 9-10 also allow
	                      // certain octal literals.
	                      parseSupported = parse("01") !== 1;
	                    } catch (exception) {}
	                  }
	                  if (parseSupported) {
	                    try {
	                      // FF 4.0, 4.0.1, and Rhino 1.7R3-R4 allow trailing decimal
	                      // points. These environments, along with FF 3.1b1 and 2,
	                      // also allow trailing commas in JSON objects and arrays.
	                      parseSupported = parse("1.") !== 1;
	                    } catch (exception) {}
	                  }
	                }
	              }
	            } catch (exception) {
	              parseSupported = false;
	            }
	          }
	          isSupported = parseSupported;
	        }
	      }
	      return has[name] = !!isSupported;
	    }

	    if (!has("json")) {
	      // Common `[[Class]]` name aliases.
	      var functionClass = "[object Function]",
	          dateClass = "[object Date]",
	          numberClass = "[object Number]",
	          stringClass = "[object String]",
	          arrayClass = "[object Array]",
	          booleanClass = "[object Boolean]";

	      // Detect incomplete support for accessing string characters by index.
	      var charIndexBuggy = has("bug-string-char-index");

	      // Define additional utility methods if the `Date` methods are buggy.
	      if (!isExtended) {
	        var floor = Math.floor;
	        // A mapping between the months of the year and the number of days between
	        // January 1st and the first of the respective month.
	        var Months = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334];
	        // Internal: Calculates the number of days between the Unix epoch and the
	        // first day of the given month.
	        var getDay = function (year, month) {
	          return Months[month] + 365 * (year - 1970) + floor((year - 1969 + (month = +(month > 1))) / 4) - floor((year - 1901 + month) / 100) + floor((year - 1601 + month) / 400);
	        };
	      }

	      // Internal: Determines if a property is a direct property of the given
	      // object. Delegates to the native `Object#hasOwnProperty` method.
	      if (!(isProperty = objectProto.hasOwnProperty)) {
	        isProperty = function (property) {
	          var members = {}, constructor;
	          if ((members.__proto__ = null, members.__proto__ = {
	            // The *proto* property cannot be set multiple times in recent
	            // versions of Firefox and SeaMonkey.
	            "toString": 1
	          }, members).toString != getClass) {
	            // Safari <= 2.0.3 doesn't implement `Object#hasOwnProperty`, but
	            // supports the mutable *proto* property.
	            isProperty = function (property) {
	              // Capture and break the object's prototype chain (see section 8.6.2
	              // of the ES 5.1 spec). The parenthesized expression prevents an
	              // unsafe transformation by the Closure Compiler.
	              var original = this.__proto__, result = property in (this.__proto__ = null, this);
	              // Restore the original prototype chain.
	              this.__proto__ = original;
	              return result;
	            };
	          } else {
	            // Capture a reference to the top-level `Object` constructor.
	            constructor = members.constructor;
	            // Use the `constructor` property to simulate `Object#hasOwnProperty` in
	            // other environments.
	            isProperty = function (property) {
	              var parent = (this.constructor || constructor).prototype;
	              return property in this && !(property in parent && this[property] === parent[property]);
	            };
	          }
	          members = null;
	          return isProperty.call(this, property);
	        };
	      }

	      // Internal: Normalizes the `for...in` iteration algorithm across
	      // environments. Each enumerated key is yielded to a `callback` function.
	      forEach = function (object, callback) {
	        var size = 0, Properties, members, property;

	        // Tests for bugs in the current environment's `for...in` algorithm. The
	        // `valueOf` property inherits the non-enumerable flag from
	        // `Object.prototype` in older versions of IE, Netscape, and Mozilla.
	        (Properties = function () {
	          this.valueOf = 0;
	        }).prototype.valueOf = 0;

	        // Iterate over a new instance of the `Properties` class.
	        members = new Properties();
	        for (property in members) {
	          // Ignore all properties inherited from `Object.prototype`.
	          if (isProperty.call(members, property)) {
	            size++;
	          }
	        }
	        Properties = members = null;

	        // Normalize the iteration algorithm.
	        if (!size) {
	          // A list of non-enumerable properties inherited from `Object.prototype`.
	          members = ["valueOf", "toString", "toLocaleString", "propertyIsEnumerable", "isPrototypeOf", "hasOwnProperty", "constructor"];
	          // IE <= 8, Mozilla 1.0, and Netscape 6.2 ignore shadowed non-enumerable
	          // properties.
	          forEach = function (object, callback) {
	            var isFunction = getClass.call(object) == functionClass, property, length;
	            var hasProperty = !isFunction && typeof object.constructor != "function" && objectTypes[typeof object.hasOwnProperty] && object.hasOwnProperty || isProperty;
	            for (property in object) {
	              // Gecko <= 1.0 enumerates the `prototype` property of functions under
	              // certain conditions; IE does not.
	              if (!(isFunction && property == "prototype") && hasProperty.call(object, property)) {
	                callback(property);
	              }
	            }
	            // Manually invoke the callback for each non-enumerable property.
	            for (length = members.length; property = members[--length]; hasProperty.call(object, property) && callback(property));
	          };
	        } else if (size == 2) {
	          // Safari <= 2.0.4 enumerates shadowed properties twice.
	          forEach = function (object, callback) {
	            // Create a set of iterated properties.
	            var members = {}, isFunction = getClass.call(object) == functionClass, property;
	            for (property in object) {
	              // Store each property name to prevent double enumeration. The
	              // `prototype` property of functions is not enumerated due to cross-
	              // environment inconsistencies.
	              if (!(isFunction && property == "prototype") && !isProperty.call(members, property) && (members[property] = 1) && isProperty.call(object, property)) {
	                callback(property);
	              }
	            }
	          };
	        } else {
	          // No bugs detected; use the standard `for...in` algorithm.
	          forEach = function (object, callback) {
	            var isFunction = getClass.call(object) == functionClass, property, isConstructor;
	            for (property in object) {
	              if (!(isFunction && property == "prototype") && isProperty.call(object, property) && !(isConstructor = property === "constructor")) {
	                callback(property);
	              }
	            }
	            // Manually invoke the callback for the `constructor` property due to
	            // cross-environment inconsistencies.
	            if (isConstructor || isProperty.call(object, (property = "constructor"))) {
	              callback(property);
	            }
	          };
	        }
	        return forEach(object, callback);
	      };

	      // Public: Serializes a JavaScript `value` as a JSON string. The optional
	      // `filter` argument may specify either a function that alters how object and
	      // array members are serialized, or an array of strings and numbers that
	      // indicates which properties should be serialized. The optional `width`
	      // argument may be either a string or number that specifies the indentation
	      // level of the output.
	      if (!has("json-stringify")) {
	        // Internal: A map of control characters and their escaped equivalents.
	        var Escapes = {
	          92: "\\\\",
	          34: '\\"',
	          8: "\\b",
	          12: "\\f",
	          10: "\\n",
	          13: "\\r",
	          9: "\\t"
	        };

	        // Internal: Converts `value` into a zero-padded string such that its
	        // length is at least equal to `width`. The `width` must be <= 6.
	        var leadingZeroes = "000000";
	        var toPaddedString = function (width, value) {
	          // The `|| 0` expression is necessary to work around a bug in
	          // Opera <= 7.54u2 where `0 == -0`, but `String(-0) !== "0"`.
	          return (leadingZeroes + (value || 0)).slice(-width);
	        };

	        // Internal: Double-quotes a string `value`, replacing all ASCII control
	        // characters (characters with code unit values between 0 and 31) with
	        // their escaped equivalents. This is an implementation of the
	        // `Quote(value)` operation defined in ES 5.1 section 15.12.3.
	        var unicodePrefix = "\\u00";
	        var quote = function (value) {
	          var result = '"', index = 0, length = value.length, useCharIndex = !charIndexBuggy || length > 10;
	          var symbols = useCharIndex && (charIndexBuggy ? value.split("") : value);
	          for (; index < length; index++) {
	            var charCode = value.charCodeAt(index);
	            // If the character is a control character, append its Unicode or
	            // shorthand escape sequence; otherwise, append the character as-is.
	            switch (charCode) {
	              case 8: case 9: case 10: case 12: case 13: case 34: case 92:
	                result += Escapes[charCode];
	                break;
	              default:
	                if (charCode < 32) {
	                  result += unicodePrefix + toPaddedString(2, charCode.toString(16));
	                  break;
	                }
	                result += useCharIndex ? symbols[index] : value.charAt(index);
	            }
	          }
	          return result + '"';
	        };

	        // Internal: Recursively serializes an object. Implements the
	        // `Str(key, holder)`, `JO(value)`, and `JA(value)` operations.
	        var serialize = function (property, object, callback, properties, whitespace, indentation, stack) {
	          var value, className, year, month, date, time, hours, minutes, seconds, milliseconds, results, element, index, length, prefix, result;
	          try {
	            // Necessary for host object support.
	            value = object[property];
	          } catch (exception) {}
	          if (typeof value == "object" && value) {
	            className = getClass.call(value);
	            if (className == dateClass && !isProperty.call(value, "toJSON")) {
	              if (value > -1 / 0 && value < 1 / 0) {
	                // Dates are serialized according to the `Date#toJSON` method
	                // specified in ES 5.1 section 15.9.5.44. See section 15.9.1.15
	                // for the ISO 8601 date time string format.
	                if (getDay) {
	                  // Manually compute the year, month, date, hours, minutes,
	                  // seconds, and milliseconds if the `getUTC*` methods are
	                  // buggy. Adapted from @Yaffle's `date-shim` project.
	                  date = floor(value / 864e5);
	                  for (year = floor(date / 365.2425) + 1970 - 1; getDay(year + 1, 0) <= date; year++);
	                  for (month = floor((date - getDay(year, 0)) / 30.42); getDay(year, month + 1) <= date; month++);
	                  date = 1 + date - getDay(year, month);
	                  // The `time` value specifies the time within the day (see ES
	                  // 5.1 section 15.9.1.2). The formula `(A % B + B) % B` is used
	                  // to compute `A modulo B`, as the `%` operator does not
	                  // correspond to the `modulo` operation for negative numbers.
	                  time = (value % 864e5 + 864e5) % 864e5;
	                  // The hours, minutes, seconds, and milliseconds are obtained by
	                  // decomposing the time within the day. See section 15.9.1.10.
	                  hours = floor(time / 36e5) % 24;
	                  minutes = floor(time / 6e4) % 60;
	                  seconds = floor(time / 1e3) % 60;
	                  milliseconds = time % 1e3;
	                } else {
	                  year = value.getUTCFullYear();
	                  month = value.getUTCMonth();
	                  date = value.getUTCDate();
	                  hours = value.getUTCHours();
	                  minutes = value.getUTCMinutes();
	                  seconds = value.getUTCSeconds();
	                  milliseconds = value.getUTCMilliseconds();
	                }
	                // Serialize extended years correctly.
	                value = (year <= 0 || year >= 1e4 ? (year < 0 ? "-" : "+") + toPaddedString(6, year < 0 ? -year : year) : toPaddedString(4, year)) +
	                  "-" + toPaddedString(2, month + 1) + "-" + toPaddedString(2, date) +
	                  // Months, dates, hours, minutes, and seconds should have two
	                  // digits; milliseconds should have three.
	                  "T" + toPaddedString(2, hours) + ":" + toPaddedString(2, minutes) + ":" + toPaddedString(2, seconds) +
	                  // Milliseconds are optional in ES 5.0, but required in 5.1.
	                  "." + toPaddedString(3, milliseconds) + "Z";
	              } else {
	                value = null;
	              }
	            } else if (typeof value.toJSON == "function" && ((className != numberClass && className != stringClass && className != arrayClass) || isProperty.call(value, "toJSON"))) {
	              // Prototype <= 1.6.1 adds non-standard `toJSON` methods to the
	              // `Number`, `String`, `Date`, and `Array` prototypes. JSON 3
	              // ignores all `toJSON` methods on these objects unless they are
	              // defined directly on an instance.
	              value = value.toJSON(property);
	            }
	          }
	          if (callback) {
	            // If a replacement function was provided, call it to obtain the value
	            // for serialization.
	            value = callback.call(object, property, value);
	          }
	          if (value === null) {
	            return "null";
	          }
	          className = getClass.call(value);
	          if (className == booleanClass) {
	            // Booleans are represented literally.
	            return "" + value;
	          } else if (className == numberClass) {
	            // JSON numbers must be finite. `Infinity` and `NaN` are serialized as
	            // `"null"`.
	            return value > -1 / 0 && value < 1 / 0 ? "" + value : "null";
	          } else if (className == stringClass) {
	            // Strings are double-quoted and escaped.
	            return quote("" + value);
	          }
	          // Recursively serialize objects and arrays.
	          if (typeof value == "object") {
	            // Check for cyclic structures. This is a linear search; performance
	            // is inversely proportional to the number of unique nested objects.
	            for (length = stack.length; length--;) {
	              if (stack[length] === value) {
	                // Cyclic structures cannot be serialized by `JSON.stringify`.
	                throw TypeError();
	              }
	            }
	            // Add the object to the stack of traversed objects.
	            stack.push(value);
	            results = [];
	            // Save the current indentation level and indent one additional level.
	            prefix = indentation;
	            indentation += whitespace;
	            if (className == arrayClass) {
	              // Recursively serialize array elements.
	              for (index = 0, length = value.length; index < length; index++) {
	                element = serialize(index, value, callback, properties, whitespace, indentation, stack);
	                results.push(element === undef ? "null" : element);
	              }
	              result = results.length ? (whitespace ? "[\n" + indentation + results.join(",\n" + indentation) + "\n" + prefix + "]" : ("[" + results.join(",") + "]")) : "[]";
	            } else {
	              // Recursively serialize object members. Members are selected from
	              // either a user-specified list of property names, or the object
	              // itself.
	              forEach(properties || value, function (property) {
	                var element = serialize(property, value, callback, properties, whitespace, indentation, stack);
	                if (element !== undef) {
	                  // According to ES 5.1 section 15.12.3: "If `gap` {whitespace}
	                  // is not the empty string, let `member` {quote(property) + ":"}
	                  // be the concatenation of `member` and the `space` character."
	                  // The "`space` character" refers to the literal space
	                  // character, not the `space` {width} argument provided to
	                  // `JSON.stringify`.
	                  results.push(quote(property) + ":" + (whitespace ? " " : "") + element);
	                }
	              });
	              result = results.length ? (whitespace ? "{\n" + indentation + results.join(",\n" + indentation) + "\n" + prefix + "}" : ("{" + results.join(",") + "}")) : "{}";
	            }
	            // Remove the object from the traversed object stack.
	            stack.pop();
	            return result;
	          }
	        };

	        // Public: `JSON.stringify`. See ES 5.1 section 15.12.3.
	        exports.stringify = function (source, filter, width) {
	          var whitespace, callback, properties, className;
	          if (objectTypes[typeof filter] && filter) {
	            if ((className = getClass.call(filter)) == functionClass) {
	              callback = filter;
	            } else if (className == arrayClass) {
	              // Convert the property names array into a makeshift set.
	              properties = {};
	              for (var index = 0, length = filter.length, value; index < length; value = filter[index++], ((className = getClass.call(value)), className == stringClass || className == numberClass) && (properties[value] = 1));
	            }
	          }
	          if (width) {
	            if ((className = getClass.call(width)) == numberClass) {
	              // Convert the `width` to an integer and create a string containing
	              // `width` number of space characters.
	              if ((width -= width % 1) > 0) {
	                for (whitespace = "", width > 10 && (width = 10); whitespace.length < width; whitespace += " ");
	              }
	            } else if (className == stringClass) {
	              whitespace = width.length <= 10 ? width : width.slice(0, 10);
	            }
	          }
	          // Opera <= 7.54u2 discards the values associated with empty string keys
	          // (`""`) only if they are used directly within an object member list
	          // (e.g., `!("" in { "": 1})`).
	          return serialize("", (value = {}, value[""] = source, value), callback, properties, whitespace, "", []);
	        };
	      }

	      // Public: Parses a JSON source string.
	      if (!has("json-parse")) {
	        var fromCharCode = String.fromCharCode;

	        // Internal: A map of escaped control characters and their unescaped
	        // equivalents.
	        var Unescapes = {
	          92: "\\",
	          34: '"',
	          47: "/",
	          98: "\b",
	          116: "\t",
	          110: "\n",
	          102: "\f",
	          114: "\r"
	        };

	        // Internal: Stores the parser state.
	        var Index, Source;

	        // Internal: Resets the parser state and throws a `SyntaxError`.
	        var abort = function () {
	          Index = Source = null;
	          throw SyntaxError();
	        };

	        // Internal: Returns the next token, or `"$"` if the parser has reached
	        // the end of the source string. A token may be a string, number, `null`
	        // literal, or Boolean literal.
	        var lex = function () {
	          var source = Source, length = source.length, value, begin, position, isSigned, charCode;
	          while (Index < length) {
	            charCode = source.charCodeAt(Index);
	            switch (charCode) {
	              case 9: case 10: case 13: case 32:
	                // Skip whitespace tokens, including tabs, carriage returns, line
	                // feeds, and space characters.
	                Index++;
	                break;
	              case 123: case 125: case 91: case 93: case 58: case 44:
	                // Parse a punctuator token (`{`, `}`, `[`, `]`, `:`, or `,`) at
	                // the current position.
	                value = charIndexBuggy ? source.charAt(Index) : source[Index];
	                Index++;
	                return value;
	              case 34:
	                // `"` delimits a JSON string; advance to the next character and
	                // begin parsing the string. String tokens are prefixed with the
	                // sentinel `@` character to distinguish them from punctuators and
	                // end-of-string tokens.
	                for (value = "@", Index++; Index < length;) {
	                  charCode = source.charCodeAt(Index);
	                  if (charCode < 32) {
	                    // Unescaped ASCII control characters (those with a code unit
	                    // less than the space character) are not permitted.
	                    abort();
	                  } else if (charCode == 92) {
	                    // A reverse solidus (`\`) marks the beginning of an escaped
	                    // control character (including `"`, `\`, and `/`) or Unicode
	                    // escape sequence.
	                    charCode = source.charCodeAt(++Index);
	                    switch (charCode) {
	                      case 92: case 34: case 47: case 98: case 116: case 110: case 102: case 114:
	                        // Revive escaped control characters.
	                        value += Unescapes[charCode];
	                        Index++;
	                        break;
	                      case 117:
	                        // `\u` marks the beginning of a Unicode escape sequence.
	                        // Advance to the first character and validate the
	                        // four-digit code point.
	                        begin = ++Index;
	                        for (position = Index + 4; Index < position; Index++) {
	                          charCode = source.charCodeAt(Index);
	                          // A valid sequence comprises four hexdigits (case-
	                          // insensitive) that form a single hexadecimal value.
	                          if (!(charCode >= 48 && charCode <= 57 || charCode >= 97 && charCode <= 102 || charCode >= 65 && charCode <= 70)) {
	                            // Invalid Unicode escape sequence.
	                            abort();
	                          }
	                        }
	                        // Revive the escaped character.
	                        value += fromCharCode("0x" + source.slice(begin, Index));
	                        break;
	                      default:
	                        // Invalid escape sequence.
	                        abort();
	                    }
	                  } else {
	                    if (charCode == 34) {
	                      // An unescaped double-quote character marks the end of the
	                      // string.
	                      break;
	                    }
	                    charCode = source.charCodeAt(Index);
	                    begin = Index;
	                    // Optimize for the common case where a string is valid.
	                    while (charCode >= 32 && charCode != 92 && charCode != 34) {
	                      charCode = source.charCodeAt(++Index);
	                    }
	                    // Append the string as-is.
	                    value += source.slice(begin, Index);
	                  }
	                }
	                if (source.charCodeAt(Index) == 34) {
	                  // Advance to the next character and return the revived string.
	                  Index++;
	                  return value;
	                }
	                // Unterminated string.
	                abort();
	              default:
	                // Parse numbers and literals.
	                begin = Index;
	                // Advance past the negative sign, if one is specified.
	                if (charCode == 45) {
	                  isSigned = true;
	                  charCode = source.charCodeAt(++Index);
	                }
	                // Parse an integer or floating-point value.
	                if (charCode >= 48 && charCode <= 57) {
	                  // Leading zeroes are interpreted as octal literals.
	                  if (charCode == 48 && ((charCode = source.charCodeAt(Index + 1)), charCode >= 48 && charCode <= 57)) {
	                    // Illegal octal literal.
	                    abort();
	                  }
	                  isSigned = false;
	                  // Parse the integer component.
	                  for (; Index < length && ((charCode = source.charCodeAt(Index)), charCode >= 48 && charCode <= 57); Index++);
	                  // Floats cannot contain a leading decimal point; however, this
	                  // case is already accounted for by the parser.
	                  if (source.charCodeAt(Index) == 46) {
	                    position = ++Index;
	                    // Parse the decimal component.
	                    for (; position < length && ((charCode = source.charCodeAt(position)), charCode >= 48 && charCode <= 57); position++);
	                    if (position == Index) {
	                      // Illegal trailing decimal.
	                      abort();
	                    }
	                    Index = position;
	                  }
	                  // Parse exponents. The `e` denoting the exponent is
	                  // case-insensitive.
	                  charCode = source.charCodeAt(Index);
	                  if (charCode == 101 || charCode == 69) {
	                    charCode = source.charCodeAt(++Index);
	                    // Skip past the sign following the exponent, if one is
	                    // specified.
	                    if (charCode == 43 || charCode == 45) {
	                      Index++;
	                    }
	                    // Parse the exponential component.
	                    for (position = Index; position < length && ((charCode = source.charCodeAt(position)), charCode >= 48 && charCode <= 57); position++);
	                    if (position == Index) {
	                      // Illegal empty exponent.
	                      abort();
	                    }
	                    Index = position;
	                  }
	                  // Coerce the parsed value to a JavaScript number.
	                  return +source.slice(begin, Index);
	                }
	                // A negative sign may only precede numbers.
	                if (isSigned) {
	                  abort();
	                }
	                // `true`, `false`, and `null` literals.
	                if (source.slice(Index, Index + 4) == "true") {
	                  Index += 4;
	                  return true;
	                } else if (source.slice(Index, Index + 5) == "false") {
	                  Index += 5;
	                  return false;
	                } else if (source.slice(Index, Index + 4) == "null") {
	                  Index += 4;
	                  return null;
	                }
	                // Unrecognized token.
	                abort();
	            }
	          }
	          // Return the sentinel `$` character if the parser has reached the end
	          // of the source string.
	          return "$";
	        };

	        // Internal: Parses a JSON `value` token.
	        var get = function (value) {
	          var results, hasMembers;
	          if (value == "$") {
	            // Unexpected end of input.
	            abort();
	          }
	          if (typeof value == "string") {
	            if ((charIndexBuggy ? value.charAt(0) : value[0]) == "@") {
	              // Remove the sentinel `@` character.
	              return value.slice(1);
	            }
	            // Parse object and array literals.
	            if (value == "[") {
	              // Parses a JSON array, returning a new JavaScript array.
	              results = [];
	              for (;; hasMembers || (hasMembers = true)) {
	                value = lex();
	                // A closing square bracket marks the end of the array literal.
	                if (value == "]") {
	                  break;
	                }
	                // If the array literal contains elements, the current token
	                // should be a comma separating the previous element from the
	                // next.
	                if (hasMembers) {
	                  if (value == ",") {
	                    value = lex();
	                    if (value == "]") {
	                      // Unexpected trailing `,` in array literal.
	                      abort();
	                    }
	                  } else {
	                    // A `,` must separate each array element.
	                    abort();
	                  }
	                }
	                // Elisions and leading commas are not permitted.
	                if (value == ",") {
	                  abort();
	                }
	                results.push(get(value));
	              }
	              return results;
	            } else if (value == "{") {
	              // Parses a JSON object, returning a new JavaScript object.
	              results = {};
	              for (;; hasMembers || (hasMembers = true)) {
	                value = lex();
	                // A closing curly brace marks the end of the object literal.
	                if (value == "}") {
	                  break;
	                }
	                // If the object literal contains members, the current token
	                // should be a comma separator.
	                if (hasMembers) {
	                  if (value == ",") {
	                    value = lex();
	                    if (value == "}") {
	                      // Unexpected trailing `,` in object literal.
	                      abort();
	                    }
	                  } else {
	                    // A `,` must separate each object member.
	                    abort();
	                  }
	                }
	                // Leading commas are not permitted, object property names must be
	                // double-quoted strings, and a `:` must separate each property
	                // name and value.
	                if (value == "," || typeof value != "string" || (charIndexBuggy ? value.charAt(0) : value[0]) != "@" || lex() != ":") {
	                  abort();
	                }
	                results[value.slice(1)] = get(lex());
	              }
	              return results;
	            }
	            // Unexpected token encountered.
	            abort();
	          }
	          return value;
	        };

	        // Internal: Updates a traversed object member.
	        var update = function (source, property, callback) {
	          var element = walk(source, property, callback);
	          if (element === undef) {
	            delete source[property];
	          } else {
	            source[property] = element;
	          }
	        };

	        // Internal: Recursively traverses a parsed JSON object, invoking the
	        // `callback` function for each value. This is an implementation of the
	        // `Walk(holder, name)` operation defined in ES 5.1 section 15.12.2.
	        var walk = function (source, property, callback) {
	          var value = source[property], length;
	          if (typeof value == "object" && value) {
	            // `forEach` can't be used to traverse an array in Opera <= 8.54
	            // because its `Object#hasOwnProperty` implementation returns `false`
	            // for array indices (e.g., `![1, 2, 3].hasOwnProperty("0")`).
	            if (getClass.call(value) == arrayClass) {
	              for (length = value.length; length--;) {
	                update(value, length, callback);
	              }
	            } else {
	              forEach(value, function (property) {
	                update(value, property, callback);
	              });
	            }
	          }
	          return callback.call(source, property, value);
	        };

	        // Public: `JSON.parse`. See ES 5.1 section 15.12.2.
	        exports.parse = function (source, callback) {
	          var result, value;
	          Index = 0;
	          Source = "" + source;
	          result = get(lex());
	          // If a JSON string contains multiple tokens, it is invalid.
	          if (lex() != "$") {
	            abort();
	          }
	          // Reset the parser state.
	          Index = Source = null;
	          return callback && getClass.call(callback) == functionClass ? walk((value = {}, value[""] = result, value), "", callback) : result;
	        };
	      }
	    }

	    exports["runInContext"] = runInContext;
	    return exports;
	  }

	  if (freeExports && !isLoader) {
	    // Export for CommonJS environments.
	    runInContext(root, freeExports);
	  } else {
	    // Export for web browsers and JavaScript engines.
	    var nativeJSON = root.JSON,
	        previousJSON = root["JSON3"],
	        isRestored = false;

	    var JSON3 = runInContext(root, (root["JSON3"] = {
	      // Public: Restores the original value of the global `JSON` object and
	      // returns a reference to the `JSON3` object.
	      "noConflict": function () {
	        if (!isRestored) {
	          isRestored = true;
	          root.JSON = nativeJSON;
	          root["JSON3"] = previousJSON;
	          nativeJSON = previousJSON = null;
	        }
	        return JSON3;
	      }
	    }));

	    root.JSON = {
	      "parse": JSON3.parse,
	      "stringify": JSON3.stringify
	    };
	  }

	  // Export for asynchronous module loaders.
	  if (isLoader) {
	    !(__WEBPACK_AMD_DEFINE_RESULT__ = function () {
	      return JSON3;
	    }.call(exports, __webpack_require__, exports, module), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
	  }
	}).call(this);

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(41)(module), __webpack_require__(0)))

/***/ },
/* 186 */
/***/ function(module, exports) {

	/**
	 * Helpers.
	 */

	var s = 1000;
	var m = s * 60;
	var h = m * 60;
	var d = h * 24;
	var y = d * 365.25;

	/**
	 * Parse or format the given `val`.
	 *
	 * Options:
	 *
	 *  - `long` verbose formatting [false]
	 *
	 * @param {String|Number} val
	 * @param {Object} options
	 * @return {String|Number}
	 * @api public
	 */

	module.exports = function(val, options){
	  options = options || {};
	  if ('string' == typeof val) return parse(val);
	  return options.long
	    ? long(val)
	    : short(val);
	};

	/**
	 * Parse the given `str` and return milliseconds.
	 *
	 * @param {String} str
	 * @return {Number}
	 * @api private
	 */

	function parse(str) {
	  str = '' + str;
	  if (str.length > 10000) return;
	  var match = /^((?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(str);
	  if (!match) return;
	  var n = parseFloat(match[1]);
	  var type = (match[2] || 'ms').toLowerCase();
	  switch (type) {
	    case 'years':
	    case 'year':
	    case 'yrs':
	    case 'yr':
	    case 'y':
	      return n * y;
	    case 'days':
	    case 'day':
	    case 'd':
	      return n * d;
	    case 'hours':
	    case 'hour':
	    case 'hrs':
	    case 'hr':
	    case 'h':
	      return n * h;
	    case 'minutes':
	    case 'minute':
	    case 'mins':
	    case 'min':
	    case 'm':
	      return n * m;
	    case 'seconds':
	    case 'second':
	    case 'secs':
	    case 'sec':
	    case 's':
	      return n * s;
	    case 'milliseconds':
	    case 'millisecond':
	    case 'msecs':
	    case 'msec':
	    case 'ms':
	      return n;
	  }
	}

	/**
	 * Short format for `ms`.
	 *
	 * @param {Number} ms
	 * @return {String}
	 * @api private
	 */

	function short(ms) {
	  if (ms >= d) return Math.round(ms / d) + 'd';
	  if (ms >= h) return Math.round(ms / h) + 'h';
	  if (ms >= m) return Math.round(ms / m) + 'm';
	  if (ms >= s) return Math.round(ms / s) + 's';
	  return ms + 'ms';
	}

	/**
	 * Long format for `ms`.
	 *
	 * @param {Number} ms
	 * @return {String}
	 * @api private
	 */

	function long(ms) {
	  return plural(ms, d, 'day')
	    || plural(ms, h, 'hour')
	    || plural(ms, m, 'minute')
	    || plural(ms, s, 'second')
	    || ms + ' ms';
	}

	/**
	 * Pluralization helper.
	 */

	function plural(ms, n, name) {
	  if (ms < n) return;
	  if (ms < n * 1.5) return Math.floor(ms / n) + ' ' + name;
	  return Math.ceil(ms / n) + ' ' + name + 's';
	}


/***/ },
/* 187 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const Counter = __webpack_require__(167);

	class CounterIndex {
	  constructor(id) {
	    this._counter = new Counter(id);
	  }

	  get() {
	    return this._counter;
	  }

	  updateIndex(oplog, added) {
	    if(this._counter) {
	      added.filter((f) => f && f.payload.op === 'COUNTER')
	        .map((f) => Counter.from(f.payload.value))
	        .forEach((f) => this._counter.merge(f))
	    }
	  }
	}

	module.exports = CounterIndex;


/***/ },
/* 188 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const Store        = __webpack_require__(38);
	const CounterIndex = __webpack_require__(187);

	class CounterStore extends Store {
	  constructor(ipfs, id, dbname, options) {
	    Object.assign(options || {}, { Index: CounterIndex });
	    super(ipfs, id, dbname, options)
	  }

	  value() {
	    return this._index.get().value;
	  }

	  inc(amount) {
	    const counter = this._index.get();
	    if(counter) {
	      counter.increment(amount);
	      return this._addOperation({
	        op: 'COUNTER',
	        key: null,
	        value: counter.payload,
	        meta: {
	          ts: new Date().getTime()
	        }
	      });
	    }
	  }
	}

	module.exports = CounterStore;


/***/ },
/* 189 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const EventIndex = __webpack_require__(74);

	class FeedIndex extends EventIndex {
	  updateIndex(oplog, added) {
	    added.reduce((handled, item) => {
	      if(handled.indexOf(item.hash) === -1) {
	        handled.push(item.hash);
	        if(item.payload.op === 'ADD') {
	          this._index[item.hash] = item
	        } else if(item.payload.op === 'DEL') {
	          delete this._index[item.payload.value];
	        }
	      }
	      return handled;
	    }, []);
	  }
	}

	module.exports = FeedIndex;


/***/ },
/* 190 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const Lazy       = __webpack_require__(72);
	const EventStore = __webpack_require__(75);
	const FeedIndex  = __webpack_require__(189);

	class FeedStore extends EventStore {
	  constructor(ipfs, id, dbname, options) {
	    Object.assign(options || {}, { Index: FeedIndex });
	    super(ipfs, id, dbname, options)
	  }

	  remove(hash) {
	    const operation = {
	      op: 'DEL',
	      key: null,
	      value: hash,
	      meta: {
	        ts: new Date().getTime()
	      }
	    };
	    return this._addOperation(operation);
	  }
	}

	module.exports = FeedStore;


/***/ },
/* 191 */
/***/ function(module, exports) {

	"use strict";
	'use strict';

	class KeyValueIndex {
	  constructor() {
	    this._index = {};
	  }

	  get(key) {
	    return this._index[key];
	  }

	  updateIndex(oplog, added) {
	    added.reverse().reduce((handled, item) => {
	      if(handled.indexOf(item.payload.key) === -1) {
	        handled.push(item.payload.key);
	        if(item.payload.op === 'PUT') {
	          this._index[item.payload.key] = item.payload.value
	        } else if(item.payload.op === 'DEL') {
	          delete this._index[item.payload.key];
	        }
	      }
	      return handled;
	    }, []);
	  }
	}

	module.exports = KeyValueIndex;


/***/ },
/* 192 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const Store         = __webpack_require__(38);
	const KeyValueIndex = __webpack_require__(191);

	class KeyValueStore extends Store {
	  constructor(ipfs, id, dbname, options) {
	    Object.assign(options || {}, { Index: KeyValueIndex });
	    super(ipfs, id, dbname, options)
	  }

	  get(key) {
	    return this._index.get(key);
	  }

	  set(key, data) {
	    this.put(key, data);
	  }

	  put(key, data) {
	    return this._addOperation({
	      op: 'PUT',
	      key: key,
	      value: data,
	      meta: {
	        ts: new Date().getTime()
	      }
	    });
	  }

	  del(key) {
	    return this._addOperation({
	      op: 'DEL',
	      key: key,
	      value: null,
	      meta: {
	        ts: new Date().getTime()
	      }
	    });
	  }
	}

	module.exports = KeyValueStore;


/***/ },
/* 193 */
/***/ function(module, exports, __webpack_require__) {

	"use strict";
	'use strict';

	const fs   = __webpack_require__(73);
	const path = __webpack_require__(77);

	// const defaultFilepath = path.resolve('./orbit-db-cache.json');
	// let filePath = defaultFilepath;
	let filePath;
	let cache = {};

	class Cache {
	  static set(key, value) {
	    return new Promise((resolve, reject) => {
	      cache[key] = value;
	      if(filePath) {
	        fs.writeFile(filePath, JSON.stringify(cache, null, 2) + "\n", resolve);
	      } else {
	        resolve();
	      }
	    })
	  }

	  static get(key) {
	    return cache[key];
	  }

	  static loadCache(cacheFile) {
	    cache = {};
	    return new Promise((resolve, reject) => {
	      if(cacheFile) {
	        filePath = cacheFile;
	        fs.exists(cacheFile, (res) => {
	          if(res) {
	            cache = JSON.parse(fs.readFileSync(cacheFile));
	            resolve();
	          } else {
	            resolve();
	          }
	        });
	      } else {
	        resolve();
	      }
	    });
	  }

	  static reset() {
	    cache = {};
	  }
	}

	module.exports = Cache;


/***/ },
/* 194 */
/***/ function(module, exports) {

	"use strict";
	'use strict';

	class Index {
	  constructor(id) {
	    this.id = id;
	    this._index = [];
	  }

	  get() {
	    return this._index;
	  }

	  updateIndex(oplog, entries) {
	    this._index = oplog.ops;
	  }
	}

	module.exports = Index;


/***/ },
/* 195 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/**
	 * JSON parse.
	 *
	 * @see Based on jQuery#parseJSON (MIT) and JSON2
	 * @api private
	 */

	var rvalidchars = /^[\],:{}\s]*$/;
	var rvalidescape = /\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g;
	var rvalidtokens = /"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g;
	var rvalidbraces = /(?:^|:|,)(?:\s*\[)+/g;
	var rtrimLeft = /^\s+/;
	var rtrimRight = /\s+$/;

	module.exports = function parsejson(data) {
	  if ('string' != typeof data || !data) {
	    return null;
	  }

	  data = data.replace(rtrimLeft, '').replace(rtrimRight, '');

	  // Attempt to parse using the native JSON parser first
	  if (global.JSON && JSON.parse) {
	    return JSON.parse(data);
	  }

	  if (rvalidchars.test(data.replace(rvalidescape, '@')
	      .replace(rvalidtokens, ']')
	      .replace(rvalidbraces, ''))) {
	    return (new Function('return ' + data))();
	  }
	};
	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 196 */
/***/ 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() {
	    if (!draining || !currentQueue) {
	        return;
	    }
	    draining = false;
	    if (currentQueue.length) {
	        queue = currentQueue.concat(queue);
	    } else {
	        queueIndex = -1;
	    }
	    if (queue.length) {
	        drainQueue();
	    }
	}

	function drainQueue() {
	    if (draining) {
	        return;
	    }
	    var timeout = 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; };


/***/ },
/* 197 */
/***/ function(module, exports, __webpack_require__) {

	
	/**
	 * Module dependencies.
	 */

	var url = __webpack_require__(198);
	var parser = __webpack_require__(40);
	var Manager = __webpack_require__(78);
	var debug = __webpack_require__(3)('socket.io-client');

	/**
	 * Module exports.
	 */

	module.exports = exports = lookup;

	/**
	 * Managers cache.
	 */

	var cache = exports.managers = {};

	/**
	 * Looks up an existing `Manager` for multiplexing.
	 * If the user summons:
	 *
	 *   `io('http://localhost/a');`
	 *   `io('http://localhost/b');`
	 *
	 * We reuse the existing instance based on same scheme/port/host,
	 * and we initialize sockets for each namespace.
	 *
	 * @api public
	 */

	function lookup(uri, opts) {
	  if (typeof uri == 'object') {
	    opts = uri;
	    uri = undefined;
	  }

	  opts = opts || {};

	  var parsed = url(uri);
	  var source = parsed.source;
	  var id = parsed.id;
	  var path = parsed.path;
	  var sameNamespace = cache[id] && path in cache[id].nsps;
	  var newConnection = opts.forceNew || opts['force new connection'] ||
	                      false === opts.multiplex || sameNamespace;

	  var io;

	  if (newConnection) {
	    debug('ignoring socket cache for %s', source);
	    io = Manager(source, opts);
	  } else {
	    if (!cache[id]) {
	      debug('new io instance for %s', source);
	      cache[id] = Manager(source, opts);
	    }
	    io = cache[id];
	  }

	  return io.socket(parsed.path);
	}

	/**
	 * Protocol version.
	 *
	 * @api public
	 */

	exports.protocol = parser.protocol;

	/**
	 * `connect`.
	 *
	 * @param {String} uri
	 * @api public
	 */

	exports.connect = lookup;

	/**
	 * Expose constructors for standalone build.
	 *
	 * @api public
	 */

	exports.Manager = __webpack_require__(78);
	exports.Socket = __webpack_require__(80);


/***/ },
/* 198 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {
	/**
	 * Module dependencies.
	 */

	var parseuri = __webpack_require__(76);
	var debug = __webpack_require__(3)('socket.io-client:url');

	/**
	 * Module exports.
	 */

	module.exports = url;

	/**
	 * URL parser.
	 *
	 * @param {String} url
	 * @param {Object} An object meant to mimic window.location.
	 *                 Defaults to window.location.
	 * @api public
	 */

	function url(uri, loc){
	  var obj = uri;

	  // default to window.location
	  var loc = loc || global.location;
	  if (null == uri) uri = loc.protocol + '//' + loc.host;

	  // relative path support
	  if ('string' == typeof uri) {
	    if ('/' == uri.charAt(0)) {
	      if ('/' == uri.charAt(1)) {
	        uri = loc.protocol + uri;
	      } else {
	        uri = loc.host + uri;
	      }
	    }

	    if (!/^(https?|wss?):\/\//.test(uri)) {
	      debug('protocol-less url %s', uri);
	      if ('undefined' != typeof loc) {
	        uri = loc.protocol + '//' + uri;
	      } else {
	        uri = 'https://' + uri;
	      }
	    }

	    // parse
	    debug('parse %s', uri);
	    obj = parseuri(uri);
	  }

	  // make sure we treat `localhost:80` and `localhost` equally
	  if (!obj.port) {
	    if (/^(http|ws)$/.test(obj.protocol)) {
	      obj.port = '80';
	    }
	    else if (/^(http|ws)s$/.test(obj.protocol)) {
	      obj.port = '443';
	    }
	  }

	  obj.path = obj.path || '/';

	  var ipv6 = obj.host.indexOf(':') !== -1;
	  var host = ipv6 ? '[' + obj.host + ']' : obj.host;

	  // define unique id
	  obj.id = obj.protocol + '://' + host + ':' + obj.port;
	  // define href
	  obj.href = obj.protocol + '://' + host + (loc && loc.port == obj.port ? '' : (':' + obj.port));

	  return obj;
	}

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 199 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(global) {/*global Blob,File*/

	/**
	 * Module requirements
	 */

	var isArray = __webpack_require__(82);
	var isBuf = __webpack_require__(81);

	/**
	 * Replaces every Buffer | ArrayBuffer in packet with a numbered placeholder.
	 * Anything with blobs or files should be fed through removeBlobs before coming
	 * here.
	 *
	 * @param {Object} packet - socket.io event packet
	 * @return {Object} with deconstructed packet and list of buffers
	 * @api public
	 */

	exports.deconstructPacket = function(packet){
	  var buffers = [];
	  var packetData = packet.data;

	  function _deconstructPacket(data) {
	    if (!data) return data;

	    if (isBuf(data)) {
	      var placeholder = { _placeholder: true, num: buffers.length };
	      buffers.push(data);
	      return placeholder;
	    } else if (isArray(data)) {
	      var newData = new Array(data.length);
	      for (var i = 0; i < data.length; i++) {
	        newData[i] = _deconstructPacket(data[i]);
	      }
	      return newData;
	    } else if ('object' == typeof data && !(data instanceof Date)) {
	      var newData = {};
	      for (var key in data) {
	        newData[key] = _deconstructPacket(data[key]);
	      }
	      return newData;
	    }
	    return data;
	  }

	  var pack = packet;
	  pack.data = _deconstructPacket(packetData);
	  pack.attachments = buffers.length; // number of binary 'attachments'
	  return {packet: pack, buffers: buffers};
	};

	/**
	 * Reconstructs a binary packet from its placeholder packet and buffers
	 *
	 * @param {Object} packet - event packet with placeholders
	 * @param {Array} buffers - binary buffers to put in placeholder positions
	 * @return {Object} reconstructed packet
	 * @api public
	 */

	exports.reconstructPacket = function(packet, buffers) {
	  var curPlaceHolder = 0;

	  function _reconstructPacket(data) {
	    if (data && data._placeholder) {
	      var buf = buffers[data.num]; // appropriate buffer (should be natural order anyway)
	      return buf;
	    } else if (isArray(data)) {
	      for (var i = 0; i < data.length; i++) {
	        data[i] = _reconstructPacket(data[i]);
	      }
	      return data;
	    } else if (data && 'object' == typeof data) {
	      for (var key in data) {
	        data[key] = _reconstructPacket(data[key]);
	      }
	      return data;
	    }
	    return data;
	  }

	  packet.data = _reconstructPacket(packet.data);
	  packet.attachments = undefined; // no longer useful
	  return packet;
	};

	/**
	 * Asynchronously removes Blobs or Files from data via
	 * FileReader's readAsArrayBuffer method. Used before encoding
	 * data as msgpack. Calls callback with the blobless data.
	 *
	 * @param {Object} data
	 * @param {Function} callback
	 * @api private
	 */

	exports.removeBlobs = function(data, callback) {
	  function _removeBlobs(obj, curKey, containingObject) {
	    if (!obj) return obj;

	    // convert any blob
	    if ((global.Blob && obj instanceof Blob) ||
	        (global.File && obj instanceof File)) {
	      pendingBlobs++;

	      // async filereader
	      var fileReader = new FileReader();
	      fileReader.onload = function() { // this.result == arraybuffer
	        if (containingObject) {
	          containingObject[curKey] = this.result;
	        }
	        else {
	          bloblessData = this.result;
	        }

	        // if nothing pending its callback time
	        if(! --pendingBlobs) {
	          callback(bloblessData);
	        }
	      };

	      fileReader.readAsArrayBuffer(obj); // blob -> arraybuffer
	    } else if (isArray(obj)) { // handle array
	      for (var i = 0; i < obj.length; i++) {
	        _removeBlobs(obj[i], i, obj);
	      }
	    } else if (obj && 'object' == typeof obj && !isBuf(obj)) { // and object
	      for (var key in obj) {
	        _removeBlobs(obj[key], key, obj);
	      }
	    }
	  }

	  var pendingBlobs = 0;
	  var bloblessData = data;
	  _removeBlobs(bloblessData);
	  if (!pendingBlobs) {
	    callback(bloblessData);
	  }
	};

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0)))

/***/ },
/* 200 */
/***/ function(module, exports) {

	
	/**
	 * Expose `Emitter`.
	 */

	module.exports = Emitter;

	/**
	 * Initialize a new `Emitter`.
	 *
	 * @api public
	 */

	function Emitter(obj) {
	  if (obj) return mixin(obj);
	};

	/**
	 * Mixin the emitter properties.
	 *
	 * @param {Object} obj
	 * @return {Object}
	 * @api private
	 */

	function mixin(obj) {
	  for (var key in Emitter.prototype) {
	    obj[key] = Emitter.prototype[key];
	  }
	  return obj;
	}

	/**
	 * Listen on the given `event` with `fn`.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.on =
	Emitter.prototype.addEventListener = function(event, fn){
	  this._callbacks = this._callbacks || {};
	  (this._callbacks[event] = this._callbacks[event] || [])
	    .push(fn);
	  return this;
	};

	/**
	 * Adds an `event` listener that will be invoked a single
	 * time then automatically removed.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.once = function(event, fn){
	  var self = this;
	  this._callbacks = this._callbacks || {};

	  function on() {
	    self.off(event, on);
	    fn.apply(this, arguments);
	  }

	  on.fn = fn;
	  this.on(event, on);
	  return this;
	};

	/**
	 * Remove the given callback for `event` or all
	 * registered callbacks.
	 *
	 * @param {String} event
	 * @param {Function} fn
	 * @return {Emitter}
	 * @api public
	 */

	Emitter.prototype.off =
	Emitter.prototype.removeListener =
	Emitter.prototype.removeAllListeners =
	Emitter.prototype.removeEventListener = function(event, fn){
	  this._callbacks = this._callbacks || {};

	  // all
	  if (0 == arguments.length) {
	    this._callbacks = {};
	    return this;
	  }

	  // specific event
	  var callbacks = this._callbacks[event];
	  if (!callbacks) return this;

	  // remove all handlers
	  if (1 == arguments.length) {
	    delete this._callbacks[event];
	    return this;
	  }

	  // remove specific handler
	  var cb;
	  for (var i = 0; i < callbacks.length; i++) {
	    cb = callbacks[i];
	    if (cb === fn || cb.fn === fn) {
	      callbacks.splice(i, 1);
	      break;
	    }
	  }
	  return this;
	};

	/**
	 * Emit `event` with the given args.
	 *
	 * @param {String} event
	 * @param {Mixed} ...
	 * @return {Emitter}
	 */

	Emitter.prototype.emit = function(event){
	  this._callbacks = this._callbacks || {};
	  var args = [].slice.call(arguments, 1)
	    , callbacks = this._callbacks[event];

	  if (callbacks) {
	    callbacks = callbacks.slice(0);
	    for (var i = 0, len = callbacks.length; i < len; ++i) {
	      callbacks[i].apply(this, args);
	    }
	  }

	  return this;
	};

	/**
	 * Return array of callbacks for `event`.
	 *
	 * @param {String} event
	 * @return {Array}
	 * @api public
	 */

	Emitter.prototype.listeners = function(event){
	  this._callbacks = this._callbacks || {};
	  return this._callbacks[event] || [];
	};

	/**
	 * Check if this emitter has `event` handlers.
	 *
	 * @param {String} event
	 * @return {Boolean}
	 * @api public
	 */

	Emitter.prototype.hasListeners = function(event){
	  return !! this.listeners(event).length;
	};


/***/ },
/* 201 */
/***/ function(module, exports) {

	module.exports = toArray

	function toArray(list, index) {
	    var array = []

	    index = index || 0

	    for (var i = index || 0; i < list.length; i++) {
	        array[i - index] = list[i]
	    }

	    return array
	}


/***/ },
/* 202 */
/***/ function(module, exports, __webpack_require__) {

	/* WEBPACK VAR INJECTION */(function(module, global) {var __WEBPACK_AMD_DEFINE_RESULT__;/*! https://mths.be/utf8js v2.0.0 by @mathias */
	;(function(root) {

		// Detect free variables `exports`
		var freeExports = typeof exports == 'object' && exports;

		// Detect free variable `module`
		var freeModule = typeof module == 'object' && module &&
			module.exports == freeExports && module;

		// Detect free variable `global`, from Node.js or Browserified code,
		// and use it as `root`
		var freeGlobal = typeof global == 'object' && global;
		if (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal) {
			root = freeGlobal;
		}

		/*--------------------------------------------------------------------------*/

		var stringFromCharCode = String.fromCharCode;

		// Taken from https://mths.be/punycode
		function ucs2decode(string) {
			var output = [];
			var counter = 0;
			var length = string.length;
			var value;
			var extra;
			while (counter < length) {
				value = string.charCodeAt(counter++);
				if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
					// high surrogate, and there is a next character
					extra = string.charCodeAt(counter++);
					if ((extra & 0xFC00) == 0xDC00) { // low surrogate
						output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
					} else {
						// unmatched surrogate; only append this code unit, in case the next
						// code unit is the high surrogate of a surrogate pair
						output.push(value);
						counter--;
					}
				} else {
					output.push(value);
				}
			}
			return output;
		}

		// Taken from https://mths.be/punycode
		function ucs2encode(array) {
			var length = array.length;
			var index = -1;
			var value;
			var output = '';
			while (++index < length) {
				value = array[index];
				if (value > 0xFFFF) {
					value -= 0x10000;
					output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);
					value = 0xDC00 | value & 0x3FF;
				}
				output += stringFromCharCode(value);
			}
			return output;
		}

		function checkScalarValue(codePoint) {
			if (codePoint >= 0xD800 && codePoint <= 0xDFFF) {
				throw Error(
					'Lone surrogate U+' + codePoint.toString(16).toUpperCase() +
					' is not a scalar value'
				);
			}
		}
		/*--------------------------------------------------------------------------*/

		function createByte(codePoint, shift) {
			return stringFromCharCode(((codePoint >> shift) & 0x3F) | 0x80);
		}

		function encodeCodePoint(codePoint) {
			if ((codePoint & 0xFFFFFF80) == 0) { // 1-byte sequence
				return stringFromCharCode(codePoint);
			}
			var symbol = '';
			if ((codePoint & 0xFFFFF800) == 0) { // 2-byte sequence
				symbol = stringFromCharCode(((codePoint >> 6) & 0x1F) | 0xC0);
			}
			else if ((codePoint & 0xFFFF0000) == 0) { // 3-byte sequence
				checkScalarValue(codePoint);
				symbol = stringFromCharCode(((codePoint >> 12) & 0x0F) | 0xE0);
				symbol += createByte(codePoint, 6);
			}
			else if ((codePoint & 0xFFE00000) == 0) { // 4-byte sequence
				symbol = stringFromCharCode(((codePoint >> 18) & 0x07) | 0xF0);
				symbol += createByte(codePoint, 12);
				symbol += createByte(codePoint, 6);
			}
			symbol += stringFromCharCode((codePoint & 0x3F) | 0x80);
			return symbol;
		}

		function utf8encode(string) {
			var codePoints = ucs2decode(string);
			var length = codePoints.length;
			var index = -1;
			var codePoint;
			var byteString = '';
			while (++index < length) {
				codePoint = codePoints[index];
				byteString += encodeCodePoint(codePoint);
			}
			return byteString;
		}

		/*--------------------------------------------------------------------------*/

		function readContinuationByte() {
			if (byteIndex >= byteCount) {
				throw Error('Invalid byte index');
			}

			var continuationByte = byteArray[byteIndex] & 0xFF;
			byteIndex++;

			if ((continuationByte & 0xC0) == 0x80) {
				return continuationByte & 0x3F;
			}

			// If we end up here, it’s not a continuation byte
			throw Error('Invalid continuation byte');
		}

		function decodeSymbol() {
			var byte1;
			var byte2;
			var byte3;
			var byte4;
			var codePoint;

			if (byteIndex > byteCount) {
				throw Error('Invalid byte index');
			}

			if (byteIndex == byteCount) {
				return false;
			}

			// Read first byte
			byte1 = byteArray[byteIndex] & 0xFF;
			byteIndex++;

			// 1-byte sequence (no continuation bytes)
			if ((byte1 & 0x80) == 0) {
				return byte1;
			}

			// 2-byte sequence
			if ((byte1 & 0xE0) == 0xC0) {
				var byte2 = readContinuationByte();
				codePoint = ((byte1 & 0x1F) << 6) | byte2;
				if (codePoint >= 0x80) {
					return codePoint;
				} else {
					throw Error('Invalid continuation byte');
				}
			}

			// 3-byte sequence (may include unpaired surrogates)
			if ((byte1 & 0xF0) == 0xE0) {
				byte2 = readContinuationByte();
				byte3 = readContinuationByte();
				codePoint = ((byte1 & 0x0F) << 12) | (byte2 << 6) | byte3;
				if (codePoint >= 0x0800) {
					checkScalarValue(codePoint);
					return codePoint;
				} else {
					throw Error('Invalid continuation byte');
				}
			}

			// 4-byte sequence
			if ((byte1 & 0xF8) == 0xF0) {
				byte2 = readContinuationByte();
				byte3 = readContinuationByte();
				byte4 = readContinuationByte();
				codePoint = ((byte1 & 0x0F) << 0x12) | (byte2 << 0x0C) |
					(byte3 << 0x06) | byte4;
				if (codePoint >= 0x010000 && codePoint <= 0x10FFFF) {
					return codePoint;
				}
			}

			throw Error('Invalid UTF-8 detected');
		}

		var byteArray;
		var byteCount;
		var byteIndex;
		function utf8decode(byteString) {
			byteArray = ucs2decode(byteString);
			byteCount = byteArray.length;
			byteIndex = 0;
			var codePoints = [];
			var tmp;
			while ((tmp = decodeSymbol()) !== false) {
				codePoints.push(tmp);
			}
			return ucs2encode(codePoints);
		}

		/*--------------------------------------------------------------------------*/

		var utf8 = {
			'version': '2.0.0',
			'encode': utf8encode,
			'decode': utf8decode
		};

		// Some AMD build optimizers, like r.js, check for specific condition patterns
		// like the following:
		if (
			true
		) {
			!(__WEBPACK_AMD_DEFINE_RESULT__ = function() {
				return utf8;
			}.call(exports, __webpack_require__, exports, module), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
		}	else if (freeExports && !freeExports.nodeType) {
			if (freeModule) { // in Node.js or RingoJS v0.8.0+
				freeModule.exports = utf8;
			} else { // in Narwhal or RingoJS v0.7.0-
				var object = {};
				var hasOwnProperty = object.hasOwnProperty;
				for (var key in utf8) {
					hasOwnProperty.call(utf8, key) && (freeExports[key] = utf8[key]);
				}
			}
		} else { // in Rhino or a web browser
			root.utf8 = utf8;
		}

	}(this));

	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(41)(module), __webpack_require__(0)))

/***/ },
/* 203 */
/***/ 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';
	}

/***/ },
/* 204 */
/***/ 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__(203);

	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__(183);

	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, __webpack_require__(0), __webpack_require__(20)))

/***/ },
/* 205 */
/***/ function(module, exports) {

	/* WEBPACK VAR INJECTION */(function(__webpack_amd_options__) {module.exports = __webpack_amd_options__;

	/* WEBPACK VAR INJECTION */}.call(exports, {}))

/***/ },
/* 206 */
/***/ function(module, exports) {

	/* (ignored) */

/***/ }
/******/ ]);