You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
110 lines
3.3 KiB
110 lines
3.3 KiB
'use strict';
|
|
|
|
Object.defineProperty(exports, '__esModule', {
|
|
value: true
|
|
});
|
|
exports.default = globsToMatcher;
|
|
|
|
function _micromatch() {
|
|
const data = _interopRequireDefault(require('micromatch'));
|
|
|
|
_micromatch = function () {
|
|
return data;
|
|
};
|
|
|
|
return data;
|
|
}
|
|
|
|
var _replacePathSepForGlob = _interopRequireDefault(
|
|
require('./replacePathSepForGlob')
|
|
);
|
|
|
|
function _interopRequireDefault(obj) {
|
|
return obj && obj.__esModule ? obj : {default: obj};
|
|
}
|
|
|
|
/**
|
|
* Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
const globsToMatchersMap = new Map();
|
|
const micromatchOptions = {
|
|
dot: true
|
|
};
|
|
/**
|
|
* Converts a list of globs into a function that matches a path against the
|
|
* globs.
|
|
*
|
|
* Every time micromatch is called, it will parse the glob strings and turn
|
|
* them into regexp instances. Instead of calling micromatch repeatedly with
|
|
* the same globs, we can use this function which will build the micromatch
|
|
* matchers ahead of time and then have an optimized path for determining
|
|
* whether an individual path matches.
|
|
*
|
|
* This function is intended to match the behavior of `micromatch()`.
|
|
*
|
|
* @example
|
|
* const isMatch = globsToMatcher(['*.js', '!*.test.js']);
|
|
* isMatch('pizza.js'); // true
|
|
* isMatch('pizza.test.js'); // false
|
|
*/
|
|
|
|
function globsToMatcher(globs) {
|
|
if (globs.length === 0) {
|
|
// Since there were no globs given, we can simply have a fast path here and
|
|
// return with a very simple function.
|
|
return () => false;
|
|
}
|
|
|
|
const matchers = globs.map(glob => {
|
|
if (!globsToMatchersMap.has(glob)) {
|
|
// Matchers that are negated have different behavior than matchers that
|
|
// are not negated, so we need to store this information ahead of time.
|
|
const {negated} = _micromatch().default.scan(glob, micromatchOptions);
|
|
|
|
const matcher = {
|
|
isMatch: _micromatch().default.matcher(glob, micromatchOptions),
|
|
negated
|
|
};
|
|
globsToMatchersMap.set(glob, matcher);
|
|
}
|
|
|
|
return globsToMatchersMap.get(glob);
|
|
});
|
|
return path => {
|
|
const replacedPath = (0, _replacePathSepForGlob.default)(path);
|
|
let kept = undefined;
|
|
let negatives = 0;
|
|
|
|
for (let i = 0; i < matchers.length; i++) {
|
|
const {isMatch, negated} = matchers[i];
|
|
|
|
if (negated) {
|
|
negatives++;
|
|
}
|
|
|
|
const matched = isMatch(replacedPath);
|
|
|
|
if (!matched && negated) {
|
|
// The path was not matched, and the matcher is a negated matcher, so we
|
|
// want to omit the path. This means that the negative matcher is
|
|
// filtering the path out.
|
|
kept = false;
|
|
} else if (matched && !negated) {
|
|
// The path was matched, and the matcher is not a negated matcher, so we
|
|
// want to keep the path.
|
|
kept = true;
|
|
}
|
|
} // If all of the globs were negative globs, then we want to include the path
|
|
// as long as it was not explicitly not kept. Otherwise only include
|
|
// the path if it was kept. This allows sets of globs that are all negated
|
|
// to allow some paths to be matched, while sets of globs that are mixed
|
|
// negated and non-negated to cause the negated matchers to only omit paths
|
|
// and not keep them.
|
|
|
|
return negatives === matchers.length ? kept !== false : !!kept;
|
|
};
|
|
}
|