Small cleanups and setup build script

README.md

@@ -185,7 +185,7 @@ key-value pairs.
 ### set
 
 ```typescript
-set(keys: K[], value: V): void
+set(keys: K[], value: V): this
 ```
 
 Inserts or updates a key-value pair in the trie.

fqueue.ts

@@ -126,7 +126,7 @@ class FQueue<T> {
   }
 
   *entries(): IterableIterator<[T, T]> {
-    for (const value of this[Symbol.iterator]()) {
+    for (const value of this) {
       yield [value, value];
     }
   }

lfu.ts

@@ -63,7 +63,7 @@ class LFU<K, V> {
   }
 
   *[Symbol.iterator](): IterableIterator<[K, V]> {
-    for (const key of this.#queue[Symbol.iterator]()) {
+    for (const key of this.#queue) {
       yield [key, this.#store.get(key)!];
     }
   }
@@ -73,7 +73,7 @@ class LFU<K, V> {
   }
 
   *values(): IterableIterator<V> {
-    for (const key of this.#queue[Symbol.iterator]()) {
+    for (const key of this.#queue) {
       yield this.#store.get(key)!;
     }
   }

list.ts

@@ -165,7 +165,7 @@ class LinkedList<T> {
   }
 
   *entities(): IterableIterator<[T, T]> {
-    for (const value of this[Symbol.iterator]()) {
+    for (const value of this) {
       yield [value, value];
     }
   }

queue.ts

@@ -58,7 +58,7 @@ class Queue<T> {
   }
 
   *[Symbol.iterator](): IterableIterator<T> {
-    for (const [value] of this.#store[Symbol.iterator]()) {
+    for (const [value] of this.#store) {
       yield value;
     }
   }
@@ -72,7 +72,7 @@ class Queue<T> {
   }
 
   *entries(): IterableIterator<[T, T]> {
-    for (const value of this[Symbol.iterator]()) {
+    for (const value of this) {
       yield [value, value];
     }
   }

scripts/build_npm.ts

@@ -3,35 +3,47 @@ import { build, emptyDir } from "https://deno.land/x/dnt@0.31.0/mod.ts";
 await emptyDir("./npm");
 
 await build({
-	entryPoints: ["./mod.ts"],
-	outDir: "./npm",
-	shims: {
-		// see JS docs for overview and more options
-		deno: {
-			test: "dev",
-		},
-	},
-	compilerOptions: {
-		lib: ["es2021", "dom"],
-	},
-	package: {
-		// package.json properties
-		name: "@denox/fnv1a",
-		version: Deno.args[0],
-		description: "FNV-1a non-cryptographic hash function.",
-		license: "MIT",
-		keywords: ["fnv1a", "hash", "hashing"],
-		repository: {
-			type: "git",
-			url: "git+https://github.com/claudiuandrei/fnv1a.git",
-		},
-		bugs: {
-			url: "https://github.com/claudiuandrei/fnv1a/issues",
-		},
-		engines: {
-			node: ">=11.0.0",
-		},
-	},
+  entryPoints: ["./mod.ts"],
+  outDir: "./npm",
+  shims: {
+    // see JS docs for overview and more options
+    deno: {
+      test: "dev",
+    },
+  },
+  compilerOptions: {
+    lib: ["es2021", "dom"],
+  },
+  package: {
+    // package.json properties
+    name: "@denox/cube",
+    version: Deno.args[0],
+    description: "Library of building blocks for TypeScript",
+    license: "MIT",
+    keywords: [
+      "heap",
+      "trie",
+      "linked list",
+      "stack",
+      "queue",
+      "buffer",
+      "frequency queue",
+      "LFU",
+      "LRU",
+      "pubsub",
+      "channel",
+    ],
+    repository: {
+      type: "git",
+      url: "git+https://github.com/claudiuandrei/cube.git",
+    },
+    bugs: {
+      url: "https://github.com/claudiuandrei/cube/issues",
+    },
+    engines: {
+      node: ">=11.0.0",
+    },
+  },
 });
 
 // post build steps

stack.ts

@@ -52,7 +52,7 @@ class Stack<T> {
   }
 
   *entries(): IterableIterator<[T, T]> {
-    for (const value of this[Symbol.iterator]()) {
+    for (const value of this) {
       yield [value, value];
     }
   }

trie.ts

@@ -112,7 +112,7 @@ class Trie<K, V> {
     return node;
   }
 
-  set(keys: K[], value: V): void {
+  set(keys: K[], value: V): this {
     // Start at the head
     let node = this.#head;
 
@@ -137,6 +137,9 @@ class Trie<K, V> {
 
     // Set the value on the value
     node[1] = value;
+
+    // Chain
+    return this;
   }
 
   get(keys: K[]): V | undefined {
@@ -233,13 +236,13 @@ class Trie<K, V> {
   }
 
   *keys(): IterableIterator<K[]> {
-    for (const [key] of this[Symbol.iterator]()) {
+    for (const [key] of this) {
       yield key;
     }
   }
 
   *values(): IterableIterator<V> {
-    for (const [, value] of this[Symbol.iterator]()) {
+    for (const [, value] of this) {
       yield value;
     }
   }

trie_test.ts

@@ -26,17 +26,15 @@ Deno.test("Trie Insertion - insert into empty trie", () => {
 
 Deno.test("Trie Insertion - insert multiple values", () => {
   const trie = new Trie<string, number>();
-  trie.set(["a"], 1);
-  trie.set(["b"], 2);
+  trie.set(["a"], 1).set(["b"], 2);
   assertEquals(trie.size, 2);
   assertEquals(trie.get(["a"]), 1);
   assertEquals(trie.get(["b"]), 2);
 });
 
 Deno.test("Trie Insertion - insert duplicate keys with different values", () => {
   const trie = new Trie<string, number>();
-  trie.set(["a"], 1);
-  trie.set(["a"], 2);
+  trie.set(["a"], 1).set(["a"], 2);
   assertEquals(trie.size, 1);
   assertEquals(trie.get(["a"]), 2);
 });
@@ -147,8 +145,7 @@ Deno.test("Trie Match - match with non-existing prefix", () => {
 
 Deno.test("Trie Match - match with existing prefix", () => {
   const trie = new Trie<string, number>();
-  trie.set(["a"], 1);
-  trie.set(["a", "b"], 2);
+  trie.set(["a"], 1).set(["a", "b"], 2);
   const entries = [...trie.match(["a", "b"])];
   assertEquals(entries.length, 2);
   assertEquals(entries[0], [["a"], 1]);
@@ -157,9 +154,7 @@ Deno.test("Trie Match - match with existing prefix", () => {
 
 Deno.test("Trie Match - match with common prefix", () => {
   const trie = new Trie<string, number>();
-  trie.set(["a", "b"], 1);
-  trie.set(["a", "b", "c"], 2);
-  trie.set(["a", "b", "c", "d"], 3);
+  trie.set(["a", "b"], 1).set(["a", "b", "c"], 2).set(["a", "b", "c", "d"], 3);
   const entries = [...trie.match(["a", "b", "c"])];
   assertEquals(entries.length, 2);
   assertEquals(entries[0], [["a", "b"], 1]);