5865 lines
146 KiB
JavaScript
5865 lines
146 KiB
JavaScript
exports.id = 371;
|
|
exports.ids = [371];
|
|
exports.modules = {
|
|
|
|
/***/ 3353:
|
|
/***/ ((module) => {
|
|
|
|
"use strict";
|
|
|
|
module.exports = balanced;
|
|
function balanced(a, b, str) {
|
|
if (a instanceof RegExp) a = maybeMatch(a, str);
|
|
if (b instanceof RegExp) b = maybeMatch(b, str);
|
|
|
|
var r = range(a, b, str);
|
|
|
|
return r && {
|
|
start: r[0],
|
|
end: r[1],
|
|
pre: str.slice(0, r[0]),
|
|
body: str.slice(r[0] + a.length, r[1]),
|
|
post: str.slice(r[1] + b.length)
|
|
};
|
|
}
|
|
|
|
function maybeMatch(reg, str) {
|
|
var m = str.match(reg);
|
|
return m ? m[0] : null;
|
|
}
|
|
|
|
balanced.range = range;
|
|
function range(a, b, str) {
|
|
var begs, beg, left, right, result;
|
|
var ai = str.indexOf(a);
|
|
var bi = str.indexOf(b, ai + 1);
|
|
var i = ai;
|
|
|
|
if (ai >= 0 && bi > 0) {
|
|
begs = [];
|
|
left = str.length;
|
|
|
|
while (i >= 0 && !result) {
|
|
if (i == ai) {
|
|
begs.push(i);
|
|
ai = str.indexOf(a, i + 1);
|
|
} else if (begs.length == 1) {
|
|
result = [ begs.pop(), bi ];
|
|
} else {
|
|
beg = begs.pop();
|
|
if (beg < left) {
|
|
left = beg;
|
|
right = bi;
|
|
}
|
|
|
|
bi = str.indexOf(b, i + 1);
|
|
}
|
|
|
|
i = ai < bi && ai >= 0 ? ai : bi;
|
|
}
|
|
|
|
if (begs.length) {
|
|
result = [ left, right ];
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 3197:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
var concatMap = __webpack_require__(4527);
|
|
var balanced = __webpack_require__(3353);
|
|
|
|
module.exports = expandTop;
|
|
|
|
var escSlash = '\0SLASH'+Math.random()+'\0';
|
|
var escOpen = '\0OPEN'+Math.random()+'\0';
|
|
var escClose = '\0CLOSE'+Math.random()+'\0';
|
|
var escComma = '\0COMMA'+Math.random()+'\0';
|
|
var escPeriod = '\0PERIOD'+Math.random()+'\0';
|
|
|
|
function numeric(str) {
|
|
return parseInt(str, 10) == str
|
|
? parseInt(str, 10)
|
|
: str.charCodeAt(0);
|
|
}
|
|
|
|
function escapeBraces(str) {
|
|
return str.split('\\\\').join(escSlash)
|
|
.split('\\{').join(escOpen)
|
|
.split('\\}').join(escClose)
|
|
.split('\\,').join(escComma)
|
|
.split('\\.').join(escPeriod);
|
|
}
|
|
|
|
function unescapeBraces(str) {
|
|
return str.split(escSlash).join('\\')
|
|
.split(escOpen).join('{')
|
|
.split(escClose).join('}')
|
|
.split(escComma).join(',')
|
|
.split(escPeriod).join('.');
|
|
}
|
|
|
|
|
|
// Basically just str.split(","), but handling cases
|
|
// where we have nested braced sections, which should be
|
|
// treated as individual members, like {a,{b,c},d}
|
|
function parseCommaParts(str) {
|
|
if (!str)
|
|
return [''];
|
|
|
|
var parts = [];
|
|
var m = balanced('{', '}', str);
|
|
|
|
if (!m)
|
|
return str.split(',');
|
|
|
|
var pre = m.pre;
|
|
var body = m.body;
|
|
var post = m.post;
|
|
var p = pre.split(',');
|
|
|
|
p[p.length-1] += '{' + body + '}';
|
|
var postParts = parseCommaParts(post);
|
|
if (post.length) {
|
|
p[p.length-1] += postParts.shift();
|
|
p.push.apply(p, postParts);
|
|
}
|
|
|
|
parts.push.apply(parts, p);
|
|
|
|
return parts;
|
|
}
|
|
|
|
function expandTop(str) {
|
|
if (!str)
|
|
return [];
|
|
|
|
// I don't know why Bash 4.3 does this, but it does.
|
|
// Anything starting with {} will have the first two bytes preserved
|
|
// but *only* at the top level, so {},a}b will not expand to anything,
|
|
// but a{},b}c will be expanded to [a}c,abc].
|
|
// One could argue that this is a bug in Bash, but since the goal of
|
|
// this module is to match Bash's rules, we escape a leading {}
|
|
if (str.substr(0, 2) === '{}') {
|
|
str = '\\{\\}' + str.substr(2);
|
|
}
|
|
|
|
return expand(escapeBraces(str), true).map(unescapeBraces);
|
|
}
|
|
|
|
function identity(e) {
|
|
return e;
|
|
}
|
|
|
|
function embrace(str) {
|
|
return '{' + str + '}';
|
|
}
|
|
function isPadded(el) {
|
|
return /^-?0\d/.test(el);
|
|
}
|
|
|
|
function lte(i, y) {
|
|
return i <= y;
|
|
}
|
|
function gte(i, y) {
|
|
return i >= y;
|
|
}
|
|
|
|
function expand(str, isTop) {
|
|
var expansions = [];
|
|
|
|
var m = balanced('{', '}', str);
|
|
if (!m || /\$$/.test(m.pre)) return [str];
|
|
|
|
var isNumericSequence = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(m.body);
|
|
var isAlphaSequence = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(m.body);
|
|
var isSequence = isNumericSequence || isAlphaSequence;
|
|
var isOptions = m.body.indexOf(',') >= 0;
|
|
if (!isSequence && !isOptions) {
|
|
// {a},b}
|
|
if (m.post.match(/,.*\}/)) {
|
|
str = m.pre + '{' + m.body + escClose + m.post;
|
|
return expand(str);
|
|
}
|
|
return [str];
|
|
}
|
|
|
|
var n;
|
|
if (isSequence) {
|
|
n = m.body.split(/\.\./);
|
|
} else {
|
|
n = parseCommaParts(m.body);
|
|
if (n.length === 1) {
|
|
// x{{a,b}}y ==> x{a}y x{b}y
|
|
n = expand(n[0], false).map(embrace);
|
|
if (n.length === 1) {
|
|
var post = m.post.length
|
|
? expand(m.post, false)
|
|
: [''];
|
|
return post.map(function(p) {
|
|
return m.pre + n[0] + p;
|
|
});
|
|
}
|
|
}
|
|
}
|
|
|
|
// at this point, n is the parts, and we know it's not a comma set
|
|
// with a single entry.
|
|
|
|
// no need to expand pre, since it is guaranteed to be free of brace-sets
|
|
var pre = m.pre;
|
|
var post = m.post.length
|
|
? expand(m.post, false)
|
|
: [''];
|
|
|
|
var N;
|
|
|
|
if (isSequence) {
|
|
var x = numeric(n[0]);
|
|
var y = numeric(n[1]);
|
|
var width = Math.max(n[0].length, n[1].length)
|
|
var incr = n.length == 3
|
|
? Math.abs(numeric(n[2]))
|
|
: 1;
|
|
var test = lte;
|
|
var reverse = y < x;
|
|
if (reverse) {
|
|
incr *= -1;
|
|
test = gte;
|
|
}
|
|
var pad = n.some(isPadded);
|
|
|
|
N = [];
|
|
|
|
for (var i = x; test(i, y); i += incr) {
|
|
var c;
|
|
if (isAlphaSequence) {
|
|
c = String.fromCharCode(i);
|
|
if (c === '\\')
|
|
c = '';
|
|
} else {
|
|
c = String(i);
|
|
if (pad) {
|
|
var need = width - c.length;
|
|
if (need > 0) {
|
|
var z = new Array(need + 1).join('0');
|
|
if (i < 0)
|
|
c = '-' + z + c.slice(1);
|
|
else
|
|
c = z + c;
|
|
}
|
|
}
|
|
}
|
|
N.push(c);
|
|
}
|
|
} else {
|
|
N = concatMap(n, function(el) { return expand(el, false) });
|
|
}
|
|
|
|
for (var j = 0; j < N.length; j++) {
|
|
for (var k = 0; k < post.length; k++) {
|
|
var expansion = pre + N[j] + post[k];
|
|
if (!isTop || isSequence || expansion)
|
|
expansions.push(expansion);
|
|
}
|
|
}
|
|
|
|
return expansions;
|
|
}
|
|
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 4527:
|
|
/***/ ((module) => {
|
|
|
|
module.exports = function (xs, fn) {
|
|
var res = [];
|
|
for (var i = 0; i < xs.length; i++) {
|
|
var x = fn(xs[i], i);
|
|
if (isArray(x)) res.push.apply(res, x);
|
|
else res.push(x);
|
|
}
|
|
return res;
|
|
};
|
|
|
|
var isArray = Array.isArray || function (xs) {
|
|
return Object.prototype.toString.call(xs) === '[object Array]';
|
|
};
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 8945:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
module.exports = realpath
|
|
realpath.realpath = realpath
|
|
realpath.sync = realpathSync
|
|
realpath.realpathSync = realpathSync
|
|
realpath.monkeypatch = monkeypatch
|
|
realpath.unmonkeypatch = unmonkeypatch
|
|
|
|
var fs = __webpack_require__(7147)
|
|
var origRealpath = fs.realpath
|
|
var origRealpathSync = fs.realpathSync
|
|
|
|
var version = process.version
|
|
var ok = /^v[0-5]\./.test(version)
|
|
var old = __webpack_require__(4403)
|
|
|
|
function newError (er) {
|
|
return er && er.syscall === 'realpath' && (
|
|
er.code === 'ELOOP' ||
|
|
er.code === 'ENOMEM' ||
|
|
er.code === 'ENAMETOOLONG'
|
|
)
|
|
}
|
|
|
|
function realpath (p, cache, cb) {
|
|
if (ok) {
|
|
return origRealpath(p, cache, cb)
|
|
}
|
|
|
|
if (typeof cache === 'function') {
|
|
cb = cache
|
|
cache = null
|
|
}
|
|
origRealpath(p, cache, function (er, result) {
|
|
if (newError(er)) {
|
|
old.realpath(p, cache, cb)
|
|
} else {
|
|
cb(er, result)
|
|
}
|
|
})
|
|
}
|
|
|
|
function realpathSync (p, cache) {
|
|
if (ok) {
|
|
return origRealpathSync(p, cache)
|
|
}
|
|
|
|
try {
|
|
return origRealpathSync(p, cache)
|
|
} catch (er) {
|
|
if (newError(er)) {
|
|
return old.realpathSync(p, cache)
|
|
} else {
|
|
throw er
|
|
}
|
|
}
|
|
}
|
|
|
|
function monkeypatch () {
|
|
fs.realpath = realpath
|
|
fs.realpathSync = realpathSync
|
|
}
|
|
|
|
function unmonkeypatch () {
|
|
fs.realpath = origRealpath
|
|
fs.realpathSync = origRealpathSync
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 4403:
|
|
/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
|
|
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
var pathModule = __webpack_require__(1017);
|
|
var isWindows = process.platform === 'win32';
|
|
var fs = __webpack_require__(7147);
|
|
|
|
// JavaScript implementation of realpath, ported from node pre-v6
|
|
|
|
var DEBUG = process.env.NODE_DEBUG && /fs/.test(process.env.NODE_DEBUG);
|
|
|
|
function rethrow() {
|
|
// Only enable in debug mode. A backtrace uses ~1000 bytes of heap space and
|
|
// is fairly slow to generate.
|
|
var callback;
|
|
if (DEBUG) {
|
|
var backtrace = new Error;
|
|
callback = debugCallback;
|
|
} else
|
|
callback = missingCallback;
|
|
|
|
return callback;
|
|
|
|
function debugCallback(err) {
|
|
if (err) {
|
|
backtrace.message = err.message;
|
|
err = backtrace;
|
|
missingCallback(err);
|
|
}
|
|
}
|
|
|
|
function missingCallback(err) {
|
|
if (err) {
|
|
if (process.throwDeprecation)
|
|
throw err; // Forgot a callback but don't know where? Use NODE_DEBUG=fs
|
|
else if (!process.noDeprecation) {
|
|
var msg = 'fs: missing callback ' + (err.stack || err.message);
|
|
if (process.traceDeprecation)
|
|
console.trace(msg);
|
|
else
|
|
console.error(msg);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
function maybeCallback(cb) {
|
|
return typeof cb === 'function' ? cb : rethrow();
|
|
}
|
|
|
|
var normalize = pathModule.normalize;
|
|
|
|
// Regexp that finds the next partion of a (partial) path
|
|
// result is [base_with_slash, base], e.g. ['somedir/', 'somedir']
|
|
if (isWindows) {
|
|
var nextPartRe = /(.*?)(?:[\/\\]+|$)/g;
|
|
} else {
|
|
var nextPartRe = /(.*?)(?:[\/]+|$)/g;
|
|
}
|
|
|
|
// Regex to find the device root, including trailing slash. E.g. 'c:\\'.
|
|
if (isWindows) {
|
|
var splitRootRe = /^(?:[a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/][^\\\/]+)?[\\\/]*/;
|
|
} else {
|
|
var splitRootRe = /^[\/]*/;
|
|
}
|
|
|
|
exports.realpathSync = function realpathSync(p, cache) {
|
|
// make p is absolute
|
|
p = pathModule.resolve(p);
|
|
|
|
if (cache && Object.prototype.hasOwnProperty.call(cache, p)) {
|
|
return cache[p];
|
|
}
|
|
|
|
var original = p,
|
|
seenLinks = {},
|
|
knownHard = {};
|
|
|
|
// current character position in p
|
|
var pos;
|
|
// the partial path so far, including a trailing slash if any
|
|
var current;
|
|
// the partial path without a trailing slash (except when pointing at a root)
|
|
var base;
|
|
// the partial path scanned in the previous round, with slash
|
|
var previous;
|
|
|
|
start();
|
|
|
|
function start() {
|
|
// Skip over roots
|
|
var m = splitRootRe.exec(p);
|
|
pos = m[0].length;
|
|
current = m[0];
|
|
base = m[0];
|
|
previous = '';
|
|
|
|
// On windows, check that the root exists. On unix there is no need.
|
|
if (isWindows && !knownHard[base]) {
|
|
fs.lstatSync(base);
|
|
knownHard[base] = true;
|
|
}
|
|
}
|
|
|
|
// walk down the path, swapping out linked pathparts for their real
|
|
// values
|
|
// NB: p.length changes.
|
|
while (pos < p.length) {
|
|
// find the next part
|
|
nextPartRe.lastIndex = pos;
|
|
var result = nextPartRe.exec(p);
|
|
previous = current;
|
|
current += result[0];
|
|
base = previous + result[1];
|
|
pos = nextPartRe.lastIndex;
|
|
|
|
// continue if not a symlink
|
|
if (knownHard[base] || (cache && cache[base] === base)) {
|
|
continue;
|
|
}
|
|
|
|
var resolvedLink;
|
|
if (cache && Object.prototype.hasOwnProperty.call(cache, base)) {
|
|
// some known symbolic link. no need to stat again.
|
|
resolvedLink = cache[base];
|
|
} else {
|
|
var stat = fs.lstatSync(base);
|
|
if (!stat.isSymbolicLink()) {
|
|
knownHard[base] = true;
|
|
if (cache) cache[base] = base;
|
|
continue;
|
|
}
|
|
|
|
// read the link if it wasn't read before
|
|
// dev/ino always return 0 on windows, so skip the check.
|
|
var linkTarget = null;
|
|
if (!isWindows) {
|
|
var id = stat.dev.toString(32) + ':' + stat.ino.toString(32);
|
|
if (seenLinks.hasOwnProperty(id)) {
|
|
linkTarget = seenLinks[id];
|
|
}
|
|
}
|
|
if (linkTarget === null) {
|
|
fs.statSync(base);
|
|
linkTarget = fs.readlinkSync(base);
|
|
}
|
|
resolvedLink = pathModule.resolve(previous, linkTarget);
|
|
// track this, if given a cache.
|
|
if (cache) cache[base] = resolvedLink;
|
|
if (!isWindows) seenLinks[id] = linkTarget;
|
|
}
|
|
|
|
// resolve the link, then start over
|
|
p = pathModule.resolve(resolvedLink, p.slice(pos));
|
|
start();
|
|
}
|
|
|
|
if (cache) cache[original] = p;
|
|
|
|
return p;
|
|
};
|
|
|
|
|
|
exports.realpath = function realpath(p, cache, cb) {
|
|
if (typeof cb !== 'function') {
|
|
cb = maybeCallback(cache);
|
|
cache = null;
|
|
}
|
|
|
|
// make p is absolute
|
|
p = pathModule.resolve(p);
|
|
|
|
if (cache && Object.prototype.hasOwnProperty.call(cache, p)) {
|
|
return process.nextTick(cb.bind(null, null, cache[p]));
|
|
}
|
|
|
|
var original = p,
|
|
seenLinks = {},
|
|
knownHard = {};
|
|
|
|
// current character position in p
|
|
var pos;
|
|
// the partial path so far, including a trailing slash if any
|
|
var current;
|
|
// the partial path without a trailing slash (except when pointing at a root)
|
|
var base;
|
|
// the partial path scanned in the previous round, with slash
|
|
var previous;
|
|
|
|
start();
|
|
|
|
function start() {
|
|
// Skip over roots
|
|
var m = splitRootRe.exec(p);
|
|
pos = m[0].length;
|
|
current = m[0];
|
|
base = m[0];
|
|
previous = '';
|
|
|
|
// On windows, check that the root exists. On unix there is no need.
|
|
if (isWindows && !knownHard[base]) {
|
|
fs.lstat(base, function(err) {
|
|
if (err) return cb(err);
|
|
knownHard[base] = true;
|
|
LOOP();
|
|
});
|
|
} else {
|
|
process.nextTick(LOOP);
|
|
}
|
|
}
|
|
|
|
// walk down the path, swapping out linked pathparts for their real
|
|
// values
|
|
function LOOP() {
|
|
// stop if scanned past end of path
|
|
if (pos >= p.length) {
|
|
if (cache) cache[original] = p;
|
|
return cb(null, p);
|
|
}
|
|
|
|
// find the next part
|
|
nextPartRe.lastIndex = pos;
|
|
var result = nextPartRe.exec(p);
|
|
previous = current;
|
|
current += result[0];
|
|
base = previous + result[1];
|
|
pos = nextPartRe.lastIndex;
|
|
|
|
// continue if not a symlink
|
|
if (knownHard[base] || (cache && cache[base] === base)) {
|
|
return process.nextTick(LOOP);
|
|
}
|
|
|
|
if (cache && Object.prototype.hasOwnProperty.call(cache, base)) {
|
|
// known symbolic link. no need to stat again.
|
|
return gotResolvedLink(cache[base]);
|
|
}
|
|
|
|
return fs.lstat(base, gotStat);
|
|
}
|
|
|
|
function gotStat(err, stat) {
|
|
if (err) return cb(err);
|
|
|
|
// if not a symlink, skip to the next path part
|
|
if (!stat.isSymbolicLink()) {
|
|
knownHard[base] = true;
|
|
if (cache) cache[base] = base;
|
|
return process.nextTick(LOOP);
|
|
}
|
|
|
|
// stat & read the link if not read before
|
|
// call gotTarget as soon as the link target is known
|
|
// dev/ino always return 0 on windows, so skip the check.
|
|
if (!isWindows) {
|
|
var id = stat.dev.toString(32) + ':' + stat.ino.toString(32);
|
|
if (seenLinks.hasOwnProperty(id)) {
|
|
return gotTarget(null, seenLinks[id], base);
|
|
}
|
|
}
|
|
fs.stat(base, function(err) {
|
|
if (err) return cb(err);
|
|
|
|
fs.readlink(base, function(err, target) {
|
|
if (!isWindows) seenLinks[id] = target;
|
|
gotTarget(err, target);
|
|
});
|
|
});
|
|
}
|
|
|
|
function gotTarget(err, target, base) {
|
|
if (err) return cb(err);
|
|
|
|
var resolvedLink = pathModule.resolve(previous, target);
|
|
if (cache) cache[base] = resolvedLink;
|
|
gotResolvedLink(resolvedLink);
|
|
}
|
|
|
|
function gotResolvedLink(resolvedLink) {
|
|
// resolve the link, then start over
|
|
p = pathModule.resolve(resolvedLink, p.slice(pos));
|
|
start();
|
|
}
|
|
};
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 3561:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
module.exports = __webpack_require__(9244)
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 9244:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
const stream = __webpack_require__(2781)
|
|
const EventEmitter = __webpack_require__(2361)
|
|
const LZWEncoder = __webpack_require__(4348)
|
|
const NeuQuant = __webpack_require__(3829)
|
|
const { OctreeQuant, Color } = __webpack_require__(9328)
|
|
|
|
class ByteArray {
|
|
constructor() {
|
|
this.data = []
|
|
}
|
|
|
|
getData() {
|
|
return Buffer.from(this.data)
|
|
}
|
|
|
|
writeByte(val) {
|
|
this.data.push(val)
|
|
}
|
|
|
|
writeUTFBytes(str) {
|
|
for (var len = str.length, i = 0; i < len; i++) {
|
|
this.writeByte(str.charCodeAt(i))
|
|
}
|
|
}
|
|
|
|
writeBytes(array, offset, length) {
|
|
for (var len = length || array.length, i = offset || 0; i < len; i++) {
|
|
this.writeByte(array[i])
|
|
}
|
|
}
|
|
}
|
|
|
|
class GIFEncoder extends EventEmitter {
|
|
constructor(width, height, algorithm = 'neuquant', useOptimizer = false, totalFrames = 0) {
|
|
super()
|
|
|
|
this.width = ~~width
|
|
this.height = ~~height
|
|
this.algorithm = algorithm
|
|
this.useOptimizer = useOptimizer
|
|
this.totalFrames = totalFrames
|
|
this.frames = 1
|
|
this.threshold = 90
|
|
this.indexedPixels = null
|
|
this.palSizeNeu = 7
|
|
this.palSizeOct = 7
|
|
this.sample = 10
|
|
this.colorTab = null
|
|
this.reuseTab = null
|
|
this.colorDepth = null
|
|
this.usedEntry = new Array()
|
|
this.firstFrame = true
|
|
this.started = false
|
|
this.image = null
|
|
this.prevImage = null
|
|
this.dispose = -1
|
|
this.repeat = 0
|
|
this.delay = 0
|
|
this.transparent = null
|
|
this.transIndex = 0
|
|
this.readStreams = []
|
|
this.out = new ByteArray()
|
|
}
|
|
|
|
createReadStream(rs) {
|
|
if (!rs) {
|
|
rs = new stream.Readable()
|
|
rs._read = function() {}
|
|
}
|
|
this.readStreams.push(rs)
|
|
return rs
|
|
}
|
|
|
|
emitData() {
|
|
if (this.readStreams.length === 0) {
|
|
return
|
|
}
|
|
if (this.out.data.length) {
|
|
this.readStreams.forEach(rs => {
|
|
rs.push(Buffer.from(this.out.data))
|
|
})
|
|
this.out.data = []
|
|
}
|
|
}
|
|
|
|
start() {
|
|
this.out.writeUTFBytes('GIF89a')
|
|
this.started = true
|
|
this.emitData()
|
|
}
|
|
|
|
end() {
|
|
if (this.readStreams.length === null) {
|
|
return
|
|
}
|
|
this.emitData()
|
|
this.readStreams.forEach(rs => rs.push(null))
|
|
this.readStreams = []
|
|
}
|
|
|
|
addFrame(input) {
|
|
if (input && input.getImageData) {
|
|
this.image = input.getImageData(0, 0, this.width, this.height).data
|
|
} else {
|
|
this.image = input
|
|
}
|
|
|
|
this.analyzePixels()
|
|
|
|
if (this.firstFrame) {
|
|
this.writeLSD()
|
|
this.writePalette()
|
|
if (this.repeat >= 0) {
|
|
this.writeNetscapeExt()
|
|
}
|
|
}
|
|
|
|
this.writeGraphicCtrlExt()
|
|
this.writeImageDesc()
|
|
if (!this.firstFrame) {
|
|
this.writePalette()
|
|
}
|
|
this.writePixels()
|
|
this.firstFrame = false
|
|
this.emitData()
|
|
|
|
if (this.totalFrames) {
|
|
this.emit('progress', Math.floor((this.frames++ / this.totalFrames) * 100))
|
|
}
|
|
}
|
|
|
|
analyzePixels() {
|
|
const w = this.width
|
|
const h = this.height
|
|
|
|
var data = this.image
|
|
|
|
if (this.useOptimizer && this.prevImage) {
|
|
var delta = 0
|
|
for (var len = data.length, i = 0; i < len; i += 4) {
|
|
if (
|
|
data[i] !== this.prevImage[i] ||
|
|
data[i + 1] !== this.prevImage[i + 1] ||
|
|
data[i + 2] !== this.prevImage[i + 2]
|
|
) {
|
|
delta++
|
|
}
|
|
}
|
|
const match = 100 - Math.ceil((delta / (data.length / 4)) * 100)
|
|
this.reuseTab = match >= this.threshold
|
|
}
|
|
|
|
this.prevImage = data
|
|
|
|
if (this.algorithm === 'neuquant') {
|
|
var count = 0
|
|
this.pixels = new Uint8Array(w * h * 3)
|
|
|
|
for (var i = 0; i < h; i++) {
|
|
for (var j = 0; j < w; j++) {
|
|
var b = i * w * 4 + j * 4
|
|
this.pixels[count++] = data[b]
|
|
this.pixels[count++] = data[b + 1]
|
|
this.pixels[count++] = data[b + 2]
|
|
}
|
|
}
|
|
|
|
var nPix = this.pixels.length / 3
|
|
this.indexedPixels = new Uint8Array(nPix)
|
|
|
|
if (!this.reuseTab) {
|
|
this.quantizer = new NeuQuant(this.pixels, this.sample)
|
|
this.quantizer.buildColormap()
|
|
this.colorTab = this.quantizer.getColormap()
|
|
}
|
|
|
|
var k = 0
|
|
for (var j = 0; j < nPix; j++) {
|
|
var index = this.quantizer.lookupRGB(
|
|
this.pixels[k++] & 0xff,
|
|
this.pixels[k++] & 0xff,
|
|
this.pixels[k++] & 0xff
|
|
)
|
|
|
|
this.usedEntry[index] = true
|
|
this.indexedPixels[j] = index
|
|
}
|
|
|
|
this.colorDepth = 8
|
|
this.palSizeNeu = 7
|
|
this.pixels = null
|
|
} else if (this.algorithm === 'octree') {
|
|
this.colors = []
|
|
|
|
if (!this.reuseTab) {
|
|
this.quantizer = new OctreeQuant()
|
|
}
|
|
|
|
for (var i = 0; i < h; i++) {
|
|
for (var j = 0; j < w; j++) {
|
|
var b = i * w * 4 + j * 4
|
|
const color = new Color(data[b], data[b + 1], data[b + 2])
|
|
this.colors.push(color)
|
|
|
|
if (!this.reuseTab) {
|
|
this.quantizer.addColor(color)
|
|
}
|
|
}
|
|
}
|
|
|
|
const nPix = this.colors.length
|
|
this.indexedPixels = new Uint8Array(nPix)
|
|
|
|
if (!this.reuseTab) {
|
|
this.colorTab = []
|
|
const palette = this.quantizer.makePalette(Math.pow(2, this.palSizeOct + 1))
|
|
|
|
for (const p of palette) {
|
|
this.colorTab.push(p.red, p.green, p.blue)
|
|
}
|
|
}
|
|
|
|
for (var i = 0; i < nPix; i++) {
|
|
this.indexedPixels[i] = this.quantizer.getPaletteIndex(this.colors[i])
|
|
}
|
|
|
|
this.colorDepth = this.palSizeOct + 1
|
|
}
|
|
|
|
if (this.transparent !== null) {
|
|
this.transIndex = this.findClosest(this.transparent)
|
|
|
|
for (var pixelIndex = 0; pixelIndex < nPix; pixelIndex++) {
|
|
if (this.image[pixelIndex * 4 + 3] == 0) {
|
|
this.indexedPixels[pixelIndex] = this.transIndex
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
findClosest(c) {
|
|
if (this.colorTab === null) {
|
|
return -1
|
|
}
|
|
|
|
var r = (c & 0xff0000) >> 16
|
|
var g = (c & 0x00ff00) >> 8
|
|
var b = c & 0x0000ff
|
|
var minpos = 0
|
|
var dmin = 256 * 256 * 256
|
|
var len = this.colorTab.length
|
|
|
|
for (var i = 0; i < len; ) {
|
|
var index = i / 3
|
|
var dr = r - (this.colorTab[i++] & 0xff)
|
|
var dg = g - (this.colorTab[i++] & 0xff)
|
|
var db = b - (this.colorTab[i++] & 0xff)
|
|
var d = dr * dr + dg * dg + db * db
|
|
if (this.usedEntry[index] && d < dmin) {
|
|
dmin = d
|
|
minpos = index
|
|
}
|
|
}
|
|
|
|
return minpos
|
|
}
|
|
|
|
setFrameRate(fps) {
|
|
this.delay = Math.round(100 / fps)
|
|
}
|
|
|
|
setDelay(ms) {
|
|
this.delay = Math.round(ms / 10)
|
|
}
|
|
|
|
setDispose(code) {
|
|
if (code >= 0) {
|
|
this.dispose = code
|
|
}
|
|
}
|
|
|
|
setRepeat(repeat) {
|
|
this.repeat = repeat
|
|
}
|
|
|
|
setTransparent(color) {
|
|
this.transparent = color
|
|
}
|
|
|
|
setQuality(quality) {
|
|
if (quality < 1) {
|
|
quality = 1
|
|
}
|
|
this.quality = quality
|
|
}
|
|
|
|
setThreshold(threshold) {
|
|
if (threshold > 100) {
|
|
threshold = 100
|
|
} else if (threshold < 0) {
|
|
threshold = 0
|
|
}
|
|
this.threshold = threshold
|
|
}
|
|
|
|
setPaletteSize(size) {
|
|
if (size > 7) {
|
|
size = 7
|
|
} else if (size < 4) {
|
|
size = 4
|
|
}
|
|
this.palSizeOct = size
|
|
}
|
|
|
|
writeLSD() {
|
|
this.writeShort(this.width)
|
|
this.writeShort(this.height)
|
|
|
|
this.out.writeByte(0x80 | 0x70 | 0x00 | this.palSizeNeu)
|
|
|
|
this.out.writeByte(0)
|
|
this.out.writeByte(0)
|
|
}
|
|
|
|
writeGraphicCtrlExt() {
|
|
this.out.writeByte(0x21)
|
|
this.out.writeByte(0xf9)
|
|
this.out.writeByte(4)
|
|
|
|
var transp, disp
|
|
if (this.transparent === null) {
|
|
transp = 0
|
|
disp = 0
|
|
} else {
|
|
transp = 1
|
|
disp = 2
|
|
}
|
|
|
|
if (this.dispose >= 0) {
|
|
disp = this.dispose & 7
|
|
}
|
|
disp <<= 2
|
|
|
|
this.out.writeByte(0 | disp | 0 | transp)
|
|
|
|
this.writeShort(this.delay)
|
|
this.out.writeByte(this.transIndex)
|
|
this.out.writeByte(0)
|
|
}
|
|
|
|
writeNetscapeExt() {
|
|
this.out.writeByte(0x21)
|
|
this.out.writeByte(0xff)
|
|
this.out.writeByte(11)
|
|
this.out.writeUTFBytes('NETSCAPE2.0')
|
|
this.out.writeByte(3)
|
|
this.out.writeByte(1)
|
|
this.writeShort(this.repeat)
|
|
this.out.writeByte(0)
|
|
}
|
|
|
|
writeImageDesc() {
|
|
this.out.writeByte(0x2c)
|
|
this.writeShort(0)
|
|
this.writeShort(0)
|
|
this.writeShort(this.width)
|
|
this.writeShort(this.height)
|
|
|
|
if (this.firstFrame) {
|
|
this.out.writeByte(0)
|
|
} else {
|
|
this.out.writeByte(0x80 | 0 | 0 | 0 | this.palSizeNeu)
|
|
}
|
|
}
|
|
|
|
writePalette() {
|
|
this.out.writeBytes(this.colorTab)
|
|
var n = 3 * 256 - this.colorTab.length
|
|
for (var i = 0; i < n; i++) {
|
|
this.out.writeByte(0)
|
|
}
|
|
}
|
|
|
|
writeShort(pValue) {
|
|
this.out.writeByte(pValue & 0xff)
|
|
this.out.writeByte((pValue >> 8) & 0xff)
|
|
}
|
|
|
|
writePixels() {
|
|
var enc = new LZWEncoder(this.width, this.height, this.indexedPixels, this.colorDepth)
|
|
enc.encode(this.out)
|
|
}
|
|
|
|
finish() {
|
|
this.out.writeByte(0x3b)
|
|
this.end()
|
|
}
|
|
}
|
|
|
|
module.exports = GIFEncoder
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 4348:
|
|
/***/ ((module) => {
|
|
|
|
/*
|
|
LZWEncoder.js
|
|
|
|
Authors
|
|
Kevin Weiner (original Java version - kweiner@fmsware.com)
|
|
Thibault Imbert (AS3 version - bytearray.org)
|
|
Johan Nordberg (JS version - code@johan-nordberg.com)
|
|
|
|
Acknowledgements
|
|
GIFCOMPR.C - GIF Image compression routines
|
|
Lempel-Ziv compression based on 'compress'. GIF modifications by
|
|
David Rowley (mgardi@watdcsu.waterloo.edu)
|
|
GIF Image compression - modified 'compress'
|
|
Based on: compress.c - File compression ala IEEE Computer, June 1984.
|
|
By Authors: Spencer W. Thomas (decvax!harpo!utah-cs!utah-gr!thomas)
|
|
Jim McKie (decvax!mcvax!jim)
|
|
Steve Davies (decvax!vax135!petsd!peora!srd)
|
|
Ken Turkowski (decvax!decwrl!turtlevax!ken)
|
|
James A. Woods (decvax!ihnp4!ames!jaw)
|
|
Joe Orost (decvax!vax135!petsd!joe)
|
|
*/
|
|
|
|
var EOF = -1
|
|
var BITS = 12
|
|
var HSIZE = 5003 // 80% occupancy
|
|
var masks = [
|
|
0x0000,
|
|
0x0001,
|
|
0x0003,
|
|
0x0007,
|
|
0x000f,
|
|
0x001f,
|
|
0x003f,
|
|
0x007f,
|
|
0x00ff,
|
|
0x01ff,
|
|
0x03ff,
|
|
0x07ff,
|
|
0x0fff,
|
|
0x1fff,
|
|
0x3fff,
|
|
0x7fff,
|
|
0xffff
|
|
]
|
|
|
|
function LZWEncoder(width, height, pixels, colorDepth) {
|
|
var initCodeSize = Math.max(2, colorDepth)
|
|
|
|
var accum = new Uint8Array(256)
|
|
var htab = new Int32Array(HSIZE)
|
|
var codetab = new Int32Array(HSIZE)
|
|
|
|
var cur_accum,
|
|
cur_bits = 0
|
|
var a_count
|
|
var free_ent = 0 // first unused entry
|
|
var maxcode
|
|
|
|
// block compression parameters -- after all codes are used up,
|
|
// and compression rate changes, start over.
|
|
var clear_flg = false
|
|
|
|
// Algorithm: use open addressing double hashing (no chaining) on the
|
|
// prefix code / next character combination. We do a variant of Knuth's
|
|
// algorithm D (vol. 3, sec. 6.4) along with G. Knott's relatively-prime
|
|
// secondary probe. Here, the modular division first probe is gives way
|
|
// to a faster exclusive-or manipulation. Also do block compression with
|
|
// an adaptive reset, whereby the code table is cleared when the compression
|
|
// ratio decreases, but after the table fills. The variable-length output
|
|
// codes are re-sized at this point, and a special CLEAR code is generated
|
|
// for the decompressor. Late addition: construct the table according to
|
|
// file size for noticeable speed improvement on small files. Please direct
|
|
// questions about this implementation to ames!jaw.
|
|
var g_init_bits, ClearCode, EOFCode
|
|
|
|
// Add a character to the end of the current packet, and if it is 254
|
|
// characters, flush the packet to disk.
|
|
function char_out(c, outs) {
|
|
accum[a_count++] = c
|
|
if (a_count >= 254) flush_char(outs)
|
|
}
|
|
|
|
// Clear out the hash table
|
|
// table clear for block compress
|
|
function cl_block(outs) {
|
|
cl_hash(HSIZE)
|
|
free_ent = ClearCode + 2
|
|
clear_flg = true
|
|
output(ClearCode, outs)
|
|
}
|
|
|
|
// Reset code table
|
|
function cl_hash(hsize) {
|
|
for (var i = 0; i < hsize; ++i) htab[i] = -1
|
|
}
|
|
|
|
function compress(init_bits, outs) {
|
|
var fcode, c, i, ent, disp, hsize_reg, hshift
|
|
|
|
// Set up the globals: g_init_bits - initial number of bits
|
|
g_init_bits = init_bits
|
|
|
|
// Set up the necessary values
|
|
clear_flg = false
|
|
n_bits = g_init_bits
|
|
maxcode = MAXCODE(n_bits)
|
|
|
|
ClearCode = 1 << (init_bits - 1)
|
|
EOFCode = ClearCode + 1
|
|
free_ent = ClearCode + 2
|
|
|
|
a_count = 0 // clear packet
|
|
|
|
ent = nextPixel()
|
|
|
|
hshift = 0
|
|
for (fcode = HSIZE; fcode < 65536; fcode *= 2) ++hshift
|
|
hshift = 8 - hshift // set hash code range bound
|
|
hsize_reg = HSIZE
|
|
cl_hash(hsize_reg) // clear hash table
|
|
|
|
output(ClearCode, outs)
|
|
|
|
outer_loop: while ((c = nextPixel()) != EOF) {
|
|
fcode = (c << BITS) + ent
|
|
i = (c << hshift) ^ ent // xor hashing
|
|
if (htab[i] === fcode) {
|
|
ent = codetab[i]
|
|
continue
|
|
} else if (htab[i] >= 0) {
|
|
// non-empty slot
|
|
disp = hsize_reg - i // secondary hash (after G. Knott)
|
|
if (i === 0) disp = 1
|
|
do {
|
|
if ((i -= disp) < 0) i += hsize_reg
|
|
if (htab[i] === fcode) {
|
|
ent = codetab[i]
|
|
continue outer_loop
|
|
}
|
|
} while (htab[i] >= 0)
|
|
}
|
|
output(ent, outs)
|
|
ent = c
|
|
if (free_ent < 1 << BITS) {
|
|
codetab[i] = free_ent++ // code -> hashtable
|
|
htab[i] = fcode
|
|
} else {
|
|
cl_block(outs)
|
|
}
|
|
}
|
|
|
|
// Put out the final code.
|
|
output(ent, outs)
|
|
output(EOFCode, outs)
|
|
}
|
|
|
|
function encode(outs) {
|
|
outs.writeByte(initCodeSize) // write "initial code size" byte
|
|
remaining = width * height // reset navigation variables
|
|
curPixel = 0
|
|
compress(initCodeSize + 1, outs) // compress and write the pixel data
|
|
outs.writeByte(0) // write block terminator
|
|
}
|
|
|
|
// Flush the packet to disk, and reset the accumulator
|
|
function flush_char(outs) {
|
|
if (a_count > 0) {
|
|
outs.writeByte(a_count)
|
|
outs.writeBytes(accum, 0, a_count)
|
|
a_count = 0
|
|
}
|
|
}
|
|
|
|
function MAXCODE(n_bits) {
|
|
return (1 << n_bits) - 1
|
|
}
|
|
|
|
// Return the next pixel from the image
|
|
function nextPixel() {
|
|
if (remaining === 0) return EOF
|
|
--remaining
|
|
var pix = pixels[curPixel++]
|
|
return pix & 0xff
|
|
}
|
|
|
|
function output(code, outs) {
|
|
cur_accum &= masks[cur_bits]
|
|
|
|
if (cur_bits > 0) cur_accum |= code << cur_bits
|
|
else cur_accum = code
|
|
|
|
cur_bits += n_bits
|
|
|
|
while (cur_bits >= 8) {
|
|
char_out(cur_accum & 0xff, outs)
|
|
cur_accum >>= 8
|
|
cur_bits -= 8
|
|
}
|
|
|
|
// If the next entry is going to be too big for the code size,
|
|
// then increase it, if possible.
|
|
if (free_ent > maxcode || clear_flg) {
|
|
if (clear_flg) {
|
|
maxcode = MAXCODE((n_bits = g_init_bits))
|
|
clear_flg = false
|
|
} else {
|
|
++n_bits
|
|
if (n_bits == BITS) maxcode = 1 << BITS
|
|
else maxcode = MAXCODE(n_bits)
|
|
}
|
|
}
|
|
|
|
if (code == EOFCode) {
|
|
// At EOF, write the rest of the buffer.
|
|
while (cur_bits > 0) {
|
|
char_out(cur_accum & 0xff, outs)
|
|
cur_accum >>= 8
|
|
cur_bits -= 8
|
|
}
|
|
flush_char(outs)
|
|
}
|
|
}
|
|
|
|
this.encode = encode
|
|
}
|
|
|
|
module.exports = LZWEncoder
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 9328:
|
|
/***/ ((module) => {
|
|
|
|
/*
|
|
Authors
|
|
Dmitry Alimov (Python version) https://github.com/delimitry/octree_color_quantizer
|
|
Tom MacWright (JavaScript version) https://observablehq.com/@tmcw/octree-color-quantization
|
|
*/
|
|
|
|
const MAX_DEPTH = 8
|
|
|
|
class OctreeQuant {
|
|
constructor() {
|
|
this.levels = Array.from({ length: MAX_DEPTH }, () => [])
|
|
this.root = new Node(0, this)
|
|
}
|
|
|
|
addColor(color) {
|
|
this.root.addColor(color, 0, this)
|
|
}
|
|
|
|
makePalette(colorCount) {
|
|
let palette = []
|
|
let paletteIndex = 0
|
|
let leafCount = this.leafNodes.length
|
|
for (let level = MAX_DEPTH - 1; level > -1; level -= 1) {
|
|
if (this.levels[level]) {
|
|
for (let node of this.levels[level]) {
|
|
leafCount -= node.removeLeaves()
|
|
if (leafCount <= colorCount) break
|
|
}
|
|
if (leafCount <= colorCount) break
|
|
this.levels[level] = []
|
|
}
|
|
}
|
|
for (let node of this.leafNodes) {
|
|
if (paletteIndex >= colorCount) break
|
|
if (node.isLeaf) palette.push(node.color)
|
|
node.paletteIndex = paletteIndex
|
|
paletteIndex++
|
|
}
|
|
return palette
|
|
}
|
|
|
|
*makePaletteIncremental(colorCount) {
|
|
let palette = []
|
|
let paletteIndex = 0
|
|
let leafCount = this.leafNodes.length
|
|
for (let level = MAX_DEPTH - 1; level > -1; level -= 1) {
|
|
if (this.levels[level]) {
|
|
for (let node of this.levels[level]) {
|
|
leafCount -= node.removeLeaves()
|
|
if (leafCount <= colorCount) break
|
|
}
|
|
if (leafCount <= colorCount) break
|
|
this.levels[level] = []
|
|
}
|
|
yield
|
|
}
|
|
for (let node of this.leafNodes) {
|
|
if (paletteIndex >= colorCount) break
|
|
if (node.isLeaf) palette.push(node.color)
|
|
node.paletteIndex = paletteIndex
|
|
paletteIndex++
|
|
}
|
|
yield
|
|
return palette
|
|
}
|
|
|
|
get leafNodes() {
|
|
return this.root.leafNodes
|
|
}
|
|
|
|
addLevelNode(level, node) {
|
|
this.levels[level].push(node)
|
|
}
|
|
|
|
getPaletteIndex(color) {
|
|
return this.root.getPaletteIndex(color, 0)
|
|
}
|
|
}
|
|
|
|
class Node {
|
|
constructor(level, parent) {
|
|
this._color = new Color(0, 0, 0)
|
|
this.pixelCount = 0
|
|
this.paletteIndex = 0
|
|
this.children = []
|
|
this._debugColor
|
|
if (level < MAX_DEPTH - 1) parent.addLevelNode(level, this)
|
|
}
|
|
|
|
get isLeaf() {
|
|
return this.pixelCount > 0
|
|
}
|
|
|
|
get leafNodes() {
|
|
let leafNodes = []
|
|
|
|
for (let node of this.children) {
|
|
if (!node) continue
|
|
if (node.isLeaf) {
|
|
leafNodes.push(node)
|
|
} else {
|
|
leafNodes.push(...node.leafNodes)
|
|
}
|
|
}
|
|
|
|
return leafNodes
|
|
}
|
|
|
|
addColor(color, level, parent) {
|
|
if (level >= MAX_DEPTH) {
|
|
this._color.add(color)
|
|
this.pixelCount++
|
|
return
|
|
}
|
|
let index = getColorIndex(color, level)
|
|
if (!this.children[index]) {
|
|
this.children[index] = new Node(level, parent)
|
|
}
|
|
this.children[index].addColor(color, level + 1, parent)
|
|
}
|
|
|
|
getPaletteIndex(color, level) {
|
|
if (this.isLeaf) {
|
|
return this.paletteIndex
|
|
}
|
|
let index = getColorIndex(color, level)
|
|
if (this.children[index]) {
|
|
return this.children[index].getPaletteIndex(color, level + 1)
|
|
} else {
|
|
for (let node of this.children) {
|
|
if (node) {
|
|
return node.getPaletteIndex(color, level + 1)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
removeLeaves() {
|
|
let result = 0
|
|
for (let node of this.children) {
|
|
if (!node) continue
|
|
this._color.add(node._color)
|
|
this.pixelCount += node.pixelCount
|
|
result++
|
|
}
|
|
this.children = []
|
|
return result - 1
|
|
}
|
|
|
|
get debugColor() {
|
|
if (this._debugColor) return this._debugColor
|
|
if (this.isLeaf) return this.color
|
|
|
|
let c = new Color()
|
|
let count = 0
|
|
|
|
function traverse(node) {
|
|
for (let child of node.children) {
|
|
if (child.isLeaf) {
|
|
c.add(child._color)
|
|
count++
|
|
} else {
|
|
traverse(child)
|
|
}
|
|
}
|
|
}
|
|
|
|
traverse(this)
|
|
return c.normalized(count)
|
|
}
|
|
|
|
get color() {
|
|
return this._color.normalized(this.pixelCount)
|
|
}
|
|
}
|
|
|
|
class Color {
|
|
constructor(red = 0, green = 0, blue = 0) {
|
|
this.red = red
|
|
this.green = green
|
|
this.blue = blue
|
|
}
|
|
|
|
clone() {
|
|
return new Color(this.red, this.green, this.blue)
|
|
}
|
|
|
|
get array() {
|
|
return [this.red, this.green, this.blue, this.red + this.green + this.blue]
|
|
}
|
|
|
|
toString() {
|
|
return [this.red, this.green, this.blue].join(',')
|
|
}
|
|
|
|
toCSS() {
|
|
return `rgb(${[this.red, this.green, this.blue].map(n => Math.floor(n)).join(',')})`
|
|
}
|
|
|
|
normalized(pixelCount) {
|
|
return new Color(this.red / pixelCount, this.green / pixelCount, this.blue / pixelCount)
|
|
}
|
|
|
|
add(color) {
|
|
this.red += color.red
|
|
this.green += color.green
|
|
this.blue += color.blue
|
|
}
|
|
}
|
|
|
|
function getColorIndex(color, level) {
|
|
let index = 0
|
|
let mask = 0b10000000 >> level
|
|
if (color.red & mask) index |= 0b100
|
|
if (color.green & mask) index |= 0b010
|
|
if (color.blue & mask) index |= 0b001
|
|
return index
|
|
}
|
|
|
|
module.exports = { OctreeQuant, Node, Color }
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 3829:
|
|
/***/ ((module) => {
|
|
|
|
/* NeuQuant Neural-Net Quantization Algorithm
|
|
* ------------------------------------------
|
|
*
|
|
* Copyright (c) 1994 Anthony Dekker
|
|
*
|
|
* NEUQUANT Neural-Net quantization algorithm by Anthony Dekker, 1994.
|
|
* See "Kohonen neural networks for optimal colour quantization"
|
|
* in "Network: Computation in Neural Systems" Vol. 5 (1994) pp 351-367.
|
|
* for a discussion of the algorithm.
|
|
* See also http://members.ozemail.com.au/~dekker/NEUQUANT.HTML
|
|
*
|
|
* Any party obtaining a copy of these files from the author, directly or
|
|
* indirectly, is granted, free of charge, a full and unrestricted irrevocable,
|
|
* world-wide, paid up, royalty-free, nonexclusive right and license to deal
|
|
* in this software and documentation files (the "Software"), including without
|
|
* limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons who receive
|
|
* copies from any such party to do so, with the only requirement being
|
|
* that this copyright notice remain intact.
|
|
*
|
|
* (JavaScript port 2012 by Johan Nordberg)
|
|
*/
|
|
|
|
var ncycles = 100 // number of learning cycles
|
|
var netsize = 256 // number of colors used
|
|
var maxnetpos = netsize - 1
|
|
|
|
// defs for freq and bias
|
|
var netbiasshift = 4 // bias for colour values
|
|
var intbiasshift = 16 // bias for fractions
|
|
var intbias = 1 << intbiasshift
|
|
var gammashift = 10
|
|
var gamma = 1 << gammashift
|
|
var betashift = 10
|
|
var beta = intbias >> betashift /* beta = 1/1024 */
|
|
var betagamma = intbias << (gammashift - betashift)
|
|
|
|
// defs for decreasing radius factor
|
|
var initrad = netsize >> 3 // for 256 cols, radius starts
|
|
var radiusbiasshift = 6 // at 32.0 biased by 6 bits
|
|
var radiusbias = 1 << radiusbiasshift
|
|
var initradius = initrad * radiusbias //and decreases by a
|
|
var radiusdec = 30 // factor of 1/30 each cycle
|
|
|
|
// defs for decreasing alpha factor
|
|
var alphabiasshift = 10 // alpha starts at 1.0
|
|
var initalpha = 1 << alphabiasshift
|
|
var alphadec // biased by 10 bits
|
|
|
|
/* radbias and alpharadbias used for radpower calculation */
|
|
var radbiasshift = 8
|
|
var radbias = 1 << radbiasshift
|
|
var alpharadbshift = alphabiasshift + radbiasshift
|
|
var alpharadbias = 1 << alpharadbshift
|
|
|
|
// four primes near 500 - assume no image has a length so large that it is
|
|
// divisible by all four primes
|
|
var prime1 = 499
|
|
var prime2 = 491
|
|
var prime3 = 487
|
|
var prime4 = 503
|
|
var minpicturebytes = 3 * prime4
|
|
|
|
/*
|
|
Constructor: NeuQuant
|
|
|
|
Arguments:
|
|
|
|
pixels - array of pixels in RGB format
|
|
samplefac - sampling factor 1 to 30 where lower is better quality
|
|
|
|
>
|
|
> pixels = [r, g, b, r, g, b, r, g, b, ..]
|
|
>
|
|
*/
|
|
function NeuQuant(pixels, samplefac) {
|
|
var network // int[netsize][4]
|
|
var netindex // for network lookup - really 256
|
|
|
|
// bias and freq arrays for learning
|
|
var bias
|
|
var freq
|
|
var radpower
|
|
|
|
/*
|
|
Private Method: init
|
|
|
|
sets up arrays
|
|
*/
|
|
function init() {
|
|
network = []
|
|
netindex = new Int32Array(256)
|
|
bias = new Int32Array(netsize)
|
|
freq = new Int32Array(netsize)
|
|
radpower = new Int32Array(netsize >> 3)
|
|
|
|
var i, v
|
|
for (i = 0; i < netsize; i++) {
|
|
v = (i << (netbiasshift + 8)) / netsize
|
|
network[i] = new Float64Array([v, v, v, 0])
|
|
//network[i] = [v, v, v, 0]
|
|
freq[i] = intbias / netsize
|
|
bias[i] = 0
|
|
}
|
|
}
|
|
|
|
/*
|
|
Private Method: unbiasnet
|
|
|
|
unbiases network to give byte values 0..255 and record position i to prepare for sort
|
|
*/
|
|
function unbiasnet() {
|
|
for (var i = 0; i < netsize; i++) {
|
|
network[i][0] >>= netbiasshift
|
|
network[i][1] >>= netbiasshift
|
|
network[i][2] >>= netbiasshift
|
|
network[i][3] = i // record color number
|
|
}
|
|
}
|
|
|
|
/*
|
|
Private Method: altersingle
|
|
|
|
moves neuron *i* towards biased (b,g,r) by factor *alpha*
|
|
*/
|
|
function altersingle(alpha, i, b, g, r) {
|
|
network[i][0] -= (alpha * (network[i][0] - b)) / initalpha
|
|
network[i][1] -= (alpha * (network[i][1] - g)) / initalpha
|
|
network[i][2] -= (alpha * (network[i][2] - r)) / initalpha
|
|
}
|
|
|
|
/*
|
|
Private Method: alterneigh
|
|
|
|
moves neurons in *radius* around index *i* towards biased (b,g,r) by factor *alpha*
|
|
*/
|
|
function alterneigh(radius, i, b, g, r) {
|
|
var lo = Math.abs(i - radius)
|
|
var hi = Math.min(i + radius, netsize)
|
|
|
|
var j = i + 1
|
|
var k = i - 1
|
|
var m = 1
|
|
|
|
var p, a
|
|
while (j < hi || k > lo) {
|
|
a = radpower[m++]
|
|
|
|
if (j < hi) {
|
|
p = network[j++]
|
|
p[0] -= (a * (p[0] - b)) / alpharadbias
|
|
p[1] -= (a * (p[1] - g)) / alpharadbias
|
|
p[2] -= (a * (p[2] - r)) / alpharadbias
|
|
}
|
|
|
|
if (k > lo) {
|
|
p = network[k--]
|
|
p[0] -= (a * (p[0] - b)) / alpharadbias
|
|
p[1] -= (a * (p[1] - g)) / alpharadbias
|
|
p[2] -= (a * (p[2] - r)) / alpharadbias
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
Private Method: contest
|
|
|
|
searches for biased BGR values
|
|
*/
|
|
function contest(b, g, r) {
|
|
/*
|
|
finds closest neuron (min dist) and updates freq
|
|
finds best neuron (min dist-bias) and returns position
|
|
for frequently chosen neurons, freq[i] is high and bias[i] is negative
|
|
bias[i] = gamma * ((1 / netsize) - freq[i])
|
|
*/
|
|
|
|
var bestd = ~(1 << 31)
|
|
var bestbiasd = bestd
|
|
var bestpos = -1
|
|
var bestbiaspos = bestpos
|
|
|
|
var i, n, dist, biasdist, betafreq
|
|
for (i = 0; i < netsize; i++) {
|
|
n = network[i]
|
|
|
|
dist = Math.abs(n[0] - b) + Math.abs(n[1] - g) + Math.abs(n[2] - r)
|
|
if (dist < bestd) {
|
|
bestd = dist
|
|
bestpos = i
|
|
}
|
|
|
|
biasdist = dist - (bias[i] >> (intbiasshift - netbiasshift))
|
|
if (biasdist < bestbiasd) {
|
|
bestbiasd = biasdist
|
|
bestbiaspos = i
|
|
}
|
|
|
|
betafreq = freq[i] >> betashift
|
|
freq[i] -= betafreq
|
|
bias[i] += betafreq << gammashift
|
|
}
|
|
|
|
freq[bestpos] += beta
|
|
bias[bestpos] -= betagamma
|
|
|
|
return bestbiaspos
|
|
}
|
|
|
|
/*
|
|
Private Method: inxbuild
|
|
|
|
sorts network and builds netindex[0..255]
|
|
*/
|
|
function inxbuild() {
|
|
var i,
|
|
j,
|
|
p,
|
|
q,
|
|
smallpos,
|
|
smallval,
|
|
previouscol = 0,
|
|
startpos = 0
|
|
for (i = 0; i < netsize; i++) {
|
|
p = network[i]
|
|
smallpos = i
|
|
smallval = p[1] // index on g
|
|
// find smallest in i..netsize-1
|
|
for (j = i + 1; j < netsize; j++) {
|
|
q = network[j]
|
|
if (q[1] < smallval) {
|
|
// index on g
|
|
smallpos = j
|
|
smallval = q[1] // index on g
|
|
}
|
|
}
|
|
q = network[smallpos]
|
|
// swap p (i) and q (smallpos) entries
|
|
if (i != smallpos) {
|
|
j = q[0]
|
|
q[0] = p[0]
|
|
p[0] = j
|
|
j = q[1]
|
|
q[1] = p[1]
|
|
p[1] = j
|
|
j = q[2]
|
|
q[2] = p[2]
|
|
p[2] = j
|
|
j = q[3]
|
|
q[3] = p[3]
|
|
p[3] = j
|
|
}
|
|
// smallval entry is now in position i
|
|
|
|
if (smallval != previouscol) {
|
|
netindex[previouscol] = (startpos + i) >> 1
|
|
for (j = previouscol + 1; j < smallval; j++) netindex[j] = i
|
|
previouscol = smallval
|
|
startpos = i
|
|
}
|
|
}
|
|
netindex[previouscol] = (startpos + maxnetpos) >> 1
|
|
for (j = previouscol + 1; j < 256; j++) netindex[j] = maxnetpos // really 256
|
|
}
|
|
|
|
/*
|
|
Private Method: inxsearch
|
|
|
|
searches for BGR values 0..255 and returns a color index
|
|
*/
|
|
function inxsearch(b, g, r) {
|
|
var a, p, dist
|
|
|
|
var bestd = 1000 // biggest possible dist is 256*3
|
|
var best = -1
|
|
|
|
var i = netindex[g] // index on g
|
|
var j = i - 1 // start at netindex[g] and work outwards
|
|
|
|
while (i < netsize || j >= 0) {
|
|
if (i < netsize) {
|
|
p = network[i]
|
|
dist = p[1] - g // inx key
|
|
if (dist >= bestd) i = netsize
|
|
// stop iter
|
|
else {
|
|
i++
|
|
if (dist < 0) dist = -dist
|
|
a = p[0] - b
|
|
if (a < 0) a = -a
|
|
dist += a
|
|
if (dist < bestd) {
|
|
a = p[2] - r
|
|
if (a < 0) a = -a
|
|
dist += a
|
|
if (dist < bestd) {
|
|
bestd = dist
|
|
best = p[3]
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (j >= 0) {
|
|
p = network[j]
|
|
dist = g - p[1] // inx key - reverse dif
|
|
if (dist >= bestd) j = -1
|
|
// stop iter
|
|
else {
|
|
j--
|
|
if (dist < 0) dist = -dist
|
|
a = p[0] - b
|
|
if (a < 0) a = -a
|
|
dist += a
|
|
if (dist < bestd) {
|
|
a = p[2] - r
|
|
if (a < 0) a = -a
|
|
dist += a
|
|
if (dist < bestd) {
|
|
bestd = dist
|
|
best = p[3]
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return best
|
|
}
|
|
|
|
/*
|
|
Private Method: learn
|
|
|
|
"Main Learning Loop"
|
|
*/
|
|
function learn() {
|
|
var i
|
|
|
|
var lengthcount = pixels.length
|
|
var alphadec = 30 + (samplefac - 1) / 3
|
|
var samplepixels = lengthcount / (3 * samplefac)
|
|
var delta = ~~(samplepixels / ncycles)
|
|
var alpha = initalpha
|
|
var radius = initradius
|
|
|
|
var rad = radius >> radiusbiasshift
|
|
|
|
if (rad <= 1) rad = 0
|
|
for (i = 0; i < rad; i++) radpower[i] = alpha * (((rad * rad - i * i) * radbias) / (rad * rad))
|
|
|
|
var step
|
|
if (lengthcount < minpicturebytes) {
|
|
samplefac = 1
|
|
step = 3
|
|
} else if (lengthcount % prime1 !== 0) {
|
|
step = 3 * prime1
|
|
} else if (lengthcount % prime2 !== 0) {
|
|
step = 3 * prime2
|
|
} else if (lengthcount % prime3 !== 0) {
|
|
step = 3 * prime3
|
|
} else {
|
|
step = 3 * prime4
|
|
}
|
|
|
|
var b, g, r, j
|
|
var pix = 0 // current pixel
|
|
|
|
i = 0
|
|
while (i < samplepixels) {
|
|
b = (pixels[pix] & 0xff) << netbiasshift
|
|
g = (pixels[pix + 1] & 0xff) << netbiasshift
|
|
r = (pixels[pix + 2] & 0xff) << netbiasshift
|
|
|
|
j = contest(b, g, r)
|
|
|
|
altersingle(alpha, j, b, g, r)
|
|
if (rad !== 0) alterneigh(rad, j, b, g, r) // alter neighbours
|
|
|
|
pix += step
|
|
if (pix >= lengthcount) pix -= lengthcount
|
|
|
|
i++
|
|
|
|
if (delta === 0) delta = 1
|
|
if (i % delta === 0) {
|
|
alpha -= alpha / alphadec
|
|
radius -= radius / radiusdec
|
|
rad = radius >> radiusbiasshift
|
|
|
|
if (rad <= 1) rad = 0
|
|
for (j = 0; j < rad; j++)
|
|
radpower[j] = alpha * (((rad * rad - j * j) * radbias) / (rad * rad))
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
Method: buildColormap
|
|
|
|
1. initializes network
|
|
2. trains it
|
|
3. removes misconceptions
|
|
4. builds colorindex
|
|
*/
|
|
function buildColormap() {
|
|
init()
|
|
learn()
|
|
unbiasnet()
|
|
inxbuild()
|
|
}
|
|
this.buildColormap = buildColormap
|
|
|
|
/*
|
|
Method: getColormap
|
|
|
|
builds colormap from the index
|
|
|
|
returns array in the format:
|
|
|
|
>
|
|
> [r, g, b, r, g, b, r, g, b, ..]
|
|
>
|
|
*/
|
|
function getColormap() {
|
|
var map = []
|
|
var index = []
|
|
|
|
for (var i = 0; i < netsize; i++) index[network[i][3]] = i
|
|
|
|
var k = 0
|
|
for (var l = 0; l < netsize; l++) {
|
|
var j = index[l]
|
|
map[k++] = network[j][0]
|
|
map[k++] = network[j][1]
|
|
map[k++] = network[j][2]
|
|
}
|
|
return map
|
|
}
|
|
this.getColormap = getColormap
|
|
|
|
/*
|
|
Method: lookupRGB
|
|
|
|
looks for the closest *r*, *g*, *b* color in the map and
|
|
returns its index
|
|
*/
|
|
this.lookupRGB = inxsearch
|
|
}
|
|
|
|
module.exports = NeuQuant
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 2821:
|
|
/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
|
|
|
|
exports.alphasort = alphasort
|
|
exports.alphasorti = alphasorti
|
|
exports.setopts = setopts
|
|
exports.ownProp = ownProp
|
|
exports.makeAbs = makeAbs
|
|
exports.finish = finish
|
|
exports.mark = mark
|
|
exports.isIgnored = isIgnored
|
|
exports.childrenIgnored = childrenIgnored
|
|
|
|
function ownProp (obj, field) {
|
|
return Object.prototype.hasOwnProperty.call(obj, field)
|
|
}
|
|
|
|
var path = __webpack_require__(1017)
|
|
var minimatch = __webpack_require__(9566)
|
|
var isAbsolute = __webpack_require__(1323)
|
|
var Minimatch = minimatch.Minimatch
|
|
|
|
function alphasorti (a, b) {
|
|
return a.toLowerCase().localeCompare(b.toLowerCase())
|
|
}
|
|
|
|
function alphasort (a, b) {
|
|
return a.localeCompare(b)
|
|
}
|
|
|
|
function setupIgnores (self, options) {
|
|
self.ignore = options.ignore || []
|
|
|
|
if (!Array.isArray(self.ignore))
|
|
self.ignore = [self.ignore]
|
|
|
|
if (self.ignore.length) {
|
|
self.ignore = self.ignore.map(ignoreMap)
|
|
}
|
|
}
|
|
|
|
// ignore patterns are always in dot:true mode.
|
|
function ignoreMap (pattern) {
|
|
var gmatcher = null
|
|
if (pattern.slice(-3) === '/**') {
|
|
var gpattern = pattern.replace(/(\/\*\*)+$/, '')
|
|
gmatcher = new Minimatch(gpattern, { dot: true })
|
|
}
|
|
|
|
return {
|
|
matcher: new Minimatch(pattern, { dot: true }),
|
|
gmatcher: gmatcher
|
|
}
|
|
}
|
|
|
|
function setopts (self, pattern, options) {
|
|
if (!options)
|
|
options = {}
|
|
|
|
// base-matching: just use globstar for that.
|
|
if (options.matchBase && -1 === pattern.indexOf("/")) {
|
|
if (options.noglobstar) {
|
|
throw new Error("base matching requires globstar")
|
|
}
|
|
pattern = "**/" + pattern
|
|
}
|
|
|
|
self.silent = !!options.silent
|
|
self.pattern = pattern
|
|
self.strict = options.strict !== false
|
|
self.realpath = !!options.realpath
|
|
self.realpathCache = options.realpathCache || Object.create(null)
|
|
self.follow = !!options.follow
|
|
self.dot = !!options.dot
|
|
self.mark = !!options.mark
|
|
self.nodir = !!options.nodir
|
|
if (self.nodir)
|
|
self.mark = true
|
|
self.sync = !!options.sync
|
|
self.nounique = !!options.nounique
|
|
self.nonull = !!options.nonull
|
|
self.nosort = !!options.nosort
|
|
self.nocase = !!options.nocase
|
|
self.stat = !!options.stat
|
|
self.noprocess = !!options.noprocess
|
|
self.absolute = !!options.absolute
|
|
|
|
self.maxLength = options.maxLength || Infinity
|
|
self.cache = options.cache || Object.create(null)
|
|
self.statCache = options.statCache || Object.create(null)
|
|
self.symlinks = options.symlinks || Object.create(null)
|
|
|
|
setupIgnores(self, options)
|
|
|
|
self.changedCwd = false
|
|
var cwd = process.cwd()
|
|
if (!ownProp(options, "cwd"))
|
|
self.cwd = cwd
|
|
else {
|
|
self.cwd = path.resolve(options.cwd)
|
|
self.changedCwd = self.cwd !== cwd
|
|
}
|
|
|
|
self.root = options.root || path.resolve(self.cwd, "/")
|
|
self.root = path.resolve(self.root)
|
|
if (process.platform === "win32")
|
|
self.root = self.root.replace(/\\/g, "/")
|
|
|
|
// TODO: is an absolute `cwd` supposed to be resolved against `root`?
|
|
// e.g. { cwd: '/test', root: __dirname } === path.join(__dirname, '/test')
|
|
self.cwdAbs = isAbsolute(self.cwd) ? self.cwd : makeAbs(self, self.cwd)
|
|
if (process.platform === "win32")
|
|
self.cwdAbs = self.cwdAbs.replace(/\\/g, "/")
|
|
self.nomount = !!options.nomount
|
|
|
|
// disable comments and negation in Minimatch.
|
|
// Note that they are not supported in Glob itself anyway.
|
|
options.nonegate = true
|
|
options.nocomment = true
|
|
|
|
self.minimatch = new Minimatch(pattern, options)
|
|
self.options = self.minimatch.options
|
|
}
|
|
|
|
function finish (self) {
|
|
var nou = self.nounique
|
|
var all = nou ? [] : Object.create(null)
|
|
|
|
for (var i = 0, l = self.matches.length; i < l; i ++) {
|
|
var matches = self.matches[i]
|
|
if (!matches || Object.keys(matches).length === 0) {
|
|
if (self.nonull) {
|
|
// do like the shell, and spit out the literal glob
|
|
var literal = self.minimatch.globSet[i]
|
|
if (nou)
|
|
all.push(literal)
|
|
else
|
|
all[literal] = true
|
|
}
|
|
} else {
|
|
// had matches
|
|
var m = Object.keys(matches)
|
|
if (nou)
|
|
all.push.apply(all, m)
|
|
else
|
|
m.forEach(function (m) {
|
|
all[m] = true
|
|
})
|
|
}
|
|
}
|
|
|
|
if (!nou)
|
|
all = Object.keys(all)
|
|
|
|
if (!self.nosort)
|
|
all = all.sort(self.nocase ? alphasorti : alphasort)
|
|
|
|
// at *some* point we statted all of these
|
|
if (self.mark) {
|
|
for (var i = 0; i < all.length; i++) {
|
|
all[i] = self._mark(all[i])
|
|
}
|
|
if (self.nodir) {
|
|
all = all.filter(function (e) {
|
|
var notDir = !(/\/$/.test(e))
|
|
var c = self.cache[e] || self.cache[makeAbs(self, e)]
|
|
if (notDir && c)
|
|
notDir = c !== 'DIR' && !Array.isArray(c)
|
|
return notDir
|
|
})
|
|
}
|
|
}
|
|
|
|
if (self.ignore.length)
|
|
all = all.filter(function(m) {
|
|
return !isIgnored(self, m)
|
|
})
|
|
|
|
self.found = all
|
|
}
|
|
|
|
function mark (self, p) {
|
|
var abs = makeAbs(self, p)
|
|
var c = self.cache[abs]
|
|
var m = p
|
|
if (c) {
|
|
var isDir = c === 'DIR' || Array.isArray(c)
|
|
var slash = p.slice(-1) === '/'
|
|
|
|
if (isDir && !slash)
|
|
m += '/'
|
|
else if (!isDir && slash)
|
|
m = m.slice(0, -1)
|
|
|
|
if (m !== p) {
|
|
var mabs = makeAbs(self, m)
|
|
self.statCache[mabs] = self.statCache[abs]
|
|
self.cache[mabs] = self.cache[abs]
|
|
}
|
|
}
|
|
|
|
return m
|
|
}
|
|
|
|
// lotta situps...
|
|
function makeAbs (self, f) {
|
|
var abs = f
|
|
if (f.charAt(0) === '/') {
|
|
abs = path.join(self.root, f)
|
|
} else if (isAbsolute(f) || f === '') {
|
|
abs = f
|
|
} else if (self.changedCwd) {
|
|
abs = path.resolve(self.cwd, f)
|
|
} else {
|
|
abs = path.resolve(f)
|
|
}
|
|
|
|
if (process.platform === 'win32')
|
|
abs = abs.replace(/\\/g, '/')
|
|
|
|
return abs
|
|
}
|
|
|
|
|
|
// Return true, if pattern ends with globstar '**', for the accompanying parent directory.
|
|
// Ex:- If node_modules/** is the pattern, add 'node_modules' to ignore list along with it's contents
|
|
function isIgnored (self, path) {
|
|
if (!self.ignore.length)
|
|
return false
|
|
|
|
return self.ignore.some(function(item) {
|
|
return item.matcher.match(path) || !!(item.gmatcher && item.gmatcher.match(path))
|
|
})
|
|
}
|
|
|
|
function childrenIgnored (self, path) {
|
|
if (!self.ignore.length)
|
|
return false
|
|
|
|
return self.ignore.some(function(item) {
|
|
return !!(item.gmatcher && item.gmatcher.match(path))
|
|
})
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 3700:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
// Approach:
|
|
//
|
|
// 1. Get the minimatch set
|
|
// 2. For each pattern in the set, PROCESS(pattern, false)
|
|
// 3. Store matches per-set, then uniq them
|
|
//
|
|
// PROCESS(pattern, inGlobStar)
|
|
// Get the first [n] items from pattern that are all strings
|
|
// Join these together. This is PREFIX.
|
|
// If there is no more remaining, then stat(PREFIX) and
|
|
// add to matches if it succeeds. END.
|
|
//
|
|
// If inGlobStar and PREFIX is symlink and points to dir
|
|
// set ENTRIES = []
|
|
// else readdir(PREFIX) as ENTRIES
|
|
// If fail, END
|
|
//
|
|
// with ENTRIES
|
|
// If pattern[n] is GLOBSTAR
|
|
// // handle the case where the globstar match is empty
|
|
// // by pruning it out, and testing the resulting pattern
|
|
// PROCESS(pattern[0..n] + pattern[n+1 .. $], false)
|
|
// // handle other cases.
|
|
// for ENTRY in ENTRIES (not dotfiles)
|
|
// // attach globstar + tail onto the entry
|
|
// // Mark that this entry is a globstar match
|
|
// PROCESS(pattern[0..n] + ENTRY + pattern[n .. $], true)
|
|
//
|
|
// else // not globstar
|
|
// for ENTRY in ENTRIES (not dotfiles, unless pattern[n] is dot)
|
|
// Test ENTRY against pattern[n]
|
|
// If fails, continue
|
|
// If passes, PROCESS(pattern[0..n] + item + pattern[n+1 .. $])
|
|
//
|
|
// Caveat:
|
|
// Cache all stats and readdirs results to minimize syscall. Since all
|
|
// we ever care about is existence and directory-ness, we can just keep
|
|
// `true` for files, and [children,...] for directories, or `false` for
|
|
// things that don't exist.
|
|
|
|
module.exports = glob
|
|
|
|
var fs = __webpack_require__(7147)
|
|
var rp = __webpack_require__(8945)
|
|
var minimatch = __webpack_require__(9566)
|
|
var Minimatch = minimatch.Minimatch
|
|
var inherits = __webpack_require__(6919)
|
|
var EE = (__webpack_require__(2361).EventEmitter)
|
|
var path = __webpack_require__(1017)
|
|
var assert = __webpack_require__(9491)
|
|
var isAbsolute = __webpack_require__(1323)
|
|
var globSync = __webpack_require__(7433)
|
|
var common = __webpack_require__(2821)
|
|
var alphasort = common.alphasort
|
|
var alphasorti = common.alphasorti
|
|
var setopts = common.setopts
|
|
var ownProp = common.ownProp
|
|
var inflight = __webpack_require__(9442)
|
|
var util = __webpack_require__(3837)
|
|
var childrenIgnored = common.childrenIgnored
|
|
var isIgnored = common.isIgnored
|
|
|
|
var once = __webpack_require__(7197)
|
|
|
|
function glob (pattern, options, cb) {
|
|
if (typeof options === 'function') cb = options, options = {}
|
|
if (!options) options = {}
|
|
|
|
if (options.sync) {
|
|
if (cb)
|
|
throw new TypeError('callback provided to sync glob')
|
|
return globSync(pattern, options)
|
|
}
|
|
|
|
return new Glob(pattern, options, cb)
|
|
}
|
|
|
|
glob.sync = globSync
|
|
var GlobSync = glob.GlobSync = globSync.GlobSync
|
|
|
|
// old api surface
|
|
glob.glob = glob
|
|
|
|
function extend (origin, add) {
|
|
if (add === null || typeof add !== 'object') {
|
|
return origin
|
|
}
|
|
|
|
var keys = Object.keys(add)
|
|
var i = keys.length
|
|
while (i--) {
|
|
origin[keys[i]] = add[keys[i]]
|
|
}
|
|
return origin
|
|
}
|
|
|
|
glob.hasMagic = function (pattern, options_) {
|
|
var options = extend({}, options_)
|
|
options.noprocess = true
|
|
|
|
var g = new Glob(pattern, options)
|
|
var set = g.minimatch.set
|
|
|
|
if (!pattern)
|
|
return false
|
|
|
|
if (set.length > 1)
|
|
return true
|
|
|
|
for (var j = 0; j < set[0].length; j++) {
|
|
if (typeof set[0][j] !== 'string')
|
|
return true
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
glob.Glob = Glob
|
|
inherits(Glob, EE)
|
|
function Glob (pattern, options, cb) {
|
|
if (typeof options === 'function') {
|
|
cb = options
|
|
options = null
|
|
}
|
|
|
|
if (options && options.sync) {
|
|
if (cb)
|
|
throw new TypeError('callback provided to sync glob')
|
|
return new GlobSync(pattern, options)
|
|
}
|
|
|
|
if (!(this instanceof Glob))
|
|
return new Glob(pattern, options, cb)
|
|
|
|
setopts(this, pattern, options)
|
|
this._didRealPath = false
|
|
|
|
// process each pattern in the minimatch set
|
|
var n = this.minimatch.set.length
|
|
|
|
// The matches are stored as {<filename>: true,...} so that
|
|
// duplicates are automagically pruned.
|
|
// Later, we do an Object.keys() on these.
|
|
// Keep them as a list so we can fill in when nonull is set.
|
|
this.matches = new Array(n)
|
|
|
|
if (typeof cb === 'function') {
|
|
cb = once(cb)
|
|
this.on('error', cb)
|
|
this.on('end', function (matches) {
|
|
cb(null, matches)
|
|
})
|
|
}
|
|
|
|
var self = this
|
|
this._processing = 0
|
|
|
|
this._emitQueue = []
|
|
this._processQueue = []
|
|
this.paused = false
|
|
|
|
if (this.noprocess)
|
|
return this
|
|
|
|
if (n === 0)
|
|
return done()
|
|
|
|
var sync = true
|
|
for (var i = 0; i < n; i ++) {
|
|
this._process(this.minimatch.set[i], i, false, done)
|
|
}
|
|
sync = false
|
|
|
|
function done () {
|
|
--self._processing
|
|
if (self._processing <= 0) {
|
|
if (sync) {
|
|
process.nextTick(function () {
|
|
self._finish()
|
|
})
|
|
} else {
|
|
self._finish()
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
Glob.prototype._finish = function () {
|
|
assert(this instanceof Glob)
|
|
if (this.aborted)
|
|
return
|
|
|
|
if (this.realpath && !this._didRealpath)
|
|
return this._realpath()
|
|
|
|
common.finish(this)
|
|
this.emit('end', this.found)
|
|
}
|
|
|
|
Glob.prototype._realpath = function () {
|
|
if (this._didRealpath)
|
|
return
|
|
|
|
this._didRealpath = true
|
|
|
|
var n = this.matches.length
|
|
if (n === 0)
|
|
return this._finish()
|
|
|
|
var self = this
|
|
for (var i = 0; i < this.matches.length; i++)
|
|
this._realpathSet(i, next)
|
|
|
|
function next () {
|
|
if (--n === 0)
|
|
self._finish()
|
|
}
|
|
}
|
|
|
|
Glob.prototype._realpathSet = function (index, cb) {
|
|
var matchset = this.matches[index]
|
|
if (!matchset)
|
|
return cb()
|
|
|
|
var found = Object.keys(matchset)
|
|
var self = this
|
|
var n = found.length
|
|
|
|
if (n === 0)
|
|
return cb()
|
|
|
|
var set = this.matches[index] = Object.create(null)
|
|
found.forEach(function (p, i) {
|
|
// If there's a problem with the stat, then it means that
|
|
// one or more of the links in the realpath couldn't be
|
|
// resolved. just return the abs value in that case.
|
|
p = self._makeAbs(p)
|
|
rp.realpath(p, self.realpathCache, function (er, real) {
|
|
if (!er)
|
|
set[real] = true
|
|
else if (er.syscall === 'stat')
|
|
set[p] = true
|
|
else
|
|
self.emit('error', er) // srsly wtf right here
|
|
|
|
if (--n === 0) {
|
|
self.matches[index] = set
|
|
cb()
|
|
}
|
|
})
|
|
})
|
|
}
|
|
|
|
Glob.prototype._mark = function (p) {
|
|
return common.mark(this, p)
|
|
}
|
|
|
|
Glob.prototype._makeAbs = function (f) {
|
|
return common.makeAbs(this, f)
|
|
}
|
|
|
|
Glob.prototype.abort = function () {
|
|
this.aborted = true
|
|
this.emit('abort')
|
|
}
|
|
|
|
Glob.prototype.pause = function () {
|
|
if (!this.paused) {
|
|
this.paused = true
|
|
this.emit('pause')
|
|
}
|
|
}
|
|
|
|
Glob.prototype.resume = function () {
|
|
if (this.paused) {
|
|
this.emit('resume')
|
|
this.paused = false
|
|
if (this._emitQueue.length) {
|
|
var eq = this._emitQueue.slice(0)
|
|
this._emitQueue.length = 0
|
|
for (var i = 0; i < eq.length; i ++) {
|
|
var e = eq[i]
|
|
this._emitMatch(e[0], e[1])
|
|
}
|
|
}
|
|
if (this._processQueue.length) {
|
|
var pq = this._processQueue.slice(0)
|
|
this._processQueue.length = 0
|
|
for (var i = 0; i < pq.length; i ++) {
|
|
var p = pq[i]
|
|
this._processing--
|
|
this._process(p[0], p[1], p[2], p[3])
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
Glob.prototype._process = function (pattern, index, inGlobStar, cb) {
|
|
assert(this instanceof Glob)
|
|
assert(typeof cb === 'function')
|
|
|
|
if (this.aborted)
|
|
return
|
|
|
|
this._processing++
|
|
if (this.paused) {
|
|
this._processQueue.push([pattern, index, inGlobStar, cb])
|
|
return
|
|
}
|
|
|
|
//console.error('PROCESS %d', this._processing, pattern)
|
|
|
|
// Get the first [n] parts of pattern that are all strings.
|
|
var n = 0
|
|
while (typeof pattern[n] === 'string') {
|
|
n ++
|
|
}
|
|
// now n is the index of the first one that is *not* a string.
|
|
|
|
// see if there's anything else
|
|
var prefix
|
|
switch (n) {
|
|
// if not, then this is rather simple
|
|
case pattern.length:
|
|
this._processSimple(pattern.join('/'), index, cb)
|
|
return
|
|
|
|
case 0:
|
|
// pattern *starts* with some non-trivial item.
|
|
// going to readdir(cwd), but not include the prefix in matches.
|
|
prefix = null
|
|
break
|
|
|
|
default:
|
|
// pattern has some string bits in the front.
|
|
// whatever it starts with, whether that's 'absolute' like /foo/bar,
|
|
// or 'relative' like '../baz'
|
|
prefix = pattern.slice(0, n).join('/')
|
|
break
|
|
}
|
|
|
|
var remain = pattern.slice(n)
|
|
|
|
// get the list of entries.
|
|
var read
|
|
if (prefix === null)
|
|
read = '.'
|
|
else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {
|
|
if (!prefix || !isAbsolute(prefix))
|
|
prefix = '/' + prefix
|
|
read = prefix
|
|
} else
|
|
read = prefix
|
|
|
|
var abs = this._makeAbs(read)
|
|
|
|
//if ignored, skip _processing
|
|
if (childrenIgnored(this, read))
|
|
return cb()
|
|
|
|
var isGlobStar = remain[0] === minimatch.GLOBSTAR
|
|
if (isGlobStar)
|
|
this._processGlobStar(prefix, read, abs, remain, index, inGlobStar, cb)
|
|
else
|
|
this._processReaddir(prefix, read, abs, remain, index, inGlobStar, cb)
|
|
}
|
|
|
|
Glob.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar, cb) {
|
|
var self = this
|
|
this._readdir(abs, inGlobStar, function (er, entries) {
|
|
return self._processReaddir2(prefix, read, abs, remain, index, inGlobStar, entries, cb)
|
|
})
|
|
}
|
|
|
|
Glob.prototype._processReaddir2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {
|
|
|
|
// if the abs isn't a dir, then nothing can match!
|
|
if (!entries)
|
|
return cb()
|
|
|
|
// It will only match dot entries if it starts with a dot, or if
|
|
// dot is set. Stuff like @(.foo|.bar) isn't allowed.
|
|
var pn = remain[0]
|
|
var negate = !!this.minimatch.negate
|
|
var rawGlob = pn._glob
|
|
var dotOk = this.dot || rawGlob.charAt(0) === '.'
|
|
|
|
var matchedEntries = []
|
|
for (var i = 0; i < entries.length; i++) {
|
|
var e = entries[i]
|
|
if (e.charAt(0) !== '.' || dotOk) {
|
|
var m
|
|
if (negate && !prefix) {
|
|
m = !e.match(pn)
|
|
} else {
|
|
m = e.match(pn)
|
|
}
|
|
if (m)
|
|
matchedEntries.push(e)
|
|
}
|
|
}
|
|
|
|
//console.error('prd2', prefix, entries, remain[0]._glob, matchedEntries)
|
|
|
|
var len = matchedEntries.length
|
|
// If there are no matched entries, then nothing matches.
|
|
if (len === 0)
|
|
return cb()
|
|
|
|
// if this is the last remaining pattern bit, then no need for
|
|
// an additional stat *unless* the user has specified mark or
|
|
// stat explicitly. We know they exist, since readdir returned
|
|
// them.
|
|
|
|
if (remain.length === 1 && !this.mark && !this.stat) {
|
|
if (!this.matches[index])
|
|
this.matches[index] = Object.create(null)
|
|
|
|
for (var i = 0; i < len; i ++) {
|
|
var e = matchedEntries[i]
|
|
if (prefix) {
|
|
if (prefix !== '/')
|
|
e = prefix + '/' + e
|
|
else
|
|
e = prefix + e
|
|
}
|
|
|
|
if (e.charAt(0) === '/' && !this.nomount) {
|
|
e = path.join(this.root, e)
|
|
}
|
|
this._emitMatch(index, e)
|
|
}
|
|
// This was the last one, and no stats were needed
|
|
return cb()
|
|
}
|
|
|
|
// now test all matched entries as stand-ins for that part
|
|
// of the pattern.
|
|
remain.shift()
|
|
for (var i = 0; i < len; i ++) {
|
|
var e = matchedEntries[i]
|
|
var newPattern
|
|
if (prefix) {
|
|
if (prefix !== '/')
|
|
e = prefix + '/' + e
|
|
else
|
|
e = prefix + e
|
|
}
|
|
this._process([e].concat(remain), index, inGlobStar, cb)
|
|
}
|
|
cb()
|
|
}
|
|
|
|
Glob.prototype._emitMatch = function (index, e) {
|
|
if (this.aborted)
|
|
return
|
|
|
|
if (isIgnored(this, e))
|
|
return
|
|
|
|
if (this.paused) {
|
|
this._emitQueue.push([index, e])
|
|
return
|
|
}
|
|
|
|
var abs = isAbsolute(e) ? e : this._makeAbs(e)
|
|
|
|
if (this.mark)
|
|
e = this._mark(e)
|
|
|
|
if (this.absolute)
|
|
e = abs
|
|
|
|
if (this.matches[index][e])
|
|
return
|
|
|
|
if (this.nodir) {
|
|
var c = this.cache[abs]
|
|
if (c === 'DIR' || Array.isArray(c))
|
|
return
|
|
}
|
|
|
|
this.matches[index][e] = true
|
|
|
|
var st = this.statCache[abs]
|
|
if (st)
|
|
this.emit('stat', e, st)
|
|
|
|
this.emit('match', e)
|
|
}
|
|
|
|
Glob.prototype._readdirInGlobStar = function (abs, cb) {
|
|
if (this.aborted)
|
|
return
|
|
|
|
// follow all symlinked directories forever
|
|
// just proceed as if this is a non-globstar situation
|
|
if (this.follow)
|
|
return this._readdir(abs, false, cb)
|
|
|
|
var lstatkey = 'lstat\0' + abs
|
|
var self = this
|
|
var lstatcb = inflight(lstatkey, lstatcb_)
|
|
|
|
if (lstatcb)
|
|
fs.lstat(abs, lstatcb)
|
|
|
|
function lstatcb_ (er, lstat) {
|
|
if (er && er.code === 'ENOENT')
|
|
return cb()
|
|
|
|
var isSym = lstat && lstat.isSymbolicLink()
|
|
self.symlinks[abs] = isSym
|
|
|
|
// If it's not a symlink or a dir, then it's definitely a regular file.
|
|
// don't bother doing a readdir in that case.
|
|
if (!isSym && lstat && !lstat.isDirectory()) {
|
|
self.cache[abs] = 'FILE'
|
|
cb()
|
|
} else
|
|
self._readdir(abs, false, cb)
|
|
}
|
|
}
|
|
|
|
Glob.prototype._readdir = function (abs, inGlobStar, cb) {
|
|
if (this.aborted)
|
|
return
|
|
|
|
cb = inflight('readdir\0'+abs+'\0'+inGlobStar, cb)
|
|
if (!cb)
|
|
return
|
|
|
|
//console.error('RD %j %j', +inGlobStar, abs)
|
|
if (inGlobStar && !ownProp(this.symlinks, abs))
|
|
return this._readdirInGlobStar(abs, cb)
|
|
|
|
if (ownProp(this.cache, abs)) {
|
|
var c = this.cache[abs]
|
|
if (!c || c === 'FILE')
|
|
return cb()
|
|
|
|
if (Array.isArray(c))
|
|
return cb(null, c)
|
|
}
|
|
|
|
var self = this
|
|
fs.readdir(abs, readdirCb(this, abs, cb))
|
|
}
|
|
|
|
function readdirCb (self, abs, cb) {
|
|
return function (er, entries) {
|
|
if (er)
|
|
self._readdirError(abs, er, cb)
|
|
else
|
|
self._readdirEntries(abs, entries, cb)
|
|
}
|
|
}
|
|
|
|
Glob.prototype._readdirEntries = function (abs, entries, cb) {
|
|
if (this.aborted)
|
|
return
|
|
|
|
// if we haven't asked to stat everything, then just
|
|
// assume that everything in there exists, so we can avoid
|
|
// having to stat it a second time.
|
|
if (!this.mark && !this.stat) {
|
|
for (var i = 0; i < entries.length; i ++) {
|
|
var e = entries[i]
|
|
if (abs === '/')
|
|
e = abs + e
|
|
else
|
|
e = abs + '/' + e
|
|
this.cache[e] = true
|
|
}
|
|
}
|
|
|
|
this.cache[abs] = entries
|
|
return cb(null, entries)
|
|
}
|
|
|
|
Glob.prototype._readdirError = function (f, er, cb) {
|
|
if (this.aborted)
|
|
return
|
|
|
|
// handle errors, and cache the information
|
|
switch (er.code) {
|
|
case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205
|
|
case 'ENOTDIR': // totally normal. means it *does* exist.
|
|
var abs = this._makeAbs(f)
|
|
this.cache[abs] = 'FILE'
|
|
if (abs === this.cwdAbs) {
|
|
var error = new Error(er.code + ' invalid cwd ' + this.cwd)
|
|
error.path = this.cwd
|
|
error.code = er.code
|
|
this.emit('error', error)
|
|
this.abort()
|
|
}
|
|
break
|
|
|
|
case 'ENOENT': // not terribly unusual
|
|
case 'ELOOP':
|
|
case 'ENAMETOOLONG':
|
|
case 'UNKNOWN':
|
|
this.cache[this._makeAbs(f)] = false
|
|
break
|
|
|
|
default: // some unusual error. Treat as failure.
|
|
this.cache[this._makeAbs(f)] = false
|
|
if (this.strict) {
|
|
this.emit('error', er)
|
|
// If the error is handled, then we abort
|
|
// if not, we threw out of here
|
|
this.abort()
|
|
}
|
|
if (!this.silent)
|
|
console.error('glob error', er)
|
|
break
|
|
}
|
|
|
|
return cb()
|
|
}
|
|
|
|
Glob.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar, cb) {
|
|
var self = this
|
|
this._readdir(abs, inGlobStar, function (er, entries) {
|
|
self._processGlobStar2(prefix, read, abs, remain, index, inGlobStar, entries, cb)
|
|
})
|
|
}
|
|
|
|
|
|
Glob.prototype._processGlobStar2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {
|
|
//console.error('pgs2', prefix, remain[0], entries)
|
|
|
|
// no entries means not a dir, so it can never have matches
|
|
// foo.txt/** doesn't match foo.txt
|
|
if (!entries)
|
|
return cb()
|
|
|
|
// test without the globstar, and with every child both below
|
|
// and replacing the globstar.
|
|
var remainWithoutGlobStar = remain.slice(1)
|
|
var gspref = prefix ? [ prefix ] : []
|
|
var noGlobStar = gspref.concat(remainWithoutGlobStar)
|
|
|
|
// the noGlobStar pattern exits the inGlobStar state
|
|
this._process(noGlobStar, index, false, cb)
|
|
|
|
var isSym = this.symlinks[abs]
|
|
var len = entries.length
|
|
|
|
// If it's a symlink, and we're in a globstar, then stop
|
|
if (isSym && inGlobStar)
|
|
return cb()
|
|
|
|
for (var i = 0; i < len; i++) {
|
|
var e = entries[i]
|
|
if (e.charAt(0) === '.' && !this.dot)
|
|
continue
|
|
|
|
// these two cases enter the inGlobStar state
|
|
var instead = gspref.concat(entries[i], remainWithoutGlobStar)
|
|
this._process(instead, index, true, cb)
|
|
|
|
var below = gspref.concat(entries[i], remain)
|
|
this._process(below, index, true, cb)
|
|
}
|
|
|
|
cb()
|
|
}
|
|
|
|
Glob.prototype._processSimple = function (prefix, index, cb) {
|
|
// XXX review this. Shouldn't it be doing the mounting etc
|
|
// before doing stat? kinda weird?
|
|
var self = this
|
|
this._stat(prefix, function (er, exists) {
|
|
self._processSimple2(prefix, index, er, exists, cb)
|
|
})
|
|
}
|
|
Glob.prototype._processSimple2 = function (prefix, index, er, exists, cb) {
|
|
|
|
//console.error('ps2', prefix, exists)
|
|
|
|
if (!this.matches[index])
|
|
this.matches[index] = Object.create(null)
|
|
|
|
// If it doesn't exist, then just mark the lack of results
|
|
if (!exists)
|
|
return cb()
|
|
|
|
if (prefix && isAbsolute(prefix) && !this.nomount) {
|
|
var trail = /[\/\\]$/.test(prefix)
|
|
if (prefix.charAt(0) === '/') {
|
|
prefix = path.join(this.root, prefix)
|
|
} else {
|
|
prefix = path.resolve(this.root, prefix)
|
|
if (trail)
|
|
prefix += '/'
|
|
}
|
|
}
|
|
|
|
if (process.platform === 'win32')
|
|
prefix = prefix.replace(/\\/g, '/')
|
|
|
|
// Mark this as a match
|
|
this._emitMatch(index, prefix)
|
|
cb()
|
|
}
|
|
|
|
// Returns either 'DIR', 'FILE', or false
|
|
Glob.prototype._stat = function (f, cb) {
|
|
var abs = this._makeAbs(f)
|
|
var needDir = f.slice(-1) === '/'
|
|
|
|
if (f.length > this.maxLength)
|
|
return cb()
|
|
|
|
if (!this.stat && ownProp(this.cache, abs)) {
|
|
var c = this.cache[abs]
|
|
|
|
if (Array.isArray(c))
|
|
c = 'DIR'
|
|
|
|
// It exists, but maybe not how we need it
|
|
if (!needDir || c === 'DIR')
|
|
return cb(null, c)
|
|
|
|
if (needDir && c === 'FILE')
|
|
return cb()
|
|
|
|
// otherwise we have to stat, because maybe c=true
|
|
// if we know it exists, but not what it is.
|
|
}
|
|
|
|
var exists
|
|
var stat = this.statCache[abs]
|
|
if (stat !== undefined) {
|
|
if (stat === false)
|
|
return cb(null, stat)
|
|
else {
|
|
var type = stat.isDirectory() ? 'DIR' : 'FILE'
|
|
if (needDir && type === 'FILE')
|
|
return cb()
|
|
else
|
|
return cb(null, type, stat)
|
|
}
|
|
}
|
|
|
|
var self = this
|
|
var statcb = inflight('stat\0' + abs, lstatcb_)
|
|
if (statcb)
|
|
fs.lstat(abs, statcb)
|
|
|
|
function lstatcb_ (er, lstat) {
|
|
if (lstat && lstat.isSymbolicLink()) {
|
|
// If it's a symlink, then treat it as the target, unless
|
|
// the target does not exist, then treat it as a file.
|
|
return fs.stat(abs, function (er, stat) {
|
|
if (er)
|
|
self._stat2(f, abs, null, lstat, cb)
|
|
else
|
|
self._stat2(f, abs, er, stat, cb)
|
|
})
|
|
} else {
|
|
self._stat2(f, abs, er, lstat, cb)
|
|
}
|
|
}
|
|
}
|
|
|
|
Glob.prototype._stat2 = function (f, abs, er, stat, cb) {
|
|
if (er && (er.code === 'ENOENT' || er.code === 'ENOTDIR')) {
|
|
this.statCache[abs] = false
|
|
return cb()
|
|
}
|
|
|
|
var needDir = f.slice(-1) === '/'
|
|
this.statCache[abs] = stat
|
|
|
|
if (abs.slice(-1) === '/' && stat && !stat.isDirectory())
|
|
return cb(null, false, stat)
|
|
|
|
var c = true
|
|
if (stat)
|
|
c = stat.isDirectory() ? 'DIR' : 'FILE'
|
|
this.cache[abs] = this.cache[abs] || c
|
|
|
|
if (needDir && c === 'FILE')
|
|
return cb()
|
|
|
|
return cb(null, c, stat)
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 7433:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
module.exports = globSync
|
|
globSync.GlobSync = GlobSync
|
|
|
|
var fs = __webpack_require__(7147)
|
|
var rp = __webpack_require__(8945)
|
|
var minimatch = __webpack_require__(9566)
|
|
var Minimatch = minimatch.Minimatch
|
|
var Glob = (__webpack_require__(3700).Glob)
|
|
var util = __webpack_require__(3837)
|
|
var path = __webpack_require__(1017)
|
|
var assert = __webpack_require__(9491)
|
|
var isAbsolute = __webpack_require__(1323)
|
|
var common = __webpack_require__(2821)
|
|
var alphasort = common.alphasort
|
|
var alphasorti = common.alphasorti
|
|
var setopts = common.setopts
|
|
var ownProp = common.ownProp
|
|
var childrenIgnored = common.childrenIgnored
|
|
var isIgnored = common.isIgnored
|
|
|
|
function globSync (pattern, options) {
|
|
if (typeof options === 'function' || arguments.length === 3)
|
|
throw new TypeError('callback provided to sync glob\n'+
|
|
'See: https://github.com/isaacs/node-glob/issues/167')
|
|
|
|
return new GlobSync(pattern, options).found
|
|
}
|
|
|
|
function GlobSync (pattern, options) {
|
|
if (!pattern)
|
|
throw new Error('must provide pattern')
|
|
|
|
if (typeof options === 'function' || arguments.length === 3)
|
|
throw new TypeError('callback provided to sync glob\n'+
|
|
'See: https://github.com/isaacs/node-glob/issues/167')
|
|
|
|
if (!(this instanceof GlobSync))
|
|
return new GlobSync(pattern, options)
|
|
|
|
setopts(this, pattern, options)
|
|
|
|
if (this.noprocess)
|
|
return this
|
|
|
|
var n = this.minimatch.set.length
|
|
this.matches = new Array(n)
|
|
for (var i = 0; i < n; i ++) {
|
|
this._process(this.minimatch.set[i], i, false)
|
|
}
|
|
this._finish()
|
|
}
|
|
|
|
GlobSync.prototype._finish = function () {
|
|
assert(this instanceof GlobSync)
|
|
if (this.realpath) {
|
|
var self = this
|
|
this.matches.forEach(function (matchset, index) {
|
|
var set = self.matches[index] = Object.create(null)
|
|
for (var p in matchset) {
|
|
try {
|
|
p = self._makeAbs(p)
|
|
var real = rp.realpathSync(p, self.realpathCache)
|
|
set[real] = true
|
|
} catch (er) {
|
|
if (er.syscall === 'stat')
|
|
set[self._makeAbs(p)] = true
|
|
else
|
|
throw er
|
|
}
|
|
}
|
|
})
|
|
}
|
|
common.finish(this)
|
|
}
|
|
|
|
|
|
GlobSync.prototype._process = function (pattern, index, inGlobStar) {
|
|
assert(this instanceof GlobSync)
|
|
|
|
// Get the first [n] parts of pattern that are all strings.
|
|
var n = 0
|
|
while (typeof pattern[n] === 'string') {
|
|
n ++
|
|
}
|
|
// now n is the index of the first one that is *not* a string.
|
|
|
|
// See if there's anything else
|
|
var prefix
|
|
switch (n) {
|
|
// if not, then this is rather simple
|
|
case pattern.length:
|
|
this._processSimple(pattern.join('/'), index)
|
|
return
|
|
|
|
case 0:
|
|
// pattern *starts* with some non-trivial item.
|
|
// going to readdir(cwd), but not include the prefix in matches.
|
|
prefix = null
|
|
break
|
|
|
|
default:
|
|
// pattern has some string bits in the front.
|
|
// whatever it starts with, whether that's 'absolute' like /foo/bar,
|
|
// or 'relative' like '../baz'
|
|
prefix = pattern.slice(0, n).join('/')
|
|
break
|
|
}
|
|
|
|
var remain = pattern.slice(n)
|
|
|
|
// get the list of entries.
|
|
var read
|
|
if (prefix === null)
|
|
read = '.'
|
|
else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {
|
|
if (!prefix || !isAbsolute(prefix))
|
|
prefix = '/' + prefix
|
|
read = prefix
|
|
} else
|
|
read = prefix
|
|
|
|
var abs = this._makeAbs(read)
|
|
|
|
//if ignored, skip processing
|
|
if (childrenIgnored(this, read))
|
|
return
|
|
|
|
var isGlobStar = remain[0] === minimatch.GLOBSTAR
|
|
if (isGlobStar)
|
|
this._processGlobStar(prefix, read, abs, remain, index, inGlobStar)
|
|
else
|
|
this._processReaddir(prefix, read, abs, remain, index, inGlobStar)
|
|
}
|
|
|
|
|
|
GlobSync.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar) {
|
|
var entries = this._readdir(abs, inGlobStar)
|
|
|
|
// if the abs isn't a dir, then nothing can match!
|
|
if (!entries)
|
|
return
|
|
|
|
// It will only match dot entries if it starts with a dot, or if
|
|
// dot is set. Stuff like @(.foo|.bar) isn't allowed.
|
|
var pn = remain[0]
|
|
var negate = !!this.minimatch.negate
|
|
var rawGlob = pn._glob
|
|
var dotOk = this.dot || rawGlob.charAt(0) === '.'
|
|
|
|
var matchedEntries = []
|
|
for (var i = 0; i < entries.length; i++) {
|
|
var e = entries[i]
|
|
if (e.charAt(0) !== '.' || dotOk) {
|
|
var m
|
|
if (negate && !prefix) {
|
|
m = !e.match(pn)
|
|
} else {
|
|
m = e.match(pn)
|
|
}
|
|
if (m)
|
|
matchedEntries.push(e)
|
|
}
|
|
}
|
|
|
|
var len = matchedEntries.length
|
|
// If there are no matched entries, then nothing matches.
|
|
if (len === 0)
|
|
return
|
|
|
|
// if this is the last remaining pattern bit, then no need for
|
|
// an additional stat *unless* the user has specified mark or
|
|
// stat explicitly. We know they exist, since readdir returned
|
|
// them.
|
|
|
|
if (remain.length === 1 && !this.mark && !this.stat) {
|
|
if (!this.matches[index])
|
|
this.matches[index] = Object.create(null)
|
|
|
|
for (var i = 0; i < len; i ++) {
|
|
var e = matchedEntries[i]
|
|
if (prefix) {
|
|
if (prefix.slice(-1) !== '/')
|
|
e = prefix + '/' + e
|
|
else
|
|
e = prefix + e
|
|
}
|
|
|
|
if (e.charAt(0) === '/' && !this.nomount) {
|
|
e = path.join(this.root, e)
|
|
}
|
|
this._emitMatch(index, e)
|
|
}
|
|
// This was the last one, and no stats were needed
|
|
return
|
|
}
|
|
|
|
// now test all matched entries as stand-ins for that part
|
|
// of the pattern.
|
|
remain.shift()
|
|
for (var i = 0; i < len; i ++) {
|
|
var e = matchedEntries[i]
|
|
var newPattern
|
|
if (prefix)
|
|
newPattern = [prefix, e]
|
|
else
|
|
newPattern = [e]
|
|
this._process(newPattern.concat(remain), index, inGlobStar)
|
|
}
|
|
}
|
|
|
|
|
|
GlobSync.prototype._emitMatch = function (index, e) {
|
|
if (isIgnored(this, e))
|
|
return
|
|
|
|
var abs = this._makeAbs(e)
|
|
|
|
if (this.mark)
|
|
e = this._mark(e)
|
|
|
|
if (this.absolute) {
|
|
e = abs
|
|
}
|
|
|
|
if (this.matches[index][e])
|
|
return
|
|
|
|
if (this.nodir) {
|
|
var c = this.cache[abs]
|
|
if (c === 'DIR' || Array.isArray(c))
|
|
return
|
|
}
|
|
|
|
this.matches[index][e] = true
|
|
|
|
if (this.stat)
|
|
this._stat(e)
|
|
}
|
|
|
|
|
|
GlobSync.prototype._readdirInGlobStar = function (abs) {
|
|
// follow all symlinked directories forever
|
|
// just proceed as if this is a non-globstar situation
|
|
if (this.follow)
|
|
return this._readdir(abs, false)
|
|
|
|
var entries
|
|
var lstat
|
|
var stat
|
|
try {
|
|
lstat = fs.lstatSync(abs)
|
|
} catch (er) {
|
|
if (er.code === 'ENOENT') {
|
|
// lstat failed, doesn't exist
|
|
return null
|
|
}
|
|
}
|
|
|
|
var isSym = lstat && lstat.isSymbolicLink()
|
|
this.symlinks[abs] = isSym
|
|
|
|
// If it's not a symlink or a dir, then it's definitely a regular file.
|
|
// don't bother doing a readdir in that case.
|
|
if (!isSym && lstat && !lstat.isDirectory())
|
|
this.cache[abs] = 'FILE'
|
|
else
|
|
entries = this._readdir(abs, false)
|
|
|
|
return entries
|
|
}
|
|
|
|
GlobSync.prototype._readdir = function (abs, inGlobStar) {
|
|
var entries
|
|
|
|
if (inGlobStar && !ownProp(this.symlinks, abs))
|
|
return this._readdirInGlobStar(abs)
|
|
|
|
if (ownProp(this.cache, abs)) {
|
|
var c = this.cache[abs]
|
|
if (!c || c === 'FILE')
|
|
return null
|
|
|
|
if (Array.isArray(c))
|
|
return c
|
|
}
|
|
|
|
try {
|
|
return this._readdirEntries(abs, fs.readdirSync(abs))
|
|
} catch (er) {
|
|
this._readdirError(abs, er)
|
|
return null
|
|
}
|
|
}
|
|
|
|
GlobSync.prototype._readdirEntries = function (abs, entries) {
|
|
// if we haven't asked to stat everything, then just
|
|
// assume that everything in there exists, so we can avoid
|
|
// having to stat it a second time.
|
|
if (!this.mark && !this.stat) {
|
|
for (var i = 0; i < entries.length; i ++) {
|
|
var e = entries[i]
|
|
if (abs === '/')
|
|
e = abs + e
|
|
else
|
|
e = abs + '/' + e
|
|
this.cache[e] = true
|
|
}
|
|
}
|
|
|
|
this.cache[abs] = entries
|
|
|
|
// mark and cache dir-ness
|
|
return entries
|
|
}
|
|
|
|
GlobSync.prototype._readdirError = function (f, er) {
|
|
// handle errors, and cache the information
|
|
switch (er.code) {
|
|
case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205
|
|
case 'ENOTDIR': // totally normal. means it *does* exist.
|
|
var abs = this._makeAbs(f)
|
|
this.cache[abs] = 'FILE'
|
|
if (abs === this.cwdAbs) {
|
|
var error = new Error(er.code + ' invalid cwd ' + this.cwd)
|
|
error.path = this.cwd
|
|
error.code = er.code
|
|
throw error
|
|
}
|
|
break
|
|
|
|
case 'ENOENT': // not terribly unusual
|
|
case 'ELOOP':
|
|
case 'ENAMETOOLONG':
|
|
case 'UNKNOWN':
|
|
this.cache[this._makeAbs(f)] = false
|
|
break
|
|
|
|
default: // some unusual error. Treat as failure.
|
|
this.cache[this._makeAbs(f)] = false
|
|
if (this.strict)
|
|
throw er
|
|
if (!this.silent)
|
|
console.error('glob error', er)
|
|
break
|
|
}
|
|
}
|
|
|
|
GlobSync.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar) {
|
|
|
|
var entries = this._readdir(abs, inGlobStar)
|
|
|
|
// no entries means not a dir, so it can never have matches
|
|
// foo.txt/** doesn't match foo.txt
|
|
if (!entries)
|
|
return
|
|
|
|
// test without the globstar, and with every child both below
|
|
// and replacing the globstar.
|
|
var remainWithoutGlobStar = remain.slice(1)
|
|
var gspref = prefix ? [ prefix ] : []
|
|
var noGlobStar = gspref.concat(remainWithoutGlobStar)
|
|
|
|
// the noGlobStar pattern exits the inGlobStar state
|
|
this._process(noGlobStar, index, false)
|
|
|
|
var len = entries.length
|
|
var isSym = this.symlinks[abs]
|
|
|
|
// If it's a symlink, and we're in a globstar, then stop
|
|
if (isSym && inGlobStar)
|
|
return
|
|
|
|
for (var i = 0; i < len; i++) {
|
|
var e = entries[i]
|
|
if (e.charAt(0) === '.' && !this.dot)
|
|
continue
|
|
|
|
// these two cases enter the inGlobStar state
|
|
var instead = gspref.concat(entries[i], remainWithoutGlobStar)
|
|
this._process(instead, index, true)
|
|
|
|
var below = gspref.concat(entries[i], remain)
|
|
this._process(below, index, true)
|
|
}
|
|
}
|
|
|
|
GlobSync.prototype._processSimple = function (prefix, index) {
|
|
// XXX review this. Shouldn't it be doing the mounting etc
|
|
// before doing stat? kinda weird?
|
|
var exists = this._stat(prefix)
|
|
|
|
if (!this.matches[index])
|
|
this.matches[index] = Object.create(null)
|
|
|
|
// If it doesn't exist, then just mark the lack of results
|
|
if (!exists)
|
|
return
|
|
|
|
if (prefix && isAbsolute(prefix) && !this.nomount) {
|
|
var trail = /[\/\\]$/.test(prefix)
|
|
if (prefix.charAt(0) === '/') {
|
|
prefix = path.join(this.root, prefix)
|
|
} else {
|
|
prefix = path.resolve(this.root, prefix)
|
|
if (trail)
|
|
prefix += '/'
|
|
}
|
|
}
|
|
|
|
if (process.platform === 'win32')
|
|
prefix = prefix.replace(/\\/g, '/')
|
|
|
|
// Mark this as a match
|
|
this._emitMatch(index, prefix)
|
|
}
|
|
|
|
// Returns either 'DIR', 'FILE', or false
|
|
GlobSync.prototype._stat = function (f) {
|
|
var abs = this._makeAbs(f)
|
|
var needDir = f.slice(-1) === '/'
|
|
|
|
if (f.length > this.maxLength)
|
|
return false
|
|
|
|
if (!this.stat && ownProp(this.cache, abs)) {
|
|
var c = this.cache[abs]
|
|
|
|
if (Array.isArray(c))
|
|
c = 'DIR'
|
|
|
|
// It exists, but maybe not how we need it
|
|
if (!needDir || c === 'DIR')
|
|
return c
|
|
|
|
if (needDir && c === 'FILE')
|
|
return false
|
|
|
|
// otherwise we have to stat, because maybe c=true
|
|
// if we know it exists, but not what it is.
|
|
}
|
|
|
|
var exists
|
|
var stat = this.statCache[abs]
|
|
if (!stat) {
|
|
var lstat
|
|
try {
|
|
lstat = fs.lstatSync(abs)
|
|
} catch (er) {
|
|
if (er && (er.code === 'ENOENT' || er.code === 'ENOTDIR')) {
|
|
this.statCache[abs] = false
|
|
return false
|
|
}
|
|
}
|
|
|
|
if (lstat && lstat.isSymbolicLink()) {
|
|
try {
|
|
stat = fs.statSync(abs)
|
|
} catch (er) {
|
|
stat = lstat
|
|
}
|
|
} else {
|
|
stat = lstat
|
|
}
|
|
}
|
|
|
|
this.statCache[abs] = stat
|
|
|
|
var c = true
|
|
if (stat)
|
|
c = stat.isDirectory() ? 'DIR' : 'FILE'
|
|
|
|
this.cache[abs] = this.cache[abs] || c
|
|
|
|
if (needDir && c === 'FILE')
|
|
return false
|
|
|
|
return c
|
|
}
|
|
|
|
GlobSync.prototype._mark = function (p) {
|
|
return common.mark(this, p)
|
|
}
|
|
|
|
GlobSync.prototype._makeAbs = function (f) {
|
|
return common.makeAbs(this, f)
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 9442:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
var wrappy = __webpack_require__(4586)
|
|
var reqs = Object.create(null)
|
|
var once = __webpack_require__(7197)
|
|
|
|
module.exports = wrappy(inflight)
|
|
|
|
function inflight (key, cb) {
|
|
if (reqs[key]) {
|
|
reqs[key].push(cb)
|
|
return null
|
|
} else {
|
|
reqs[key] = [cb]
|
|
return makeres(key)
|
|
}
|
|
}
|
|
|
|
function makeres (key) {
|
|
return once(function RES () {
|
|
var cbs = reqs[key]
|
|
var len = cbs.length
|
|
var args = slice(arguments)
|
|
|
|
// XXX It's somewhat ambiguous whether a new callback added in this
|
|
// pass should be queued for later execution if something in the
|
|
// list of callbacks throws, or if it should just be discarded.
|
|
// However, it's such an edge case that it hardly matters, and either
|
|
// choice is likely as surprising as the other.
|
|
// As it happens, we do go ahead and schedule it for later execution.
|
|
try {
|
|
for (var i = 0; i < len; i++) {
|
|
cbs[i].apply(null, args)
|
|
}
|
|
} finally {
|
|
if (cbs.length > len) {
|
|
// added more in the interim.
|
|
// de-zalgo, just in case, but don't call again.
|
|
cbs.splice(0, len)
|
|
process.nextTick(function () {
|
|
RES.apply(null, args)
|
|
})
|
|
} else {
|
|
delete reqs[key]
|
|
}
|
|
}
|
|
})
|
|
}
|
|
|
|
function slice (args) {
|
|
var length = args.length
|
|
var array = []
|
|
|
|
for (var i = 0; i < length; i++) array[i] = args[i]
|
|
return array
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 6919:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
try {
|
|
var util = __webpack_require__(3837);
|
|
/* istanbul ignore next */
|
|
if (typeof util.inherits !== 'function') throw '';
|
|
module.exports = util.inherits;
|
|
} catch (e) {
|
|
/* istanbul ignore next */
|
|
module.exports = __webpack_require__(7526);
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 7526:
|
|
/***/ ((module) => {
|
|
|
|
if (typeof Object.create === 'function') {
|
|
// implementation from standard node.js 'util' module
|
|
module.exports = function inherits(ctor, superCtor) {
|
|
if (superCtor) {
|
|
ctor.super_ = superCtor
|
|
ctor.prototype = Object.create(superCtor.prototype, {
|
|
constructor: {
|
|
value: ctor,
|
|
enumerable: false,
|
|
writable: true,
|
|
configurable: true
|
|
}
|
|
})
|
|
}
|
|
};
|
|
} else {
|
|
// old school shim for old browsers
|
|
module.exports = function inherits(ctor, superCtor) {
|
|
if (superCtor) {
|
|
ctor.super_ = superCtor
|
|
var TempCtor = function () {}
|
|
TempCtor.prototype = superCtor.prototype
|
|
ctor.prototype = new TempCtor()
|
|
ctor.prototype.constructor = ctor
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 9566:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
module.exports = minimatch
|
|
minimatch.Minimatch = Minimatch
|
|
|
|
var path = { sep: '/' }
|
|
try {
|
|
path = __webpack_require__(1017)
|
|
} catch (er) {}
|
|
|
|
var GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {}
|
|
var expand = __webpack_require__(3197)
|
|
|
|
var plTypes = {
|
|
'!': { open: '(?:(?!(?:', close: '))[^/]*?)'},
|
|
'?': { open: '(?:', close: ')?' },
|
|
'+': { open: '(?:', close: ')+' },
|
|
'*': { open: '(?:', close: ')*' },
|
|
'@': { open: '(?:', close: ')' }
|
|
}
|
|
|
|
// any single thing other than /
|
|
// don't need to escape / when using new RegExp()
|
|
var qmark = '[^/]'
|
|
|
|
// * => any number of characters
|
|
var star = qmark + '*?'
|
|
|
|
// ** when dots are allowed. Anything goes, except .. and .
|
|
// not (^ or / followed by one or two dots followed by $ or /),
|
|
// followed by anything, any number of times.
|
|
var twoStarDot = '(?:(?!(?:\\\/|^)(?:\\.{1,2})($|\\\/)).)*?'
|
|
|
|
// not a ^ or / followed by a dot,
|
|
// followed by anything, any number of times.
|
|
var twoStarNoDot = '(?:(?!(?:\\\/|^)\\.).)*?'
|
|
|
|
// characters that need to be escaped in RegExp.
|
|
var reSpecials = charSet('().*{}+?[]^$\\!')
|
|
|
|
// "abc" -> { a:true, b:true, c:true }
|
|
function charSet (s) {
|
|
return s.split('').reduce(function (set, c) {
|
|
set[c] = true
|
|
return set
|
|
}, {})
|
|
}
|
|
|
|
// normalizes slashes.
|
|
var slashSplit = /\/+/
|
|
|
|
minimatch.filter = filter
|
|
function filter (pattern, options) {
|
|
options = options || {}
|
|
return function (p, i, list) {
|
|
return minimatch(p, pattern, options)
|
|
}
|
|
}
|
|
|
|
function ext (a, b) {
|
|
a = a || {}
|
|
b = b || {}
|
|
var t = {}
|
|
Object.keys(b).forEach(function (k) {
|
|
t[k] = b[k]
|
|
})
|
|
Object.keys(a).forEach(function (k) {
|
|
t[k] = a[k]
|
|
})
|
|
return t
|
|
}
|
|
|
|
minimatch.defaults = function (def) {
|
|
if (!def || !Object.keys(def).length) return minimatch
|
|
|
|
var orig = minimatch
|
|
|
|
var m = function minimatch (p, pattern, options) {
|
|
return orig.minimatch(p, pattern, ext(def, options))
|
|
}
|
|
|
|
m.Minimatch = function Minimatch (pattern, options) {
|
|
return new orig.Minimatch(pattern, ext(def, options))
|
|
}
|
|
|
|
return m
|
|
}
|
|
|
|
Minimatch.defaults = function (def) {
|
|
if (!def || !Object.keys(def).length) return Minimatch
|
|
return minimatch.defaults(def).Minimatch
|
|
}
|
|
|
|
function minimatch (p, pattern, options) {
|
|
if (typeof pattern !== 'string') {
|
|
throw new TypeError('glob pattern string required')
|
|
}
|
|
|
|
if (!options) options = {}
|
|
|
|
// shortcut: comments match nothing.
|
|
if (!options.nocomment && pattern.charAt(0) === '#') {
|
|
return false
|
|
}
|
|
|
|
// "" only matches ""
|
|
if (pattern.trim() === '') return p === ''
|
|
|
|
return new Minimatch(pattern, options).match(p)
|
|
}
|
|
|
|
function Minimatch (pattern, options) {
|
|
if (!(this instanceof Minimatch)) {
|
|
return new Minimatch(pattern, options)
|
|
}
|
|
|
|
if (typeof pattern !== 'string') {
|
|
throw new TypeError('glob pattern string required')
|
|
}
|
|
|
|
if (!options) options = {}
|
|
pattern = pattern.trim()
|
|
|
|
// windows support: need to use /, not \
|
|
if (path.sep !== '/') {
|
|
pattern = pattern.split(path.sep).join('/')
|
|
}
|
|
|
|
this.options = options
|
|
this.set = []
|
|
this.pattern = pattern
|
|
this.regexp = null
|
|
this.negate = false
|
|
this.comment = false
|
|
this.empty = false
|
|
|
|
// make the set of regexps etc.
|
|
this.make()
|
|
}
|
|
|
|
Minimatch.prototype.debug = function () {}
|
|
|
|
Minimatch.prototype.make = make
|
|
function make () {
|
|
// don't do it more than once.
|
|
if (this._made) return
|
|
|
|
var pattern = this.pattern
|
|
var options = this.options
|
|
|
|
// empty patterns and comments match nothing.
|
|
if (!options.nocomment && pattern.charAt(0) === '#') {
|
|
this.comment = true
|
|
return
|
|
}
|
|
if (!pattern) {
|
|
this.empty = true
|
|
return
|
|
}
|
|
|
|
// step 1: figure out negation, etc.
|
|
this.parseNegate()
|
|
|
|
// step 2: expand braces
|
|
var set = this.globSet = this.braceExpand()
|
|
|
|
if (options.debug) this.debug = console.error
|
|
|
|
this.debug(this.pattern, set)
|
|
|
|
// step 3: now we have a set, so turn each one into a series of path-portion
|
|
// matching patterns.
|
|
// These will be regexps, except in the case of "**", which is
|
|
// set to the GLOBSTAR object for globstar behavior,
|
|
// and will not contain any / characters
|
|
set = this.globParts = set.map(function (s) {
|
|
return s.split(slashSplit)
|
|
})
|
|
|
|
this.debug(this.pattern, set)
|
|
|
|
// glob --> regexps
|
|
set = set.map(function (s, si, set) {
|
|
return s.map(this.parse, this)
|
|
}, this)
|
|
|
|
this.debug(this.pattern, set)
|
|
|
|
// filter out everything that didn't compile properly.
|
|
set = set.filter(function (s) {
|
|
return s.indexOf(false) === -1
|
|
})
|
|
|
|
this.debug(this.pattern, set)
|
|
|
|
this.set = set
|
|
}
|
|
|
|
Minimatch.prototype.parseNegate = parseNegate
|
|
function parseNegate () {
|
|
var pattern = this.pattern
|
|
var negate = false
|
|
var options = this.options
|
|
var negateOffset = 0
|
|
|
|
if (options.nonegate) return
|
|
|
|
for (var i = 0, l = pattern.length
|
|
; i < l && pattern.charAt(i) === '!'
|
|
; i++) {
|
|
negate = !negate
|
|
negateOffset++
|
|
}
|
|
|
|
if (negateOffset) this.pattern = pattern.substr(negateOffset)
|
|
this.negate = negate
|
|
}
|
|
|
|
// Brace expansion:
|
|
// a{b,c}d -> abd acd
|
|
// a{b,}c -> abc ac
|
|
// a{0..3}d -> a0d a1d a2d a3d
|
|
// a{b,c{d,e}f}g -> abg acdfg acefg
|
|
// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg
|
|
//
|
|
// Invalid sets are not expanded.
|
|
// a{2..}b -> a{2..}b
|
|
// a{b}c -> a{b}c
|
|
minimatch.braceExpand = function (pattern, options) {
|
|
return braceExpand(pattern, options)
|
|
}
|
|
|
|
Minimatch.prototype.braceExpand = braceExpand
|
|
|
|
function braceExpand (pattern, options) {
|
|
if (!options) {
|
|
if (this instanceof Minimatch) {
|
|
options = this.options
|
|
} else {
|
|
options = {}
|
|
}
|
|
}
|
|
|
|
pattern = typeof pattern === 'undefined'
|
|
? this.pattern : pattern
|
|
|
|
if (typeof pattern === 'undefined') {
|
|
throw new TypeError('undefined pattern')
|
|
}
|
|
|
|
if (options.nobrace ||
|
|
!pattern.match(/\{.*\}/)) {
|
|
// shortcut. no need to expand.
|
|
return [pattern]
|
|
}
|
|
|
|
return expand(pattern)
|
|
}
|
|
|
|
// parse a component of the expanded set.
|
|
// At this point, no pattern may contain "/" in it
|
|
// so we're going to return a 2d array, where each entry is the full
|
|
// pattern, split on '/', and then turned into a regular expression.
|
|
// A regexp is made at the end which joins each array with an
|
|
// escaped /, and another full one which joins each regexp with |.
|
|
//
|
|
// Following the lead of Bash 4.1, note that "**" only has special meaning
|
|
// when it is the *only* thing in a path portion. Otherwise, any series
|
|
// of * is equivalent to a single *. Globstar behavior is enabled by
|
|
// default, and can be disabled by setting options.noglobstar.
|
|
Minimatch.prototype.parse = parse
|
|
var SUBPARSE = {}
|
|
function parse (pattern, isSub) {
|
|
if (pattern.length > 1024 * 64) {
|
|
throw new TypeError('pattern is too long')
|
|
}
|
|
|
|
var options = this.options
|
|
|
|
// shortcuts
|
|
if (!options.noglobstar && pattern === '**') return GLOBSTAR
|
|
if (pattern === '') return ''
|
|
|
|
var re = ''
|
|
var hasMagic = !!options.nocase
|
|
var escaping = false
|
|
// ? => one single character
|
|
var patternListStack = []
|
|
var negativeLists = []
|
|
var stateChar
|
|
var inClass = false
|
|
var reClassStart = -1
|
|
var classStart = -1
|
|
// . and .. never match anything that doesn't start with .,
|
|
// even when options.dot is set.
|
|
var patternStart = pattern.charAt(0) === '.' ? '' // anything
|
|
// not (start or / followed by . or .. followed by / or end)
|
|
: options.dot ? '(?!(?:^|\\\/)\\.{1,2}(?:$|\\\/))'
|
|
: '(?!\\.)'
|
|
var self = this
|
|
|
|
function clearStateChar () {
|
|
if (stateChar) {
|
|
// we had some state-tracking character
|
|
// that wasn't consumed by this pass.
|
|
switch (stateChar) {
|
|
case '*':
|
|
re += star
|
|
hasMagic = true
|
|
break
|
|
case '?':
|
|
re += qmark
|
|
hasMagic = true
|
|
break
|
|
default:
|
|
re += '\\' + stateChar
|
|
break
|
|
}
|
|
self.debug('clearStateChar %j %j', stateChar, re)
|
|
stateChar = false
|
|
}
|
|
}
|
|
|
|
for (var i = 0, len = pattern.length, c
|
|
; (i < len) && (c = pattern.charAt(i))
|
|
; i++) {
|
|
this.debug('%s\t%s %s %j', pattern, i, re, c)
|
|
|
|
// skip over any that are escaped.
|
|
if (escaping && reSpecials[c]) {
|
|
re += '\\' + c
|
|
escaping = false
|
|
continue
|
|
}
|
|
|
|
switch (c) {
|
|
case '/':
|
|
// completely not allowed, even escaped.
|
|
// Should already be path-split by now.
|
|
return false
|
|
|
|
case '\\':
|
|
clearStateChar()
|
|
escaping = true
|
|
continue
|
|
|
|
// the various stateChar values
|
|
// for the "extglob" stuff.
|
|
case '?':
|
|
case '*':
|
|
case '+':
|
|
case '@':
|
|
case '!':
|
|
this.debug('%s\t%s %s %j <-- stateChar', pattern, i, re, c)
|
|
|
|
// all of those are literals inside a class, except that
|
|
// the glob [!a] means [^a] in regexp
|
|
if (inClass) {
|
|
this.debug(' in class')
|
|
if (c === '!' && i === classStart + 1) c = '^'
|
|
re += c
|
|
continue
|
|
}
|
|
|
|
// if we already have a stateChar, then it means
|
|
// that there was something like ** or +? in there.
|
|
// Handle the stateChar, then proceed with this one.
|
|
self.debug('call clearStateChar %j', stateChar)
|
|
clearStateChar()
|
|
stateChar = c
|
|
// if extglob is disabled, then +(asdf|foo) isn't a thing.
|
|
// just clear the statechar *now*, rather than even diving into
|
|
// the patternList stuff.
|
|
if (options.noext) clearStateChar()
|
|
continue
|
|
|
|
case '(':
|
|
if (inClass) {
|
|
re += '('
|
|
continue
|
|
}
|
|
|
|
if (!stateChar) {
|
|
re += '\\('
|
|
continue
|
|
}
|
|
|
|
patternListStack.push({
|
|
type: stateChar,
|
|
start: i - 1,
|
|
reStart: re.length,
|
|
open: plTypes[stateChar].open,
|
|
close: plTypes[stateChar].close
|
|
})
|
|
// negation is (?:(?!js)[^/]*)
|
|
re += stateChar === '!' ? '(?:(?!(?:' : '(?:'
|
|
this.debug('plType %j %j', stateChar, re)
|
|
stateChar = false
|
|
continue
|
|
|
|
case ')':
|
|
if (inClass || !patternListStack.length) {
|
|
re += '\\)'
|
|
continue
|
|
}
|
|
|
|
clearStateChar()
|
|
hasMagic = true
|
|
var pl = patternListStack.pop()
|
|
// negation is (?:(?!js)[^/]*)
|
|
// The others are (?:<pattern>)<type>
|
|
re += pl.close
|
|
if (pl.type === '!') {
|
|
negativeLists.push(pl)
|
|
}
|
|
pl.reEnd = re.length
|
|
continue
|
|
|
|
case '|':
|
|
if (inClass || !patternListStack.length || escaping) {
|
|
re += '\\|'
|
|
escaping = false
|
|
continue
|
|
}
|
|
|
|
clearStateChar()
|
|
re += '|'
|
|
continue
|
|
|
|
// these are mostly the same in regexp and glob
|
|
case '[':
|
|
// swallow any state-tracking char before the [
|
|
clearStateChar()
|
|
|
|
if (inClass) {
|
|
re += '\\' + c
|
|
continue
|
|
}
|
|
|
|
inClass = true
|
|
classStart = i
|
|
reClassStart = re.length
|
|
re += c
|
|
continue
|
|
|
|
case ']':
|
|
// a right bracket shall lose its special
|
|
// meaning and represent itself in
|
|
// a bracket expression if it occurs
|
|
// first in the list. -- POSIX.2 2.8.3.2
|
|
if (i === classStart + 1 || !inClass) {
|
|
re += '\\' + c
|
|
escaping = false
|
|
continue
|
|
}
|
|
|
|
// handle the case where we left a class open.
|
|
// "[z-a]" is valid, equivalent to "\[z-a\]"
|
|
if (inClass) {
|
|
// split where the last [ was, make sure we don't have
|
|
// an invalid re. if so, re-walk the contents of the
|
|
// would-be class to re-translate any characters that
|
|
// were passed through as-is
|
|
// TODO: It would probably be faster to determine this
|
|
// without a try/catch and a new RegExp, but it's tricky
|
|
// to do safely. For now, this is safe and works.
|
|
var cs = pattern.substring(classStart + 1, i)
|
|
try {
|
|
RegExp('[' + cs + ']')
|
|
} catch (er) {
|
|
// not a valid class!
|
|
var sp = this.parse(cs, SUBPARSE)
|
|
re = re.substr(0, reClassStart) + '\\[' + sp[0] + '\\]'
|
|
hasMagic = hasMagic || sp[1]
|
|
inClass = false
|
|
continue
|
|
}
|
|
}
|
|
|
|
// finish up the class.
|
|
hasMagic = true
|
|
inClass = false
|
|
re += c
|
|
continue
|
|
|
|
default:
|
|
// swallow any state char that wasn't consumed
|
|
clearStateChar()
|
|
|
|
if (escaping) {
|
|
// no need
|
|
escaping = false
|
|
} else if (reSpecials[c]
|
|
&& !(c === '^' && inClass)) {
|
|
re += '\\'
|
|
}
|
|
|
|
re += c
|
|
|
|
} // switch
|
|
} // for
|
|
|
|
// handle the case where we left a class open.
|
|
// "[abc" is valid, equivalent to "\[abc"
|
|
if (inClass) {
|
|
// split where the last [ was, and escape it
|
|
// this is a huge pita. We now have to re-walk
|
|
// the contents of the would-be class to re-translate
|
|
// any characters that were passed through as-is
|
|
cs = pattern.substr(classStart + 1)
|
|
sp = this.parse(cs, SUBPARSE)
|
|
re = re.substr(0, reClassStart) + '\\[' + sp[0]
|
|
hasMagic = hasMagic || sp[1]
|
|
}
|
|
|
|
// handle the case where we had a +( thing at the *end*
|
|
// of the pattern.
|
|
// each pattern list stack adds 3 chars, and we need to go through
|
|
// and escape any | chars that were passed through as-is for the regexp.
|
|
// Go through and escape them, taking care not to double-escape any
|
|
// | chars that were already escaped.
|
|
for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) {
|
|
var tail = re.slice(pl.reStart + pl.open.length)
|
|
this.debug('setting tail', re, pl)
|
|
// maybe some even number of \, then maybe 1 \, followed by a |
|
|
tail = tail.replace(/((?:\\{2}){0,64})(\\?)\|/g, function (_, $1, $2) {
|
|
if (!$2) {
|
|
// the | isn't already escaped, so escape it.
|
|
$2 = '\\'
|
|
}
|
|
|
|
// need to escape all those slashes *again*, without escaping the
|
|
// one that we need for escaping the | character. As it works out,
|
|
// escaping an even number of slashes can be done by simply repeating
|
|
// it exactly after itself. That's why this trick works.
|
|
//
|
|
// I am sorry that you have to see this.
|
|
return $1 + $1 + $2 + '|'
|
|
})
|
|
|
|
this.debug('tail=%j\n %s', tail, tail, pl, re)
|
|
var t = pl.type === '*' ? star
|
|
: pl.type === '?' ? qmark
|
|
: '\\' + pl.type
|
|
|
|
hasMagic = true
|
|
re = re.slice(0, pl.reStart) + t + '\\(' + tail
|
|
}
|
|
|
|
// handle trailing things that only matter at the very end.
|
|
clearStateChar()
|
|
if (escaping) {
|
|
// trailing \\
|
|
re += '\\\\'
|
|
}
|
|
|
|
// only need to apply the nodot start if the re starts with
|
|
// something that could conceivably capture a dot
|
|
var addPatternStart = false
|
|
switch (re.charAt(0)) {
|
|
case '.':
|
|
case '[':
|
|
case '(': addPatternStart = true
|
|
}
|
|
|
|
// Hack to work around lack of negative lookbehind in JS
|
|
// A pattern like: *.!(x).!(y|z) needs to ensure that a name
|
|
// like 'a.xyz.yz' doesn't match. So, the first negative
|
|
// lookahead, has to look ALL the way ahead, to the end of
|
|
// the pattern.
|
|
for (var n = negativeLists.length - 1; n > -1; n--) {
|
|
var nl = negativeLists[n]
|
|
|
|
var nlBefore = re.slice(0, nl.reStart)
|
|
var nlFirst = re.slice(nl.reStart, nl.reEnd - 8)
|
|
var nlLast = re.slice(nl.reEnd - 8, nl.reEnd)
|
|
var nlAfter = re.slice(nl.reEnd)
|
|
|
|
nlLast += nlAfter
|
|
|
|
// Handle nested stuff like *(*.js|!(*.json)), where open parens
|
|
// mean that we should *not* include the ) in the bit that is considered
|
|
// "after" the negated section.
|
|
var openParensBefore = nlBefore.split('(').length - 1
|
|
var cleanAfter = nlAfter
|
|
for (i = 0; i < openParensBefore; i++) {
|
|
cleanAfter = cleanAfter.replace(/\)[+*?]?/, '')
|
|
}
|
|
nlAfter = cleanAfter
|
|
|
|
var dollar = ''
|
|
if (nlAfter === '' && isSub !== SUBPARSE) {
|
|
dollar = '$'
|
|
}
|
|
var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast
|
|
re = newRe
|
|
}
|
|
|
|
// if the re is not "" at this point, then we need to make sure
|
|
// it doesn't match against an empty path part.
|
|
// Otherwise a/* will match a/, which it should not.
|
|
if (re !== '' && hasMagic) {
|
|
re = '(?=.)' + re
|
|
}
|
|
|
|
if (addPatternStart) {
|
|
re = patternStart + re
|
|
}
|
|
|
|
// parsing just a piece of a larger pattern.
|
|
if (isSub === SUBPARSE) {
|
|
return [re, hasMagic]
|
|
}
|
|
|
|
// skip the regexp for non-magical patterns
|
|
// unescape anything in it, though, so that it'll be
|
|
// an exact match against a file etc.
|
|
if (!hasMagic) {
|
|
return globUnescape(pattern)
|
|
}
|
|
|
|
var flags = options.nocase ? 'i' : ''
|
|
try {
|
|
var regExp = new RegExp('^' + re + '$', flags)
|
|
} catch (er) {
|
|
// If it was an invalid regular expression, then it can't match
|
|
// anything. This trick looks for a character after the end of
|
|
// the string, which is of course impossible, except in multi-line
|
|
// mode, but it's not a /m regex.
|
|
return new RegExp('$.')
|
|
}
|
|
|
|
regExp._glob = pattern
|
|
regExp._src = re
|
|
|
|
return regExp
|
|
}
|
|
|
|
minimatch.makeRe = function (pattern, options) {
|
|
return new Minimatch(pattern, options || {}).makeRe()
|
|
}
|
|
|
|
Minimatch.prototype.makeRe = makeRe
|
|
function makeRe () {
|
|
if (this.regexp || this.regexp === false) return this.regexp
|
|
|
|
// at this point, this.set is a 2d array of partial
|
|
// pattern strings, or "**".
|
|
//
|
|
// It's better to use .match(). This function shouldn't
|
|
// be used, really, but it's pretty convenient sometimes,
|
|
// when you just want to work with a regex.
|
|
var set = this.set
|
|
|
|
if (!set.length) {
|
|
this.regexp = false
|
|
return this.regexp
|
|
}
|
|
var options = this.options
|
|
|
|
var twoStar = options.noglobstar ? star
|
|
: options.dot ? twoStarDot
|
|
: twoStarNoDot
|
|
var flags = options.nocase ? 'i' : ''
|
|
|
|
var re = set.map(function (pattern) {
|
|
return pattern.map(function (p) {
|
|
return (p === GLOBSTAR) ? twoStar
|
|
: (typeof p === 'string') ? regExpEscape(p)
|
|
: p._src
|
|
}).join('\\\/')
|
|
}).join('|')
|
|
|
|
// must match entire pattern
|
|
// ending in a * or ** will make it less strict.
|
|
re = '^(?:' + re + ')$'
|
|
|
|
// can match anything, as long as it's not this.
|
|
if (this.negate) re = '^(?!' + re + ').*$'
|
|
|
|
try {
|
|
this.regexp = new RegExp(re, flags)
|
|
} catch (ex) {
|
|
this.regexp = false
|
|
}
|
|
return this.regexp
|
|
}
|
|
|
|
minimatch.match = function (list, pattern, options) {
|
|
options = options || {}
|
|
var mm = new Minimatch(pattern, options)
|
|
list = list.filter(function (f) {
|
|
return mm.match(f)
|
|
})
|
|
if (mm.options.nonull && !list.length) {
|
|
list.push(pattern)
|
|
}
|
|
return list
|
|
}
|
|
|
|
Minimatch.prototype.match = match
|
|
function match (f, partial) {
|
|
this.debug('match', f, this.pattern)
|
|
// short-circuit in the case of busted things.
|
|
// comments, etc.
|
|
if (this.comment) return false
|
|
if (this.empty) return f === ''
|
|
|
|
if (f === '/' && partial) return true
|
|
|
|
var options = this.options
|
|
|
|
// windows: need to use /, not \
|
|
if (path.sep !== '/') {
|
|
f = f.split(path.sep).join('/')
|
|
}
|
|
|
|
// treat the test path as a set of pathparts.
|
|
f = f.split(slashSplit)
|
|
this.debug(this.pattern, 'split', f)
|
|
|
|
// just ONE of the pattern sets in this.set needs to match
|
|
// in order for it to be valid. If negating, then just one
|
|
// match means that we have failed.
|
|
// Either way, return on the first hit.
|
|
|
|
var set = this.set
|
|
this.debug(this.pattern, 'set', set)
|
|
|
|
// Find the basename of the path by looking for the last non-empty segment
|
|
var filename
|
|
var i
|
|
for (i = f.length - 1; i >= 0; i--) {
|
|
filename = f[i]
|
|
if (filename) break
|
|
}
|
|
|
|
for (i = 0; i < set.length; i++) {
|
|
var pattern = set[i]
|
|
var file = f
|
|
if (options.matchBase && pattern.length === 1) {
|
|
file = [filename]
|
|
}
|
|
var hit = this.matchOne(file, pattern, partial)
|
|
if (hit) {
|
|
if (options.flipNegate) return true
|
|
return !this.negate
|
|
}
|
|
}
|
|
|
|
// didn't get any hits. this is success if it's a negative
|
|
// pattern, failure otherwise.
|
|
if (options.flipNegate) return false
|
|
return this.negate
|
|
}
|
|
|
|
// set partial to true to test if, for example,
|
|
// "/a/b" matches the start of "/*/b/*/d"
|
|
// Partial means, if you run out of file before you run
|
|
// out of pattern, then that's fine, as long as all
|
|
// the parts match.
|
|
Minimatch.prototype.matchOne = function (file, pattern, partial) {
|
|
var options = this.options
|
|
|
|
this.debug('matchOne',
|
|
{ 'this': this, file: file, pattern: pattern })
|
|
|
|
this.debug('matchOne', file.length, pattern.length)
|
|
|
|
for (var fi = 0,
|
|
pi = 0,
|
|
fl = file.length,
|
|
pl = pattern.length
|
|
; (fi < fl) && (pi < pl)
|
|
; fi++, pi++) {
|
|
this.debug('matchOne loop')
|
|
var p = pattern[pi]
|
|
var f = file[fi]
|
|
|
|
this.debug(pattern, p, f)
|
|
|
|
// should be impossible.
|
|
// some invalid regexp stuff in the set.
|
|
if (p === false) return false
|
|
|
|
if (p === GLOBSTAR) {
|
|
this.debug('GLOBSTAR', [pattern, p, f])
|
|
|
|
// "**"
|
|
// a/**/b/**/c would match the following:
|
|
// a/b/x/y/z/c
|
|
// a/x/y/z/b/c
|
|
// a/b/x/b/x/c
|
|
// a/b/c
|
|
// To do this, take the rest of the pattern after
|
|
// the **, and see if it would match the file remainder.
|
|
// If so, return success.
|
|
// If not, the ** "swallows" a segment, and try again.
|
|
// This is recursively awful.
|
|
//
|
|
// a/**/b/**/c matching a/b/x/y/z/c
|
|
// - a matches a
|
|
// - doublestar
|
|
// - matchOne(b/x/y/z/c, b/**/c)
|
|
// - b matches b
|
|
// - doublestar
|
|
// - matchOne(x/y/z/c, c) -> no
|
|
// - matchOne(y/z/c, c) -> no
|
|
// - matchOne(z/c, c) -> no
|
|
// - matchOne(c, c) yes, hit
|
|
var fr = fi
|
|
var pr = pi + 1
|
|
if (pr === pl) {
|
|
this.debug('** at the end')
|
|
// a ** at the end will just swallow the rest.
|
|
// We have found a match.
|
|
// however, it will not swallow /.x, unless
|
|
// options.dot is set.
|
|
// . and .. are *never* matched by **, for explosively
|
|
// exponential reasons.
|
|
for (; fi < fl; fi++) {
|
|
if (file[fi] === '.' || file[fi] === '..' ||
|
|
(!options.dot && file[fi].charAt(0) === '.')) return false
|
|
}
|
|
return true
|
|
}
|
|
|
|
// ok, let's see if we can swallow whatever we can.
|
|
while (fr < fl) {
|
|
var swallowee = file[fr]
|
|
|
|
this.debug('\nglobstar while', file, fr, pattern, pr, swallowee)
|
|
|
|
// XXX remove this slice. Just pass the start index.
|
|
if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {
|
|
this.debug('globstar found match!', fr, fl, swallowee)
|
|
// found a match.
|
|
return true
|
|
} else {
|
|
// can't swallow "." or ".." ever.
|
|
// can only swallow ".foo" when explicitly asked.
|
|
if (swallowee === '.' || swallowee === '..' ||
|
|
(!options.dot && swallowee.charAt(0) === '.')) {
|
|
this.debug('dot detected!', file, fr, pattern, pr)
|
|
break
|
|
}
|
|
|
|
// ** swallows a segment, and continue.
|
|
this.debug('globstar swallow a segment, and continue')
|
|
fr++
|
|
}
|
|
}
|
|
|
|
// no match was found.
|
|
// However, in partial mode, we can't say this is necessarily over.
|
|
// If there's more *pattern* left, then
|
|
if (partial) {
|
|
// ran out of file
|
|
this.debug('\n>>> no match, partial?', file, fr, pattern, pr)
|
|
if (fr === fl) return true
|
|
}
|
|
return false
|
|
}
|
|
|
|
// something other than **
|
|
// non-magic patterns just have to match exactly
|
|
// patterns with magic have been turned into regexps.
|
|
var hit
|
|
if (typeof p === 'string') {
|
|
if (options.nocase) {
|
|
hit = f.toLowerCase() === p.toLowerCase()
|
|
} else {
|
|
hit = f === p
|
|
}
|
|
this.debug('string match', p, f, hit)
|
|
} else {
|
|
hit = f.match(p)
|
|
this.debug('pattern match', p, f, hit)
|
|
}
|
|
|
|
if (!hit) return false
|
|
}
|
|
|
|
// Note: ending in / means that we'll get a final ""
|
|
// at the end of the pattern. This can only match a
|
|
// corresponding "" at the end of the file.
|
|
// If the file ends in /, then it can only match a
|
|
// a pattern that ends in /, unless the pattern just
|
|
// doesn't have any more for it. But, a/b/ should *not*
|
|
// match "a/b/*", even though "" matches against the
|
|
// [^/]*? pattern, except in partial mode, where it might
|
|
// simply not be reached yet.
|
|
// However, a/b/ should still satisfy a/*
|
|
|
|
// now either we fell off the end of the pattern, or we're done.
|
|
if (fi === fl && pi === pl) {
|
|
// ran out of pattern and filename at the same time.
|
|
// an exact hit!
|
|
return true
|
|
} else if (fi === fl) {
|
|
// ran out of file, but still had pattern left.
|
|
// this is ok if we're doing the match as part of
|
|
// a glob fs traversal.
|
|
return partial
|
|
} else if (pi === pl) {
|
|
// ran out of pattern, still have file left.
|
|
// this is only acceptable if we're on the very last
|
|
// empty segment of a file with a trailing slash.
|
|
// a/* should match a/b/
|
|
var emptyFileEnd = (fi === fl - 1) && (file[fi] === '')
|
|
return emptyFileEnd
|
|
}
|
|
|
|
// should be unreachable.
|
|
throw new Error('wtf?')
|
|
}
|
|
|
|
// replace stuff like \* with *
|
|
function globUnescape (s) {
|
|
return s.replace(/\\(.)/g, '$1')
|
|
}
|
|
|
|
function regExpEscape (s) {
|
|
return s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, '\\$&')
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 7197:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
var wrappy = __webpack_require__(4586)
|
|
module.exports = wrappy(once)
|
|
module.exports.strict = wrappy(onceStrict)
|
|
|
|
once.proto = once(function () {
|
|
Object.defineProperty(Function.prototype, 'once', {
|
|
value: function () {
|
|
return once(this)
|
|
},
|
|
configurable: true
|
|
})
|
|
|
|
Object.defineProperty(Function.prototype, 'onceStrict', {
|
|
value: function () {
|
|
return onceStrict(this)
|
|
},
|
|
configurable: true
|
|
})
|
|
})
|
|
|
|
function once (fn) {
|
|
var f = function () {
|
|
if (f.called) return f.value
|
|
f.called = true
|
|
return f.value = fn.apply(this, arguments)
|
|
}
|
|
f.called = false
|
|
return f
|
|
}
|
|
|
|
function onceStrict (fn) {
|
|
var f = function () {
|
|
if (f.called)
|
|
throw new Error(f.onceError)
|
|
f.called = true
|
|
return f.value = fn.apply(this, arguments)
|
|
}
|
|
var name = fn.name || 'Function wrapped with `once`'
|
|
f.onceError = name + " shouldn't be called more than once"
|
|
f.called = false
|
|
return f
|
|
}
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 1323:
|
|
/***/ ((module) => {
|
|
|
|
"use strict";
|
|
|
|
|
|
function posix(path) {
|
|
return path.charAt(0) === '/';
|
|
}
|
|
|
|
function win32(path) {
|
|
// https://github.com/nodejs/node/blob/b3fcc245fb25539909ef1d5eaa01dbf92e168633/lib/path.js#L56
|
|
var splitDeviceRe = /^([a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/]+[^\\\/]+)?([\\\/])?([\s\S]*?)$/;
|
|
var result = splitDeviceRe.exec(path);
|
|
var device = result[1] || '';
|
|
var isUnc = Boolean(device && device.charAt(1) !== ':');
|
|
|
|
// UNC paths are always absolute
|
|
return Boolean(result[2] || isUnc);
|
|
}
|
|
|
|
module.exports = process.platform === 'win32' ? win32 : posix;
|
|
module.exports.posix = posix;
|
|
module.exports.win32 = win32;
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 2780:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
const assert = __webpack_require__(9491)
|
|
const path = __webpack_require__(1017)
|
|
const fs = __webpack_require__(7147)
|
|
let glob = undefined
|
|
try {
|
|
glob = __webpack_require__(3700)
|
|
} catch (_err) {
|
|
// treat glob as optional.
|
|
}
|
|
|
|
const defaultGlobOpts = {
|
|
nosort: true,
|
|
silent: true
|
|
}
|
|
|
|
// for EMFILE handling
|
|
let timeout = 0
|
|
|
|
const isWindows = (process.platform === "win32")
|
|
|
|
const defaults = options => {
|
|
const methods = [
|
|
'unlink',
|
|
'chmod',
|
|
'stat',
|
|
'lstat',
|
|
'rmdir',
|
|
'readdir'
|
|
]
|
|
methods.forEach(m => {
|
|
options[m] = options[m] || fs[m]
|
|
m = m + 'Sync'
|
|
options[m] = options[m] || fs[m]
|
|
})
|
|
|
|
options.maxBusyTries = options.maxBusyTries || 3
|
|
options.emfileWait = options.emfileWait || 1000
|
|
if (options.glob === false) {
|
|
options.disableGlob = true
|
|
}
|
|
if (options.disableGlob !== true && glob === undefined) {
|
|
throw Error('glob dependency not found, set `options.disableGlob = true` if intentional')
|
|
}
|
|
options.disableGlob = options.disableGlob || false
|
|
options.glob = options.glob || defaultGlobOpts
|
|
}
|
|
|
|
const rimraf = (p, options, cb) => {
|
|
if (typeof options === 'function') {
|
|
cb = options
|
|
options = {}
|
|
}
|
|
|
|
assert(p, 'rimraf: missing path')
|
|
assert.equal(typeof p, 'string', 'rimraf: path should be a string')
|
|
assert.equal(typeof cb, 'function', 'rimraf: callback function required')
|
|
assert(options, 'rimraf: invalid options argument provided')
|
|
assert.equal(typeof options, 'object', 'rimraf: options should be object')
|
|
|
|
defaults(options)
|
|
|
|
let busyTries = 0
|
|
let errState = null
|
|
let n = 0
|
|
|
|
const next = (er) => {
|
|
errState = errState || er
|
|
if (--n === 0)
|
|
cb(errState)
|
|
}
|
|
|
|
const afterGlob = (er, results) => {
|
|
if (er)
|
|
return cb(er)
|
|
|
|
n = results.length
|
|
if (n === 0)
|
|
return cb()
|
|
|
|
results.forEach(p => {
|
|
const CB = (er) => {
|
|
if (er) {
|
|
if ((er.code === "EBUSY" || er.code === "ENOTEMPTY" || er.code === "EPERM") &&
|
|
busyTries < options.maxBusyTries) {
|
|
busyTries ++
|
|
// try again, with the same exact callback as this one.
|
|
return setTimeout(() => rimraf_(p, options, CB), busyTries * 100)
|
|
}
|
|
|
|
// this one won't happen if graceful-fs is used.
|
|
if (er.code === "EMFILE" && timeout < options.emfileWait) {
|
|
return setTimeout(() => rimraf_(p, options, CB), timeout ++)
|
|
}
|
|
|
|
// already gone
|
|
if (er.code === "ENOENT") er = null
|
|
}
|
|
|
|
timeout = 0
|
|
next(er)
|
|
}
|
|
rimraf_(p, options, CB)
|
|
})
|
|
}
|
|
|
|
if (options.disableGlob || !glob.hasMagic(p))
|
|
return afterGlob(null, [p])
|
|
|
|
options.lstat(p, (er, stat) => {
|
|
if (!er)
|
|
return afterGlob(null, [p])
|
|
|
|
glob(p, options.glob, afterGlob)
|
|
})
|
|
|
|
}
|
|
|
|
// Two possible strategies.
|
|
// 1. Assume it's a file. unlink it, then do the dir stuff on EPERM or EISDIR
|
|
// 2. Assume it's a directory. readdir, then do the file stuff on ENOTDIR
|
|
//
|
|
// Both result in an extra syscall when you guess wrong. However, there
|
|
// are likely far more normal files in the world than directories. This
|
|
// is based on the assumption that a the average number of files per
|
|
// directory is >= 1.
|
|
//
|
|
// If anyone ever complains about this, then I guess the strategy could
|
|
// be made configurable somehow. But until then, YAGNI.
|
|
const rimraf_ = (p, options, cb) => {
|
|
assert(p)
|
|
assert(options)
|
|
assert(typeof cb === 'function')
|
|
|
|
// sunos lets the root user unlink directories, which is... weird.
|
|
// so we have to lstat here and make sure it's not a dir.
|
|
options.lstat(p, (er, st) => {
|
|
if (er && er.code === "ENOENT")
|
|
return cb(null)
|
|
|
|
// Windows can EPERM on stat. Life is suffering.
|
|
if (er && er.code === "EPERM" && isWindows)
|
|
fixWinEPERM(p, options, er, cb)
|
|
|
|
if (st && st.isDirectory())
|
|
return rmdir(p, options, er, cb)
|
|
|
|
options.unlink(p, er => {
|
|
if (er) {
|
|
if (er.code === "ENOENT")
|
|
return cb(null)
|
|
if (er.code === "EPERM")
|
|
return (isWindows)
|
|
? fixWinEPERM(p, options, er, cb)
|
|
: rmdir(p, options, er, cb)
|
|
if (er.code === "EISDIR")
|
|
return rmdir(p, options, er, cb)
|
|
}
|
|
return cb(er)
|
|
})
|
|
})
|
|
}
|
|
|
|
const fixWinEPERM = (p, options, er, cb) => {
|
|
assert(p)
|
|
assert(options)
|
|
assert(typeof cb === 'function')
|
|
|
|
options.chmod(p, 0o666, er2 => {
|
|
if (er2)
|
|
cb(er2.code === "ENOENT" ? null : er)
|
|
else
|
|
options.stat(p, (er3, stats) => {
|
|
if (er3)
|
|
cb(er3.code === "ENOENT" ? null : er)
|
|
else if (stats.isDirectory())
|
|
rmdir(p, options, er, cb)
|
|
else
|
|
options.unlink(p, cb)
|
|
})
|
|
})
|
|
}
|
|
|
|
const fixWinEPERMSync = (p, options, er) => {
|
|
assert(p)
|
|
assert(options)
|
|
|
|
try {
|
|
options.chmodSync(p, 0o666)
|
|
} catch (er2) {
|
|
if (er2.code === "ENOENT")
|
|
return
|
|
else
|
|
throw er
|
|
}
|
|
|
|
let stats
|
|
try {
|
|
stats = options.statSync(p)
|
|
} catch (er3) {
|
|
if (er3.code === "ENOENT")
|
|
return
|
|
else
|
|
throw er
|
|
}
|
|
|
|
if (stats.isDirectory())
|
|
rmdirSync(p, options, er)
|
|
else
|
|
options.unlinkSync(p)
|
|
}
|
|
|
|
const rmdir = (p, options, originalEr, cb) => {
|
|
assert(p)
|
|
assert(options)
|
|
assert(typeof cb === 'function')
|
|
|
|
// try to rmdir first, and only readdir on ENOTEMPTY or EEXIST (SunOS)
|
|
// if we guessed wrong, and it's not a directory, then
|
|
// raise the original error.
|
|
options.rmdir(p, er => {
|
|
if (er && (er.code === "ENOTEMPTY" || er.code === "EEXIST" || er.code === "EPERM"))
|
|
rmkids(p, options, cb)
|
|
else if (er && er.code === "ENOTDIR")
|
|
cb(originalEr)
|
|
else
|
|
cb(er)
|
|
})
|
|
}
|
|
|
|
const rmkids = (p, options, cb) => {
|
|
assert(p)
|
|
assert(options)
|
|
assert(typeof cb === 'function')
|
|
|
|
options.readdir(p, (er, files) => {
|
|
if (er)
|
|
return cb(er)
|
|
let n = files.length
|
|
if (n === 0)
|
|
return options.rmdir(p, cb)
|
|
let errState
|
|
files.forEach(f => {
|
|
rimraf(path.join(p, f), options, er => {
|
|
if (errState)
|
|
return
|
|
if (er)
|
|
return cb(errState = er)
|
|
if (--n === 0)
|
|
options.rmdir(p, cb)
|
|
})
|
|
})
|
|
})
|
|
}
|
|
|
|
// this looks simpler, and is strictly *faster*, but will
|
|
// tie up the JavaScript thread and fail on excessively
|
|
// deep directory trees.
|
|
const rimrafSync = (p, options) => {
|
|
options = options || {}
|
|
defaults(options)
|
|
|
|
assert(p, 'rimraf: missing path')
|
|
assert.equal(typeof p, 'string', 'rimraf: path should be a string')
|
|
assert(options, 'rimraf: missing options')
|
|
assert.equal(typeof options, 'object', 'rimraf: options should be object')
|
|
|
|
let results
|
|
|
|
if (options.disableGlob || !glob.hasMagic(p)) {
|
|
results = [p]
|
|
} else {
|
|
try {
|
|
options.lstatSync(p)
|
|
results = [p]
|
|
} catch (er) {
|
|
results = glob.sync(p, options.glob)
|
|
}
|
|
}
|
|
|
|
if (!results.length)
|
|
return
|
|
|
|
for (let i = 0; i < results.length; i++) {
|
|
const p = results[i]
|
|
|
|
let st
|
|
try {
|
|
st = options.lstatSync(p)
|
|
} catch (er) {
|
|
if (er.code === "ENOENT")
|
|
return
|
|
|
|
// Windows can EPERM on stat. Life is suffering.
|
|
if (er.code === "EPERM" && isWindows)
|
|
fixWinEPERMSync(p, options, er)
|
|
}
|
|
|
|
try {
|
|
// sunos lets the root user unlink directories, which is... weird.
|
|
if (st && st.isDirectory())
|
|
rmdirSync(p, options, null)
|
|
else
|
|
options.unlinkSync(p)
|
|
} catch (er) {
|
|
if (er.code === "ENOENT")
|
|
return
|
|
if (er.code === "EPERM")
|
|
return isWindows ? fixWinEPERMSync(p, options, er) : rmdirSync(p, options, er)
|
|
if (er.code !== "EISDIR")
|
|
throw er
|
|
|
|
rmdirSync(p, options, er)
|
|
}
|
|
}
|
|
}
|
|
|
|
const rmdirSync = (p, options, originalEr) => {
|
|
assert(p)
|
|
assert(options)
|
|
|
|
try {
|
|
options.rmdirSync(p)
|
|
} catch (er) {
|
|
if (er.code === "ENOENT")
|
|
return
|
|
if (er.code === "ENOTDIR")
|
|
throw originalEr
|
|
if (er.code === "ENOTEMPTY" || er.code === "EEXIST" || er.code === "EPERM")
|
|
rmkidsSync(p, options)
|
|
}
|
|
}
|
|
|
|
const rmkidsSync = (p, options) => {
|
|
assert(p)
|
|
assert(options)
|
|
options.readdirSync(p).forEach(f => rimrafSync(path.join(p, f), options))
|
|
|
|
// We only end up here once we got ENOTEMPTY at least once, and
|
|
// at this point, we are guaranteed to have removed all the kids.
|
|
// So, we know that it won't be ENOENT or ENOTDIR or anything else.
|
|
// try really hard to delete stuff on windows, because it has a
|
|
// PROFOUNDLY annoying habit of not closing handles promptly when
|
|
// files are deleted, resulting in spurious ENOTEMPTY errors.
|
|
const retries = isWindows ? 100 : 1
|
|
let i = 0
|
|
do {
|
|
let threw = true
|
|
try {
|
|
const ret = options.rmdirSync(p, options)
|
|
threw = false
|
|
return ret
|
|
} finally {
|
|
if (++i < retries && threw)
|
|
continue
|
|
}
|
|
} while (true)
|
|
}
|
|
|
|
module.exports = rimraf
|
|
rimraf.sync = rimrafSync
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 6382:
|
|
/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
|
|
|
|
/*!
|
|
* Tmp
|
|
*
|
|
* Copyright (c) 2011-2017 KARASZI Istvan <github@spam.raszi.hu>
|
|
*
|
|
* MIT Licensed
|
|
*/
|
|
|
|
/*
|
|
* Module dependencies.
|
|
*/
|
|
const fs = __webpack_require__(7147);
|
|
const os = __webpack_require__(2037);
|
|
const path = __webpack_require__(1017);
|
|
const crypto = __webpack_require__(6113);
|
|
const _c = { fs: fs.constants, os: os.constants };
|
|
const rimraf = __webpack_require__(2780);
|
|
|
|
/*
|
|
* The working inner variables.
|
|
*/
|
|
const
|
|
// the random characters to choose from
|
|
RANDOM_CHARS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',
|
|
|
|
TEMPLATE_PATTERN = /XXXXXX/,
|
|
|
|
DEFAULT_TRIES = 3,
|
|
|
|
CREATE_FLAGS = (_c.O_CREAT || _c.fs.O_CREAT) | (_c.O_EXCL || _c.fs.O_EXCL) | (_c.O_RDWR || _c.fs.O_RDWR),
|
|
|
|
// constants are off on the windows platform and will not match the actual errno codes
|
|
IS_WIN32 = os.platform() === 'win32',
|
|
EBADF = _c.EBADF || _c.os.errno.EBADF,
|
|
ENOENT = _c.ENOENT || _c.os.errno.ENOENT,
|
|
|
|
DIR_MODE = 0o700 /* 448 */,
|
|
FILE_MODE = 0o600 /* 384 */,
|
|
|
|
EXIT = 'exit',
|
|
|
|
// this will hold the objects need to be removed on exit
|
|
_removeObjects = [],
|
|
|
|
// API change in fs.rmdirSync leads to error when passing in a second parameter, e.g. the callback
|
|
FN_RMDIR_SYNC = fs.rmdirSync.bind(fs),
|
|
FN_RIMRAF_SYNC = rimraf.sync;
|
|
|
|
let
|
|
_gracefulCleanup = false;
|
|
|
|
/**
|
|
* Gets a temporary file name.
|
|
*
|
|
* @param {(Options|tmpNameCallback)} options options or callback
|
|
* @param {?tmpNameCallback} callback the callback function
|
|
*/
|
|
function tmpName(options, callback) {
|
|
const
|
|
args = _parseArguments(options, callback),
|
|
opts = args[0],
|
|
cb = args[1];
|
|
|
|
try {
|
|
_assertAndSanitizeOptions(opts);
|
|
} catch (err) {
|
|
return cb(err);
|
|
}
|
|
|
|
let tries = opts.tries;
|
|
(function _getUniqueName() {
|
|
try {
|
|
const name = _generateTmpName(opts);
|
|
|
|
// check whether the path exists then retry if needed
|
|
fs.stat(name, function (err) {
|
|
/* istanbul ignore else */
|
|
if (!err) {
|
|
/* istanbul ignore else */
|
|
if (tries-- > 0) return _getUniqueName();
|
|
|
|
return cb(new Error('Could not get a unique tmp filename, max tries reached ' + name));
|
|
}
|
|
|
|
cb(null, name);
|
|
});
|
|
} catch (err) {
|
|
cb(err);
|
|
}
|
|
}());
|
|
}
|
|
|
|
/**
|
|
* Synchronous version of tmpName.
|
|
*
|
|
* @param {Object} options
|
|
* @returns {string} the generated random name
|
|
* @throws {Error} if the options are invalid or could not generate a filename
|
|
*/
|
|
function tmpNameSync(options) {
|
|
const
|
|
args = _parseArguments(options),
|
|
opts = args[0];
|
|
|
|
_assertAndSanitizeOptions(opts);
|
|
|
|
let tries = opts.tries;
|
|
do {
|
|
const name = _generateTmpName(opts);
|
|
try {
|
|
fs.statSync(name);
|
|
} catch (e) {
|
|
return name;
|
|
}
|
|
} while (tries-- > 0);
|
|
|
|
throw new Error('Could not get a unique tmp filename, max tries reached');
|
|
}
|
|
|
|
/**
|
|
* Creates and opens a temporary file.
|
|
*
|
|
* @param {(Options|null|undefined|fileCallback)} options the config options or the callback function or null or undefined
|
|
* @param {?fileCallback} callback
|
|
*/
|
|
function file(options, callback) {
|
|
const
|
|
args = _parseArguments(options, callback),
|
|
opts = args[0],
|
|
cb = args[1];
|
|
|
|
// gets a temporary filename
|
|
tmpName(opts, function _tmpNameCreated(err, name) {
|
|
/* istanbul ignore else */
|
|
if (err) return cb(err);
|
|
|
|
// create and open the file
|
|
fs.open(name, CREATE_FLAGS, opts.mode || FILE_MODE, function _fileCreated(err, fd) {
|
|
/* istanbu ignore else */
|
|
if (err) return cb(err);
|
|
|
|
if (opts.discardDescriptor) {
|
|
return fs.close(fd, function _discardCallback(possibleErr) {
|
|
// the chance of getting an error on close here is rather low and might occur in the most edgiest cases only
|
|
return cb(possibleErr, name, undefined, _prepareTmpFileRemoveCallback(name, -1, opts, false));
|
|
});
|
|
} else {
|
|
// detachDescriptor passes the descriptor whereas discardDescriptor closes it, either way, we no longer care
|
|
// about the descriptor
|
|
const discardOrDetachDescriptor = opts.discardDescriptor || opts.detachDescriptor;
|
|
cb(null, name, fd, _prepareTmpFileRemoveCallback(name, discardOrDetachDescriptor ? -1 : fd, opts, false));
|
|
}
|
|
});
|
|
});
|
|
}
|
|
|
|
/**
|
|
* Synchronous version of file.
|
|
*
|
|
* @param {Options} options
|
|
* @returns {FileSyncObject} object consists of name, fd and removeCallback
|
|
* @throws {Error} if cannot create a file
|
|
*/
|
|
function fileSync(options) {
|
|
const
|
|
args = _parseArguments(options),
|
|
opts = args[0];
|
|
|
|
const discardOrDetachDescriptor = opts.discardDescriptor || opts.detachDescriptor;
|
|
const name = tmpNameSync(opts);
|
|
var fd = fs.openSync(name, CREATE_FLAGS, opts.mode || FILE_MODE);
|
|
/* istanbul ignore else */
|
|
if (opts.discardDescriptor) {
|
|
fs.closeSync(fd);
|
|
fd = undefined;
|
|
}
|
|
|
|
return {
|
|
name: name,
|
|
fd: fd,
|
|
removeCallback: _prepareTmpFileRemoveCallback(name, discardOrDetachDescriptor ? -1 : fd, opts, true)
|
|
};
|
|
}
|
|
|
|
/**
|
|
* Creates a temporary directory.
|
|
*
|
|
* @param {(Options|dirCallback)} options the options or the callback function
|
|
* @param {?dirCallback} callback
|
|
*/
|
|
function dir(options, callback) {
|
|
const
|
|
args = _parseArguments(options, callback),
|
|
opts = args[0],
|
|
cb = args[1];
|
|
|
|
// gets a temporary filename
|
|
tmpName(opts, function _tmpNameCreated(err, name) {
|
|
/* istanbul ignore else */
|
|
if (err) return cb(err);
|
|
|
|
// create the directory
|
|
fs.mkdir(name, opts.mode || DIR_MODE, function _dirCreated(err) {
|
|
/* istanbul ignore else */
|
|
if (err) return cb(err);
|
|
|
|
cb(null, name, _prepareTmpDirRemoveCallback(name, opts, false));
|
|
});
|
|
});
|
|
}
|
|
|
|
/**
|
|
* Synchronous version of dir.
|
|
*
|
|
* @param {Options} options
|
|
* @returns {DirSyncObject} object consists of name and removeCallback
|
|
* @throws {Error} if it cannot create a directory
|
|
*/
|
|
function dirSync(options) {
|
|
const
|
|
args = _parseArguments(options),
|
|
opts = args[0];
|
|
|
|
const name = tmpNameSync(opts);
|
|
fs.mkdirSync(name, opts.mode || DIR_MODE);
|
|
|
|
return {
|
|
name: name,
|
|
removeCallback: _prepareTmpDirRemoveCallback(name, opts, true)
|
|
};
|
|
}
|
|
|
|
/**
|
|
* Removes files asynchronously.
|
|
*
|
|
* @param {Object} fdPath
|
|
* @param {Function} next
|
|
* @private
|
|
*/
|
|
function _removeFileAsync(fdPath, next) {
|
|
const _handler = function (err) {
|
|
if (err && !_isENOENT(err)) {
|
|
// reraise any unanticipated error
|
|
return next(err);
|
|
}
|
|
next();
|
|
};
|
|
|
|
if (0 <= fdPath[0])
|
|
fs.close(fdPath[0], function () {
|
|
fs.unlink(fdPath[1], _handler);
|
|
});
|
|
else fs.unlink(fdPath[1], _handler);
|
|
}
|
|
|
|
/**
|
|
* Removes files synchronously.
|
|
*
|
|
* @param {Object} fdPath
|
|
* @private
|
|
*/
|
|
function _removeFileSync(fdPath) {
|
|
let rethrownException = null;
|
|
try {
|
|
if (0 <= fdPath[0]) fs.closeSync(fdPath[0]);
|
|
} catch (e) {
|
|
// reraise any unanticipated error
|
|
if (!_isEBADF(e) && !_isENOENT(e)) throw e;
|
|
} finally {
|
|
try {
|
|
fs.unlinkSync(fdPath[1]);
|
|
}
|
|
catch (e) {
|
|
// reraise any unanticipated error
|
|
if (!_isENOENT(e)) rethrownException = e;
|
|
}
|
|
}
|
|
if (rethrownException !== null) {
|
|
throw rethrownException;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Prepares the callback for removal of the temporary file.
|
|
*
|
|
* Returns either a sync callback or a async callback depending on whether
|
|
* fileSync or file was called, which is expressed by the sync parameter.
|
|
*
|
|
* @param {string} name the path of the file
|
|
* @param {number} fd file descriptor
|
|
* @param {Object} opts
|
|
* @param {boolean} sync
|
|
* @returns {fileCallback | fileCallbackSync}
|
|
* @private
|
|
*/
|
|
function _prepareTmpFileRemoveCallback(name, fd, opts, sync) {
|
|
const removeCallbackSync = _prepareRemoveCallback(_removeFileSync, [fd, name], sync);
|
|
const removeCallback = _prepareRemoveCallback(_removeFileAsync, [fd, name], sync, removeCallbackSync);
|
|
|
|
if (!opts.keep) _removeObjects.unshift(removeCallbackSync);
|
|
|
|
return sync ? removeCallbackSync : removeCallback;
|
|
}
|
|
|
|
/**
|
|
* Prepares the callback for removal of the temporary directory.
|
|
*
|
|
* Returns either a sync callback or a async callback depending on whether
|
|
* tmpFileSync or tmpFile was called, which is expressed by the sync parameter.
|
|
*
|
|
* @param {string} name
|
|
* @param {Object} opts
|
|
* @param {boolean} sync
|
|
* @returns {Function} the callback
|
|
* @private
|
|
*/
|
|
function _prepareTmpDirRemoveCallback(name, opts, sync) {
|
|
const removeFunction = opts.unsafeCleanup ? rimraf : fs.rmdir.bind(fs);
|
|
const removeFunctionSync = opts.unsafeCleanup ? FN_RIMRAF_SYNC : FN_RMDIR_SYNC;
|
|
const removeCallbackSync = _prepareRemoveCallback(removeFunctionSync, name, sync);
|
|
const removeCallback = _prepareRemoveCallback(removeFunction, name, sync, removeCallbackSync);
|
|
if (!opts.keep) _removeObjects.unshift(removeCallbackSync);
|
|
|
|
return sync ? removeCallbackSync : removeCallback;
|
|
}
|
|
|
|
/**
|
|
* Creates a guarded function wrapping the removeFunction call.
|
|
*
|
|
* The cleanup callback is save to be called multiple times.
|
|
* Subsequent invocations will be ignored.
|
|
*
|
|
* @param {Function} removeFunction
|
|
* @param {string} fileOrDirName
|
|
* @param {boolean} sync
|
|
* @param {cleanupCallbackSync?} cleanupCallbackSync
|
|
* @returns {cleanupCallback | cleanupCallbackSync}
|
|
* @private
|
|
*/
|
|
function _prepareRemoveCallback(removeFunction, fileOrDirName, sync, cleanupCallbackSync) {
|
|
let called = false;
|
|
|
|
// if sync is true, the next parameter will be ignored
|
|
return function _cleanupCallback(next) {
|
|
|
|
/* istanbul ignore else */
|
|
if (!called) {
|
|
// remove cleanupCallback from cache
|
|
const toRemove = cleanupCallbackSync || _cleanupCallback;
|
|
const index = _removeObjects.indexOf(toRemove);
|
|
/* istanbul ignore else */
|
|
if (index >= 0) _removeObjects.splice(index, 1);
|
|
|
|
called = true;
|
|
if (sync || removeFunction === FN_RMDIR_SYNC || removeFunction === FN_RIMRAF_SYNC) {
|
|
return removeFunction(fileOrDirName);
|
|
} else {
|
|
return removeFunction(fileOrDirName, next || function() {});
|
|
}
|
|
}
|
|
};
|
|
}
|
|
|
|
/**
|
|
* The garbage collector.
|
|
*
|
|
* @private
|
|
*/
|
|
function _garbageCollector() {
|
|
/* istanbul ignore else */
|
|
if (!_gracefulCleanup) return;
|
|
|
|
// the function being called removes itself from _removeObjects,
|
|
// loop until _removeObjects is empty
|
|
while (_removeObjects.length) {
|
|
try {
|
|
_removeObjects[0]();
|
|
} catch (e) {
|
|
// already removed?
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Random name generator based on crypto.
|
|
* Adapted from http://blog.tompawlak.org/how-to-generate-random-values-nodejs-javascript
|
|
*
|
|
* @param {number} howMany
|
|
* @returns {string} the generated random name
|
|
* @private
|
|
*/
|
|
function _randomChars(howMany) {
|
|
let
|
|
value = [],
|
|
rnd = null;
|
|
|
|
// make sure that we do not fail because we ran out of entropy
|
|
try {
|
|
rnd = crypto.randomBytes(howMany);
|
|
} catch (e) {
|
|
rnd = crypto.pseudoRandomBytes(howMany);
|
|
}
|
|
|
|
for (var i = 0; i < howMany; i++) {
|
|
value.push(RANDOM_CHARS[rnd[i] % RANDOM_CHARS.length]);
|
|
}
|
|
|
|
return value.join('');
|
|
}
|
|
|
|
/**
|
|
* Helper which determines whether a string s is blank, that is undefined, or empty or null.
|
|
*
|
|
* @private
|
|
* @param {string} s
|
|
* @returns {Boolean} true whether the string s is blank, false otherwise
|
|
*/
|
|
function _isBlank(s) {
|
|
return s === null || _isUndefined(s) || !s.trim();
|
|
}
|
|
|
|
/**
|
|
* Checks whether the `obj` parameter is defined or not.
|
|
*
|
|
* @param {Object} obj
|
|
* @returns {boolean} true if the object is undefined
|
|
* @private
|
|
*/
|
|
function _isUndefined(obj) {
|
|
return typeof obj === 'undefined';
|
|
}
|
|
|
|
/**
|
|
* Parses the function arguments.
|
|
*
|
|
* This function helps to have optional arguments.
|
|
*
|
|
* @param {(Options|null|undefined|Function)} options
|
|
* @param {?Function} callback
|
|
* @returns {Array} parsed arguments
|
|
* @private
|
|
*/
|
|
function _parseArguments(options, callback) {
|
|
/* istanbul ignore else */
|
|
if (typeof options === 'function') {
|
|
return [{}, options];
|
|
}
|
|
|
|
/* istanbul ignore else */
|
|
if (_isUndefined(options)) {
|
|
return [{}, callback];
|
|
}
|
|
|
|
// copy options so we do not leak the changes we make internally
|
|
const actualOptions = {};
|
|
for (const key of Object.getOwnPropertyNames(options)) {
|
|
actualOptions[key] = options[key];
|
|
}
|
|
|
|
return [actualOptions, callback];
|
|
}
|
|
|
|
/**
|
|
* Generates a new temporary name.
|
|
*
|
|
* @param {Object} opts
|
|
* @returns {string} the new random name according to opts
|
|
* @private
|
|
*/
|
|
function _generateTmpName(opts) {
|
|
|
|
const tmpDir = opts.tmpdir;
|
|
|
|
/* istanbul ignore else */
|
|
if (!_isUndefined(opts.name))
|
|
return path.join(tmpDir, opts.dir, opts.name);
|
|
|
|
/* istanbul ignore else */
|
|
if (!_isUndefined(opts.template))
|
|
return path.join(tmpDir, opts.dir, opts.template).replace(TEMPLATE_PATTERN, _randomChars(6));
|
|
|
|
// prefix and postfix
|
|
const name = [
|
|
opts.prefix ? opts.prefix : 'tmp',
|
|
'-',
|
|
process.pid,
|
|
'-',
|
|
_randomChars(12),
|
|
opts.postfix ? '-' + opts.postfix : ''
|
|
].join('');
|
|
|
|
return path.join(tmpDir, opts.dir, name);
|
|
}
|
|
|
|
/**
|
|
* Asserts whether the specified options are valid, also sanitizes options and provides sane defaults for missing
|
|
* options.
|
|
*
|
|
* @param {Options} options
|
|
* @private
|
|
*/
|
|
function _assertAndSanitizeOptions(options) {
|
|
|
|
options.tmpdir = _getTmpDir(options);
|
|
|
|
const tmpDir = options.tmpdir;
|
|
|
|
/* istanbul ignore else */
|
|
if (!_isUndefined(options.name))
|
|
_assertIsRelative(options.name, 'name', tmpDir);
|
|
/* istanbul ignore else */
|
|
if (!_isUndefined(options.dir))
|
|
_assertIsRelative(options.dir, 'dir', tmpDir);
|
|
/* istanbul ignore else */
|
|
if (!_isUndefined(options.template)) {
|
|
_assertIsRelative(options.template, 'template', tmpDir);
|
|
if (!options.template.match(TEMPLATE_PATTERN))
|
|
throw new Error(`Invalid template, found "${options.template}".`);
|
|
}
|
|
/* istanbul ignore else */
|
|
if (!_isUndefined(options.tries) && isNaN(options.tries) || options.tries < 0)
|
|
throw new Error(`Invalid tries, found "${options.tries}".`);
|
|
|
|
// if a name was specified we will try once
|
|
options.tries = _isUndefined(options.name) ? options.tries || DEFAULT_TRIES : 1;
|
|
options.keep = !!options.keep;
|
|
options.detachDescriptor = !!options.detachDescriptor;
|
|
options.discardDescriptor = !!options.discardDescriptor;
|
|
options.unsafeCleanup = !!options.unsafeCleanup;
|
|
|
|
// sanitize dir, also keep (multiple) blanks if the user, purportedly sane, requests us to
|
|
options.dir = _isUndefined(options.dir) ? '' : path.relative(tmpDir, _resolvePath(options.dir, tmpDir));
|
|
options.template = _isUndefined(options.template) ? undefined : path.relative(tmpDir, _resolvePath(options.template, tmpDir));
|
|
// sanitize further if template is relative to options.dir
|
|
options.template = _isBlank(options.template) ? undefined : path.relative(options.dir, options.template);
|
|
|
|
// for completeness' sake only, also keep (multiple) blanks if the user, purportedly sane, requests us to
|
|
options.name = _isUndefined(options.name) ? undefined : _sanitizeName(options.name);
|
|
options.prefix = _isUndefined(options.prefix) ? '' : options.prefix;
|
|
options.postfix = _isUndefined(options.postfix) ? '' : options.postfix;
|
|
}
|
|
|
|
/**
|
|
* Resolve the specified path name in respect to tmpDir.
|
|
*
|
|
* The specified name might include relative path components, e.g. ../
|
|
* so we need to resolve in order to be sure that is is located inside tmpDir
|
|
*
|
|
* @param name
|
|
* @param tmpDir
|
|
* @returns {string}
|
|
* @private
|
|
*/
|
|
function _resolvePath(name, tmpDir) {
|
|
const sanitizedName = _sanitizeName(name);
|
|
if (sanitizedName.startsWith(tmpDir)) {
|
|
return path.resolve(sanitizedName);
|
|
} else {
|
|
return path.resolve(path.join(tmpDir, sanitizedName));
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Sanitize the specified path name by removing all quote characters.
|
|
*
|
|
* @param name
|
|
* @returns {string}
|
|
* @private
|
|
*/
|
|
function _sanitizeName(name) {
|
|
if (_isBlank(name)) {
|
|
return name;
|
|
}
|
|
return name.replace(/["']/g, '');
|
|
}
|
|
|
|
/**
|
|
* Asserts whether specified name is relative to the specified tmpDir.
|
|
*
|
|
* @param {string} name
|
|
* @param {string} option
|
|
* @param {string} tmpDir
|
|
* @throws {Error}
|
|
* @private
|
|
*/
|
|
function _assertIsRelative(name, option, tmpDir) {
|
|
if (option === 'name') {
|
|
// assert that name is not absolute and does not contain a path
|
|
if (path.isAbsolute(name))
|
|
throw new Error(`${option} option must not contain an absolute path, found "${name}".`);
|
|
// must not fail on valid .<name> or ..<name> or similar such constructs
|
|
let basename = path.basename(name);
|
|
if (basename === '..' || basename === '.' || basename !== name)
|
|
throw new Error(`${option} option must not contain a path, found "${name}".`);
|
|
}
|
|
else { // if (option === 'dir' || option === 'template') {
|
|
// assert that dir or template are relative to tmpDir
|
|
if (path.isAbsolute(name) && !name.startsWith(tmpDir)) {
|
|
throw new Error(`${option} option must be relative to "${tmpDir}", found "${name}".`);
|
|
}
|
|
let resolvedPath = _resolvePath(name, tmpDir);
|
|
if (!resolvedPath.startsWith(tmpDir))
|
|
throw new Error(`${option} option must be relative to "${tmpDir}", found "${resolvedPath}".`);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Helper for testing against EBADF to compensate changes made to Node 7.x under Windows.
|
|
*
|
|
* @private
|
|
*/
|
|
function _isEBADF(error) {
|
|
return _isExpectedError(error, -EBADF, 'EBADF');
|
|
}
|
|
|
|
/**
|
|
* Helper for testing against ENOENT to compensate changes made to Node 7.x under Windows.
|
|
*
|
|
* @private
|
|
*/
|
|
function _isENOENT(error) {
|
|
return _isExpectedError(error, -ENOENT, 'ENOENT');
|
|
}
|
|
|
|
/**
|
|
* Helper to determine whether the expected error code matches the actual code and errno,
|
|
* which will differ between the supported node versions.
|
|
*
|
|
* - Node >= 7.0:
|
|
* error.code {string}
|
|
* error.errno {number} any numerical value will be negated
|
|
*
|
|
* CAVEAT
|
|
*
|
|
* On windows, the errno for EBADF is -4083 but os.constants.errno.EBADF is different and we must assume that ENOENT
|
|
* is no different here.
|
|
*
|
|
* @param {SystemError} error
|
|
* @param {number} errno
|
|
* @param {string} code
|
|
* @private
|
|
*/
|
|
function _isExpectedError(error, errno, code) {
|
|
return IS_WIN32 ? error.code === code : error.code === code && error.errno === errno;
|
|
}
|
|
|
|
/**
|
|
* Sets the graceful cleanup.
|
|
*
|
|
* If graceful cleanup is set, tmp will remove all controlled temporary objects on process exit, otherwise the
|
|
* temporary objects will remain in place, waiting to be cleaned up on system restart or otherwise scheduled temporary
|
|
* object removals.
|
|
*/
|
|
function setGracefulCleanup() {
|
|
_gracefulCleanup = true;
|
|
}
|
|
|
|
/**
|
|
* Returns the currently configured tmp dir from os.tmpdir().
|
|
*
|
|
* @private
|
|
* @param {?Options} options
|
|
* @returns {string} the currently configured tmp dir
|
|
*/
|
|
function _getTmpDir(options) {
|
|
return path.resolve(_sanitizeName(options && options.tmpdir || os.tmpdir()));
|
|
}
|
|
|
|
// Install process exit listener
|
|
process.addListener(EXIT, _garbageCollector);
|
|
|
|
/**
|
|
* Configuration options.
|
|
*
|
|
* @typedef {Object} Options
|
|
* @property {?boolean} keep the temporary object (file or dir) will not be garbage collected
|
|
* @property {?number} tries the number of tries before give up the name generation
|
|
* @property (?int) mode the access mode, defaults are 0o700 for directories and 0o600 for files
|
|
* @property {?string} template the "mkstemp" like filename template
|
|
* @property {?string} name fixed name relative to tmpdir or the specified dir option
|
|
* @property {?string} dir tmp directory relative to the root tmp directory in use
|
|
* @property {?string} prefix prefix for the generated name
|
|
* @property {?string} postfix postfix for the generated name
|
|
* @property {?string} tmpdir the root tmp directory which overrides the os tmpdir
|
|
* @property {?boolean} unsafeCleanup recursively removes the created temporary directory, even when it's not empty
|
|
* @property {?boolean} detachDescriptor detaches the file descriptor, caller is responsible for closing the file, tmp will no longer try closing the file during garbage collection
|
|
* @property {?boolean} discardDescriptor discards the file descriptor (closes file, fd is -1), tmp will no longer try closing the file during garbage collection
|
|
*/
|
|
|
|
/**
|
|
* @typedef {Object} FileSyncObject
|
|
* @property {string} name the name of the file
|
|
* @property {string} fd the file descriptor or -1 if the fd has been discarded
|
|
* @property {fileCallback} removeCallback the callback function to remove the file
|
|
*/
|
|
|
|
/**
|
|
* @typedef {Object} DirSyncObject
|
|
* @property {string} name the name of the directory
|
|
* @property {fileCallback} removeCallback the callback function to remove the directory
|
|
*/
|
|
|
|
/**
|
|
* @callback tmpNameCallback
|
|
* @param {?Error} err the error object if anything goes wrong
|
|
* @param {string} name the temporary file name
|
|
*/
|
|
|
|
/**
|
|
* @callback fileCallback
|
|
* @param {?Error} err the error object if anything goes wrong
|
|
* @param {string} name the temporary file name
|
|
* @param {number} fd the file descriptor or -1 if the fd had been discarded
|
|
* @param {cleanupCallback} fn the cleanup callback function
|
|
*/
|
|
|
|
/**
|
|
* @callback fileCallbackSync
|
|
* @param {?Error} err the error object if anything goes wrong
|
|
* @param {string} name the temporary file name
|
|
* @param {number} fd the file descriptor or -1 if the fd had been discarded
|
|
* @param {cleanupCallbackSync} fn the cleanup callback function
|
|
*/
|
|
|
|
/**
|
|
* @callback dirCallback
|
|
* @param {?Error} err the error object if anything goes wrong
|
|
* @param {string} name the temporary file name
|
|
* @param {cleanupCallback} fn the cleanup callback function
|
|
*/
|
|
|
|
/**
|
|
* @callback dirCallbackSync
|
|
* @param {?Error} err the error object if anything goes wrong
|
|
* @param {string} name the temporary file name
|
|
* @param {cleanupCallbackSync} fn the cleanup callback function
|
|
*/
|
|
|
|
/**
|
|
* Removes the temporary created file or directory.
|
|
*
|
|
* @callback cleanupCallback
|
|
* @param {simpleCallback} [next] function to call whenever the tmp object needs to be removed
|
|
*/
|
|
|
|
/**
|
|
* Removes the temporary created file or directory.
|
|
*
|
|
* @callback cleanupCallbackSync
|
|
*/
|
|
|
|
/**
|
|
* Callback function for function composition.
|
|
* @see {@link https://github.com/raszi/node-tmp/issues/57|raszi/node-tmp#57}
|
|
*
|
|
* @callback simpleCallback
|
|
*/
|
|
|
|
// exporting all the needed methods
|
|
|
|
// evaluate _getTmpDir() lazily, mainly for simplifying testing but it also will
|
|
// allow users to reconfigure the temporary directory
|
|
Object.defineProperty(module.exports, "tmpdir", ({
|
|
enumerable: true,
|
|
configurable: false,
|
|
get: function () {
|
|
return _getTmpDir();
|
|
}
|
|
}));
|
|
|
|
module.exports.dir = dir;
|
|
module.exports.dirSync = dirSync;
|
|
|
|
module.exports.file = file;
|
|
module.exports.fileSync = fileSync;
|
|
|
|
module.exports.tmpName = tmpName;
|
|
module.exports.tmpNameSync = tmpNameSync;
|
|
|
|
module.exports.setGracefulCleanup = setGracefulCleanup;
|
|
|
|
|
|
/***/ }),
|
|
|
|
/***/ 4586:
|
|
/***/ ((module) => {
|
|
|
|
// Returns a wrapper function that returns a wrapped callback
|
|
// The wrapper function should do some stuff, and return a
|
|
// presumably different callback function.
|
|
// This makes sure that own properties are retained, so that
|
|
// decorations and such are not lost along the way.
|
|
module.exports = wrappy
|
|
function wrappy (fn, cb) {
|
|
if (fn && cb) return wrappy(fn)(cb)
|
|
|
|
if (typeof fn !== 'function')
|
|
throw new TypeError('need wrapper function')
|
|
|
|
Object.keys(fn).forEach(function (k) {
|
|
wrapper[k] = fn[k]
|
|
})
|
|
|
|
return wrapper
|
|
|
|
function wrapper() {
|
|
var args = new Array(arguments.length)
|
|
for (var i = 0; i < args.length; i++) {
|
|
args[i] = arguments[i]
|
|
}
|
|
var ret = fn.apply(this, args)
|
|
var cb = args[args.length-1]
|
|
if (typeof ret === 'function' && ret !== cb) {
|
|
Object.keys(cb).forEach(function (k) {
|
|
ret[k] = cb[k]
|
|
})
|
|
}
|
|
return ret
|
|
}
|
|
}
|
|
|
|
|
|
/***/ })
|
|
|
|
};
|
|
; |