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

package/dist/Order-a875fe30.esm.js

@@ -1,293 +0,0 @@
-import { d as dual } from './Function-12511160.esm.js';
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @category type class
- * @since 2.0.0
- */
-
-/**
- * @category type lambdas
- * @since 2.0.0
- */
-
-/**
- * @category constructors
- * @since 2.0.0
- */
-const make = compare => (self, that) => self === that ? 0 : compare(self, that);
-
-/**
- * @category instances
- * @since 2.0.0
- */
-const string = /*#__PURE__*/make((self, that) => self < that ? -1 : 1);
-
-/**
- * @category instances
- * @since 2.0.0
- */
-const number = /*#__PURE__*/make((self, that) => self < that ? -1 : 1);
-
-/**
- * @category instances
- * @since 2.0.0
- */
-const boolean = /*#__PURE__*/make((self, that) => self < that ? -1 : 1);
-
-/**
- * @category instances
- * @since 2.0.0
- */
-const bigint = /*#__PURE__*/make((self, that) => self < that ? -1 : 1);
-
-/**
- * @since 2.0.0
- */
-const reverse = O => make((self, that) => O(that, self));
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const combine = /*#__PURE__*/dual(2, (self, that) => make((a1, a2) => {
-  const out = self(a1, a2);
-  if (out !== 0) {
-    return out;
-  }
-  return that(a1, a2);
-}));
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const combineMany = /*#__PURE__*/dual(2, (self, collection) => make((a1, a2) => {
-  let out = self(a1, a2);
-  if (out !== 0) {
-    return out;
-  }
-  for (const O of collection) {
-    out = O(a1, a2);
-    if (out !== 0) {
-      return out;
-    }
-  }
-  return out;
-}));
-
-/**
- * @since 2.0.0
- */
-const empty = () => make(() => 0);
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const combineAll = collection => combineMany(empty(), collection);
-
-/**
- * @category combinators
- * @since 2.0.0
- */
-const mapInput = /*#__PURE__*/dual(2, (self, f) => make((b1, b2) => self(f(b1), f(b2))));
-
-/**
- * @category instances
- * @since 2.0.0
- */
-const Date = /*#__PURE__*/mapInput(number, date => date.getTime());
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const product = /*#__PURE__*/dual(2, (self, that) => make(([xa, xb], [ya, yb]) => {
-  const o = self(xa, ya);
-  return o !== 0 ? o : that(xb, yb);
-}));
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const all = collection => {
-  return make((x, y) => {
-    const len = Math.min(x.length, y.length);
-    let collectionLength = 0;
-    for (const O of collection) {
-      if (collectionLength >= len) {
-        break;
-      }
-      const o = O(x[collectionLength], y[collectionLength]);
-      if (o !== 0) {
-        return o;
-      }
-      collectionLength++;
-    }
-    return 0;
-  });
-};
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const productMany = /*#__PURE__*/dual(2, (self, collection) => {
-  const O = all(collection);
-  return make((x, y) => {
-    const o = self(x[0], y[0]);
-    return o !== 0 ? o : O(x.slice(1), y.slice(1));
-  });
-});
-
-/**
- * Similar to `Promise.all` but operates on `Order`s.
- *
- * ```
- * [Order<A>, Order<B>, ...] -> Order<[A, B, ...]>
- * ```
- *
- * This function creates and returns a new `Order` for a tuple of values based on the given `Order`s for each element in the tuple.
- * The returned `Order` compares two tuples of the same type by applying the corresponding `Order` to each element in the tuple.
- * It is useful when you need to compare two tuples of the same type and you have a specific way of comparing each element
- * of the tuple.
- *
- * @category combinators
- * @since 2.0.0
- */
-const tuple = (...elements) => all(elements);
-
-/**
- * This function creates and returns a new `Order` for an array of values based on a given `Order` for the elements of the array.
- * The returned `Order` compares two arrays by applying the given `Order` to each element in the arrays.
- * If all elements are equal, the arrays are then compared based on their length.
- * It is useful when you need to compare two arrays of the same type and you have a specific way of comparing each element of the array.
- *
- * @category combinators
- * @since 2.0.0
- */
-const array = O => make((self, that) => {
-  const aLen = self.length;
-  const bLen = that.length;
-  const len = Math.min(aLen, bLen);
-  for (let i = 0; i < len; i++) {
-    const o = O(self[i], that[i]);
-    if (o !== 0) {
-      return o;
-    }
-  }
-  return number(aLen, bLen);
-});
-
-/**
- * This function creates and returns a new `Order` for a struct of values based on the given `Order`s
- * for each property in the struct.
- *
- * @category combinators
- * @since 2.0.0
- */
-const struct = fields => {
-  const keys = Object.keys(fields);
-  return make((self, that) => {
-    for (const key of keys) {
-      const o = fields[key](self[key], that[key]);
-      if (o !== 0) {
-        return o;
-      }
-    }
-    return 0;
-  });
-};
-
-/**
- * Test whether one value is _strictly less than_ another.
- *
- * @since 2.0.0
- */
-const lessThan = O => dual(2, (self, that) => O(self, that) === -1);
-
-/**
- * Test whether one value is _strictly greater than_ another.
- *
- * @since 2.0.0
- */
-const greaterThan = O => dual(2, (self, that) => O(self, that) === 1);
-
-/**
- * Test whether one value is _non-strictly less than_ another.
- *
- * @since 2.0.0
- */
-const lessThanOrEqualTo = O => dual(2, (self, that) => O(self, that) !== 1);
-
-/**
- * Test whether one value is _non-strictly greater than_ another.
- *
- * @since 2.0.0
- */
-const greaterThanOrEqualTo = O => dual(2, (self, that) => O(self, that) !== -1);
-
-/**
- * Take the minimum of two values. If they are considered equal, the first argument is chosen.
- *
- * @since 2.0.0
- */
-const min = O => dual(2, (self, that) => self === that || O(self, that) < 1 ? self : that);
-
-/**
- * Take the maximum of two values. If they are considered equal, the first argument is chosen.
- *
- * @since 2.0.0
- */
-const max = O => dual(2, (self, that) => self === that || O(self, that) > -1 ? self : that);
-
-/**
- * Clamp a value between a minimum and a maximum.
- *
- * @since 2.0.0
- */
-const clamp = O => dual(3, (self, minimum, maximum) => min(O)(maximum, max(O)(minimum, self)));
-
-/**
- * Test whether a value is between a minimum and a maximum (inclusive).
- *
- * @since 2.0.0
- */
-const between = O => dual(3, (self, minimum, maximum) => !lessThan(O)(self, minimum) && !greaterThan(O)(self, maximum));
-
-var Order = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  make: make,
-  string: string,
-  number: number,
-  boolean: boolean,
-  bigint: bigint,
-  reverse: reverse,
-  combine: combine,
-  combineMany: combineMany,
-  empty: empty,
-  combineAll: combineAll,
-  mapInput: mapInput,
-  Date: Date,
-  product: product,
-  all: all,
-  productMany: productMany,
-  tuple: tuple,
-  array: array,
-  struct: struct,
-  lessThan: lessThan,
-  greaterThan: greaterThan,
-  lessThanOrEqualTo: lessThanOrEqualTo,
-  greaterThanOrEqualTo: greaterThanOrEqualTo,
-  min: min,
-  max: max,
-  clamp: clamp,
-  between: between
-});
-
-export { Date as D, Order as O, make as a, min as b, combineAll as c, max as d, array as e, boolean as f, lessThanOrEqualTo as g, greaterThan as h, greaterThanOrEqualTo as i, between as j, clamp as k, lessThan as l, mapInput as m, number as n, bigint as o, struct as p, combine as q, reverse as r, string as s, tuple as t, combineMany as u, empty as v, product as w, all as x, productMany as y };

