@typed/fx 1.32.0 → 2.0.0-beta.0

package/dist/RefSubject/RefHashRing.js

@@ -0,0 +1,115 @@
+/**
+ * Extensions to RefSubject for working with HashRing values
+ * @since 1.18.0
+ */
+import { equals } from "effect/Equal";
+import { dual } from "effect/Function";
+import * as HashRing from "effect/HashRing";
+import * as Option from "effect/Option";
+import * as RefSubject from "./RefSubject.js";
+/**
+ * Creates a new `RefHashRing` from a HashRing, `Effect`, or `Fx`.
+ * @since 1.18.0
+ * @category constructors
+ */
+export function make(initial) {
+    return RefSubject.make(initial, { eq: equals });
+}
+/**
+ * Creates a new empty RefHashRing.
+ * @since 1.18.0
+ * @category constructors
+ */
+export function empty(options) {
+    return RefSubject.make(HashRing.make(options), { eq: equals });
+}
+// Helper to copy a HashRing before mutation
+function copyRing(ring) {
+    const newRing = HashRing.make({ baseWeight: ring.baseWeight });
+    return HashRing.addMany(newRing, ring);
+}
+// ========================================
+// Combinators
+// ========================================
+/**
+ * Add a node to the HashRing.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const add = dual((args) => RefSubject.isRefSubject(args[0]), function add(ref, node, options) {
+    return RefSubject.update(ref, (ring) => HashRing.add(copyRing(ring), node, options));
+});
+/**
+ * Add multiple nodes to the HashRing.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const addMany = dual((args) => RefSubject.isRefSubject(args[0]), function addMany(ref, nodes, options) {
+    return RefSubject.update(ref, (ring) => HashRing.addMany(copyRing(ring), nodes, options));
+});
+/**
+ * Remove a node from the HashRing.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const remove = dual(2, function remove(ref, node) {
+    return RefSubject.update(ref, (ring) => HashRing.remove(copyRing(ring), node));
+});
+// ========================================
+// Computed
+// ========================================
+/**
+ * Check if a node exists in the HashRing.
+ * @since 1.18.0
+ * @category computed
+ */
+export const has = dual(2, function has(ref, node) {
+    return RefSubject.map(ref, HashRing.has(node));
+});
+/**
+ * Get the number of nodes in the HashRing.
+ * @since 1.18.0
+ * @category computed
+ */
+export const size = (ref) => RefSubject.map(ref, (ring) => ring.nodes.size);
+/**
+ * Check if the HashRing is empty.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isEmpty = (ref) => RefSubject.map(ref, (ring) => ring.nodes.size === 0);
+/**
+ * Get the node which should handle a given input string as a Computed.
+ * Returns undefined if the ring is empty.
+ * @since 1.18.0
+ * @category computed
+ */
+export const getNode = dual(2, function getNode(ref, input) {
+    return RefSubject.map(ref, (ring) => HashRing.get(ring, input));
+});
+/**
+ * Get shard distribution across nodes.
+ * @since 1.18.0
+ * @category computed
+ */
+export const getShards = dual(2, function getShards(ref, count) {
+    return RefSubject.map(ref, (ring) => HashRing.getShards(ring, count));
+});
+/**
+ * Get all nodes as an array.
+ * @since 1.18.0
+ * @category computed
+ */
+export const values = (ref) => RefSubject.map(ref, (ring) => Array.from(ring));
+// ========================================
+// Filtered
+// ========================================
+/**
+ * Get the node which should handle a given input string as a Filtered.
+ * Fails if the ring is empty.
+ * @since 1.18.0
+ * @category filtered
+ */
+export const get = dual(2, function get(ref, input) {
+    return RefSubject.filterMap(ref, (ring) => Option.fromUndefinedOr(HashRing.get(ring, input)));
+});

package/dist/RefSubject/RefHashSet.d.ts

