|
@@ -1,665 +0,0 @@
|
|
|
-/**
|
|
|
|
|
- * Hostbane-Optimized Trie based on Mnemonist Trie
|
|
|
|
|
- */
|
|
|
|
|
-
|
|
|
|
|
-import { fastStringCompare } from 'foxts/fast-string-compare';
|
|
|
|
|
-import util from 'node:util';
|
|
|
|
|
-import { noop } from 'foxts/noop';
|
|
|
|
|
-import { fastStringArrayJoin } from 'foxts/fast-string-array-join';
|
|
|
|
|
-
|
|
|
|
|
-import { deleteBit, getBit, missingBit, setBit } from 'foxts/bitwise';
|
|
|
|
|
-import { domainToASCII } from 'node:url';
|
|
|
|
|
-
|
|
|
|
|
-const START = 1 << 1;
|
|
|
|
|
-const INCLUDE_ALL_SUBDOMAIN = 1 << 2;
|
|
|
|
|
-
|
|
|
|
|
-type TrieNode<Meta = any> = [
|
|
|
|
|
- /** end, includeAllSubdomain (.example.org, ||example.com) */ flag: number,
|
|
|
|
|
- /** parent */ TrieNode | null,
|
|
|
|
|
- /** children */ Map<string, TrieNode>,
|
|
|
|
|
- /** token */ token: string,
|
|
|
|
|
- /** meta */ Meta
|
|
|
|
|
-];
|
|
|
|
|
-
|
|
|
|
|
-function deepTrieNodeToJSON<Meta = unknown>(node: TrieNode,
|
|
|
|
|
- unpackMeta: ((meta?: Meta) => string) | undefined) {
|
|
|
|
|
- const obj: Record<string, unknown> = {
|
|
|
|
|
- ['[start]']: getBit(node[0], START),
|
|
|
|
|
- ['[subdomain]']: getBit(node[0], INCLUDE_ALL_SUBDOMAIN)
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- if (node[4] != null) {
|
|
|
|
|
- if (unpackMeta) {
|
|
|
|
|
- obj['[meta]'] = unpackMeta(node[4]);
|
|
|
|
|
- } else {
|
|
|
|
|
- obj['[meta]'] = node[4];
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
- node[2].forEach((value, key) => {
|
|
|
|
|
- obj[key] = deepTrieNodeToJSON(value, unpackMeta);
|
|
|
|
|
- });
|
|
|
|
|
- return obj;
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-const createNode = <Meta = unknown>(token: string, parent: TrieNode | null = null): TrieNode => [1, parent, new Map<string, TrieNode>(), token, null] as TrieNode<Meta>;
|
|
|
|
|
-
|
|
|
|
|
-function hostnameToTokens(hostname: string, hostnameFromIndex: number): string[] {
|
|
|
|
|
- const tokens = hostname.split('.');
|
|
|
|
|
- const results: string[] = [];
|
|
|
|
|
- let token = '';
|
|
|
|
|
-
|
|
|
|
|
- for (let i = hostnameFromIndex, l = tokens.length; i < l; i++) {
|
|
|
|
|
- token = tokens[i];
|
|
|
|
|
- if (token.length > 0) {
|
|
|
|
|
- results.push(token);
|
|
|
|
|
- } else {
|
|
|
|
|
- throw new TypeError(JSON.stringify({ hostname, hostnameFromIndex }, null, 2));
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return results;
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-function walkHostnameTokens(hostname: string, onToken: (token: string) => boolean | null, hostnameFromIndex: number): boolean | null {
|
|
|
|
|
- const tokens = hostname.split('.');
|
|
|
|
|
-
|
|
|
|
|
- const l = tokens.length - 1;
|
|
|
|
|
-
|
|
|
|
|
- // we are at the first of hostname, no splitor there
|
|
|
|
|
- let token = '';
|
|
|
|
|
-
|
|
|
|
|
- for (let i = l; i >= hostnameFromIndex; i--) {
|
|
|
|
|
- token = tokens[i];
|
|
|
|
|
- if (token.length > 0) {
|
|
|
|
|
- const t = onToken(token);
|
|
|
|
|
- if (t === null) {
|
|
|
|
|
- return null;
|
|
|
|
|
- }
|
|
|
|
|
- // if the callback returns true, we should skip the rest
|
|
|
|
|
- if (t) {
|
|
|
|
|
- return true;
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return false;
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-interface FindSingleChildLeafResult<Meta> {
|
|
|
|
|
- node: TrieNode<Meta>,
|
|
|
|
|
- toPrune: TrieNode<Meta> | null,
|
|
|
|
|
- tokenToPrune: string | null,
|
|
|
|
|
- parent: TrieNode<Meta>
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-abstract class Triebase<Meta = unknown> {
|
|
|
|
|
- protected readonly $root: TrieNode<Meta> = createNode('$root');
|
|
|
|
|
- protected $size = 0;
|
|
|
|
|
-
|
|
|
|
|
- get root() {
|
|
|
|
|
- return this.$root;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- constructor(from?: string[] | Set<string> | null) {
|
|
|
|
|
- // Actually build trie
|
|
|
|
|
- if (Array.isArray(from)) {
|
|
|
|
|
- for (let i = 0, l = from.length; i < l; i++) {
|
|
|
|
|
- this.add(from[i]);
|
|
|
|
|
- }
|
|
|
|
|
- } else if (from) {
|
|
|
|
|
- from.forEach((value) => this.add(value));
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- public abstract add(suffix: string, includeAllSubdomain?: boolean, meta?: Meta, hostnameFromIndex?: number): void;
|
|
|
|
|
-
|
|
|
|
|
- protected walkIntoLeafWithTokens(
|
|
|
|
|
- tokens: string[],
|
|
|
|
|
- onLoop: (node: TrieNode, parent: TrieNode, token: string) => void = noop
|
|
|
|
|
- ) {
|
|
|
|
|
- let node: TrieNode = this.$root;
|
|
|
|
|
- let parent: TrieNode = node;
|
|
|
|
|
-
|
|
|
|
|
- let token: string;
|
|
|
|
|
- let child: Map<string, TrieNode<Meta>> = node[2];
|
|
|
|
|
-
|
|
|
|
|
- // reverse lookup from end to start
|
|
|
|
|
- for (let i = tokens.length - 1; i >= 0; i--) {
|
|
|
|
|
- token = tokens[i];
|
|
|
|
|
-
|
|
|
|
|
- // if (token === '') {
|
|
|
|
|
- // break;
|
|
|
|
|
- // }
|
|
|
|
|
-
|
|
|
|
|
- parent = node;
|
|
|
|
|
-
|
|
|
|
|
- child = node[2];
|
|
|
|
|
- // cache node index access is 20% faster than direct access when doing twice
|
|
|
|
|
- if (child.has(token)) {
|
|
|
|
|
- node = child.get(token)!;
|
|
|
|
|
- } else {
|
|
|
|
|
- return null;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- onLoop(node, parent, token);
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return { node, parent };
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- protected walkIntoLeafWithSuffix(
|
|
|
|
|
- suffix: string,
|
|
|
|
|
- hostnameFromIndex: number,
|
|
|
|
|
- onLoop: (node: TrieNode, parent: TrieNode, token: string) => void = noop
|
|
|
|
|
- ) {
|
|
|
|
|
- let node: TrieNode = this.$root;
|
|
|
|
|
- let parent: TrieNode = node;
|
|
|
|
|
-
|
|
|
|
|
- let child: Map<string, TrieNode<Meta>> = node[2];
|
|
|
|
|
-
|
|
|
|
|
- const onToken = (token: string) => {
|
|
|
|
|
- // if (token === '') {
|
|
|
|
|
- // return true;
|
|
|
|
|
- // }
|
|
|
|
|
-
|
|
|
|
|
- parent = node;
|
|
|
|
|
-
|
|
|
|
|
- child = node[2];
|
|
|
|
|
-
|
|
|
|
|
- if (child.has(token)) {
|
|
|
|
|
- node = child.get(token)!;
|
|
|
|
|
- } else {
|
|
|
|
|
- return null;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- onLoop(node, parent, token);
|
|
|
|
|
-
|
|
|
|
|
- return false;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- if (walkHostnameTokens(suffix, onToken, hostnameFromIndex) === null) {
|
|
|
|
|
- return null;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return { node, parent };
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- public contains(suffix: string, includeAllSubdomain = suffix[0] === '.'): boolean {
|
|
|
|
|
- const hostnameFromIndex = suffix[0] === '.' ? 1 : 0;
|
|
|
|
|
-
|
|
|
|
|
- let node: TrieNode = this.$root;
|
|
|
|
|
- // let parent: TrieNode = node;
|
|
|
|
|
-
|
|
|
|
|
- let child: Map<string, TrieNode<Meta>> = node[2];
|
|
|
|
|
-
|
|
|
|
|
- let result = false;
|
|
|
|
|
-
|
|
|
|
|
- const onToken = (token: string) => {
|
|
|
|
|
- // if (token === '') {
|
|
|
|
|
- // return true;
|
|
|
|
|
- // }
|
|
|
|
|
-
|
|
|
|
|
- // parent = node;
|
|
|
|
|
-
|
|
|
|
|
- child = node[2];
|
|
|
|
|
-
|
|
|
|
|
- if (child.has(token)) {
|
|
|
|
|
- node = child.get(token)!;
|
|
|
|
|
- } else {
|
|
|
|
|
- if (getBit(node[0], INCLUDE_ALL_SUBDOMAIN)) {
|
|
|
|
|
- result = true;
|
|
|
|
|
- }
|
|
|
|
|
- return null;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return false;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- if (walkHostnameTokens(suffix, onToken, hostnameFromIndex) === null) {
|
|
|
|
|
- return result;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- if (includeAllSubdomain) return getBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- return getBit(node[0], START);
|
|
|
|
|
-
|
|
|
|
|
- // if (res === null) return false;
|
|
|
|
|
- // if (includeAllSubdomain) return getBit(res.node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- // return true;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- private static bfsResults: [node: TrieNode | null, suffix: string[]] = [null, []];
|
|
|
|
|
-
|
|
|
|
|
- private static dfs<Meta>(this: void, nodeStack: Array<TrieNode<Meta>>, suffixStack: string[][]) {
|
|
|
|
|
- const node = nodeStack.pop()!;
|
|
|
|
|
- const suffix = suffixStack.pop()!;
|
|
|
|
|
-
|
|
|
|
|
- node[2].forEach((childNode, k) => {
|
|
|
|
|
- // Pushing the child node to the stack for next iteration of DFS
|
|
|
|
|
- nodeStack.push(childNode);
|
|
|
|
|
-
|
|
|
|
|
- suffixStack.push([k, ...suffix]);
|
|
|
|
|
- });
|
|
|
|
|
-
|
|
|
|
|
- Triebase.bfsResults[0] = node;
|
|
|
|
|
- Triebase.bfsResults[1] = suffix;
|
|
|
|
|
-
|
|
|
|
|
- return Triebase.bfsResults;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- private static dfsWithSort<Meta>(this: void, nodeStack: Array<TrieNode<Meta>>, suffixStack: string[][]) {
|
|
|
|
|
- const node = nodeStack.pop()!;
|
|
|
|
|
- const suffix = suffixStack.pop()!;
|
|
|
|
|
-
|
|
|
|
|
- const child = node[2];
|
|
|
|
|
-
|
|
|
|
|
- if (child.size) {
|
|
|
|
|
- const keys = Array.from(child.keys()).sort(Triebase.compare);
|
|
|
|
|
-
|
|
|
|
|
- for (let i = 0, l = keys.length; i < l; i++) {
|
|
|
|
|
- const key = keys[i];
|
|
|
|
|
- const childNode = child.get(key)!;
|
|
|
|
|
-
|
|
|
|
|
- // Pushing the child node to the stack for next iteration of DFS
|
|
|
|
|
- nodeStack.push(childNode);
|
|
|
|
|
- suffixStack.push([key, ...suffix]);
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- Triebase.bfsResults[0] = node;
|
|
|
|
|
- Triebase.bfsResults[1] = suffix;
|
|
|
|
|
-
|
|
|
|
|
- return Triebase.bfsResults;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- private walk(
|
|
|
|
|
- onMatches: (suffix: string[], subdomain: boolean, meta: Meta) => void,
|
|
|
|
|
- withSort = false,
|
|
|
|
|
- initialNode = this.$root,
|
|
|
|
|
- initialSuffix: string[] = []
|
|
|
|
|
- ) {
|
|
|
|
|
- const dfsImpl = withSort ? Triebase.dfsWithSort : Triebase.dfs;
|
|
|
|
|
-
|
|
|
|
|
- const nodeStack: Array<TrieNode<Meta>> = [initialNode];
|
|
|
|
|
-
|
|
|
|
|
- // Resolving initial string (begin the start of the stack)
|
|
|
|
|
- const suffixStack: string[][] = [initialSuffix];
|
|
|
|
|
-
|
|
|
|
|
- let node: TrieNode<Meta> = initialNode;
|
|
|
|
|
-
|
|
|
|
|
- do {
|
|
|
|
|
- const r = dfsImpl(nodeStack, suffixStack);
|
|
|
|
|
- node = r[0]!;
|
|
|
|
|
- const suffix = r[1];
|
|
|
|
|
-
|
|
|
|
|
- // If the node is a sentinel, we push the suffix to the results
|
|
|
|
|
- if (getBit(node[0], START)) {
|
|
|
|
|
- onMatches(suffix, getBit(node[0], INCLUDE_ALL_SUBDOMAIN), node[4]);
|
|
|
|
|
- }
|
|
|
|
|
- } while (nodeStack.length);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- static compare(this: void, a: string, b: string) {
|
|
|
|
|
- if (a === b) return 0;
|
|
|
|
|
- return (a.length - b.length) || fastStringCompare(a, b);
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- protected getSingleChildLeaf(tokens: string[]): FindSingleChildLeafResult<Meta> | null {
|
|
|
|
|
- let toPrune: TrieNode | null = null;
|
|
|
|
|
- let tokenToPrune: string | null = null;
|
|
|
|
|
-
|
|
|
|
|
- const onLoop = (node: TrieNode, parent: TrieNode, token: string) => {
|
|
|
|
|
- // Keeping track of a potential branch to prune
|
|
|
|
|
-
|
|
|
|
|
- const child = node[2];
|
|
|
|
|
-
|
|
|
|
|
- const childSize = child.size + (getBit(node[0], INCLUDE_ALL_SUBDOMAIN) ? 1 : 0);
|
|
|
|
|
-
|
|
|
|
|
- if (toPrune !== null) { // the most near branch that could potentially being pruned
|
|
|
|
|
- if (childSize >= 1) {
|
|
|
|
|
- // The branch has some children, the branch need retain.
|
|
|
|
|
- // And we need to abort prune that parent branch, so we set it to null
|
|
|
|
|
- toPrune = null;
|
|
|
|
|
- tokenToPrune = null;
|
|
|
|
|
- }
|
|
|
|
|
- } else if (childSize < 1) {
|
|
|
|
|
- // There is only one token child, or no child at all, we can prune it safely
|
|
|
|
|
- // It is now the top-est branch that could potentially being pruned
|
|
|
|
|
- toPrune = parent;
|
|
|
|
|
- tokenToPrune = token;
|
|
|
|
|
- }
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- const res = this.walkIntoLeafWithTokens(tokens, onLoop);
|
|
|
|
|
-
|
|
|
|
|
- if (res === null) return null;
|
|
|
|
|
- return { node: res.node, toPrune, tokenToPrune, parent: res.parent };
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- /**
|
|
|
|
|
- * Method used to retrieve every item in the trie with the given prefix.
|
|
|
|
|
- */
|
|
|
|
|
- public find(
|
|
|
|
|
- inputSuffix: string,
|
|
|
|
|
- subdomainOnly = inputSuffix[0] === '.',
|
|
|
|
|
- hostnameFromIndex = inputSuffix[0] === '.' ? 1 : 0
|
|
|
|
|
- // /** @default true */ includeEqualWithSuffix = true
|
|
|
|
|
- ): string[] {
|
|
|
|
|
- const inputTokens = hostnameToTokens(inputSuffix, hostnameFromIndex);
|
|
|
|
|
- const res = this.walkIntoLeafWithTokens(inputTokens);
|
|
|
|
|
- if (res === null) return [];
|
|
|
|
|
-
|
|
|
|
|
- const results: string[] = [];
|
|
|
|
|
-
|
|
|
|
|
- const onMatches = subdomainOnly
|
|
|
|
|
- ? (suffix: string[], subdomain: boolean) => { // fast path (default option)
|
|
|
|
|
- const d = domainToASCII(fastStringArrayJoin(suffix, '.'));
|
|
|
|
|
- if (!subdomain && subStringEqual(inputSuffix, d, 1)) return;
|
|
|
|
|
-
|
|
|
|
|
- results.push(subdomain ? '.' + d : d);
|
|
|
|
|
- }
|
|
|
|
|
- : (suffix: string[], subdomain: boolean) => { // fast path (default option)
|
|
|
|
|
- const d = domainToASCII(fastStringArrayJoin(suffix, '.'));
|
|
|
|
|
- results.push(subdomain ? '.' + d : d);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- this.walk(
|
|
|
|
|
- onMatches,
|
|
|
|
|
- false,
|
|
|
|
|
- res.node, // Performing DFS from prefix
|
|
|
|
|
- inputTokens
|
|
|
|
|
- );
|
|
|
|
|
-
|
|
|
|
|
- return results;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- /**
|
|
|
|
|
- * Method used to delete a prefix from the trie.
|
|
|
|
|
- */
|
|
|
|
|
- public remove(suffix: string): boolean {
|
|
|
|
|
- const res = this.getSingleChildLeaf(hostnameToTokens(suffix, 0));
|
|
|
|
|
- if (res === null) return false;
|
|
|
|
|
-
|
|
|
|
|
- if (missingBit(res.node[0], START)) return false;
|
|
|
|
|
-
|
|
|
|
|
- this.$size--;
|
|
|
|
|
- const { node, toPrune, tokenToPrune } = res;
|
|
|
|
|
-
|
|
|
|
|
- if (tokenToPrune && toPrune) {
|
|
|
|
|
- toPrune[2].delete(tokenToPrune);
|
|
|
|
|
- } else {
|
|
|
|
|
- node[0] = deleteBit(node[0], START);
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return true;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- // eslint-disable-next-line @typescript-eslint/unbound-method -- safe
|
|
|
|
|
- public delete = this.remove;
|
|
|
|
|
-
|
|
|
|
|
- /**
|
|
|
|
|
- * Method used to assert whether the given prefix exists in the Trie.
|
|
|
|
|
- */
|
|
|
|
|
- public has(suffix: string, includeAllSubdomain = suffix[0] === '.'): boolean {
|
|
|
|
|
- const hostnameFromIndex = suffix[0] === '.' ? 1 : 0;
|
|
|
|
|
-
|
|
|
|
|
- const res = this.walkIntoLeafWithSuffix(suffix, hostnameFromIndex);
|
|
|
|
|
-
|
|
|
|
|
- if (res === null) return false;
|
|
|
|
|
- if (missingBit(res.node[0], START)) return false;
|
|
|
|
|
- if (includeAllSubdomain) return getBit(res.node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- return true;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- public dumpWithoutDot(onSuffix: (suffix: string, subdomain: boolean) => void, withSort = false) {
|
|
|
|
|
- const handleSuffix = (suffix: string[], subdomain: boolean) => {
|
|
|
|
|
- onSuffix(domainToASCII(fastStringArrayJoin(suffix, '.')), subdomain);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- this.walk(handleSuffix, withSort);
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- public dump(onSuffix: (suffix: string) => void, withSort?: boolean): void;
|
|
|
|
|
- public dump(onSuffix?: null, withSort?: boolean): string[];
|
|
|
|
|
- public dump(onSuffix?: ((suffix: string) => void) | null, withSort = false): string[] | void {
|
|
|
|
|
- const results: string[] = [];
|
|
|
|
|
-
|
|
|
|
|
- const handleSuffix = onSuffix
|
|
|
|
|
- ? (suffix: string[], subdomain: boolean) => {
|
|
|
|
|
- const d = domainToASCII(fastStringArrayJoin(suffix, '.'));
|
|
|
|
|
- onSuffix(subdomain ? '.' + d : d);
|
|
|
|
|
- }
|
|
|
|
|
- : (suffix: string[], subdomain: boolean) => {
|
|
|
|
|
- const d = domainToASCII(fastStringArrayJoin(suffix, '.'));
|
|
|
|
|
- results.push(subdomain ? '.' + d : d);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- this.walk(handleSuffix, withSort);
|
|
|
|
|
-
|
|
|
|
|
- return results;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- public dumpMeta(onMeta: (meta: Meta) => void, withSort?: boolean): void;
|
|
|
|
|
- public dumpMeta(onMeta?: null, withSort?: boolean): Meta[];
|
|
|
|
|
- public dumpMeta(onMeta?: ((meta: Meta) => void) | null, withSort = false): Meta[] | void {
|
|
|
|
|
- const results: Meta[] = [];
|
|
|
|
|
-
|
|
|
|
|
- const handleMeta = onMeta
|
|
|
|
|
- ? (_suffix: string[], _subdomain: boolean, meta: Meta) => onMeta(meta)
|
|
|
|
|
- : (_suffix: string[], _subdomain: boolean, meta: Meta) => results.push(meta);
|
|
|
|
|
-
|
|
|
|
|
- this.walk(handleMeta, withSort);
|
|
|
|
|
-
|
|
|
|
|
- return results;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- public dumpWithMeta(onSuffix: (suffix: string, meta: Meta | undefined) => void, withSort?: boolean): void;
|
|
|
|
|
- public dumpWithMeta(onMeta?: null, withSort?: boolean): Array<[string, Meta | undefined]>;
|
|
|
|
|
- public dumpWithMeta(onSuffix?: ((suffix: string, meta: Meta | undefined) => void) | null, withSort = false): Array<[string, Meta | undefined]> | void {
|
|
|
|
|
- const results: Array<[string, Meta | undefined]> = [];
|
|
|
|
|
-
|
|
|
|
|
- const handleSuffix = onSuffix
|
|
|
|
|
- ? (suffix: string[], subdomain: boolean, meta: Meta | undefined) => {
|
|
|
|
|
- const d = domainToASCII(fastStringArrayJoin(suffix, '.'));
|
|
|
|
|
- return onSuffix(subdomain ? '.' + d : d, meta);
|
|
|
|
|
- }
|
|
|
|
|
- : (suffix: string[], subdomain: boolean, meta: Meta | undefined) => {
|
|
|
|
|
- const d = domainToASCII(fastStringArrayJoin(suffix, '.'));
|
|
|
|
|
- results.push([subdomain ? '.' + d : d, meta]);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- this.walk(handleSuffix, withSort);
|
|
|
|
|
-
|
|
|
|
|
- return results;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- public inspect(depth: number, unpackMeta?: (meta?: Meta) => any) {
|
|
|
|
|
- return fastStringArrayJoin(
|
|
|
|
|
- JSON.stringify(deepTrieNodeToJSON(this.$root, unpackMeta), null, 2).split('\n').map((line) => ' '.repeat(depth) + line),
|
|
|
|
|
- '\n'
|
|
|
|
|
- );
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- public [util.inspect.custom](depth: number) {
|
|
|
|
|
- return this.inspect(depth);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- public merge(trie: Triebase<Meta>) {
|
|
|
|
|
- const handleSuffix = (suffix: string[], subdomain: boolean, meta: Meta) => {
|
|
|
|
|
- this.add(fastStringArrayJoin(suffix, '.'), subdomain, meta);
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- trie.walk(handleSuffix);
|
|
|
|
|
-
|
|
|
|
|
- return this;
|
|
|
|
|
- }
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-export class HostnameSmolTrie<Meta = unknown> extends Triebase<Meta> {
|
|
|
|
|
- public smolTree = true;
|
|
|
|
|
-
|
|
|
|
|
- add(suffix: string, includeAllSubdomain = suffix[0] === '.', meta?: Meta, hostnameFromIndex = suffix[0] === '.' ? 1 : 0): void {
|
|
|
|
|
- let node: TrieNode<Meta> = this.$root;
|
|
|
|
|
- let curNodeChildren: Map<string, TrieNode<Meta>> = node[2];
|
|
|
|
|
-
|
|
|
|
|
- const onToken = (token: string) => {
|
|
|
|
|
- curNodeChildren = node[2];
|
|
|
|
|
- if (curNodeChildren.has(token)) {
|
|
|
|
|
- node = curNodeChildren.get(token)!;
|
|
|
|
|
-
|
|
|
|
|
- // During the adding of `[start]blog|.skk.moe` and find out that there is a `[start].skk.moe` in the trie, skip adding the rest of the node
|
|
|
|
|
- if (getBit(node[0], INCLUDE_ALL_SUBDOMAIN)) {
|
|
|
|
|
- return true;
|
|
|
|
|
- }
|
|
|
|
|
- } else {
|
|
|
|
|
- const newNode = createNode(token, node);
|
|
|
|
|
- curNodeChildren.set(token, newNode);
|
|
|
|
|
- node = newNode;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return false;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- // When walkHostnameTokens returns true, we should skip the rest
|
|
|
|
|
- if (walkHostnameTokens(suffix, onToken, hostnameFromIndex)) {
|
|
|
|
|
- return;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- // If we are in smolTree mode, we need to do something at the end of the loop
|
|
|
|
|
- if (includeAllSubdomain) {
|
|
|
|
|
- // Trying to add `[.]sub.example.com` where there is already a `blog.sub.example.com` in the trie
|
|
|
|
|
-
|
|
|
|
|
- // Make sure parent `[start]sub.example.com` (without dot) is removed (SETINEL to false)
|
|
|
|
|
- // (/** parent */ node[2]!)[0] = false;
|
|
|
|
|
-
|
|
|
|
|
- // Removing the rest of the parent's child nodes
|
|
|
|
|
- node[2].clear();
|
|
|
|
|
- // The SENTINEL of this node will be set to true at the end of the function, so we don't need to set it here
|
|
|
|
|
-
|
|
|
|
|
- // we can use else-if here, because the children is now empty, we don't need to check the leading "."
|
|
|
|
|
- } else if (getBit(node[0], INCLUDE_ALL_SUBDOMAIN)) {
|
|
|
|
|
- // Trying to add `example.com` when there is already a `.example.com` in the trie
|
|
|
|
|
- // No need to increment size and set SENTINEL to true (skip this "new" item)
|
|
|
|
|
- return;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- node[0] = setBit(node[0], START);
|
|
|
|
|
- if (includeAllSubdomain) {
|
|
|
|
|
- node[0] = setBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- } else {
|
|
|
|
|
- node[0] = deleteBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- }
|
|
|
|
|
- node[4] = meta!;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- public whitelist(suffix: string, includeAllSubdomain = suffix[0] === '.', hostnameFromIndex = suffix[0] === '.' ? 1 : 0) {
|
|
|
|
|
- const tokens = hostnameToTokens(suffix, hostnameFromIndex);
|
|
|
|
|
- const res = this.getSingleChildLeaf(tokens);
|
|
|
|
|
- if (res === null) return;
|
|
|
|
|
-
|
|
|
|
|
- const { node, toPrune, tokenToPrune } = res;
|
|
|
|
|
-
|
|
|
|
|
- // Trying to whitelist `[start].sub.example.com` where there might already be a `[start]blog.sub.example.com` in the trie
|
|
|
|
|
- if (includeAllSubdomain) {
|
|
|
|
|
- // If there is a `[start]sub.example.com` here, remove it
|
|
|
|
|
- node[0] = deleteBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- // Removing all the child nodes by empty the children
|
|
|
|
|
- node[2].clear();
|
|
|
|
|
- // we do not remove sub.example.com for now, we will do that later
|
|
|
|
|
- } else {
|
|
|
|
|
- // Trying to whitelist `example.com` when there is already a `.example.com` in the trie
|
|
|
|
|
- node[0] = deleteBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- if (includeAllSubdomain) {
|
|
|
|
|
- node[1]?.[2].delete(node[3]);
|
|
|
|
|
- } else if (missingBit(node[0], START) && node[1]) {
|
|
|
|
|
- return;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- if (toPrune && tokenToPrune) {
|
|
|
|
|
- toPrune[2].delete(tokenToPrune);
|
|
|
|
|
- } else {
|
|
|
|
|
- node[0] = deleteBit(node[0], START);
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- cleanUpEmptyTrailNode(node);
|
|
|
|
|
- };
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-function cleanUpEmptyTrailNode(node: TrieNode<unknown>) {
|
|
|
|
|
- let current = node;
|
|
|
|
|
- while (
|
|
|
|
|
- // the current node is not an "end node", a.k.a. not the start of a domain
|
|
|
|
|
- missingBit(current[0], START)
|
|
|
|
|
- // also no leading "." (no subdomain)
|
|
|
|
|
- && missingBit(current[0], INCLUDE_ALL_SUBDOMAIN)
|
|
|
|
|
- // child is empty
|
|
|
|
|
- && current[2].size === 0
|
|
|
|
|
- // has parent: we need to delete the current node from the parent
|
|
|
|
|
- // we also need to clean up the parent node
|
|
|
|
|
- && current[1]
|
|
|
|
|
- ) {
|
|
|
|
|
- current[1][2].delete(current[3]);
|
|
|
|
|
- current = current[1];
|
|
|
|
|
- }
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-export class HostnameTrie<Meta = unknown> extends Triebase<Meta> {
|
|
|
|
|
- get size() {
|
|
|
|
|
- return this.$size;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- add(suffix: string, includeAllSubdomain = suffix[0] === '.', meta?: Meta, hostnameFromIndex = suffix[0] === '.' ? 1 : 0): void {
|
|
|
|
|
- let node: TrieNode<Meta> = this.$root;
|
|
|
|
|
- let child: Map<string, TrieNode<Meta>> = node[2];
|
|
|
|
|
-
|
|
|
|
|
- const onToken = (token: string) => {
|
|
|
|
|
- child = node[2];
|
|
|
|
|
- if (child.has(token)) {
|
|
|
|
|
- node = child.get(token)!;
|
|
|
|
|
- } else {
|
|
|
|
|
- const newNode = createNode(token, node);
|
|
|
|
|
- child.set(token, newNode);
|
|
|
|
|
- node = newNode;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- return false;
|
|
|
|
|
- };
|
|
|
|
|
-
|
|
|
|
|
- // When walkHostnameTokens returns true, we should skip the rest
|
|
|
|
|
- if (walkHostnameTokens(suffix, onToken, hostnameFromIndex)) {
|
|
|
|
|
- return;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- // if same entry has been added before, skip
|
|
|
|
|
- if (getBit(node[0], START)) {
|
|
|
|
|
- return;
|
|
|
|
|
- }
|
|
|
|
|
-
|
|
|
|
|
- this.$size++;
|
|
|
|
|
-
|
|
|
|
|
- node[0] = setBit(node[0], START);
|
|
|
|
|
- if (includeAllSubdomain) {
|
|
|
|
|
- node[0] = setBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- } else {
|
|
|
|
|
- node[0] = deleteBit(node[0], INCLUDE_ALL_SUBDOMAIN);
|
|
|
|
|
- }
|
|
|
|
|
- node[4] = meta!;
|
|
|
|
|
- }
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
-// function deepEqualArray(a: string[], b: string[]) {
|
|
|
|
|
-// let len = a.length;
|
|
|
|
|
-// if (len !== b.length) return false;
|
|
|
|
|
-// while (len--) {
|
|
|
|
|
-// if (a[len] !== b[len]) return false;
|
|
|
|
|
-// }
|
|
|
|
|
-// return true;
|
|
|
|
|
-// };
|
|
|
|
|
-
|
|
|
|
|
-function subStringEqual(needle: string, haystack: string, needleIndex = 0) {
|
|
|
|
|
- for (let i = 0, l = haystack.length; i < l; i++) {
|
|
|
|
|
- if (needle[i + needleIndex] !== haystack[i]) return false;
|
|
|
|
|
- }
|
|
|
|
|
- return true;
|
|
|
|
|
-}
|
|
|