package/dist/Ordering-079176ff.esm.js

@@ -1,97 +0,0 @@
-import { d as dual } from './Function-12511160.esm.js';
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @category model
- * @since 2.0.0
- */
-
-/**
- * Inverts the ordering of the input `Ordering`.
- *
- * @param o - The input `Ordering`.
- *
- * @example
- * import { reverse } from "effect/Ordering"
- *
- * assert.deepStrictEqual(reverse(1), -1)
- * assert.deepStrictEqual(reverse(-1), 1)
- * assert.deepStrictEqual(reverse(0), 0)
- *
- * @since 2.0.0
- */
-const reverse = o => o === -1 ? 1 : o === 1 ? -1 : 0;
-
-/**
- * Depending on the `Ordering` parameter given to it, returns a value produced by one of the 3 functions provided as parameters.
- *
- * @param self - The `Ordering` parameter to match against.
- * @param onLessThan - A function that will be called if the `Ordering` parameter is `-1`.
- * @param onEqual - A function that will be called if the `Ordering` parameter is `0`.
- * @param onGreaterThan - A function that will be called if the `Ordering` parameter is `1`.
- *
- * @example
- * import { match } from "effect/Ordering"
- * import { constant } from "effect/Function"
- *
- * const toMessage = match({
- *   onLessThan: constant('less than'),
- *   onEqual: constant('equal'),
- *   onGreaterThan: constant('greater than')
- * })
- *
- * assert.deepStrictEqual(toMessage(-1), "less than")
- * assert.deepStrictEqual(toMessage(0), "equal")
- * assert.deepStrictEqual(toMessage(1), "greater than")
- *
- * @category pattern matching
- * @since 2.0.0
- */
-const match = /*#__PURE__*/dual(2, (self, {
-  onEqual,
-  onGreaterThan,
-  onLessThan
-}) => self === -1 ? onLessThan() : self === 0 ? onEqual() : onGreaterThan());
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const combine = /*#__PURE__*/dual(2, (self, that) => self !== 0 ? self : that);
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const combineMany = /*#__PURE__*/dual(2, (self, collection) => {
-  let ordering = self;
-  if (ordering !== 0) {
-    return ordering;
-  }
-  for (ordering of collection) {
-    if (ordering !== 0) {
-      return ordering;
-    }
-  }
-  return ordering;
-});
-
-/**
- * @category combining
- * @since 2.0.0
- */
-const combineAll = collection => combineMany(0, collection);
-
-var Ordering = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  reverse: reverse,
-  match: match,
-  combine: combine,
-  combineMany: combineMany,
-  combineAll: combineAll
-});
-
-export { Ordering as O, combineMany as a, combineAll as b, combine as c, match as m, reverse as r };

