glob.ts 21.2 KB
Newer Older
E
Erich Gamma 已提交
1 2 3 4 5
/*---------------------------------------------------------------------------------------------
 *  Copyright (c) Microsoft Corporation. All rights reserved.
 *  Licensed under the MIT License. See License.txt in the project root for license information.
 *--------------------------------------------------------------------------------------------*/

6 7
import * as arrays from 'vs/base/common/arrays';
import * as strings from 'vs/base/common/strings';
B
Benjamin Pasero 已提交
8
import * as extpath from 'vs/base/common/extpath';
9
import * as paths from 'vs/base/common/path';
D
Dirk Baeumer 已提交
10
import { LRUCache } from 'vs/base/common/map';
J
Johannes Rieken 已提交
11
import { CharCode } from 'vs/base/common/charCode';
12
import { isThenable } from 'vs/base/common/async';
E
Erich Gamma 已提交
13 14

export interface IExpression {
15
	[pattern: string]: boolean | SiblingClause;
E
Erich Gamma 已提交
16 17
}

18 19 20 21 22
export interface IRelativePattern {
	base: string;
	pattern: string;
}

23 24 25 26
export function getEmptyExpression(): IExpression {
	return Object.create(null);
}

E
Erich Gamma 已提交
27 28 29 30
export interface SiblingClause {
	when: string;
}

31 32
const GLOBSTAR = '**';
const GLOB_SPLIT = '/';
B
Benjamin Pasero 已提交
33 34
const PATH_REGEX = '[/\\\\]';		// any slash or backslash
const NO_PATH_REGEX = '[^/\\\\]';	// any non-slash and non-backslash
35
const ALL_FORWARD_SLASHES = /\//g;
E
Erich Gamma 已提交
36 37 38 39 40 41

function starsToRegExp(starCount: number): string {
	switch (starCount) {
		case 0:
			return '';
		case 1:
42
			return `${NO_PATH_REGEX}*?`; // 1 star matches any number of characters except path separator (/ and \) - non greedy (?)
E
Erich Gamma 已提交
43
		default:
44
			// Matches:  (Path Sep OR Path Val followed by Path Sep OR Path Sep followed by Path Val) 0-many times
P
Pascal Borreli 已提交
45
			// Group is non capturing because we don't need to capture at all (?:...)
E
Erich Gamma 已提交
46
			// Overall we use non-greedy matching because it could be that we match too much
47
			return `(?:${PATH_REGEX}|${NO_PATH_REGEX}+${PATH_REGEX}|${PATH_REGEX}${NO_PATH_REGEX}+)*?`;
E
Erich Gamma 已提交
48 49 50 51 52 53 54 55
	}
}

export function splitGlobAware(pattern: string, splitChar: string): string[] {
	if (!pattern) {
		return [];
	}

56
	const segments: string[] = [];
E
Erich Gamma 已提交
57

B
Benjamin Pasero 已提交
58 59
	let inBraces = false;
	let inBrackets = false;
E
Erich Gamma 已提交
60

B
Benjamin Pasero 已提交
61
	let curVal = '';
62
	for (const char of pattern) {
E
Erich Gamma 已提交
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101
		switch (char) {
			case splitChar:
				if (!inBraces && !inBrackets) {
					segments.push(curVal);
					curVal = '';

					continue;
				}
				break;
			case '{':
				inBraces = true;
				break;
			case '}':
				inBraces = false;
				break;
			case '[':
				inBrackets = true;
				break;
			case ']':
				inBrackets = false;
				break;
		}

		curVal += char;
	}

	// Tail
	if (curVal) {
		segments.push(curVal);
	}

	return segments;
}

