prism-code-editor
Version:
Lightweight, extensible code editor component for the web using Prism
78 lines (77 loc) • 2.83 kB
JavaScript
import { r as createTemplate } from "./core-E7btWBqK.js";
import { p as regexEscape, t as addOverlay, x as updateNode } from "./utils-BffvWiz1.js";
//#region src/extensions/search/search.ts
var searchTemplate = /* @__PURE__ */ createTemplate("<div style=\"color:#0000;contain:strict;padding:0 var(--_pse) 0 var(--padding-left)\" aria-hidden=true> ");
var matchTemplate = /* @__PURE__ */ createTemplate("<span> ");
var testBoundary = (str, position, pattern = /[_\p{N}\p{L}]{2}/u) => {
if (!position) return false;
return pattern.test(str.slice(position - (str.codePointAt(position - 2) > 65535 ? 2 : 1), position + (str.codePointAt(position) > 65535 ? 2 : 1)));
};
/** Function adding search functionality to an editor. */
var createSearchAPI = (editor) => {
const container = searchTemplate();
const nodes = [container.firstChild];
const matchPositions = [];
const stopSearch = () => {
if (matchPositions[0]) {
matchPositions.length = 0;
container.remove();
}
};
let regex;
let lastNode = 0;
return {
search(str, caseSensitive, wholeWord, useRegExp, selection, filter, pattern) {
if (!str) return stopSearch();
if (!useRegExp) str = regexEscape(str);
const value = editor.value;
const searchStr = selection ? value.slice(...selection) : value;
const offset = selection ? selection[0] : 0;
let match;
let l;
let index;
let i = 0;
try {
regex = RegExp(str, caseSensitive ? "gum" : "gumi");
while (match = regex.exec(searchStr)) {
l = match[0].length;
index = match.index + offset;
if (!l) regex.lastIndex += value.codePointAt(index) > 65535 ? 2 : 1;
if (wholeWord && (testBoundary(value, index, pattern) || testBoundary(value, index + l, pattern))) continue;
if (!filter || filter(index, index + l)) matchPositions[i++] = [index, index + l];
}
} catch (e) {
stopSearch();
return e.message;
}
if (i) {
matchPositions.length = i;
l = Math.min(i * 2, 2e4);
for (i = nodes.length; i <= l;) {
nodes[i++] = matchTemplate();
nodes[i++] = new Text();
}
for (i = l; i < lastNode;) nodes[++i].remove();
if (lastNode < l) container.append(...nodes.slice(lastNode + 1, l + 1));
let prevEnd = 0;
for (i = 0; i < l;) {
const [start, end] = matchPositions[i / 2];
updateNode(nodes[i++], value.slice(prevEnd, start));
updateNode(nodes[i++].firstChild, value.slice(start, prevEnd = end));
}
updateNode(nodes[l], value.slice(prevEnd));
if (!container.parentNode) addOverlay(editor, container);
lastNode = l;
} else stopSearch();
},
container,
get regex() {
return regex;
},
matches: matchPositions,
stopSearch
};
};
//#endregion
export { matchTemplate as n, searchTemplate as r, createSearchAPI as t };
//# sourceMappingURL=search-CFiQUHOR.js.map