@typed/fx 2.0.0-beta.5 → 2.0.0-beta.7

package/dist/RefSubject/RefHashMap.js

@@ -22,7 +22,7 @@ import { Result } from "effect";
  * and cleanup; source failures and services stay on reads and pushes.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export function make(initial) {
     return RefSubject.make(initial, { eq: equals });
@@ -44,7 +44,7 @@ export function make(initial) {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const set = dual(3, function set(ref, key, value) {
     return RefSubject.update(ref, HashMap.set(key, value));
@@ -63,7 +63,7 @@ export const set = dual(3, function set(ref, key, value) {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const remove = dual(2, function remove(ref, key) {
     return RefSubject.update(ref, HashMap.remove(key));
@@ -82,7 +82,7 @@ export const remove = dual(2, function remove(ref, key) {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const modify = dual(3, function modify(ref, key, f) {
     return RefSubject.update(ref, HashMap.modify(key, f));
@@ -101,7 +101,7 @@ export const modify = dual(3, function modify(ref, key, f) {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const modifyAt = dual(3, function modifyAt(ref, key, f) {
     return RefSubject.update(ref, HashMap.modifyAt(key, f));
@@ -120,7 +120,7 @@ export const modifyAt = dual(3, function modifyAt(ref, key, f) {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const setMany = dual(2, function setMany(ref, entries) {
     return RefSubject.update(ref, HashMap.setMany(entries));
@@ -139,7 +139,7 @@ export const setMany = dual(2, function setMany(ref, entries) {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const removeMany = dual(2, function removeMany(ref, keys) {
     return RefSubject.update(ref, HashMap.removeMany(keys));
@@ -158,7 +158,7 @@ export const removeMany = dual(2, function removeMany(ref, keys) {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const clear = (ref) => RefSubject.update(ref, () => HashMap.empty());
 /**
@@ -175,7 +175,7 @@ export const clear = (ref) => RefSubject.update(ref, () => HashMap.empty());
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const union = dual(2, function union(ref, that) {
     return RefSubject.update(ref, HashMap.union(that));
@@ -193,7 +193,7 @@ export const union = dual(2, function union(ref, that) {
  * The Effect starts when run, participates in the source ref's serialized update boundary, and
  * acquires no resource. It returns the committed HashMap and retains the ref's E and R channels.
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const filter = dual(2, function filter(ref, predicate) {
     return RefSubject.update(ref, HashMap.filter(predicate));
@@ -211,7 +211,7 @@ export const filter = dual(2, function filter(ref, predicate) {
  * The Effect starts when run, participates in the source ref's serialized update boundary, and
  * acquires no resource. It returns the committed HashMap and retains the ref's E and R channels.
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const map = dual(2, function map(ref, f) {
     return RefSubject.update(ref, HashMap.map(f));
@@ -233,7 +233,7 @@ export const map = dual(2, function map(ref, f) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const size = (ref) => RefSubject.map(ref, HashMap.size);
 /**
@@ -250,7 +250,7 @@ export const size = (ref) => RefSubject.map(ref, HashMap.size);
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const isEmpty = (ref) => RefSubject.map(ref, HashMap.isEmpty);
 /**
@@ -267,7 +267,7 @@ export const isEmpty = (ref) => RefSubject.map(ref, HashMap.isEmpty);
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const isNonEmpty = (ref) => RefSubject.map(ref, (m) => !HashMap.isEmpty(m));
 /**
@@ -284,7 +284,7 @@ export const isNonEmpty = (ref) => RefSubject.map(ref, (m) => !HashMap.isEmpty(m
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const keys = (ref) => RefSubject.map(ref, (m) => Array.from(HashMap.keys(m)));
 /**
@@ -301,7 +301,7 @@ export const keys = (ref) => RefSubject.map(ref, (m) => Array.from(HashMap.keys(
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const values = (ref) => RefSubject.map(ref, HashMap.toValues);
 /**
@@ -318,7 +318,7 @@ export const values = (ref) => RefSubject.map(ref, HashMap.toValues);
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const entries = (ref) => RefSubject.map(ref, HashMap.toEntries);
 /**
@@ -335,7 +335,7 @@ export const entries = (ref) => RefSubject.map(ref, HashMap.toEntries);
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const has = dual(2, function has(ref, key) {
     return RefSubject.map(ref, HashMap.has(key));
@@ -354,7 +354,7 @@ export const has = dual(2, function has(ref, key) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const mapValues = dual(2, function mapValues(ref, f) {
     return RefSubject.map(ref, HashMap.map(f));
@@ -373,7 +373,7 @@ export const mapValues = dual(2, function mapValues(ref, f) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const filterValues = dual(2, function filterValues(ref, predicate) {
     return RefSubject.map(ref, HashMap.filter(predicate));
@@ -392,7 +392,7 @@ export const filterValues = dual(2, function filterValues(ref, predicate) {
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const filterMapValues = dual(2, function filterMapValues(ref, f) {
     return RefSubject.map(ref, HashMap.filterMap((value, key) => Option.match(f(value, key), {
@@ -414,7 +414,7 @@ export const filterMapValues = dual(2, function filterMapValues(ref, f) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const reduce = dual(3, function reduce(ref, b, f) {
     return RefSubject.map(ref, HashMap.reduce(b, f));
@@ -433,7 +433,7 @@ export const reduce = dual(3, function reduce(ref, b, f) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const some = dual(2, function some(ref, predicate) {
     return RefSubject.map(ref, HashMap.some(predicate));
@@ -452,7 +452,7 @@ export const some = dual(2, function some(ref, predicate) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const every = dual(2, function every(ref, predicate) {
     return RefSubject.map(ref, HashMap.every(predicate));
@@ -474,7 +474,7 @@ export const every = dual(2, function every(ref, predicate) {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export const get = dual(2, function get(ref, key) {
     return RefSubject.filterMap(ref, HashMap.get(key));
@@ -493,7 +493,7 @@ export const get = dual(2, function get(ref, key) {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export const findFirst = dual(2, function findFirst(ref, predicate) {
     return RefSubject.filterMap(ref, (g) => HashMap.findFirst(g, predicate));

package/dist/RefSubject/RefHashRing.d.ts

@@ -22,7 +22,7 @@ import * as RefSubject from "./RefSubject.js";
  * services, interruption, and Scope requirements expressed by its members.
  *
  * @since 1.18.0
- * @category models
+ * @category State models
  */
 export interface RefHashRing<in out A extends PrimaryKey.PrimaryKey, in out E = never, out R = never> extends RefSubject.RefSubject<HashRing.HashRing<A>, E, R> {
 }
@@ -40,7 +40,7 @@ export interface RefHashRing<in out A extends PrimaryKey.PrimaryKey, in out E =
  * and cleanup; source failures and services stay on reads and pushes.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export declare function make<A extends PrimaryKey.PrimaryKey, E = never, R = never>(initial: HashRing.HashRing<A> | Effect.Effect<HashRing.HashRing<A>, E, R> | Fx.Fx<HashRing.HashRing<A>, E, R>): Effect.Effect<RefHashRing<A, E>, never, R | Scope.Scope>;
 /**
@@ -57,7 +57,7 @@ export declare function make<A extends PrimaryKey.PrimaryKey, E = never, R = nev
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export declare function empty<A extends PrimaryKey.PrimaryKey, E = never, R = never>(options?: {
     readonly baseWeight?: number;
@@ -76,7 +76,7 @@ export declare function empty<A extends PrimaryKey.PrimaryKey, E = never, R = ne
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const add: {
     <A extends PrimaryKey.PrimaryKey>(node: A, options?: {
@@ -100,7 +100,7 @@ export declare const add: {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const addMany: {
     <A extends PrimaryKey.PrimaryKey>(nodes: Iterable<A>, options?: {
@@ -124,7 +124,7 @@ export declare const addMany: {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const remove: {
     <A extends PrimaryKey.PrimaryKey>(node: A): <E, R>(ref: RefHashRing<A, E, R>) => Effect.Effect<HashRing.HashRing<A>, E, R>;
@@ -144,7 +144,7 @@ export declare const remove: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const has: {
     <A extends PrimaryKey.PrimaryKey>(node: A): <E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -164,7 +164,7 @@ export declare const has: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const size: <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Computed<number, E, R>;
 /**
@@ -181,7 +181,7 @@ export declare const size: <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashR
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const isEmpty: <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -199,7 +199,7 @@ export declare const isEmpty: <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHa
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const getNode: {
     (input: string): <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Computed<A | undefined, E, R>;
@@ -220,7 +220,7 @@ export declare const getNode: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const getShards: {
     (count: number): <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Computed<Array<A> | undefined, E, R>;
@@ -240,7 +240,7 @@ export declare const getShards: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const values: <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Computed<Array<A>, E, R>;
 /**
@@ -258,7 +258,7 @@ export declare const values: <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHas
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const get: {
     (input: string): <A extends PrimaryKey.PrimaryKey, E, R>(ref: RefHashRing<A, E, R>) => RefSubject.Filtered<A, E, R>;

package/dist/RefSubject/RefHashRing.js

@@ -21,7 +21,7 @@ import * as RefSubject from "./RefSubject.js";
  * and cleanup; source failures and services stay on reads and pushes.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export function make(initial) {
     return RefSubject.make(initial, { eq: equals });
@@ -40,7 +40,7 @@ export function make(initial) {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export function empty(options) {
     return RefSubject.make(HashRing.make(options), { eq: equals });
@@ -67,7 +67,7 @@ function copyRing(ring) {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 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));
@@ -86,7 +86,7 @@ export const add = dual((args) => RefSubject.isRefSubject(args[0]), function add
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 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));
@@ -105,7 +105,7 @@ export const addMany = dual((args) => RefSubject.isRefSubject(args[0]), function
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const remove = dual(2, function remove(ref, node) {
     return RefSubject.update(ref, (ring) => HashRing.remove(copyRing(ring), node));
@@ -127,7 +127,7 @@ export const remove = dual(2, function remove(ref, node) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const has = dual(2, function has(ref, node) {
     return RefSubject.map(ref, HashRing.has(node));
@@ -146,7 +146,7 @@ export const has = dual(2, function has(ref, node) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const size = (ref) => RefSubject.map(ref, (ring) => ring.nodes.size);
 /**
@@ -163,7 +163,7 @@ export const size = (ref) => RefSubject.map(ref, (ring) => ring.nodes.size);
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const isEmpty = (ref) => RefSubject.map(ref, (ring) => ring.nodes.size === 0);
 /**
@@ -181,7 +181,7 @@ export const isEmpty = (ref) => RefSubject.map(ref, (ring) => ring.nodes.size ==
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const getNode = dual(2, function getNode(ref, input) {
     return RefSubject.map(ref, (ring) => HashRing.get(ring, input));
@@ -201,7 +201,7 @@ export const getNode = dual(2, function getNode(ref, input) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const getShards = dual(2, function getShards(ref, count) {
     return RefSubject.map(ref, (ring) => HashRing.getShards(ring, count));
@@ -220,7 +220,7 @@ export const getShards = dual(2, function getShards(ref, count) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const values = (ref) => RefSubject.map(ref, (ring) => Array.from(ring));
 // ========================================
@@ -241,7 +241,7 @@ export const values = (ref) => RefSubject.map(ref, (ring) => Array.from(ring));
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 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

@@ -21,7 +21,7 @@ import * as RefSubject from "./RefSubject.js";
  * services, interruption, and Scope requirements expressed by its members.
  *
  * @since 1.18.0
- * @category models
+ * @category State models
  */
 export interface RefHashSet<in out V, in out E = never, out R = never> extends RefSubject.RefSubject<HashSet.HashSet<V>, E, R> {
 }
@@ -39,7 +39,7 @@ export interface RefHashSet<in out V, in out E = never, out R = never> extends R
  * and cleanup; source failures and services stay on reads and pushes.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export declare function make<V, E = never, R = never>(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>;
 /**
@@ -56,7 +56,7 @@ export declare function make<V, E = never, R = never>(initial: HashSet.HashSet<V
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const add: {
     <V>(value: V): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -76,7 +76,7 @@ export declare const add: {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const remove: {
     <V>(value: V): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -96,7 +96,7 @@ export declare const remove: {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const clear: <V, E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
 /**
@@ -113,7 +113,7 @@ export declare const clear: <V, E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const union: {
     <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -133,7 +133,7 @@ export declare const union: {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const intersection: {
     <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -153,7 +153,7 @@ export declare const intersection: {
  * value. It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const difference: {
     <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -172,7 +172,7 @@ export declare const difference: {
  * The Effect starts when run, participates in the source ref's serialized update boundary, and
  * acquires no resource. It returns the committed HashSet and retains the ref's E and R channels.
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const filter: {
     <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -191,7 +191,7 @@ export declare const filter: {
  * The Effect starts when run, participates in the source ref's serialized update boundary, and
  * acquires no resource. It returns the committed HashSet and retains the ref's E and R channels.
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const map: {
     <V>(f: (value: V) => V): <E, R>(ref: RefHashSet<V, E, R>) => Effect.Effect<HashSet.HashSet<V>, E, R>;
@@ -211,7 +211,7 @@ export declare const map: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const size: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<number, E, R>;
 /**
@@ -228,7 +228,7 @@ export declare const size: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Com
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const isEmpty: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -245,7 +245,7 @@ export declare const isEmpty: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const isNonEmpty: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -262,7 +262,7 @@ export declare const isNonEmpty: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubje
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const has: {
     <V>(value: V): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -282,7 +282,7 @@ export declare const has: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const some: {
     <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -302,7 +302,7 @@ export declare const some: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const every: {
     <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -322,7 +322,7 @@ export declare const every: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const isSubset: {
     <V>(that: HashSet.HashSet<V>): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -342,7 +342,7 @@ export declare const isSubset: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const mapValues: {
     <V, B>(f: (value: V) => B): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<HashSet.HashSet<B>, E, R>;
@@ -362,7 +362,7 @@ export declare const mapValues: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const filterValues: {
     <V>(predicate: (value: V) => boolean): <E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<HashSet.HashSet<V>, E, R>;
@@ -382,7 +382,7 @@ export declare const filterValues: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 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>;
@@ -402,7 +402,7 @@ export declare const reduce: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const values: <V, E, R>(ref: RefHashSet<V, E, R>) => RefSubject.Computed<Array<V>, E, R>;
 //# sourceMappingURL=RefHashSet.d.ts.map