function parseRegExp(pattern: string): string {
	if (!pattern) {
		return '';
	}

B
Benjamin Pasero 已提交
102
	let regEx = '';
E
Erich Gamma 已提交
103 104

	// Split up into segments for each slash found
105
	const segments = splitGlobAware(pattern, GLOB_SPLIT);
E
Erich Gamma 已提交
106 107

	// Special case where we only have globstars
108
	if (segments.every(s => s === GLOBSTAR)) {
E
Erich Gamma 已提交
109 110 111 112 113
		regEx = '.*';
	}

	// Build regex over segments
	else {
B
Benjamin Pasero 已提交
114
		let previousSegmentWasGlobStar = false;
E
Erich Gamma 已提交
115 116 117
		segments.forEach((segment, index) => {

			// Globstar is special
118
			if (segment === GLOBSTAR) {
E
Erich Gamma 已提交
119 120 121 122 123 124 125 126 127 128 129

				// if we have more than one globstar after another, just ignore it
				if (!previousSegmentWasGlobStar) {
					regEx += starsToRegExp(2);
					previousSegmentWasGlobStar = true;
				}

				return;
			}

			// States
B
Benjamin Pasero 已提交
130 131
			let inBraces = false;
			let braceVal = '';
E
Erich Gamma 已提交
132

B
Benjamin Pasero 已提交
133 134
			let inBrackets = false;
			let bracketVal = '';
E
Erich Gamma 已提交
135

136
			for (const char of segment) {
E
Erich Gamma 已提交
137 138 139 140 141 142 143
				// Support brace expansion
				if (char !== '}' && inBraces) {
					braceVal += char;
					continue;
				}

				// Support brackets
B
Benjamin Pasero 已提交
144
				if (inBrackets && (char !== ']' || !bracketVal) /* ] is literally only allowed as first character in brackets to match it */) {
B
Benjamin Pasero 已提交
145
					let res: string;
B
Benjamin Pasero 已提交
146 147 148 149 150 151 152 153 154 155 156

					// range operator
					if (char === '-') {
						res = char;
					}

					// negation operator (only valid on first index in bracket)
					else if ((char === '^' || char === '!') && !bracketVal) {
						res = '^';
					}

B
Benjamin Pasero 已提交
157 158 159 160 161 162
					// glob split matching is not allowed within character ranges
					// see http://man7.org/linux/man-pages/man7/glob.7.html
					else if (char === GLOB_SPLIT) {
						res = '';
					}

B
Benjamin Pasero 已提交
163 164 165
					// anything else gets escaped
					else {
						res = strings.escapeRegExpCharacters(char);
E
Erich Gamma 已提交
166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181
					}

					bracketVal += res;
					continue;
				}

				switch (char) {
					case '{':
						inBraces = true;
						continue;

					case '[':
						inBrackets = true;
						continue;

					case '}':
182
						const choices = splitGlobAware(braceVal, ',');
E
Erich Gamma 已提交
183 184

						// Converts {foo,bar} => [foo|bar]
185
						const braceRegExp = `(?:${choices.map(c => parseRegExp(c)).join('|')})`;
E
Erich Gamma 已提交
186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215

						regEx += braceRegExp;

						inBraces = false;
						braceVal = '';

						break;

					case ']':
						regEx += ('[' + bracketVal + ']');

						inBrackets = false;
						bracketVal = '';

						break;


					case '?':
						regEx += NO_PATH_REGEX; // 1 ? matches any single character except path separator (/ and \)
						continue;

					case '*':
						regEx += starsToRegExp(1);
						continue;

					default:
						regEx += strings.escapeRegExpCharacters(char);
				}
			}

B
Benjamin Pasero 已提交
216 217 218 219 220 221
			// Tail: Add the slash we had split on if there is more to come and the remaining pattern is not a globstar
			// For example if pattern: some/**/*.js we want the "/" after some to be included in the RegEx to prevent
			// a folder called "something" to match as well.
			// However, if pattern: some/**, we tolerate that we also match on "something" because our globstar behaviour
			// is to match 0-N segments.
			if (index < segments.length - 1 && (segments[index + 1] !== GLOBSTAR || index + 2 < segments.length)) {
E
Erich Gamma 已提交
222 223 224 225 226 227 228 229 230 231 232
				regEx += PATH_REGEX;
			}

			// reset state
			previousSegmentWasGlobStar = false;
		});
	}

	return regEx;
}

