导出

Author: masx200

lfu-cache/MyLinkedList.ts

@@ -1,44 +1,45 @@
-import { DoublyLinkedList } from "../design-linked-list/DoublyLinkedList.ts";
-
-export class MyLinkedList<T = number> {
-    readonly #freq_list_head = DoublyLinkedList<T>();
-    readonly #freq_list_tail = DoublyLinkedList<T>();
-    constructor() {
-        this.#freq_list_head.next = this.#freq_list_tail;
-        this.#freq_list_tail.prev = this.#freq_list_head;
-    }
-    first_node() {
-        return this.#freq_list_head.next === this.#freq_list_tail
-            ? null
-            : this.#freq_list_head.next;
-    }
-    insert_First(node: DoublyLinkedList<T>): void {
-        this.insert_After(this.#freq_list_head, node);
-    }
-    remove_node(node: DoublyLinkedList<T>): void {
-        const prev = node.prev;
-        const next = node.next;
-        if (prev && next) {
-            prev.next = next;
-
-            next.prev = prev;
-        } else {
-            throw Error("next prev node not in list");
-        }
-    }
-    insert_After(
-        prev_node: DoublyLinkedList<T>,
-        new_node: DoublyLinkedList<T>
-    ): void {
-        const next = prev_node.next;
-        const prev = prev_node;
-        if (prev && next) {
-            prev.next = new_node;
-            new_node.prev = prev;
-            new_node.next = next;
-            next.prev = new_node;
-        } else {
-            throw Error("next prev_node not in list");
-        }
-    }
-}
+import { DoublyLinkedList } from "../design-linked-list/DoublyLinkedList.ts";
+
+export class MyLinkedList<T = number> {
+    readonly #freq_list_head = DoublyLinkedList<T>();
+    readonly #freq_list_tail = DoublyLinkedList<T>();
+    constructor() {
+        this.#freq_list_head.next = this.#freq_list_tail;
+        this.#freq_list_tail.prev = this.#freq_list_head;
+    }
+
+    first_node() {
+        return this.#freq_list_head.next === this.#freq_list_tail
+            ? null
+            : this.#freq_list_head.next;
+    }
+    insert_First(node: DoublyLinkedList<T>): void {
+        this.insert_After(this.#freq_list_head, node);
+    }
+    remove_node(node: DoublyLinkedList<T>): void {
+        const prev = node.prev;
+        const next = node.next;
+        if (prev && next) {
+            prev.next = next;
+
+            next.prev = prev;
+        } else {
+            throw Error("next prev node not in list");
+        }
+    }
+    insert_After(
+        prev_node: DoublyLinkedList<T>,
+        new_node: DoublyLinkedList<T>,
+    ): void {
+        const next = prev_node.next;
+        const prev = prev_node;
+        if (prev && next) {
+            prev.next = new_node;
+            new_node.prev = prev;
+            new_node.next = next;
+            next.prev = new_node;
+        } else {
+            throw Error("next prev_node not in list");
+        }
+    }
+}

lfu-cache/index.ts

@@ -95,8 +95,8 @@ class LFUCache {
         // debugger;
         if (!this.#has(key)) {
             if (this.#size === this.#capacity) {
-                const to_be_removed_key =
-                    this.#least_frequently_recently_used_key();
+                const to_be_removed_key = this
+                    .#least_frequently_recently_used_key();
                 if (typeof to_be_removed_key === "number") {
                     this.#delete(to_be_removed_key);
                 }

mod.ts

@@ -57,6 +57,7 @@ import { uniqueStraightLineEquation } from "./max-points-on-a-line/uniqueStraigh
 import { searchSegmentChildren } from "./my-calendar-ii/searchSegmentChildren.ts";
 import { searchSegmentLeaf } from "./my-calendar-ii/searchSegmentLeaf.ts";
 import { counter } from "./substring-with-concatenation-of-all-words/counter.ts";
+import { MyLinkedList } from "./lfu-cache/MyLinkedList.ts";
 export {
     TrieNode,
     TrieNodeCountWordsEqualTo,
@@ -95,3 +96,4 @@ export { cos, dot, norm };
 export { abs_bigint, searchSegmentChildren, searchSegmentLeaf };
 export { counter };
 export { Node as MultilevelDoublyLinkedListNode } from "./flatten-a-multilevel-doubly-linked-list/Node.ts";
+export { MyLinkedList };