effect 2.0.0-next.38 → 2.0.0-next.39

package/dist/HashSet-ae2856c1.esm.js

@@ -1,256 +0,0 @@
-import { i as isHashSet$1, e as empty$1, f as fromIterable$1, m as make$1, h as has$1, s as some$1, a as every$1, b as isSubset$1, v as values$1, c as size$1, d as beginMutation$1, g as endMutation$1, j as mutate$1, k as add$1, r as remove$1, l as difference$1, n as intersection$1, u as union$1, t as toggle$1, o as map$1, p as flatMap$1, q as forEach$1, w as reduce$1, x as filter$1, y as partition$1 } from './HashSet-69824ba8.esm.js';
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- * @category refinements
- */
-const isHashSet = isHashSet$1;
-
-/**
- * Creates an empty `HashSet`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const empty = empty$1;
-
-/**
- * Construct a new `HashSet` from a `Collection` of values
- *
- * @since 2.0.0
- * @category constructors
- */
-const fromIterable = fromIterable$1;
-
-/**
- * Construct a new `HashSet` from a variable number of values.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make = make$1;
-
-/**
- * Checks if the specified value exists in the `HashSet`.
- *
- * @since 2.0.0
- * @category elements
- */
-const has = has$1;
-
-/**
- * Check if a predicate holds true for some `HashSet` element.
- *
- * @since 2.0.0
- * @category elements
- */
-const some = some$1;
-
-/**
- * Check if a predicate holds true for every `HashSet` element.
- *
- * @since 2.0.0
- * @category elements
- */
-const every = every$1;
-
-/**
- * Returns `true` if and only if every element in the this `HashSet` is an
- * element of the second set,
- *
- * **NOTE**: the hash and equal of both sets must be the same.
- *
- * @since 2.0.0
- * @category elements
- */
-const isSubset = isSubset$1;
-
-/**
- * Returns an `IterableIterator` of the values in the `HashSet`.
- *
- * @since 2.0.0
- * @category getters
- */
-const values = values$1;
-
-/**
- * Calculates the number of values in the `HashSet`.
- *
- * @since 2.0.0
- * @category getters
- */
-const size = size$1;
-
-/**
- * Marks the `HashSet` as mutable.
- *
- * @since 2.0.0
- */
-const beginMutation = beginMutation$1;
-
-/**
- * Marks the `HashSet` as immutable.
- *
- * @since 2.0.0
- */
-const endMutation = endMutation$1;
-
-/**
- * Mutates the `HashSet` within the context of the provided function.
- *
- * @since 2.0.0
- */
-const mutate = mutate$1;
-
-/**
- * Adds a value to the `HashSet`.
- *
- * @since 2.0.0
- */
-const add = add$1;
-
-/**
- * Removes a value from the `HashSet`.
- *
- * @since 2.0.0
- */
-const remove = remove$1;
-
-/**
- * Computes the set difference between this `HashSet` and the specified
- * `Iterable<A>`.
- *
- * **NOTE**: the hash and equal of the values in both the set and the iterable
- * must be the same.
- *
- * @since 2.0.0
- */
-const difference = difference$1;
-
-/**
- * Returns a `HashSet` of values which are present in both this set and that
- * `Iterable<A>`.
- *
- * **NOTE**: the hash and equal of the values in both the set and the iterable
- * must be the same.
- *
- * @since 2.0.0
- */
-const intersection = intersection$1;
-
-/**
- * Computes the set union `(`self` + `that`)` between this `HashSet` and the
- * specified `Iterable<A>`.
- *
- * **NOTE**: the hash and equal of the values in both the set and the iterable
- * must be the same.
- *
- * @since 2.0.0
- */
-const union = union$1;
-
-/**
- * Checks if a value is present in the `HashSet`. If it is present, the value
- * will be removed from the `HashSet`, otherwise the value will be added to the
- * `HashSet`.
- *
- * @since 2.0.0
- */
-const toggle = toggle$1;
-
-/**
- * Maps over the values of the `HashSet` using the specified function.
- *
- * @since 2.0.0
- * @category mapping
- */
-const map = map$1;
-
-/**
- * Chains over the values of the `HashSet` using the specified function.
- *
- * @since 2.0.0
- * @category sequencing
- */
-const flatMap = flatMap$1;
-
-/**
- * Applies the specified function to the values of the `HashSet`.
- *
- * @since 2.0.0
- * @category traversing
- */
-const forEach = forEach$1;
-
-/**
- * Reduces the specified state over the values of the `HashSet`.
- *
- * @since 2.0.0
- * @category folding
- */
-const reduce = reduce$1;
-
-/**
- * Filters values out of a `HashSet` using the specified predicate.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filter = filter$1;
-
-/**
- * Partition the values of a `HashSet` using the specified predicate.
- *
- * If a value matches the predicate, it will be placed into the `HashSet` on the
- * right side of the resulting `Tuple`, otherwise the value will be placed into
- * the left side.
- *
- * @since 2.0.0
- * @category partitioning
- */
-const partition = partition$1;
-
-var HashSet = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  isHashSet: isHashSet,
-  empty: empty,
-  fromIterable: fromIterable,
-  make: make,
-  has: has,
-  some: some,
-  every: every,
-  isSubset: isSubset,
-  values: values,
-  size: size,
-  beginMutation: beginMutation,
-  endMutation: endMutation,
-  mutate: mutate,
-  add: add,
-  remove: remove,
-  difference: difference,
-  intersection: intersection,
-  union: union,
-  toggle: toggle,
-  map: map,
-  flatMap: flatMap,
-  forEach: forEach,
-  reduce: reduce,
-  filter: filter,
-  partition: partition
-});
-
-export { HashSet as H, add as a, map as b, fromIterable as c, difference as d, empty as e, flatMap as f, every as g, has as h, isHashSet as i, remove as j, forEach as k, some as l, make as m, isSubset as n, beginMutation as o, endMutation as p, mutate as q, reduce as r, size as s, intersection as t, union as u, values as v, toggle as w, filter as x, partition as y };