B
Benjamin Pasero 已提交
233
// regexes to check for trival glob patterns that just check for String#endsWith
234
const T1 = /^\*\*\/\*\.[\w\.-]+$/; 						   			// **/*.something
235 236 237
const T2 = /^\*\*\/([\w\.-]+)\/?$/; 							   			// **/something
const T3 = /^{\*\*\/[\*\.]?[\w\.-]+\/?(,\*\*\/[\*\.]?[\w\.-]+\/?)*}$/; 	// {**/*.something,**/*.else} or {**/package.json,**/project.json}
const T3_2 = /^{\*\*\/[\*\.]?[\w\.-]+(\/(\*\*)?)?(,\*\*\/[\*\.]?[\w\.-]+(\/(\*\*)?)?)*}$/; 	// Like T3, with optional trailing /**
238
const T4 = /^\*\*((\/[\w\.-]+)+)\/?$/; 						   			// **/something/else
239
const T5 = /^([\w\.-]+(\/[\w\.-]+)*)\/?$/; 						   		// something/else
B
Benjamin Pasero 已提交
240

241
export type ParsedPattern = (path: string, basename?: string) => boolean;
242

243
// The ParsedExpression returns a Promise iff hasSibling returns a Promise.
244
export type ParsedExpression = (path: string, basename?: string, hasSibling?: (name: string) => boolean | Promise<boolean>) => string | null | Promise<string | null> /* the matching pattern */;
B
Benjamin Pasero 已提交
245

246
export interface IGlobOptions {
247 248 249
	/**
	 * Simplify patterns for use as exclusion filters during tree traversal to skip entire subtrees. Cannot be used outside of a tree traversal.
	 */
250 251 252
	trimForExclusions?: boolean;
}

C
Christof Marti 已提交
253
interface ParsedStringPattern {
254
	(path: string, basename: string): string | null | Promise<string | null> /* the matching pattern */;
C
Christof Marti 已提交
255 256
	basenames?: string[];
	patterns?: string[];
257
	allBasenames?: string[];
258
	allPaths?: string[];
C
Christof Marti 已提交
259 260
}
interface ParsedExpressionPattern {
261
	(path: string, basename: string, name?: string, hasSibling?: (name: string) => boolean | Promise<boolean>): string | null | Promise<string | null> /* the matching pattern */;
C
Christof Marti 已提交
262
	requiresSiblings?: boolean;
263
	allBasenames?: string[];
264
	allPaths?: string[];
B
Benjamin Pasero 已提交
265 266
}

D
Dirk Baeumer 已提交
267
const CACHE = new LRUCache<string, ParsedStringPattern>(10000); // bounded to 10000 elements
C
Christof Marti 已提交
268

J
Johannes Rieken 已提交
269
const FALSE = function () {
C
Christof Marti 已提交
270 271 272
	return false;
};

A
Alex Dima 已提交
273
const NULL = function (): string | null {
C
Christof Marti 已提交
274 275
	return null;
};
B
Benjamin Pasero 已提交
276

