effect 2.0.0-next.42 → 2.0.0-next.43

package/dist/Queue-bc7bd323.cjs.dev.js

@@ -1,394 +0,0 @@
-'use strict';
-
-var queue = require('./queue-5fffc770.cjs.dev.js');
-
-/**
- * @since 2.0.0
- */
-/**
- * @since 2.0.0
- * @category symbols
- */
-const EnqueueTypeId = queue.EnqueueTypeId;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const DequeueTypeId = queue.DequeueTypeId;
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const QueueStrategyTypeId = queue.QueueStrategyTypeId;
-
-/**
- * @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 = queue.isQueue;
-
-/**
- * Returns `true` if the specified value is a `Dequeue`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isDequeue = queue.isDequeue;
-
-/**
- * Returns `true` if the specified value is a `Enqueue`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isEnqueue = queue.isEnqueue;
-
-/**
- * @since 2.0.0
- * @category strategies
- */
-const backPressureStrategy = queue.backPressureStrategy;
-
-/**
- * @since 2.0.0
- * @category strategies
- */
-const droppingStrategy = queue.droppingStrategy;
-
-/**
- * @since 2.0.0
- * @category strategies
- */
-const slidingStrategy = queue.slidingStrategy;
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const make = queue.make;
-
-/**
- * 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 = queue.bounded;
-
-/**
- * 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 = queue.dropping;
-
-/**
- * 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 = queue.sliding;
-
-/**
- * Creates a new unbounded `Queue`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const unbounded = queue.unbounded;
-
-/**
- * Returns the number of elements the queue can hold.
- *
- * @since 2.0.0
- * @category getters
- */
-const capacity = queue.capacity;
-
-/**
- * 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 = queue.size;
-
-/**
- * Returns `true` if the `Queue` contains zero elements, `false` otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isEmpty = queue.isEmpty;
-
-/**
- * Returns `true` if the `Queue` contains at least one element, `false`
- * otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isFull = queue.isFull;
-
-/**
- * Returns `true` if `shutdown` has been called, otherwise returns `false`.
- *
- * @since 2.0.0
- * @category getters
- */
-const isShutdown = queue.isShutdown;
-
-/**
- * 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 = queue.awaitShutdown;
-
-/**
- * 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 = queue.shutdown;
-
-/**
- * Places one value in the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const offer = queue.offer;
-
-/**
- * Places one value in the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const unsafeOffer = queue.unsafeOffer;
-
-/**
- * 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 = queue.offerAll;
-
-/**
- * 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 = queue.poll;
-
-/**
- * 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 = queue.take;
-
-/**
- * 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 = queue.takeAll;
-
-/**
- * Takes up to max number of values from the queue.
- *
- * @since 2.0.0
- * @category utils
- */
-const takeUpTo = queue.takeUpTo;
-
-/**
- * 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 = queue.takeBetween;
-
-/**
- * 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 = queue.takeN;
-
-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
-});
-
-exports.DequeueTypeId = DequeueTypeId;
-exports.EnqueueTypeId = EnqueueTypeId;
-exports.Queue = Queue;
-exports.QueueStrategyTypeId = QueueStrategyTypeId;
-exports.awaitShutdown = awaitShutdown;
-exports.backPressureStrategy = backPressureStrategy;
-exports.bounded = bounded;
-exports.capacity = capacity;
-exports.dropping = dropping;
-exports.droppingStrategy = droppingStrategy;
-exports.isDequeue = isDequeue;
-exports.isEmpty = isEmpty;
-exports.isEnqueue = isEnqueue;
-exports.isFull = isFull;
-exports.isQueue = isQueue;
-exports.isShutdown = isShutdown;
-exports.make = make;
-exports.offer = offer;
-exports.offerAll = offerAll;
-exports.poll = poll;
-exports.shutdown = shutdown;
-exports.size = size;
-exports.sliding = sliding;
-exports.slidingStrategy = slidingStrategy;
-exports.take = take;
-exports.takeAll = takeAll;
-exports.takeBetween = takeBetween;
-exports.takeN = takeN;
-exports.takeUpTo = takeUpTo;
-exports.unbounded = unbounded;
-exports.unsafeOffer = unsafeOffer;

package/dist/Random-0645cf02.cjs.prod.js

@@ -1,104 +0,0 @@
-'use strict';
-
-var defaultServices = require('./defaultServices-85cd09a5.cjs.prod.js');
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const RandomTypeId = defaultServices.RandomTypeId;
-
-/**
- * @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 = defaultServices.next;
-
-/**
- * Returns the next integer value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextInt = defaultServices.nextInt;
-
-/**
- * Returns the next boolean value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextBoolean = defaultServices.nextBoolean;
-
-/**
- * Returns the next numeric value in the specified range from the
- * pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextRange = defaultServices.nextRange;
-
-/**
- * Returns the next integer value in the specified range from the
- * pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextIntBetween = defaultServices.nextIntBetween;
-
-/**
- * Uses the pseudo-random number generator to shuffle the specified iterable.
- *
- * @since 2.0.0
- * @category constructors
- */
-const shuffle = defaultServices.shuffle;
-
-/**
- * Retreives the `Random` service from the context and uses it to run the
- * specified workflow.
- *
- * @since 2.0.0
- * @category constructors
- */
-const randomWith = defaultServices.randomWith;
-
-var Random = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  RandomTypeId: RandomTypeId,
-  next: next,
-  nextInt: nextInt,
-  nextBoolean: nextBoolean,
-  nextRange: nextRange,
-  nextIntBetween: nextIntBetween,
-  shuffle: shuffle,
-  randomWith: randomWith
-});
-
-exports.Random = Random;
-exports.RandomTypeId = RandomTypeId;
-exports.next = next;
-exports.nextBoolean = nextBoolean;
-exports.nextInt = nextInt;
-exports.nextIntBetween = nextIntBetween;
-exports.nextRange = nextRange;
-exports.randomWith = randomWith;
-exports.shuffle = shuffle;

