atomic-fns 0.3.1 → 0.3.2

package/core/collections/frozenset.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Returns a new immutable Set object with elements from `iterable`. Its contents cannot be altered after it's created.
+ *
+ *
+ * @class FrozenSet
+ * @extends {Set<T>}
+ * @template T
+ */
+export declare class FrozenSet<T = any> extends Set<T> {
+    constructor(iterable: Iterable<T>);
+    /** @private */
+    add(): this;
+    /** @private */
+    delete(): boolean;
+    /** @private */
+    clear(): this;
+    /** @private */
+    freeze(): Readonly<this>;
+}

package/core/collections/frozenset.js

@@ -0,0 +1,33 @@
+/**
+ * Returns a new immutable Set object with elements from `iterable`. Its contents cannot be altered after it's created.
+ *
+ *
+ * @class FrozenSet
+ * @extends {Set<T>}
+ * @template T
+ */
+export class FrozenSet extends Set {
+    constructor(iterable) {
+        super(iterable);
+        return this.freeze();
+    }
+    /** @private */
+    add() {
+        throw TypeError('FrozenSet cannot be modified.');
+        return this; // eslint-disable-line
+    }
+    /** @private */
+    delete() {
+        throw TypeError('FrozenSet cannot be modified.');
+        return false; // eslint-disable-line
+    }
+    /** @private */
+    clear() {
+        throw TypeError('FrozenSet cannot be modified.');
+        return this; // eslint-disable-line
+    }
+    /** @private */
+    freeze() {
+        return Object.freeze(this);
+    }
+}

package/core/collections/frozenset.ts

@@ -0,0 +1,37 @@
+/**
+ * Returns a new immutable Set object with elements from `iterable`. Its contents cannot be altered after it's created.
+ *
+ *
+ * @class FrozenSet
+ * @extends {Set<T>}
+ * @template T
+ */
+export class FrozenSet<T = any> extends Set<T> {
+  constructor(iterable: Iterable<T>) {
+    super(iterable)
+    return this.freeze()
+  }
+
+  /** @private */
+  add() {
+    throw TypeError('FrozenSet cannot be modified.')
+    return this // eslint-disable-line
+  }
+
+  /** @private */
+  delete() {
+    throw TypeError('FrozenSet cannot be modified.')
+    return false // eslint-disable-line
+  }
+
+  /** @private */
+  clear() {
+    throw TypeError('FrozenSet cannot be modified.')
+    return this // eslint-disable-line
+  }
+
+  /** @private */
+  freeze() {
+    return Object.freeze(this)
+  }
+}

package/{src → core}/collections/index.d.ts

@@ -4,167 +4,18 @@
  * @module Collections
  */
 import { Iteratee } from '../globals/index.js';