277 278
function parsePattern(arg1: string | IRelativePattern, options: IGlobOptions): ParsedStringPattern {
	if (!arg1) {
C
Christof Marti 已提交
279
		return NULL;
E
Erich Gamma 已提交
280 281
	}

282 283 284
	// Handle IRelativePattern
	let pattern: string;
	if (typeof arg1 !== 'string') {
285
		pattern = arg1.pattern;
286 287 288 289
	} else {
		pattern = arg1;
	}

E
Erich Gamma 已提交
290 291 292 293
	// Whitespace trimming
	pattern = pattern.trim();

	// Check cache
294 295
	const patternKey = `${pattern}_${!!options.trimForExclusions}`;
	let parsedPattern = CACHE.get(patternKey);
B
Benjamin Pasero 已提交
296
	if (parsedPattern) {
297
		return wrapRelativePattern(parsedPattern, arg1);
E
Erich Gamma 已提交
298 299
	}

B
Benjamin Pasero 已提交
300
	// Check for Trivias
A
Alex Dima 已提交
301
	let match: RegExpExecArray | null;
C
Christof Marti 已提交
302 303
	if (T1.test(pattern)) { // common pattern: **/*.txt just need endsWith check
		const base = pattern.substr(4); // '**/*'.length === 4
304
		parsedPattern = function (path, basename) {
305
			return typeof path === 'string' && strings.endsWith(path, base) ? pattern : null;
C
Christof Marti 已提交
306
		};
307
	} else if (match = T2.exec(trimForExclusions(pattern, options))) { // common pattern: **/some.txt just need basename check
308
		parsedPattern = trivia2(match[1], pattern);
309
	} else if ((options.trimForExclusions ? T3_2 : T3).test(pattern)) { // repetition of common patterns (see above) {**/*.txt,**/*.png}
310 311
		parsedPattern = trivia3(pattern, options);
	} else if (match = T4.exec(trimForExclusions(pattern, options))) { // common pattern: **/something/else just need endsWith check
312 313 314
		parsedPattern = trivia4and5(match[1].substr(1), pattern, true);
	} else if (match = T5.exec(trimForExclusions(pattern, options))) { // common pattern: something/else just need equals check
		parsedPattern = trivia4and5(match[1], pattern, false);
B
Benjamin Pasero 已提交
315
	}
E
Erich Gamma 已提交
316

B
Benjamin Pasero 已提交
317 318
	// Otherwise convert to pattern
	else {
C
Christof Marti 已提交
319
		parsedPattern = toRegExp(pattern);
B
Benjamin Pasero 已提交
320
	}
E
Erich Gamma 已提交
321

B
Benjamin Pasero 已提交
322
	// Cache
323
	CACHE.set(patternKey, parsedPattern);
B
Benjamin Pasero 已提交
324

325
	return wrapRelativePattern(parsedPattern, arg1);
326 327 328 329 330 331 332 333
}

function wrapRelativePattern(parsedPattern: ParsedStringPattern, arg2: string | IRelativePattern): ParsedStringPattern {
	if (typeof arg2 === 'string') {
		return parsedPattern;
	}

	return function (path, basename) {
P
pi1024e 已提交
334 335
		if (!extpath.isEqualOrParent(path, arg2.base)) {
			return null;
336
		}
P
pi1024e 已提交
337
		return parsedPattern(paths.relative(arg2.base, path), basename);
338
	};
E
Erich Gamma 已提交
339 340
}

341 342 343 344
function trimForExclusions(pattern: string, options: IGlobOptions): string {
	return options.trimForExclusions && strings.endsWith(pattern, '/**') ? pattern.substr(0, pattern.length - 2) : pattern; // dropping **, tailing / is dropped later
}

345
// common pattern: **/some.txt just need basename check
346
function trivia2(base: string, originalPattern: string): ParsedStringPattern {
347 348 349
	const slashBase = `/${base}`;
	const backslashBase = `\\${base}`;
	const parsedPattern: ParsedStringPattern = function (path, basename) {
350
		if (typeof path !== 'string') {
351 352 353 354 355 356 357 358 359 360 361 362 363 364
			return null;
		}
		if (basename) {
			return basename === base ? originalPattern : null;
		}
		return path === base || strings.endsWith(path, slashBase) || strings.endsWith(path, backslashBase) ? originalPattern : null;
	};
	const basenames = [base];
	parsedPattern.basenames = basenames;
	parsedPattern.patterns = [originalPattern];
	parsedPattern.allBasenames = basenames;
	return parsedPattern;
}

