-
Notifications
You must be signed in to change notification settings - Fork 4.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Rewrite default class extractor (#8204)
* Rewrite default extractor * Eliminate lookbehind assertions in expand apply at rules * Update changelog
- Loading branch information
1 parent
bb0ab67
commit d676086
Showing
8 changed files
with
293 additions
and
47 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,74 @@ | ||
const REGEX_SPECIAL = /[\\^$.*+?()[\]{}|]/g | ||
const REGEX_HAS_SPECIAL = RegExp(REGEX_SPECIAL.source) | ||
|
||
/** | ||
* @param {string|RegExp|Array<string|RegExp>} source | ||
*/ | ||
function toSource(source) { | ||
source = Array.isArray(source) ? source : [source] | ||
|
||
source = source.map((item) => (item instanceof RegExp ? item.source : item)) | ||
|
||
return source.join('') | ||
} | ||
|
||
/** | ||
* @param {string|RegExp|Array<string|RegExp>} source | ||
*/ | ||
export function pattern(source) { | ||
return new RegExp(toSource(source), 'g') | ||
} | ||
|
||
/** | ||
* @param {string|RegExp|Array<string|RegExp>} source | ||
*/ | ||
export function withoutCapturing(source) { | ||
return new RegExp(`(?:${toSource(source)})`, 'g') | ||
} | ||
|
||
/** | ||
* @param {Array<string|RegExp>} sources | ||
*/ | ||
export function any(sources) { | ||
return `(?:${sources.map(toSource).join('|')})` | ||
} | ||
|
||
/** | ||
* @param {string|RegExp} source | ||
*/ | ||
export function optional(source) { | ||
return `(?:${toSource(source)})?` | ||
} | ||
|
||
/** | ||
* @param {string|RegExp|Array<string|RegExp>} source | ||
*/ | ||
export function zeroOrMore(source) { | ||
return `(?:${toSource(source)})*` | ||
} | ||
|
||
/** | ||
* Generate a RegExp that matches balanced brackets for a given depth | ||
* We have to specify a depth because JS doesn't support recursive groups using ?R | ||
* | ||
* Based on https://stackoverflow.com/questions/17759004/how-to-match-string-within-parentheses-nested-in-java/17759264#17759264 | ||
* | ||
* @param {string|RegExp|Array<string|RegExp>} source | ||
*/ | ||
export function nestedBrackets(open, close, depth = 1) { | ||
return withoutCapturing([ | ||
escape(open), | ||
/[^\s]*/, | ||
depth === 1 | ||
? `[^${escape(open)}${escape(close)}\s]*` | ||
: any([`[^${escape(open)}${escape(close)}\s]*`, nestedBrackets(open, close, depth - 1)]), | ||
/[^\s]*/, | ||
escape(close), | ||
]) | ||
} | ||
|
||
export function escape(string) { | ||
return string && REGEX_HAS_SPECIAL.test(string) | ||
? string.replace(REGEX_SPECIAL, '\\$&') | ||
: string || '' | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.