测试

Author: masx200

finding-mk-average/MultiRedBlackNode.ts

@@ -1,51 +1,72 @@
 import { Direction } from "https://deno.land/std@0.173.0/collections/binary_search_node.ts";
+import { RedBlackNode } from "https://deno.land/std@0.173.0/collections/red_black_node.ts";
 import RedBlackTreeExtended from "../dinner-plate-stacks/RedBlackTree.ts";
-import { MultiRedBlackNode } from "./MultiRedBlackNode.ts";
-
 
 export class MultiRedBlackTree<T> extends RedBlackTreeExtended<T> {
-    root: MultiRedBlackNode<T> | null = null;
-    getRoot(): MultiRedBlackNode<T> | null {
+    static node2count = new WeakMap<RedBlackNode<any>, number>();
+
+    static getCount(node: RedBlackNode<any>): number {
+        return MultiRedBlackTree.node2count.get(node) ?? 1;
+    }
+    root: RedBlackNode<T> | null = null;
+    getRoot(): RedBlackNode<T> | null {
         return this.root;
     }
-    findNode(value: T): MultiRedBlackNode<T> | null {
-        return super.findNode(value) as MultiRedBlackNode<T> | null;
+    findNode(value: T): RedBlackNode<T> | null {
+        return super.findNode(value) as RedBlackNode<T> | null;
     }
     remove(value: T): boolean {
         const node = this.findNode(value);
 
         if (!node) {
             return false;
         } else {
-            node.count--;
-            if (node.count <= 0) this.removeTreeNode(node);
+            // node.count--;
+            MultiRedBlackTree.node2count.set(
+                node,
+                (MultiRedBlackTree.node2count.get(node) ?? 1) - 1,
+            );
+            console.log("decrement", node);
+            // console.trace();
+            if ((MultiRedBlackTree.node2count.get(node) ?? 1) <= 0) {
+                // if (node.count <= 0) {
+                this.removeTreeNode(node);
+            }
             return true;
         }
     }
     insert(value: T): boolean {
         const node = this.findNode(value);
 
         if (node) {
-            node.count++;
+            // node.count++;
+            MultiRedBlackTree.node2count.set(
+                node,
+                (MultiRedBlackTree.node2count.get(node) ?? 1) + 1,
+            );
+            console.log("increment", node);
             return true;
         } else {
             this.insertGetNode(value);
         }
         return true;
     }
-    insertGetNode(value: T): MultiRedBlackNode<T> | null {
+    insertGetNode(value: T): RedBlackNode<T> | null {
         let node = this.insertNode(
-            MultiRedBlackNode,
-            value
-        ) as MultiRedBlackNode<T> | null;
+            RedBlackNode,
+            value,
+        ) as RedBlackNode<T> | null;
+        if (node) MultiRedBlackTree.node2count.set(node, 1);
+
         if (node) {
             while (node.parent?.red) {
-                let parent: MultiRedBlackNode<T> = node.parent!;
-                const parentDirection: Direction =
-                    parent.directionFromParent()!;
-                const uncleDirection: Direction =
-                    parentDirection === "right" ? "left" : "right";
-                const uncle: MultiRedBlackNode<T> | null =
+                let parent: RedBlackNode<T> = node.parent!;
+                const parentDirection: Direction = parent
+                    .directionFromParent()!;
+                const uncleDirection: Direction = parentDirection === "right"
+                    ? "left"
+                    : "right";
+                const uncle: RedBlackNode<T> | null =
                     parent.parent![uncleDirection] ?? null;
 
                 if (uncle?.red) {

finding-mk-average/MultiRedBlackTree.ts

@@ -2,7 +2,6 @@ import { reverseInOrderIterator } from "../dinner-plate-stacks/reverseInOrderIte
 import { InOrderIterator } from "./InOrderIterator.ts";
 import { MultiRedBlackTree } from "./MultiRedBlackTree.ts";
 
-
 class MKAverage {
     total = 0;
     m: number;
@@ -28,7 +27,7 @@ class MKAverage {
             {
                 const temp: [number, number][] = [];
                 for (const node of InOrderIterator(root)) {
-                    temp.push([node.value, node.count]);
+                    temp.push([node.value, MultiRedBlackTree.getCount(node)]);
                 }
                 console.log(JSON.stringify(temp));
             }
@@ -46,7 +45,7 @@ class MKAverage {
         {
             const temp: [number, number][] = [];
             for (const node of InOrderIterator(root)) {
-                temp.push([node.value, node.count]);
+                temp.push([node.value, MultiRedBlackTree.getCount(node)]);
             }
             console.log(JSON.stringify(temp));
         }
@@ -62,7 +61,7 @@ class MKAverage {
         {
             const temp: [number, number][] = [];
             for (const node of InOrderIterator(root)) {
-                temp.push([node.value, node.count]);
+                temp.push([node.value, MultiRedBlackTree.getCount(node)]);
             }
             console.log(JSON.stringify(temp));
         }
@@ -72,15 +71,15 @@ class MKAverage {
 
         for (const node of InOrderIterator(root)) {
             // console.log(node)
-            const min = Math.min(k, node.count);
+            const min = Math.min(k, MultiRedBlackTree.getCount(node));
             ret -= node.value * min;
             k -= min;
             if (k === 0) break;
         }
         k = this.k;
         for (const node of reverseInOrderIterator(root)) {
             // debugger;
-            const min = Math.min(k, node.count);
+            const min = Math.min(k, MultiRedBlackTree.getCount(node));
             ret -= node.value * min;
             k -= min;
             if (k === 0) break;