GithubFollow/Surge_by_SukkaW
1
0
Fork 0
mirror of https://github.com/SukkaW/Surge.git synced 2026-01-29 01:51:52 +08:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

Perf: make reject list build faster

Browse Source
This commit is contained in:
SukkaW
2023-07-07 19:39:50 +08:00
parent b659bff079
commit 4d0a5260ca
4 changed files with 80 additions and 177 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Build/lib/parse-filter.js
View File

@@ -397,7 +397,7 @@ async function processFilterRules(filterRulesUrl, fallbackUrls, includeThirdPart
*/
function preprocessFullDomainSetBeforeUsedAsWorkerData(data) {
return data
.filter(domain => domain.charCodeAt(0) === 46)
.filter(domain => domain[0] === '.')
.sort((a, b) => a.length - b.length);
}

83
Build/lib/trie.js
View File

@@ -129,7 +129,7 @@ class Trie {
/**
* Method used to delete a prefix from the trie.
*
* @param {string|array} suffix - Prefix to delete.
* @param {string} suffix - Prefix to delete.
* @return {boolean}
*/
delete(suffix) {
@@ -198,66 +198,45 @@ class Trie {
}
/**
* Method returning an iterator over the trie's prefixes.
*
* @param {string|array} [prefix] - Optional starting prefix.
* @return {Iterator}
* @return {string[]}
*/
// prefixes(prefix) {
// let node = this.root;
// const nodeStack = [];
// const prefixStack = [];
// let token;
// let i;
// let l;
dump() {
let node = this.root;
const nodeStack = [];
const prefixStack = [];
// Resolving initial prefix
const prefix = '';
// const isString = this.mode === 'string';
nodeStack.push(node);
prefixStack.push(prefix);
// // Resolving initial prefix
// if (prefix) {
// for (i = 0, l = prefix.length; i < l; i++) {
// token = prefix[i];
// node = node[token];
/** @type {string[]} */
const results = [];
// // If the prefix does not exist, we return an empty iterator
// if (typeof node === 'undefined')
// return Iterator.empty();
// }
// }
// else {
// prefix = isString ? '' : [];
// }
let currentNode;
let currentPrefix;
let hasValue = false;
let k;
// nodeStack.push(node);
// prefixStack.push(prefix);
while (nodeStack.length) {
currentNode = nodeStack.pop();
currentPrefix = prefixStack.pop();
// return new Iterator(() => {
// let currentNode;
// let currentPrefix;
// let hasValue = false;
// let k;
for (k in currentNode) {
if (k === SENTINEL) {
hasValue = true;
continue;
}
// while (nodeStack.length) {
// currentNode = nodeStack.pop();
// currentPrefix = prefixStack.pop();
nodeStack.push(currentNode[k]);
prefixStack.push(k + currentPrefix);
}
// for (k in currentNode) {
// if (k === SENTINEL) {
// hasValue = true;
// continue;
// }
if (hasValue) results.push(currentPrefix);
}
// nodeStack.push(currentNode[k]);
// prefixStack.push(isString ? currentPrefix + k : currentPrefix.concat(k));
// }
// if (hasValue)
// return { done: false, value: currentPrefix };
// }
// return { done: true };
// });
// }
return results;
}
/**
* Convenience known methods.