typescript-ds-lib 0.2.5 → 0.2.7

package/lib/red-black-tree.ts

@@ -0,0 +1,350 @@
+import { Comparator } from '../types';
+
+
+export interface RedBlackTree<K, V> {
+  insert(key: K, value: V): void;
+  remove(key: K): void;
+  find(key: K): V | undefined;
+  min(): V | undefined;
+  max(): V | undefined;
+  forEach(callback: (key: K, value: V) => void): void;
+  isEmpty(): boolean;
+  size(): number;
+  clear(): void;
+}
+
+
+enum Color {
+  RED,
+  BLACK
+}
+
+
+class RBNode<K, V> {
+  key: K;
+  value: V;
+  color: Color;
+  left: RBNode<K, V> | null;
+  right: RBNode<K, V> | null;
+  parent: RBNode<K, V> | null;
+
+  constructor(key: K, value: V) {
+    this.key = key;
+    this.value = value;
+    this.color = Color.RED;
+    this.left = null;
+    this.right = null;
+    this.parent = null;
+  }
+}
+
+
+export class RedBlackTree<K, V> implements RedBlackTree<K, V> {
+  private root: RBNode<K, V> | null;
+  private nodeCount: number;
+  private comparator: Comparator<K>;
+
+  constructor(comparator: Comparator<K> = (a: K, b: K) => a < b) {
+    this.root = null;
+    this.nodeCount = 0;
+    this.comparator = comparator;
+  }
+
+  private rotateLeft(node: RBNode<K, V>): void {
+    const rightChild = node.right!;
+    node.right = rightChild.left;
+    if (rightChild.left !== null) {
+      rightChild.left.parent = node;
+    }
+    rightChild.parent = node.parent;
+    if (node.parent === null) {
+      this.root = rightChild;
+    } else if (node === node.parent.left) {
+      node.parent.left = rightChild;
+    } else {
+      node.parent.right = rightChild;
+    }
+    rightChild.left = node;
+    node.parent = rightChild;
+  }
+
+  private rotateRight(node: RBNode<K, V>): void {
+    const leftChild = node.left!;
+    node.left = leftChild.right;
+    if (leftChild.right !== null) {
+      leftChild.right.parent = node;
+    }
+    leftChild.parent = node.parent;
+    if (node.parent === null) {
+      this.root = leftChild;
+    } else if (node === node.parent.right) {
+      node.parent.right = leftChild;
+    } else {
+      node.parent.left = leftChild;
+    }
+    leftChild.right = node;
+    node.parent = leftChild;
+  }
+
+  private fixInsert(node: RBNode<K, V>): void {
+    while (node !== this.root && node.parent?.color === Color.RED) {
+      if (node.parent === node.parent.parent?.left) {
+        const uncle = node.parent.parent.right;
+
+        if (uncle?.color === Color.RED) {
+          node.parent.color = Color.BLACK;
+          uncle.color = Color.BLACK;
+          node.parent.parent.color = Color.RED;
+          node = node.parent.parent;
+        } else {
+          if (node === node.parent.right) {
+            node = node.parent;
+            this.rotateLeft(node);
+          }
+          node.parent!.color = Color.BLACK;
+          node.parent!.parent!.color = Color.RED;
+          this.rotateRight(node.parent!.parent!);
+        }
+      } else {
+        const uncle = node.parent.parent?.left;
+        if (uncle?.color === Color.RED) {
+          node.parent.color = Color.BLACK;
+          uncle.color = Color.BLACK;
+          node.parent.parent!.color = Color.RED;
+          node = node.parent.parent!;
+        } else {
+          if (node === node.parent.left) {
+            node = node.parent;
+            this.rotateRight(node);
+          }
+          node.parent!.color = Color.BLACK;
+          node.parent!.parent!.color = Color.RED;
+          this.rotateLeft(node.parent!.parent!);
+        }
+      }
+    }
+    this.root!.color = Color.BLACK;
+  }
+
+  insert(key: K, value: V): void {
+    const newNode = new RBNode(key, value);
+    let parent: RBNode<K, V> | null = null;
+    let current = this.root;
+    while (current !== null) {
+      parent = current;
+      if (this.comparator(key, current.key)) {
+        current = current.left;
+      } else if (this.comparator(current.key, key)) {
+        current = current.right;
+      } else {
+        // Key already exists, update value
+        current.value = value;
+        return;
+      }
+    }
+
+    newNode.parent = parent;
+
+    if (parent === null) {
+      this.root = newNode;
+    } else if (this.comparator(key, parent.key)) {
+      parent.left = newNode;
+    } else {
+      parent.right = newNode;
+    }
+
+    this.nodeCount++;
+    this.fixInsert(newNode);
+  }
+
+  private findNode(key: K): RBNode<K, V> | null {
+    let current = this.root;
+    while (current !== null) {
+      if (this.isEqual(key, current.key)) {
+        return current;
+      }
+      current = this.comparator(key, current.key) ? current.left : current.right;
+    }
+    return null;
+  }
+
+  find(key: K): V | undefined {
+    const node = this.findNode(key);
+    return node ? node.value : undefined;
+  }
+
+  private findMinNode(node: RBNode<K, V>): RBNode<K, V> {
+    let current = node;
+    while (current.left !== null) {
+      current = current.left;
+    }
+    return current;
+  }
+
+  min(): V | undefined {
+    if (!this.root) return undefined;
+    return this.findMinNode(this.root).value;
+  }
+
+  private findMaxNode(node: RBNode<K, V>): RBNode<K, V> {
+    let current = node;
+    while (current.right !== null) {
+      current = current.right;
+    }
+    return current;
+  }
+
+  max(): V | undefined {
+    if (!this.root) return undefined;
+    return this.findMaxNode(this.root).value;
+  }
+
+  remove(key: K): void {
+    const node = this.findNode(key);
+    if (node) {
+      this.nodeCount--;
+      this.deleteNode(node);
+    }
+  }
+
+  private deleteNode(node: RBNode<K, V>): void {
+    let x: RBNode<K, V> | null;
+    let y = node;
+    let originalColor = y.color;
+
+    if (node.left === null) {
+      x = node.right;
+      this.transplant(node, node.right);
+    } else if (node.right === null) {
+      x = node.left;
+      this.transplant(node, node.left);
+    } else {
+      y = this.findMinNode(node.right);
+      originalColor = y.color;
+      x = y.right;
+
+      if (y.parent === node) {
+        if (x) x.parent = y;
+      } else {
+        this.transplant(y, y.right);
+        y.right = node.right;
+        y.right.parent = y;
+      }
+
+      this.transplant(node, y);
+      y.left = node.left;
+      y.left.parent = y;
+      y.color = node.color;
+    }
+
+    if (originalColor === Color.BLACK && x) {
+      this.fixDelete(x);
+    }
+  }
+
+  private transplant(u: RBNode<K, V>, v: RBNode<K, V> | null): void {
+    if (u.parent === null) {
+      this.root = v;
+    } else if (u === u.parent.left) {
+      u.parent.left = v;
+    } else {
+      u.parent.right = v;
+    }
+    if (v !== null) {
+      v.parent = u.parent;
+    }
+  }
+
+  private fixDelete(x: RBNode<K, V>): void {
+    while (x !== this.root && x.color === Color.BLACK) {
+      if (x === x.parent!.left) {
+        let w = x.parent!.right!;
+
+        if (w.color === Color.RED) {
+          w.color = Color.BLACK;
+          x.parent!.color = Color.RED;
+          this.rotateLeft(x.parent!);
+          w = x.parent!.right!;
+        }
+
+        if ((!w.left || w.left.color === Color.BLACK) &&
+          (!w.right || w.right.color === Color.BLACK)) {
+          w.color = Color.RED;
+          x = x.parent!;
+        } else {
+          if (!w.right || w.right.color === Color.BLACK) {
+            if (w.left) w.left.color = Color.BLACK;
+            w.color = Color.RED;
+            this.rotateRight(w);
+            w = x.parent!.right!;
+          }
+
+          w.color = x.parent!.color;
+          x.parent!.color = Color.BLACK;
+          if (w.right) w.right.color = Color.BLACK;
+          this.rotateLeft(x.parent!);
+          x = this.root!;
+        }
+      } else {
+        let w = x.parent!.left!;
+
+        if (w.color === Color.RED) {
+          w.color = Color.BLACK;
+          x.parent!.color = Color.RED;
+          this.rotateRight(x.parent!);
+          w = x.parent!.left!;
+        }
+
+        if ((!w.right || w.right.color === Color.BLACK) &&
+          (!w.left || w.left.color === Color.BLACK)) {
+          w.color = Color.RED;
+          x = x.parent!;
+        } else {
+          if (!w.left || w.left.color === Color.BLACK) {
+            if (w.right) w.right.color = Color.BLACK;
+            w.color = Color.RED;
+            this.rotateLeft(w);
+            w = x.parent!.left!;
+          }
+
+          w.color = x.parent!.color;
+          x.parent!.color = Color.BLACK;
+          if (w.left) w.left.color = Color.BLACK;
+          this.rotateRight(x.parent!);
+          x = this.root!;
+        }
+      }
+    }
+    x.color = Color.BLACK;
+  }
+
+  isEmpty(): boolean {
+    return this.root === null;
+  }
+
+  size(): number {
+    return this.nodeCount;
+  }
+
+  clear(): void {
+    this.root = null;
+    this.nodeCount = 0;
+  }
+
+  private isEqual(a: K, b: K): boolean {
+    // Two values are equal if neither is less than the other
+    return !this.comparator(a, b) && !this.comparator(b, a);
+  }
+
+  private inorderTraversal(node: RBNode<K, V> | null, callback: (key: K, value: V) => void): void {
+    if (node !== null) {
+      this.inorderTraversal(node.left, callback);
+      callback(node.key, node.value);
+      this.inorderTraversal(node.right, callback);
+    }
+  }
+
+  forEach(callback: (key: K, value: V) => void): void {
+    this.inorderTraversal(this.root, callback);
+  }
+}