-/**
- * A container type that provides contains().
- *
- *
- * @interface Container
- */
-export interface Container {
-    contains: (x: any) => boolean;
-}
-/**
- * These are the "rich comparison" methods, inspired by Python operators.
- *
- *
- * @interface Comparable
- */
-export interface Comparable {
-    /** x < y: calls this.lt(other) reflection. */
-    lt?: (other: any) => boolean;
-    /** x ≤ y: calls this.le(other) reflection. */
-    le?: (other: any) => boolean;
-    /** x == y: calls this.eq(other) reflection. */
-    eq: (other: any) => boolean;
-    /** x != y: calls this.ne(other) reflection. */
-    ne: (other: any) => boolean;
-    /** x > y: calls this.gt(other) reflection. */
-    gt?: (other: any) => boolean;
-    /** x ≥ y: calls this.ge(other) reflection. */
-    ge?: (other: any) => boolean;
-}
-/**
- * A `Collection` is an iterable {@link Container} type.
- * This is an abstract base class for user-defined collection types.
- *
- *
- * @abstract
- * @class Collection
- * @implements {Container}
- */
-export declare abstract class Collection implements Container {
-    /**
-     * Returns an iterator for the container items
-     * @return {Iterator}
-     */
-    [Symbol.iterator](): this;
-    /**
-     * Implements the iterator protocol and returns the next item in the iterable.
-     */
-    next(): void;
-    /**
-     * Adds a new item to the container.
-     * @param item - The item to add to the collection.
-     */
-    add(item: any): void;
-    /**
-     * Checks if item is present in the container.
-     * @param item - The item to search for in the collection.
-     * @returns `true` when the element is found, else `false`
-     */
-    contains(item: any): boolean;
-    /**
-     * Returns the total number of elements in the container.
-     */
-    size(): number;
-    /**
-     * Remove the first item from the container where `item == x`
-     * @returns `true` when the element is found and removed, else `false`
-     */
-    remove(x: any): boolean;
-    /**
-     * Retrieve and remove the item at index `i`.
-     * @returns the item or undefined if not found.
-     */
-    pop(i: any): void;
-    /**
-     * Remove all items from the container
-     */
-    clear(): void;
-}
-/**
- * Implements an iterable that allows backward iteration.
- * @interface Reversible
- */
-export interface Reversible<T = unknown> {
-    reversed: () => Iterator<T>;
-}
-/**
- * A sequence is an iterable {@link Collection} type with efficient index-based access.
- * @abstract
- * @class Sequence
- * @extends {Collection}
- * @template T
- */
-export declare abstract class Sequence<T> extends Collection implements Reversible<T> {
-    /**
-     * Return the item at the given key or index
-     * @param {*} key
-     * @memberof Sequence
-     */
-    get(key: any): T | undefined;
-    /**
-     * Set a new value at the given key or index
-     *
-     * @param {*} key
-     * @param {T} val
-     * @memberof Sequence
-     */
-    set(key: any, val: T): void;
-    /**
-     * Deletes the given key or index, and its value.
-     * Raises ValueError if not key is found.
-     *
-     * @param {*} key
-     * @memberof Sequence
-     */
-    delete(key: any): void;
-    /**
-     * Adds a new item to the end of the sequence.
-     *
-     * @param {T} x
-     * @memberof Sequence
-     */
-    append(x: T): void;
-    /**
-     * Append all the items to the sequence.
-     *
-     * @param {Iterable<T>} iter
-     * @memberof Sequence
-     */
-    extend(iter: Iterable<T>): void;
-    /**
-     * Return the index of x in the sequence, or undefined if not found.
-     *
-     * @param {T} item
-     * @return {(number | undefined)}
-     * @memberof Sequence
-     */
-    indexOf(item: T): number | undefined;
-    size(): number;
-    reversed(): Iterator<T>;
-}
-/**
- * Returns a new immutable Set object with elements from `iterable`. Its contents cannot be altered after it's created.
- *
- *
- * @class FrozenSet
- * @extends {Set<T>}
- * @template T
- */
-export declare class FrozenSet<T = any> extends Set<T> {
-    constructor(iterable: Iterable<T>);
-    /** @private */
-    add(): this;
-    /** @private */
-    delete(): boolean;
-    /** @private */
-    clear(): this;
-    /** @private */
-    freeze(): Readonly<this>;
-}
-/**
- * Creates a new array with all `falsey` and empty values removed.
+export * from './abc.js';
+export * from './BTree.js';
+export * from './deque.js';
+export * from './frozenset.js';
+export * from './Heap.js';
+export * from './LRUCache.js';
+export * from './SortedSet.js';
+export * from './SortedMap.js';
+export * from './SortedTree.js';
+export * from './SplayTree.js';
+/**
+ * Creates a new array with all falsy and empty values removed.
  * @param arr The array to compact
  * @returns A new array with the filtered values.
  * @example

package/{src → core}/collections/index.js

@@ -4,166 +4,19 @@
  * @module Collections
  */
 import { partial } from '../functools/index.js';
-import { call, get, isArray, isArrayLike, isBool, isEmpty, isFunc, isIterable, isNull, isNumber, isObject, isString, isSymbol, keys, NotImplementedError, set } from '../globals/index.js';
+import { call, get, isArray, isArrayLike, isBool, isEmpty, isFunc, isIterable, isNull, isNumber, isObject, isString, isSymbol, keys, set } from '../globals/index.js';
 import { enumerate } from '../itertools/index.js';
