effect 3.8.4 → 3.9.0

package/src/SortedMap.ts

@@ -5,7 +5,7 @@ import * as Equal from "./Equal.js"
 import * as Dual from "./Function.js"
 import { pipe } from "./Function.js"
 import * as Hash from "./Hash.js"
-import { format, type Inspectable, NodeInspectSymbol, toJSON } from "./Inspectable.js"
+import { DenoInspectSymbol, format, type Inspectable, NodeInspectSymbol, toJSON } from "./Inspectable.js"
 import * as Option from "./Option.js"
 import type { Order } from "./Order.js"
 import type { Pipeable } from "./Pipeable.js"
@@ -62,6 +62,9 @@ const SortedMapProto: Omit<SortedMap<unknown, unknown>, "tree"> = {
       values: Array.from(this).map(toJSON)
     }
   },
+  [DenoInspectSymbol]() {
+    return this.toJSON()
+  },
   [NodeInspectSymbol]() {
     return this.toJSON()
   },
@@ -81,7 +84,15 @@ const makeImpl = <K, V>(tree: RBT.RedBlackTree<K, V>): SortedMap<K, V> => {
  * @category refinements
  */
 export const isSortedMap: {
+  /**
+   * @since 2.0.0
+   * @category refinements
+   */
   <K, V>(u: Iterable<readonly [K, V]>): u is SortedMap<K, V>
+  /**
+   * @since 2.0.0
+   * @category refinements
+   */
   (u: unknown): u is SortedMap<unknown, unknown>
 } = (u: unknown): u is SortedMap<unknown, unknown> => hasProperty(u, TypeId)
 
@@ -98,7 +109,19 @@ export const empty = <K, V = never>(ord: Order<K>): SortedMap<K, V> => makeImpl<
  * @category constructors
  */
 export const fromIterable: {
+  /**
+   * Creates a new `SortedMap` from an iterable collection of key/value pairs.
+   *
+   * @since 2.0.0
+   * @category constructors
+   */
   <B>(ord: Order<B>): <K extends B, V>(iterable: Iterable<readonly [K, V]>) => SortedMap<K, V>
+  /**
+   * Creates a new `SortedMap` from an iterable collection of key/value pairs.
+   *
+   * @since 2.0.0
+   * @category constructors
+   */
   <K extends B, V, B>(iterable: Iterable<readonly [K, V]>, ord: Order<B>): SortedMap<K, V>
 } = Dual.dual(
   2,
@@ -134,7 +157,15 @@ export const isNonEmpty = <K, V>(self: SortedMap<K, V>): boolean => size(self) >
  * @category elements
  */
 export const get: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K>(key: K): <V>(self: SortedMap<K, V>) => Option.Option<V>
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K, V>(self: SortedMap<K, V>, key: K): Option.Option<V>
 } = Dual.dual<
   <K>(key: K) => <V>(self: SortedMap<K, V>) => Option.Option<V>,
@@ -154,7 +185,15 @@ export const getOrder = <K, V>(self: SortedMap<K, V>): Order<K> => RBT.getOrder(
  * @category elements
  */
 export const has: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K>(key: K): <V>(self: SortedMap<K, V>) => boolean
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K, V>(self: SortedMap<K, V>, key: K): boolean
 } = Dual.dual<
   <K>(key: K) => <V>(self: SortedMap<K, V>) => boolean,
@@ -172,7 +211,15 @@ export const headOption = <K, V>(self: SortedMap<K, V>): Option.Option<[K, V]> =
  * @category mapping
  */
 export const map: {
+  /**
+   * @since 2.0.0
+   * @category mapping
+   */
   <A, K, B>(f: (a: A, k: K) => B): (self: SortedMap<K, A>) => SortedMap<K, B>
+  /**
+   * @since 2.0.0
+   * @category mapping
+   */
   <K, A, B>(self: SortedMap<K, A>, f: (a: A, k: K) => B): SortedMap<K, B>
 } = Dual.dual<
   <A, K, B>(f: (a: A, k: K) => B) => (self: SortedMap<K, A>) => SortedMap<K, B>,
@@ -189,7 +236,15 @@ export const map: {
  * @category folding
  */
 export const reduce: {
+  /**
+   * @since 2.0.0
+   * @category folding
+   */
   <B, A, K>(zero: B, f: (acc: B, value: A, key: K) => B): (self: SortedMap<K, A>) => B
+  /**
+   * @since 2.0.0
+   * @category folding
+   */
   <K, A, B>(self: SortedMap<K, A>, zero: B, f: (acc: B, value: A, key: K) => B): B
 } = Dual.dual<
   <B, A, K>(zero: B, f: (acc: B, value: A, key: K) => B) => (self: SortedMap<K, A>) => B,
@@ -201,7 +256,15 @@ export const reduce: {
  * @category elements
  */
 export const remove: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K>(key: K): <V>(self: SortedMap<K, V>) => SortedMap<K, V>
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K, V>(self: SortedMap<K, V>, key: K): SortedMap<K, V>
 } = Dual.dual<
   <K>(key: K) => <V>(self: SortedMap<K, V>) => SortedMap<K, V>,
@@ -213,7 +276,15 @@ export const remove: {
  * @category elements
  */
 export const set: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K, V>(key: K, value: V): (self: SortedMap<K, V>) => SortedMap<K, V>
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <K, V>(self: SortedMap<K, V>, key: K, value: V): SortedMap<K, V>
 } = Dual.dual<
   <K, V>(key: K, value: V) => (self: SortedMap<K, V>) => SortedMap<K, V>,
@@ -262,9 +333,17 @@ export const lastOption = <K, V>(self: SortedMap<K, V>): Option.Option<[K, V]> =
  * @category filtering
  */
 export const partition: {
+  /**
+   * @since 3.1.0
+   * @category filtering
+   */
   <K, V>(
     predicate: (a: Types.NoInfer<K>) => boolean
   ): (self: SortedMap<K, V>) => [excluded: SortedMap<K, V>, satisfying: SortedMap<K, V>]
+  /**
+   * @since 3.1.0
+   * @category filtering
+   */
   <K, V>(self: SortedMap<K, V>, predicate: (a: K) => boolean): [excluded: SortedMap<K, V>, satisfying: SortedMap<K, V>]
 } = Dual.dual(
   2,

package/src/SortedSet.ts

@@ -7,7 +7,7 @@ import * as Dual from "./Function.js"
 import { pipe } from "./Function.js"
 import * as Hash from "./Hash.js"
 import type { Inspectable } from "./Inspectable.js"
-import { format, NodeInspectSymbol, toJSON } from "./Inspectable.js"
+import { DenoInspectSymbol, format, NodeInspectSymbol, toJSON } from "./Inspectable.js"
 import type { Order } from "./Order.js"
 import type { Pipeable } from "./Pipeable.js"
 import { pipeArguments } from "./Pipeable.js"
@@ -62,6 +62,9 @@ const SortedSetProto: Omit<SortedSet<unknown>, "keyTree"> = {
       values: Array.from(this).map(toJSON)
     }
   },
+  [DenoInspectSymbol]() {
+    return this.toJSON()
+  },
   [NodeInspectSymbol]() {
     return this.toJSON()
   },
@@ -81,7 +84,15 @@ const fromTree = <A>(keyTree: RBT.RedBlackTree<A, boolean>): SortedSet<A> => {
  * @category refinements
  */
 export const isSortedSet: {
+  /**
+   * @since 2.0.0
+   * @category refinements
+   */
   <A>(u: Iterable<A>): u is SortedSet<A>
+  /**
+   * @since 2.0.0
+   * @category refinements
+   */
   (u: unknown): u is SortedSet<unknown>
 } = (u: unknown): u is SortedSet<unknown> => hasProperty(u, TypeId)
 
@@ -98,7 +109,19 @@ export const empty = <A>(O: Order<A>): SortedSet<A> => fromTree(RBT.empty(O))
  * @category constructors
  */
 export const fromIterable: {
+  /**
+   * Creates a new `SortedSet` from an iterable collection of values.
+   *
+   * @since 2.0.0
+   * @category constructors
+   */
   <B>(ord: Order<B>): <A extends B>(iterable: Iterable<A>) => SortedSet<A>
+  /**
+   * Creates a new `SortedSet` from an iterable collection of values.
+   *
+   * @since 2.0.0
+   * @category constructors
+   */
   <A extends B, B>(iterable: Iterable<A>, ord: Order<B>): SortedSet<A>
 } = Dual.dual(
   2,
@@ -119,7 +142,15 @@ export const make =
  * @category elements
  */
 export const add: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(value: A): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, value: A): SortedSet<A>
 } = Dual.dual<
   <A>(value: A) => (self: SortedSet<A>) => SortedSet<A>,
@@ -133,7 +164,13 @@ export const add: {
  * @since 2.0.0
  */
 export const difference: {
+  /**
+   * @since 2.0.0
+   */
   <A, B extends A>(that: Iterable<B>): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   */
   <A, B extends A>(self: SortedSet<A>, that: Iterable<B>): SortedSet<A>
 } = Dual.dual<
   <A, B extends A>(that: Iterable<B>) => (self: SortedSet<A>) => SortedSet<A>,
@@ -153,7 +190,19 @@ export const difference: {
  * @category elements
  */
 export const every: {
+  /**
+   * Check if a predicate holds true for every `SortedSet` element.
+   *
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(predicate: Predicate<A>): (self: SortedSet<A>) => boolean
+  /**
+   * Check if a predicate holds true for every `SortedSet` element.
+   *
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, predicate: Predicate<A>): boolean
 } = Dual.dual(2, <A>(self: SortedSet<A>, predicate: Predicate<A>): boolean => {
   for (const value of self) {
@@ -169,7 +218,15 @@ export const every: {
  * @category filtering
  */
 export const filter: {
+  /**
+   * @since 2.0.0
+   * @category filtering
+   */
   <A, B extends A>(predicate: Predicate<B>): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   * @category filtering
+   */
   <A>(self: SortedSet<A>, predicate: Predicate<A>): SortedSet<A>
 } = Dual.dual(2, <A>(self: SortedSet<A>, predicate: Predicate<A>): SortedSet<A> => {
   const ord = RBT.getOrder(self.keyTree)
@@ -187,7 +244,15 @@ export const filter: {
  * @category sequencing
  */
 export const flatMap: {
+  /**
+   * @since 2.0.0
+   * @category sequencing
+   */
   <B, A>(O: Order<B>, f: (a: A) => Iterable<B>): (self: SortedSet<A>) => SortedSet<B>
+  /**
+   * @since 2.0.0
+   * @category sequencing
+   */
   <A, B>(self: SortedSet<A>, O: Order<B>, f: (a: A) => Iterable<B>): SortedSet<B>
 } = Dual.dual<
   <B, A>(O: Order<B>, f: (a: A) => Iterable<B>) => (self: SortedSet<A>) => SortedSet<B>,
@@ -207,7 +272,15 @@ export const flatMap: {
  * @category traversing
  */
 export const forEach: {
+  /**
+   * @since 2.0.0
+   * @category traversing
+   */
   <A>(f: (a: A) => void): (self: SortedSet<A>) => void
+  /**
+   * @since 2.0.0
+   * @category traversing
+   */
   <A>(self: SortedSet<A>, f: (a: A) => void): void
 } = Dual.dual<
   <A>(f: (a: A) => void) => (self: SortedSet<A>) => void,
@@ -219,7 +292,15 @@ export const forEach: {
  * @category elements
  */
 export const has: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(value: A): (self: SortedSet<A>) => boolean
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, value: A): boolean
 } = Dual.dual<
   <A>(value: A) => (self: SortedSet<A>) => boolean,
@@ -230,7 +311,13 @@ export const has: {
  * @since 2.0.0
  */
 export const intersection: {
+  /**
+   * @since 2.0.0
+   */
   <A>(that: Iterable<A>): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   */
   <A>(self: SortedSet<A>, that: Iterable<A>): SortedSet<A>
 } = Dual.dual<
   <A>(that: Iterable<A>) => (self: SortedSet<A>) => SortedSet<A>,
@@ -251,7 +338,15 @@ export const intersection: {
  * @category elements
  */
 export const isSubset: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(that: SortedSet<A>): (self: SortedSet<A>) => boolean
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, that: SortedSet<A>): boolean
 } = Dual.dual<
   <A>(that: SortedSet<A>) => (self: SortedSet<A>) => boolean,
@@ -263,7 +358,15 @@ export const isSubset: {
  * @category mapping
  */
 export const map: {
+  /**
+   * @since 2.0.0
+   * @category mapping
+   */
   <B, A>(O: Order<B>, f: (a: A) => B): (self: SortedSet<A>) => SortedSet<B>
+  /**
+   * @since 2.0.0
+   * @category mapping
+   */
   <B, A>(self: SortedSet<A>, O: Order<B>, f: (a: A) => B): SortedSet<B>
 } = Dual.dual<
   <B, A>(O: Order<B>, f: (a: A) => B) => (self: SortedSet<A>) => SortedSet<B>,
@@ -284,9 +387,15 @@ export const map: {
  * @category filtering
  */
 export const partition: {
-  <A>(
-    predicate: (a: NoInfer<A>) => boolean
-  ): (self: SortedSet<A>) => [excluded: SortedSet<A>, satisfying: SortedSet<A>]
+  /**
+   * @since 2.0.0
+   * @category filtering
+   */
+  <A>(predicate: (a: NoInfer<A>) => boolean): (self: SortedSet<A>) => [excluded: SortedSet<A>, satisfying: SortedSet<A>]
+  /**
+   * @since 2.0.0
+   * @category filtering
+   */
   <A>(self: SortedSet<A>, predicate: (a: A) => boolean): [excluded: SortedSet<A>, satisfying: SortedSet<A>]
 } = Dual.dual(
   2,
@@ -310,7 +419,15 @@ export const partition: {
  * @category elements
  */
 export const remove: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(value: A): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, value: A): SortedSet<A>
 } = Dual.dual<
   <A>(value: A) => (self: SortedSet<A>) => SortedSet<A>,
@@ -330,7 +447,19 @@ export const size = <A>(self: SortedSet<A>): number => RBT.size(self.keyTree)
  * @category elements
  */
 export const some: {
+  /**
+   * Check if a predicate holds true for some `SortedSet` element.
+   *
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(predicate: Predicate<A>): (self: SortedSet<A>) => boolean
+  /**
+   * Check if a predicate holds true for some `SortedSet` element.
+   *
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, predicate: Predicate<A>): boolean
 } = Dual.dual<
   <A>(predicate: Predicate<A>) => (self: SortedSet<A>) => boolean,
@@ -349,7 +478,15 @@ export const some: {
  * @category elements
  */
 export const toggle: {
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(value: A): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   * @category elements
+   */
   <A>(self: SortedSet<A>, value: A): SortedSet<A>
 } = Dual.dual<
   <A>(value: A) => (self: SortedSet<A>) => SortedSet<A>,
@@ -360,7 +497,13 @@ export const toggle: {
  * @since 2.0.0
  */
 export const union: {
+  /**
+   * @since 2.0.0
+   */
   <A>(that: Iterable<A>): (self: SortedSet<A>) => SortedSet<A>
+  /**
+   * @since 2.0.0
+   */
   <A>(self: SortedSet<A>, that: Iterable<A>): SortedSet<A>
 } = Dual.dual<
   <A>(that: Iterable<A>) => (self: SortedSet<A>) => SortedSet<A>,