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

package/dist/MutableHashMap-02b39969.esm.js

@@ -1,142 +0,0 @@
-import { d as dual } from './Function-12511160.esm.js';
-import { f as fromIterable$1, g as get$1, h as modify$1, c as remove$1, s as set$1, b as size$1, e as empty$1 } from './HashMap-6c230bde.esm.js';
-import { t as toString, a as toJSON, N as NodeInspectSymbol } from './Inspectable-b0c51e90.esm.js';
-import { u as update, g as get$2, m as make$1 } from './MutableRef-2734b082.esm.js';
-import { i as isSome } from './Option-df40d2b9.esm.js';
-import { p as pipeArguments } from './Pipeable-10760a1d.esm.js';
-
-/**
- * @since 2.0.0
- */
-const TypeId = /*#__PURE__*/Symbol.for("effect/MutableHashMap");
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-const MutableHashMapProto = {
-  [TypeId]: TypeId,
-  [Symbol.iterator]() {
-    return this.backingMap.current[Symbol.iterator]();
-  },
-  toString() {
-    return toString(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "MutableHashMap",
-      values: Array.from(this).map(toJSON)
-    };
-  },
-  [NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-};
-const fromHashMap = backingMap => {
-  const map = Object.create(MutableHashMapProto);
-  map.backingMap = make$1(backingMap);
-  return map;
-};
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const empty = () => fromHashMap(empty$1());
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const make = (...entries) => fromIterable(entries);
-
-/**
- * @since 2.0.0
- * @category conversions
- */
-const fromIterable = entries => fromHashMap(fromIterable$1(entries));
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const get = /*#__PURE__*/dual(2, (self, key) => get$1(self.backingMap.current, key));
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const has = /*#__PURE__*/dual(2, (self, key) => isSome(get(self, key)));
-
-/**
- * Updates the value of the specified key within the `MutableHashMap` if it exists.
- *
- * @since 2.0.0
- */
-const modify = /*#__PURE__*/dual(3, (self, key, f) => {
-  update(self.backingMap, modify$1(key, f));
-  return self;
-});
-
-/**
- * Set or remove the specified key in the `MutableHashMap` using the specified
- * update function.
- *
- * @since 2.0.0
- */
-const modifyAt = /*#__PURE__*/dual(3, (self, key, f) => {
-  const result = f(get(self, key));
-  if (isSome(result)) {
-    set(self, key, result.value);
-  } else {
-    remove(self, key);
-  }
-  return self;
-});
-
-/**
- * @since 2.0.0
- */
-const remove = /*#__PURE__*/dual(2, (self, key) => {
-  update(self.backingMap, remove$1(key));
-  return self;
-});
-
-/**
- * @since 2.0.0
- */
-const set = /*#__PURE__*/dual(3, (self, key, value) => {
-  update(self.backingMap, set$1(key, value));
-  return self;
-});
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const size = self => size$1(get$2(self.backingMap));
-
-var MutableHashMap = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  empty: empty,
-  make: make,
-  fromIterable: fromIterable,
-  get: get,
-  has: has,
-  modify: modify,
-  modifyAt: modifyAt,
-  remove: remove,
-  set: set,
-  size: size
-});
-
-export { MutableHashMap as M, size as a, modify as b, modifyAt as c, empty as e, fromIterable as f, get as g, has as h, make as m, remove as r, set as s };

package/dist/MutableHashSet-db4f96e8.esm.js