@@ -0,0 +1,179 @@
+/**
+ * Extensions to RefSubject for working with HashSet values
+ * @since 1.18.0
+ */
+import type * as Effect from "effect/Effect";
+import * as HashSet from "effect/HashSet";
+import type * as Scope from "effect/Scope";
+import type * as Fx from "../Fx/index.js";
+import * as RefSubject from "./RefSubject.js";
+/**
+ * A RefHashSet is a RefSubject specialized over a HashSet.
+ * @since 1.18.0
+ * @category models
+ */
+export interface RefHashSet<in out V, in out E = never, out R = never> extends RefSubject.RefSubject<HashSet.HashSet<V>, E, R> {
+}
+/**
+ * Creates a new `RefHashSet` from a HashSet, `Effect`, or `Fx`.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare function make<V, E, R>(initial: HashSet.HashSet<V> | Effect.Effect<HashSet.HashSet<V>, E, R> | Fx.Fx<HashSet.HashSet<V>, E, R>): Effect.Effect<RefHashSet<V, E>, never, R | Scope.Scope>;
+/**
+ * Add a value to the RefHashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const add: {
+    <V>(value: V): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, value: V): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Remove a value from the RefHashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const remove: {
+    <V>(value: V): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, value: V): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Clear all values from the RefHashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const clear: <V, E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+/**
+ * Compute the union with another HashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const union: {
+    <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, that: HashSet.HashSet<V>): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Compute the intersection with another HashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const intersection: {
+    <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, that: HashSet.HashSet<V>): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Compute the difference with another HashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const difference: {
+    <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, that: HashSet.HashSet<V>): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Filter values in place.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filter: {
+    <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, predicate: (value: V) => boolean): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Map values in place (endomorphic).
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const map: {
+    <V>(f: (value: V) => V): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, f: (value: V) => V): Effect.Effect<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Get the current size of the RefHashSet.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const size: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<number, E, R>;
+/**
+ * Check if the RefHashSet is empty.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const isEmpty: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
+/**
+ * Check if the RefHashSet is non-empty.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const isNonEmpty: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
+/**
+ * Check if a value exists in the RefHashSet.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const has: {
+    <V>(value: V): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, value: V): RefSubject.Computed<boolean, E, R>;
+};
+/**
+ * Check if any value satisfies a predicate.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const some: {
+    <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, predicate: (value: V) => boolean): RefSubject.Computed<boolean, E, R>;
+};
+/**
+ * Check if all values satisfy a predicate.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const every: {
+    <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, predicate: (value: V) => boolean): RefSubject.Computed<boolean, E, R>;
+};
+/**
+ * Check if this set is a subset of another.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const isSubset: {
+    <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, that: HashSet.HashSet<V>): RefSubject.Computed<boolean, E, R>;
+};
+/**
+ * Map values to a different type.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const mapValues: {
+    <V, B>(f: (value: V) => B): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<HashSet.HashSet<B>, E, R>;
+    <V, E, R, B>(ref: RefHashSet<V, E, R>, f: (value: V) => B): RefSubject.Computed<HashSet.HashSet<B>, E, R>;
+};
+/**
+ * Filter values creating a Computed value.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const filterValues: {
+    <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<HashSet.HashSet<V>, E, R>;
+    <V, E, R>(ref: RefHashSet<V, E, R>, predicate: (value: V) => boolean): RefSubject.Computed<HashSet.HashSet<V>, E, R>;
+};
+/**
+ * Reduce the values to a single value.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const reduce: {
+    <V, B>(b: B, f: (b: B, value: V) => B): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<B, E, R>;
+    <V, E, R, B>(ref: RefHashSet<V, E, R>, b: B, f: (b: B, value: V) => B): RefSubject.Computed<B, E, R>;
+};
+/**
+ * Get all values as an array.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const values: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<Array<V>, E, R>;
+//# sourceMappingURL=RefHashSet.d.ts.map

package/dist/RefSubject/RefHashSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RefHashSet.d.ts","sourceRoot":"","sources":["../../src/RefSubject/RefHashSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAC;AAG7C,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAC;AAC1C,OAAO,KAAK,KAAK,KAAK,MAAM,cAAc,CAAC;AAC3C,OAAO,KAAK,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,WAAW,UAAU,CACzB,EAAE,CAAC,GAAG,CAAC,CAAC,EACR,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAChB,GAAG,CAAC,CAAC,GAAG,KAAK,CACb,SAAQ,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;CAAG;AAE5D;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAC1B,OAAO,EACH,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAClB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GACvC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAClC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAEzD;AAMD;;;;GAIG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3F,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGvF,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3F,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGvF,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CACjD,CAAC;AAEhD;;;;GAIG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,CAAC,EACA,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG3C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,YAAY,EAAE;IACzB,CAAC,CAAC,EACA,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG3C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB,CAAC,CAAC,EACA,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG3C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG3C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB,CAAC,CAAC,EACA,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GACjB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGjG,CAAC;AAMH;;;;GAIG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CACtD,CAAC;AAEpC;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CACvD,CAAC;AAEvC;;;;GAIG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAC/C,CAAC;AAElD;;;;GAIG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtF,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGlF,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGtC,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGtC,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CAAC,CAAC,EACA,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GACvB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGlG,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,CAAC,EACH,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GACjB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrF,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACT,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GACjB,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGjD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,YAAY,EAAE;IACzB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrF,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAOjD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EAAE,CAAC,EACH,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,GACvB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACT,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,GACvB,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGhC,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAClD,CAAC"}

package/dist/RefSubject/RefHashSet.js

@@ -0,0 +1,164 @@
+/**
+ * Extensions to RefSubject for working with HashSet values
+ * @since 1.18.0
+ */
+import { equals } from "effect/Equal";
+import { dual } from "effect/Function";
+import * as HashSet from "effect/HashSet";
+import * as RefSubject from "./RefSubject.js";
+/**
+ * Creates a new `RefHashSet` from a HashSet, `Effect`, or `Fx`.
+ * @since 1.18.0
+ * @category constructors
+ */
+export function make(initial) {
+    return RefSubject.make(initial, { eq: equals });
+}
+// ========================================
+// Combinators
+// ========================================
+/**
+ * Add a value to the RefHashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const add = dual(2, function add(ref, value) {
+    return RefSubject.update(ref, HashSet.add(value));
+});
+/**
+ * Remove a value from the RefHashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const remove = dual(2, function remove(ref, value) {
+    return RefSubject.update(ref, HashSet.remove(value));
+});
+/**
+ * Clear all values from the RefHashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const clear = (ref) => RefSubject.update(ref, () => HashSet.empty());
+/**
+ * Compute the union with another HashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const union = dual(2, function union(ref, that) {
+    return RefSubject.update(ref, HashSet.union(that));
+});
+/**
+ * Compute the intersection with another HashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const intersection = dual(2, function intersection(ref, that) {
+    return RefSubject.update(ref, HashSet.intersection(that));
+});
+/**
+ * Compute the difference with another HashSet.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const difference = dual(2, function difference(ref, that) {
+    return RefSubject.update(ref, HashSet.difference(that));
+});
+/**
+ * Filter values in place.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const filter = dual(2, function filter(ref, predicate) {
+    return RefSubject.update(ref, HashSet.filter(predicate));
+});
+/**
+ * Map values in place (endomorphic).
+ * @since 1.18.0
+ * @category combinators
+ */
+export const map = dual(2, function map(ref, f) {
+    return RefSubject.update(ref, HashSet.map(f));
+});
+// ========================================
+// Computed
+// ========================================
+/**
+ * Get the current size of the RefHashSet.
+ * @since 1.18.0
+ * @category computed
+ */
+export const size = (ref) => RefSubject.map(ref, HashSet.size);
+/**
+ * Check if the RefHashSet is empty.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isEmpty = (ref) => RefSubject.map(ref, HashSet.isEmpty);
+/**
+ * Check if the RefHashSet is non-empty.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isNonEmpty = (ref) => RefSubject.map(ref, (s) => !HashSet.isEmpty(s));
+/**
+ * Check if a value exists in the RefHashSet.
+ * @since 1.18.0
+ * @category computed
+ */
+export const has = dual(2, function has(ref, value) {
+    return RefSubject.map(ref, HashSet.has(value));
+});
+/**
+ * Check if any value satisfies a predicate.
+ * @since 1.18.0
+ * @category computed
+ */
+export const some = dual(2, function some(ref, predicate) {
+    return RefSubject.map(ref, HashSet.some(predicate));
+});
+/**
+ * Check if all values satisfy a predicate.
+ * @since 1.18.0
+ * @category computed
+ */
+export const every = dual(2, function every(ref, predicate) {
+    return RefSubject.map(ref, HashSet.every(predicate));
+});
+/**
+ * Check if this set is a subset of another.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isSubset = dual(2, function isSubset(ref, that) {
+    return RefSubject.map(ref, HashSet.isSubset(that));
+});
+/**
+ * Map values to a different type.
+ * @since 1.18.0
+ * @category computed
+ */
+export const mapValues = dual(2, function mapValues(ref, f) {
+    return RefSubject.map(ref, HashSet.map(f));
+});
+/**
+ * Filter values creating a Computed value.
+ * @since 1.18.0
+ * @category computed
+ */
+export const filterValues = dual(2, function filterValues(ref, predicate) {
+    return RefSubject.map(ref, HashSet.filter(predicate));
+});
+/**
+ * Reduce the values to a single value.
+ * @since 1.18.0
+ * @category computed
+ */
+export const reduce = dual(3, function reduce(ref, b, f) {
+    return RefSubject.map(ref, HashSet.reduce(b, f));
+});
+/**
+ * Get all values as an array.
+ * @since 1.18.0
+ * @category computed
+ */
+export const values = (ref) => RefSubject.map(ref, (s) => Array.from(s));