package/lib/set.ts

@@ -0,0 +1,83 @@
+import { Comparator } from '../types';
+import { BinarySearchTree } from './binary-search-tree';
+
+
+export interface Set<T> {
+  insert(element: T): void;
+  insertList(elements: T[]): void;
+  remove(element: T): void;
+  find(element: T): boolean;
+  forEach(callback: (element: T) => void): void;
+  isEmpty(): boolean;
+  size(): number;
+  clear(): void;
+}
+
+
+export class Set<T> implements Set<T> {
+  private bst: BinarySearchTree<T>;
+
+  constructor(comparator: Comparator<T> = (a: T, b: T) => a < b) {
+    this.bst = new BinarySearchTree<T>(comparator);
+  }
+
+  /**
+   * Adds a value to the set if it's not already present
+   */
+  insert(value: T): void {
+    if (!this.find(value)) {
+      this.bst.insert(value);
+    }
+  }
+
+  /**
+   * Adds multiple values to the set if they're not already present
+   */
+  insertList(values: T[]): void {
+    for (const value of values) {
+      this.insert(value);
+    }
+  }
+
+  /**
+   * Checks if a value exists in the set
+   */
+  find(value: T): boolean {
+    return this.bst.find(value);
+  }
+
+  /**
+   * Removes a value from the set
+   */
+  remove(value: T): void {
+    this.bst.remove(value);
+  }
+
+  /**
+   * Executes a callback function for each element in the set
+   */
+  forEach(callback: (element: T) => void): void {
+    this.bst.forEach(callback);
+  }
+
+  /**
+   * Removes all elements from the set
+   */
+  clear(): void {
+    this.bst = new BinarySearchTree<T>();
+  }
+
+  /**
+   * Returns true if the set contains no elements
+   */
+  isEmpty(): boolean {
+    return this.bst.isEmpty();
+  }
+
+  /**
+   * Returns the number of elements in the set
+   */
+  size(): number {
+    return this.bst.count();
+  }
+}

