☕️ Classic, reliable, trusted test framework for Node.js and the browser
rebuild
Christopher Hillerf79488200cd2
diff --git a/mocha.js b/mocha.jsindex ed034815..cd854f73 100644--- a/mocha.js+++ b/mocha.js@@ -168,7 +168,7 @@ global.mocha = mocha;module.exports = global;}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"./lib/mocha":14,"_process":69,"browser-stdout":41}],2:[function(require,module,exports){+},{"./lib/mocha":14,"_process":66,"browser-stdout":40}],2:[function(require,module,exports){/* eslint-disable no-unused-vars */module.exports = function(type) {return function() {};@@ -615,7 +615,7 @@ Context.prototype.inspect = function() {}, 2);};-},{"json3":56}],7:[function(require,module,exports){+},{"json3":53}],7:[function(require,module,exports){/*** Module dependencies.*/@@ -663,7 +663,7 @@ Hook.prototype.error = function(err) {this._error = err;};-},{"./runnable":35,"./utils":39}],8:[function(require,module,exports){+},{"./runnable":33,"./utils":37}],8:[function(require,module,exports){/*** Module dependencies.*/@@ -776,7 +776,7 @@ module.exports = function(suite) {});};-},{"../suite":37,"../test":38,"./common":9}],9:[function(require,module,exports){+},{"../suite":35,"../test":36,"./common":9}],9:[function(require,module,exports){'use strict';/**@@ -957,7 +957,7 @@ module.exports = function(suite) {}};-},{"../suite":37,"../test":38}],11:[function(require,module,exports){+},{"../suite":35,"../test":36}],11:[function(require,module,exports){exports.bdd = require('./bdd');exports.tdd = require('./tdd');exports.qunit = require('./qunit');@@ -1055,7 +1055,7 @@ module.exports = function(suite) {});};-},{"../suite":37,"../test":38,"./common":9}],13:[function(require,module,exports){+},{"../suite":35,"../test":36,"./common":9}],13:[function(require,module,exports){/*** Module dependencies.*/@@ -1159,7 +1159,7 @@ module.exports = function(suite) {});};-},{"../suite":37,"../test":38,"./common":9}],14:[function(require,module,exports){+},{"../suite":35,"../test":36,"./common":9}],14:[function(require,module,exports){(function (process,global,__dirname){/*!* mocha@@ -1683,7 +1683,7 @@ Mocha.prototype.run = function(fn) {};}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {},"/lib")-},{"./context":6,"./hook":7,"./interfaces":11,"./reporters":22,"./runnable":35,"./runner":36,"./suite":37,"./test":38,"./utils":39,"_process":69,"escape-string-regexp":50,"growl":51,"path":42}],15:[function(require,module,exports){+},{"./context":6,"./hook":7,"./interfaces":11,"./reporters":21,"./runnable":33,"./runner":34,"./suite":35,"./test":36,"./utils":37,"_process":66,"escape-string-regexp":46,"growl":48,"path":41}],15:[function(require,module,exports){/*** Helpers.*/@@ -2323,7 +2323,7 @@ function sameType(a, b) {}}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"../ms":15,"../utils":39,"_process":69,"diff":49,"supports-color":42,"tty":5}],18:[function(require,module,exports){+},{"../ms":15,"../utils":37,"_process":66,"diff":45,"supports-color":41,"tty":5}],18:[function(require,module,exports){/*** Module dependencies.*/@@ -2387,7 +2387,7 @@ function Doc(runner) {});}-},{"../utils":39,"./base":17}],19:[function(require,module,exports){+},{"../utils":37,"./base":17}],19:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -2457,67 +2457,7 @@ function Dot(runner) {inherits(Dot, Base);}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],20:[function(require,module,exports){-(function (process,__dirname){-/**- * Module dependencies.- */--var JSONCov = require('./json-cov');-var readFileSync = require('fs').readFileSync;-var join = require('path').join;--/**- * Expose `HTMLCov`.- */--exports = module.exports = HTMLCov;--/**- * Initialize a new `JsCoverage` reporter.- *- * @api public- * @param {Runner} runner- */-function HTMLCov(runner) {- var pug = require('pug');- var file = join(__dirname, '/templates/coverage.pug');- var str = readFileSync(file, 'utf8');- var fn = pug.compile(str, { filename: file });- var self = this;-- JSONCov.call(this, runner, false);-- runner.on('end', function() {- process.stdout.write(fn({- cov: self.cov,- coverageClass: coverageClass- }));- });-}--/**- * Return coverage class for a given coverage percentage.- *- * @api private- * @param {number} coveragePctg- * @return {string}- */-function coverageClass(coveragePctg) {- if (coveragePctg >= 75) {- return 'high';- }- if (coveragePctg >= 50) {- return 'medium';- }- if (coveragePctg >= 25) {- return 'low';- }- return 'terrible';-}--}).call(this,require('_process'),"/lib/reporters")-},{"./json-cov":23,"_process":69,"fs":42,"path":42,"pug":40}],21:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],20:[function(require,module,exports){(function (global){/* eslint-env browser */@@ -2865,7 +2805,7 @@ function on(el, event, fn) {}}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"../browser/progress":4,"../utils":39,"./base":17,"escape-string-regexp":50}],22:[function(require,module,exports){+},{"../browser/progress":4,"../utils":37,"./base":17,"escape-string-regexp":46}],21:[function(require,module,exports){// Alias exports to a their normalized format Mocha#reporter to prevent a need// for dynamic (try/catch) requires, which Browserify doesn't handle.exports.Base = exports.base = require('./base');@@ -2882,167 +2822,9 @@ exports.XUnit = exports.xunit = require('./xunit');exports.Markdown = exports.markdown = require('./markdown');exports.Progress = exports.progress = require('./progress');exports.Landing = exports.landing = require('./landing');-exports.JSONCov = exports['json-cov'] = require('./json-cov');-exports.HTMLCov = exports['html-cov'] = require('./html-cov');exports.JSONStream = exports['json-stream'] = require('./json-stream');-},{"./base":17,"./doc":18,"./dot":19,"./html":21,"./html-cov":20,"./json":25,"./json-cov":23,"./json-stream":24,"./landing":26,"./list":27,"./markdown":28,"./min":29,"./nyan":30,"./progress":31,"./spec":32,"./tap":33,"./xunit":34}],23:[function(require,module,exports){-(function (process,global){-/**- * Module dependencies.- */--var Base = require('./base');-var JSON = require('json3');--/**- * Expose `JSONCov`.- */--exports = module.exports = JSONCov;--/**- * Initialize a new `JsCoverage` reporter.- *- * @api public- * @param {Runner} runner- * @param {boolean} output- */-function JSONCov(runner, output) {- Base.call(this, runner);-- output = arguments.length === 1 || output;- var self = this;- var tests = [];- var failures = [];- var passes = [];-- runner.on('test end', function(test) {- tests.push(test);- });-- runner.on('pass', function(test) {- passes.push(test);- });-- runner.on('fail', function(test) {- failures.push(test);- });-- runner.on('end', function() {- var cov = global._$jscoverage || {};- var result = self.cov = map(cov);- result.stats = self.stats;- result.tests = tests.map(clean);- result.failures = failures.map(clean);- result.passes = passes.map(clean);- if (!output) {- return;- }- process.stdout.write(JSON.stringify(result, null, 2));- });-}--/**- * Map jscoverage data to a JSON structure- * suitable for reporting.- *- * @api private- * @param {Object} cov- * @return {Object}- */--function map(cov) {- var ret = {- instrumentation: 'node-jscoverage',- sloc: 0,- hits: 0,- misses: 0,- coverage: 0,- files: []- };-- for (var filename in cov) {- if (Object.prototype.hasOwnProperty.call(cov, filename)) {- var data = coverage(filename, cov[filename]);- ret.files.push(data);- ret.hits += data.hits;- ret.misses += data.misses;- ret.sloc += data.sloc;- }- }-- ret.files.sort(function(a, b) {- return a.filename.localeCompare(b.filename);- });-- if (ret.sloc > 0) {- ret.coverage = (ret.hits / ret.sloc) * 100;- }-- return ret;-}--/**- * Map jscoverage data for a single source file- * to a JSON structure suitable for reporting.- *- * @api private- * @param {string} filename name of the source file- * @param {Object} data jscoverage coverage data- * @return {Object}- */-function coverage(filename, data) {- var ret = {- filename: filename,- coverage: 0,- hits: 0,- misses: 0,- sloc: 0,- source: {}- };-- data.source.forEach(function(line, num) {- num++;-- if (data[num] === 0) {- ret.misses++;- ret.sloc++;- } else if (data[num] !== undefined) {- ret.hits++;- ret.sloc++;- }-- ret.source[num] = {- source: line,- coverage: data[num] === undefined ? '' : data[num]- };- });-- ret.coverage = ret.hits / ret.sloc * 100;-- return ret;-}--/**- * Return a plain-object representation of `test`- * free of cyclic properties etc.- *- * @api private- * @param {Object} test- * @return {Object}- */-function clean(test) {- return {- duration: test.duration,- currentRetry: test.currentRetry(),- fullTitle: test.fullTitle(),- title: test.title- };-}--}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"./base":17,"_process":69,"json3":56}],24:[function(require,module,exports){+},{"./base":17,"./doc":18,"./dot":19,"./html":20,"./json":23,"./json-stream":22,"./landing":24,"./list":25,"./markdown":26,"./min":27,"./nyan":28,"./progress":29,"./spec":30,"./tap":31,"./xunit":32}],22:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3107,7 +2889,7 @@ function clean(test) {}}).call(this,require('_process'))-},{"./base":17,"_process":69,"json3":56}],25:[function(require,module,exports){+},{"./base":17,"_process":66,"json3":53}],23:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3201,7 +2983,7 @@ function errorJSON(err) {}}).call(this,require('_process'))-},{"./base":17,"_process":69}],26:[function(require,module,exports){+},{"./base":17,"_process":66}],24:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3297,7 +3079,7 @@ function Landing(runner) {inherits(Landing, Base);}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],27:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],25:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3362,7 +3144,7 @@ function List(runner) {inherits(List, Base);}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],28:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],26:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3463,7 +3245,7 @@ function Markdown(runner) {}}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],29:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],27:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3503,7 +3285,7 @@ function Min(runner) {inherits(Min, Base);}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],30:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],28:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3768,7 +3550,7 @@ function write(string) {}}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],31:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],29:[function(require,module,exports){(function (process){/*** Module dependencies.@@ -3861,7 +3643,7 @@ function Progress(runner, options) {inherits(Progress, Base);}).call(this,require('_process'))-},{"../utils":39,"./base":17,"_process":69}],32:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66}],30:[function(require,module,exports){/*** Module dependencies.*/@@ -3946,7 +3728,7 @@ function Spec(runner) {*/inherits(Spec, Base);-},{"../utils":39,"./base":17}],33:[function(require,module,exports){+},{"../utils":37,"./base":17}],31:[function(require,module,exports){/*** Module dependencies.*/@@ -4016,7 +3798,7 @@ function title(test) {return test.fullTitle().replace(/#/g, '');}-},{"./base":17}],34:[function(require,module,exports){+},{"./base":17}],32:[function(require,module,exports){(function (process,global){/*** Module dependencies.@@ -4186,7 +3968,7 @@ function tag(name, attrs, close, content) {}}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"../utils":39,"./base":17,"_process":69,"fs":42,"mkdirp":66,"path":42}],35:[function(require,module,exports){+},{"../utils":37,"./base":17,"_process":66,"fs":41,"mkdirp":63,"path":41}],33:[function(require,module,exports){(function (global){/*** Module dependencies.@@ -4565,7 +4347,7 @@ Runnable.prototype.run = function(fn) {};}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"./ms":15,"./pending":16,"./utils":39,"debug":2,"events":3,"json3":56,"lodash.create":62}],36:[function(require,module,exports){+},{"./ms":15,"./pending":16,"./utils":37,"debug":2,"events":3,"json3":53,"lodash.create":59}],34:[function(require,module,exports){(function (process,global){/*** Module dependencies.@@ -5494,7 +5276,7 @@ function extraGlobals() {}}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"./pending":16,"./runnable":35,"./utils":39,"_process":69,"debug":2,"events":3}],37:[function(require,module,exports){+},{"./pending":16,"./runnable":33,"./utils":37,"_process":66,"debug":2,"events":3}],35:[function(require,module,exports){/*** Module dependencies.*/@@ -5894,7 +5676,7 @@ Suite.prototype.run = function run() {}};-},{"./hook":7,"./ms":15,"./utils":39,"debug":2,"events":3}],38:[function(require,module,exports){+},{"./hook":7,"./ms":15,"./utils":37,"debug":2,"events":3}],36:[function(require,module,exports){/*** Module dependencies.*/@@ -5946,7 +5728,7 @@ Test.prototype.clone = function() {return test;};-},{"./runnable":35,"./utils":39,"lodash.create":62}],39:[function(require,module,exports){+},{"./runnable":33,"./utils":37,"lodash.create":59}],37:[function(require,module,exports){(function (process,Buffer){/* eslint-env browser */@@ -6711,9 +6493,120 @@ exports.isPromise = function isPromise(value) {};}).call(this,require('_process'),require("buffer").Buffer)-},{"_process":69,"buffer":43,"debug":2,"fs":42,"glob":42,"json3":56,"path":42,"to-iso-string":81,"util":84}],40:[function(require,module,exports){+},{"_process":66,"buffer":43,"debug":2,"fs":41,"glob":41,"json3":53,"path":41,"to-iso-string":79,"util":82}],38:[function(require,module,exports){+'use strict'-},{}],41:[function(require,module,exports){+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('')+}++},{}],39:[function(require,module,exports){++},{}],40:[function(require,module,exports){(function (process){var WritableStream = require('stream').Writablevar inherits = require('util').inherits@@ -6742,29 +6635,141 @@ BrowserStdout.prototype._write = function(chunks, encoding, cb) {}}).call(this,require('_process'))-},{"_process":69,"stream":46,"util":84}],42:[function(require,module,exports){-arguments[4][40][0].apply(exports,arguments)-},{"dup":40}],43:[function(require,module,exports){+},{"_process":66,"stream":77,"util":82}],41:[function(require,module,exports){+arguments[4][39][0].apply(exports,arguments)+},{"dup":39}],42:[function(require,module,exports){(function (global){-/*!- * The buffer module from node.js, for the browser.- *- * @author Feross Aboukhadijeh <[email protected]> <http://feross.org>- * @license MIT- */-/* eslint-disable no-proto */--'use strict'--var base64 = require('base64-js')-var ieee754 = require('ieee754')-var isArray = require('isarray')--exports.Buffer = Buffer-exports.SlowBuffer = SlowBuffer-exports.INSPECT_MAX_BYTES = 50+'use strict';-/**+var buffer = require('buffer');+var Buffer = buffer.Buffer;+var SlowBuffer = buffer.SlowBuffer;+var MAX_LEN = buffer.kMaxLength || 2147483647;+exports.alloc = function alloc(size, fill, encoding) {+ if (typeof Buffer.alloc === 'function') {+ return Buffer.alloc(size, fill, encoding);+ }+ if (typeof encoding === 'number') {+ throw new TypeError('encoding must not be number');+ }+ if (typeof size !== 'number') {+ throw new TypeError('size must be a number');+ }+ if (size > MAX_LEN) {+ throw new RangeError('size is too large');+ }+ var enc = encoding;+ var _fill = fill;+ if (_fill === undefined) {+ enc = undefined;+ _fill = 0;+ }+ var buf = new Buffer(size);+ if (typeof _fill === 'string') {+ var fillBuf = new Buffer(_fill, enc);+ var flen = fillBuf.length;+ var i = -1;+ while (++i < size) {+ buf[i] = fillBuf[i % flen];+ }+ } else {+ buf.fill(_fill);+ }+ return buf;+}+exports.allocUnsafe = function allocUnsafe(size) {+ if (typeof Buffer.allocUnsafe === 'function') {+ return Buffer.allocUnsafe(size);+ }+ if (typeof size !== 'number') {+ throw new TypeError('size must be a number');+ }+ if (size > MAX_LEN) {+ throw new RangeError('size is too large');+ }+ return new Buffer(size);+}+exports.from = function from(value, encodingOrOffset, length) {+ if (typeof Buffer.from === 'function' && (!global.Uint8Array || Uint8Array.from !== Buffer.from)) {+ return Buffer.from(value, encodingOrOffset, length);+ }+ if (typeof value === 'number') {+ throw new TypeError('"value" argument must not be a number');+ }+ if (typeof value === 'string') {+ return new Buffer(value, encodingOrOffset);+ }+ if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {+ var offset = encodingOrOffset;+ if (arguments.length === 1) {+ return new Buffer(value);+ }+ if (typeof offset === 'undefined') {+ offset = 0;+ }+ var len = length;+ if (typeof len === 'undefined') {+ len = value.byteLength - offset;+ }+ if (offset >= value.byteLength) {+ throw new RangeError('\'offset\' is out of bounds');+ }+ if (len > value.byteLength - offset) {+ throw new RangeError('\'length\' is out of bounds');+ }+ return new Buffer(value.slice(offset, offset + len));+ }+ if (Buffer.isBuffer(value)) {+ var out = new Buffer(value.length);+ value.copy(out, 0, 0, value.length);+ return out;+ }+ if (value) {+ if (Array.isArray(value) || (typeof ArrayBuffer !== 'undefined' && value.buffer instanceof ArrayBuffer) || 'length' in value) {+ return new Buffer(value);+ }+ if (value.type === 'Buffer' && Array.isArray(value.data)) {+ return new Buffer(value.data);+ }+ }++ throw new TypeError('First argument must be a string, Buffer, ' + 'ArrayBuffer, Array, or array-like object.');+}+exports.allocUnsafeSlow = function allocUnsafeSlow(size) {+ if (typeof Buffer.allocUnsafeSlow === 'function') {+ return Buffer.allocUnsafeSlow(size);+ }+ if (typeof size !== 'number') {+ throw new TypeError('size must be a number');+ }+ if (size >= MAX_LEN) {+ throw new RangeError('size is too large');+ }+ return new SlowBuffer(size);+}++}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})+},{"buffer":43}],43:[function(require,module,exports){+(function (global){+/*!+ * The buffer module from node.js, for the browser.+ *+ * @author Feross Aboukhadijeh <[email protected]> <http://feross.org>+ * @license MIT+ */+/* eslint-disable no-proto */++'use strict'++var base64 = require('base64-js')+var ieee754 = require('ieee754')+var isArray = require('isarray')++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)@@ -6800,7 +6805,7 @@ exports.kMaxLength = kMaxLength()function typedArraySupport () {try {var arr = new Uint8Array(1)- arr.foo = function () { return 42 }+ arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}return arr.foo() === 42 && // typed array instances can be augmentedtypeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`@@ -6944,7 +6949,7 @@ 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++) {+ for (var i = 0; i < size; ++i) {that[i] = 0}}@@ -7122,14 +7127,14 @@ Buffer.concat = function concat (list, length) {var iif (length === undefined) {length = 0- for (i = 0; i < list.length; i++) {+ 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++) {+ 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')@@ -7161,7 +7166,6 @@ function byteLength (string, encoding) {switch (encoding) {case 'ascii':case 'binary':- // Deprecatedcase 'raw':case 'raws':return len@@ -7399,15 +7403,16 @@ function arrayIndexOf (arr, val, byteOffset, encoding) {}var foundIndex = -1- for (var i = 0; byteOffset + i < arrLength; i++) {- if (read(arr, byteOffset + i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {+ for (var i = byteOffset; i < arrLength; ++i) {+ if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {if (foundIndex === -1) foundIndex = i- if (i - foundIndex + 1 === valLength) return (byteOffset + foundIndex) * indexSize+ if (i - foundIndex + 1 === valLength) return foundIndex * indexSize} else {if (foundIndex !== -1) i -= i - foundIndexfoundIndex = -1}}+return -1}@@ -7472,7 +7477,7 @@ function hexWrite (buf, string, offset, length) {if (length > strLen / 2) {length = strLen / 2}- for (var i = 0; i < length; i++) {+ for (var i = 0; i < length; ++i) {var parsed = parseInt(string.substr(i * 2, 2), 16)if (isNaN(parsed)) return ibuf[offset + i] = parsed@@ -7686,7 +7691,7 @@ function asciiSlice (buf, start, end) {var ret = ''end = Math.min(buf.length, end)- for (var i = start; i < end; i++) {+ for (var i = start; i < end; ++i) {ret += String.fromCharCode(buf[i] & 0x7F)}return ret@@ -7696,7 +7701,7 @@ function binarySlice (buf, start, end) {var ret = ''end = Math.min(buf.length, end)- for (var i = start; i < end; i++) {+ for (var i = start; i < end; ++i) {ret += String.fromCharCode(buf[i])}return ret@@ -7709,7 +7714,7 @@ function hexSlice (buf, start, end) {if (!end || end < 0 || end > len) end = lenvar out = ''- for (var i = start; i < end; i++) {+ for (var i = start; i < end; ++i) {out += toHex(buf[i])}return out@@ -7752,7 +7757,7 @@ Buffer.prototype.slice = function slice (start, end) {} else {var sliceLen = end - startnewBuf = new Buffer(sliceLen, undefined)- for (var i = 0; i < sliceLen; i++) {+ for (var i = 0; i < sliceLen; ++i) {newBuf[i] = this[i + start]}}@@ -7979,7 +7984,7 @@ Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {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++) {+ 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}@@ -8013,7 +8018,7 @@ Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssertfunction 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++) {+ for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff}}@@ -8228,12 +8233,12 @@ Buffer.prototype.copy = function copy (target, targetStart, start, end) {if (this === target && start < targetStart && targetStart < end) {// descending copy from end- for (i = len - 1; i >= 0; i--) {+ 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++) {+ for (i = 0; i < len; ++i) {target[i + targetStart] = this[i + start]}} else {@@ -8294,7 +8299,7 @@ Buffer.prototype.fill = function fill (val, start, end, encoding) {var iif (typeof val === 'number') {- for (i = start; i < end; i++) {+ for (i = start; i < end; ++i) {this[i] = val}} else {@@ -8302,7 +8307,7 @@ Buffer.prototype.fill = function fill (val, start, end, encoding) {? val: utf8ToBytes(new Buffer(val, encoding).toString())var len = bytes.length- for (i = 0; i < end - start; i++) {+ for (i = 0; i < end - start; ++i) {this[i + start] = bytes[i % len]}}@@ -8344,7 +8349,7 @@ function utf8ToBytes (string, units) {var leadSurrogate = nullvar bytes = []- for (var i = 0; i < length; i++) {+ for (var i = 0; i < length; ++i) {codePoint = string.charCodeAt(i)// is surrogate component@@ -8419,7 +8424,7 @@ function utf8ToBytes (string, units) {function asciiToBytes (str) {var byteArray = []- for (var i = 0; i < str.length; i++) {+ 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)}@@ -8429,7 +8434,7 @@ function asciiToBytes (str) {function utf16leToBytes (str, units) {var c, hi, lovar byteArray = []- for (var i = 0; i < str.length; i++) {+ for (var i = 0; i < str.length; ++i) {if ((units -= 2) < 0) breakc = str.charCodeAt(i)@@ -8447,7 +8452,7 @@ function base64ToBytes (str) {}function blitBuffer (src, dst, offset, length) {- for (var i = 0; i < length; i++) {+ for (var i = 0; i < length; ++i) {if ((i + offset >= dst.length) || (i >= src.length)) breakdst[i + offset] = src[i]}@@ -8459,118 +8464,8 @@ function isnan (val) {}}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"base64-js":44,"ieee754":52,"isarray":55}],44:[function(require,module,exports){-'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('')-}--},{}],45:[function(require,module,exports){+},{"base64-js":38,"ieee754":49,"isarray":52}],44:[function(require,module,exports){+(function (Buffer){// Copyright Joyent, Inc. and other Node contributors.//// Permission is hereby granted, free of charge, to any person obtaining a@@ -8592,1271 +8487,1033 @@ function fromByteArray (uint8) {// 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;+// NOTE: These type checking functions intentionally don't use `instanceof`+// because it is fragile and can be easily faked with `Object.create()`.-// Backwards-compat with node 0.10.x-EventEmitter.EventEmitter = EventEmitter;+function isArray(arg) {+ if (Array.isArray) {+ return Array.isArray(arg);+ }+ return objectToString(arg) === '[object Array]';+}+exports.isArray = isArray;-EventEmitter.prototype._events = undefined;-EventEmitter.prototype._maxListeners = undefined;+function isBoolean(arg) {+ return typeof arg === 'boolean';+}+exports.isBoolean = isBoolean;-// 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;+function isNull(arg) {+ return arg === null;+}+exports.isNull = isNull;-// 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;-};+function isNullOrUndefined(arg) {+ return arg == null;+}+exports.isNullOrUndefined = isNullOrUndefined;-EventEmitter.prototype.emit = function(type) {- var er, handler, len, args, i, listeners;+function isNumber(arg) {+ return typeof arg === 'number';+}+exports.isNumber = isNumber;- if (!this._events)- this._events = {};+function isString(arg) {+ return typeof arg === 'string';+}+exports.isString = isString;- // 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.');- }- }+function isSymbol(arg) {+ return typeof arg === 'symbol';+}+exports.isSymbol = isSymbol;- handler = this._events[type];+function isUndefined(arg) {+ return arg === void 0;+}+exports.isUndefined = isUndefined;- if (isUndefined(handler))- return false;+function isRegExp(re) {+ return objectToString(re) === '[object RegExp]';+}+exports.isRegExp = isRegExp;- 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);- }+function isObject(arg) {+ return typeof arg === 'object' && arg !== null;+}+exports.isObject = isObject;- return true;-};+function isDate(d) {+ return objectToString(d) === '[object Date]';+}+exports.isDate = isDate;-EventEmitter.prototype.addListener = function(type, listener) {- var m;+function isError(e) {+ return (objectToString(e) === '[object Error]' || e instanceof Error);+}+exports.isError = isError;- if (!isFunction(listener))- throw TypeError('listener must be a function');+function isFunction(arg) {+ return typeof arg === 'function';+}+exports.isFunction = isFunction;- if (!this._events)- this._events = {};+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;- // 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);+exports.isBuffer = Buffer.isBuffer;- 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];+function objectToString(o) {+ return Object.prototype.toString.call(o);+}- // Check for listener leak- if (isObject(this._events[type]) && !this._events[type].warned) {- if (!isUndefined(this._maxListeners)) {- m = this._maxListeners;- } else {- m = EventEmitter.defaultMaxListeners;+}).call(this,{"isBuffer":require("../../is-buffer/index.js")})+},{"../../is-buffer/index.js":51}],45:[function(require,module,exports){+/* See LICENSE file for terms of use */++/*+ * Text diff implementation.+ *+ * This library supports the following APIS:+ * JsDiff.diffChars: Character by character diff+ * JsDiff.diffWords: Word (as defined by \b regex) diff which ignores whitespace+ * JsDiff.diffLines: Line based diff+ *+ * JsDiff.diffCss: Diff targeted at CSS content+ *+ * These methods are based on the implementation proposed in+ * "An O(ND) Difference Algorithm and its Variations" (Myers, 1986).+ * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6927+ */+(function(global, undefined) {+ var objectPrototypeToString = Object.prototype.toString;++ /*istanbul ignore next*/+ function map(arr, mapper, that) {+ if (Array.prototype.map) {+ return Array.prototype.map.call(arr, mapper, that);}- 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();+ var other = new Array(arr.length);++ for (var i = 0, n = arr.length; i < n; i++) {+ other[i] = mapper.call(that, arr[i], i, arr);+ }+ return other;+ }+ function clonePath(path) {+ return { newPos: path.newPos, components: path.components.slice(0) };+ }+ function removeEmpty(array) {+ var ret = [];+ for (var i = 0; i < array.length; i++) {+ if (array[i]) {+ ret.push(array[i]);}}+ return ret;}+ function escapeHTML(s) {+ var n = s;+ n = n.replace(/&/g, '&');+ n = n.replace(/</g, '<');+ n = n.replace(/>/g, '>');+ n = n.replace(/"/g, '"');- return this;-};+ return n;+ }-EventEmitter.prototype.on = EventEmitter.prototype.addListener;+ // This function handles the presence of circular references by bailing out when encountering an+ // object that is already on the "stack" of items being processed.+ function canonicalize(obj, stack, replacementStack) {+ stack = stack || [];+ replacementStack = replacementStack || [];-EventEmitter.prototype.once = function(type, listener) {- if (!isFunction(listener))- throw TypeError('listener must be a function');+ var i;- var fired = false;+ for (i = 0; i < stack.length; i += 1) {+ if (stack[i] === obj) {+ return replacementStack[i];+ }+ }- function g() {- this.removeListener(type, g);+ var canonicalizedObj;- if (!fired) {- fired = true;- listener.apply(this, arguments);+ if ('[object Array]' === objectPrototypeToString.call(obj)) {+ stack.push(obj);+ canonicalizedObj = new Array(obj.length);+ replacementStack.push(canonicalizedObj);+ for (i = 0; i < obj.length; i += 1) {+ canonicalizedObj[i] = canonicalize(obj[i], stack, replacementStack);+ }+ stack.pop();+ replacementStack.pop();+ } else if (typeof obj === 'object' && obj !== null) {+ stack.push(obj);+ canonicalizedObj = {};+ replacementStack.push(canonicalizedObj);+ var sortedKeys = [],+ key;+ for (key in obj) {+ sortedKeys.push(key);+ }+ sortedKeys.sort();+ for (i = 0; i < sortedKeys.length; i += 1) {+ key = sortedKeys[i];+ canonicalizedObj[key] = canonicalize(obj[key], stack, replacementStack);+ }+ stack.pop();+ replacementStack.pop();+ } else {+ canonicalizedObj = obj;}+ return canonicalizedObj;}- 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');+ function buildValues(components, newString, oldString, useLongestToken) {+ var componentPos = 0,+ componentLen = components.length,+ newPos = 0,+ oldPos = 0;- if (!this._events || !this._events[type])- return this;+ for (; componentPos < componentLen; componentPos++) {+ var component = components[componentPos];+ if (!component.removed) {+ if (!component.added && useLongestToken) {+ var value = newString.slice(newPos, newPos + component.count);+ value = map(value, function(value, i) {+ var oldValue = oldString[oldPos + i];+ return oldValue.length > value.length ? oldValue : value;+ });- list = this._events[type];- length = list.length;- position = -1;+ component.value = value.join('');+ } else {+ component.value = newString.slice(newPos, newPos + component.count).join('');+ }+ newPos += component.count;- if (list === listener ||- (isFunction(list.listener) && list.listener === listener)) {- delete this._events[type];- if (this._events.removeListener)- this.emit('removeListener', type, listener);+ // Common case+ if (!component.added) {+ oldPos += component.count;+ }+ } else {+ component.value = oldString.slice(oldPos, oldPos + component.count).join('');+ oldPos += component.count;- } else if (isObject(list)) {- for (i = length; i-- > 0;) {- if (list[i] === listener ||- (list[i].listener && list[i].listener === listener)) {- position = i;- break;+ // Reverse add and remove so removes are output first to match common convention+ // The diffing algorithm is tied to add then remove output and this is the simplest+ // route to get the desired output with minimal overhead.+ if (componentPos && components[componentPos - 1].added) {+ var tmp = components[componentPos - 1];+ components[componentPos - 1] = components[componentPos];+ components[componentPos] = tmp;+ }}}- 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;+ return components;}- // 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;+ function Diff(ignoreWhitespace) {+ this.ignoreWhitespace = ignoreWhitespace;}+ Diff.prototype = {+ diff: function(oldString, newString, callback) {+ var self = 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];+ function done(value) {+ if (callback) {+ setTimeout(function() { callback(undefined, value); }, 0);+ return true;+ } else {+ return value;+ }+ }- return this;-};+ // Handle the identity case (this is due to unrolling editLength == 0+ if (newString === oldString) {+ return done([{ value: newString }]);+ }+ if (!newString) {+ return done([{ value: oldString, removed: true }]);+ }+ if (!oldString) {+ return done([{ value: newString, added: true }]);+ }-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;-};+ newString = this.tokenize(newString);+ oldString = this.tokenize(oldString);-EventEmitter.prototype.listenerCount = function(type) {- if (this._events) {- var evlistener = this._events[type];+ var newLen = newString.length, oldLen = oldString.length;+ var editLength = 1;+ var maxEditLength = newLen + oldLen;+ var bestPath = [{ newPos: -1, components: [] }];- if (isFunction(evlistener))- return 1;- else if (evlistener)- return evlistener.length;- }- return 0;-};+ // Seed editLength = 0, i.e. the content starts with the same values+ var oldPos = this.extractCommon(bestPath[0], newString, oldString, 0);+ if (bestPath[0].newPos + 1 >= newLen && oldPos + 1 >= oldLen) {+ // Identity per the equality and tokenizer+ return done([{value: newString.join('')}]);+ }-EventEmitter.listenerCount = function(emitter, type) {- return emitter.listenerCount(type);-};+ // Main worker method. checks all permutations of a given edit length for acceptance.+ function execEditLength() {+ for (var diagonalPath = -1 * editLength; diagonalPath <= editLength; diagonalPath += 2) {+ var basePath;+ var addPath = bestPath[diagonalPath - 1],+ removePath = bestPath[diagonalPath + 1],+ oldPos = (removePath ? removePath.newPos : 0) - diagonalPath;+ if (addPath) {+ // No one else is going to attempt to use this value, clear it+ bestPath[diagonalPath - 1] = undefined;+ }-function isFunction(arg) {- return typeof arg === 'function';-}+ var canAdd = addPath && addPath.newPos + 1 < newLen,+ canRemove = removePath && 0 <= oldPos && oldPos < oldLen;+ if (!canAdd && !canRemove) {+ // If this path is a terminal then prune+ bestPath[diagonalPath] = undefined;+ continue;+ }-function isNumber(arg) {- return typeof arg === 'number';-}+ // Select the diagonal that we want to branch from. We select the prior+ // path whose position in the new string is the farthest from the origin+ // and does not pass the bounds of the diff graph+ if (!canAdd || (canRemove && addPath.newPos < removePath.newPos)) {+ basePath = clonePath(removePath);+ self.pushComponent(basePath.components, undefined, true);+ } else {+ basePath = addPath; // No need to clone, we've pulled it from the list+ basePath.newPos++;+ self.pushComponent(basePath.components, true, undefined);+ }-function isObject(arg) {- return typeof arg === 'object' && arg !== null;-}+ oldPos = self.extractCommon(basePath, newString, oldString, diagonalPath);-function isUndefined(arg) {- return arg === void 0;-}+ // If we have hit the end of both strings, then we are done+ if (basePath.newPos + 1 >= newLen && oldPos + 1 >= oldLen) {+ return done(buildValues(basePath.components, newString, oldString, self.useLongestToken));+ } else {+ // Otherwise track this path as a potential candidate and continue.+ bestPath[diagonalPath] = basePath;+ }+ }-},{}],46:[function(require,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.+ editLength++;+ }-module.exports = Stream;+ // Performs the length of edit iteration. Is a bit fugly as this has to support the+ // sync and async mode which is never fun. Loops over execEditLength until a value+ // is produced.+ if (callback) {+ (function exec() {+ setTimeout(function() {+ // This should not happen, but we want to be safe.+ /*istanbul ignore next */+ if (editLength > maxEditLength) {+ return callback();+ }-var EE = require('events').EventEmitter;-var inherits = require('inherits');--inherits(Stream, EE);-Stream.Readable = require('readable-stream/readable.js');-Stream.Writable = require('readable-stream/writable.js');-Stream.Duplex = require('readable-stream/duplex.js');-Stream.Transform = require('readable-stream/transform.js');-Stream.PassThrough = require('readable-stream/passthrough.js');--// 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();+ if (!execEditLength()) {+ exec();+ }+ }, 0);+ }());+ } else {+ while (editLength <= maxEditLength) {+ var ret = execEditLength();+ if (ret) {+ return ret;+ }+ }}- }- }-- 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;-};--},{"events":45,"inherits":53,"readable-stream/duplex.js":70,"readable-stream/passthrough.js":76,"readable-stream/readable.js":77,"readable-stream/transform.js":78,"readable-stream/writable.js":79}],47:[function(require,module,exports){-(function (global){-'use strict';--var buffer = require('buffer');-var Buffer = buffer.Buffer;-var SlowBuffer = buffer.SlowBuffer;-var MAX_LEN = buffer.kMaxLength || 2147483647;-exports.alloc = function alloc(size, fill, encoding) {- if (typeof Buffer.alloc === 'function') {- return Buffer.alloc(size, fill, encoding);- }- if (typeof encoding === 'number') {- throw new TypeError('encoding must not be number');- }- if (typeof size !== 'number') {- throw new TypeError('size must be a number');- }- if (size > MAX_LEN) {- throw new RangeError('size is too large');- }- var enc = encoding;- var _fill = fill;- if (_fill === undefined) {- enc = undefined;- _fill = 0;- }- var buf = new Buffer(size);- if (typeof _fill === 'string') {- var fillBuf = new Buffer(_fill, enc);- var flen = fillBuf.length;- var i = -1;- while (++i < size) {- buf[i] = fillBuf[i % flen];- }- } else {- buf.fill(_fill);- }- return buf;-}-exports.allocUnsafe = function allocUnsafe(size) {- if (typeof Buffer.allocUnsafe === 'function') {- return Buffer.allocUnsafe(size);- }- if (typeof size !== 'number') {- throw new TypeError('size must be a number');- }- if (size > MAX_LEN) {- throw new RangeError('size is too large');- }- return new Buffer(size);-}-exports.from = function from(value, encodingOrOffset, length) {- if (typeof Buffer.from === 'function' && (!global.Uint8Array || Uint8Array.from !== Buffer.from)) {- return Buffer.from(value, encodingOrOffset, length);- }- if (typeof value === 'number') {- throw new TypeError('"value" argument must not be a number');- }- if (typeof value === 'string') {- return new Buffer(value, encodingOrOffset);- }- if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {- var offset = encodingOrOffset;- if (arguments.length === 1) {- return new Buffer(value);- }- if (typeof offset === 'undefined') {- offset = 0;- }- var len = length;- if (typeof len === 'undefined') {- len = value.byteLength - offset;- }- if (offset >= value.byteLength) {- throw new RangeError('\'offset\' is out of bounds');- }- if (len > value.byteLength - offset) {- throw new RangeError('\'length\' is out of bounds');- }- return new Buffer(value.slice(offset, offset + len));- }- if (Buffer.isBuffer(value)) {- var out = new Buffer(value.length);- value.copy(out, 0, 0, value.length);- return out;- }- if (value) {- if (Array.isArray(value) || (typeof ArrayBuffer !== 'undefined' && value.buffer instanceof ArrayBuffer) || 'length' in value) {- return new Buffer(value);- }- if (value.type === 'Buffer' && Array.isArray(value.data)) {- return new Buffer(value.data);- }- }-- throw new TypeError('First argument must be a string, Buffer, ' + 'ArrayBuffer, Array, or array-like object.');-}-exports.allocUnsafeSlow = function allocUnsafeSlow(size) {- if (typeof Buffer.allocUnsafeSlow === 'function') {- return Buffer.allocUnsafeSlow(size);- }- if (typeof size !== 'number') {- throw new TypeError('size must be a number');- }- if (size >= MAX_LEN) {- throw new RangeError('size is too large');- }- return new SlowBuffer(size);-}--}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"buffer":43}],48:[function(require,module,exports){-(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;+ pushComponent: function(components, added, removed) {+ var last = components[components.length - 1];+ if (last && last.added === added && last.removed === removed) {+ // We need to clone here as the component clone operation is just+ // as shallow array clone+ components[components.length - 1] = {count: last.count + 1, added: added, removed: removed };+ } else {+ components.push({count: 1, added: added, removed: removed });+ }+ },+ extractCommon: function(basePath, newString, oldString, diagonalPath) {+ var newLen = newString.length,+ oldLen = oldString.length,+ newPos = basePath.newPos,+ oldPos = newPos - diagonalPath,-function isString(arg) {- return typeof arg === 'string';-}-exports.isString = isString;+ commonCount = 0;+ while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(newString[newPos + 1], oldString[oldPos + 1])) {+ newPos++;+ oldPos++;+ commonCount++;+ }-function isSymbol(arg) {- return typeof arg === 'symbol';-}-exports.isSymbol = isSymbol;+ if (commonCount) {+ basePath.components.push({count: commonCount});+ }-function isUndefined(arg) {- return arg === void 0;-}-exports.isUndefined = isUndefined;+ basePath.newPos = newPos;+ return oldPos;+ },-function isRegExp(re) {- return objectToString(re) === '[object RegExp]';-}-exports.isRegExp = isRegExp;+ equals: function(left, right) {+ var reWhitespace = /\S/;+ return left === right || (this.ignoreWhitespace && !reWhitespace.test(left) && !reWhitespace.test(right));+ },+ tokenize: function(value) {+ return value.split('');+ }+ };-function isObject(arg) {- return typeof arg === 'object' && arg !== null;-}-exports.isObject = isObject;+ var CharDiff = new Diff();-function isDate(d) {- return objectToString(d) === '[object Date]';-}-exports.isDate = isDate;+ var WordDiff = new Diff(true);+ var WordWithSpaceDiff = new Diff();+ WordDiff.tokenize = WordWithSpaceDiff.tokenize = function(value) {+ return removeEmpty(value.split(/(\s+|\b)/));+ };-function isError(e) {- return (objectToString(e) === '[object Error]' || e instanceof Error);-}-exports.isError = isError;+ var CssDiff = new Diff(true);+ CssDiff.tokenize = function(value) {+ return removeEmpty(value.split(/([{}:;,]|\s+)/));+ };-function isFunction(arg) {- return typeof arg === 'function';-}-exports.isFunction = isFunction;+ var LineDiff = new Diff();-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;+ var TrimmedLineDiff = new Diff();+ TrimmedLineDiff.ignoreTrim = true;-exports.isBuffer = Buffer.isBuffer;+ LineDiff.tokenize = TrimmedLineDiff.tokenize = function(value) {+ var retLines = [],+ lines = value.split(/^/m);+ for (var i = 0; i < lines.length; i++) {+ var line = lines[i],+ lastLine = lines[i - 1],+ lastLineLastChar = lastLine && lastLine[lastLine.length - 1];-function objectToString(o) {- return Object.prototype.toString.call(o);-}+ // Merge lines that may contain windows new lines+ if (line === '\n' && lastLineLastChar === '\r') {+ retLines[retLines.length - 1] = retLines[retLines.length - 1].slice(0, -1) + '\r\n';+ } else {+ if (this.ignoreTrim) {+ line = line.trim();+ // add a newline unless this is the last line.+ if (i < lines.length - 1) {+ line += '\n';+ }+ }+ retLines.push(line);+ }+ }-}).call(this,{"isBuffer":require("../../is-buffer/index.js")})-},{"../../is-buffer/index.js":54}],49:[function(require,module,exports){-/* See LICENSE file for terms of use */+ return retLines;+ };-/*- * Text diff implementation.- *- * This library supports the following APIS:- * JsDiff.diffChars: Character by character diff- * JsDiff.diffWords: Word (as defined by \b regex) diff which ignores whitespace- * JsDiff.diffLines: Line based diff- *- * JsDiff.diffCss: Diff targeted at CSS content- *- * These methods are based on the implementation proposed in- * "An O(ND) Difference Algorithm and its Variations" (Myers, 1986).- * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6927- */-(function(global, undefined) {- var objectPrototypeToString = Object.prototype.toString;+ var PatchDiff = new Diff();+ PatchDiff.tokenize = function(value) {+ var ret = [],+ linesAndNewlines = value.split(/(\n|\r\n)/);- /*istanbul ignore next*/- function map(arr, mapper, that) {- if (Array.prototype.map) {- return Array.prototype.map.call(arr, mapper, that);+ // Ignore the final empty token that occurs if the string ends with a new line+ if (!linesAndNewlines[linesAndNewlines.length - 1]) {+ linesAndNewlines.pop();}- var other = new Array(arr.length);+ // Merge the content and line separators into single tokens+ for (var i = 0; i < linesAndNewlines.length; i++) {+ var line = linesAndNewlines[i];- for (var i = 0, n = arr.length; i < n; i++) {- other[i] = mapper.call(that, arr[i], i, arr);- }- return other;- }- function clonePath(path) {- return { newPos: path.newPos, components: path.components.slice(0) };- }- function removeEmpty(array) {- var ret = [];- for (var i = 0; i < array.length; i++) {- if (array[i]) {- ret.push(array[i]);+ if (i % 2) {+ ret[ret.length - 1] += line;+ } else {+ ret.push(line);}}return ret;- }- function escapeHTML(s) {- var n = s;- n = n.replace(/&/g, '&');- n = n.replace(/</g, '<');- n = n.replace(/>/g, '>');- n = n.replace(/"/g, '"');-- return n;- }-- // This function handles the presence of circular references by bailing out when encountering an- // object that is already on the "stack" of items being processed.- function canonicalize(obj, stack, replacementStack) {- stack = stack || [];- replacementStack = replacementStack || [];-- var i;+ };- for (i = 0; i < stack.length; i += 1) {- if (stack[i] === obj) {- return replacementStack[i];- }- }+ var SentenceDiff = new Diff();+ SentenceDiff.tokenize = function(value) {+ return removeEmpty(value.split(/(\S.+?[.!?])(?=\s+|$)/));+ };- var canonicalizedObj;+ var JsonDiff = new Diff();+ // Discriminate between two lines of pretty-printed, serialized JSON where one of them has a+ // dangling comma and the other doesn't. Turns out including the dangling comma yields the nicest output:+ JsonDiff.useLongestToken = true;+ JsonDiff.tokenize = LineDiff.tokenize;+ JsonDiff.equals = function(left, right) {+ return LineDiff.equals(left.replace(/,([\r\n])/g, '$1'), right.replace(/,([\r\n])/g, '$1'));+ };- if ('[object Array]' === objectPrototypeToString.call(obj)) {- stack.push(obj);- canonicalizedObj = new Array(obj.length);- replacementStack.push(canonicalizedObj);- for (i = 0; i < obj.length; i += 1) {- canonicalizedObj[i] = canonicalize(obj[i], stack, replacementStack);- }- stack.pop();- replacementStack.pop();- } else if (typeof obj === 'object' && obj !== null) {- stack.push(obj);- canonicalizedObj = {};- replacementStack.push(canonicalizedObj);- var sortedKeys = [],- key;- for (key in obj) {- sortedKeys.push(key);- }- sortedKeys.sort();- for (i = 0; i < sortedKeys.length; i += 1) {- key = sortedKeys[i];- canonicalizedObj[key] = canonicalize(obj[key], stack, replacementStack);- }- stack.pop();- replacementStack.pop();- } else {- canonicalizedObj = obj;- }- return canonicalizedObj;- }+ var JsDiff = {+ Diff: Diff,- function buildValues(components, newString, oldString, useLongestToken) {- var componentPos = 0,- componentLen = components.length,- newPos = 0,- oldPos = 0;+ diffChars: function(oldStr, newStr, callback) { return CharDiff.diff(oldStr, newStr, callback); },+ diffWords: function(oldStr, newStr, callback) { return WordDiff.diff(oldStr, newStr, callback); },+ diffWordsWithSpace: function(oldStr, newStr, callback) { return WordWithSpaceDiff.diff(oldStr, newStr, callback); },+ diffLines: function(oldStr, newStr, callback) { return LineDiff.diff(oldStr, newStr, callback); },+ diffTrimmedLines: function(oldStr, newStr, callback) { return TrimmedLineDiff.diff(oldStr, newStr, callback); },- for (; componentPos < componentLen; componentPos++) {- var component = components[componentPos];- if (!component.removed) {- if (!component.added && useLongestToken) {- var value = newString.slice(newPos, newPos + component.count);- value = map(value, function(value, i) {- var oldValue = oldString[oldPos + i];- return oldValue.length > value.length ? oldValue : value;- });+ diffSentences: function(oldStr, newStr, callback) { return SentenceDiff.diff(oldStr, newStr, callback); },- component.value = value.join('');- } else {- component.value = newString.slice(newPos, newPos + component.count).join('');- }- newPos += component.count;+ diffCss: function(oldStr, newStr, callback) { return CssDiff.diff(oldStr, newStr, callback); },+ diffJson: function(oldObj, newObj, callback) {+ return JsonDiff.diff(+ typeof oldObj === 'string' ? oldObj : JSON.stringify(canonicalize(oldObj), undefined, ' '),+ typeof newObj === 'string' ? newObj : JSON.stringify(canonicalize(newObj), undefined, ' '),+ callback+ );+ },- // Common case- if (!component.added) {- oldPos += component.count;- }- } else {- component.value = oldString.slice(oldPos, oldPos + component.count).join('');- oldPos += component.count;+ createTwoFilesPatch: function(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader) {+ var ret = [];- // Reverse add and remove so removes are output first to match common convention- // The diffing algorithm is tied to add then remove output and this is the simplest- // route to get the desired output with minimal overhead.- if (componentPos && components[componentPos - 1].added) {- var tmp = components[componentPos - 1];- components[componentPos - 1] = components[componentPos];- components[componentPos] = tmp;- }+ if (oldFileName == newFileName) {+ ret.push('Index: ' + oldFileName);}- }+ ret.push('===================================================================');+ ret.push('--- ' + oldFileName + (typeof oldHeader === 'undefined' ? '' : '\t' + oldHeader));+ ret.push('+++ ' + newFileName + (typeof newHeader === 'undefined' ? '' : '\t' + newHeader));- return components;- }+ var diff = PatchDiff.diff(oldStr, newStr);+ diff.push({value: '', lines: []}); // Append an empty value to make cleanup easier- function Diff(ignoreWhitespace) {- this.ignoreWhitespace = ignoreWhitespace;- }- Diff.prototype = {- diff: function(oldString, newString, callback) {- var self = this;+ // Formats a given set of lines for printing as context lines in a patch+ function contextLines(lines) {+ return map(lines, function(entry) { return ' ' + entry; });+ }- function done(value) {- if (callback) {- setTimeout(function() { callback(undefined, value); }, 0);- return true;- } else {- return value;+ // Outputs the no newline at end of file warning if needed+ function eofNL(curRange, i, current) {+ var last = diff[diff.length - 2],+ isLast = i === diff.length - 2,+ isLastOfType = i === diff.length - 3 && current.added !== last.added;++ // Figure out if this is the last line for the given file and missing NL+ if (!(/\n$/.test(current.value)) && (isLast || isLastOfType)) {+ curRange.push('\\ No newline at end of file');}}- // Handle the identity case (this is due to unrolling editLength == 0- if (newString === oldString) {- return done([{ value: newString }]);- }- if (!newString) {- return done([{ value: oldString, removed: true }]);- }- if (!oldString) {- return done([{ value: newString, added: true }]);- }+ var oldRangeStart = 0, newRangeStart = 0, curRange = [],+ oldLine = 1, newLine = 1;+ for (var i = 0; i < diff.length; i++) {+ var current = diff[i],+ lines = current.lines || current.value.replace(/\n$/, '').split('\n');+ current.lines = lines;- newString = this.tokenize(newString);- oldString = this.tokenize(oldString);+ if (current.added || current.removed) {+ // If we have previous context, start with that+ if (!oldRangeStart) {+ var prev = diff[i - 1];+ oldRangeStart = oldLine;+ newRangeStart = newLine;- var newLen = newString.length, oldLen = oldString.length;- var editLength = 1;- var maxEditLength = newLen + oldLen;- var bestPath = [{ newPos: -1, components: [] }];+ if (prev) {+ curRange = contextLines(prev.lines.slice(-4));+ oldRangeStart -= curRange.length;+ newRangeStart -= curRange.length;+ }+ }- // Seed editLength = 0, i.e. the content starts with the same values- var oldPos = this.extractCommon(bestPath[0], newString, oldString, 0);- if (bestPath[0].newPos + 1 >= newLen && oldPos + 1 >= oldLen) {- // Identity per the equality and tokenizer- return done([{value: newString.join('')}]);- }+ // Output our changes+ curRange.push.apply(curRange, map(lines, function(entry) {+ return (current.added ? '+' : '-') + entry;+ }));+ eofNL(curRange, i, current);- // Main worker method. checks all permutations of a given edit length for acceptance.- function execEditLength() {- for (var diagonalPath = -1 * editLength; diagonalPath <= editLength; diagonalPath += 2) {- var basePath;- var addPath = bestPath[diagonalPath - 1],- removePath = bestPath[diagonalPath + 1],- oldPos = (removePath ? removePath.newPos : 0) - diagonalPath;- if (addPath) {- // No one else is going to attempt to use this value, clear it- bestPath[diagonalPath - 1] = undefined;+ // Track the updated file position+ if (current.added) {+ newLine += lines.length;+ } else {+ oldLine += lines.length;}+ } else {+ // Identical context lines. Track line changes+ if (oldRangeStart) {+ // Close out any changes that have been output (or join overlapping)+ if (lines.length <= 8 && i < diff.length - 2) {+ // Overlapping+ curRange.push.apply(curRange, contextLines(lines));+ } else {+ // end the range and output+ var contextSize = Math.min(lines.length, 4);+ ret.push(+ '@@ -' + oldRangeStart + ',' + (oldLine - oldRangeStart + contextSize)+ + ' +' + newRangeStart + ',' + (newLine - newRangeStart + contextSize)+ + ' @@');+ ret.push.apply(ret, curRange);+ ret.push.apply(ret, contextLines(lines.slice(0, contextSize)));+ if (lines.length <= 4) {+ eofNL(ret, i, current);+ }- var canAdd = addPath && addPath.newPos + 1 < newLen,- canRemove = removePath && 0 <= oldPos && oldPos < oldLen;- if (!canAdd && !canRemove) {- // If this path is a terminal then prune- bestPath[diagonalPath] = undefined;- continue;+ oldRangeStart = 0;+ newRangeStart = 0;+ curRange = [];+ }}+ oldLine += lines.length;+ newLine += lines.length;+ }+ }- // Select the diagonal that we want to branch from. We select the prior- // path whose position in the new string is the farthest from the origin- // and does not pass the bounds of the diff graph- if (!canAdd || (canRemove && addPath.newPos < removePath.newPos)) {- basePath = clonePath(removePath);- self.pushComponent(basePath.components, undefined, true);- } else {- basePath = addPath; // No need to clone, we've pulled it from the list- basePath.newPos++;- self.pushComponent(basePath.components, true, undefined);- }+ return ret.join('\n') + '\n';+ },- oldPos = self.extractCommon(basePath, newString, oldString, diagonalPath);+ createPatch: function(fileName, oldStr, newStr, oldHeader, newHeader) {+ return JsDiff.createTwoFilesPatch(fileName, fileName, oldStr, newStr, oldHeader, newHeader);+ },- // If we have hit the end of both strings, then we are done- if (basePath.newPos + 1 >= newLen && oldPos + 1 >= oldLen) {- return done(buildValues(basePath.components, newString, oldString, self.useLongestToken));- } else {- // Otherwise track this path as a potential candidate and continue.- bestPath[diagonalPath] = basePath;+ applyPatch: function(oldStr, uniDiff) {+ var diffstr = uniDiff.split('\n'),+ hunks = [],+ i = 0,+ remEOFNL = false,+ addEOFNL = false;++ // Skip to the first change hunk+ while (i < diffstr.length && !(/^@@/.test(diffstr[i]))) {+ i++;+ }++ // Parse the unified diff+ for (; i < diffstr.length; i++) {+ if (diffstr[i][0] === '@') {+ var chnukHeader = diffstr[i].split(/@@ -(\d+),(\d+) \+(\d+),(\d+) @@/);+ hunks.unshift({+ start: chnukHeader[3],+ oldlength: +chnukHeader[2],+ removed: [],+ newlength: chnukHeader[4],+ added: []+ });+ } else if (diffstr[i][0] === '+') {+ hunks[0].added.push(diffstr[i].substr(1));+ } else if (diffstr[i][0] === '-') {+ hunks[0].removed.push(diffstr[i].substr(1));+ } else if (diffstr[i][0] === ' ') {+ hunks[0].added.push(diffstr[i].substr(1));+ hunks[0].removed.push(diffstr[i].substr(1));+ } else if (diffstr[i][0] === '\\') {+ if (diffstr[i - 1][0] === '+') {+ remEOFNL = true;+ } else if (diffstr[i - 1][0] === '-') {+ addEOFNL = true;}}+ }- editLength++;+ // Apply the diff to the input+ var lines = oldStr.split('\n');+ for (i = hunks.length - 1; i >= 0; i--) {+ var hunk = hunks[i];+ // Sanity check the input string. Bail if we don't match.+ for (var j = 0; j < hunk.oldlength; j++) {+ if (lines[hunk.start - 1 + j] !== hunk.removed[j]) {+ return false;+ }+ }+ Array.prototype.splice.apply(lines, [hunk.start - 1, hunk.oldlength].concat(hunk.added));}- // Performs the length of edit iteration. Is a bit fugly as this has to support the- // sync and async mode which is never fun. Loops over execEditLength until a value- // is produced.- if (callback) {- (function exec() {- setTimeout(function() {- // This should not happen, but we want to be safe.- /*istanbul ignore next */- if (editLength > maxEditLength) {- return callback();- }+ // Handle EOFNL insertion/removal+ if (remEOFNL) {+ while (!lines[lines.length - 1]) {+ lines.pop();+ }+ } else if (addEOFNL) {+ lines.push('');+ }+ return lines.join('\n');+ },- if (!execEditLength()) {- exec();- }- }, 0);- }());- } else {- while (editLength <= maxEditLength) {- var ret = execEditLength();- if (ret) {- return ret;- }+ convertChangesToXML: function(changes) {+ var ret = [];+ for (var i = 0; i < changes.length; i++) {+ var change = changes[i];+ if (change.added) {+ ret.push('<ins>');+ } else if (change.removed) {+ ret.push('<del>');}- }- },- pushComponent: function(components, added, removed) {- var last = components[components.length - 1];- if (last && last.added === added && last.removed === removed) {- // We need to clone here as the component clone operation is just- // as shallow array clone- components[components.length - 1] = {count: last.count + 1, added: added, removed: removed };- } else {- components.push({count: 1, added: added, removed: removed });+ ret.push(escapeHTML(change.value));++ if (change.added) {+ ret.push('</ins>');+ } else if (change.removed) {+ ret.push('</del>');+ }}+ return ret.join('');},- extractCommon: function(basePath, newString, oldString, diagonalPath) {- var newLen = newString.length,- oldLen = oldString.length,- newPos = basePath.newPos,- oldPos = newPos - diagonalPath,- commonCount = 0;- while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(newString[newPos + 1], oldString[oldPos + 1])) {- newPos++;- oldPos++;- commonCount++;- }+ // See: http://code.google.com/p/google-diff-match-patch/wiki/API+ convertChangesToDMP: function(changes) {+ var ret = [],+ change,+ operation;+ for (var i = 0; i < changes.length; i++) {+ change = changes[i];+ if (change.added) {+ operation = 1;+ } else if (change.removed) {+ operation = -1;+ } else {+ operation = 0;+ }- if (commonCount) {- basePath.components.push({count: commonCount});+ ret.push([operation, change.value]);}-- basePath.newPos = newPos;- return oldPos;+ return ret;},- equals: function(left, right) {- var reWhitespace = /\S/;- return left === right || (this.ignoreWhitespace && !reWhitespace.test(left) && !reWhitespace.test(right));- },- tokenize: function(value) {- return value.split('');- }+ canonicalize: canonicalize};- var CharDiff = new Diff();+ /*istanbul ignore next */+ /*global module */+ if (typeof module !== 'undefined' && module.exports) {+ module.exports = JsDiff;+ } else if (typeof define === 'function' && define.amd) {+ /*global define */+ define([], function() { return JsDiff; });+ } else if (typeof global.JsDiff === 'undefined') {+ global.JsDiff = JsDiff;+ }+}(this));- var WordDiff = new Diff(true);- var WordWithSpaceDiff = new Diff();- WordDiff.tokenize = WordWithSpaceDiff.tokenize = function(value) {- return removeEmpty(value.split(/(\s+|\b)/));- };+},{}],46:[function(require,module,exports){+'use strict';- var CssDiff = new Diff(true);- CssDiff.tokenize = function(value) {- return removeEmpty(value.split(/([{}:;,]|\s+)/));- };+var matchOperatorsRe = /[|\\{}()[\]^$+*?.]/g;- var LineDiff = new Diff();+module.exports = function (str) {+ if (typeof str !== 'string') {+ throw new TypeError('Expected a string');+ }- var TrimmedLineDiff = new Diff();- TrimmedLineDiff.ignoreTrim = true;+ return str.replace(matchOperatorsRe, '\\$&');+};- LineDiff.tokenize = TrimmedLineDiff.tokenize = function(value) {- var retLines = [],- lines = value.split(/^/m);- for (var i = 0; i < lines.length; i++) {- var line = lines[i],- lastLine = lines[i - 1],- lastLineLastChar = lastLine && lastLine[lastLine.length - 1];+},{}],47:[function(require,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.- // Merge lines that may contain windows new lines- if (line === '\n' && lastLineLastChar === '\r') {- retLines[retLines.length - 1] = retLines[retLines.length - 1].slice(0, -1) + '\r\n';+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} else {- if (this.ignoreTrim) {- line = line.trim();- // add a newline unless this is the last line.- if (i < lines.length - 1) {- line += '\n';- }- }- retLines.push(line);+ // At least give some kind of context to the user+ var err = new Error('Uncaught, unspecified "error" event. (' + er + ')');+ err.context = er;+ throw err;}}+ }- return retLines;- };+ handler = this._events[type];- var PatchDiff = new Diff();- PatchDiff.tokenize = function(value) {- var ret = [],- linesAndNewlines = value.split(/(\n|\r\n)/);+ if (isUndefined(handler))+ return false;- // Ignore the final empty token that occurs if the string ends with a new line- if (!linesAndNewlines[linesAndNewlines.length - 1]) {- linesAndNewlines.pop();+ 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);+ }- // Merge the content and line separators into single tokens- for (var i = 0; i < linesAndNewlines.length; i++) {- var line = linesAndNewlines[i];+ return true;+};- if (i % 2) {- ret[ret.length - 1] += line;- } else {- ret.push(line);- }- }- return ret;- };+EventEmitter.prototype.addListener = function(type, listener) {+ var m;- var SentenceDiff = new Diff();- SentenceDiff.tokenize = function(value) {- return removeEmpty(value.split(/(\S.+?[.!?])(?=\s+|$)/));- };+ if (!isFunction(listener))+ throw TypeError('listener must be a function');- var JsonDiff = new Diff();- // Discriminate between two lines of pretty-printed, serialized JSON where one of them has a- // dangling comma and the other doesn't. Turns out including the dangling comma yields the nicest output:- JsonDiff.useLongestToken = true;- JsonDiff.tokenize = LineDiff.tokenize;- JsonDiff.equals = function(left, right) {- return LineDiff.equals(left.replace(/,([\r\n])/g, '$1'), right.replace(/,([\r\n])/g, '$1'));- };+ if (!this._events)+ this._events = {};- var JsDiff = {- Diff: Diff,+ // 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;+ }- diffChars: function(oldStr, newStr, callback) { return CharDiff.diff(oldStr, newStr, callback); },- diffWords: function(oldStr, newStr, callback) { return WordDiff.diff(oldStr, newStr, callback); },- diffWordsWithSpace: function(oldStr, newStr, callback) { return WordWithSpaceDiff.diff(oldStr, newStr, callback); },- diffLines: function(oldStr, newStr, callback) { return LineDiff.diff(oldStr, newStr, callback); },- diffTrimmedLines: function(oldStr, newStr, callback) { return TrimmedLineDiff.diff(oldStr, newStr, callback); },+ 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();+ }+ }+ }- diffSentences: function(oldStr, newStr, callback) { return SentenceDiff.diff(oldStr, newStr, callback); },+ return this;+};- diffCss: function(oldStr, newStr, callback) { return CssDiff.diff(oldStr, newStr, callback); },- diffJson: function(oldObj, newObj, callback) {- return JsonDiff.diff(- typeof oldObj === 'string' ? oldObj : JSON.stringify(canonicalize(oldObj), undefined, ' '),- typeof newObj === 'string' ? newObj : JSON.stringify(canonicalize(newObj), undefined, ' '),- callback- );- },+EventEmitter.prototype.on = EventEmitter.prototype.addListener;- createTwoFilesPatch: function(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader) {- var ret = [];+EventEmitter.prototype.once = function(type, listener) {+ if (!isFunction(listener))+ throw TypeError('listener must be a function');- if (oldFileName == newFileName) {- ret.push('Index: ' + oldFileName);- }- ret.push('===================================================================');- ret.push('--- ' + oldFileName + (typeof oldHeader === 'undefined' ? '' : '\t' + oldHeader));- ret.push('+++ ' + newFileName + (typeof newHeader === 'undefined' ? '' : '\t' + newHeader));+ var fired = false;- var diff = PatchDiff.diff(oldStr, newStr);- diff.push({value: '', lines: []}); // Append an empty value to make cleanup easier+ function g() {+ this.removeListener(type, g);- // Formats a given set of lines for printing as context lines in a patch- function contextLines(lines) {- return map(lines, function(entry) { return ' ' + entry; });- }+ if (!fired) {+ fired = true;+ listener.apply(this, arguments);+ }+ }- // Outputs the no newline at end of file warning if needed- function eofNL(curRange, i, current) {- var last = diff[diff.length - 2],- isLast = i === diff.length - 2,- isLastOfType = i === diff.length - 3 && current.added !== last.added;+ g.listener = listener;+ this.on(type, g);- // Figure out if this is the last line for the given file and missing NL- if (!(/\n$/.test(current.value)) && (isLast || isLastOfType)) {- curRange.push('\\ No newline at end of file');- }- }+ return this;+};- var oldRangeStart = 0, newRangeStart = 0, curRange = [],- oldLine = 1, newLine = 1;- for (var i = 0; i < diff.length; i++) {- var current = diff[i],- lines = current.lines || current.value.replace(/\n$/, '').split('\n');- current.lines = lines;+// emits a 'removeListener' event iff the listener was removed+EventEmitter.prototype.removeListener = function(type, listener) {+ var list, position, length, i;- if (current.added || current.removed) {- // If we have previous context, start with that- if (!oldRangeStart) {- var prev = diff[i - 1];- oldRangeStart = oldLine;- newRangeStart = newLine;+ if (!isFunction(listener))+ throw TypeError('listener must be a function');- if (prev) {- curRange = contextLines(prev.lines.slice(-4));- oldRangeStart -= curRange.length;- newRangeStart -= curRange.length;- }- }+ if (!this._events || !this._events[type])+ return this;- // Output our changes- curRange.push.apply(curRange, map(lines, function(entry) {- return (current.added ? '+' : '-') + entry;- }));- eofNL(curRange, i, current);+ list = this._events[type];+ length = list.length;+ position = -1;- // Track the updated file position- if (current.added) {- newLine += lines.length;- } else {- oldLine += lines.length;- }- } else {- // Identical context lines. Track line changes- if (oldRangeStart) {- // Close out any changes that have been output (or join overlapping)- if (lines.length <= 8 && i < diff.length - 2) {- // Overlapping- curRange.push.apply(curRange, contextLines(lines));- } else {- // end the range and output- var contextSize = Math.min(lines.length, 4);- ret.push(- '@@ -' + oldRangeStart + ',' + (oldLine - oldRangeStart + contextSize)- + ' +' + newRangeStart + ',' + (newLine - newRangeStart + contextSize)- + ' @@');- ret.push.apply(ret, curRange);- ret.push.apply(ret, contextLines(lines.slice(0, contextSize)));- if (lines.length <= 4) {- eofNL(ret, i, current);- }+ if (list === listener ||+ (isFunction(list.listener) && list.listener === listener)) {+ delete this._events[type];+ if (this._events.removeListener)+ this.emit('removeListener', type, listener);- oldRangeStart = 0;- newRangeStart = 0;- curRange = [];- }- }- oldLine += lines.length;- newLine += lines.length;- }+ } else if (isObject(list)) {+ for (i = length; i-- > 0;) {+ if (list[i] === listener ||+ (list[i].listener && list[i].listener === listener)) {+ position = i;+ break;}+ }- return ret.join('\n') + '\n';- },+ if (position < 0)+ return this;- createPatch: function(fileName, oldStr, newStr, oldHeader, newHeader) {- return JsDiff.createTwoFilesPatch(fileName, fileName, oldStr, newStr, oldHeader, newHeader);- },+ if (list.length === 1) {+ list.length = 0;+ delete this._events[type];+ } else {+ list.splice(position, 1);+ }- applyPatch: function(oldStr, uniDiff) {- var diffstr = uniDiff.split('\n'),- hunks = [],- i = 0,- remEOFNL = false,- addEOFNL = false;+ if (this._events.removeListener)+ this.emit('removeListener', type, listener);+ }- // Skip to the first change hunk- while (i < diffstr.length && !(/^@@/.test(diffstr[i]))) {- i++;- }+ return this;+};- // Parse the unified diff- for (; i < diffstr.length; i++) {- if (diffstr[i][0] === '@') {- var chnukHeader = diffstr[i].split(/@@ -(\d+),(\d+) \+(\d+),(\d+) @@/);- hunks.unshift({- start: chnukHeader[3],- oldlength: +chnukHeader[2],- removed: [],- newlength: chnukHeader[4],- added: []- });- } else if (diffstr[i][0] === '+') {- hunks[0].added.push(diffstr[i].substr(1));- } else if (diffstr[i][0] === '-') {- hunks[0].removed.push(diffstr[i].substr(1));- } else if (diffstr[i][0] === ' ') {- hunks[0].added.push(diffstr[i].substr(1));- hunks[0].removed.push(diffstr[i].substr(1));- } else if (diffstr[i][0] === '\\') {- if (diffstr[i - 1][0] === '+') {- remEOFNL = true;- } else if (diffstr[i - 1][0] === '-') {- addEOFNL = true;- }- }- }+EventEmitter.prototype.removeAllListeners = function(type) {+ var key, listeners;- // Apply the diff to the input- var lines = oldStr.split('\n');- for (i = hunks.length - 1; i >= 0; i--) {- var hunk = hunks[i];- // Sanity check the input string. Bail if we don't match.- for (var j = 0; j < hunk.oldlength; j++) {- if (lines[hunk.start - 1 + j] !== hunk.removed[j]) {- return false;- }- }- Array.prototype.splice.apply(lines, [hunk.start - 1, hunk.oldlength].concat(hunk.added));- }+ if (!this._events)+ return this;- // Handle EOFNL insertion/removal- if (remEOFNL) {- while (!lines[lines.length - 1]) {- lines.pop();- }- } else if (addEOFNL) {- lines.push('');- }- return lines.join('\n');- },+ // 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;+ }- convertChangesToXML: function(changes) {- var ret = [];- for (var i = 0; i < changes.length; i++) {- var change = changes[i];- if (change.added) {- ret.push('<ins>');- } else if (change.removed) {- ret.push('<del>');- }+ // 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;+ }- ret.push(escapeHTML(change.value));+ listeners = this._events[type];- if (change.added) {- ret.push('</ins>');- } else if (change.removed) {- ret.push('</del>');- }- }- return ret.join('');- },+ 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];- // See: http://code.google.com/p/google-diff-match-patch/wiki/API- convertChangesToDMP: function(changes) {- var ret = [],- change,- operation;- for (var i = 0; i < changes.length; i++) {- change = changes[i];- if (change.added) {- operation = 1;- } else if (change.removed) {- operation = -1;- } else {- operation = 0;- }+ return this;+};- ret.push([operation, change.value]);- }- return ret;- },+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;+};- canonicalize: canonicalize- };+EventEmitter.prototype.listenerCount = function(type) {+ if (this._events) {+ var evlistener = this._events[type];- /*istanbul ignore next */- /*global module */- if (typeof module !== 'undefined' && module.exports) {- module.exports = JsDiff;- } else if (typeof define === 'function' && define.amd) {- /*global define */- define([], function() { return JsDiff; });- } else if (typeof global.JsDiff === 'undefined') {- global.JsDiff = JsDiff;+ if (isFunction(evlistener))+ return 1;+ else if (evlistener)+ return evlistener.length;}-}(this));+ return 0;+};-},{}],50:[function(require,module,exports){-'use strict';+EventEmitter.listenerCount = function(emitter, type) {+ return emitter.listenerCount(type);+};-var matchOperatorsRe = /[|\\{}()[\]^$+*?.]/g;+function isFunction(arg) {+ return typeof arg === 'function';+}-module.exports = function (str) {- if (typeof str !== 'string') {- throw new TypeError('Expected a string');- }+function isNumber(arg) {+ return typeof arg === 'number';+}- return str.replace(matchOperatorsRe, '\\$&');-};+function isObject(arg) {+ return typeof arg === 'object' && arg !== null;+}-},{}],51:[function(require,module,exports){+function isUndefined(arg) {+ return arg === void 0;+}++},{}],48:[function(require,module,exports){(function (process){// Growl - Copyright TJ Holowaychuk <[email protected]> (MIT Licensed)@@ -10150,7 +9807,7 @@ function growl(msg, options, fn) {};}).call(this,require('_process'))-},{"_process":69,"child_process":42,"fs":42,"os":67,"path":42}],52:[function(require,module,exports){+},{"_process":66,"child_process":41,"fs":41,"os":64,"path":41}],49:[function(require,module,exports){exports.read = function (buffer, offset, isLE, mLen, nBytes) {var e, mvar eLen = nBytes * 8 - mLen - 1@@ -10236,7 +9893,7 @@ exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {buffer[offset + i - d] |= s * 128}-},{}],53:[function(require,module,exports){+},{}],50:[function(require,module,exports){if (typeof Object.create === 'function') {// implementation from standard node.js 'util' modulemodule.exports = function inherits(ctor, superCtor) {@@ -10261,7 +9918,7 @@ if (typeof Object.create === 'function') {}}-},{}],54:[function(require,module,exports){+},{}],51:[function(require,module,exports){/*** Determine if an object is Buffer*@@ -10280,14 +9937,14 @@ module.exports = function (obj) {))}-},{}],55:[function(require,module,exports){+},{}],52:[function(require,module,exports){var toString = {}.toString;module.exports = Array.isArray || function (arr) {return toString.call(arr) == '[object Array]';};-},{}],56:[function(require,module,exports){+},{}],53:[function(require,module,exports){(function (global){/*! JSON v3.3.2 | http://bestiejs.github.io/json3 | Copyright 2012-2014, Kit Cambridge | http://kit.mit-license.org */;(function () {@@ -11193,7 +10850,7 @@ module.exports = Array.isArray || function (arr) {}).call(this);}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{}],57:[function(require,module,exports){+},{}],54:[function(require,module,exports){/*** lodash 3.2.0 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -11222,7 +10879,7 @@ function baseAssign(object, source) {module.exports = baseAssign;-},{"lodash._basecopy":58,"lodash.keys":65}],58:[function(require,module,exports){+},{"lodash._basecopy":55,"lodash.keys":62}],55:[function(require,module,exports){/*** lodash 3.0.1 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -11256,7 +10913,7 @@ function baseCopy(source, props, object) {module.exports = baseCopy;-},{}],59:[function(require,module,exports){+},{}],56:[function(require,module,exports){/*** lodash 3.0.3 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -11315,7 +10972,7 @@ function isObject(value) {module.exports = baseCreate;-},{}],60:[function(require,module,exports){+},{}],57:[function(require,module,exports){/*** lodash 3.9.1 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -11454,7 +11111,7 @@ function isNative(value) {module.exports = getNative;-},{}],61:[function(require,module,exports){+},{}],58:[function(require,module,exports){/*** lodash 3.0.9 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -11588,7 +11245,7 @@ function isObject(value) {module.exports = isIterateeCall;-},{}],62:[function(require,module,exports){+},{}],59:[function(require,module,exports){/*** lodash 3.1.1 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -11645,7 +11302,7 @@ function create(prototype, properties, guard) {module.exports = create;-},{"lodash._baseassign":57,"lodash._basecreate":59,"lodash._isiterateecall":61}],63:[function(require,module,exports){+},{"lodash._baseassign":54,"lodash._basecreate":56,"lodash._isiterateecall":58}],60:[function(require,module,exports){/*** lodash 3.0.8 (Custom Build) <https://lodash.com/>* Build: `lodash modularize exports="npm" -o ./`@@ -11890,7 +11547,7 @@ function isObjectLike(value) {module.exports = isArguments;-},{}],64:[function(require,module,exports){+},{}],61:[function(require,module,exports){/*** lodash 3.0.4 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -12072,7 +11729,7 @@ function isNative(value) {module.exports = isArray;-},{}],65:[function(require,module,exports){+},{}],62:[function(require,module,exports){/*** lodash 3.1.2 (Custom Build) <https://lodash.com/>* Build: `lodash modern modularize exports="npm" -o ./`@@ -12310,7 +11967,7 @@ function keysIn(object) {module.exports = keys;-},{"lodash._getnative":60,"lodash.isarguments":63,"lodash.isarray":64}],66:[function(require,module,exports){+},{"lodash._getnative":57,"lodash.isarguments":60,"lodash.isarray":61}],63:[function(require,module,exports){(function (process){var path = require('path');var fs = require('fs');@@ -12412,7 +12069,7 @@ mkdirP.sync = function sync (p, opts, made) {};}).call(this,require('_process'))-},{"_process":69,"fs":42,"path":42}],67:[function(require,module,exports){+},{"_process":66,"fs":41,"path":41}],64:[function(require,module,exports){exports.endianness = function () { return 'LE' };exports.hostname = function () {@@ -12459,7 +12116,7 @@ exports.tmpdir = exports.tmpDir = function () {exports.EOL = '\n';-},{}],68:[function(require,module,exports){+},{}],65:[function(require,module,exports){(function (process){'use strict';@@ -12506,15 +12163,35 @@ function nextTick(fn, arg1, arg2, arg3) {}}).call(this,require('_process'))-},{"_process":69}],69:[function(require,module,exports){+},{"_process":66}],66:[function(require,module,exports){// shim for using process in browservar process = module.exports = {};-// cached from whatever global is present so that test runners that stub it don't break things.-var cachedSetTimeout = setTimeout;-var cachedClearTimeout = clearTimeout;+// cached from whatever global is present so that test runners that stub it+// don't break things. But we need to wrap it in a try catch in case it is+// wrapped in strict mode code which doesn't define any globals. It's inside a+// function because try/catches deoptimize in certain engines.+var cachedSetTimeout;+var cachedClearTimeout;++(function () {+ try {+ cachedSetTimeout = setTimeout;+ } catch (e) {+ cachedSetTimeout = function () {+ throw new Error('setTimeout is not defined');+ }+ }+ try {+ cachedClearTimeout = clearTimeout;+ } catch (e) {+ cachedClearTimeout = function () {+ throw new Error('clearTimeout is not defined');+ }+ }+} ())var queue = [];var draining = false;var currentQueue;@@ -12607,10 +12284,10 @@ process.chdir = function (dir) {};process.umask = function() { return 0; };-},{}],70:[function(require,module,exports){+},{}],67:[function(require,module,exports){module.exports = require("./lib/_stream_duplex.js")-},{"./lib/_stream_duplex.js":71}],71:[function(require,module,exports){+},{"./lib/_stream_duplex.js":68}],68:[function(require,module,exports){// 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@@ -12686,7 +12363,7 @@ function forEach(xs, f) {f(xs[i], i);}}-},{"./_stream_readable":73,"./_stream_writable":75,"core-util-is":48,"inherits":53,"process-nextick-args":68}],72:[function(require,module,exports){+},{"./_stream_readable":70,"./_stream_writable":72,"core-util-is":44,"inherits":50,"process-nextick-args":65}],69:[function(require,module,exports){// a passthrough stream.// basically just the most minimal sort of Transform stream.// Every written chunk gets output as-is.@@ -12713,7 +12390,7 @@ function PassThrough(options) {PassThrough.prototype._transform = function (chunk, encoding, cb) {cb(null, chunk);};-},{"./_stream_transform":74,"core-util-is":48,"inherits":53}],73:[function(require,module,exports){+},{"./_stream_transform":71,"core-util-is":44,"inherits":50}],70:[function(require,module,exports){(function (process){'use strict';@@ -13609,7 +13286,7 @@ function indexOf(xs, x) {return -1;}}).call(this,require('_process'))-},{"./_stream_duplex":71,"_process":69,"buffer":43,"buffer-shims":47,"core-util-is":48,"events":45,"inherits":53,"isarray":55,"process-nextick-args":68,"string_decoder/":80,"util":40}],74:[function(require,module,exports){+},{"./_stream_duplex":68,"_process":66,"buffer":43,"buffer-shims":42,"core-util-is":44,"events":47,"inherits":50,"isarray":52,"process-nextick-args":65,"string_decoder/":78,"util":39}],71:[function(require,module,exports){// 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@@ -13790,7 +13467,7 @@ function done(stream, er) {return stream.push(null);}-},{"./_stream_duplex":71,"core-util-is":48,"inherits":53}],75:[function(require,module,exports){+},{"./_stream_duplex":68,"core-util-is":44,"inherits":50}],72:[function(require,module,exports){(function (process){// A bit simpler than readable streams.// Implement an async ._write(chunk, encoding, cb), and it'll handle all@@ -14319,10 +13996,10 @@ function CorkedRequest(state) {};}}).call(this,require('_process'))-},{"./_stream_duplex":71,"_process":69,"buffer":43,"buffer-shims":47,"core-util-is":48,"events":45,"inherits":53,"process-nextick-args":68,"util-deprecate":82}],76:[function(require,module,exports){+},{"./_stream_duplex":68,"_process":66,"buffer":43,"buffer-shims":42,"core-util-is":44,"events":47,"inherits":50,"process-nextick-args":65,"util-deprecate":80}],73:[function(require,module,exports){module.exports = require("./lib/_stream_passthrough.js")-},{"./lib/_stream_passthrough.js":72}],77:[function(require,module,exports){+},{"./lib/_stream_passthrough.js":69}],74:[function(require,module,exports){(function (process){var Stream = (function (){try {@@ -14342,13 +14019,142 @@ if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) {}}).call(this,require('_process'))-},{"./lib/_stream_duplex.js":71,"./lib/_stream_passthrough.js":72,"./lib/_stream_readable.js":73,"./lib/_stream_transform.js":74,"./lib/_stream_writable.js":75,"_process":69}],78:[function(require,module,exports){+},{"./lib/_stream_duplex.js":68,"./lib/_stream_passthrough.js":69,"./lib/_stream_readable.js":70,"./lib/_stream_transform.js":71,"./lib/_stream_writable.js":72,"_process":66}],75:[function(require,module,exports){module.exports = require("./lib/_stream_transform.js")-},{"./lib/_stream_transform.js":74}],79:[function(require,module,exports){+},{"./lib/_stream_transform.js":71}],76:[function(require,module,exports){module.exports = require("./lib/_stream_writable.js")-},{"./lib/_stream_writable.js":75}],80:[function(require,module,exports){+},{"./lib/_stream_writable.js":72}],77:[function(require,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.++module.exports = Stream;++var EE = require('events').EventEmitter;+var inherits = require('inherits');++inherits(Stream, EE);+Stream.Readable = require('readable-stream/readable.js');+Stream.Writable = require('readable-stream/writable.js');+Stream.Duplex = require('readable-stream/duplex.js');+Stream.Transform = require('readable-stream/transform.js');+Stream.PassThrough = require('readable-stream/passthrough.js');++// 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;+};++},{"events":47,"inherits":50,"readable-stream/duplex.js":67,"readable-stream/passthrough.js":73,"readable-stream/readable.js":74,"readable-stream/transform.js":75,"readable-stream/writable.js":76}],78:[function(require,module,exports){// Copyright Joyent, Inc. and other Node contributors.//// Permission is hereby granted, free of charge, to any person obtaining a@@ -14571,7 +14377,7 @@ function base64DetectIncompleteChar(buffer) {this.charLength = this.charReceived ? 3 : 0;}-},{"buffer":43}],81:[function(require,module,exports){+},{"buffer":43}],79:[function(require,module,exports){/*** Expose `toIsoString`.@@ -14612,7 +14418,7 @@ function pad (number) {var n = number.toString();return n.length === 1 ? '0' + n : n;}-},{}],82:[function(require,module,exports){+},{}],80:[function(require,module,exports){(function (global){/**@@ -14683,14 +14489,14 @@ function config (name) {}}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{}],83:[function(require,module,exports){+},{}],81:[function(require,module,exports){module.exports = function isBuffer(arg) {return arg && typeof arg === 'object'&& typeof arg.copy === 'function'&& typeof arg.fill === 'function'&& typeof arg.readUInt8 === 'function';}-},{}],84:[function(require,module,exports){+},{}],82:[function(require,module,exports){(function (process,global){// Copyright Joyent, Inc. and other Node contributors.//@@ -15280,4 +15086,4 @@ function hasOwnProperty(obj, prop) {}}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})-},{"./support/isBuffer":83,"_process":69,"inherits":53}]},{},[1]);+},{"./support/isBuffer":81,"_process":66,"inherits":50}]},{},[1]);