semantic-typescript 0.4.1 → 0.5.3

package/dist/set.js

@@ -11,6 +11,7 @@ export class HashSet {
             enumerable: true,
             configurable: true
         });
+        Object.freeze(this);
     }
     add(value) {
         this.map.set(value, true);

package/dist/symbol.d.ts

@@ -7,12 +7,5 @@ export declare let WindowCollectableSymbol: symbol;
 export declare let StatisticsSymbol: symbol;
 export declare let NumericStatisticsSymbol: symbol;
 export declare let BigIntStatisticsSymbol: symbol;
+export declare let AsyncCollectableSymbol: symbol;
 export declare let UnorderedCollectableSymbol: symbol;
-export declare let SemanticMapSymbol: symbol;
-export declare let HashMapSymbol: symbol;
-export declare let HashSetSymbol: symbol;
-export declare let TreeMapSymbol: symbol;
-export declare let TreeSetSymbol: symbol;
-export declare let BinaryNodeSymbol: symbol;
-export declare let ReadBlackNodeSymbol: symbol;
-export declare let HashableSymbol: symbol;

package/dist/symbol.js

@@ -7,12 +7,5 @@ export let WindowCollectableSymbol = Symbol.for("WindowCollectable");
 export let StatisticsSymbol = Symbol.for("Statistics");
 export let NumericStatisticsSymbol = Symbol.for("NumericStatistics");
 export let BigIntStatisticsSymbol = Symbol.for("BigIntStatistics");
+export let AsyncCollectableSymbol = Symbol.for("AsyncCollectable");
 export let UnorderedCollectableSymbol = Symbol.for("UnorderedCollectable");
-export let SemanticMapSymbol = Symbol.for("SemanticMap");
-export let HashMapSymbol = Symbol.for("HashMap");
-export let HashSetSymbol = Symbol.for("HashSet");
-export let TreeMapSymbol = Symbol.for("TreeMap");
-export let TreeSetSymbol = Symbol.for("TreeSet");
-export let BinaryNodeSymbol = Symbol.for("BinaryNode");
-export let ReadBlackNodeSymbol = Symbol.for("BlackAndRedNode");
-export let HashableSymbol = Symbol.for("hashable");

package/dist/tree.d.ts

@@ -0,0 +1,82 @@
+import { BinaryNode, RedBlackNode, type Node } from './node';
+import { Optional } from './optional';
+import { type Comparator } from './utility';
+export interface Tree<E, N extends Node<E, N>, T extends Tree<E, N, T>> extends Iterable<E> {
+    root(): Optional<N>;
+    isEmpty(): boolean;
+    size(): bigint;
+    height(): bigint;
+    depth(): bigint;
+    width(): bigint;
+    level(): bigint;
+    add(value: E): void;
+    remove(value: E): void;
+    contains(value: E): boolean;
+    find(value: E): Optional<N>;
+    preorder(): Generator<E>;
+    inorder(): Generator<E>;
+    postorder(): Generator<E>;
+    breadth(): Generator<E>;
+    toArray(): Array<E>;
+    toSet(): Set<E>;
+    sub(node: N): T;
+    prune(node: Node<E, N>): T;
+    merge(other: T): T;
+    [Symbol.iterator](): Iterator<E>;
+}
+export declare abstract class AbstractTree<E, N extends Node<E, N>, T extends Tree<E, N, T>> implements Tree<E, N, T> {
+    protected readonly Tree: symbol;
+    protected internal: bigint;
+    constructor();
+    abstract root(): Optional<N>;
+    isEmpty(): boolean;
+    size(): bigint;
+    abstract add(value: E): void;
+    abstract remove(value: E): void;
+    contains(value: E): boolean;
+    abstract find(value: E): Optional<N>;
+    abstract preorder(): Generator<E>;
+    abstract inorder(): Generator<E>;
+    abstract postorder(): Generator<E>;
+    abstract breadth(): Generator<E>;
+    toArray(): Array<E>;
+    toSet(): Set<E>;
+    abstract sub(node: N): T;
+    abstract prune(node: Node<E, N>): T;
+    abstract merge(other: T): T;
+    height(): bigint;
+    width(): bigint;
+    depth(): bigint;
+    level(): bigint;
+    abstract [Symbol.iterator](): Iterator<E>;
+}
+export declare abstract class BinaryTree<E, N extends BinaryNode<E, N>, T extends BinaryTree<E, N, T>> extends AbstractTree<E, N, T> {
+    protected readonly BinaryTree: symbol;
+    protected first: Optional<N>;
+    constructor();
+    constructor(root: Optional<N>);
+    root(): Optional<N>;
+    find(value: E): Optional<N>;
+    preorder(): Generator<E>;
+    inorder(): Generator<E>;
+    postorder(): Generator<E>;
+    isBalanced(): boolean;
+    isComplete(): boolean;
+    isFull(): boolean;
+    isPerfect(): boolean;
+    [Symbol.iterator](): Iterator<E>;
+}
+export declare class RedBlackTree<E> extends BinaryTree<E, RedBlackNode<E>, RedBlackTree<E>> {
+    protected readonly RedBlackTree: symbol;
+    protected comparator: Comparator<E>;
+    constructor();
+    constructor(root: Optional<RedBlackNode<E>>);
+    constructor(comparator: Comparator<E>);
+    constructor(root: Optional<RedBlackNode<E>>, comparator: Comparator<E>);
+    add(value: E): void;
+    remove(value: E): void;
+    breadth(): Generator<E>;
+    sub(node: RedBlackNode<E>): RedBlackTree<E>;
+    prune(node: Node<E, RedBlackNode<E>>): RedBlackTree<E>;
+    merge(other: RedBlackTree<E>): RedBlackTree<E>;
+}

package/dist/tree.js

@@ -0,0 +1,257 @@
+import { isFunction, isRedBlackNode } from './guard';
+import { useCompare } from './hook';
+import { BinaryNode, RedBlackNode } from './node';
+import { Optional } from './optional';
+import { BinaryTreeSymbol, TreeSymbol } from './symbol';
+import { validate } from './utility';
+export class AbstractTree {
+    Tree = TreeSymbol;
+    internal = 0n;
+    constructor() {
+    }
+    isEmpty() {
+        return this.root().isEmpty();
+    }
+    size() {
+        return this.internal;
+    }
+    contains(value) {
+        return this.find(value).isPresent();
+    }
+    toArray() {
+        return Array.from(this.preorder());
+    }
+    toSet() {
+        return new Set(this.preorder());
+    }
+    height() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().height();
+        }
+        return 0n;
+    }
+    width() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().width();
+        }
+        return 0n;
+    }
+    depth() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().depth();
+        }
+        return 0n;
+    }
+    level() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().level();
+        }
+        return 0n;
+    }
+}
+;
+export class BinaryTree extends AbstractTree {
+    BinaryTree = BinaryTreeSymbol;
+    first;
+    constructor(root = Optional.empty()) {
+        super();
+        this.first = root;
+    }
+    root() {
+        return this.first;
+    }
+    find(value) {
+        let root = this.root();
+        if (root.isPresent()) {
+            for (let node of root.get().preorder()) {
+                if (node.getElement() === value || Object.is(node.getElement(), value)) {
+                    return Optional.of(node);
+                }
+            }
+        }
+        return Optional.empty();
+    }
+    *preorder() {
+        let root = this.root();
+        if (root.isPresent()) {
+            for (let node of root.get().preorder()) {
+                let element = node.getElement();
+                if (validate(element) && element.isPresent()) {
+                    yield element.get();
+                }
+            }
+        }
+    }
+    *inorder() {
+        let root = this.root();
+        if (root.isPresent()) {
+            for (let node of root.get().inorder()) {
+                let element = node.getElement();
+                if (validate(element) && element.isPresent()) {
+                    yield element.get();
+                }
+            }
+        }
+    }
+    *postorder() {
+        let root = this.root();
+        if (root.isPresent()) {
+            for (let node of root.get().postorder()) {
+                let element = node.getElement();
+                if (validate(element) && element.isPresent()) {
+                    yield element.get();
+                }
+            }
+        }
+    }
+    isBalanced() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().isBanlanced();
+        }
+        return false;
+    }
+    isComplete() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().isComplete();
+        }
+        return false;
+    }
+    isFull() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().isFull();
+        }
+        return false;
+    }
+    isPerfect() {
+        let root = this.root();
+        if (root.isPresent()) {
+            return root.get().isPerfect();
+        }
+        return false;
+    }
+    *[Symbol.iterator]() {
+        yield* this.preorder();
+    }
+}
+;
+export class RedBlackTree extends BinaryTree {
+    RedBlackTree = Symbol("RedBlackTree");
+    comparator;
+    constructor(argument1, argument2) {
+        if (isFunction(argument1)) {
+            super();
+            this.comparator = argument1;
+        }
+        else if (isRedBlackNode(argument1)) {
+            super(argument1);
+            if (isFunction(argument2)) {
+                this.comparator = argument2;
+            }
+            else {
+                this.comparator = useCompare;
+            }
+        }
+        else {
+            throw new TypeError("Invalid arguments.");
+        }
+    }
+    add(value) {
+        let node = new RedBlackNode(value);
+        if (this.first.isEmpty()) {
+            this.first = Optional.of(node);
+        }
+        else {
+            this.first.get().compareAndLink(node);
+        }
+        this.internal++;
+    }
+    remove(value) {
+        let node = this.find(value);
+        if (node.isPresent()) {
+            node.get().detach();
+            node.get().fix();
+            this.internal--;
+        }
+    }
+    *breadth() {
+        let root = this.root();
+        if (root.isPresent()) {
+            let queue = [root.get()];
+            while (queue.length > 0) {
+                let node = queue.shift();
+                let element = node.getElement();
+                if (validate(element) && element.isPresent()) {
+                    yield element.get();
+                }
+                if (validate(node.getLeft()) && node.getRight().isPresent()) {
+                    queue.push(node.getLeft().get());
+                }
+                if (validate(node.getLeft()) && node.getLeft().isPresent()) {
+                    queue.push(node.getLeft().get());
+                }
+            }
+        }
+    }
+    sub(node) {
+        return new RedBlackTree(Optional.of(node));
+    }
+    prune(node) {
+        let tree = new RedBlackTree();
+        let queue = [node];
+        while (queue.length > 0) {
+            let node = queue.shift();
+            let element = node.getElement();
+            if (validate(element) && element.isPresent()) {
+                tree.add(element.get());
+            }
+            if (validate(node.getLeft()) && node.getLeft().isPresent()) {
+                queue.push(node.getLeft().get());
+            }
+            if (validate(node.getRight()) && node.getRight().isPresent()) {
+                queue.push(node.getRight().get());
+            }
+            return tree;
+        }
+        return tree;
+    }
+    merge(other) {
+        let tree = new RedBlackTree();
+        let queue = [this.root().get()];
+        while (queue.length > 0) {
+            let node = queue.shift();
+            let element = node.getElement();
+            if (validate(element) && element.isPresent()) {
+                tree.add(element.get());
+            }
+            if (validate(node.getLeft()) && node.getLeft().isPresent()) {
+                queue.push(node.getLeft().get());
+            }
+            if (validate(node.getRight()) && node.getRight().isPresent()) {
+                queue.push(node.getRight().get());
+            }
+        }
+        queue = [other.root().get()];
+        while (queue.length > 0) {
+            let node = queue.shift();
+            let element = node.getElement();
+            if (validate(element) && element.isPresent()) {
+                tree.add(element.get());
+            }
+            if (validate(node.getLeft()) && node.getLeft().isPresent()) {
+                queue.push(node.getLeft().get());
+            }
+            if (validate(node.getRight()) && node.getRight().isPresent()) {
+                queue.push(node.getRight().get());
+            }
+        }
+        return tree;
+    }
+}
+;

package/dist/utility.d.ts

@@ -1,5 +1,5 @@
 export type Invalid<T> = T extends null | undefined ? T : never;
-export type Valid<T> = T extends null | undefined ? never : T;
+export type Valid<T> = T extends (null | undefined) ? never : T;
 export type MaybeInvalid<T> = T | null | undefined;
 export type MaybeUndefined<T> = T | undefined;
 export type MaybeNull<T> = T | null;

package/package.json

@@ -6,7 +6,7 @@
     "url": "https://github.com/eloyhere"
   },
   "description": "A modern type-safe stream processing library inspired by JavaScript Generator, Java Stream, and MySQL Index. Supports lazy evaluation, async streams, statistics, and IO-like operations.",
-  "version": "0.4.1",
+  "version": "0.5.3",
   "type": "module",
   "readme": "readme.md",
   "main": "dist/index.js",