Buckets:
| module.exports = minimatch | |
| minimatch.Minimatch = Minimatch | |
| var path = (function () { try { return require('path') } catch (e) {}}()) || { | |
| sep: '/' | |
| } | |
| minimatch.sep = path.sep | |
| var GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {} | |
| var expand = require('brace-expansion') | |
| 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) { | |
| b = b || {} | |
| var t = {} | |
| Object.keys(a).forEach(function (k) { | |
| t[k] = a[k] | |
| }) | |
| Object.keys(b).forEach(function (k) { | |
| t[k] = b[k] | |
| }) | |
| return t | |
| } | |
| minimatch.defaults = function (def) { | |
| if (!def || typeof def !== 'object' || !Object.keys(def).length) { | |
| return minimatch | |
| } | |
| var orig = minimatch | |
| var m = function minimatch (p, pattern, options) { | |
| return orig(p, pattern, ext(def, options)) | |
| } | |
| m.Minimatch = function Minimatch (pattern, options) { | |
| return new orig.Minimatch(pattern, ext(def, options)) | |
| } | |
| m.Minimatch.defaults = function defaults (options) { | |
| return orig.defaults(ext(def, options)).Minimatch | |
| } | |
| m.filter = function filter (pattern, options) { | |
| return orig.filter(pattern, ext(def, options)) | |
| } | |
| m.defaults = function defaults (options) { | |
| return orig.defaults(ext(def, options)) | |
| } | |
| m.makeRe = function makeRe (pattern, options) { | |
| return orig.makeRe(pattern, ext(def, options)) | |
| } | |
| m.braceExpand = function braceExpand (pattern, options) { | |
| return orig.braceExpand(pattern, ext(def, options)) | |
| } | |
| m.match = function (list, pattern, options) { | |
| return orig.match(list, pattern, ext(def, options)) | |
| } | |
| return m | |
| } | |
| Minimatch.defaults = function (def) { | |
| return minimatch.defaults(def).Minimatch | |
| } | |
| function minimatch (p, pattern, options) { | |
| assertValidPattern(pattern) | |
| if (!options) options = {} | |
| // shortcut: comments match nothing. | |
| if (!options.nocomment && pattern.charAt(0) === '#') { | |
| return false | |
| } | |
| return new Minimatch(pattern, options).match(p) | |
| } | |
| function Minimatch (pattern, options) { | |
| if (!(this instanceof Minimatch)) { | |
| return new Minimatch(pattern, options) | |
| } | |
| assertValidPattern(pattern) | |
| if (!options) options = {} | |
| pattern = pattern.trim() | |
| // windows support: need to use /, not \ | |
| if (!options.allowWindowsEscape && path.sep !== '/') { | |
| pattern = pattern.split(path.sep).join('/') | |
| } | |
| this.options = options | |
| this.maxGlobstarRecursion = options.maxGlobstarRecursion !== undefined | |
| ? options.maxGlobstarRecursion : 200 | |
| this.set = [] | |
| this.pattern = pattern | |
| this.regexp = null | |
| this.negate = false | |
| this.comment = false | |
| this.empty = false | |
| this.partial = !!options.partial | |
| // make the set of regexps etc. | |
| this.make() | |
| } | |
| Minimatch.prototype.debug = function () {} | |
| Minimatch.prototype.make = make | |
| function make () { | |
| 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 = function debug() { console.error.apply(console, arguments) } | |
| 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 | |
| assertValidPattern(pattern) | |
| // Thanks to Yeting Li <https://github.com/yetingli> for | |
| // improving this regexp to avoid a ReDOS vulnerability. | |
| if (options.nobrace || !/\{(?:(?!\{).)*\}/.test(pattern)) { | |
| // shortcut. no need to expand. | |
| return [pattern] | |
| } | |
| return expand(pattern) | |
| } | |
| var MAX_PATTERN_LENGTH = 1024 * 64 | |
| var assertValidPattern = function (pattern) { | |
| if (typeof pattern !== 'string') { | |
| throw new TypeError('invalid pattern') | |
| } | |
| if (pattern.length > MAX_PATTERN_LENGTH) { | |
| throw new TypeError('pattern is too long') | |
| } | |
| } | |
| // 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) { | |
| assertValidPattern(pattern) | |
| var options = this.options | |
| // shortcuts | |
| if (pattern === '**') { | |
| if (!options.noglobstar) | |
| return GLOBSTAR | |
| else | |
| pattern = '*' | |
| } | |
| 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) { | |
| /* istanbul ignore next */ | |
| 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 | |
| } | |
| // coalesce consecutive non-globstar * characters | |
| if (c === '*' && stateChar === '*') 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\]" | |
| // 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) /* istanbul ignore next - should be impossible */ { | |
| // 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) /* istanbul ignore next - should be impossible */ { | |
| 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 = function match (f, partial) { | |
| if (typeof partial === 'undefined') partial = this.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) { | |
| if (pattern.indexOf(GLOBSTAR) !== -1) { | |
| return this._matchGlobstar(file, pattern, partial, 0, 0) | |
| } | |
| return this._matchOne(file, pattern, partial, 0, 0) | |
| } | |
| Minimatch.prototype._matchGlobstar = function (file, pattern, partial, fileIndex, patternIndex) { | |
| var i | |
| // find first globstar from patternIndex | |
| var firstgs = -1 | |
| for (i = patternIndex; i < pattern.length; i++) { | |
| if (pattern[i] === GLOBSTAR) { firstgs = i; break } | |
| } | |
| // find last globstar | |
| var lastgs = -1 | |
| for (i = pattern.length - 1; i >= 0; i--) { | |
| if (pattern[i] === GLOBSTAR) { lastgs = i; break } | |
| } | |
| var head = pattern.slice(patternIndex, firstgs) | |
| var body = partial ? pattern.slice(firstgs + 1) : pattern.slice(firstgs + 1, lastgs) | |
| var tail = partial ? [] : pattern.slice(lastgs + 1) | |
| // check the head | |
| if (head.length) { | |
| var fileHead = file.slice(fileIndex, fileIndex + head.length) | |
| if (!this._matchOne(fileHead, head, partial, 0, 0)) { | |
| return false | |
| } | |
| fileIndex += head.length | |
| } | |
| // check the tail | |
| var fileTailMatch = 0 | |
| if (tail.length) { | |
| if (tail.length + fileIndex > file.length) return false | |
| var tailStart = file.length - tail.length | |
| if (this._matchOne(file, tail, partial, tailStart, 0)) { | |
| fileTailMatch = tail.length | |
| } else { | |
| // affordance for stuff like a/**/* matching a/b/ | |
| if (file[file.length - 1] !== '' || | |
| fileIndex + tail.length === file.length) { | |
| return false | |
| } | |
| tailStart-- | |
| if (!this._matchOne(file, tail, partial, tailStart, 0)) { | |
| return false | |
| } | |
| fileTailMatch = tail.length + 1 | |
| } | |
| } | |
| // if body is empty (single ** between head and tail) | |
| if (!body.length) { | |
| var sawSome = !!fileTailMatch | |
| for (i = fileIndex; i < file.length - fileTailMatch; i++) { | |
| var f = String(file[i]) | |
| sawSome = true | |
| if (f === '.' || f === '..' || | |
| (!this.options.dot && f.charAt(0) === '.')) { | |
| return false | |
| } | |
| } | |
| return partial || sawSome | |
| } | |
| // split body into segments at each GLOBSTAR | |
| var bodySegments = [[[], 0]] | |
| var currentBody = bodySegments[0] | |
| var nonGsParts = 0 | |
| var nonGsPartsSums = [0] | |
| for (var bi = 0; bi < body.length; bi++) { | |
| var b = body[bi] | |
| if (b === GLOBSTAR) { | |
| nonGsPartsSums.push(nonGsParts) | |
| currentBody = [[], 0] | |
| bodySegments.push(currentBody) | |
| } else { | |
| currentBody[0].push(b) | |
| nonGsParts++ | |
| } | |
| } | |
| var idx = bodySegments.length - 1 | |
| var fileLength = file.length - fileTailMatch | |
| for (var si = 0; si < bodySegments.length; si++) { | |
| bodySegments[si][1] = fileLength - | |
| (nonGsPartsSums[idx--] + bodySegments[si][0].length) | |
| } | |
| return !!this._matchGlobStarBodySections( | |
| file, bodySegments, fileIndex, 0, partial, 0, !!fileTailMatch | |
| ) | |
| } | |
| // return false for "nope, not matching" | |
| // return null for "not matching, cannot keep trying" | |
| Minimatch.prototype._matchGlobStarBodySections = function ( | |
| file, bodySegments, fileIndex, bodyIndex, partial, globStarDepth, sawTail | |
| ) { | |
| var bs = bodySegments[bodyIndex] | |
| if (!bs) { | |
| // just make sure there are no bad dots | |
| for (var i = fileIndex; i < file.length; i++) { | |
| sawTail = true | |
| var f = file[i] | |
| if (f === '.' || f === '..' || | |
| (!this.options.dot && f.charAt(0) === '.')) { | |
| return false | |
| } | |
| } | |
| return sawTail | |
| } | |
| var body = bs[0] | |
| var after = bs[1] | |
| while (fileIndex <= after) { | |
| var m = this._matchOne( | |
| file.slice(0, fileIndex + body.length), | |
| body, | |
| partial, | |
| fileIndex, | |
| 0 | |
| ) | |
| // if limit exceeded, no match. intentional false negative, | |
| // acceptable break in correctness for security. | |
| if (m && globStarDepth < this.maxGlobstarRecursion) { | |
| var sub = this._matchGlobStarBodySections( | |
| file, bodySegments, | |
| fileIndex + body.length, bodyIndex + 1, | |
| partial, globStarDepth + 1, sawTail | |
| ) | |
| if (sub !== false) { | |
| return sub | |
| } | |
| } | |
| var f = file[fileIndex] | |
| if (f === '.' || f === '..' || | |
| (!this.options.dot && f.charAt(0) === '.')) { | |
| return false | |
| } | |
| fileIndex++ | |
| } | |
| return partial || null | |
| } | |
| Minimatch.prototype._matchOne = function (file, pattern, partial, fileIndex, patternIndex) { | |
| var fi, pi, fl, pl | |
| for ( | |
| fi = fileIndex, pi = patternIndex, 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. | |
| /* istanbul ignore if */ | |
| if (p === false || p === GLOBSTAR) 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') { | |
| 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 | |
| } | |
| // 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 /* istanbul ignore 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/ | |
| return (fi === fl - 1) && (file[fi] === '') | |
| } | |
| // should be unreachable. | |
| /* istanbul ignore next */ | |
| throw new Error('wtf?') | |
| } | |
| // replace stuff like \* with * | |
| function globUnescape (s) { | |
| return s.replace(/\\(.)/g, '$1') | |
| } | |
| function regExpEscape (s) { | |
| return s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, '\\$&') | |
| } | |
Xet Storage Details
- Size:
- 27.5 kB
- Xet hash:
- 0342c9b8058d6f9c9174093238eceeaf1c75b85c2424501f7fbc196e9e03ebb2
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.