File size: 1,856 Bytes
bc20498 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 |
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 || ''
}
|