365
// repetition of common patterns (see above) {**/*.txt,**/*.png}
J
Johannes Rieken 已提交
366
function trivia3(pattern: string, options: IGlobOptions): ParsedStringPattern {
367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
	const parsedPatterns = aggregateBasenameMatches(pattern.slice(1, -1).split(',')
		.map(pattern => parsePattern(pattern, options))
		.filter(pattern => pattern !== NULL), pattern);
	const n = parsedPatterns.length;
	if (!n) {
		return NULL;
	}
	if (n === 1) {
		return <ParsedStringPattern>parsedPatterns[0];
	}
	const parsedPattern: ParsedStringPattern = function (path: string, basename: string) {
		for (let i = 0, n = parsedPatterns.length; i < n; i++) {
			if ((<ParsedStringPattern>parsedPatterns[i])(path, basename)) {
				return pattern;
			}
		}
		return null;
	};
	const withBasenames = arrays.first(parsedPatterns, pattern => !!(<ParsedStringPattern>pattern).allBasenames);
	if (withBasenames) {
		parsedPattern.allBasenames = (<ParsedStringPattern>withBasenames).allBasenames;
	}
389 390 391
	const allPaths = parsedPatterns.reduce((all, current) => current.allPaths ? all.concat(current.allPaths) : all, <string[]>[]);
	if (allPaths.length) {
		parsedPattern.allPaths = allPaths;
392 393 394 395
	}
	return parsedPattern;
}

396 397
// common patterns: **/something/else just need endsWith check, something/else just needs and equals check
function trivia4and5(path: string, pattern: string, matchPathEnds: boolean): ParsedStringPattern {
B
Benjamin Pasero 已提交
398 399
	const nativePath = paths.sep !== paths.posix.sep ? path.replace(ALL_FORWARD_SLASHES, paths.sep) : path;
	const nativePathEnd = paths.sep + nativePath;
400
	const parsedPattern: ParsedStringPattern = matchPathEnds ? function (path, basename) {
401
		return typeof path === 'string' && (path === nativePath || strings.endsWith(path, nativePathEnd)) ? pattern : null;
402
	} : function (path, basename) {
403
		return typeof path === 'string' && path === nativePath ? pattern : null;
404
	};
405
	parsedPattern.allPaths = [(matchPathEnds ? '*/' : './') + path];
406 407 408
	return parsedPattern;
}

C
Christof Marti 已提交
409
function toRegExp(pattern: string): ParsedStringPattern {
410
	try {
C
Christof Marti 已提交
411
		const regExp = new RegExp(`^${parseRegExp(pattern)}$`);
412
		return function (path: string, basename: string) {
C
Christof Marti 已提交
413
			regExp.lastIndex = 0; // reset RegExp to its initial state to reuse it!
414
			return typeof path === 'string' && regExp.test(path) ? pattern : null;
C
Christof Marti 已提交
415
		};
416
	} catch (error) {
C
Christof Marti 已提交
417
		return NULL;
418 419 420
	}
}

E
Erich Gamma 已提交
421 422 423 424 425 426 427 428
/**
 * Simplified glob matching. Supports a subset of glob patterns:
 * - * matches anything inside a path segment
 * - ? matches 1 character inside a path segment
 * - ** matches anything including an empty path segment
 * - simple brace expansion ({js,ts} => js or ts)
 * - character ranges (using [...])
 */
429
export function match(pattern: string | IRelativePattern, path: string): boolean;
430
export function match(expression: IExpression, path: string, hasSibling?: (name: string) => boolean): string /* the matching pattern */;
431
export function match(arg1: string | IExpression | IRelativePattern, path: string, hasSibling?: (name: string) => boolean): boolean | string | null | Promise<string | null> {
432
	if (!arg1 || typeof path !== 'string') {
E
Erich Gamma 已提交
433 434 435
		return false;
	}

436
	return parse(<IExpression>arg1)(path, undefined, hasSibling);
C
Christof Marti 已提交
437 438 439 440 441 442 443 444 445 446
}

