import { type Inspectable } from "./Inspectable.js"; import type { Pipeable } from "./Pipeable.js"; declare const TypeId: unique symbol; /** * @since 2.0.0 * @category symbol */ export type TypeId = typeof TypeId; /** * @since 2.0.0 * @category models */ export interface MutableHashSet extends Iterable, Pipeable, Inspectable { readonly [TypeId]: TypeId; } /** * Creates an empty mutable hash set. * * This function initializes and returns an empty `MutableHashSet` instance, * which allows for efficient storage and manipulation of unique elements. * * Time complexity: **`O(1)`** * * @memberof MutableHashSet * @since 2.0.0 * @category constructors * @example * * ```ts * import { MutableHashSet } from "effect" * * type T = unknown // replace with your type * * // in places where the type can't be inferred, replace with your type * const set: MutableHashSet.MutableHashSet = MutableHashSet.empty() * ``` * * @template K - The type of the elements to be stored in the hash set. Defaults * to `never` if not specified. * @returns A new mutable instance of `MutableHashSet` containing no elements * for the specified type `K`. * @see Other `MutableHashSet` constructors are {@link module:MutableHashSet.make} {@link module:MutableHashSet.fromIterable} */ export declare const empty: () => MutableHashSet; /** * Creates a new `MutableHashSet` from an iterable collection of values. * Duplicate values are omitted. * * Time complexity: **`O(n)`** where n is the number of elements in the iterable * * Creating a `MutableHashSet` from an {@link Array} * * ```ts * import { MutableHashSet } from "effect" * * const array: Iterable = [1, 2, 3, 4, 5, 1, 2, 3] // Array is also Iterable * const mutableHashSet: MutableHashSet.MutableHashSet = * MutableHashSet.fromIterable(array) * * console.log( * // MutableHashSet.MutableHashSet is also an Iterable * Array.from(mutableHashSet) * ) // Output: [1, 2, 3, 4, 5] * ``` * * Creating a `MutableHashSet` from a {@link Set} * * ```ts * import { MutableHashSet, pipe } from "effect" * * console.log( * pipe( * // Set is an Iterable * new Set(["apple", "banana", "orange", "apple"]), * // constructs MutableHashSet from an Iterable Set * MutableHashSet.fromIterable, * // since MutableHashSet it is itself an Iterable, we can pass it to other functions expecting an Iterable * Array.from * ) * ) // Output: ["apple", "banana", "orange"] * ``` * * Creating a `MutableHashSet` from a {@link Generator} * * ```ts * import { MutableHashSet } from "effect" * * // Generator functions return iterables * function* fibonacci(n: number): Generator { * let [a, b] = [0, 1] * for (let i = 0; i < n; i++) { * yield a * ;[a, b] = [b, a + b] * } * } * * // Create a MutableHashSet from the first 10 Fibonacci numbers * const fibonacciSet = MutableHashSet.fromIterable(fibonacci(10)) * * console.log(Array.from(fibonacciSet)) * // Outputs: [0, 1, 2, 3, 5, 8, 13, 21, 34] but in unsorted order * ``` * * Creating a `MutableHashSet` from another {@link module:MutableHashSet} * * ```ts * import { MutableHashSet, pipe } from "effect" * * console.log( * pipe( * MutableHashSet.make(1, 2, 3, 4), * MutableHashSet.fromIterable, * Array.from * ) * ) // Output: [1, 2, 3, 4] * ``` * * Creating a `MutableHashSet` from an {@link module:HashSet} * * ```ts * import { HashSet, MutableHashSet, pipe } from "effect" * * console.log( * pipe( * HashSet.make(1, 2, 3, 4), // it works also with its immutable HashSet sibling * MutableHashSet.fromIterable, * Array.from * ) * ) // Output: [1, 2, 3, 4] * ``` * * Creating a `MutableHashSet` from other Effect's data structures like * {@link Chunk} * * ```ts * import { Chunk, MutableHashSet, pipe } from "effect" * * console.log( * pipe( * Chunk.make(1, 2, 3, 4), // Chunk is also an Iterable * MutableHashSet.fromIterable, * Array.from * ) * ) // Outputs: [1, 2, 3, 4] * ``` * * @memberof MutableHashSet * @since 2.0.0 * @category constructors * @template K - The type of elements to be stored in the resulting * `MutableHashSet`. * @param keys - An `Iterable` collection containing the keys to be added to the * `MutableHashSet`. * @returns A new `MutableHashSet` containing just the unique elements from the * provided iterable. * @see Other `MutableHashSet` constructors are {@link module:MutableHashSet.empty} {@link module:MutableHashSet.make} */ export declare const fromIterable: (keys: Iterable) => MutableHashSet; /** * Construct a new `MutableHashSet` from a variable number of values. * * Time complexity: **`O(n)`** where n is the number of elements * * @memberof MutableHashSet * @since 2.0.0 * @category constructors * @example * * ```ts * import { Equal, Hash, MutableHashSet } from "effect" * import assert from "node:assert/strict" * * class Character implements Equal.Equal { * readonly name: string * readonly trait: string * * constructor(name: string, trait: string) { * this.name = name * this.trait = trait * } * * // Define equality based on name, and trait * [Equal.symbol](that: Equal.Equal): boolean { * if (that instanceof Character) { * return ( * Equal.equals(this.name, that.name) && * Equal.equals(this.trait, that.trait) * ) * } * return false * } * * // Generate a hash code based on the sum of the character's name and trait * [Hash.symbol](): number { * return Hash.hash(this.name + this.trait) * } * * static readonly of = (name: string, trait: string): Character => { * return new Character(name, trait) * } * } * * const mutableCharacterHashSet = MutableHashSet.make( * Character.of("Alice", "Curious"), * Character.of("Alice", "Curious"), * Character.of("White Rabbit", "Always late"), * Character.of("Mad Hatter", "Tea enthusiast") * ) * * assert.equal( * MutableHashSet.has( * mutableCharacterHashSet, * Character.of("Alice", "Curious") * ), * true * ) * assert.equal( * MutableHashSet.has( * mutableCharacterHashSet, * Character.of("Fluffy", "Kind") * ), * false * ) * ``` * * @see Other `MutableHashSet` constructors are {@link module:MutableHashSet.fromIterable} {@link module:MutableHashSet.empty} */ export declare const make: >(...keys: Keys) => MutableHashSet; /** * **Checks** whether the `MutableHashSet` contains the given element, and * **adds** it if not. * * Time complexity: **`O(1)`** average * * **Syntax** * * ```ts * import { MutableHashSet, pipe } from "effect" * * // with data-last, a.k.a. pipeable API * pipe( * MutableHashSet.empty(), * MutableHashSet.add(0), * MutableHashSet.add(0) * ) * * // or piped with the pipe function * MutableHashSet.empty().pipe(MutableHashSet.add(0)) * * // or with data-first API * MutableHashSet.add(MutableHashSet.empty(), 0) * ``` * * @memberof MutableHashSet * @since 2.0.0 * @category elements * @see Other `MutableHashSet` elements are {@link module:MutableHashSet.remove} {@link module:MutableHashSet.size} {@link module:MutableHashSet.clear} {@link module:MutableHashSet.has} */ export declare const add: { /** * `data-last` a.k.a. `pipeable` API * * ```ts * import { MutableHashSet, pipe } from "effect" * import assert from "node:assert/strict" * * const mutableHashSet = pipe( * MutableHashSet.empty(), // MutableHashSet.MutableHashSet * MutableHashSet.add(0), * MutableHashSet.add(1), * MutableHashSet.add(1), * MutableHashSet.add(2) * ) * * assert.deepStrictEqual( * Array.from(mutableHashSet), // remember that MutableHashSet is also an Iterable * Array.of(0, 1, 2) * ) * ``` * * @template V - The type of elements stored in the `MutableHashSet`. * @param key - The key to be added to the `MutableHashSet` if not already * present. * @returns A function that accepts a `MutableHashSet` and returns the * reference of the updated `MutableHashSet` including the key. */ (key: V): (self: MutableHashSet) => MutableHashSet; /** * `data-first` API * * ```ts * import { MutableHashSet } from "effect" * import assert from "node:assert/strict" * * const empty = MutableHashSet.empty() * const withZero = MutableHashSet.add(empty, 0) * const withOne = MutableHashSet.add(withZero, 1) * const withTwo = MutableHashSet.add(withOne, 2) * const withTwoTwo = MutableHashSet.add(withTwo, 2) * * assert(Object.is(withTwoTwo, empty)) // proof that it does mutate the original set * * assert.deepStrictEqual( * Array.from(withTwoTwo), // remember that MutableHashSet is also an Iterable * Array.of(0, 1, 2) * ) * ``` * * @template V - The type of elements stored in the `MutableHashSet`. * @param self - The `MutableHashSet` instance from which the key should be * added to. * @param key - The key to be added to the `MutableHashSet` if not already * present. * @returns The reference of the updated `MutableHashSet` including the key. */ (self: MutableHashSet, key: V): MutableHashSet; }; /** * Checks if the specified value exists in the `MutableHashSet`. * * Time complexity: `O(1)` average * * **Syntax** * * ```ts * import { MutableHashSet, pipe } from "effect" * import assert from "node:assert/strict" * * assert.equal( * // with `data-last`, a.k.a. `pipeable` API * pipe(MutableHashSet.make(0, 1, 2), MutableHashSet.has(3)), * false * ) * * assert.equal( * // or piped with the pipe function * MutableHashSet.make(0, 1, 2).pipe(MutableHashSet.has(3)), * false * ) * * assert.equal( * // or with `data-first` API * MutableHashSet.has(MutableHashSet.make(0, 1, 2), 3), * false * ) * ``` * * @memberof MutableHashSet * @since 2.0.0 * @category elements * @see Other `MutableHashSet` elements are {@link module:MutableHashSet.add} {@link module:MutableHashSet.remove} {@link module:MutableHashSet.size} {@link module:MutableHashSet.clear} */ export declare const has: { /** * `data-last` a.k.a. `pipeable` API * * ```ts * import * as assert from "node:assert/strict" * import { MutableHashSet, pipe } from "effect" * * const set = MutableHashSet.make(0, 1, 2) * * assert.equal(pipe(set, MutableHashSet.has(0)), true) * assert.equal(pipe(set, MutableHashSet.has(1)), true) * assert.equal(pipe(set, MutableHashSet.has(2)), true) * assert.equal(pipe(set, MutableHashSet.has(3)), false) * ``` */ (key: V): (self: MutableHashSet) => boolean; /** * `data-first` API * * ```ts * import * as assert from "node:assert/strict" * import { MutableHashSet, pipe } from "effect" * * const set = MutableHashSet.make(0, 1, 2) * * assert.equal(MutableHashSet.has(set, 0), true) * assert.equal(MutableHashSet.has(set, 1), true) * assert.equal(MutableHashSet.has(set, 2), true) * assert.equal(MutableHashSet.has(set, 3), false) * ``` */ (self: MutableHashSet, key: V): boolean; }; /** * Removes a value from the `MutableHashSet`. * * Time complexity: **`O(1)`** average * * **Syntax** * * ```ts * import { MutableHashSet, pipe } from "effect" * import assert from "node:assert/strict" * * assert.equal( * // with `data-last`, a.k.a. `pipeable` API * pipe( * MutableHashSet.make(0, 1, 2), * MutableHashSet.remove(0), * MutableHashSet.has(0) * ), * false * ) * * assert.equal( * // or piped with the pipe function * MutableHashSet.make(0, 1, 2).pipe( * MutableHashSet.remove(0), * MutableHashSet.has(0) * ), * false * ) * * assert.equal( * // or with `data-first` API * MutableHashSet.remove(MutableHashSet.make(0, 1, 2), 0).pipe( * MutableHashSet.has(0) * ), * false * ) * ``` * * @memberof MutableHashSet * @since 2.0.0 * @category elements * @see Other `MutableHashSet` elements are {@link module:MutableHashSet.add} {@link module:MutableHashSet.has} {@link module:MutableHashSet.size} {@link module:MutableHashSet.clear} */ export declare const remove: { /** * `data-last` a.k.a. `pipeable` API * * ```ts * import { MutableHashSet, pipe } from "effect" * import assert from "node:assert/strict" * * const set: MutableHashSet.MutableHashSet = MutableHashSet.make( * 0, * 1, * 2 * ) * const result: MutableHashSet.MutableHashSet = pipe( * set, * MutableHashSet.remove(0) * ) * * assert(Object.is(set, result)) // set and result have the same identity * assert.equal(pipe(result, MutableHashSet.has(0)), false) // it has correctly removed 0 * assert.equal(pipe(set, MutableHashSet.has(0)), false) // another proof that we are mutating the original MutableHashSet * assert.equal(pipe(result, MutableHashSet.has(1)), true) * assert.equal(pipe(result, MutableHashSet.has(2)), true) * ``` * * @template V - The type of the elements in the `MutableHashSet`. * @param key - The key to be removed from the `MutableHashSet`. * @returns A function that takes a `MutableHashSet` as input and returns the * reference to the same `MutableHashSet` with the specified key removed. */ (key: V): (self: MutableHashSet) => MutableHashSet; /** * `data-first` API * * ```ts * import { MutableHashSet, pipe } from "effect" * import assert from "node:assert/strict" * * const set = MutableHashSet.make(0, 1, 2) * const result = MutableHashSet.remove(set, 0) * * assert(Object.is(set, result)) // set and result have the same identity * assert.equal(MutableHashSet.has(result, 0), false) // it has correctly removed 0 * assert.equal(MutableHashSet.has(set, 0), false) // it mutates the original MutableHashSet * assert.equal(MutableHashSet.has(result, 1), true) * assert.equal(MutableHashSet.has(result, 2), true) * ``` * * @template V - The type of the elements in the `MutableHashSet`. * @param self - The `MutableHashSet` to which the key will be removed from. * @param key - The value to be removed from the `MutableHashSet` if present. * @returns The reference to the updated `MutableHashSet`. */ (self: MutableHashSet, key: V): MutableHashSet; }; /** * Calculates the number of values in the `HashSet`. * * Time complexity: **`O(1)`** * * @memberof MutableHashSet * @since 2.0.0 * @category elements * @example * * ```ts * import { MutableHashSet } from "effect" * import assert from "node:assert/strict" * * assert.equal(MutableHashSet.size(MutableHashSet.empty()), 0) * * assert.equal( * MutableHashSet.size(MutableHashSet.make(1, 2, 2, 3, 4, 3)), * 4 * ) * ``` * * @template V - The type of the elements to be stored in the `MutableHashSet`. * @param self - The `MutableHashSet` instance for which the size is to be * determined. * @returns The total number of elements within the `MutableHashSet`. * @see Other `MutableHashSet` elements are {@link module:MutableHashSet.add} {@link module:MutableHashSet.has} {@link module:MutableHashSet.remove} {@link module:MutableHashSet.clear} */ export declare const size: (self: MutableHashSet) => number; /** * Removes all values from the `MutableHashSet`. * * This function operates by delegating the clearing action to the underlying * key map associated with the given `MutableHashSet`. It ensures that the hash * set becomes empty while maintaining its existence and structure. * * @memberof MutableHashSet * @since 2.0.0 * @category elements * @example * * ```ts * import { MutableHashSet, pipe } from "effect" * import assert from "node:assert/strict" * * assert.deepStrictEqual( * pipe( * MutableHashSet.make(1, 2, 3, 4), * MutableHashSet.clear, * MutableHashSet.size * ), * 0 * ) * ``` * * @param self - The `MutableHashSet` to clear. * @returns The same `MutableHashSet` after all elements have been removed. * @see Other `MutableHashSet` elements are {@link module:MutableHashSet.add} {@link module:MutableHashSet.has} {@link module:MutableHashSet.remove} {@link module:MutableHashSet.size} */ export declare const clear: (self: MutableHashSet) => MutableHashSet; export {}; //# sourceMappingURL=MutableHashSet.d.ts.map