effect 2.0.0-next.37 → 2.0.0-next.38

package/dist/declarations/src/TMap.d.ts

@@ -3,12 +3,12 @@ import type * as HashMap from "./HashMap.js";
 import type * as Option from "./Option.js";
 import type * as STM from "./STM.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TMapTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TMapTypeId = typeof TMapTypeId;
@@ -16,17 +16,17 @@ export type TMapTypeId = typeof TMapTypeId;
  * Transactional map implemented on top of `TRef` and `TArray`. Resolves
  * conflicts via chaining.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TMap<K, V> extends TMap.Variance<K, V> {
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace TMap {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<K, V> {
@@ -39,7 +39,7 @@ export declare namespace TMap {
 /**
  * Makes an empty `TMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const empty: <K, V>() => STM.STM<never, never, TMap<K, V>>;
@@ -47,7 +47,7 @@ export declare const empty: <K, V>() => STM.STM<never, never, TMap<K, V>>;
  * Finds the key/value pair matching the specified predicate, and uses the
  * provided function to extract a value out of it.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const find: {
@@ -58,7 +58,7 @@ export declare const find: {
  * Finds the key/value pair matching the specified predicate, and uses the
  * provided effectful function to extract a value out of it.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findSTM: {
@@ -69,7 +69,7 @@ export declare const findSTM: {
  * Finds all the key/value pairs matching the specified predicate, and uses
  * the provided function to extract values out them.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findAll: {
@@ -80,7 +80,7 @@ export declare const findAll: {
  * Finds all the key/value pairs matching the specified predicate, and uses
  * the provided effectful function to extract values out of them..
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findAllSTM: {
@@ -90,7 +90,7 @@ export declare const findAllSTM: {
 /**
  * Atomically performs transactional-effect for each binding present in map.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const forEach: {
@@ -100,14 +100,14 @@ export declare const forEach: {
 /**
  * Makes a new `TMap` initialized with provided iterable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromIterable: <K, V>(iterable: Iterable<readonly [K, V]>) => STM.STM<never, never, TMap<K, V>>;
 /**
  * Retrieves value associated with given key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const get: {
@@ -118,7 +118,7 @@ export declare const get: {
  * Retrieves value associated with given key or default value, in case the key
  * isn't present.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const getOrElse: {
@@ -128,7 +128,7 @@ export declare const getOrElse: {
 /**
  * Tests whether or not map contains a key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const has: {
@@ -138,21 +138,21 @@ export declare const has: {
 /**
  * Tests if the map is empty or not.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isEmpty: <K, V>(self: TMap<K, V>) => STM.STM<never, never, boolean>;
 /**
  * Collects all keys stored in map.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const keys: <K, V>(self: TMap<K, V>) => STM.STM<never, never, Array<K>>;
 /**
  * Makes a new `TMap` that is initialized with specified values.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <K, V>(...entries: Array<readonly [K, V]>) => STM.STM<never, never, TMap<K, V>>;
@@ -161,7 +161,7 @@ export declare const make: <K, V>(...entries: Array<readonly [K, V]>) => STM.STM
  * otherwise merge the existing value with the new one using function `f` and
  * store the result.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const merge: {
@@ -171,7 +171,7 @@ export declare const merge: {
 /**
  * Atomically folds using a pure function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduce: {
@@ -181,7 +181,7 @@ export declare const reduce: {
 /**
  * Atomically folds using a transactional function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduceSTM: {
@@ -191,7 +191,7 @@ export declare const reduceSTM: {
 /**
  * Atomically folds using a pure function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduceWithIndex: {
@@ -201,7 +201,7 @@ export declare const reduceWithIndex: {
 /**
  * Atomically folds using a transactional function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduceWithIndexSTM: {
@@ -211,7 +211,7 @@ export declare const reduceWithIndexSTM: {
 /**
  * Removes binding for given key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const remove: {
@@ -221,7 +221,7 @@ export declare const remove: {
 /**
  * Deletes all entries associated with the specified keys.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const removeAll: {
@@ -231,7 +231,7 @@ export declare const removeAll: {
 /**
  * Removes bindings matching predicate and returns the removed entries.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const removeIf: {
@@ -241,7 +241,7 @@ export declare const removeIf: {
 /**
  * Removes bindings matching predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const removeIfDiscard: {
@@ -251,7 +251,7 @@ export declare const removeIfDiscard: {
 /**
  * Retains bindings matching predicate and returns removed bindings.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const retainIf: {
@@ -261,7 +261,7 @@ export declare const retainIf: {
 /**
  * Retains bindings matching predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const retainIfDiscard: {
@@ -271,7 +271,7 @@ export declare const retainIfDiscard: {
 /**
  * Stores new binding into the map.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const set: {
@@ -281,7 +281,7 @@ export declare const set: {
 /**
  * Stores new binding in the map if it does not already exist.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const setIfAbsent: {
@@ -291,14 +291,14 @@ export declare const setIfAbsent: {
 /**
  * Returns the number of bindings.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <K, V>(self: TMap<K, V>) => STM.STM<never, never, number>;
 /**
  * Takes the first matching value, or retries until there is one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeFirst: {
@@ -308,7 +308,7 @@ export declare const takeFirst: {
 /**
  * Takes the first matching value, or retries until there is one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeFirstSTM: {
@@ -318,7 +318,7 @@ export declare const takeFirstSTM: {
 /**
  * Takes all matching values, or retries until there is at least one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeSome: {
@@ -328,7 +328,7 @@ export declare const takeSome: {
 /**
  * Takes all matching values, or retries until there is at least one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeSomeSTM: {
@@ -338,35 +338,35 @@ export declare const takeSomeSTM: {
 /**
  * Collects all bindings into a `Chunk`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toChunk: <K, V>(self: TMap<K, V>) => STM.STM<never, never, Array<readonly [K, V]>>;
 /**
  * Collects all bindings into a `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toHashMap: <K, V>(self: TMap<K, V>) => STM.STM<never, never, HashMap.HashMap<K, V>>;
 /**
  * Collects all bindings into a `ReadonlyArray`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toReadonlyArray: <K, V>(self: TMap<K, V>) => STM.STM<never, never, ReadonlyArray<readonly [K, V]>>;
 /**
  * Collects all bindings into a `ReadonlyMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toReadonlyMap: <K, V>(self: TMap<K, V>) => STM.STM<never, never, ReadonlyMap<K, V>>;
 /**
  * Atomically updates all bindings using a pure function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const transform: {
@@ -376,7 +376,7 @@ export declare const transform: {
 /**
  * Atomically updates all bindings using a transactional function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const transformSTM: {
@@ -386,7 +386,7 @@ export declare const transformSTM: {
 /**
  * Atomically updates all values using a pure function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const transformValues: {
@@ -396,7 +396,7 @@ export declare const transformValues: {
 /**
  * Atomically updates all values using a transactional function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const transformValuesSTM: {
@@ -410,7 +410,7 @@ export declare const transformValuesSTM: {
  * the map or `None` to remove the value from the map. Returns `Some` with the
  * updated value or `None` if the value was removed from the map.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const updateWith: {
@@ -420,7 +420,7 @@ export declare const updateWith: {
 /**
  * Collects all values stored in map.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const values: <K, V>(self: TMap<K, V>) => STM.STM<never, never, Array<V>>;

package/dist/declarations/src/TPriorityQueue.d.ts

@@ -3,12 +3,12 @@ import type * as Order from "./Order.js";
 import type { Predicate } from "./Predicate.js";
 import type * as STM from "./STM.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TPriorityQueueTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TPriorityQueueTypeId = typeof TPriorityQueueTypeId;
@@ -19,17 +19,17 @@ export type TPriorityQueueTypeId = typeof TPriorityQueueTypeId;
  * offered to the queue. The ordering that elements with the same priority will
  * be taken from the queue is not guaranteed.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TPriorityQueue<A> extends TPriorityQueue.Variance<A> {
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace TPriorityQueue {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<A> {
@@ -41,42 +41,42 @@ export declare namespace TPriorityQueue {
 /**
  * Constructs a new empty `TPriorityQueue` with the specified `Order`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const empty: <A>(order: Order.Order<A>) => STM.STM<never, never, TPriorityQueue<A>>;
 /**
  * Makes a new `TPriorityQueue` initialized with provided iterable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromIterable: <A>(order: Order.Order<A>) => (iterable: Iterable<A>) => STM.STM<never, never, TPriorityQueue<A>>;
 /**
  * Checks whether the queue is empty.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isEmpty: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, boolean>;
 /**
  * Checks whether the queue is not empty.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isNonEmpty: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, boolean>;
 /**
  * Makes a new `TPriorityQueue` that is initialized with specified values.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <A>(order: Order.Order<A>) => (...elements: Array<A>) => STM.STM<never, never, TPriorityQueue<A>>;
 /**
  * Offers the specified value to the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const offer: {
@@ -86,7 +86,7 @@ export declare const offer: {
 /**
  * Offers all of the elements in the specified collection to the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const offerAll: {
@@ -97,7 +97,7 @@ export declare const offerAll: {
  * Peeks at the first value in the queue without removing it, retrying until a
  * value is in the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const peek: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, A>;
@@ -105,14 +105,14 @@ export declare const peek: <A>(self: TPriorityQueue<A>) => STM.STM<never, never,
  * Peeks at the first value in the queue without removing it, returning `None`
  * if there is not a value in the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const peekOption: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, Option.Option<A>>;
 /**
  * Removes all elements from the queue matching the specified predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const removeIf: {
@@ -122,7 +122,7 @@ export declare const removeIf: {
 /**
  * Retains only elements from the queue matching the specified predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const retainIf: {
@@ -132,21 +132,21 @@ export declare const retainIf: {
 /**
  * Returns the size of the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, number>;
 /**
  * Takes a value from the queue, retrying until a value is in the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const take: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, A>;
 /**
  * Takes all values from the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeAll: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, Array<A>>;
@@ -154,14 +154,14 @@ export declare const takeAll: <A>(self: TPriorityQueue<A>) => STM.STM<never, nev
  * Takes a value from the queue, returning `None` if there is not a value in
  * the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeOption: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, Option.Option<A>>;
 /**
  * Takes up to the specified maximum number of elements from the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeUpTo: {
@@ -171,14 +171,14 @@ export declare const takeUpTo: {
 /**
  * Collects all values into a chunk.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toArray: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, Array<A>>;
 /**
  * Collects all values into an array.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toReadonlyArray: <A>(self: TPriorityQueue<A>) => STM.STM<never, never, ReadonlyArray<A>>;