/**
 * Simplified glob matching. Supports a subset of glob patterns:
 * - * matches anything inside a path segment
 * - ? matches 1 character inside a path segment
 * - ** matches anything including an empty path segment
 * - simple brace expansion ({js,ts} => js or ts)
 * - character ranges (using [...])
 */
447
export function parse(pattern: string | IRelativePattern, options?: IGlobOptions): ParsedPattern;
448
export function parse(expression: IExpression, options?: IGlobOptions): ParsedExpression;
449
export function parse(arg1: string | IExpression | IRelativePattern, options: IGlobOptions = {}): ParsedPattern | ParsedExpression {
C
Christof Marti 已提交
450 451 452 453
	if (!arg1) {
		return FALSE;
	}

E
Erich Gamma 已提交
454
	// Glob with String
455
	if (typeof arg1 === 'string' || isRelativePattern(arg1)) {
456
		const parsedPattern = parsePattern(arg1, options);
457
		if (parsedPattern === NULL) {
C
Christof Marti 已提交
458
			return FALSE;
B
Benjamin Pasero 已提交
459
		}
C
Christof Marti 已提交
460
		const resultPattern: ParsedPattern & { allBasenames?: string[]; allPaths?: string[]; } = function (path: string, basename: string) {
461
			return !!parsedPattern(path, basename);
C
Christof Marti 已提交
462
		};
463
		if (parsedPattern.allBasenames) {
C
Christof Marti 已提交
464
			resultPattern.allBasenames = parsedPattern.allBasenames;
465
		}
466
		if (parsedPattern.allPaths) {
C
Christof Marti 已提交
467
			resultPattern.allPaths = parsedPattern.allPaths;
468
		}
469
		return resultPattern;
C
Christof Marti 已提交
470
	}
471

C
Christof Marti 已提交
472
	// Glob with Expression
473
	return parsedExpression(<IExpression>arg1, options);
C
Christof Marti 已提交
474
}
475

476
export function hasSiblingPromiseFn(siblingsFn?: () => Promise<string[]>) {
477 478 479 480
	if (!siblingsFn) {
		return undefined;
	}

481
	let siblings: Promise<Record<string, true>>;
482 483
	return (name: string) => {
		if (!siblings) {
484
			siblings = (siblingsFn() || Promise.resolve([]))
485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513
				.then(list => list ? listToMap(list) : {});
		}
		return siblings.then(map => !!map[name]);
	};
}

export function hasSiblingFn(siblingsFn?: () => string[]) {
	if (!siblingsFn) {
		return undefined;
	}

	let siblings: Record<string, true>;
	return (name: string) => {
		if (!siblings) {
			const list = siblingsFn();
			siblings = list ? listToMap(list) : {};
		}
		return !!siblings[name];
	};
}

function listToMap(list: string[]) {
	const map: Record<string, true> = {};
	for (const key of list) {
		map[key] = true;
	}
	return map;
}

B
Benjamin Pasero 已提交
514
export function isRelativePattern(obj: unknown): obj is IRelativePattern {
515 516
	const rp = obj as IRelativePattern;

517
	return rp && typeof rp.base === 'string' && typeof rp.pattern === 'string';
518 519
}

520 521 522 523
export function getBasenameTerms(patternOrExpression: ParsedPattern | ParsedExpression): string[] {
	return (<ParsedStringPattern>patternOrExpression).allBasenames || [];
}

524 525
export function getPathTerms(patternOrExpression: ParsedPattern | ParsedExpression): string[] {
	return (<ParsedStringPattern>patternOrExpression).allPaths || [];
526 527
}