@@ -1,101 +0,0 @@
-import { d as dual } from './Function-12511160.esm.js';
-import { t as toString, a as toJSON, N as NodeInspectSymbol } from './Inspectable-b0c51e90.esm.js';
-import { e as empty$1, f as fromIterable$1, s as set, h as has$1, r as remove$1, a as size$1 } from './MutableHashMap-02b39969.esm.js';
-import { p as pipeArguments } from './Pipeable-10760a1d.esm.js';
-
-/**
- * @since 2.0.0
- */
-const TypeId = /*#__PURE__*/Symbol.for("effect/MutableHashSet");
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-const MutableHashSetProto = {
-  [TypeId]: TypeId,
-  [Symbol.iterator]() {
-    return Array.from(this.keyMap).map(([_]) => _)[Symbol.iterator]();
-  },
-  toString() {
-    return toString(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "MutableHashSet",
-      values: Array.from(this).map(toJSON)
-    };
-  },
-  [NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-};
-const fromHashMap = keyMap => {
-  const set = Object.create(MutableHashSetProto);
-  set.keyMap = keyMap;
-  return set;
-};
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const empty = () => fromHashMap(empty$1());
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const fromIterable = keys => fromHashMap(fromIterable$1(Array.from(keys).map(k => [k, true])));
-
-/**
- * @since 2.0.0
- * @category constructors
- */
-const make = (...keys) => fromIterable(keys);
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const add = /*#__PURE__*/dual(2, (self, key) => (set(self.keyMap, key, true), self));
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const has = /*#__PURE__*/dual(2, (self, key) => has$1(self.keyMap, key));
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const remove = /*#__PURE__*/dual(2, (self, key) => (remove$1(self.keyMap, key), self));
-
-/**
- * @since 2.0.0
- * @category elements
- */
-const size = self => size$1(self.keyMap);
-
-var MutableHashSet = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  empty: empty,
-  fromIterable: fromIterable,
-  make: make,
-  add: add,
-  has: has,
-  remove: remove,
-  size: size
-});
-
-export { MutableHashSet as M, add as a, empty as e, fromIterable as f, has as h, make as m, remove as r, size as s };

package/dist/MutableList-76401868.esm.js