package/dist/Inspectable-b0c51e90.esm.js

@@ -1,45 +0,0 @@
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const NodeInspectSymbol = /*#__PURE__*/Symbol.for("nodejs.util.inspect.custom");
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-const toJSON = x => {
-  if (typeof x === "object" && x !== null && "toJSON" in x && typeof x["toJSON"] === "function" && x["toJSON"].length === 0) {
-    return x.toJSON();
-  } else if (Array.isArray(x)) {
-    return x.map(toJSON);
-  }
-  return x;
-};
-
-/**
- * @since 2.0.0
- */
-const toString = x => JSON.stringify(x, null, 2);
-
-var Inspectable = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  NodeInspectSymbol: NodeInspectSymbol,
-  toJSON: toJSON,
-  toString: toString
-});
-
-export { Inspectable as I, NodeInspectSymbol as N, toJSON as a, toString as t };

package/dist/KeyedPool-08ee3618.esm.js

@@ -1,273 +0,0 @@
-import { d as decode, i as infinity } from './Duration-98bca14c.esm.js';
-import { e as equals, s as symbol$1 } from './Equal-2a99fde3.esm.js';
-import { d as dual, p as pipe } from './Function-12511160.esm.js';
-import { s as symbol, c as combine, h as hash, d as string } from './Hash-7910f34f.esm.js';
-import { e as empty, g as get$3, j as has, s as set, c as remove, v as values } from './HashMap-6c230bde.esm.js';
-import { m as map, bv as context, n as fiberId, s as sync, f as flatMap, at as forEachSequentialDiscard, a as suspend, X as uninterruptibleMask, l as deferredUnsafeMake, bC as provideContext, B as matchCauseEffect, z as zipRight, a2 as deferredFailCause, C as failCause, aj as as, g as deferredSucceed, b as deferredAwait, j as succeed, Z as forEachSequential } from './core-64ab7ff5.esm.js';
-import { a as all, s as scopeMake, ad as scopeExtend } from './fiberRuntime-bfcf5f49.esm.js';
-import { g as get$2, a as makeWithTTL$2 } from './pool-7d5c25ef.esm.js';
-import { m as make$2, g as get$4, u as update } from './MutableRef-2734b082.esm.js';
-import { c as getOrUndefined, g as getOrElse, n as none, s as some } from './Option-df40d2b9.esm.js';
-import { p as pipeArguments } from './Pipeable-10760a1d.esm.js';
-import { d as isTagged } from './Predicate-6b61b95b.esm.js';
-
-/** @internal */
-const KeyedPoolSymbolKey = "effect/KeyedPool";
-
-/** @internal */
-const KeyedPoolTypeId$1 = /*#__PURE__*/Symbol.for(KeyedPoolSymbolKey);
-const KeyedPoolMapValueSymbol = /*#__PURE__*/Symbol.for("effect/KeyedPool/MapValue");
-const keyedPoolVariance = {
-  _K: _ => _,
-  _E: _ => _,
-  _A: _ => _
-};
-class KeyedPoolImpl {
-  [KeyedPoolTypeId$1] = keyedPoolVariance;
-  constructor(getOrCreatePool, activePools) {
-    this.getOrCreatePool = getOrCreatePool;
-    this.activePools = activePools;
-  }
-  get(key) {
-    return flatMap(this.getOrCreatePool(key), get$2);
-  }
-  invalidate(item) {
-    return flatMap(this.activePools(), forEachSequentialDiscard(pool => pool.invalidate(item)));
-  }
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-}
-class Complete {
-  _tag = "Complete";
-  [KeyedPoolMapValueSymbol] = KeyedPoolMapValueSymbol;
-  constructor(pool) {
-    this.pool = pool;
-  }
-  [symbol]() {
-    return pipe(string("effect/KeyedPool/Complete"), combine(hash(this.pool)));
-  }
-  [symbol$1](u) {
-    return isComplete(u) && equals(this.pool, u.pool);
-  }
-}
-const isComplete = u => isTagged(u, "Complete") && KeyedPoolMapValueSymbol in u;
-class Pending {
-  _tag = "Pending";
-  [KeyedPoolMapValueSymbol] = KeyedPoolMapValueSymbol;
-  constructor(deferred) {
-    this.deferred = deferred;
-  }
-  [symbol]() {
-    return pipe(string("effect/KeyedPool/Pending"), combine(hash(this.deferred)));
-  }
-  [symbol$1](u) {
-    return isPending(u) && equals(this.deferred, u.deferred);
-  }
-}
-const isPending = u => isTagged(u, "Pending") && KeyedPoolMapValueSymbol in u;
-const makeImpl = (get, min, max, timeToLive) => pipe(all([context(), fiberId, sync(() => make$2(empty())), scopeMake()]), map(([context, fiberId, map, scope]) => {
-  const getOrCreatePool = key => suspend(() => {
-    let value = getOrUndefined(get$3(get$4(map), key));
-    if (value === undefined) {
-      return uninterruptibleMask(restore => {
-        const deferred = deferredUnsafeMake(fiberId);
-        value = new Pending(deferred);
-        let previous = undefined;
-        if (has(get$4(map), key)) {
-          previous = getOrUndefined(get$3(get$4(map), key));
-        } else {
-          update(map, set(key, value));
-        }
-        if (previous === undefined) {
-          return pipe(restore(scopeExtend(makeWithTTL$2({
-            acquire: provideContext(get(key), context),
-            min: min(key),
-            max: max(key),
-            timeToLive: getOrElse(timeToLive(key), () => infinity)
-          }), scope)), matchCauseEffect({
-            onFailure: cause => {
-              const current = getOrUndefined(get$3(get$4(map), key));
-              if (equals(current, value)) {
-                update(map, remove(key));
-              }
-              return zipRight(deferredFailCause(deferred, cause), failCause(cause));
-            },
-            onSuccess: pool => {
-              update(map, set(key, new Complete(pool)));
-              return as(deferredSucceed(deferred, pool), pool);
-            }
-          }));
-        }
-        switch (previous._tag) {
-          case "Complete":
-            {
-              return succeed(previous.pool);
-            }
-          case "Pending":
-            {
-              return restore(deferredAwait(previous.deferred));
-            }
-        }
-      });
-    }
-    switch (value._tag) {
-      case "Complete":
-        {
-          return succeed(value.pool);
-        }
-      case "Pending":
-        {
-          return deferredAwait(value.deferred);
-        }
-    }
-  });
-  const activePools = () => suspend(() => forEachSequential(Array.from(values(get$4(map))), value => {
-    switch (value._tag) {
-      case "Complete":
-        {
-          return succeed(value.pool);
-        }
-      case "Pending":
-        {
-          return deferredAwait(value.deferred);
-        }
-    }
-  }));
-  return new KeyedPoolImpl(getOrCreatePool, activePools);
-}));
-
-/** @internal */
-const make$1 = options => makeImpl(options.acquire, () => options.size, () => options.size, () => none());
-
-/** @internal */
-const makeWith$1 = options => makeImpl(options.acquire, options.size, options.size, () => none());
-
-/** @internal */
-const makeWithTTL$1 = options => {
-  const timeToLive = decode(options.timeToLive);
-  return makeImpl(options.acquire, options.min, options.max, () => some(timeToLive));
-};
-
-/** @internal */
-const makeWithTTLBy$1 = options => makeImpl(options.acquire, options.min, options.max, key => some(decode(options.timeToLive(key))));
-
-/** @internal */
-const get$1 = /*#__PURE__*/dual(2, (self, key) => self.get(key));
-
-/** @internal */
-const invalidate$1 = /*#__PURE__*/dual(2, (self, item) => self.invalidate(item));
-
-/**
- * @since 2.0.0
- */
-/**
- * @since 2.0.0
- * @category symbols
- */
-const KeyedPoolTypeId = KeyedPoolTypeId$1;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * A `KeyedPool<K, E, A>` is a pool of `Pool`s of items of type `A`. Each pool
- * in the `KeyedPool` is associated with a key of type `K`.
- *
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-
-/**
- * Makes a new pool of the specified fixed size. The pool is returned in a
- * `Scope`, which governs the lifetime of the pool. When the pool is shutdown
- * because the `Scope` is closed, the individual items allocated by the pool
- * will be released in some unspecified order.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make = make$1;
-
-/**
- * Makes a new pool of the specified fixed size. The pool is returned in a
- * `Scope`, which governs the lifetime of the pool. When the pool is shutdown
- * because the `Scope` is closed, the individual items allocated by the pool
- * will be released in some unspecified order.
- *
- * The size of the underlying pools can be configured per key.
- *
- * @since 2.0.0
- * @category constructors
- */
-const makeWith = makeWith$1;
-
-/**
- * Makes a new pool with the specified minimum and maximum sizes and time to
- * live before a pool whose excess items are not being used will be shrunk
- * down to the minimum size. The pool is returned in a `Scope`, which governs
- * the lifetime of the pool. When the pool is shutdown because the `Scope` is
- * used, the individual items allocated by the pool will be released in some
- * unspecified order.
- *
- * The size of the underlying pools can be configured per key.
- *
- * @since 2.0.0
- * @category constructors
- */
-const makeWithTTL = makeWithTTL$1;
-
-/**
- * Makes a new pool with the specified minimum and maximum sizes and time to
- * live before a pool whose excess items are not being used will be shrunk
- * down to the minimum size. The pool is returned in a `Scope`, which governs
- * the lifetime of the pool. When the pool is shutdown because the `Scope` is
- * used, the individual items allocated by the pool will be released in some
- * unspecified order.
- *
- * The size of the underlying pools can be configured per key.
- *
- * @since 2.0.0
- * @category constructors
- */
-const makeWithTTLBy = makeWithTTLBy$1;
-
-/**
- * Retrieves an item from the pool belonging to the given key in a scoped
- * effect. Note that if acquisition fails, then the returned effect will fail
- * for that same reason. Retrying a failed acquisition attempt will repeat the
- * acquisition attempt.
- *
- * @since 2.0.0
- * @category combinators
- */
-const get = get$1;
-
-/**
- * Invalidates the specified item. This will cause the pool to eventually
- * reallocate the item, although this reallocation may occur lazily rather
- * than eagerly.
- *
- * @since 2.0.0
- * @category combinators
- */
-const invalidate = invalidate$1;
-
-var KeyedPool = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  KeyedPoolTypeId: KeyedPoolTypeId,
-  make: make,
-  makeWith: makeWith,
-  makeWithTTL: makeWithTTL,
-  makeWithTTLBy: makeWithTTLBy,
-  get: get,
-  invalidate: invalidate
-});
-
-export { KeyedPool as K, KeyedPoolTypeId as a, makeWith as b, makeWithTTL as c, makeWithTTLBy as d, get as g, invalidate as i, make as m };