-import { comp, eq, id } from '../operators/index.js';
-/**
- * A `Collection` is an iterable {@link Container} type.
- * This is an abstract base class for user-defined collection types.
- *
- *
- * @abstract
- * @class Collection
- * @implements {Container}
- */
-export class Collection {
-    /**
-     * Returns an iterator for the container items
-     * @return {Iterator}
-     */
-    [Symbol.iterator]() {
-        return this;
-    }
-    /**
-     * Implements the iterator protocol and returns the next item in the iterable.
-     */
-    next() { }
-    /**
-     * Adds a new item to the container.
-     * @param item - The item to add to the collection.
-     */
-    add(item) { }
-    /**
-     * Checks if item is present in the container.
-     * @param item - The item to search for in the collection.
-     * @returns `true` when the element is found, else `false`
-     */
-    contains(item) {
-        return false;
-    }
-    /**
-     * Returns the total number of elements in the container.
-     */
-    size() {
-        throw new NotImplementedError();
-    }
-    /**
-     * Remove the first item from the container where `item == x`
-     * @returns `true` when the element is found and removed, else `false`
-     */
-    remove(x) {
-        return false;
-    }
-    /**
-     * Retrieve and remove the item at index `i`.
-     * @returns the item or undefined if not found.
-     */
-    pop(i) { }
-    /**
-     * Remove all items from the container
-     */
-    clear() { }
-}
-/**
- * A sequence is an iterable {@link Collection} type with efficient index-based access.
- * @abstract
- * @class Sequence
- * @extends {Collection}
- * @template T
- */
-export class Sequence extends Collection {
-    /**
-     * Return the item at the given key or index
-     * @param {*} key
-     * @memberof Sequence
-     */
-    get(key) {
-        throw new NotImplementedError();
-    }
-    /**
-     * Set a new value at the given key or index
-     *
-     * @param {*} key
-     * @param {T} val
-     * @memberof Sequence
-     */
-    set(key, val) {
-        throw new NotImplementedError();
-    }
-    /**
-     * Deletes the given key or index, and its value.
-     * Raises ValueError if not key is found.
-     *
-     * @param {*} key
-     * @memberof Sequence
-     */
-    delete(key) {
-        throw new NotImplementedError();
-    }
-    /**
-     * Adds a new item to the end of the sequence.
-     *
-     * @param {T} x
-     * @memberof Sequence
-     */
-    append(x) { }
-    /**
-     * Append all the items to the sequence.
-     *
-     * @param {Iterable<T>} iter
-     * @memberof Sequence
-     */
-    extend(iter) { }
-    /**
-     * Return the index of x in the sequence, or undefined if not found.
-     *
-     * @param {T} item
-     * @return {(number | undefined)}
-     * @memberof Sequence
-     */
-    indexOf(item) {
-        throw new NotImplementedError();
-    }
-    size() {
-        return 0;
-    }
-    reversed() {
-        throw new NotImplementedError();
-    }
-}
-/**
- * Returns a new immutable Set object with elements from `iterable`. Its contents cannot be altered after it's created.
- *
- *
- * @class FrozenSet
- * @extends {Set<T>}
- * @template T
- */
-export class FrozenSet extends Set {
-    constructor(iterable) {
-        super(iterable);
-        return this.freeze();
-    }
-    /** @private */
-    add() {
-        throw TypeError('FrozenSet cannot be modified.');
-        return this; // eslint-disable-line
-    }
-    /** @private */
-    delete() {
-        throw TypeError('FrozenSet cannot be modified.');
-        return false; // eslint-disable-line
-    }
-    /** @private */
-    clear() {
-        throw TypeError('FrozenSet cannot be modified.');
-        return this; // eslint-disable-line
-    }
-    /** @private */
-    freeze() {
-        return Object.freeze(this);
-    }
-}
+import { compare, eq, id } from '../operators/index.js';
+export * from './abc.js';
+export * from './BTree.js';
+export * from './deque.js';
+export * from './frozenset.js';
+export * from './Heap.js';
+export * from './LRUCache.js';
+export * from './SortedSet.js';
+export * from './SortedMap.js';
+export * from './SortedTree.js';
+export * from './SplayTree.js';
 export function compact(arr) {
     if (arr == null)
         return;
@@ -852,7 +705,7 @@ uniq([2, 1, 2])
  */
 export function sortedUniq(arr, fn = id) {
     const values = uniq(arr, fn);
-    values.sort(comp);
+    values.sort(compare);
     return values;
 }
 function baseMergeDeep(obj, source, key, stack) {
@@ -1084,8 +937,4 @@ export function remove(arr, func) {
     });
 }
 // TODO: binary search utils
-// TODO: heap/heapify
-// TODO: deque
 // TODO: Counter
-// TODO: Skip list
-// TODO: BST (BTree)