effect 4.0.1 → 4.0.2

package/src/Order.ts

@@ -8,6 +8,7 @@
  * orders, tools for reversing and combining comparisons, tuple and struct
  * helpers, comparison predicates, clamping, and reducer support.
  *
+ * @stability stable
  * @since 2.0.0
  */
 import { dual } from "./Function.ts"
@@ -47,6 +48,7 @@ import * as Reducer from "./Reducer.ts"
  *
  * @see {@link make} to create an order from a comparison function
  * @see {@link Ordering} for the result type of comparisons
+ * @stability stable
  * @category models
  * @since 2.0.0
  */
@@ -66,6 +68,7 @@ export interface Order<in A> {
  * This is type-level only, has no runtime representation, and is used
  * internally by the Effect type system.
  *
+ * @stability stable
  * @category utility types
  * @since 2.0.0
  */
@@ -105,6 +108,7 @@ export interface OrderTypeLambda extends TypeLambda {
  *
  * @see {@link mapInput} to transform an order by mapping the input type
  * @see {@link combine} to combine multiple orders
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -138,6 +142,7 @@ export function make<A>(
  *
  * @see {@link mapInput} to compare objects by a string property
  * @see {@link Struct} to combine with other orders for struct comparison
+ * @stability stable
  * @category instances
  * @since 4.0.0
  */
@@ -171,6 +176,7 @@ export const String: Order<string> = make((self, that) => self < that ? -1 : 1)
  *
  * @see {@link mapInput} to compare objects by a number property
  * @see {@link BigInt} for bigint comparisons
+ * @stability stable
  * @category instances
  * @since 4.0.0
  */
@@ -203,6 +209,7 @@ export const Number: Order<number> = make((self, that) => {
  * ```
  *
  * @see {@link mapInput} to compare objects by a boolean property
+ * @stability stable
  * @category instances
  * @since 4.0.0
  */
@@ -232,6 +239,7 @@ export const Boolean: Order<boolean> = make((self, that) => self < that ? -1 : 1
  *
  * @see {@link Number} for regular number comparisons
  * @see {@link mapInput} to compare objects by a bigint property
+ * @stability stable
  * @category instances
  * @since 4.0.0
  */
@@ -263,6 +271,7 @@ export const BigInt: Order<bigint> = make((self, that) => self < that ? -1 : 1)
  * ```
  *
  * @see {@link combine} to combine orders for multi-criteria comparison
+ * @stability stable
  * @category combinators
  * @since 4.0.0
  */
@@ -309,6 +318,7 @@ export function flip<A>(O: Order<A>): Order<A> {
  *
  * @see {@link combineAll} to combine multiple orders from a collection
  * @see {@link mapInput} to transform orders to work with different types
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -352,6 +362,7 @@ export const combine: {
    *
    * @see {@link combineAll} to combine multiple orders from a collection
    * @see {@link mapInput} to transform orders to work with different types
+   * @stability stable
    * @category combining
    * @since 2.0.0
    */
@@ -395,6 +406,7 @@ export const combine: {
    *
    * @see {@link combineAll} to combine multiple orders from a collection
    * @see {@link mapInput} to transform orders to work with different types
+   * @stability stable
    * @category combining
    * @since 2.0.0
    */
@@ -433,6 +445,7 @@ export const combine: {
  * ```
  *
  * @see {@link combine} to combine with other orders
+ * @stability stable
  * @category constructors
  * @since 4.0.0
  */
@@ -478,6 +491,7 @@ export function alwaysEqual<A>(): Order<A> {
  *
  * @see {@link combine} to combine two orders
  * @see {@link makeReducer} to create a reducer for combining orders
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -524,6 +538,7 @@ export function combineAll<A>(collection: Iterable<Order<A>>): Order<A> {
  *
  * @see {@link combine} to combine mapped orders for multi-criteria comparison
  * @see {@link Struct} to create orders for structs with multiple fields
+ * @stability stable
  * @category mapping
  * @since 2.0.0
  */
@@ -557,6 +572,7 @@ export const mapInput: {
    *
    * @see {@link combine} to combine mapped orders for multi-criteria comparison
    * @see {@link Struct} to create orders for structs with multiple fields
+   * @stability stable
    * @category mapping
    * @since 2.0.0
    */
@@ -590,6 +606,7 @@ export const mapInput: {
    *
    * @see {@link combine} to combine mapped orders for multi-criteria comparison
    * @see {@link Struct} to create orders for structs with multiple fields
+   * @stability stable
    * @category mapping
    * @since 2.0.0
    */
@@ -626,6 +643,7 @@ export const mapInput: {
  * ```
  *
  * @see {@link mapInput} to compare objects by a date property
+ * @stability stable
  * @category instances
  * @since 2.0.0
  */
@@ -657,6 +675,7 @@ export const Date: Order<Date> = mapInput(Number, (date) => date.getTime())
  * ```
  *
  * @see {@link Array} to compare arrays with length consideration
+ * @stability stable
  * @category combinators
  * @since 4.0.0
  */
@@ -722,6 +741,7 @@ export {
    * ```
    *
    * @see {@link Tuple} for type-safe tuple ordering
+   * @stability stable
    * @category combinators
    * @since 4.0.0
    */
@@ -762,6 +782,7 @@ export {
  *
  * @see {@link combine} to combine orders manually
  * @see {@link mapInput} to extract and compare by a single property
+ * @stability stable
  * @category combinators
  * @since 4.0.0
  */
@@ -806,6 +827,7 @@ export function Struct<const R extends { readonly [x: string]: Order<any> }>(
  *
  * @see {@link isLessThanOrEqualTo} for non-strict less than or equal
  * @see {@link isGreaterThan} for strict greater than
+ * @stability stable
  * @category predicates
  * @since 4.0.0
  */
@@ -840,6 +862,7 @@ export const isLessThan = <A>(O: Order<A>): {
  *
  * @see {@link isGreaterThanOrEqualTo} for non-strict greater than or equal
  * @see {@link isLessThan} for strict less than
+ * @stability stable
  * @category predicates
  * @since 4.0.0
  */
@@ -874,6 +897,7 @@ export const isGreaterThan = <A>(O: Order<A>): {
  *
  * @see {@link isLessThan} for strict less than
  * @see {@link isGreaterThan} for strict greater than
+ * @stability stable
  * @category predicates
  * @since 4.0.0
  */
@@ -909,6 +933,7 @@ export const isLessThanOrEqualTo = <A>(O: Order<A>): {
  *
  * @see {@link isGreaterThan} for strict greater than
  * @see {@link isLessThanOrEqualTo} for less than or equal
+ * @stability stable
  * @category predicates
  * @since 4.0.0
  */
@@ -944,6 +969,7 @@ export const isGreaterThanOrEqualTo = <A>(O: Order<A>): {
  *
  * @see {@link max} for the maximum of two values
  * @see {@link clamp} to clamp a value between min and max
+ * @stability stable
  * @category comparisons
  * @since 2.0.0
  */
@@ -979,6 +1005,7 @@ export const min = <A>(O: Order<A>): {
  *
  * @see {@link min} for the minimum of two values
  * @see {@link clamp} to clamp a value between min and max
+ * @stability stable
  * @category comparisons
  * @since 2.0.0
  */
@@ -1017,6 +1044,7 @@ export const max = <A>(O: Order<A>): {
  * @see {@link min} for the minimum of two values
  * @see {@link max} for the maximum of two values
  * @see {@link isBetween} to check if a value is within a range
+ * @stability stable
  * @category comparisons
  * @since 2.0.0
  */
@@ -1070,6 +1098,7 @@ export const clamp = <A>(O: Order<A>): {
  * @see {@link clamp} to clamp a value to a range
  * @see {@link isLessThanOrEqualTo} for less than or equal check
  * @see {@link isGreaterThanOrEqualTo} for greater than or equal check
+ * @stability stable
  * @category predicates
  * @since 4.0.0
  */
@@ -1120,6 +1149,7 @@ export const isBetween = <A>(O: Order<A>): {
  * @see {@link combine} to combine two orders
  * @see {@link combineAll} to combine multiple orders
  * @see {@link Reducer} for reducing orders as a collection operation
+ * @stability stable
  * @category constructors
  * @since 4.0.0
  */

package/src/Ordering.ts

@@ -5,6 +5,7 @@
  * provides helpers for reversing an ordering, matching on the three cases, and
  * combining ordered comparison results with a reducer.
  *
+ * @stability stable
  * @since 2.0.0
  */
 import type { LazyArg } from "./Function.ts"
@@ -47,6 +48,7 @@ import * as Reducer_ from "./Reducer.ts"
  * }
  * ```
  *
+ * @stability stable
  * @category models
  * @since 2.0.0
  */
@@ -89,6 +91,7 @@ export type Ordering = -1 | 0 | 1
  * }
  * ```
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -117,6 +120,7 @@ export const reverse = (o: Ordering): Ordering => (o === -1 ? 1 : o === 1 ? -1 :
  * toMessage(1) // => "greater than"
  * ```
  *
+ * @stability stable
  * @category pattern matching
  * @since 2.0.0
  */
@@ -144,6 +148,7 @@ export const match: {
    * toMessage(1) // => "greater than"
    * ```
    *
+   * @stability stable
    * @category pattern matching
    * @since 2.0.0
    */
@@ -177,6 +182,7 @@ export const match: {
    * toMessage(1) // => "greater than"
    * ```
    *
+   * @stability stable
    * @category pattern matching
    * @since 2.0.0
    */
@@ -215,6 +221,7 @@ export const match: {
  * `combineAll` stops consuming the iterable as soon as it finds a non-zero
  * `Ordering`.
  *
+ * @stability stable
  * @category ordering
  * @since 4.0.0
  */

package/src/PartitionedSemaphore.ts

@@ -5,6 +5,7 @@
  * groups of work compete for the same bounded resource and each group should
  * make progress without one busy group monopolizing released permits.
  *
+ * @stability unstable
  * @since 4.0.0
  */
 import * as Effect from "./Effect.ts"
@@ -23,6 +24,7 @@ import * as Option from "./Option.ts"
  * This marker is part of the runtime representation of partitioned semaphore
  * values.
  *
+ * @stability unstable
  * @category type IDs
  * @since 4.0.0
  */
@@ -40,6 +42,7 @@ export const PartitionedTypeId: PartitionedTypeId = "~effect/PartitionedSemaphor
  * Use this type when declaring fields that must contain the exact
  * `PartitionedTypeId` marker value.
  *
+ * @stability unstable
  * @category type IDs
  * @since 4.0.0
  */
@@ -58,6 +61,7 @@ export type PartitionedTypeId = "~effect/PartitionedSemaphore"
  *
  * Waiting permits are distributed across partitions in round-robin order.
  *
+ * @stability unstable
  * @category models
  * @since 3.19.4
  */
@@ -90,6 +94,7 @@ export interface PartitionedSemaphore<in K> {
  * provides an alternate exported name for APIs that refer to a partitioned
  * permit pool.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -111,6 +116,7 @@ export interface Partitioned<in K> extends PartitionedSemaphore<K> {}
  *
  * @see {@link make} for creating a partitioned semaphore inside `Effect`
  *
+ * @stability unstable
  * @category constructors
  * @since 3.19.4
  */
@@ -142,36 +148,51 @@ export const makeUnsafe = <K = unknown>(options: {
 
   const partitions = MutableHashMap.empty<K, Set<Waiter>>()
   let iterator = partitions[Symbol.iterator]()
+  let releasing = false
+  let pendingPermits = 0
 
   const releaseUnsafe = (permits: number): number => {
-    while (permits > 0) {
-      if (waitingPermits === 0) {
-        totalPermits = Math.min(maxPermits, totalPermits + permits)
-        return totalPermits
-      }
+    if (permits > 0) {
+      pendingPermits += permits
+    }
 
-      let state = iterator.next()
-      if (state.done) {
-        iterator = partitions[Symbol.iterator]()
-        state = iterator.next()
-        if (state.done) {
-          return totalPermits
-        }
-      }
+    // Synchronous waiter finalizers can release again. Let the active loop
+    // allocate those permits rather than recursively resuming another fiber.
+    if (!releasing) {
+      releasing = true
+      try {
+        while (pendingPermits > 0 && waitingPermits > 0) {
+          let state = iterator.next()
+          if (state.done) {
+            iterator = partitions[Symbol.iterator]()
+            state = iterator.next()
+            if (state.done) {
+              break
+            }
+          }
 
-      const waiter = state.value[1].values().next().value
-      if (waiter === undefined) {
-        continue
-      }
+          const waiter = state.value[1].values().next().value
+          if (waiter === undefined) {
+            continue
+          }
 
-      waiter.permits -= 1
-      waitingPermits -= 1
+          waiter.permits -= 1
+          waitingPermits -= 1
+          pendingPermits -= 1
 
-      if (waiter.permits === 0) {
-        waiter.resume()
+          if (waiter.permits === 0) {
+            waiter.resume()
+          }
+        }
+      } finally {
+        releasing = false
       }
+    }
 
-      permits -= 1
+    // Free permits must be visible before a reentrant release returns.
+    if (waitingPermits === 0) {
+      totalPermits = Math.min(maxPermits, totalPermits + pendingPermits)
+      pendingPermits = 0
     }
 
     return totalPermits
@@ -328,6 +349,7 @@ export const makeUnsafe = <K = unknown>(options: {
  *
  * @see {@link makeUnsafe} for synchronous construction
  *
+ * @stability unstable
  * @category constructors
  * @since 3.19.4
  */
@@ -356,6 +378,7 @@ export const make = <K = unknown>(options: {
  * @see {@link release} for returning permits to the shared pool
  * @see {@link withPermitsIfAvailable} for running only when permits are immediately available
  *
+ * @stability unstable
  * @category combinators
  * @since 4.0.0
  */
@@ -375,6 +398,7 @@ export const available = <K>(self: PartitionedSemaphore<K>): Effect.Effect<numbe
  *
  * @see {@link available} for the current number of free permits
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -404,6 +428,7 @@ export const capacity = <K>(self: PartitionedSemaphore<K>): number => self.capac
  * @see {@link withPermits} for automatic acquire and release around an effect
  * @see {@link withPermit} for acquiring exactly one permit around an effect
  *
+ * @stability unstable
  * @category combinators
  * @since 4.0.0
  */
@@ -432,6 +457,7 @@ export const take: {
    * @see {@link withPermits} for automatic acquire and release around an effect
    * @see {@link withPermit} for acquiring exactly one permit around an effect
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -460,6 +486,7 @@ export const take: {
    * @see {@link withPermits} for automatic acquire and release around an effect
    * @see {@link withPermit} for acquiring exactly one permit around an effect
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -485,6 +512,7 @@ export const take: {
  * @see {@link withPermits} for automatic acquire and release around an effect
  * @see {@link available} for reading the permit count without releasing
  *
+ * @stability unstable
  * @category combinators
  * @since 4.0.0
  */
@@ -508,6 +536,7 @@ export const release: {
    * @see {@link withPermits} for automatic acquire and release around an effect
    * @see {@link available} for reading the permit count without releasing
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -531,6 +560,7 @@ export const release: {
    * @see {@link withPermits} for automatic acquire and release around an effect
    * @see {@link available} for reading the permit count without releasing
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -563,6 +593,7 @@ export const release: {
  * @see {@link take} for manual acquisition
  * @see {@link release} for manual release
  *
+ * @stability unstable
  * @category combinators
  * @since 4.0.0
  */
@@ -593,6 +624,7 @@ export const withPermits: {
    * @see {@link take} for manual acquisition
    * @see {@link release} for manual release
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -623,6 +655,7 @@ export const withPermits: {
    * @see {@link take} for manual acquisition
    * @see {@link release} for manual release
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -661,6 +694,7 @@ export const withPermits: {
  * @see {@link take} for manual acquisition
  * @see {@link release} for manual release
  *
+ * @stability unstable
  * @category combinators
  * @since 4.0.0
  */
@@ -685,6 +719,7 @@ export const withPermit: {
    * @see {@link take} for manual acquisition
    * @see {@link release} for manual release
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -709,6 +744,7 @@ export const withPermit: {
    * @see {@link take} for manual acquisition
    * @see {@link release} for manual release
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -741,6 +777,7 @@ export const withPermit: {
  * @see {@link withPermits} for the keyed variant that waits until permits are
  * available for a partition
  *
+ * @stability unstable
  * @category combinators
  * @since 4.0.0
  */
@@ -764,6 +801,7 @@ export const withPermitsIfAvailable: {
    * @see {@link withPermits} for the keyed variant that waits until permits are
    * available for a partition
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */
@@ -787,6 +825,7 @@ export const withPermitsIfAvailable: {
    * @see {@link withPermits} for the keyed variant that waits until permits are
    * available for a partition
    *
+   * @stability unstable
    * @category combinators
    * @since 4.0.0
    */

package/src/Path.ts

@@ -7,6 +7,7 @@
  * file URLs. This module includes the service interface, parsed path type,
  * service tag, runtime marker, and built-in POSIX path layer.
  *
+ * @stability unstable
  * @since 4.0.0
  */
 import * as Context from "./Context.ts"
@@ -26,6 +27,7 @@ import { BadArgument } from "./PlatformError.ts"
  *
  * @see {@link layer} for the built-in POSIX `Path` service layer
  *
+ * @stability unstable
  * @category type IDs
  * @since 4.0.0
  */
@@ -78,6 +80,7 @@ export const TypeId = "~effect/Path"
  * result.resolved // => "/base/relative/path"
  * ```
  *
+ * @stability unstable
  * @category services
  * @since 4.0.0
  */
@@ -133,6 +136,7 @@ export interface Path {
  * Effect.runSync(Effect.provide(program, Path.layer)) // => ["file.txt", "file.txt"]
  * ```
  *
+ * @stability unstable
  * @since 4.0.0
  */
 export declare namespace Path {
@@ -249,6 +253,7 @@ export declare namespace Path {
  * Effect.runSync(Effect.provide(program, customPathLayer)) // => "home/user/file.txt"
  * ```
  *
+ * @stability unstable
  * @category services
  * @since 4.0.0
  */
@@ -861,6 +866,7 @@ const posixImpl = Path.of({
  *
  * @see {@link Path} for accessing the `Path` service from an effect
  *
+ * @stability unstable
  * @category layers
  * @since 4.0.0
  */

package/src/Pipeable.ts

@@ -8,6 +8,7 @@
  * to compose transformations, validations, and effectful operations while
  * keeping the original value as the starting point of the pipeline.
  *
+ * @stability stable
  * @since 2.0.0
  */
 
@@ -38,6 +39,7 @@
  * Effect.runSync(program) // => 4
  * ```
  *
+ * @stability stable
  * @category models
  * @since 2.0.0
  */
@@ -558,6 +560,7 @@ export interface Pipeable {
  * result // => 21
  * ```
  *
+ * @stability stable
  * @category combinators
  * @since 2.0.0
  */
@@ -601,6 +604,7 @@ export const pipeArguments = <A>(self: A, args: IArguments): unknown => {
  * Use when classes or object prototypes can reuse this value when they need the
  * standard pipe implementation backed by `pipeArguments`.
  *
+ * @stability stable
  * @category prototypes
  * @since 3.15.0
  */
@@ -619,6 +623,7 @@ export const Prototype: Pipeable = {
  * Use when you need to define a class that supports Effect-style method
  * chaining through `.pipe(...)`.
  *
+ * @stability stable
  * @category constructors
  * @since 3.15.0
  */
@@ -640,6 +645,7 @@ export const Class: new() => Pipeable = (function() {
  * @see {@link Class} for the base constructor
  * @see {@link Mixin} for wrapping an existing class constructor
  *
+ * @stability stable
  * @category models
  * @since 3.15.0
  */
@@ -663,6 +669,7 @@ export interface PipeableConstructor {
  *
  * @see {@link Prototype} for a reusable prototype object
  * @see {@link Class} for a base constructor to extend
+ * @stability stable
  * @category constructors
  * @since 4.0.0
  */

package/src/PlatformError.ts

@@ -7,6 +7,7 @@
  * operating system, while preserving useful details such as the module, method,
  * path, descriptor, description, and original cause when available.
  *
+ * @stability unstable
  * @since 4.0.0
  */
 import * as Data from "./Data.ts"
@@ -31,6 +32,7 @@ const TypeId = "~effect/PlatformError"
  * @see {@link SystemError} for failures reported by the host platform or operating system
  * @see {@link PlatformError} for the wrapper used by most platform APIs
  *
+ * @stability unstable
  * @category errors
  * @since 4.0.0
  */
@@ -70,6 +72,7 @@ export class BadArgument extends Data.TaggedError("BadArgument")<{
  * @see {@link SystemError} for the error data that carries this tag on its `_tag` field
  * @see {@link systemError} for creating a `PlatformError` from a system failure with one of these tags
  *
+ * @stability unstable
  * @category errors
  * @since 4.0.0
  */
@@ -104,6 +107,7 @@ export type SystemErrorTag =
  * @see {@link BadArgument} for platform API failures caused by rejected caller input before an operation runs
  * @see {@link SystemErrorTag} for the normalized tag values stored in `_tag`
  *
+ * @stability unstable
  * @category errors
  * @since 4.0.0
  */
@@ -152,6 +156,7 @@ export class SystemError extends Data.Error<{
  * @see {@link badArgument} for creating this wrapper from rejected caller input
  * @see {@link systemError} for creating this wrapper from a host or operating-system failure
  *
+ * @stability unstable
  * @category errors
  * @since 4.0.0
  */
@@ -204,6 +209,7 @@ export class PlatformError extends Data.TaggedError("PlatformError")<{
  * PlatformError.isPlatformError(new Error("boom")) // => false
  * ```
  *
+ * @stability unstable
  * @category guards
  * @since 4.0.0
  */
@@ -217,6 +223,7 @@ export const isPlatformError = (u: unknown): u is PlatformError => Predicate.has
  * Use to adapt an operating-system or platform failure into the normalized
  * platform error model.
  *
+ * @stability unstable
  * @category constructors
  * @since 4.0.0
  */
@@ -238,6 +245,7 @@ export const systemError = (options: {
  * Use to report a platform API rejecting caller input before performing the
  * underlying operation.
  *
+ * @stability unstable
  * @category constructors
  * @since 4.0.0
  */