package/dist/Pipeable-10760a1d.esm.js

@@ -1,49 +0,0 @@
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-const pipeArguments = (self, args) => {
-  switch (args.length) {
-    case 1:
-      return args[0](self);
-    case 2:
-      return args[1](args[0](self));
-    case 3:
-      return args[2](args[1](args[0](self)));
-    case 4:
-      return args[3](args[2](args[1](args[0](self))));
-    case 5:
-      return args[4](args[3](args[2](args[1](args[0](self)))));
-    case 6:
-      return args[5](args[4](args[3](args[2](args[1](args[0](self))))));
-    case 7:
-      return args[6](args[5](args[4](args[3](args[2](args[1](args[0](self)))))));
-    case 8:
-      return args[7](args[6](args[5](args[4](args[3](args[2](args[1](args[0](self))))))));
-    case 9:
-      return args[8](args[7](args[6](args[5](args[4](args[3](args[2](args[1](args[0](self)))))))));
-    default:
-      {
-        let ret = self;
-        for (let i = 0, len = args.length; i < len; i++) {
-          ret = args[i](ret);
-        }
-        return ret;
-      }
-  }
-};
-
-var Pipeable = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  pipeArguments: pipeArguments
-});
-
-export { Pipeable as P, pipeArguments as p };

package/dist/Pool-f1667f78.esm.js

@@ -1,114 +0,0 @@
-import { P as PoolTypeId$1, i as isPool$1, m as make$1, a as makeWithTTL$1, g as get$1, b as invalidate$1 } from './pool-7d5c25ef.esm.js';
-
-/**
- * @since 2.0.0
- */
-/**
- * @since 2.0.0
- * @category symbols
- */
-const PoolTypeId = PoolTypeId$1;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * A `Pool<E, A>` is a pool of items of type `A`, each of which may be
- * associated with the acquisition and release of resources. An attempt to get
- * an item `A` from a pool may fail with an error of type `E`.
- *
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-
-/**
- * Returns `true` if the specified value is a `Pool`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isPool = isPool$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.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make = make$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.
- *
- * ```ts
- * import * as Duration from "./Duration"
- * import * as Effect from "effect/Effect"
- * import * as Pool from "effect/Pool"
- * import * as Scope from "effect/Scope"
- * import { pipe } from "./Function"
- *
- * Effect.scoped(
- *   pipe(
- *     Pool.make(acquireDbConnection, 10, 20, Duration.seconds(60)),
- *     Effect.flatMap((pool) =>
- *       Effect.scoped(
- *         pipe(
- *           pool.get(),
- *           Effect.flatMap((connection) => useConnection(connection))
- *         )
- *       )
- *     )
- *   )
- * )
- * ```
- *
- * @since 2.0.0
- * @category constructors
- */
-const makeWithTTL = makeWithTTL$1;
-
-/**
- * Retrieves an item from the pool 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 getters
- */
-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 Pool = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  PoolTypeId: PoolTypeId,
-  isPool: isPool,
-  make: make,
-  makeWithTTL: makeWithTTL,
-  get: get,
-  invalidate: invalidate
-});
-
-export { Pool as P, PoolTypeId as a, makeWithTTL as b, invalidate as c, get as g, isPool as i, make as m };