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

package/dist/RefSubject/RefTrie.d.ts

@@ -22,7 +22,7 @@ import * as RefSubject from "./RefSubject.js";
  * interruption, and Scope requirements expressed by its members.
  *
  * @since 1.18.0
- * @category models
+ * @category State models
  */
 export interface RefTrie<in out V, in out E = never, out R = never> extends RefSubject.RefSubject<Trie.Trie<V>, E, R> {
 }
@@ -40,7 +40,7 @@ export interface RefTrie<in out V, in out E = never, out R = never> extends RefS
  * 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: Trie.Trie<V> | Effect.Effect<Trie.Trie<V>, E, R> | Fx.Fx<Trie.Trie<V>, E, R>): Effect.Effect<RefTrie<V, E>, never, R | Scope.Scope>;
 /**
@@ -57,7 +57,7 @@ export declare function make<V, E = never, R = never>(initial: Trie.Trie<V> | Ef
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const insert: {
     <V>(key: string, value: V): <E, R>(ref: RefTrie<V, E, R>) => Effect.Effect<Trie.Trie<V>, E, R>;
@@ -77,7 +77,7 @@ export declare const insert: {
  * 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 insertMany: {
     <V>(entries: Iterable<[string, V]>): <E, R>(ref: RefTrie<V, E, R>) => Effect.Effect<Trie.Trie<V>, E, R>;
@@ -97,7 +97,7 @@ export declare const insertMany: {
  * 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: {
     (key: string): <V, E, R>(ref: RefTrie<V, E, R>) => Effect.Effect<Trie.Trie<V>, E, R>;
@@ -117,7 +117,7 @@ export declare const remove: {
  * 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 removeMany: {
     (keys: Iterable<string>): <V, E, R>(ref: RefTrie<V, E, R>) => Effect.Effect<Trie.Trie<V>, E, R>;
@@ -137,7 +137,7 @@ export declare const removeMany: {
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const modify: {
     <V>(key: string, f: (v: V) => V): <E, R>(ref: RefTrie<V, E, R>) => Effect.Effect<Trie.Trie<V>, E, R>;
@@ -157,7 +157,7 @@ export declare const modify: {
  * 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: RefTrie<V, E, R>) => Effect.Effect<Trie.Trie<V>, E, R>;
 /**
@@ -174,7 +174,7 @@ export declare const clear: <V, E, R>(ref: RefTrie<V, E, R>) => Effect.Effect<Tr
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const map: {
     <V>(f: (value: V, key: string) => V): <E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Trie.Trie<V>, E, R>;
@@ -194,7 +194,7 @@ export declare const map: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const filter: {
     <V>(predicate: (value: V, key: string) => boolean): <E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Trie.Trie<V>, E, R>;
@@ -214,7 +214,7 @@ export declare const filter: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const filterMap: {
     <V>(f: (value: V, key: string) => Option.Option<V>): <E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Trie.Trie<V>, E, R>;
@@ -234,7 +234,7 @@ export declare const filterMap: {
  * source errors, services, and lifetime.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const compact: <V, E, R>(ref: RefTrie<Option.Option<V>, E, R>) => RefSubject.Computed<Trie.Trie<V>, E, R>;
 /**
@@ -251,7 +251,7 @@ export declare const compact: <V, E, R>(ref: RefTrie<Option.Option<V>, E, R>) =>
  * 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: RefTrie<V, E, R>) => RefSubject.Computed<number, E, R>;
 /**
@@ -268,7 +268,7 @@ export declare const size: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Comput
  * 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: RefTrie<V, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -285,7 +285,7 @@ export declare const isEmpty: <V, E, R>(ref: RefTrie<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 isNonEmpty: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -302,7 +302,7 @@ export declare const isNonEmpty: <V, E, R>(ref: RefTrie<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 has: {
     (key: string): <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -322,7 +322,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 keys: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Array<string>, E, R>;
 /**
@@ -339,7 +339,7 @@ export declare const keys: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Comput
  * 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: RefTrie<V, E, R>) => RefSubject.Computed<Array<V>, E, R>;
 /**
@@ -356,7 +356,7 @@ export declare const values: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Comp
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const entries: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Array<[string, V]>, E, R>;
 /**
@@ -373,7 +373,7 @@ export declare const entries: <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Com
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const keysWithPrefix: {
     (prefix: string): <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Array<string>, E, R>;
@@ -393,7 +393,7 @@ export declare const keysWithPrefix: {
  * once; Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const valuesWithPrefix: {
     (prefix: string): <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Array<V>, E, R>;
@@ -413,7 +413,7 @@ export declare const valuesWithPrefix: {
  * once; Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const entriesWithPrefix: {
     (prefix: string): <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Array<[string, V]>, E, R>;
@@ -433,7 +433,7 @@ export declare const entriesWithPrefix: {
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const longestPrefixOf: {
     (key: string): <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<[string, V] | undefined, E, R>;
@@ -453,7 +453,7 @@ export declare const longestPrefixOf: {
  * 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, key: string) => B): <E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<Trie.Trie<B>, E, R>;
@@ -473,7 +473,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 reduce: {
     <V, B>(b: B, f: (b: B, value: V, key: string) => B): <E, R>(ref: RefTrie<V, E, R>) => RefSubject.Computed<B, E, R>;
@@ -493,7 +493,7 @@ export declare const reduce: {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const get: {
     (key: string): <V, E, R>(ref: RefTrie<V, E, R>) => RefSubject.Filtered<V, E, R>;

package/dist/RefSubject/RefTrie.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) {
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const insert = dual(3, function insert(ref, key, value) {
     return RefSubject.update(ref, Trie.insert(key, value));
@@ -63,7 +63,7 @@ export const insert = dual(3, function insert(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 insertMany = dual(2, function insertMany(ref, entries) {
     return RefSubject.update(ref, Trie.insertMany(entries));
@@ -82,7 +82,7 @@ export const insertMany = dual(2, function insertMany(ref, entries) {
  * 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, Trie.remove(key));
@@ -101,7 +101,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 removeMany = dual(2, function removeMany(ref, keys) {
     return RefSubject.update(ref, Trie.removeMany(keys));
@@ -120,7 +120,7 @@ export const removeMany = dual(2, function removeMany(ref, keys) {
  * 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, Trie.modify(key, f));
@@ -139,7 +139,7 @@ export const modify = dual(3, function modify(ref, key, f) {
  * 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, () => Trie.empty());
 /**
@@ -156,7 +156,7 @@ export const clear = (ref) => RefSubject.update(ref, () => Trie.empty());
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const map = dual(2, function map(ref, f) {
     return RefSubject.map(ref, Trie.map(f));
@@ -175,7 +175,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 combinators
+ * @category State updates
  */
 export const filter = dual(2, function filter(ref, predicate) {
     return RefSubject.map(ref, Trie.filter(predicate));
@@ -194,7 +194,7 @@ export const filter = dual(2, function filter(ref, predicate) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const filterMap = dual(2, function filterMap(ref, f) {
     return RefSubject.map(ref, Trie.filterMap((value, key) => Option.match(f(value, key), {
@@ -219,7 +219,7 @@ export const filterMap = dual(2, function filterMap(ref, f) {
  * source errors, services, and lifetime.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const compact = (ref) => RefSubject.map(ref, Trie.compact);
 /**
@@ -236,7 +236,7 @@ export const compact = (ref) => RefSubject.map(ref, Trie.compact);
  * 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, Trie.size);
 /**
@@ -253,7 +253,7 @@ export const size = (ref) => RefSubject.map(ref, Trie.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, Trie.isEmpty);
 /**
@@ -270,7 +270,7 @@ export const isEmpty = (ref) => RefSubject.map(ref, Trie.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, (t) => !Trie.isEmpty(t));
 /**
@@ -287,7 +287,7 @@ export const isNonEmpty = (ref) => RefSubject.map(ref, (t) => !Trie.isEmpty(t));
  * 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, Trie.has(key));
@@ -306,7 +306,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 keys = (ref) => RefSubject.map(ref, (t) => Array.from(Trie.keys(t)));
 /**
@@ -323,7 +323,7 @@ export const keys = (ref) => RefSubject.map(ref, (t) => Array.from(Trie.keys(t))
  * 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, (t) => Array.from(Trie.values(t)));
 /**
@@ -340,7 +340,7 @@ export const values = (ref) => RefSubject.map(ref, (t) => Array.from(Trie.values
  * 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, Trie.toEntries);
 /**
@@ -357,7 +357,7 @@ export const entries = (ref) => RefSubject.map(ref, Trie.toEntries);
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const keysWithPrefix = dual(2, function keysWithPrefix(ref, prefix) {
     return RefSubject.map(ref, (t) => Array.from(Trie.keysWithPrefix(t, prefix)));
@@ -376,7 +376,7 @@ export const keysWithPrefix = dual(2, function keysWithPrefix(ref, prefix) {
  * once; Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const valuesWithPrefix = dual(2, function valuesWithPrefix(ref, prefix) {
     return RefSubject.map(ref, (t) => Array.from(Trie.valuesWithPrefix(t, prefix)));
@@ -395,7 +395,7 @@ export const valuesWithPrefix = dual(2, function valuesWithPrefix(ref, prefix) {
  * once; Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const entriesWithPrefix = dual(2, function entriesWithPrefix(ref, prefix) {
     return RefSubject.map(ref, Trie.toEntriesWithPrefix(prefix));
@@ -414,7 +414,7 @@ export const entriesWithPrefix = dual(2, function entriesWithPrefix(ref, prefix)
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const longestPrefixOf = dual(2, function longestPrefixOf(ref, key) {
     return RefSubject.map(ref, Trie.longestPrefixOf(key));
@@ -433,7 +433,7 @@ export const longestPrefixOf = dual(2, function longestPrefixOf(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, Trie.map(f));
@@ -452,7 +452,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 reduce = dual(3, function reduce(ref, b, f) {
     return RefSubject.map(ref, Trie.reduce(b, f));
@@ -474,7 +474,7 @@ export const reduce = dual(3, function reduce(ref, b, f) {
  * 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, Trie.get(key));

package/dist/RefSubject/RefTuple.d.ts

@@ -21,7 +21,7 @@ import * as RefSubject from "./RefSubject.js";
  * interruption, and Scope requirements expressed by its members.
  *
  * @since 1.18.0
- * @category models
+ * @category State models
  */
 export interface RefTuple<in out T extends ReadonlyArray<unknown>, in out E = never, out R = never> extends RefSubject.RefSubject<T, E, R> {
 }
@@ -52,7 +52,7 @@ export interface RefTuple<in out T extends ReadonlyArray<unknown>, in out E = ne
  * ```
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export declare function make<T extends ReadonlyArray<unknown>, E = never, R = never>(initial: T | Effect.Effect<T, E, R> | Fx.Fx<T, E, R>, eq?: Equivalence<T>): Effect.Effect<RefTuple<T, E>, never, R | Scope.Scope>;
 /**
@@ -69,7 +69,7 @@ export declare function make<T extends ReadonlyArray<unknown>, 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 setAt: {
     <T extends ReadonlyArray<unknown>, I extends number>(index: I, value: T[I]): <E, R>(ref: RefTuple<T, E, R>) => Effect.Effect<T, E, R>;
@@ -89,7 +89,7 @@ export declare const setAt: {
  * 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 updateAt: {
     <T extends ReadonlyArray<unknown>, I extends number>(index: I, f: (value: T[I]) => T[I]): <E, R>(ref: RefTuple<T, E, R>) => Effect.Effect<T, E, R>;
@@ -109,7 +109,7 @@ export declare const updateAt: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const appendElement: {
     <E>(element: E): <T extends ReadonlyArray<unknown>, Err, R>(ref: RefTuple<T, Err, R>) => RefSubject.Computed<[...T, E], Err, R>;
@@ -129,7 +129,7 @@ export declare const appendElement: {
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const prependElement: {
     <E>(element: E): <T extends ReadonlyArray<unknown>, Err, R>(ref: RefTuple<T, Err, R>) => RefSubject.Computed<[E, ...T], Err, R>;
@@ -138,7 +138,7 @@ export declare const prependElement: {
 /**
  * Get the element at a specific index from the current state of a RefTuple.
  * @since 1.18.0
- * @category computed
+ * @category Type utilities
  */
 type Indices<T extends ReadonlyArray<unknown>> = Exclude<Partial<T>["length"], T["length"]>;
 /**
@@ -156,7 +156,7 @@ type Indices<T extends ReadonlyArray<unknown>> = Exclude<Partial<T>["length"], T
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category Derived queries
  */
 export declare const get: {
     <T extends ReadonlyArray<unknown>, I extends Indices<T> & keyof T>(index: I): <E, R>(ref: RefTuple<T, E, R>) => RefSubject.Computed<T[I], E, R>;
@@ -176,7 +176,7 @@ export declare const get: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const length: <T extends ReadonlyArray<unknown>, E, R>(ref: RefTuple<T, E, R>) => RefSubject.Computed<number, E, R>;
 /**
@@ -193,7 +193,7 @@ export declare const length: <T extends ReadonlyArray<unknown>, E, R>(ref: RefTu
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const pick: {
     <T extends ReadonlyArray<unknown>, const I extends ReadonlyArray<Indices<T>>>(indices: I): <E, R>(ref: RefTuple<T, E, R>) => RefSubject.Computed<Array<T[number]>, E, R>;
@@ -213,7 +213,7 @@ export declare const pick: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const omit: {
     <T extends ReadonlyArray<unknown>, const I extends ReadonlyArray<Indices<T>>>(indices: I): <E, R>(ref: RefTuple<T, E, R>) => RefSubject.Computed<Array<T[number]>, E, R>;

package/dist/RefSubject/RefTuple.js

@@ -34,7 +34,7 @@ import * as RefSubject from "./RefSubject.js";
  * ```
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export function make(initial, eq = Equivalence_.make((a, b) => equals(a, b))) {
     return RefSubject.make(initial, { eq });
@@ -53,7 +53,7 @@ export function make(initial, eq = Equivalence_.make((a, b) => equals(a, b))) {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const setAt = dual(3, function setAt(ref, index, value) {
     return RefSubject.update(ref, (self) => {
@@ -76,7 +76,7 @@ export const setAt = dual(3, function setAt(ref, index, 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 updateAt = dual(3, function updateAt(ref, index, f) {
     return RefSubject.update(ref, (self) => Tuple.evolve(self, { [index]: f }));
@@ -98,7 +98,7 @@ export const updateAt = dual(3, function updateAt(ref, index, f) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const appendElement = dual(2, function appendElement(ref, element) {
     return RefSubject.map(ref, (self) => Tuple.appendElement(self, element));
@@ -117,7 +117,7 @@ export const appendElement = dual(2, function appendElement(ref, element) {
  * Fx observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const prependElement = dual(2, function prependElement(ref, element) {
     return RefSubject.map(ref, (self) => [element, ...self]);
@@ -137,7 +137,7 @@ export const prependElement = dual(2, function prependElement(ref, element) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category combinators
+ * @category Derived queries
  */
 export const get = dual(2, function get(ref, index) {
     return RefSubject.map(ref, (self) => Tuple.get(self, index));
@@ -156,7 +156,7 @@ export const get = dual(2, function get(ref, index) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const length = (ref) => RefSubject.map(ref, (self) => self.length);
 /**
@@ -173,7 +173,7 @@ export const length = (ref) => RefSubject.map(ref, (self) => self.length);
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const pick = dual(2, function pick(ref, indices) {
     return RefSubject.map(ref, (self) => Tuple.pick(self, indices));
@@ -192,7 +192,7 @@ export const pick = dual(2, function pick(ref, indices) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const omit = dual(2, function omit(ref, indices) {
     return RefSubject.map(ref, (self) => Tuple.omit(self, indices));