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

package/dist/Queue-d99be5de.esm.js

@@ -1,362 +0,0 @@
-import { E as EnqueueTypeId$1, D as DequeueTypeId$1, Q as QueueStrategyTypeId$1, i as isQueue$1, a as isDequeue$1, b as isEnqueue$1, c as backPressureStrategy$1, f as droppingStrategy$1, s as slidingStrategy$1, m as make$1, g as bounded$1, h as dropping$1, j as sliding$1, u as unbounded$1, k as capacity$1, l as size$1, n as isEmpty$1, o as isFull$1, p as isShutdown$1, q as awaitShutdown$1, r as shutdown$1, t as offer$1, v as unsafeOffer$1, w as offerAll$1, x as poll$1, y as take$1, z as takeAll$1, A as takeUpTo$1, B as takeBetween$1, C as takeN$1 } from './queue-f74db567.esm.js';
-
-/**
- * @since 2.0.0
- */
-/**
- * @since 2.0.0
- * @category symbols
- */
-const EnqueueTypeId = EnqueueTypeId$1;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const DequeueTypeId = DequeueTypeId$1;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const QueueStrategyTypeId = QueueStrategyTypeId$1;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * The base interface that all `Queue`s must implement.
- *
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-
-/**
- * Returns `true` if the specified value is a `Queue`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isQueue = isQueue$1;
-
-/**
- * Returns `true` if the specified value is a `Dequeue`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isDequeue = isDequeue$1;
-
-/**
- * Returns `true` if the specified value is a `Enqueue`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isEnqueue = isEnqueue$1;
-
-/**
- * @since 2.0.0
- * @category strategies
- */
-const backPressureStrategy = backPressureStrategy$1;
-
-/**
- * @since 2.0.0
- * @category strategies
- */
-const droppingStrategy = droppingStrategy$1;
-
-/**
- * @since 2.0.0
- * @category strategies
- */
-const slidingStrategy = slidingStrategy$1;
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const make = make$1;
-
-/**
- * Makes a new bounded `Queue`. When the capacity of the queue is reached, any
- * additional calls to `offer` will be suspended until there is more room in
- * the queue.
- *
- * **Note**: When possible use only power of 2 capacities; this will provide
- * better performance by utilising an optimised version of the underlying
- * `RingBuffer`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const bounded = bounded$1;
-
-/**
- * Makes a new bounded `Queue` with the dropping strategy.
- *
- * When the capacity of the queue is reached, new elements will be dropped and the
- * old elements will remain.
- *
- * **Note**: When possible use only power of 2 capacities; this will provide
- * better performance by utilising an optimised version of the underlying
- * `RingBuffer`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const dropping = dropping$1;
-
-/**
- * Makes a new bounded `Queue` with the sliding strategy.
- *
- * When the capacity of the queue is reached, new elements will be added and the
- * old elements will be dropped.
- *
- * **Note**: When possible use only power of 2 capacities; this will provide
- * better performance by utilising an optimised version of the underlying
- * `RingBuffer`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const sliding = sliding$1;
-
-/**
- * Creates a new unbounded `Queue`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const unbounded = unbounded$1;
-
-/**
- * Returns the number of elements the queue can hold.
- *
- * @since 2.0.0
- * @category getters
- */
-const capacity = capacity$1;
-
-/**
- * Retrieves the size of the queue, which is equal to the number of elements
- * in the queue. This may be negative if fibers are suspended waiting for
- * elements to be added to the queue.
- *
- * @since 2.0.0
- * @category getters
- */
-const size = size$1;
-
-/**
- * Returns `true` if the `Queue` contains zero elements, `false` otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isEmpty = isEmpty$1;
-
-/**
- * Returns `true` if the `Queue` contains at least one element, `false`
- * otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isFull = isFull$1;
-
-/**
- * Returns `true` if `shutdown` has been called, otherwise returns `false`.
- *
- * @since 2.0.0
- * @category getters
- */
-const isShutdown = isShutdown$1;
-
-/**
- * Waits until the queue is shutdown. The `Effect` returned by this method will
- * not resume until the queue has been shutdown. If the queue is already
- * shutdown, the `Effect` will resume right away.
- *
- * @since 2.0.0
- * @category utils
- */
-const awaitShutdown = awaitShutdown$1;
-
-/**
- * Interrupts any fibers that are suspended on `offer` or `take`. Future calls
- * to `offer*` and `take*` will be interrupted immediately.
- *
- * @since 2.0.0
- * @category utils
- */
-const shutdown = shutdown$1;
-
-/**
- * Places one value in the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const offer = offer$1;
-
-/**
- * Places one value in the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const unsafeOffer = unsafeOffer$1;
-
-/**
- * For Bounded Queue: uses the `BackPressure` Strategy, places the values in
- * the queue and always returns true. If the queue has reached capacity, then
- * the fiber performing the `offerAll` will be suspended until there is room
- * in the queue.
- *
- * For Unbounded Queue: Places all values in the queue and returns true.
- *
- * For Sliding Queue: uses `Sliding` Strategy If there is room in the queue,
- * it places the values otherwise it removes the old elements and enqueues the
- * new ones. Always returns true.
- *
- * For Dropping Queue: uses `Dropping` Strategy, It places the values in the
- * queue but if there is no room it will not enqueue them and return false.
- *
- * @since 2.0.0
- * @category utils
- */
-const offerAll = offerAll$1;
-
-/**
- * Returns the first value in the `Queue` as a `Some<A>`, or `None` if the queue
- * is empty.
- *
- * @since 2.0.0
- * @category utils
- */
-const poll = poll$1;
-
-/**
- * Takes the oldest value in the queue. If the queue is empty, this will return
- * a computation that resumes when an item has been added to the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const take = take$1;
-
-/**
- * Takes all the values in the queue and returns the values. If the queue is
- * empty returns an empty collection.
- *
- * @since 2.0.0
- * @category utils
- */
-const takeAll = takeAll$1;
-
-/**
- * Takes up to max number of values from the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const takeUpTo = takeUpTo$1;
-
-/**
- * Takes a number of elements from the queue between the specified minimum and
- * maximum. If there are fewer than the minimum number of elements available,
- * suspends until at least the minimum number of elements have been collected.
- *
- * @since 2.0.0
- * @category utils
- */
-const takeBetween = takeBetween$1;
-
-/**
- * Takes the specified number of elements from the queue. If there are fewer
- * than the specified number of elements available, it suspends until they
- * become available.
- *
- * @since 2.0.0
- * @category utils
- */
-const takeN = takeN$1;
-
-var Queue = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  EnqueueTypeId: EnqueueTypeId,
-  DequeueTypeId: DequeueTypeId,
-  QueueStrategyTypeId: QueueStrategyTypeId,
-  isQueue: isQueue,
-  isDequeue: isDequeue,
-  isEnqueue: isEnqueue,
-  backPressureStrategy: backPressureStrategy,
-  droppingStrategy: droppingStrategy,
-  slidingStrategy: slidingStrategy,
-  make: make,
-  bounded: bounded,
-  dropping: dropping,
-  sliding: sliding,
-  unbounded: unbounded,
-  capacity: capacity,
-  size: size,
-  isEmpty: isEmpty,
-  isFull: isFull,
-  isShutdown: isShutdown,
-  awaitShutdown: awaitShutdown,
-  shutdown: shutdown,
-  offer: offer,
-  unsafeOffer: unsafeOffer,
-  offerAll: offerAll,
-  poll: poll,
-  take: take,
-  takeAll: takeAll,
-  takeUpTo: takeUpTo,
-  takeBetween: takeBetween,
-  takeN: takeN
-});
-
-export { make as A, unsafeOffer as B, DequeueTypeId as D, EnqueueTypeId as E, Queue as Q, size as a, bounded as b, offerAll as c, capacity as d, awaitShutdown as e, isFull as f, isEmpty as g, takeAll as h, isShutdown as i, takeUpTo as j, takeBetween as k, takeN as l, dropping as m, sliding as n, offer as o, poll as p, QueueStrategyTypeId as q, isQueue as r, shutdown as s, take as t, unbounded as u, isDequeue as v, isEnqueue as w, backPressureStrategy as x, droppingStrategy as y, slidingStrategy as z };

