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

package/dist/RefSubject/RefChunk.d.ts

@@ -23,7 +23,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 RefChunk<in out A, in out E = never, out R = never> extends RefSubject.RefSubject<Chunk.Chunk<A>, E, R> {
 }
@@ -41,7 +41,7 @@ export interface RefChunk<in out A, in out E = never, out R = never> extends Ref
  * and cleanup; source failures and services stay on reads and pushes.
  *
  * @since 1.18.0
- * @category constructors
+ * @category Constructors
  */
 export declare function make<A, E = never, R = never>(initial: Chunk.Chunk<A> | Effect.Effect<Chunk.Chunk<A>, E, R> | Fx.Fx<Chunk.Chunk<A>, E, R>, eq?: Equivalence<A>): Effect.Effect<RefChunk<A, E>, never, R | Scope.Scope>;
 /**
@@ -58,7 +58,7 @@ export declare function make<A, E = never, R = never>(initial: Chunk.Chunk<A> |
  * 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 prepend: {
     <A>(value: A): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -78,7 +78,7 @@ export declare const prepend: {
  * 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 prependAll: {
     <A>(value: Iterable<A>): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -98,7 +98,7 @@ export declare const prependAll: {
  * 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 append: {
     <A>(value: A): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -118,7 +118,7 @@ export declare const append: {
  * 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 appendAll: {
     <A>(value: Iterable<A>): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -138,7 +138,7 @@ export declare const appendAll: {
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const drop: {
     (n: number): <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -158,7 +158,7 @@ export declare const drop: {
  * 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 dropRight: {
     (n: number): <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -178,7 +178,7 @@ export declare const dropRight: {
  * 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 dropWhile: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -198,7 +198,7 @@ export declare const dropWhile: {
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const take: {
     (n: number): <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -218,7 +218,7 @@ export declare const take: {
  * 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 takeRight: {
     (n: number): <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -238,7 +238,7 @@ export declare const takeRight: {
  * 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 takeWhile: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -258,7 +258,7 @@ export declare const takeWhile: {
  * 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 modifyAt: {
     <A>(index: number, f: (a: A) => A): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -278,7 +278,7 @@ export declare const modifyAt: {
  * 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 replaceAt: {
     <A>(index: number, a: A): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -298,7 +298,7 @@ export declare const replaceAt: {
  * 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: {
     (index: number): <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -317,7 +317,7 @@ export declare const remove: {
  * The Effect starts when run, participates in the source ref's serialized update boundary, and
  * acquires no resource. It returns the committed chunk and retains the ref's E and R channels.
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const filter: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -336,7 +336,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 chunk and retains the ref's E and R channels.
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const map: {
     <A>(f: (a: A, index: number) => A): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -356,7 +356,7 @@ export declare const map: {
  * 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 dedupe: <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
 /**
@@ -373,7 +373,7 @@ export declare const dedupe: <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<
  * 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 dedupeAdjacent: <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
 /**
@@ -390,7 +390,7 @@ export declare const dedupeAdjacent: <A, E, R>(ref: RefChunk<A, E, R>) => 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 reverse: <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
 /**
@@ -407,7 +407,7 @@ export declare const reverse: <A, E, R>(ref: RefChunk<A, E, R>) => Effect.Effect
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export declare const sort: {
     <A>(order: Order.Order<A>): <E, R>(ref: RefChunk<A, E, R>) => Effect.Effect<Chunk.Chunk<A>, E, R>;
@@ -427,7 +427,7 @@ export declare const sort: {
  * 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, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -444,7 +444,7 @@ export declare const isEmpty: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Co
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const isNonEmpty: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<boolean, E, R>;
 /**
@@ -461,7 +461,7 @@ export declare const isNonEmpty: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject
  * 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, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<number, E, R>;
 /**
@@ -478,7 +478,7 @@ export declare const size: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Compu
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const mapValues: {
     <A, B>(f: (a: A, index: number) => B): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<Chunk.Chunk<B>, E, R>;
@@ -498,7 +498,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: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<Chunk.Chunk<A>, E, R>;
@@ -518,7 +518,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 partition: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<[Chunk.Chunk<A>, Chunk.Chunk<A>], E, R>;
@@ -538,7 +538,7 @@ export declare const partition: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export declare const reduce: {
     <A, B>(b: B, f: (b: B, a: A, index: number) => B): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<B, E, R>;
@@ -558,7 +558,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 reduceRight: {
     <A, B>(b: B, f: (b: B, a: A, index: number) => B): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<B, E, R>;
@@ -578,7 +578,7 @@ export declare const reduceRight: {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export declare const some: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -598,7 +598,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: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -618,7 +618,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 contains: {
     <A>(value: A): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Computed<boolean, E, R>;
@@ -638,7 +638,7 @@ export declare const contains: {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const getIndex: {
     (index: number): <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filtered<A, E, R>;
@@ -658,7 +658,7 @@ export declare const getIndex: {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const head: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filtered<A, E, R>;
 /**
@@ -675,7 +675,7 @@ export declare const head: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filte
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const last: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filtered<A, E, R>;
 /**
@@ -692,7 +692,7 @@ export declare const last: <A, E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filte
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const findFirst: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filtered<A, E, R>;
@@ -712,7 +712,7 @@ export declare const findFirst: {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export declare const findLast: {
     <A>(predicate: (a: A) => boolean): <E, R>(ref: RefChunk<A, E, R>) => RefSubject.Filtered<A, E, R>;

package/dist/RefSubject/RefChunk.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, eq = equals) {
     return RefSubject.make(initial, { eq: Chunk.makeEquivalence(eq) });
@@ -41,7 +41,7 @@ export function make(initial, eq = equals) {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const prepend = dual(2, function prepend(ref, value) {
     return RefSubject.update(ref, Chunk.prepend(value));
@@ -60,7 +60,7 @@ export const prepend = dual(2, function prepend(ref, 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 prependAll = dual(2, function prependAll(ref, value) {
     return RefSubject.update(ref, Chunk.prependAll(Chunk.fromIterable(value)));
@@ -79,7 +79,7 @@ export const prependAll = dual(2, function prependAll(ref, 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 append = dual(2, function append(ref, value) {
     return RefSubject.update(ref, Chunk.append(value));
@@ -98,7 +98,7 @@ export const append = dual(2, function append(ref, 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 appendAll = dual(2, function appendAll(ref, value) {
     return RefSubject.update(ref, Chunk.appendAll(Chunk.fromIterable(value)));
@@ -117,7 +117,7 @@ export const appendAll = dual(2, function appendAll(ref, value) {
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const drop = dual(2, function drop(ref, n) {
     return RefSubject.update(ref, Chunk.drop(n));
@@ -136,7 +136,7 @@ export const drop = dual(2, function drop(ref, n) {
  * 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 dropRight = dual(2, function dropRight(ref, n) {
     return RefSubject.update(ref, Chunk.dropRight(n));
@@ -155,7 +155,7 @@ export const dropRight = dual(2, function dropRight(ref, n) {
  * 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 dropWhile = dual(2, function dropWhile(ref, predicate) {
     return RefSubject.update(ref, Chunk.dropWhile(predicate));
@@ -174,7 +174,7 @@ export const dropWhile = dual(2, function dropWhile(ref, predicate) {
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const take = dual(2, function take(ref, n) {
     return RefSubject.update(ref, Chunk.take(n));
@@ -193,7 +193,7 @@ export const take = dual(2, function take(ref, n) {
  * 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 takeRight = dual(2, function takeRight(ref, n) {
     return RefSubject.update(ref, Chunk.takeRight(n));
@@ -212,7 +212,7 @@ export const takeRight = dual(2, function takeRight(ref, n) {
  * 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 takeWhile = dual(2, function takeWhile(ref, predicate) {
     return RefSubject.update(ref, Chunk.takeWhile(predicate));
@@ -231,7 +231,7 @@ export const takeWhile = dual(2, function takeWhile(ref, predicate) {
  * 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, index, f) {
     return RefSubject.update(ref, (chunk) => Option.getOrElse(Chunk.modify(chunk, index, f), () => chunk));
@@ -250,7 +250,7 @@ export const modifyAt = dual(3, function modifyAt(ref, index, 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 replaceAt = dual(3, function replaceAt(ref, index, a) {
     return RefSubject.update(ref, (chunk) => Option.getOrElse(Chunk.replace(chunk, index, a), () => chunk));
@@ -269,7 +269,7 @@ export const replaceAt = dual(3, function replaceAt(ref, index, a) {
  * 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, index) {
     return RefSubject.update(ref, Chunk.remove(index));
@@ -287,7 +287,7 @@ export const remove = dual(2, function remove(ref, index) {
  * The Effect starts when run, participates in the source ref's serialized update boundary, and
  * acquires no resource. It returns the committed chunk 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, Chunk.filter(predicate));
@@ -305,7 +305,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 chunk 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, Chunk.map(f));
@@ -324,7 +324,7 @@ export const map = dual(2, function map(ref, f) {
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const dedupe = (ref) => RefSubject.update(ref, Chunk.dedupe);
 /**
@@ -341,7 +341,7 @@ export const dedupe = (ref) => RefSubject.update(ref, Chunk.dedupe);
  * 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 dedupeAdjacent = (ref) => RefSubject.update(ref, Chunk.dedupeAdjacent);
 /**
@@ -358,7 +358,7 @@ export const dedupeAdjacent = (ref) => RefSubject.update(ref, Chunk.dedupeAdjace
  * It acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const reverse = (ref) => RefSubject.update(ref, Chunk.reverse);
 /**
@@ -375,7 +375,7 @@ export const reverse = (ref) => RefSubject.update(ref, Chunk.reverse);
  * acquires no resource; failures and services remain those of the source ref.
  *
  * @since 1.18.0
- * @category combinators
+ * @category State updates
  */
 export const sort = dual(2, function sort(ref, order) {
     return RefSubject.update(ref, Chunk.sort(order));
@@ -397,7 +397,7 @@ export const sort = dual(2, function sort(ref, order) {
  * 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, Chunk.isEmpty);
 /**
@@ -414,7 +414,7 @@ export const isEmpty = (ref) => RefSubject.map(ref, Chunk.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, Chunk.isNonEmpty);
 /**
@@ -431,7 +431,7 @@ export const isNonEmpty = (ref) => RefSubject.map(ref, Chunk.isNonEmpty);
  * 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, Chunk.size);
 /**
@@ -448,7 +448,7 @@ export const size = (ref) => RefSubject.map(ref, Chunk.size);
  * 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, Chunk.map(f));
@@ -467,7 +467,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, Chunk.filter(predicate));
@@ -486,7 +486,7 @@ export const filterValues = dual(2, function filterValues(ref, predicate) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category Derived queries
  */
 export const partition = dual(2, function partition(ref, predicate) {
     return RefSubject.map(ref, Chunk.partition(Result.liftPredicate(predicate, Result.fail)));
@@ -505,7 +505,7 @@ export const partition = dual(2, function partition(ref, predicate) {
  * 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, Chunk.reduce(b, f));
@@ -524,7 +524,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 Derived queries
  */
 export const reduceRight = dual(3, function reduceRight(ref, b, f) {
     return RefSubject.map(ref, Chunk.reduceRight(b, f));
@@ -543,7 +543,7 @@ export const reduceRight = dual(3, function reduceRight(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, Chunk.some(predicate));
@@ -562,7 +562,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, Chunk.every(predicate));
@@ -581,7 +581,7 @@ export const every = dual(2, function every(ref, predicate) {
  * observation follows later pushes and its observing Scope owns subscription cleanup.
  *
  * @since 1.18.0
- * @category computed
+ * @category State predicates
  */
 export const contains = dual(2, function contains(ref, value) {
     return RefSubject.map(ref, Chunk.contains(value));
@@ -603,7 +603,7 @@ export const contains = dual(2, function contains(ref, value) {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export const getIndex = dual(2, function getIndex(ref, index) {
     return RefSubject.filterMap(ref, Chunk.get(index));
@@ -622,7 +622,7 @@ export const getIndex = dual(2, function getIndex(ref, index) {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export const head = (ref) => RefSubject.filterMap(ref, Chunk.head);
 /**
@@ -639,7 +639,7 @@ export const head = (ref) => RefSubject.filterMap(ref, Chunk.head);
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export const last = (ref) => RefSubject.filterMap(ref, Chunk.last);
 /**
@@ -656,7 +656,7 @@ export const last = (ref) => RefSubject.filterMap(ref, Chunk.last);
  * 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, Chunk.findFirst(predicate));
@@ -675,7 +675,7 @@ export const findFirst = dual(2, function findFirst(ref, predicate) {
  * while absent; the observing Scope owns and finalizes its Fx subscription.
  *
  * @since 1.18.0
- * @category filtered
+ * @category Optional queries
  */
 export const findLast = dual(2, function findLast(ref, predicate) {
     return RefSubject.filterMap(ref, Chunk.findLast(predicate));