From 7b6b14b1dc7f4a58626960ef43ca7e85a2295512 Mon Sep 17 00:00:00 2001
From: SukkaW <isukkaw@gmail.com>
Date: Tue, 5 Nov 2024 20:31:00 +0800
Subject: [PATCH] Perf: Aho-Corasick node uses extends

---
 Build/lib/aho-corasick.ts | 36 +++++++++++++++---------------------
 1 file changed, 15 insertions(+), 21 deletions(-)

diff --git a/Build/lib/aho-corasick.ts b/Build/lib/aho-corasick.ts
index 86922e09..d6d9f281 100644
--- a/Build/lib/aho-corasick.ts
+++ b/Build/lib/aho-corasick.ts
@@ -1,20 +1,14 @@
-const WORDEND = Symbol('wordEnd');
-const FAIL = Symbol('fail');
-
-type Node = Map<string, Node> & {
-  [WORDEND]: boolean,
-  [FAIL]: Node | undefined
-};
-
-function createNode(): Node {
-  const node = new Map<string, Node | undefined>() as Node;
-  node[WORDEND] = false;
-  node[FAIL] = undefined;
-  return node;
+class Node extends Map<string, Node> {
+  constructor(
+    public wordEnd: boolean,
+    public fail: Node | undefined
+  ) {
+    super();
+  }
 }
 
 function createKeywordFilter(keys: string[] | Set<string>) {
-  const root = createNode();
+  const root = new Node(false, undefined);
 
   // Create a trie with extra fields and information
   const put = (key: string) => {
@@ -28,7 +22,7 @@ function createKeywordFilter(keys: string[] | Set<string>) {
       if (node.has(char)) {
         node = node.get(char)!;
       } else {
-        const newNode = createNode();
+        const newNode = new Node(false, undefined);
         node.set(char, newNode);
         node = newNode;
       }
@@ -36,7 +30,7 @@ function createKeywordFilter(keys: string[] | Set<string>) {
 
     // If a new node is created, mark it as a word end when loop finish
     if (node !== root) {
-      node[WORDEND] = true;
+      node.wordEnd = true;
     }
   };
 
@@ -49,13 +43,13 @@ function createKeywordFilter(keys: string[] | Set<string>) {
     const beginNode = queue.pop()!;
 
     beginNode.forEach((node, char) => {
-      let failNode = beginNode[FAIL];
+      let failNode = beginNode.fail;
 
       while (failNode && !failNode.has(char)) {
-        failNode = failNode[FAIL];
+        failNode = failNode.fail;
       }
 
-      node[FAIL] = failNode ? failNode.get(char) : root;
+      node.fail = failNode ? failNode.get(char) : root;
 
       queue.push(node);
     });
@@ -70,12 +64,12 @@ function createKeywordFilter(keys: string[] | Set<string>) {
       const char = text[i];
 
       while (node && !node.has(char)) {
-        node = node[FAIL];
+        node = node.fail;
       }
 
       node = node ? node.get(char)! : root;
 
-      if (node[WORDEND]) {
+      if (node.wordEnd) {
         return true;
       }
     }