528
function parsedExpression(expression: IExpression, options: IGlobOptions): ParsedExpression {
C
Christof Marti 已提交
529
	const parsedPatterns = aggregateBasenameMatches(Object.getOwnPropertyNames(expression)
530
		.map(pattern => parseExpressionPattern(pattern, expression[pattern], options))
C
Christof Marti 已提交
531
		.filter(pattern => pattern !== NULL));
532

C
Christof Marti 已提交
533 534 535 536
	const n = parsedPatterns.length;
	if (!n) {
		return NULL;
	}
537

A
Alex Dima 已提交
538
	if (!parsedPatterns.some(parsedPattern => !!(<ParsedExpressionPattern>parsedPattern).requiresSiblings)) {
C
Christof Marti 已提交
539 540
		if (n === 1) {
			return <ParsedStringPattern>parsedPatterns[0];
541 542
		}

543
		const resultExpression: ParsedStringPattern = function (path: string, basename: string) {
C
Christof Marti 已提交
544 545
			for (let i = 0, n = parsedPatterns.length; i < n; i++) {
				// Pattern matches path
546
				const result = (<ParsedStringPattern>parsedPatterns[i])(path, basename);
C
Christof Marti 已提交
547 548 549 550
				if (result) {
					return result;
				}
			}
E
Erich Gamma 已提交
551

C
Christof Marti 已提交
552 553
			return null;
		};
554 555 556 557 558 559

		const withBasenames = arrays.first(parsedPatterns, pattern => !!(<ParsedStringPattern>pattern).allBasenames);
		if (withBasenames) {
			resultExpression.allBasenames = (<ParsedStringPattern>withBasenames).allBasenames;
		}

560 561 562
		const allPaths = parsedPatterns.reduce((all, current) => current.allPaths ? all.concat(current.allPaths) : all, <string[]>[]);
		if (allPaths.length) {
			resultExpression.allPaths = allPaths;
563 564
		}

565
		return resultExpression;
C
Christof Marti 已提交
566
	}
567

568
	const resultExpression: ParsedStringPattern = function (path: string, basename: string, hasSibling?: (name: string) => boolean | Promise<boolean>) {
A
Alex Dima 已提交
569
		let name: string | undefined = undefined;
C
Christof Marti 已提交
570

571 572 573 574
		for (let i = 0, n = parsedPatterns.length; i < n; i++) {
			// Pattern matches path
			const parsedPattern = (<ParsedExpressionPattern>parsedPatterns[i]);
			if (parsedPattern.requiresSiblings && hasSibling) {
575 576 577
				if (!basename) {
					basename = paths.basename(path);
				}
578 579 580
				if (!name) {
					name = basename.substr(0, basename.length - paths.extname(path).length);
				}
C
Christof Marti 已提交
581
			}
582
			const result = parsedPattern(path, basename, name, hasSibling);
C
Christof Marti 已提交
583 584 585
			if (result) {
				return result;
			}
B
Benjamin Pasero 已提交
586 587
		}

C
Christof Marti 已提交
588 589
		return null;
	};
590 591 592 593 594 595

	const withBasenames = arrays.first(parsedPatterns, pattern => !!(<ParsedStringPattern>pattern).allBasenames);
	if (withBasenames) {
		resultExpression.allBasenames = (<ParsedStringPattern>withBasenames).allBasenames;
	}

596 597 598
	const allPaths = parsedPatterns.reduce((all, current) => current.allPaths ? all.concat(current.allPaths) : all, <string[]>[]);
	if (allPaths.length) {
		resultExpression.allPaths = allPaths;
599 600
	}

601
	return resultExpression;
C
Christof Marti 已提交
602
}
E
Erich Gamma 已提交
603