@@ -1,281 +0,0 @@
-import { d as dual } from './Function-12511160.esm.js';
-import { t as toString, a as toJSON, N as NodeInspectSymbol } from './Inspectable-b0c51e90.esm.js';
-import { p as pipeArguments } from './Pipeable-10760a1d.esm.js';
-
-/**
- * @since 2.0.0
- */
-const TypeId = /*#__PURE__*/Symbol.for("effect/MutableList");
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category model
- */
-
-const MutableListProto = {
-  [TypeId]: TypeId,
-  [Symbol.iterator]() {
-    let done = false;
-    let head = this.head;
-    return {
-      next() {
-        if (done) {
-          return this.return();
-        }
-        if (head == null) {
-          done = true;
-          return this.return();
-        }
-        const value = head.value;
-        head = head.next;
-        return {
-          done,
-          value
-        };
-      },
-      return(value) {
-        if (!done) {
-          done = true;
-        }
-        return {
-          done: true,
-          value
-        };
-      }
-    };
-  },
-  toString() {
-    return toString(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "MutableList",
-      values: Array.from(this).map(toJSON)
-    };
-  },
-  [NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-};
-/** @internal */
-class LinkedListNode {
-  removed = false;
-  prev = undefined;
-  next = undefined;
-  constructor(value) {
-    this.value = value;
-  }
-}
-
-/**
- * Creates an empty `MutableList`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const empty = () => {
-  const list = Object.create(MutableListProto);
-  list.head = undefined;
-  list.tail = undefined;
-  list._length = 0;
-  return list;
-};
-
-/**
- * Creates a new `MutableList` from an `Iterable`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const fromIterable = iterable => {
-  const list = empty();
-  for (const element of iterable) {
-    append(list, element);
-  }
-  return list;
-};
-
-/**
- * Creates a new `MutableList` from the specified elements.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make = (...elements) => fromIterable(elements);
-
-/**
- * Returns `true` if the list contains zero elements, `false`, otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isEmpty = self => length(self) === 0;
-
-/**
- * Returns the length of the list.
- *
- * @since 2.0.0
- * @category getters
- */
-const length = self => self._length;
-
-/**
- * Returns the last element of the list, if it exists.
- *
- * @since 2.0.0
- * @category getters
- */
-const tail = self => self.tail === undefined ? undefined : self.tail.value;
-
-/**
- * Returns the first element of the list, if it exists.
- *
- * @since 2.0.0
- * @category getters
- */
-const head = self => self.head === undefined ? undefined : self.head.value;
-
-/**
- * Executes the specified function `f` for each element in the list.
- *
- * @since 2.0.0
- * @category traversing
- */
-const forEach = /*#__PURE__*/dual(2, (self, f) => {
-  let current = self.head;
-  while (current !== undefined) {
-    f(current.value);
-    current = current.next;
-  }
-});
-
-/**
- * Removes all elements from the doubly-linked list.
- *
- * @since 2.0.0
- */
-const reset = self => {
-  self._length = 0;
-  self.head = undefined;
-  self.tail = undefined;
-  return self;
-};
-
-/**
- * Appends the specified element to the end of the `MutableList`.
- *
- * @category concatenating
- * @since 2.0.0
- */
-const append = /*#__PURE__*/dual(2, (self, value) => {
-  const node = new LinkedListNode(value);
-  if (self.head === undefined) {
-    self.head = node;
-  }
-  if (self.tail === undefined) {
-    self.tail = node;
-  } else {
-    self.tail.next = node;
-    node.prev = self.tail;
-    self.tail = node;
-  }
-  self._length += 1;
-  return self;
-});
-
-/**
- * Removes the first value from the list and returns it, if it exists.
- *
- * @since 0.0.1
- */
-const shift = self => {
-  const head = self.head;
-  if (head !== undefined) {
-    remove(self, head);
-    return head.value;
-  }
-  return undefined;
-};
-
-/**
- * Removes the last value from the list and returns it, if it exists.
- *
- * @since 0.0.1
- */
-const pop = self => {
-  const tail = self.tail;
-  if (tail !== undefined) {
-    remove(self, tail);
-    return tail.value;
-  }
-  return undefined;
-};
-
-/**
- * Prepends the specified value to the beginning of the list.
- *
- * @category concatenating
- * @since 2.0.0
- */
-const prepend = /*#__PURE__*/dual(2, (self, value) => {
-  const node = new LinkedListNode(value);
-  node.next = self.head;
-  if (self.head !== undefined) {
-    self.head.prev = node;
-  }
-  self.head = node;
-  if (self.tail === undefined) {
-    self.tail = node;
-  }
-  self._length += 1;
-  return self;
-});
-const remove = (self, node) => {
-  if (node.removed) {
-    return;
-  }
-  node.removed = true;
-  if (node.prev !== undefined && node.next !== undefined) {
-    node.prev.next = node.next;
-    node.next.prev = node.prev;
-  } else if (node.prev !== undefined) {
-    self.tail = node.prev;
-    node.prev.next = undefined;
-  } else if (node.next !== undefined) {
-    self.head = node.next;
-    node.next.prev = undefined;
-  } else {
-    self.tail = undefined;
-    self.head = undefined;
-  }
-  if (self._length > 0) {
-    self._length -= 1;
-  }
-};
-
-var MutableList = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  empty: empty,
-  fromIterable: fromIterable,
-  make: make,
-  isEmpty: isEmpty,
-  length: length,
-  tail: tail,
-  head: head,
-  forEach: forEach,
-  reset: reset,
-  append: append,
-  shift: shift,
-  pop: pop,
-  prepend: prepend
-});
-
-export { MutableList as M, append as a, forEach as b, prepend as c, empty as e, fromIterable as f, head as h, isEmpty as i, length as l, make as m, pop as p, reset as r, shift as s, tail as t };

package/dist/MutableQueue-446ac662.esm.js

