diff options
| author | Adam Mathes <adam@adammathes.com> | 2026-02-14 14:46:37 -0800 |
|---|---|---|
| committer | Adam Mathes <adam@adammathes.com> | 2026-02-14 14:46:37 -0800 |
| commit | afa87af01c79a9baa539f2992d32154d2a4739bd (patch) | |
| tree | 92c7416db734270a2fee1d72ee9cc119379ff8e1 /vanilla/node_modules/css-tree/lib/lexer/search.js | |
| parent | 3b927e84d200402281f68181cd4253bc77e5528d (diff) | |
| download | neko-afa87af01c79a9baa539f2992d32154d2a4739bd.tar.gz neko-afa87af01c79a9baa539f2992d32154d2a4739bd.tar.bz2 neko-afa87af01c79a9baa539f2992d32154d2a4739bd.zip | |
task: delete vanilla js prototype\n\n- Removed vanilla/ directory and web/dist/vanilla directory\n- Updated Makefile, Dockerfile, and CI workflow to remove vanilla references\n- Cleaned up web/web.go to remove vanilla embed and routes\n- Verified build and tests pass\n\nCloses NK-2tcnmq
Diffstat (limited to 'vanilla/node_modules/css-tree/lib/lexer/search.js')
| -rw-r--r-- | vanilla/node_modules/css-tree/lib/lexer/search.js | 61 |
1 files changed, 0 insertions, 61 deletions
diff --git a/vanilla/node_modules/css-tree/lib/lexer/search.js b/vanilla/node_modules/css-tree/lib/lexer/search.js deleted file mode 100644 index ee68e2d..0000000 --- a/vanilla/node_modules/css-tree/lib/lexer/search.js +++ /dev/null @@ -1,61 +0,0 @@ -import { List } from '../utils/List.js'; - -function getFirstMatchNode(matchNode) { - if ('node' in matchNode) { - return matchNode.node; - } - - return getFirstMatchNode(matchNode.match[0]); -} - -function getLastMatchNode(matchNode) { - if ('node' in matchNode) { - return matchNode.node; - } - - return getLastMatchNode(matchNode.match[matchNode.match.length - 1]); -} - -export function matchFragments(lexer, ast, match, type, name) { - function findFragments(matchNode) { - if (matchNode.syntax !== null && - matchNode.syntax.type === type && - matchNode.syntax.name === name) { - const start = getFirstMatchNode(matchNode); - const end = getLastMatchNode(matchNode); - - lexer.syntax.walk(ast, function(node, item, list) { - if (node === start) { - const nodes = new List(); - - do { - nodes.appendData(item.data); - - if (item.data === end) { - break; - } - - item = item.next; - } while (item !== null); - - fragments.push({ - parent: list, - nodes - }); - } - }); - } - - if (Array.isArray(matchNode.match)) { - matchNode.match.forEach(findFragments); - } - } - - const fragments = []; - - if (match.matched !== null) { - findFragments(match.matched); - } - - return fragments; -} |
