/opt/canhelp/node_modules/tailwindcss/src/lib
Edit: /opt/canhelp/node_modules/tailwindcss/src/lib/regex.js (1856B)
const REGEX_SPECIAL = /[\\^$.*+?()[\]{}|]/g
const REGEX_HAS_SPECIAL = RegExp(REGEX_SPECIAL.source)
/**
* @param {string|RegExp|Array
} 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} source
*/
export function pattern(source) {
return new RegExp(toSource(source), 'g')
}
/**
* @param {string|RegExp|Array} source
*/
export function withoutCapturing(source) {
return new RegExp(`(?:${toSource(source)})`, 'g')
}
/**
* @param {Array} 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} 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} 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 || ''
}