package/dist/Random-5ed16d23.esm.js

@@ -1,94 +0,0 @@
-import { R as RandomTypeId$1, n as next$1, o as nextInt$1, p as nextBoolean$1, q as nextRange$1, u as nextIntBetween$1, v as shuffle$1, r as randomWith$1 } from './defaultServices-b9ca1236.esm.js';
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const RandomTypeId = RandomTypeId$1;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * Returns the next numeric value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const next = next$1;
-
-/**
- * Returns the next integer value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextInt = nextInt$1;
-
-/**
- * Returns the next boolean value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextBoolean = nextBoolean$1;
-
-/**
- * Returns the next numeric value in the specified range from the
- * pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextRange = nextRange$1;
-
-/**
- * Returns the next integer value in the specified range from the
- * pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextIntBetween = nextIntBetween$1;
-
-/**
- * Uses the pseudo-random number generator to shuffle the specified iterable.
- *
- * @since 2.0.0
- * @category constructors
- */
-const shuffle = shuffle$1;
-
-/**
- * Retreives the `Random` service from the context and uses it to run the
- * specified workflow.
- *
- * @since 2.0.0
- * @category constructors
- */
-const randomWith = randomWith$1;
-
-var Random = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  RandomTypeId: RandomTypeId,
-  next: next,
-  nextInt: nextInt,
-  nextBoolean: nextBoolean,
-  nextRange: nextRange,
-  nextIntBetween: nextIntBetween,
-  shuffle: shuffle,
-  randomWith: randomWith
-});
-
-export { Random as R, RandomTypeId as a, nextInt as b, nextBoolean as c, nextRange as d, nextIntBetween as e, next as n, randomWith as r, shuffle as s };