Add semantic token highlighting for 'that' variable and comment file references in VS Code extension Add Phone_Text_Input and Currency_Input components with formatting utilities Implement client widgets, form standardization, and soft delete functionality Add modal scroll lock and update documentation Implement comprehensive modal system with form integration and validation Fix modal component instantiation using jQuery plugin API Implement modal system with responsive sizing, queuing, and validation support Implement form submission with validation, error handling, and loading states Implement country/state selectors with dynamic data loading and Bootstrap styling Revert Rsx::Route() highlighting in Blade/PHP files Target specific PHP scopes for Rsx::Route() highlighting in Blade Expand injection selector for Rsx::Route() highlighting Add custom syntax highlighting for Rsx::Route() and Rsx.Route() calls Update jqhtml packages to v2.2.165 Add bundle path validation for common mistakes (development mode only) Create Ajax_Select_Input widget and Rsx_Reference_Data controller Create Country_Select_Input widget with default country support Initialize Tom Select on Select_Input widgets Add Tom Select bundle for enhanced select dropdowns Implement ISO 3166 geographic data system for country/region selection Implement widget-based form system with disabled state support 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
242 lines
6.6 KiB
JavaScript
Executable File
242 lines
6.6 KiB
JavaScript
Executable File
/*
|
|
MIT License http://www.opensource.org/licenses/mit-license.php
|
|
Author Tobias Koppers @sokra
|
|
*/
|
|
|
|
"use strict";
|
|
|
|
/**
|
|
* @param {string} str string
|
|
* @returns {string} quoted meta
|
|
*/
|
|
const quoteMeta = (str) => str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
|
|
|
|
/**
|
|
* @param {string} str string
|
|
* @returns {string} string
|
|
*/
|
|
const toSimpleString = (str) => {
|
|
if (`${Number(str)}` === str) {
|
|
return str;
|
|
}
|
|
return JSON.stringify(str);
|
|
};
|
|
|
|
/**
|
|
* @param {Record<string | number, boolean>} map value map
|
|
* @returns {boolean | ((value: string) => string)} true/false, when unconditionally true/false, or a template function to determine the value at runtime
|
|
*/
|
|
const compileBooleanMatcher = (map) => {
|
|
const positiveItems = Object.keys(map).filter((i) => map[i]);
|
|
const negativeItems = Object.keys(map).filter((i) => !map[i]);
|
|
if (positiveItems.length === 0) return false;
|
|
if (negativeItems.length === 0) return true;
|
|
return compileBooleanMatcherFromLists(positiveItems, negativeItems);
|
|
};
|
|
|
|
/**
|
|
* @param {string[]} positiveItems positive items
|
|
* @param {string[]} negativeItems negative items
|
|
* @returns {(value: string) => string} a template function to determine the value at runtime
|
|
*/
|
|
const compileBooleanMatcherFromLists = (positiveItems, negativeItems) => {
|
|
if (positiveItems.length === 0) return () => "false";
|
|
if (negativeItems.length === 0) return () => "true";
|
|
if (positiveItems.length === 1) {
|
|
return (value) => `${toSimpleString(positiveItems[0])} == ${value}`;
|
|
}
|
|
if (negativeItems.length === 1) {
|
|
return (value) => `${toSimpleString(negativeItems[0])} != ${value}`;
|
|
}
|
|
const positiveRegexp = itemsToRegexp(positiveItems);
|
|
const negativeRegexp = itemsToRegexp(negativeItems);
|
|
if (positiveRegexp.length <= negativeRegexp.length) {
|
|
return (value) => `/^${positiveRegexp}$/.test(${value})`;
|
|
}
|
|
return (value) => `!/^${negativeRegexp}$/.test(${value})`;
|
|
};
|
|
|
|
/** @typedef {string[][]} ListOfCommonItems */
|
|
|
|
/**
|
|
* @param {Set<string>} itemsSet items set
|
|
* @param {(str: string) => string | false} getKey get key function
|
|
* @param {(str: string[]) => boolean} condition condition
|
|
* @returns {ListOfCommonItems} list of common items
|
|
*/
|
|
const popCommonItems = (itemsSet, getKey, condition) => {
|
|
/** @type {Map<string, string[]>} */
|
|
const map = new Map();
|
|
for (const item of itemsSet) {
|
|
const key = getKey(item);
|
|
if (key) {
|
|
let list = map.get(key);
|
|
if (list === undefined) {
|
|
/** @type {string[]} */
|
|
list = [];
|
|
map.set(key, list);
|
|
}
|
|
list.push(item);
|
|
}
|
|
}
|
|
/** @type {ListOfCommonItems} */
|
|
const result = [];
|
|
for (const list of map.values()) {
|
|
if (condition(list)) {
|
|
for (const item of list) {
|
|
itemsSet.delete(item);
|
|
}
|
|
result.push(list);
|
|
}
|
|
}
|
|
return result;
|
|
};
|
|
|
|
/**
|
|
* @param {string[]} items items
|
|
* @returns {string} common prefix
|
|
*/
|
|
const getCommonPrefix = (items) => {
|
|
let prefix = items[0];
|
|
for (let i = 1; i < items.length; i++) {
|
|
const item = items[i];
|
|
for (let p = 0; p < prefix.length; p++) {
|
|
if (item[p] !== prefix[p]) {
|
|
prefix = prefix.slice(0, p);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return prefix;
|
|
};
|
|
|
|
/**
|
|
* @param {string[]} items items
|
|
* @returns {string} common suffix
|
|
*/
|
|
const getCommonSuffix = (items) => {
|
|
let suffix = items[0];
|
|
for (let i = 1; i < items.length; i++) {
|
|
const item = items[i];
|
|
for (let p = item.length - 1, s = suffix.length - 1; s >= 0; p--, s--) {
|
|
if (item[p] !== suffix[s]) {
|
|
suffix = suffix.slice(s + 1);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return suffix;
|
|
};
|
|
|
|
/**
|
|
* @param {string[]} itemsArr array of items
|
|
* @returns {string} regexp
|
|
*/
|
|
const itemsToRegexp = (itemsArr) => {
|
|
if (itemsArr.length === 1) {
|
|
return quoteMeta(itemsArr[0]);
|
|
}
|
|
/** @type {string[]} */
|
|
const finishedItems = [];
|
|
|
|
// merge single char items: (a|b|c|d|ef) => ([abcd]|ef)
|
|
let countOfSingleCharItems = 0;
|
|
for (const item of itemsArr) {
|
|
if (item.length === 1) {
|
|
countOfSingleCharItems++;
|
|
}
|
|
}
|
|
// special case for only single char items
|
|
if (countOfSingleCharItems === itemsArr.length) {
|
|
return `[${quoteMeta(itemsArr.sort().join(""))}]`;
|
|
}
|
|
/** @type {Set<string>} */
|
|
const items = new Set(itemsArr.sort());
|
|
if (countOfSingleCharItems > 2) {
|
|
let singleCharItems = "";
|
|
for (const item of items) {
|
|
if (item.length === 1) {
|
|
singleCharItems += item;
|
|
items.delete(item);
|
|
}
|
|
}
|
|
finishedItems.push(`[${quoteMeta(singleCharItems)}]`);
|
|
}
|
|
|
|
// special case for 2 items with common prefix/suffix
|
|
if (finishedItems.length === 0 && items.size === 2) {
|
|
const prefix = getCommonPrefix(itemsArr);
|
|
const suffix = getCommonSuffix(
|
|
itemsArr.map((item) => item.slice(prefix.length))
|
|
);
|
|
if (prefix.length > 0 || suffix.length > 0) {
|
|
return `${quoteMeta(prefix)}${itemsToRegexp(
|
|
itemsArr.map((i) => i.slice(prefix.length, -suffix.length || undefined))
|
|
)}${quoteMeta(suffix)}`;
|
|
}
|
|
}
|
|
|
|
// special case for 2 items with common suffix
|
|
if (finishedItems.length === 0 && items.size === 2) {
|
|
/** @type {Iterator<string>} */
|
|
const it = items[Symbol.iterator]();
|
|
const a = it.next().value;
|
|
const b = it.next().value;
|
|
if (a.length > 0 && b.length > 0 && a.slice(-1) === b.slice(-1)) {
|
|
return `${itemsToRegexp([a.slice(0, -1), b.slice(0, -1)])}${quoteMeta(
|
|
a.slice(-1)
|
|
)}`;
|
|
}
|
|
}
|
|
|
|
// find common prefix: (a1|a2|a3|a4|b5) => (a(1|2|3|4)|b5)
|
|
const prefixed = popCommonItems(
|
|
items,
|
|
(item) => (item.length >= 1 ? item[0] : false),
|
|
(list) => {
|
|
if (list.length >= 3) return true;
|
|
if (list.length <= 1) return false;
|
|
return list[0][1] === list[1][1];
|
|
}
|
|
);
|
|
for (const prefixedItems of prefixed) {
|
|
const prefix = getCommonPrefix(prefixedItems);
|
|
finishedItems.push(
|
|
`${quoteMeta(prefix)}${itemsToRegexp(
|
|
prefixedItems.map((i) => i.slice(prefix.length))
|
|
)}`
|
|
);
|
|
}
|
|
|
|
// find common suffix: (a1|b1|c1|d1|e2) => ((a|b|c|d)1|e2)
|
|
const suffixed = popCommonItems(
|
|
items,
|
|
(item) => (item.length >= 1 ? item.slice(-1) : false),
|
|
(list) => {
|
|
if (list.length >= 3) return true;
|
|
if (list.length <= 1) return false;
|
|
return list[0].slice(-2) === list[1].slice(-2);
|
|
}
|
|
);
|
|
for (const suffixedItems of suffixed) {
|
|
const suffix = getCommonSuffix(suffixedItems);
|
|
finishedItems.push(
|
|
`${itemsToRegexp(
|
|
suffixedItems.map((i) => i.slice(0, -suffix.length))
|
|
)}${quoteMeta(suffix)}`
|
|
);
|
|
}
|
|
|
|
// TODO further optimize regexp, i. e.
|
|
// use ranges: (1|2|3|4|a) => [1-4a]
|
|
/** @type {string[]} */
|
|
const conditional = [...finishedItems, ...Array.from(items, quoteMeta)];
|
|
if (conditional.length === 1) return conditional[0];
|
|
return `(${conditional.join("|")})`;
|
|
};
|
|
|
|
compileBooleanMatcher.fromLists = compileBooleanMatcherFromLists;
|
|
compileBooleanMatcher.itemsToRegexp = itemsToRegexp;
|
|
|
|
module.exports = compileBooleanMatcher;
|