package/lib/stack.ts

@@ -0,0 +1,59 @@
+export interface Stack<T> {
+  push(element: T): void;
+  pop(): T | undefined;
+  top(): T | undefined;
+  isEmpty(): boolean;
+  size(): number;
+  clear(): void;
+}
+
+
+export class Stack<T> implements Stack<T> {
+  private items: T[];
+
+  constructor() {
+    this.items = [];
+  }
+
+  /**
+   * Adds an element to the top of the stack.
+   */
+  push(element: T): void {
+    this.items.push(element);
+  }
+
+  /**
+   * Removes and returns the top element from the stack, or undefined if stack is empty.
+   */
+  pop(): T | undefined {
+    return this.items.pop();
+  }
+
+  /**
+   * Returns the top element of the stack without removing it, or undefined if stack is empty.
+   */
+  top(): T | undefined {
+    return this.items[this.items.length - 1];
+  }
+
+  /**
+   * Checks if the stack is empty. Returns true if the stack is empty, false otherwise.
+   */
+  isEmpty(): boolean {
+    return this.items.length === 0;
+  }
+
+  /**
+   * Returns the number of elements in the stack. The size of the stack
+   */
+  size(): number {
+    return this.items.length;
+  }
+
+  /**
+   * Removes all elements from the stack.
+   */
+  clear(): void {
+    this.items = [];
+  }
+}