@@ -1,202 +0,0 @@
-import { p as prepend, r as reverse, e as empty$1 } from './Chunk-4c1f4599.esm.js';
-import { d as dual } from './Function-12511160.esm.js';
-import { t as toString, a as toJSON, N as NodeInspectSymbol } from './Inspectable-b0c51e90.esm.js';
-import { l as length$1, i as isEmpty$1, a as append, s as shift, e as empty } from './MutableList-76401868.esm.js';
-import { p as pipeArguments } from './Pipeable-10760a1d.esm.js';
-
-/**
- * @since 2.0.0
- */
-const TypeId = /*#__PURE__*/Symbol.for("effect/MutableQueue");
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-const EmptyMutableQueue = /*#__PURE__*/Symbol.for("effect/mutable/MutableQueue/Empty");
-
-/**
- * @since 2.0.0
- * @category model
- */
-
-/**
- * @since 2.0.0
- */
-
-const MutableQueueProto = {
-  [TypeId]: TypeId,
-  [Symbol.iterator]() {
-    return Array.from(this.queue)[Symbol.iterator]();
-  },
-  toString() {
-    return toString(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "MutableQueue",
-      values: Array.from(this).map(toJSON)
-    };
-  },
-  [NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-};
-const make = capacity => {
-  const queue = Object.create(MutableQueueProto);
-  queue.queue = empty();
-  queue.capacity = capacity;
-  return queue;
-};
-
-/**
- * Creates a new bounded `MutableQueue`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const bounded = capacity => make(capacity);
-
-/**
- * Creates a new unbounded `MutableQueue`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const unbounded = () => make(undefined);
-
-/**
- * Returns the current number of elements in the queue.
- *
- * @since 2.0.0
- * @category getters
- */
-const length = self => length$1(self.queue);
-
-/**
- * Returns `true` if the queue is empty, `false` otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isEmpty = self => isEmpty$1(self.queue);
-
-/**
- * Returns `true` if the queue is full, `false` otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isFull = self => self.capacity === undefined ? false : length$1(self.queue) === self.capacity;
-
-/**
- * The **maximum** number of elements that a queue can hold.
- *
- * **Note**: unbounded queues can still implement this interface with
- * `capacity = Infinity`.
- *
- * @since 2.0.0
- * @category getters
- */
-const capacity = self => self.capacity === undefined ? Infinity : self.capacity;
-
-/**
- * Offers an element to the queue.
- *
- * Returns whether the enqueue was successful or not.
- *
- * @since 2.0.0
- */
-const offer = /*#__PURE__*/dual(2, (self, value) => {
-  const queueLength = length$1(self.queue);
-  if (self.capacity !== undefined && queueLength === self.capacity) {
-    return false;
-  }
-  append(value)(self.queue);
-  return true;
-});
-
-/**
- * Enqueues a collection of values into the queue.
- *
- * Returns a `Chunk` of the values that were **not** able to be enqueued.
- *
- * @since 2.0.0
- */
-const offerAll = /*#__PURE__*/dual(2, (self, values) => {
-  const iterator = values[Symbol.iterator]();
-  let next;
-  let remainder = empty$1();
-  let offering = true;
-  while (offering && (next = iterator.next()) && !next.done) {
-    offering = offer(next.value)(self);
-  }
-  while (next != null && !next.done) {
-    remainder = prepend(next.value)(remainder);
-    next = iterator.next();
-  }
-  return reverse(remainder);
-});
-
-/**
- * Dequeues an element from the queue.
- *
- * Returns either an element from the queue, or the `def` param.
- *
- * **Note**: if there is no meaningful default for your type, you can always
- * use `poll(MutableQueue.EmptyMutableQueue)`.
- *
- * @since 2.0.0
- */
-const poll = /*#__PURE__*/dual(2, (self, def) => {
-  if (isEmpty$1(self.queue)) {
-    return def;
-  }
-  return shift(self.queue);
-});
-
-/**
- * Dequeues up to `n` elements from the queue.
- *
- * Returns a `List` of up to `n` elements.
- *
- * @since 2.0.0
- */
-const pollUpTo = /*#__PURE__*/dual(2, (self, n) => {
-  let result = empty$1();
-  let count = 0;
-  while (count < n) {
-    const element = poll(EmptyMutableQueue)(self);
-    if (element === EmptyMutableQueue) {
-      break;
-    }
-    result = prepend(element)(result);
-    count += 1;
-  }
-  return reverse(result);
-});
-
-var MutableQueue = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  EmptyMutableQueue: EmptyMutableQueue,
-  bounded: bounded,
-  unbounded: unbounded,
-  length: length,
-  isEmpty: isEmpty,
-  isFull: isFull,
-  capacity: capacity,
-  offer: offer,
-  offerAll: offerAll,
-  poll: poll,
-  pollUpTo: pollUpTo
-});
-
-export { EmptyMutableQueue as E, MutableQueue as M, poll as a, offerAll as b, bounded as c, capacity as d, isFull as e, isEmpty as i, length as l, offer as o, pollUpTo as p, unbounded as u };