@wener/common 2.0.2 → 2.0.5

package/lib/drain3/Drain.js

@@ -0,0 +1,356 @@
+import { LogCluster } from "./LogCluster.js";
+import { Node } from "./Node.js";
+/**
+ * Simple LRU cache using Map iteration order.
+ * Map preserves insertion order; re-inserting a key moves it to the end.
+ */ let SimpleLRU = class SimpleLRU {
+    max;
+    map = new Map();
+    constructor(max) {
+        this.max = max;
+    }
+    get(key) {
+        const value = this.map.get(key);
+        if (value !== undefined) {
+            // Move to end (most recently used)
+            this.map.delete(key);
+            this.map.set(key, value);
+        }
+        return value;
+    }
+    set(key, value) {
+        if (this.map.has(key)) {
+            this.map.delete(key);
+        }
+        else if (this.map.size >= this.max) {
+            // Evict oldest (first key)
+            const first = this.map.keys().next().value;
+            if (first !== undefined) {
+                this.map.delete(first);
+            }
+        }
+        this.map.set(key, value);
+    }
+    values() {
+        return this.map.values();
+    }
+};
+function isSliceEqual(a, b) {
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+function hasNumbers(s) {
+    return /\d/.test(s);
+}
+/**
+ * Core Drain algorithm for log clustering.
+ *
+ * Drain is an online log parsing algorithm that groups log messages into clusters
+ * based on their structural similarity, extracting templates by parameterizing
+ * variable parts of the logs.
+ */ export class Drain {
+    logClusterDepth;
+    maxNodeDepth;
+    simTh;
+    maxChildren;
+    rootNode;
+    maxClusters;
+    extraDelimiters;
+    paramStr;
+    parametrizeNumericTokens;
+    idToCluster;
+    clustersCounter = 0;
+    constructor(options = {}) {
+        this.logClusterDepth = options.logClusterDepth ?? 4;
+        this.simTh = options.simTh ?? 0.4;
+        this.maxChildren = options.maxChildren ?? 100;
+        this.maxClusters = options.maxClusters ?? 1000;
+        this.extraDelimiters = options.extraDelimiters ?? [];
+        this.paramStr = options.paramStr ?? "<*>";
+        this.parametrizeNumericTokens = options.parametrizeNumericTokens ?? true;
+        if (this.logClusterDepth < 3) {
+            throw new Error("depth argument must be at least 3");
+        }
+        this.maxNodeDepth = this.logClusterDepth - 2;
+        this.rootNode = Node.newNode();
+        this.idToCluster = new SimpleLRU(this.maxClusters);
+    }
+    addLogMessage(content) {
+        const contentTokens = this.getContentAsTokens(content);
+        const matchCluster = this.treeSearch(this.rootNode, contentTokens, this.simTh, false);
+        let updateType = "none";
+        if (matchCluster === null) {
+            this.clustersCounter++;
+            const clusterId = this.clustersCounter;
+            const cluster = new LogCluster(clusterId, contentTokens);
+            this.idToCluster.set(clusterId, cluster);
+            this.addSeqToPrefixTree(this.rootNode, cluster);
+            updateType = "created";
+            return {
+                cluster,
+                updateType
+            };
+        }
+        const newTemplateTokens = this.createTemplate(contentTokens, matchCluster.logTemplateTokens);
+        if (!isSliceEqual(newTemplateTokens, matchCluster.logTemplateTokens)) {
+            matchCluster.logTemplateTokens = newTemplateTokens;
+            updateType = "templateChanged";
+        }
+        matchCluster.size++;
+        // Touch cluster to update its position in the LRU cache
+        this.idToCluster.get(matchCluster.clusterId);
+        return {
+            cluster: matchCluster,
+            updateType
+        };
+    }
+    getContentAsTokens(content) {
+        let processed = content.trim();
+        for (const delimiter of this.extraDelimiters) {
+            processed = processed.replaceAll(delimiter, " ");
+        }
+        return processed.split(/\s+/).filter((token) => token.length > 0);
+    }
+    treeSearch(rootNode, tokens, simTh, includeParams) {
+        const tokenCount = tokens.length;
+        const firstNode = rootNode.keyToChildNode.get(tokenCount.toString());
+        if (firstNode === undefined)
+            return null;
+        if (tokenCount === 0) {
+            const firstClusterId = firstNode.clusterIds[0];
+            if (firstClusterId === undefined)
+                return null;
+            return this.idToCluster.get(firstClusterId) ?? null;
+        }
+        let currentNode = firstNode;
+        let currentNodeDepth = 1;
+        for (const token of tokens) {
+            if (currentNodeDepth >= this.maxNodeDepth || currentNodeDepth === tokenCount)
+                break;
+            const keyToChildNode = currentNode.keyToChildNode;
+            let nextNode = keyToChildNode.get(token);
+            if (nextNode === undefined) {
+                nextNode = keyToChildNode.get(this.paramStr);
+            }
+            if (nextNode === undefined)
+                return null;
+            currentNode = nextNode;
+            currentNodeDepth += 1;
+        }
+        return this.fastMatch(currentNode.clusterIds, tokens, simTh, includeParams);
+    }
+    fastMatch(clusterIds, tokens, simTh, includeParams) {
+        let maxSim = -1;
+        let maxParamCount = -1;
+        let maxCluster = null;
+        for (const clusterId of clusterIds) {
+            const cluster = this.idToCluster.get(clusterId);
+            if (cluster === undefined)
+                continue;
+            const [currentSim, paramCount] = this.getSeqDistance(cluster.logTemplateTokens, tokens, includeParams);
+            if (currentSim > maxSim || currentSim === maxSim && paramCount > maxParamCount) {
+                maxSim = currentSim;
+                maxParamCount = paramCount;
+                maxCluster = cluster;
+            }
+        }
+        return maxSim >= simTh ? maxCluster : null;
+    }
+    getSeqDistance(seq1, seq2, includeParams) {
+        if (seq1.length !== seq2.length) {
+            throw new Error(`seq1 length ${seq1.length} not equals to seq2 length ${seq2.length}`);
+        }
+        if (seq1.length === 0)
+            return [
+                1,
+                0
+            ];
+        let simTokens = 0;
+        let paramCount = 0;
+        for (let i = 0; i < seq1.length; i++) {
+            if (seq1[i] === this.paramStr) {
+                paramCount++;
+            }
+            else if (seq1[i] === seq2[i]) {
+                simTokens++;
+            }
+        }
+        if (includeParams)
+            simTokens += paramCount;
+        return [
+            simTokens / seq1.length,
+            paramCount
+        ];
+    }
+    addSeqToPrefixTree(rootNode, cluster) {
+        const tokenCount = cluster.logTemplateTokens.length;
+        const tokenCountStr = tokenCount.toString();
+        let firstLayerNode = rootNode.keyToChildNode.get(tokenCountStr);
+        if (firstLayerNode === undefined) {
+            firstLayerNode = Node.newNode();
+            rootNode.keyToChildNode.set(tokenCountStr, firstLayerNode);
+        }
+        let currentNode = firstLayerNode;
+        if (tokenCount === 0) {
+            currentNode.clusterIds = [
+                cluster.clusterId
+            ];
+            return;
+        }
+        let currentDepth = 1;
+        for (const token of cluster.logTemplateTokens) {
+            if (currentDepth >= this.maxNodeDepth || currentDepth >= tokenCount) {
+                const newClusterIds = [];
+                for (const clusterId of currentNode.clusterIds) {
+                    if (this.idToCluster.get(clusterId) !== undefined) {
+                        newClusterIds.push(clusterId);
+                    }
+                }
+                newClusterIds.push(cluster.clusterId);
+                currentNode.clusterIds = newClusterIds;
+                break;
+            }
+            if (!currentNode.keyToChildNode.has(token)) {
+                if (this.parametrizeNumericTokens && hasNumbers(token)) {
+                    const node = currentNode.keyToChildNode.get(this.paramStr);
+                    if (node === undefined) {
+                        const newNode = Node.newNode();
+                        currentNode.keyToChildNode.set(this.paramStr, newNode);
+                        currentNode = newNode;
+                    }
+                    else {
+                        currentNode = node;
+                    }
+                }
+                else {
+                    const wildcardNode = currentNode.keyToChildNode.get(this.paramStr);
+                    if (wildcardNode !== undefined) {
+                        if (currentNode.keyToChildNode.size < this.maxChildren) {
+                            const newNode = Node.newNode();
+                            currentNode.keyToChildNode.set(token, newNode);
+                            currentNode = newNode;
+                        }
+                        else {
+                            currentNode = wildcardNode;
+                        }
+                    }
+                    else {
+                        if (currentNode.keyToChildNode.size + 1 < this.maxChildren) {
+                            const newNode = Node.newNode();
+                            currentNode.keyToChildNode.set(token, newNode);
+                            currentNode = newNode;
+                        }
+                        else if (currentNode.keyToChildNode.size + 1 === this.maxChildren) {
+                            const newNode = Node.newNode();
+                            currentNode.keyToChildNode.set(this.paramStr, newNode);
+                            currentNode = newNode;
+                        }
+                        else {
+                            currentNode = currentNode.keyToChildNode.get(this.paramStr);
+                        }
+                    }
+                }
+            }
+            else {
+                currentNode = currentNode.keyToChildNode.get(token);
+            }
+            currentDepth++;
+        }
+    }
+    createTemplate(seq1, seq2) {
+        if (seq1.length !== seq2.length) {
+            throw new Error(`seq1 length ${seq1.length} not equals to seq2 length ${seq2.length}`);
+        }
+        const retVal = [
+            ...seq2
+        ];
+        for (let i = 0; i < seq1.length; i++) {
+            if (seq1[i] !== seq2[i]) {
+                retVal[i] = this.paramStr;
+            }
+        }
+        return retVal;
+    }
+    match(content, strategy = "never") {
+        const requiredSimTh = 1;
+        const contentTokens = this.getContentAsTokens(content);
+        const fullSearch = () => {
+            const allIds = this.getClustersIdsForSeqLen(contentTokens.length);
+            return this.fastMatch(allIds, contentTokens, requiredSimTh, true);
+        };
+        if (strategy === "always")
+            return fullSearch();
+        const matchCluster = this.treeSearch(this.rootNode, contentTokens, requiredSimTh, true);
+        if (matchCluster !== null)
+            return matchCluster;
+        if (strategy === "never")
+            return null;
+        return fullSearch();
+    }
+    getClustersIdsForSeqLen(seqLen) {
+        const appendClusterRecursive = (node, idListToFill) => {
+            idListToFill.push(...node.clusterIds);
+            for (const childNode of node.keyToChildNode.values()) {
+                appendClusterRecursive(childNode, idListToFill);
+            }
+        };
+        const currentNode = this.rootNode.keyToChildNode.get(seqLen.toString());
+        if (currentNode === undefined)
+            return [];
+        const target = [];
+        appendClusterRecursive(currentNode, target);
+        return target;
+    }
+    getClusters() {
+        return [
+            ...this.idToCluster.values()
+        ];
+    }
+    toJSON() {
+        return {
+            logClusterDepth: this.logClusterDepth,
+            maxNodeDepth: this.maxNodeDepth,
+            simTh: this.simTh,
+            maxChildren: this.maxChildren,
+            rootNode: this.rootNode.toJSON(),
+            maxClusters: this.maxClusters,
+            extraDelimiters: [
+                ...this.extraDelimiters
+            ],
+            paramStr: this.paramStr,
+            parametrizeNumericTokens: this.parametrizeNumericTokens,
+            clusters: this.getClusters().map((c) => c.toJSON()),
+            clustersCounter: this.clustersCounter
+        };
+    }
+    static fromJSON(data) {
+        const drain = new Drain({
+            logClusterDepth: data.logClusterDepth,
+            simTh: data.simTh,
+            maxChildren: data.maxChildren,
+            maxClusters: data.maxClusters,
+            extraDelimiters: data.extraDelimiters,
+            paramStr: data.paramStr,
+            parametrizeNumericTokens: data.parametrizeNumericTokens
+        });
+        drain.rootNode.keyToChildNode.clear();
+        drain.rootNode.clusterIds = [];
+        const rootNode = Node.fromJSON(data.rootNode);
+        for (const [key, node] of rootNode.keyToChildNode) {
+            drain.rootNode.keyToChildNode.set(key, node);
+        }
+        drain.rootNode.clusterIds = rootNode.clusterIds;
+        for (const clusterData of data.clusters) {
+            const cluster = LogCluster.fromJSON(clusterData);
+            drain.idToCluster.set(cluster.clusterId, cluster);
+        }
+        drain.clustersCounter = data.clustersCounter;
+        return drain;
+    }
+}
+//# sourceMappingURL=Drain.js.map

package/lib/drain3/Drain.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/drain3/Drain.ts"],"sourcesContent":["import { LogCluster } from './LogCluster';\nimport { Node } from './Node';\nimport type { ClusterUpdateType, DrainOptions, SearchStrategy } from './types';\n\n/**\n * Simple LRU cache using Map iteration order.\n * Map preserves insertion order; re-inserting a key moves it to the end.\n */\nclass SimpleLRU<K, V> {\n\tprivate readonly map = new Map<K, V>();\n\tconstructor(private readonly max: number) {}\n\n\tget(key: K): V | undefined {\n\t\tconst value = this.map.get(key);\n\t\tif (value !== undefined) {\n\t\t\t// Move to end (most recently used)\n\t\t\tthis.map.delete(key);\n\t\t\tthis.map.set(key, value);\n\t\t}\n\t\treturn value;\n\t}\n\n\tset(key: K, value: V): void {\n\t\tif (this.map.has(key)) {\n\t\t\tthis.map.delete(key);\n\t\t} else if (this.map.size >= this.max) {\n\t\t\t// Evict oldest (first key)\n\t\t\tconst first = this.map.keys().next().value;\n\t\t\tif (first !== undefined) {\n\t\t\t\tthis.map.delete(first);\n\t\t\t}\n\t\t}\n\t\tthis.map.set(key, value);\n\t}\n\n\tvalues(): IterableIterator<V> {\n\t\treturn this.map.values();\n\t}\n}\n\nfunction isSliceEqual<T>(a: T[], b: T[]): boolean {\n\tif (a.length !== b.length) return false;\n\tfor (let i = 0; i < a.length; i++) {\n\t\tif (a[i] !== b[i]) return false;\n\t}\n\treturn true;\n}\n\nfunction hasNumbers(s: string): boolean {\n\treturn /\\d/.test(s);\n}\n\n/**\n * Core Drain algorithm for log clustering.\n *\n * Drain is an online log parsing algorithm that groups log messages into clusters\n * based on their structural similarity, extracting templates by parameterizing\n * variable parts of the logs.\n */\nexport class Drain {\n\tpublic readonly logClusterDepth: number;\n\tpublic readonly maxNodeDepth: number;\n\tpublic readonly simTh: number;\n\tpublic readonly maxChildren: number;\n\tpublic readonly rootNode: Node;\n\tpublic readonly maxClusters: number;\n\tpublic readonly extraDelimiters: readonly string[];\n\tpublic readonly paramStr: string;\n\tpublic readonly parametrizeNumericTokens: boolean;\n\n\tprivate readonly idToCluster: SimpleLRU<number, LogCluster>;\n\tprivate clustersCounter: number = 0;\n\n\tconstructor(options: DrainOptions = {}) {\n\t\tthis.logClusterDepth = options.logClusterDepth ?? 4;\n\t\tthis.simTh = options.simTh ?? 0.4;\n\t\tthis.maxChildren = options.maxChildren ?? 100;\n\t\tthis.maxClusters = options.maxClusters ?? 1000;\n\t\tthis.extraDelimiters = options.extraDelimiters ?? [];\n\t\tthis.paramStr = options.paramStr ?? '<*>';\n\t\tthis.parametrizeNumericTokens = options.parametrizeNumericTokens ?? true;\n\n\t\tif (this.logClusterDepth < 3) {\n\t\t\tthrow new Error('depth argument must be at least 3');\n\t\t}\n\n\t\tthis.maxNodeDepth = this.logClusterDepth - 2;\n\t\tthis.rootNode = Node.newNode();\n\t\tthis.idToCluster = new SimpleLRU<number, LogCluster>(this.maxClusters);\n\t}\n\n\taddLogMessage(content: string): { cluster: LogCluster; updateType: ClusterUpdateType } {\n\t\tconst contentTokens = this.getContentAsTokens(content);\n\t\tconst matchCluster = this.treeSearch(this.rootNode, contentTokens, this.simTh, false);\n\n\t\tlet updateType: ClusterUpdateType = 'none';\n\n\t\tif (matchCluster === null) {\n\t\t\tthis.clustersCounter++;\n\t\t\tconst clusterId = this.clustersCounter;\n\t\t\tconst cluster = new LogCluster(clusterId, contentTokens);\n\t\t\tthis.idToCluster.set(clusterId, cluster);\n\t\t\tthis.addSeqToPrefixTree(this.rootNode, cluster);\n\t\t\tupdateType = 'created';\n\t\t\treturn { cluster, updateType };\n\t\t}\n\n\t\tconst newTemplateTokens = this.createTemplate(contentTokens, matchCluster.logTemplateTokens);\n\n\t\tif (!isSliceEqual(newTemplateTokens, matchCluster.logTemplateTokens)) {\n\t\t\tmatchCluster.logTemplateTokens = newTemplateTokens;\n\t\t\tupdateType = 'templateChanged';\n\t\t}\n\n\t\tmatchCluster.size++;\n\n\t\t// Touch cluster to update its position in the LRU cache\n\t\tthis.idToCluster.get(matchCluster.clusterId);\n\n\t\treturn { cluster: matchCluster, updateType };\n\t}\n\n\tgetContentAsTokens(content: string): string[] {\n\t\tlet processed = content.trim();\n\t\tfor (const delimiter of this.extraDelimiters) {\n\t\t\tprocessed = processed.replaceAll(delimiter, ' ');\n\t\t}\n\t\treturn processed.split(/\\s+/).filter((token) => token.length > 0);\n\t}\n\n\tprivate treeSearch(rootNode: Node, tokens: string[], simTh: number, includeParams: boolean): LogCluster | null {\n\t\tconst tokenCount = tokens.length;\n\t\tconst firstNode = rootNode.keyToChildNode.get(tokenCount.toString());\n\n\t\tif (firstNode === undefined) return null;\n\n\t\tif (tokenCount === 0) {\n\t\t\tconst firstClusterId = firstNode.clusterIds[0];\n\t\t\tif (firstClusterId === undefined) return null;\n\t\t\treturn this.idToCluster.get(firstClusterId) ?? null;\n\t\t}\n\n\t\tlet currentNode: Node = firstNode;\n\t\tlet currentNodeDepth = 1;\n\t\tfor (const token of tokens) {\n\t\t\tif (currentNodeDepth >= this.maxNodeDepth || currentNodeDepth === tokenCount) break;\n\n\t\t\tconst keyToChildNode: Map<string, Node> = currentNode.keyToChildNode;\n\t\t\tlet nextNode: Node | undefined = keyToChildNode.get(token);\n\t\t\tif (nextNode === undefined) {\n\t\t\t\tnextNode = keyToChildNode.get(this.paramStr);\n\t\t\t}\n\t\t\tif (nextNode === undefined) return null;\n\n\t\t\tcurrentNode = nextNode;\n\t\t\tcurrentNodeDepth += 1;\n\t\t}\n\n\t\treturn this.fastMatch(currentNode.clusterIds, tokens, simTh, includeParams);\n\t}\n\n\tprivate fastMatch(clusterIds: number[], tokens: string[], simTh: number, includeParams: boolean): LogCluster | null {\n\t\tlet maxSim = -1;\n\t\tlet maxParamCount = -1;\n\t\tlet maxCluster: LogCluster | null = null;\n\n\t\tfor (const clusterId of clusterIds) {\n\t\t\tconst cluster = this.idToCluster.get(clusterId);\n\t\t\tif (cluster === undefined) continue;\n\n\t\t\tconst [currentSim, paramCount] = this.getSeqDistance(cluster.logTemplateTokens, tokens, includeParams);\n\n\t\t\tif (currentSim > maxSim || (currentSim === maxSim && paramCount > maxParamCount)) {\n\t\t\t\tmaxSim = currentSim;\n\t\t\t\tmaxParamCount = paramCount;\n\t\t\t\tmaxCluster = cluster;\n\t\t\t}\n\t\t}\n\n\t\treturn maxSim >= simTh ? maxCluster : null;\n\t}\n\n\tprivate getSeqDistance(seq1: string[], seq2: string[], includeParams: boolean): [number, number] {\n\t\tif (seq1.length !== seq2.length) {\n\t\t\tthrow new Error(`seq1 length ${seq1.length} not equals to seq2 length ${seq2.length}`);\n\t\t}\n\n\t\tif (seq1.length === 0) return [1, 0];\n\n\t\tlet simTokens = 0;\n\t\tlet paramCount = 0;\n\n\t\tfor (let i = 0; i < seq1.length; i++) {\n\t\t\tif (seq1[i] === this.paramStr) {\n\t\t\t\tparamCount++;\n\t\t\t} else if (seq1[i] === seq2[i]) {\n\t\t\t\tsimTokens++;\n\t\t\t}\n\t\t}\n\n\t\tif (includeParams) simTokens += paramCount;\n\n\t\treturn [simTokens / seq1.length, paramCount];\n\t}\n\n\tprivate addSeqToPrefixTree(rootNode: Node, cluster: LogCluster): void {\n\t\tconst tokenCount = cluster.logTemplateTokens.length;\n\t\tconst tokenCountStr = tokenCount.toString();\n\t\tlet firstLayerNode = rootNode.keyToChildNode.get(tokenCountStr);\n\t\tif (firstLayerNode === undefined) {\n\t\t\tfirstLayerNode = Node.newNode();\n\t\t\trootNode.keyToChildNode.set(tokenCountStr, firstLayerNode);\n\t\t}\n\n\t\tlet currentNode = firstLayerNode;\n\n\t\tif (tokenCount === 0) {\n\t\t\tcurrentNode.clusterIds = [cluster.clusterId];\n\t\t\treturn;\n\t\t}\n\n\t\tlet currentDepth = 1;\n\t\tfor (const token of cluster.logTemplateTokens) {\n\t\t\tif (currentDepth >= this.maxNodeDepth || currentDepth >= tokenCount) {\n\t\t\t\tconst newClusterIds: number[] = [];\n\t\t\t\tfor (const clusterId of currentNode.clusterIds) {\n\t\t\t\t\tif (this.idToCluster.get(clusterId) !== undefined) {\n\t\t\t\t\t\tnewClusterIds.push(clusterId);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnewClusterIds.push(cluster.clusterId);\n\t\t\t\tcurrentNode.clusterIds = newClusterIds;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (!currentNode.keyToChildNode.has(token)) {\n\t\t\t\tif (this.parametrizeNumericTokens && hasNumbers(token)) {\n\t\t\t\t\tconst node = currentNode.keyToChildNode.get(this.paramStr);\n\t\t\t\t\tif (node === undefined) {\n\t\t\t\t\t\tconst newNode = Node.newNode();\n\t\t\t\t\t\tcurrentNode.keyToChildNode.set(this.paramStr, newNode);\n\t\t\t\t\t\tcurrentNode = newNode;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurrentNode = node;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tconst wildcardNode = currentNode.keyToChildNode.get(this.paramStr);\n\t\t\t\t\tif (wildcardNode !== undefined) {\n\t\t\t\t\t\tif (currentNode.keyToChildNode.size < this.maxChildren) {\n\t\t\t\t\t\t\tconst newNode = Node.newNode();\n\t\t\t\t\t\t\tcurrentNode.keyToChildNode.set(token, newNode);\n\t\t\t\t\t\t\tcurrentNode = newNode;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tcurrentNode = wildcardNode;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (currentNode.keyToChildNode.size + 1 < this.maxChildren) {\n\t\t\t\t\t\t\tconst newNode = Node.newNode();\n\t\t\t\t\t\t\tcurrentNode.keyToChildNode.set(token, newNode);\n\t\t\t\t\t\t\tcurrentNode = newNode;\n\t\t\t\t\t\t} else if (currentNode.keyToChildNode.size + 1 === this.maxChildren) {\n\t\t\t\t\t\t\tconst newNode = Node.newNode();\n\t\t\t\t\t\t\tcurrentNode.keyToChildNode.set(this.paramStr, newNode);\n\t\t\t\t\t\t\tcurrentNode = newNode;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tcurrentNode = currentNode.keyToChildNode.get(this.paramStr)!;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcurrentNode = currentNode.keyToChildNode.get(token)!;\n\t\t\t}\n\n\t\t\tcurrentDepth++;\n\t\t}\n\t}\n\n\tprivate createTemplate(seq1: string[], seq2: string[]): string[] {\n\t\tif (seq1.length !== seq2.length) {\n\t\t\tthrow new Error(`seq1 length ${seq1.length} not equals to seq2 length ${seq2.length}`);\n\t\t}\n\t\tconst retVal = [...seq2];\n\t\tfor (let i = 0; i < seq1.length; i++) {\n\t\t\tif (seq1[i] !== seq2[i]) {\n\t\t\t\tretVal[i] = this.paramStr;\n\t\t\t}\n\t\t}\n\t\treturn retVal;\n\t}\n\n\tmatch(content: string, strategy: SearchStrategy = 'never'): LogCluster | null {\n\t\tconst requiredSimTh = 1.0;\n\t\tconst contentTokens = this.getContentAsTokens(content);\n\n\t\tconst fullSearch = (): LogCluster | null => {\n\t\t\tconst allIds = this.getClustersIdsForSeqLen(contentTokens.length);\n\t\t\treturn this.fastMatch(allIds, contentTokens, requiredSimTh, true);\n\t\t};\n\n\t\tif (strategy === 'always') return fullSearch();\n\n\t\tconst matchCluster = this.treeSearch(this.rootNode, contentTokens, requiredSimTh, true);\n\t\tif (matchCluster !== null) return matchCluster;\n\n\t\tif (strategy === 'never') return null;\n\n\t\treturn fullSearch();\n\t}\n\n\tprivate getClustersIdsForSeqLen(seqLen: number): number[] {\n\t\tconst appendClusterRecursive = (node: Node, idListToFill: number[]): void => {\n\t\t\tidListToFill.push(...node.clusterIds);\n\t\t\tfor (const childNode of node.keyToChildNode.values()) {\n\t\t\t\tappendClusterRecursive(childNode, idListToFill);\n\t\t\t}\n\t\t};\n\n\t\tconst currentNode = this.rootNode.keyToChildNode.get(seqLen.toString());\n\t\tif (currentNode === undefined) return [];\n\n\t\tconst target: number[] = [];\n\t\tappendClusterRecursive(currentNode, target);\n\t\treturn target;\n\t}\n\n\tgetClusters(): LogCluster[] {\n\t\treturn [...this.idToCluster.values()];\n\t}\n\n\ttoJSON() {\n\t\treturn {\n\t\t\tlogClusterDepth: this.logClusterDepth,\n\t\t\tmaxNodeDepth: this.maxNodeDepth,\n\t\t\tsimTh: this.simTh,\n\t\t\tmaxChildren: this.maxChildren,\n\t\t\trootNode: this.rootNode.toJSON(),\n\t\t\tmaxClusters: this.maxClusters,\n\t\t\textraDelimiters: [...this.extraDelimiters],\n\t\t\tparamStr: this.paramStr,\n\t\t\tparametrizeNumericTokens: this.parametrizeNumericTokens,\n\t\t\tclusters: this.getClusters().map((c) => c.toJSON()),\n\t\t\tclustersCounter: this.clustersCounter,\n\t\t};\n\t}\n\n\tstatic fromJSON(data: {\n\t\tlogClusterDepth: number;\n\t\tmaxNodeDepth: number;\n\t\tsimTh: number;\n\t\tmaxChildren: number;\n\t\trootNode: {\n\t\t\tkeyToChildNode: Record<string, unknown>;\n\t\t\tclusterIds: number[];\n\t\t};\n\t\tmaxClusters: number;\n\t\textraDelimiters: string[];\n\t\tparamStr: string;\n\t\tparametrizeNumericTokens: boolean;\n\t\tclusters: Array<{\n\t\t\tclusterId: number;\n\t\t\tlogTemplateTokens: string[];\n\t\t\tsize: number;\n\t\t}>;\n\t\tclustersCounter: number;\n\t}): Drain {\n\t\tconst drain = new Drain({\n\t\t\tlogClusterDepth: data.logClusterDepth,\n\t\t\tsimTh: data.simTh,\n\t\t\tmaxChildren: data.maxChildren,\n\t\t\tmaxClusters: data.maxClusters,\n\t\t\textraDelimiters: data.extraDelimiters,\n\t\t\tparamStr: data.paramStr,\n\t\t\tparametrizeNumericTokens: data.parametrizeNumericTokens,\n\t\t});\n\n\t\tdrain.rootNode.keyToChildNode.clear();\n\t\tdrain.rootNode.clusterIds = [];\n\n\t\tconst rootNode = Node.fromJSON(data.rootNode);\n\t\tfor (const [key, node] of rootNode.keyToChildNode) {\n\t\t\tdrain.rootNode.keyToChildNode.set(key, node);\n\t\t}\n\t\tdrain.rootNode.clusterIds = rootNode.clusterIds;\n\n\t\tfor (const clusterData of data.clusters) {\n\t\t\tconst cluster = LogCluster.fromJSON(clusterData);\n\t\t\tdrain.idToCluster.set(cluster.clusterId, cluster);\n\t\t}\n\n\t\tdrain.clustersCounter = data.clustersCounter;\n\n\t\treturn drain;\n\t}\n}\n"],"names":["LogCluster","Node","SimpleLRU","map","Map","max","get","key","value","undefined","delete","set","has","size","first","keys","next","values","isSliceEqual","a","b","length","i","hasNumbers","s","test","Drain","logClusterDepth","maxNodeDepth","simTh","maxChildren","rootNode","maxClusters","extraDelimiters","paramStr","parametrizeNumericTokens","idToCluster","clustersCounter","options","Error","newNode","addLogMessage","content","contentTokens","getContentAsTokens","matchCluster","treeSearch","updateType","clusterId","cluster","addSeqToPrefixTree","newTemplateTokens","createTemplate","logTemplateTokens","processed","trim","delimiter","replaceAll","split","filter","token","tokens","includeParams","tokenCount","firstNode","keyToChildNode","toString","firstClusterId","clusterIds","currentNode","currentNodeDepth","nextNode","fastMatch","maxSim","maxParamCount","maxCluster","currentSim","paramCount","getSeqDistance","seq1","seq2","simTokens","tokenCountStr","firstLayerNode","currentDepth","newClusterIds","push","node","wildcardNode","retVal","match","strategy","requiredSimTh","fullSearch","allIds","getClustersIdsForSeqLen","seqLen","appendClusterRecursive","idListToFill","childNode","target","getClusters","toJSON","clusters","c","fromJSON","data","drain","clear","clusterData"],"mappings":"AAAA,SAASA,UAAU,QAAQ,eAAe;AAC1C,SAASC,IAAI,QAAQ,SAAS;AAG9B;;;CAGC,GACD,IAAA,AAAMC,YAAN,MAAMA;;IACYC,MAAM,IAAIC,MAAY;IACvC,YAAY,AAAiBC,GAAW,CAAE;aAAbA,MAAAA;IAAc;IAE3CC,IAAIC,GAAM,EAAiB;QAC1B,MAAMC,QAAQ,IAAI,CAACL,GAAG,CAACG,GAAG,CAACC;QAC3B,IAAIC,UAAUC,WAAW;YACxB,mCAAmC;YACnC,IAAI,CAACN,GAAG,CAACO,MAAM,CAACH;YAChB,IAAI,CAACJ,GAAG,CAACQ,GAAG,CAACJ,KAAKC;QACnB;QACA,OAAOA;IACR;IAEAG,IAAIJ,GAAM,EAAEC,KAAQ,EAAQ;QAC3B,IAAI,IAAI,CAACL,GAAG,CAACS,GAAG,CAACL,MAAM;YACtB,IAAI,CAACJ,GAAG,CAACO,MAAM,CAACH;QACjB,OAAO,IAAI,IAAI,CAACJ,GAAG,CAACU,IAAI,IAAI,IAAI,CAACR,GAAG,EAAE;YACrC,2BAA2B;YAC3B,MAAMS,QAAQ,IAAI,CAACX,GAAG,CAACY,IAAI,GAAGC,IAAI,GAAGR,KAAK;YAC1C,IAAIM,UAAUL,WAAW;gBACxB,IAAI,CAACN,GAAG,CAACO,MAAM,CAACI;YACjB;QACD;QACA,IAAI,CAACX,GAAG,CAACQ,GAAG,CAACJ,KAAKC;IACnB;IAEAS,SAA8B;QAC7B,OAAO,IAAI,CAACd,GAAG,CAACc,MAAM;IACvB;AACD;AAEA,SAASC,aAAgBC,CAAM,EAAEC,CAAM;IACtC,IAAID,EAAEE,MAAM,KAAKD,EAAEC,MAAM,EAAE,OAAO;IAClC,IAAK,IAAIC,IAAI,GAAGA,IAAIH,EAAEE,MAAM,EAAEC,IAAK;QAClC,IAAIH,CAAC,CAACG,EAAE,KAAKF,CAAC,CAACE,EAAE,EAAE,OAAO;IAC3B;IACA,OAAO;AACR;AAEA,SAASC,WAAWC,CAAS;IAC5B,OAAO,KAAKC,IAAI,CAACD;AAClB;AAEA;;;;;;CAMC,GACD,OAAO,MAAME;IACIC,gBAAwB;IACxBC,aAAqB;IACrBC,MAAc;IACdC,YAAoB;IACpBC,SAAe;IACfC,YAAoB;IACpBC,gBAAmC;IACnCC,SAAiB;IACjBC,yBAAkC;IAEjCC,YAA2C;IACpDC,kBAA0B,EAAE;IAEpC,YAAYC,UAAwB,CAAC,CAAC,CAAE;QACvC,IAAI,CAACX,eAAe,GAAGW,QAAQX,eAAe,IAAI;QAClD,IAAI,CAACE,KAAK,GAAGS,QAAQT,KAAK,IAAI;QAC9B,IAAI,CAACC,WAAW,GAAGQ,QAAQR,WAAW,IAAI;QAC1C,IAAI,CAACE,WAAW,GAAGM,QAAQN,WAAW,IAAI;QAC1C,IAAI,CAACC,eAAe,GAAGK,QAAQL,eAAe,IAAI,EAAE;QACpD,IAAI,CAACC,QAAQ,GAAGI,QAAQJ,QAAQ,IAAI;QACpC,IAAI,CAACC,wBAAwB,GAAGG,QAAQH,wBAAwB,IAAI;QAEpE,IAAI,IAAI,CAACR,eAAe,GAAG,GAAG;YAC7B,MAAM,IAAIY,MAAM;QACjB;QAEA,IAAI,CAACX,YAAY,GAAG,IAAI,CAACD,eAAe,GAAG;QAC3C,IAAI,CAACI,QAAQ,GAAG9B,KAAKuC,OAAO;QAC5B,IAAI,CAACJ,WAAW,GAAG,IAAIlC,UAA8B,IAAI,CAAC8B,WAAW;IACtE;IAEAS,cAAcC,OAAe,EAA0D;QACtF,MAAMC,gBAAgB,IAAI,CAACC,kBAAkB,CAACF;QAC9C,MAAMG,eAAe,IAAI,CAACC,UAAU,CAAC,IAAI,CAACf,QAAQ,EAAEY,eAAe,IAAI,CAACd,KAAK,EAAE;QAE/E,IAAIkB,aAAgC;QAEpC,IAAIF,iBAAiB,MAAM;YAC1B,IAAI,CAACR,eAAe;YACpB,MAAMW,YAAY,IAAI,CAACX,eAAe;YACtC,MAAMY,UAAU,IAAIjD,WAAWgD,WAAWL;YAC1C,IAAI,CAACP,WAAW,CAACzB,GAAG,CAACqC,WAAWC;YAChC,IAAI,CAACC,kBAAkB,CAAC,IAAI,CAACnB,QAAQ,EAAEkB;YACvCF,aAAa;YACb,OAAO;gBAAEE;gBAASF;YAAW;QAC9B;QAEA,MAAMI,oBAAoB,IAAI,CAACC,cAAc,CAACT,eAAeE,aAAaQ,iBAAiB;QAE3F,IAAI,CAACnC,aAAaiC,mBAAmBN,aAAaQ,iBAAiB,GAAG;YACrER,aAAaQ,iBAAiB,GAAGF;YACjCJ,aAAa;QACd;QAEAF,aAAahC,IAAI;QAEjB,wDAAwD;QACxD,IAAI,CAACuB,WAAW,CAAC9B,GAAG,CAACuC,aAAaG,SAAS;QAE3C,OAAO;YAAEC,SAASJ;YAAcE;QAAW;IAC5C;IAEAH,mBAAmBF,OAAe,EAAY;QAC7C,IAAIY,YAAYZ,QAAQa,IAAI;QAC5B,KAAK,MAAMC,aAAa,IAAI,CAACvB,eAAe,CAAE;YAC7CqB,YAAYA,UAAUG,UAAU,CAACD,WAAW;QAC7C;QACA,OAAOF,UAAUI,KAAK,CAAC,OAAOC,MAAM,CAAC,CAACC,QAAUA,MAAMvC,MAAM,GAAG;IAChE;IAEQyB,WAAWf,QAAc,EAAE8B,MAAgB,EAAEhC,KAAa,EAAEiC,aAAsB,EAAqB;QAC9G,MAAMC,aAAaF,OAAOxC,MAAM;QAChC,MAAM2C,YAAYjC,SAASkC,cAAc,CAAC3D,GAAG,CAACyD,WAAWG,QAAQ;QAEjE,IAAIF,cAAcvD,WAAW,OAAO;QAEpC,IAAIsD,eAAe,GAAG;YACrB,MAAMI,iBAAiBH,UAAUI,UAAU,CAAC,EAAE;YAC9C,IAAID,mBAAmB1D,WAAW,OAAO;YACzC,OAAO,IAAI,CAAC2B,WAAW,CAAC9B,GAAG,CAAC6D,mBAAmB;QAChD;QAEA,IAAIE,cAAoBL;QACxB,IAAIM,mBAAmB;QACvB,KAAK,MAAMV,SAASC,OAAQ;YAC3B,IAAIS,oBAAoB,IAAI,CAAC1C,YAAY,IAAI0C,qBAAqBP,YAAY;YAE9E,MAAME,iBAAoCI,YAAYJ,cAAc;YACpE,IAAIM,WAA6BN,eAAe3D,GAAG,CAACsD;YACpD,IAAIW,aAAa9D,WAAW;gBAC3B8D,WAAWN,eAAe3D,GAAG,CAAC,IAAI,CAAC4B,QAAQ;YAC5C;YACA,IAAIqC,aAAa9D,WAAW,OAAO;YAEnC4D,cAAcE;YACdD,oBAAoB;QACrB;QAEA,OAAO,IAAI,CAACE,SAAS,CAACH,YAAYD,UAAU,EAAEP,QAAQhC,OAAOiC;IAC9D;IAEQU,UAAUJ,UAAoB,EAAEP,MAAgB,EAAEhC,KAAa,EAAEiC,aAAsB,EAAqB;QACnH,IAAIW,SAAS,CAAC;QACd,IAAIC,gBAAgB,CAAC;QACrB,IAAIC,aAAgC;QAEpC,KAAK,MAAM3B,aAAaoB,WAAY;YACnC,MAAMnB,UAAU,IAAI,CAACb,WAAW,CAAC9B,GAAG,CAAC0C;YACrC,IAAIC,YAAYxC,WAAW;YAE3B,MAAM,CAACmE,YAAYC,WAAW,GAAG,IAAI,CAACC,cAAc,CAAC7B,QAAQI,iBAAiB,EAAEQ,QAAQC;YAExF,IAAIc,aAAaH,UAAWG,eAAeH,UAAUI,aAAaH,eAAgB;gBACjFD,SAASG;gBACTF,gBAAgBG;gBAChBF,aAAa1B;YACd;QACD;QAEA,OAAOwB,UAAU5C,QAAQ8C,aAAa;IACvC;IAEQG,eAAeC,IAAc,EAAEC,IAAc,EAAElB,aAAsB,EAAoB;QAChG,IAAIiB,KAAK1D,MAAM,KAAK2D,KAAK3D,MAAM,EAAE;YAChC,MAAM,IAAIkB,MAAM,CAAC,YAAY,EAAEwC,KAAK1D,MAAM,CAAC,2BAA2B,EAAE2D,KAAK3D,MAAM,EAAE;QACtF;QAEA,IAAI0D,KAAK1D,MAAM,KAAK,GAAG,OAAO;YAAC;YAAG;SAAE;QAEpC,IAAI4D,YAAY;QAChB,IAAIJ,aAAa;QAEjB,IAAK,IAAIvD,IAAI,GAAGA,IAAIyD,KAAK1D,MAAM,EAAEC,IAAK;YACrC,IAAIyD,IAAI,CAACzD,EAAE,KAAK,IAAI,CAACY,QAAQ,EAAE;gBAC9B2C;YACD,OAAO,IAAIE,IAAI,CAACzD,EAAE,KAAK0D,IAAI,CAAC1D,EAAE,EAAE;gBAC/B2D;YACD;QACD;QAEA,IAAInB,eAAemB,aAAaJ;QAEhC,OAAO;YAACI,YAAYF,KAAK1D,MAAM;YAAEwD;SAAW;IAC7C;IAEQ3B,mBAAmBnB,QAAc,EAAEkB,OAAmB,EAAQ;QACrE,MAAMc,aAAad,QAAQI,iBAAiB,CAAChC,MAAM;QACnD,MAAM6D,gBAAgBnB,WAAWG,QAAQ;QACzC,IAAIiB,iBAAiBpD,SAASkC,cAAc,CAAC3D,GAAG,CAAC4E;QACjD,IAAIC,mBAAmB1E,WAAW;YACjC0E,iBAAiBlF,KAAKuC,OAAO;YAC7BT,SAASkC,cAAc,CAACtD,GAAG,CAACuE,eAAeC;QAC5C;QAEA,IAAId,cAAcc;QAElB,IAAIpB,eAAe,GAAG;YACrBM,YAAYD,UAAU,GAAG;gBAACnB,QAAQD,SAAS;aAAC;YAC5C;QACD;QAEA,IAAIoC,eAAe;QACnB,KAAK,MAAMxB,SAASX,QAAQI,iBAAiB,CAAE;YAC9C,IAAI+B,gBAAgB,IAAI,CAACxD,YAAY,IAAIwD,gBAAgBrB,YAAY;gBACpE,MAAMsB,gBAA0B,EAAE;gBAClC,KAAK,MAAMrC,aAAaqB,YAAYD,UAAU,CAAE;oBAC/C,IAAI,IAAI,CAAChC,WAAW,CAAC9B,GAAG,CAAC0C,eAAevC,WAAW;wBAClD4E,cAAcC,IAAI,CAACtC;oBACpB;gBACD;gBACAqC,cAAcC,IAAI,CAACrC,QAAQD,SAAS;gBACpCqB,YAAYD,UAAU,GAAGiB;gBACzB;YACD;YAEA,IAAI,CAAChB,YAAYJ,cAAc,CAACrD,GAAG,CAACgD,QAAQ;gBAC3C,IAAI,IAAI,CAACzB,wBAAwB,IAAIZ,WAAWqC,QAAQ;oBACvD,MAAM2B,OAAOlB,YAAYJ,cAAc,CAAC3D,GAAG,CAAC,IAAI,CAAC4B,QAAQ;oBACzD,IAAIqD,SAAS9E,WAAW;wBACvB,MAAM+B,UAAUvC,KAAKuC,OAAO;wBAC5B6B,YAAYJ,cAAc,CAACtD,GAAG,CAAC,IAAI,CAACuB,QAAQ,EAAEM;wBAC9C6B,cAAc7B;oBACf,OAAO;wBACN6B,cAAckB;oBACf;gBACD,OAAO;oBACN,MAAMC,eAAenB,YAAYJ,cAAc,CAAC3D,GAAG,CAAC,IAAI,CAAC4B,QAAQ;oBACjE,IAAIsD,iBAAiB/E,WAAW;wBAC/B,IAAI4D,YAAYJ,cAAc,CAACpD,IAAI,GAAG,IAAI,CAACiB,WAAW,EAAE;4BACvD,MAAMU,UAAUvC,KAAKuC,OAAO;4BAC5B6B,YAAYJ,cAAc,CAACtD,GAAG,CAACiD,OAAOpB;4BACtC6B,cAAc7B;wBACf,OAAO;4BACN6B,cAAcmB;wBACf;oBACD,OAAO;wBACN,IAAInB,YAAYJ,cAAc,CAACpD,IAAI,GAAG,IAAI,IAAI,CAACiB,WAAW,EAAE;4BAC3D,MAAMU,UAAUvC,KAAKuC,OAAO;4BAC5B6B,YAAYJ,cAAc,CAACtD,GAAG,CAACiD,OAAOpB;4BACtC6B,cAAc7B;wBACf,OAAO,IAAI6B,YAAYJ,cAAc,CAACpD,IAAI,GAAG,MAAM,IAAI,CAACiB,WAAW,EAAE;4BACpE,MAAMU,UAAUvC,KAAKuC,OAAO;4BAC5B6B,YAAYJ,cAAc,CAACtD,GAAG,CAAC,IAAI,CAACuB,QAAQ,EAAEM;4BAC9C6B,cAAc7B;wBACf,OAAO;4BACN6B,cAAcA,YAAYJ,cAAc,CAAC3D,GAAG,CAAC,IAAI,CAAC4B,QAAQ;wBAC3D;oBACD;gBACD;YACD,OAAO;gBACNmC,cAAcA,YAAYJ,cAAc,CAAC3D,GAAG,CAACsD;YAC9C;YAEAwB;QACD;IACD;IAEQhC,eAAe2B,IAAc,EAAEC,IAAc,EAAY;QAChE,IAAID,KAAK1D,MAAM,KAAK2D,KAAK3D,MAAM,EAAE;YAChC,MAAM,IAAIkB,MAAM,CAAC,YAAY,EAAEwC,KAAK1D,MAAM,CAAC,2BAA2B,EAAE2D,KAAK3D,MAAM,EAAE;QACtF;QACA,MAAMoE,SAAS;eAAIT;SAAK;QACxB,IAAK,IAAI1D,IAAI,GAAGA,IAAIyD,KAAK1D,MAAM,EAAEC,IAAK;YACrC,IAAIyD,IAAI,CAACzD,EAAE,KAAK0D,IAAI,CAAC1D,EAAE,EAAE;gBACxBmE,MAAM,CAACnE,EAAE,GAAG,IAAI,CAACY,QAAQ;YAC1B;QACD;QACA,OAAOuD;IACR;IAEAC,MAAMhD,OAAe,EAAEiD,WAA2B,OAAO,EAAqB;QAC7E,MAAMC,gBAAgB;QACtB,MAAMjD,gBAAgB,IAAI,CAACC,kBAAkB,CAACF;QAE9C,MAAMmD,aAAa;YAClB,MAAMC,SAAS,IAAI,CAACC,uBAAuB,CAACpD,cAActB,MAAM;YAChE,OAAO,IAAI,CAACmD,SAAS,CAACsB,QAAQnD,eAAeiD,eAAe;QAC7D;QAEA,IAAID,aAAa,UAAU,OAAOE;QAElC,MAAMhD,eAAe,IAAI,CAACC,UAAU,CAAC,IAAI,CAACf,QAAQ,EAAEY,eAAeiD,eAAe;QAClF,IAAI/C,iBAAiB,MAAM,OAAOA;QAElC,IAAI8C,aAAa,SAAS,OAAO;QAEjC,OAAOE;IACR;IAEQE,wBAAwBC,MAAc,EAAY;QACzD,MAAMC,yBAAyB,CAACV,MAAYW;YAC3CA,aAAaZ,IAAI,IAAIC,KAAKnB,UAAU;YACpC,KAAK,MAAM+B,aAAaZ,KAAKtB,cAAc,CAAChD,MAAM,GAAI;gBACrDgF,uBAAuBE,WAAWD;YACnC;QACD;QAEA,MAAM7B,cAAc,IAAI,CAACtC,QAAQ,CAACkC,cAAc,CAAC3D,GAAG,CAAC0F,OAAO9B,QAAQ;QACpE,IAAIG,gBAAgB5D,WAAW,OAAO,EAAE;QAExC,MAAM2F,SAAmB,EAAE;QAC3BH,uBAAuB5B,aAAa+B;QACpC,OAAOA;IACR;IAEAC,cAA4B;QAC3B,OAAO;eAAI,IAAI,CAACjE,WAAW,CAACnB,MAAM;SAAG;IACtC;IAEAqF,SAAS;QACR,OAAO;YACN3E,iBAAiB,IAAI,CAACA,eAAe;YACrCC,cAAc,IAAI,CAACA,YAAY;YAC/BC,OAAO,IAAI,CAACA,KAAK;YACjBC,aAAa,IAAI,CAACA,WAAW;YAC7BC,UAAU,IAAI,CAACA,QAAQ,CAACuE,MAAM;YAC9BtE,aAAa,IAAI,CAACA,WAAW;YAC7BC,iBAAiB;mBAAI,IAAI,CAACA,eAAe;aAAC;YAC1CC,UAAU,IAAI,CAACA,QAAQ;YACvBC,0BAA0B,IAAI,CAACA,wBAAwB;YACvDoE,UAAU,IAAI,CAACF,WAAW,GAAGlG,GAAG,CAAC,CAACqG,IAAMA,EAAEF,MAAM;YAChDjE,iBAAiB,IAAI,CAACA,eAAe;QACtC;IACD;IAEA,OAAOoE,SAASC,IAmBf,EAAS;QACT,MAAMC,QAAQ,IAAIjF,MAAM;YACvBC,iBAAiB+E,KAAK/E,eAAe;YACrCE,OAAO6E,KAAK7E,KAAK;YACjBC,aAAa4E,KAAK5E,WAAW;YAC7BE,aAAa0E,KAAK1E,WAAW;YAC7BC,iBAAiByE,KAAKzE,eAAe;YACrCC,UAAUwE,KAAKxE,QAAQ;YACvBC,0BAA0BuE,KAAKvE,wBAAwB;QACxD;QAEAwE,MAAM5E,QAAQ,CAACkC,cAAc,CAAC2C,KAAK;QACnCD,MAAM5E,QAAQ,CAACqC,UAAU,GAAG,EAAE;QAE9B,MAAMrC,WAAW9B,KAAKwG,QAAQ,CAACC,KAAK3E,QAAQ;QAC5C,KAAK,MAAM,CAACxB,KAAKgF,KAAK,IAAIxD,SAASkC,cAAc,CAAE;YAClD0C,MAAM5E,QAAQ,CAACkC,cAAc,CAACtD,GAAG,CAACJ,KAAKgF;QACxC;QACAoB,MAAM5E,QAAQ,CAACqC,UAAU,GAAGrC,SAASqC,UAAU;QAE/C,KAAK,MAAMyC,eAAeH,KAAKH,QAAQ,CAAE;YACxC,MAAMtD,UAAUjD,WAAWyG,QAAQ,CAACI;YACpCF,MAAMvE,WAAW,CAACzB,GAAG,CAACsC,QAAQD,SAAS,EAAEC;QAC1C;QAEA0D,MAAMtE,eAAe,GAAGqE,KAAKrE,eAAe;QAE5C,OAAOsE;IACR;AACD"}

package/lib/drain3/LogCluster.js

@@ -0,0 +1,38 @@
+/**
+ * Represents a cluster of similar log messages with a common template.
+ */ export class LogCluster {
+    clusterId;
+    logTemplateTokens;
+    size;
+    constructor(clusterId, logTemplateTokens, size = 1){
+        this.clusterId = clusterId;
+        this.logTemplateTokens = logTemplateTokens;
+        this.size = size;
+    }
+    /**
+	 * Returns the template as a space-separated string.
+	 */ getTemplate() {
+        return this.logTemplateTokens.join(' ');
+    }
+    /**
+	 * Returns a string representation of the cluster.
+	 */ toString() {
+        return `ID=${this.clusterId.toString().padEnd(5)} : size=${this.size.toString().padEnd(10)}: ${this.getTemplate()}`;
+    }
+    /**
+	 * Creates a LogCluster from JSON data.
+	 */ static fromJSON(data) {
+        return new LogCluster(data.clusterId, data.logTemplateTokens, data.size);
+    }
+    /**
+	 * Converts the cluster to JSON for serialization.
+	 */ toJSON() {
+        return {
+            clusterId: this.clusterId,
+            logTemplateTokens: this.logTemplateTokens,
+            size: this.size
+        };
+    }
+}
+
+//# sourceMappingURL=LogCluster.js.map

package/lib/drain3/LogCluster.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/drain3/LogCluster.ts"],"sourcesContent":["/**\n * Represents a cluster of similar log messages with a common template.\n */\nexport class LogCluster {\n\tconstructor(\n\t\tpublic readonly clusterId: number,\n\t\tpublic logTemplateTokens: string[],\n\t\tpublic size: number = 1,\n\t) {}\n\n\t/**\n\t * Returns the template as a space-separated string.\n\t */\n\tgetTemplate(): string {\n\t\treturn this.logTemplateTokens.join(' ');\n\t}\n\n\t/**\n\t * Returns a string representation of the cluster.\n\t */\n\ttoString(): string {\n\t\treturn `ID=${this.clusterId.toString().padEnd(5)} : size=${this.size.toString().padEnd(10)}: ${this.getTemplate()}`;\n\t}\n\n\t/**\n\t * Creates a LogCluster from JSON data.\n\t */\n\tstatic fromJSON(data: { clusterId: number; logTemplateTokens: string[]; size: number }): LogCluster {\n\t\treturn new LogCluster(data.clusterId, data.logTemplateTokens, data.size);\n\t}\n\n\t/**\n\t * Converts the cluster to JSON for serialization.\n\t */\n\ttoJSON(): {\n\t\tclusterId: number;\n\t\tlogTemplateTokens: string[];\n\t\tsize: number;\n\t} {\n\t\treturn {\n\t\t\tclusterId: this.clusterId,\n\t\t\tlogTemplateTokens: this.logTemplateTokens,\n\t\t\tsize: this.size,\n\t\t};\n\t}\n}\n"],"names":["LogCluster","clusterId","logTemplateTokens","size","getTemplate","join","toString","padEnd","fromJSON","data","toJSON"],"mappings":"AAAA;;CAEC,GACD,OAAO,MAAMA;;;;IACZ,YACC,AAAgBC,SAAiB,EACjC,AAAOC,iBAA2B,EAClC,AAAOC,OAAe,CAAC,CACtB;aAHeF,YAAAA;aACTC,oBAAAA;aACAC,OAAAA;IACL;IAEH;;EAEC,GACDC,cAAsB;QACrB,OAAO,IAAI,CAACF,iBAAiB,CAACG,IAAI,CAAC;IACpC;IAEA;;EAEC,GACDC,WAAmB;QAClB,OAAO,CAAC,GAAG,EAAE,IAAI,CAACL,SAAS,CAACK,QAAQ,GAAGC,MAAM,CAAC,GAAG,QAAQ,EAAE,IAAI,CAACJ,IAAI,CAACG,QAAQ,GAAGC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,CAACH,WAAW,IAAI;IACpH;IAEA;;EAEC,GACD,OAAOI,SAASC,IAAsE,EAAc;QACnG,OAAO,IAAIT,WAAWS,KAAKR,SAAS,EAAEQ,KAAKP,iBAAiB,EAAEO,KAAKN,IAAI;IACxE;IAEA;;EAEC,GACDO,SAIE;QACD,OAAO;YACNT,WAAW,IAAI,CAACA,SAAS;YACzBC,mBAAmB,IAAI,CAACA,iBAAiB;YACzCC,MAAM,IAAI,CAACA,IAAI;QAChB;IACD;AACD"}

package/lib/drain3/Node.js

@@ -0,0 +1,39 @@
+/**
+ * Represents a node in the prefix tree used by Drain algorithm.
+ */ export class Node {
+    /**
+	 * Map of token keys to child nodes.
+	 */ keyToChildNode = new Map();
+    /**
+	 * List of cluster IDs associated with this node.
+	 */ clusterIds = [];
+    /**
+	 * Creates a new empty node.
+	 */ static newNode() {
+        return new Node();
+    }
+    /**
+	 * Converts the node to JSON for serialization.
+	 */ toJSON() {
+        const keyToChildNode = {};
+        for (const [key, node] of this.keyToChildNode){
+            keyToChildNode[key] = node.toJSON();
+        }
+        return {
+            keyToChildNode,
+            clusterIds: this.clusterIds
+        };
+    }
+    /**
+	 * Creates a Node from JSON data.
+	 */ static fromJSON(data) {
+        const node = new Node();
+        node.clusterIds = data.clusterIds;
+        for (const [key, childData] of Object.entries(data.keyToChildNode)){
+            node.keyToChildNode.set(key, Node.fromJSON(childData));
+        }
+        return node;
+    }
+}
+
+//# sourceMappingURL=Node.js.map

package/lib/drain3/Node.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/drain3/Node.ts"],"sourcesContent":["/**\n * Represents a node in the prefix tree used by Drain algorithm.\n */\nexport class Node {\n\t/**\n\t * Map of token keys to child nodes.\n\t */\n\tpublic readonly keyToChildNode: Map<string, Node> = new Map();\n\n\t/**\n\t * List of cluster IDs associated with this node.\n\t */\n\tpublic clusterIds: number[] = [];\n\n\t/**\n\t * Creates a new empty node.\n\t */\n\tstatic newNode(): Node {\n\t\treturn new Node();\n\t}\n\n\t/**\n\t * Converts the node to JSON for serialization.\n\t */\n\ttoJSON(): {\n\t\tkeyToChildNode: Record<string, unknown>;\n\t\tclusterIds: number[];\n\t} {\n\t\tconst keyToChildNode: Record<string, unknown> = {};\n\t\tfor (const [key, node] of this.keyToChildNode) {\n\t\t\tkeyToChildNode[key] = node.toJSON();\n\t\t}\n\t\treturn {\n\t\t\tkeyToChildNode,\n\t\t\tclusterIds: this.clusterIds,\n\t\t};\n\t}\n\n\t/**\n\t * Creates a Node from JSON data.\n\t */\n\tstatic fromJSON(data: { keyToChildNode: Record<string, unknown>; clusterIds: number[] }): Node {\n\t\tconst node = new Node();\n\t\tnode.clusterIds = data.clusterIds;\n\t\tfor (const [key, childData] of Object.entries(data.keyToChildNode)) {\n\t\t\tnode.keyToChildNode.set(\n\t\t\t\tkey,\n\t\t\t\tNode.fromJSON(childData as { keyToChildNode: Record<string, unknown>; clusterIds: number[] }),\n\t\t\t);\n\t\t}\n\t\treturn node;\n\t}\n}\n"],"names":["Node","keyToChildNode","Map","clusterIds","newNode","toJSON","key","node","fromJSON","data","childData","Object","entries","set"],"mappings":"AAAA;;CAEC,GACD,OAAO,MAAMA;IACZ;;EAEC,GACD,AAAgBC,iBAAoC,IAAIC,MAAM;IAE9D;;EAEC,GACD,AAAOC,aAAuB,EAAE,CAAC;IAEjC;;EAEC,GACD,OAAOC,UAAgB;QACtB,OAAO,IAAIJ;IACZ;IAEA;;EAEC,GACDK,SAGE;QACD,MAAMJ,iBAA0C,CAAC;QACjD,KAAK,MAAM,CAACK,KAAKC,KAAK,IAAI,IAAI,CAACN,cAAc,CAAE;YAC9CA,cAAc,CAACK,IAAI,GAAGC,KAAKF,MAAM;QAClC;QACA,OAAO;YACNJ;YACAE,YAAY,IAAI,CAACA,UAAU;QAC5B;IACD;IAEA;;EAEC,GACD,OAAOK,SAASC,IAAuE,EAAQ;QAC9F,MAAMF,OAAO,IAAIP;QACjBO,KAAKJ,UAAU,GAAGM,KAAKN,UAAU;QACjC,KAAK,MAAM,CAACG,KAAKI,UAAU,IAAIC,OAAOC,OAAO,CAACH,KAAKR,cAAc,EAAG;YACnEM,KAAKN,cAAc,CAACY,GAAG,CACtBP,KACAN,KAAKQ,QAAQ,CAACE;QAEhB;QACA,OAAOH;IACR;AACD"}