package/package.json

@@ -1,17 +1,21 @@
 {
   "name": "typescript-ds-lib",
-  "version": "0.2.5",
+  "version": "0.2.7",
   "description": "A collection of TypeScript data structure implementations",
   "author": "Artiom Baloian <artiom.baloian@gmail.com>",
   "license": "MIT",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
   "files": [
-    "dist"
+    "dist",
+    "lib",
+    "types",
+    "README.md",
+    "LICENSE"
   ],
   "scripts": {
     "build": "rm -rf dist && tsc",
-    "prepare": "npm run build",
+    "prepare": "npm run build", 
     "test": "rm -rf dist && tsc && jest"
   },
   "repository": {

package/types/index.ts

@@ -0,0 +1 @@
+export type Comparator<T> = (a: T, b: T) => boolean;

package/dist/tests/binary-search-tree.test.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/tests/binary-search-tree.test.js

@@ -1,163 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const binary_search_tree_1 = require("../lib/binary-search-tree");
-describe('BinarySearchTree', () => {
-    let bst;
-    beforeEach(() => {
-        bst = new binary_search_tree_1.BinarySearchTree();
-    });
-    describe('Basic Operations', () => {
-        test('should create empty tree', () => {
-            expect(bst.isEmpty()).toBe(true);
-            expect(bst.count()).toBe(0);
-        });
-        test('should insert and search values', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            expect(bst.find(5)).toBe(true);
-            expect(bst.find(3)).toBe(true);
-            expect(bst.find(7)).toBe(true);
-            expect(bst.find(1)).toBe(false);
-            expect(bst.count()).toBe(3);
-            expect(bst.isEmpty()).toBe(false);
-        });
-        test('should clear all nodes from tree', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.clear();
-            expect(bst.isEmpty()).toBe(true);
-            expect(bst.find(5)).toBe(false);
-            expect(bst.min()).toBeUndefined();
-            expect(bst.max()).toBeUndefined();
-            expect(bst.count()).toBe(0);
-        });
-    });
-    describe('Min/Max Operations', () => {
-        test('should find min and max values', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.insert(1);
-            bst.insert(9);
-            expect(bst.min()).toBe(1);
-            expect(bst.max()).toBe(9);
-        });
-        test('should return undefined min/max for empty tree', () => {
-            expect(bst.min()).toBeUndefined();
-            expect(bst.max()).toBeUndefined();
-        });
-    });
-    describe('Remove Operations', () => {
-        test('should remove leaf nodes', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.remove(3);
-            expect(bst.find(3)).toBe(false);
-            expect(bst.find(5)).toBe(true);
-            expect(bst.find(7)).toBe(true);
-            expect(bst.count()).toBe(2);
-        });
-        test('should remove nodes with one child', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(2);
-            bst.remove(3);
-            expect(bst.find(3)).toBe(false);
-            expect(bst.find(5)).toBe(true);
-            expect(bst.find(2)).toBe(true);
-            expect(bst.count()).toBe(2);
-        });
-        test('should remove nodes with two children', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.insert(6);
-            bst.insert(8);
-            bst.remove(7);
-            expect(bst.find(7)).toBe(false);
-            expect(bst.find(5)).toBe(true);
-            expect(bst.find(8)).toBe(true);
-            expect(bst.find(6)).toBe(true);
-            expect(bst.count()).toBe(4);
-        });
-        test('should handle removing root node', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.remove(5);
-            expect(bst.find(5)).toBe(false);
-            expect(bst.find(3)).toBe(true);
-            expect(bst.find(7)).toBe(true);
-            expect(bst.count()).toBe(2);
-        });
-        test('should handle removing non-existent values', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.remove(7);
-            expect(bst.count()).toBe(2);
-            expect(bst.find(5)).toBe(true);
-            expect(bst.find(3)).toBe(true);
-        });
-    });
-    describe('Special Cases', () => {
-        test('should maintain order with duplicate values', () => {
-            const bst = new binary_search_tree_1.BinarySearchTree();
-            bst.insert(5);
-            bst.insert(5);
-            bst.insert(5);
-            expect(bst.count()).toBe(3);
-            bst.remove(5);
-            expect(bst.count()).toBe(2);
-            expect(bst.find(5)).toBe(true);
-        });
-        test('should work with custom comparator', () => {
-            const reverseBst = new binary_search_tree_1.BinarySearchTree((a, b) => a > b);
-            reverseBst.insert(5);
-            reverseBst.insert(3);
-            reverseBst.insert(7);
-            expect(reverseBst.min()).toBe(7);
-            expect(reverseBst.max()).toBe(3);
-        });
-    });
-    describe('Traversal Operations', () => {
-        test('should traverse tree in-order', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.insert(1);
-            bst.insert(9);
-            const result = [];
-            bst.forEach((value) => result.push(value));
-            expect(result).toEqual([1, 3, 5, 7, 9]);
-        });
-        test('should traverse tree pre-order', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.insert(1);
-            bst.insert(9);
-            const result = [];
-            bst.forEach((value) => result.push(value), 'preorder');
-            expect(result).toEqual([5, 3, 1, 7, 9]);
-        });
-        test('should traverse tree post-order', () => {
-            bst.insert(5);
-            bst.insert(3);
-            bst.insert(7);
-            bst.insert(1);
-            bst.insert(9);
-            const result = [];
-            bst.forEach((value) => result.push(value), 'postorder');
-            expect(result).toEqual([1, 3, 9, 7, 5]);
-        });
-        test('should handle forEach on empty tree', () => {
-            const result = [];
-            bst.forEach((value) => result.push(value));
-            expect(result).toEqual([]);
-        });
-    });
-});
-//# sourceMappingURL=binary-search-tree.test.js.map

package/dist/tests/binary-search-tree.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary-search-tree.test.js","sourceRoot":"","sources":["../../tests/binary-search-tree.test.ts"],"names":[],"mappings":";;AAAA,kEAA6D;AAE7D,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,GAA6B,CAAC;IAElC,UAAU,CAAC,GAAG,EAAE;QACd,GAAG,GAAG,IAAI,qCAAgB,EAAU,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;YAC1D,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC9C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;YACjD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACtD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC7B,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACvD,MAAM,GAAG,GAAG,IAAI,qCAAgB,EAAU,CAAC;YAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC9C,MAAM,UAAU,GAAG,IAAI,qCAAgB,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAErB,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACpC,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACzC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC/C,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/deque.test.d.ts

@@ -1 +0,0 @@
-export {};