package/dist/Random-a321de88.cjs.dev.js

@@ -1,104 +0,0 @@
-'use strict';
-
-var defaultServices = require('./defaultServices-101983cd.cjs.dev.js');
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbols
- */
-const RandomTypeId = defaultServices.RandomTypeId;
-
-/**
- * @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 = defaultServices.next;
-
-/**
- * Returns the next integer value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextInt = defaultServices.nextInt;
-
-/**
- * Returns the next boolean value from the pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextBoolean = defaultServices.nextBoolean;
-
-/**
- * Returns the next numeric value in the specified range from the
- * pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextRange = defaultServices.nextRange;
-
-/**
- * Returns the next integer value in the specified range from the
- * pseudo-random number generator.
- *
- * @since 2.0.0
- * @category constructors
- */
-const nextIntBetween = defaultServices.nextIntBetween;
-
-/**
- * Uses the pseudo-random number generator to shuffle the specified iterable.
- *
- * @since 2.0.0
- * @category constructors
- */
-const shuffle = defaultServices.shuffle;
-
-/**
- * Retreives the `Random` service from the context and uses it to run the
- * specified workflow.
- *
- * @since 2.0.0
- * @category constructors
- */
-const randomWith = defaultServices.randomWith;
-
-var Random = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  RandomTypeId: RandomTypeId,
-  next: next,
-  nextInt: nextInt,
-  nextBoolean: nextBoolean,
-  nextRange: nextRange,
-  nextIntBetween: nextIntBetween,
-  shuffle: shuffle,
-  randomWith: randomWith
-});
-
-exports.Random = Random;
-exports.RandomTypeId = RandomTypeId;
-exports.next = next;
-exports.nextBoolean = nextBoolean;
-exports.nextInt = nextInt;
-exports.nextIntBetween = nextIntBetween;
-exports.nextRange = nextRange;
-exports.randomWith = randomWith;
-exports.shuffle = shuffle;