@procedures/collections 0.46.0 → 0.47.2

package/src/impl/tree-set.ts

@@ -1,469 +0,0 @@
-/**
- * TreeSet - Red-black tree based sorted set implementation.
- *
- * Implements a sorted set using TreeMap as the backing structure.
- * Mirrors java.util.TreeSet.
- *
- * Key features:
- * - O(log n) add, remove, contains
- * - Elements maintained in sorted order (natural or custom comparator)
- * - Navigation methods (floor, ceiling, lower, higher)
- * - Range view operations (subSet, headSet, tailSet)
- *
- * @example
- * const set = treeSet<string>()
- * set.add('c')
- * set.add('a')
- * set.add('b')
- * // Iteration order: a, b, c (sorted)
- *
- * @example
- * // Custom comparator for descending order
- * const set = treeSet<number>({
- *   compare: (a, b) => b - a
- * })
- */
-
-import type { SortedSet, NavigableSet } from "../interfaces/set.js";
-import type { Eq, Compare } from "../core/traits.js";
-import { TreeMap } from "./tree-map.js";
-import { defaultEq, defaultCompare } from "../utils/defaults.js";
-
-/**
- * Dummy value used for TreeMap backing.
- */
-const PRESENT = true;
-
-/**
- * Options for creating a TreeSet.
- */
-export interface TreeSetOptions<T> {
-  /**
-   * Comparison function for elements.
-   * @default defaultCompare
-   */
-  compare?: Compare<T>;
-
-  /**
-   * Equality function for elements.
-   * @default defaultEq
-   */
-  eq?: Eq<T>;
-}
-
-/**
- * TreeSet<T> - Red-black tree based sorted set.
- *
- * Maintains elements in sorted order using a TreeMap as backing structure.
- * Provides O(log n) operations and navigation methods.
- */
-export class TreeSet<T> implements NavigableSet<T> {
-  private readonly _map: TreeMap<T, boolean>;
-  private readonly _compare: Compare<T>;
-  private readonly _eq: Eq<T>;
-
-  constructor(options: TreeSetOptions<T> = {}) {
-    const {
-      compare = defaultCompare,
-      eq = defaultEq,
-    } = options;
-
-    this._compare = compare;
-    this._eq = eq;
-    this._map = new TreeMap<T, boolean>({
-      compare,
-      eq,
-    });
-  }
-
-  // ========================================================================
-  // Size and state
-  // ========================================================================
-
-  get size(): number {
-    return this._map.size;
-  }
-
-  get isEmpty(): boolean {
-    return this._map.isEmpty;
-  }
-
-  get comparator(): Compare<T> {
-    return this._compare;
-  }
-
-  get eq(): Eq<T> {
-    return this._eq;
-  }
-
-  // ========================================================================
-  // Membership operations
-  // ========================================================================
-
-  has(element: T): boolean {
-    return this._map.has(element);
-  }
-
-  contains(element: T): boolean {
-    return this.has(element);
-  }
-
-  containsAll(other: Iterable<T>): boolean {
-    for (const element of other) {
-      if (!this.has(element)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  // ========================================================================
-  // Modification operations
-  // ========================================================================
-
-  add(element: T): boolean {
-    const oldValue = this._map.set(element, PRESENT);
-    return oldValue === undefined; // Returns true if element was added (not already present)
-  }
-
-  remove(element: T): boolean {
-    const removed = this._map.delete(element);
-    return removed !== undefined;
-  }
-
-  clear(): void {
-    this._map.clear();
-  }
-
-  // ========================================================================
-  // Bulk operations
-  // ========================================================================
-
-  addAll(elements: Iterable<T>): boolean {
-    let modified = false;
-    for (const element of elements) {
-      if (this.add(element)) {
-        modified = true;
-      }
-    }
-    return modified;
-  }
-
-  removeAll(elements: Iterable<T>): boolean {
-    let modified = false;
-    for (const element of elements) {
-      if (this.remove(element)) {
-        modified = true;
-      }
-    }
-    return modified;
-  }
-
-  retainAll(elements: Iterable<T>): boolean {
-    const toRetain = new Set<T>();
-    for (const element of elements) {
-      toRetain.add(element);
-    }
-
-    let modified = false;
-    for (const element of Array.from(this)) {
-      if (!toRetain.has(element)) {
-        this.remove(element);
-        modified = true;
-      }
-    }
-    return modified;
-  }
-
-  // ========================================================================
-  // Set operations
-  // ========================================================================
-
-  union(other: Iterable<T>): TreeSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    for (const element of this) {
-      result.add(element);
-    }
-    for (const element of other) {
-      result.add(element);
-    }
-
-    return result;
-  }
-
-  intersection(other: Iterable<T>): TreeSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    const otherSet = new Set<T>();
-    for (const element of other) {
-      otherSet.add(element);
-    }
-
-    for (const element of this) {
-      if (otherSet.has(element)) {
-        result.add(element);
-      }
-    }
-
-    return result;
-  }
-
-  difference(other: Iterable<T>): TreeSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    const otherSet = new Set<T>();
-    for (const element of other) {
-      otherSet.add(element);
-    }
-
-    for (const element of this) {
-      if (!otherSet.has(element)) {
-        result.add(element);
-      }
-    }
-
-    return result;
-  }
-
-  symmetricDifference(other: Iterable<T>): TreeSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    // Add all elements from this set
-    for (const element of this) {
-      result.add(element);
-    }
-
-    // Toggle elements from other set
-    for (const element of other) {
-      if (result.has(element)) {
-        result.remove(element);
-      } else {
-        result.add(element);
-      }
-    }
-
-    return result;
-  }
-
-  isSubsetOf(other: Iterable<T>): boolean {
-    const otherSet = new Set<T>();
-    for (const element of other) {
-      otherSet.add(element);
-    }
-
-    for (const element of this) {
-      if (!otherSet.has(element)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  isSupersetOf(other: Iterable<T>): boolean {
-    for (const element of other) {
-      if (!this.has(element)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  isDisjointFrom(other: Iterable<T>): boolean {
-    for (const element of other) {
-      if (this.has(element)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  // ========================================================================
-  // SortedSet operations
-  // ========================================================================
-
-  first(): T {
-    const key = this._map.firstKey();
-    return key;
-  }
-
-  last(): T {
-    const key = this._map.lastKey();
-    return key;
-  }
-
-  headSet(toElement: T): SortedSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    for (const element of this) {
-      if (this._compare(element, toElement) < 0) {
-        result.add(element);
-      } else {
-        break; // Elements are sorted
-      }
-    }
-
-    return result;
-  }
-
-  tailSet(fromElement: T): SortedSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    let started = false;
-    for (const element of this) {
-      if (!started && this._compare(element, fromElement) < 0) {
-        continue;
-      }
-      started = true;
-      result.add(element);
-    }
-
-    return result;
-  }
-
-  subSet(fromElement: T, toElement: T): SortedSet<T> {
-    const result = new TreeSet<T>({
-      compare: this._compare,
-      eq: this._eq,
-    });
-
-    for (const element of this) {
-      const cmpFrom = this._compare(element, fromElement);
-      const cmpTo = this._compare(element, toElement);
-
-      if (cmpFrom >= 0 && cmpTo < 0) {
-        result.add(element);
-      } else if (cmpTo >= 0) {
-        break; // Past the range
-      }
-    }
-
-    return result;
-  }
-
-  // ========================================================================
-  // NavigableSet operations
-  // ========================================================================
-
-  floor(element: T): T | undefined {
-    return this._map.floorKey(element);
-  }
-
-  ceiling(element: T): T | undefined {
-    return this._map.ceilingKey(element);
-  }
-
-  lower(element: T): T | undefined {
-    return this._map.lowerKey(element);
-  }
-
-  higher(element: T): T | undefined {
-    return this._map.higherKey(element);
-  }
-
-  pollFirst(): T | undefined {
-    const entry = this._map.pollFirstEntry();
-    return entry?.key;
-  }
-
-  pollLast(): T | undefined {
-    const entry = this._map.pollLastEntry();
-    return entry?.key;
-  }
-
-  descendingSet(): NavigableSet<T> {
-    const reversed = new TreeSet<T>({
-      compare: (a, b) => this._compare(b, a),
-      eq: this._eq,
-    });
-
-    for (const element of this) {
-      reversed.add(element);
-    }
-
-    return reversed;
-  }
-
-  *descendingIterator(): IterableIterator<T> {
-    yield* this._map.descendingKeys();
-  }
-
-  // ========================================================================
-  // View operations
-  // ========================================================================
-
-  *[Symbol.iterator](): Iterator<T> {
-    yield* this._map.keys();
-  }
-
-  forEach(action: (element: T, index: number) => void): void {
-    let index = 0;
-    for (const element of this) {
-      action(element, index++);
-    }
-  }
-
-  toArray(): T[] {
-    return Array.from(this);
-  }
-
-  // ========================================================================
-  // Utility methods
-  // ========================================================================
-
-  toString(): string {
-    const elements = Array.from(this).join(', ');
-    return `TreeSet{${elements}}`;
-  }
-}
-
-/**
- * Factory function to create a TreeSet.
- *
- * @example
- * const set = treeSet<string>()
- * set.add('c')
- * set.add('a')
- * set.add('b')
- * // Iteration order: a, b, c
- *
- * @example
- * // With initial elements
- * const set = treeSet(['c', 'a', 'b'])
- * // Iteration order: a, b, c
- *
- * @example
- * // Custom comparator for descending order
- * const set = treeSet<number>({ compare: (a, b) => b - a })
- */
-export function treeSet<T>(
-  optionsOrElements?: TreeSetOptions<T> | Iterable<T>
-): TreeSet<T> {
-  if (optionsOrElements && Symbol.iterator in optionsOrElements) {
-    const set = new TreeSet<T>();
-    for (const element of optionsOrElements as Iterable<T>) {
-      set.add(element);
-    }
-    return set;
-  }
-
-  return new TreeSet<T>(optionsOrElements as TreeSetOptions<T>);
-}

package/src/interfaces/collection.ts

@@ -1,141 +0,0 @@
-/**
- * Base collection interfaces that mirror Java Collections Framework.
- *
- * These form the root of the collection hierarchy and define the
- * fundamental operations common to all collections.
- */
-
-import type { Eq } from "../core/traits.js";
-
-/**
- * ReadonlyCollection<T> - The root interface for readonly collections.
- *
- * Mirrors java.util.Collection but without mutation operations.
- * All collections should extend this or a more specific readonly interface.
- */
-export interface ReadonlyCollection<T> extends Iterable<T> {
-  /**
-   * Returns the number of elements in this collection.
-   */
-  readonly size: number;
-
-  /**
-   * Returns true if this collection contains no elements.
-   */
-  readonly isEmpty: boolean;
-
-  /**
-   * Returns true if this collection contains the specified element.
-   * Uses the collection's equality function to compare elements.
-   *
-   * @param element The element to check for
-   */
-  contains(element: T): boolean;
-
-  /**
-   * Returns true if this collection contains all elements in the specified collection.
-   *
-   * @param other The collection whose elements to check for
-   */
-  containsAll(other: Iterable<T>): boolean;
-
-  /**
-   * Returns an array containing all elements in this collection.
-   * The returned array is safe to modify (it's a copy).
-   */
-  toArray(): T[];
-
-  /**
-   * Performs the given action for each element.
-   *
-   * @param action The action to perform for each element
-   */
-  forEach(action: (element: T, index: number) => void): void;
-
-  /**
-   * Returns the equality function used by this collection.
-   */
-  readonly eq: Eq<T>;
-}
-
-/**
- * Collection<T> - The root interface for mutable collections.
- *
- * Mirrors java.util.Collection with mutation operations.
- * All mutable collections should extend this or a more specific interface.
- */
-export interface Collection<T> extends ReadonlyCollection<T> {
-  /**
-   * Adds an element to this collection.
-   *
-   * Returns true if the collection was modified as a result of this call.
-   * Some collections (like Set) may return false if the element already exists.
-   *
-   * @param element The element to add
-   * @returns true if the collection changed
-   * @throws Error if collection is full (bounded) and policy is 'throw'
-   */
-  add(element: T): boolean;
-
-  /**
-   * Adds all elements from the specified collection to this collection.
-   *
-   * @param other The collection whose elements to add
-   * @returns true if the collection changed
-   */
-  addAll(other: Iterable<T>): boolean;
-
-  /**
-   * Removes a single instance of the specified element from this collection.
-   *
-   * Returns true if an element was removed as a result of this call.
-   *
-   * @param element The element to remove
-   * @returns true if an element was removed
-   */
-  remove(element: T): boolean;
-
-  /**
-   * Removes all elements from this collection that are also in the specified collection.
-   *
-   * @param other The collection whose elements to remove
-   * @returns true if the collection changed
-   */
-  removeAll(other: Iterable<T>): boolean;
-
-  /**
-   * Retains only the elements in this collection that are in the specified collection.
-   * In other words, removes all elements not in the specified collection.
-   *
-   * @param other The collection of elements to retain
-   * @returns true if the collection changed
-   */
-  retainAll(other: Iterable<T>): boolean;
-
-  /**
-   * Removes all elements from this collection.
-   * The collection will be empty after this call returns.
-   */
-  clear(): void;
-}
-
-/**
- * Utility type to check if a collection is readonly.
- */
-export type IsReadonly<C> = C extends ReadonlyCollection<any>
-  ? C extends Collection<any>
-    ? false
-    : true
-  : false;
-
-/**
- * Extract element type from a collection.
- */
-export type ElementOf<C> = C extends ReadonlyCollection<infer T> ? T : never;
-
-/**
- * Make a collection readonly by removing mutation methods.
- */
-export type Readonly<C extends Collection<any>> = C extends Collection<infer T>
-  ? ReadonlyCollection<T>
-  : never;