604
function parseExpressionPattern(pattern: string, value: boolean | SiblingClause, options: IGlobOptions): (ParsedStringPattern | ParsedExpressionPattern) {
C
Christof Marti 已提交
605 606 607
	if (value === false) {
		return NULL; // pattern is disabled
	}
E
Erich Gamma 已提交
608

609
	const parsedPattern = parsePattern(pattern, options);
C
Christof Marti 已提交
610 611 612
	if (parsedPattern === NULL) {
		return NULL;
	}
613

C
Christof Marti 已提交
614 615 616 617
	// Expression Pattern is <boolean>
	if (typeof value === 'boolean') {
		return parsedPattern;
	}
618

C
Christof Marti 已提交
619 620 621 622
	// Expression Pattern is <SiblingClause>
	if (value) {
		const when = (<SiblingClause>value).when;
		if (typeof when === 'string') {
623
			const result: ParsedExpressionPattern = (path: string, basename: string, name: string, hasSibling: (name: string) => boolean | Promise<boolean>) => {
624
				if (!hasSibling || !parsedPattern(path, basename)) {
C
Christof Marti 已提交
625
					return null;
E
Erich Gamma 已提交
626 627
				}

628 629
				const clausePattern = when.replace('$(basename)', name);
				const matched = hasSibling(clausePattern);
630
				return isThenable(matched) ?
631 632
					matched.then(m => m ? pattern : null) :
					matched ? pattern : null;
C
Christof Marti 已提交
633 634 635
			};
			result.requiresSiblings = true;
			return result;
E
Erich Gamma 已提交
636 637 638
		}
	}

C
Christof Marti 已提交
639 640 641 642
	// Expression is Anything
	return parsedPattern;
}

643
function aggregateBasenameMatches(parsedPatterns: Array<ParsedStringPattern | ParsedExpressionPattern>, result?: string): Array<ParsedStringPattern | ParsedExpressionPattern> {
C
Christof Marti 已提交
644 645 646 647 648
	const basenamePatterns = parsedPatterns.filter(parsedPattern => !!(<ParsedStringPattern>parsedPattern).basenames);
	if (basenamePatterns.length < 2) {
		return parsedPatterns;
	}

A
Alex Dima 已提交
649 650 651 652
	const basenames = basenamePatterns.reduce<string[]>((all, current) => {
		const basenames = (<ParsedStringPattern>current).basenames;
		return basenames ? all.concat(basenames) : all;
	}, <string[]>[]);
C
Christof Marti 已提交
653 654 655 656 657 658 659
	let patterns: string[];
	if (result) {
		patterns = [];
		for (let i = 0, n = basenames.length; i < n; i++) {
			patterns.push(result);
		}
	} else {
A
Alex Dima 已提交
660 661 662 663
		patterns = basenamePatterns.reduce((all, current) => {
			const patterns = (<ParsedStringPattern>current).patterns;
			return patterns ? all.concat(patterns) : all;
		}, <string[]>[]);
C
Christof Marti 已提交
664
	}
665
	const aggregate: ParsedStringPattern = function (path, basename) {
666
		if (typeof path !== 'string') {
C
Christof Marti 已提交
667 668
			return null;
		}
669 670 671 672
		if (!basename) {
			let i: number;
			for (i = path.length; i > 0; i--) {
				const ch = path.charCodeAt(i - 1);
673
				if (ch === CharCode.Slash || ch === CharCode.Backslash) {
674 675
					break;
				}
C
Christof Marti 已提交
676
			}
677
			basename = path.substr(i);
C
Christof Marti 已提交
678 679 680 681 682 683
		}
		const index = basenames.indexOf(basename);
		return index !== -1 ? patterns[index] : null;
	};
	aggregate.basenames = basenames;
	aggregate.patterns = patterns;
684
	aggregate.allBasenames = basenames;
C
Christof Marti 已提交
685 686 687 688

	const aggregatedPatterns = parsedPatterns.filter(parsedPattern => !(<ParsedStringPattern>parsedPattern).basenames);
	aggregatedPatterns.push(aggregate);
	return aggregatedPatterns;
689
}