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

package/HashMap/dist/effect-HashMap.esm.js

@@ -1,18 +1,287 @@
-import '../../dist/HashSet-69824ba8.esm.js';
-export { q as beginMutation, D as compact, e as empty, t as endMutation, C as filter, E as filterMap, F as findFirst, B as flatMap, d as forEach, f as fromIterable, g as get, n as getHash, j as has, o as hasHash, i as isEmpty, l as isHashMap, p as keySet, k as keys, m as make, a as map, h as modify, x as modifyAt, y as modifyHash, w as mutate, r as reduce, c as remove, A as removeMany, s as set, b as size, z as union, u as unsafeGet, v as values } from '../../dist/HashMap-6c230bde.esm.js';
-import '../../dist/Equal-2a99fde3.esm.js';
-import '../../dist/Hash-7910f34f.esm.js';
-import '../../dist/Function-12511160.esm.js';
-import '../../dist/GlobalValue-b5edf230.esm.js';
-import '../../dist/Utils-80c21479.esm.js';
-import '../../dist/Predicate-6b61b95b.esm.js';
-import '../../dist/Inspectable-b0c51e90.esm.js';
-import '../../dist/Stack-765c2298.esm.js';
-import '../../dist/Option-df40d2b9.esm.js';
-import '../../dist/Equivalence-cf2752b1.esm.js';
-import '../../dist/Either-408d23a8.esm.js';
-import '../../dist/Effectable-a292d920.esm.js';
-import '../../dist/Data-dee529b9.esm.js';
-import '../../dist/Pipeable-10760a1d.esm.js';
-import '../../dist/Number-4b836a09.esm.js';
-import '../../dist/Order-a875fe30.esm.js';
+import { isHashMap as isHashMap$1, empty as empty$1, make as make$1, fromIterable as fromIterable$1, isEmpty as isEmpty$1, get as get$1, getHash as getHash$1, unsafeGet as unsafeGet$1, has as has$1, hasHash as hasHash$1, set as set$1, keys as keys$1, values as values$1, size as size$1, beginMutation as beginMutation$1, endMutation as endMutation$1, mutate as mutate$1, modifyAt as modifyAt$1, modifyHash as modifyHash$1, modify as modify$1, union as union$1, remove as remove$1, removeMany as removeMany$1, map as map$1, flatMap as flatMap$1, forEach as forEach$1, reduce as reduce$1, filter as filter$1, compact as compact$1, filterMap as filterMap$1, findFirst as findFirst$1 } from '../../internal/HashMap.esm.js';
+import { keySet as keySet$1 } from '../../internal/HashMap/keySet.esm.js';
+
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
+
+/**
+ * @since 2.0.0
+ * @category models
+ */
+
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isHashMap = isHashMap$1;
+
+/**
+ * Creates a new `HashMap`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = empty$1;
+
+/**
+ * Constructs a new `HashMap` from an array of key/value pairs.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = make$1;
+
+/**
+ * Constructs a new `HashMap` from an iterable of key/value pairs.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = fromIterable$1;
+
+/**
+ * Checks if the `HashMap` contains any entries.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const isEmpty = isEmpty$1;
+
+/**
+ * Safely lookup the value for the specified key in the `HashMap` using the
+ * internal hashing function.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const get = get$1;
+
+/**
+ * Lookup the value for the specified key in the `HashMap` using a custom hash.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const getHash = getHash$1;
+
+/**
+ * Unsafely lookup the value for the specified key in the `HashMap` using the
+ * internal hashing function.
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+const unsafeGet = unsafeGet$1;
+
+/**
+ * Checks if the specified key has an entry in the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const has = has$1;
+
+/**
+ * Checks if the specified key has an entry in the `HashMap` using a custom
+ * hash.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const hasHash = hasHash$1;
+
+/**
+ * Sets the specified key to the specified value using the internal hashing
+ * function.
+ *
+ * @since 2.0.0
+ */
+const set = set$1;
+
+/**
+ * Returns an `IterableIterator` of the keys within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const keys = keys$1;
+
+/**
+ * Returns a `HashSet` of keys within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getter
+ */
+const keySet = keySet$1;
+
+/**
+ * Returns an `IterableIterator` of the values within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const values = values$1;
+
+/**
+ * Returns the number of entries within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const size = size$1;
+
+/**
+ * Marks the `HashMap` as mutable.
+ *
+ * @since 2.0.0
+ */
+const beginMutation = beginMutation$1;
+
+/**
+ * Marks the `HashMap` as immutable.
+ *
+ * @since 2.0.0
+ */
+const endMutation = endMutation$1;
+
+/**
+ * Mutates the `HashMap` within the context of the provided function.
+ *
+ * @since 2.0.0
+ */
+const mutate = mutate$1;
+
+/**
+ * Set or remove the specified key in the `HashMap` using the specified
+ * update function. The value of the specified key will be computed using the
+ * provided hash.
+ *
+ * The update function will be invoked with the current value of the key if it
+ * exists, or `None` if no such value exists.
+ *
+ * @since 2.0.0
+ */
+const modifyAt = modifyAt$1;
+
+/**
+ * Alter the value of the specified key in the `HashMap` using the specified
+ * update function. The value of the specified key will be computed using the
+ * provided hash.
+ *
+ * The update function will be invoked with the current value of the key if it
+ * exists, or `None` if no such value exists.
+ *
+ * This function will always either update or insert a value into the `HashMap`.
+ *
+ * @since 2.0.0
+ */
+const modifyHash = modifyHash$1;
+
+/**
+ * Updates the value of the specified key within the `HashMap` if it exists.
+ *
+ * @since 2.0.0
+ */
+const modify = modify$1;
+
+/**
+ * Performs a union of this `HashMap` and that `HashMap`.
+ *
+ * @since 2.0.0
+ */
+const union = union$1;
+
+/**
+ * Remove the entry for the specified key in the `HashMap` using the internal
+ * hashing function.
+ *
+ * @since 2.0.0
+ */
+const remove = remove$1;
+
+/**
+ * Removes all entries in the `HashMap` which have the specified keys.
+ *
+ * @since 2.0.0
+ */
+const removeMany = removeMany$1;
+
+/**
+ * Maps over the entries of the `HashMap` using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = map$1;
+
+/**
+ * Chains over the entries of the `HashMap` using the specified function.
+ *
+ * **NOTE**: the hash and equal of both maps have to be the same.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = flatMap$1;
+
+/**
+ * Applies the specified function to the entries of the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = forEach$1;
+
+/**
+ * Reduces the specified state over the entries of the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const reduce = reduce$1;
+
+/**
+ * Filters entries out of a `HashMap` using the specified predicate.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = filter$1;
+
+/**
+ * Filters out `None` values from a `HashMap` of `Options`s.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const compact = compact$1;
+
+/**
+ * Maps over the entries of the `HashMap` using the specified partial function
+ * and filters out `None` values.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filterMap = filterMap$1;
+
+/**
+ * Returns the first element that satisfies the specified
+ * predicate, or `None` if no such element exists.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findFirst = findFirst$1;
+
+export { beginMutation, compact, empty, endMutation, filter, filterMap, findFirst, flatMap, forEach, fromIterable, get, getHash, has, hasHash, isEmpty, isHashMap, keySet, keys, make, map, modify, modifyAt, modifyHash, mutate, reduce, remove, removeMany, set, size, union, unsafeGet, values };

package/HashSet/dist/effect-HashSet.esm.js

@@ -1,18 +1,227 @@
-import '../../dist/HashSet-69824ba8.esm.js';
-export { a as add, o as beginMutation, d as difference, e as empty, p as endMutation, g as every, x as filter, f as flatMap, k as forEach, c as fromIterable, h as has, t as intersection, i as isHashSet, n as isSubset, m as make, b as map, q as mutate, y as partition, r as reduce, j as remove, s as size, l as some, w as toggle, u as union, v as values } from '../../dist/HashSet-ae2856c1.esm.js';
-import '../../dist/Equal-2a99fde3.esm.js';
-import '../../dist/Hash-7910f34f.esm.js';
-import '../../dist/Function-12511160.esm.js';
-import '../../dist/GlobalValue-b5edf230.esm.js';
-import '../../dist/Utils-80c21479.esm.js';
-import '../../dist/Predicate-6b61b95b.esm.js';
-import '../../dist/Inspectable-b0c51e90.esm.js';
-import '../../dist/Stack-765c2298.esm.js';
-import '../../dist/Option-df40d2b9.esm.js';
-import '../../dist/Equivalence-cf2752b1.esm.js';
-import '../../dist/Either-408d23a8.esm.js';
-import '../../dist/Effectable-a292d920.esm.js';
-import '../../dist/Data-dee529b9.esm.js';
-import '../../dist/Pipeable-10760a1d.esm.js';
-import '../../dist/Number-4b836a09.esm.js';
-import '../../dist/Order-a875fe30.esm.js';
+import { isHashSet as isHashSet$1, empty as empty$1, fromIterable as fromIterable$1, make as make$1, has as has$1, some as some$1, every as every$1, isSubset as isSubset$1, values as values$1, size as size$1, beginMutation as beginMutation$1, endMutation as endMutation$1, mutate as mutate$1, add as add$1, remove as remove$1, difference as difference$1, intersection as intersection$1, union as union$1, toggle as toggle$1, map as map$1, flatMap as flatMap$1, forEach as forEach$1, reduce as reduce$1, filter as filter$1, partition as partition$1 } from '../../internal/HashSet.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;
+
+export { add, beginMutation, difference, empty, endMutation, every, filter, flatMap, forEach, fromIterable, has, intersection, isHashSet, isSubset, make, map, mutate, partition, reduce, remove, size, some, toggle, union, values };

package/Hub/dist/effect-Hub.cjs.dev.js

@@ -2,7 +2,7 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-var Hub_dist_effectHub = require('../../dist/Hub-af0194fd.cjs.dev.js');
+var Hub_dist_effectHub = require('../../dist/Hub-74834668.cjs.dev.js');
 require('../../dist/Chunk-bd290b8e.cjs.dev.js');
 require('../../dist/Equal-281b6ca8.cjs.dev.js');
 require('../../dist/Hash-bd154268.cjs.dev.js');
@@ -36,7 +36,7 @@ require('../../dist/MutableRef-724c4082.cjs.dev.js');
 require('../../dist/List-c6ea7efe.cjs.dev.js');
 require('../../dist/RuntimeFlagsPatch-130e990c.cjs.dev.js');
 require('../../dist/ExecutionStrategy-89fbe735.cjs.dev.js');
-require('../../dist/fiberRuntime-ac7fae54.cjs.dev.js');
+require('../../dist/fiberRuntime-e9680313.cjs.dev.js');
 require('../../dist/Boolean-f0bc3abf.cjs.dev.js');
 require('../../dist/Deferred-5d5c886c.cjs.dev.js');
 require('../../dist/FiberRefs-43bfd8b9.cjs.dev.js');
@@ -44,8 +44,8 @@ require('../../dist/fiberRefs-a7e00f7e.cjs.dev.js');
 require('../../dist/FiberRefsPatch-5236f61e.cjs.dev.js');
 require('../../dist/patch-4671ab7f.cjs.dev.js');
 require('../../dist/FiberStatus-bac7d58d.cjs.dev.js');
-require('../../dist/defaultServices-e9a9b935.cjs.dev.js');
-require('../../dist/Duration-5ac57eb4.cjs.dev.js');
+require('../../dist/defaultServices-60c753dc.cjs.dev.js');
+require('../../dist/Duration-604874d1.cjs.dev.js');
 require('../../dist/timeout-0245c158.cjs.dev.js');
 require('../../dist/configProvider-e2eb112d.cjs.dev.js');
 require('../../dist/config-10f2a1d1.cjs.dev.js');
@@ -53,27 +53,27 @@ require('../../dist/ConfigError-c1f762d2.cjs.dev.js');
 require('../../dist/configError-1686533e.cjs.dev.js');
 require('../../dist/configSecret-5812fa69.cjs.dev.js');
 require('../../dist/pathPatch-e46d4168.cjs.dev.js');
-require('../../dist/core-effect-780f9db7.cjs.dev.js');
-require('../../dist/Clock-80bf3b4b.cjs.dev.js');
+require('../../dist/core-effect-a9b8ee08.cjs.dev.js');
+require('../../dist/Clock-bec722c1.cjs.dev.js');
 require('../../dist/label-246fb11d.cjs.dev.js');
 require('../../dist/LogLevel-99f64f82.cjs.dev.js');
 require('../../dist/LogSpan-e345ba58.cjs.dev.js');
 require('../../dist/Ref-af783b72.cjs.dev.js');
-require('../../dist/Tracer-435e56fd.cjs.dev.js');
-require('../../dist/fiber-1132297b.cjs.dev.js');
+require('../../dist/Tracer-da182c8c.cjs.dev.js');
+require('../../dist/fiber-da1a207c.cjs.dev.js');
 require('../../dist/Exit-a23874e1.cjs.dev.js');
 require('../../dist/boundaries-03c7494a.cjs.dev.js');
-require('../../dist/key-6ac569ca.cjs.dev.js');
-require('../../dist/keyType-c1e7cfc5.cjs.dev.js');
-require('../../dist/registry-9e9ae2c7.cjs.dev.js');
-require('../../dist/hook-9e86d119.cjs.dev.js');
+require('../../dist/key-a474fc0d.cjs.dev.js');
+require('../../dist/keyType-1e916ae2.cjs.dev.js');
+require('../../dist/registry-c883cf52.cjs.dev.js');
+require('../../dist/hook-822704ea.cjs.dev.js');
 require('../../dist/state-8a8a647c.cjs.dev.js');
 require('../../dist/pair-08a8685e.cjs.dev.js');
 require('../../dist/MutableHashMap-74e83e84.cjs.dev.js');
 require('../../dist/SortedSet-f90b14a2.cjs.dev.js');
 require('../../dist/RedBlackTree-e6bd147c.cjs.dev.js');
 require('../../dist/Scheduler-d080442d.cjs.dev.js');
-require('../../dist/queue-0dbc2b3f.cjs.dev.js');
+require('../../dist/queue-04ae7ec7.cjs.dev.js');
 require('../../dist/MutableQueue-0e9f2466.cjs.dev.js');
 require('../../dist/MutableList-58124ef2.cjs.dev.js');
 

package/Hub/dist/effect-Hub.cjs.prod.js

@@ -2,7 +2,7 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-var Hub_dist_effectHub = require('../../dist/Hub-926961e9.cjs.prod.js');
+var Hub_dist_effectHub = require('../../dist/Hub-6e64debd.cjs.prod.js');
 require('../../dist/Chunk-6cf5a8e6.cjs.prod.js');
 require('../../dist/Equal-ce9977a8.cjs.prod.js');
 require('../../dist/Hash-1bd73210.cjs.prod.js');
@@ -36,7 +36,7 @@ require('../../dist/MutableRef-4a2f1f23.cjs.prod.js');
 require('../../dist/List-d9775087.cjs.prod.js');
 require('../../dist/RuntimeFlagsPatch-5570758d.cjs.prod.js');
 require('../../dist/ExecutionStrategy-dc778180.cjs.prod.js');
-require('../../dist/fiberRuntime-9d6d53be.cjs.prod.js');
+require('../../dist/fiberRuntime-1c369a47.cjs.prod.js');
 require('../../dist/Boolean-97839b78.cjs.prod.js');
 require('../../dist/Deferred-9d825b3b.cjs.prod.js');
 require('../../dist/FiberRefs-4cb171f7.cjs.prod.js');
@@ -44,8 +44,8 @@ require('../../dist/fiberRefs-64c35250.cjs.prod.js');
 require('../../dist/FiberRefsPatch-cb847553.cjs.prod.js');
 require('../../dist/patch-f27e9f08.cjs.prod.js');
 require('../../dist/FiberStatus-b82dad24.cjs.prod.js');
-require('../../dist/defaultServices-452aebad.cjs.prod.js');
-require('../../dist/Duration-011e7325.cjs.prod.js');
+require('../../dist/defaultServices-4112c0c9.cjs.prod.js');
+require('../../dist/Duration-0bc08d03.cjs.prod.js');
 require('../../dist/timeout-2a62e4b5.cjs.prod.js');
 require('../../dist/configProvider-2b177eac.cjs.prod.js');
 require('../../dist/config-78feb1ac.cjs.prod.js');
@@ -53,27 +53,27 @@ require('../../dist/ConfigError-cee682fa.cjs.prod.js');
 require('../../dist/configError-6a3652f8.cjs.prod.js');
 require('../../dist/configSecret-ecb6c5b3.cjs.prod.js');
 require('../../dist/pathPatch-ded405f6.cjs.prod.js');
-require('../../dist/core-effect-023f4abe.cjs.prod.js');
-require('../../dist/Clock-0b777b1b.cjs.prod.js');
+require('../../dist/core-effect-bf806dd9.cjs.prod.js');
+require('../../dist/Clock-09ecce0a.cjs.prod.js');
 require('../../dist/label-3e143765.cjs.prod.js');
 require('../../dist/LogLevel-e9848e15.cjs.prod.js');
 require('../../dist/LogSpan-c905a192.cjs.prod.js');
 require('../../dist/Ref-30e5ee58.cjs.prod.js');
-require('../../dist/Tracer-3cd1e3bc.cjs.prod.js');
-require('../../dist/fiber-2975db3a.cjs.prod.js');
+require('../../dist/Tracer-d06d0b61.cjs.prod.js');
+require('../../dist/fiber-90ffaf8c.cjs.prod.js');
 require('../../dist/Exit-5691142c.cjs.prod.js');
 require('../../dist/boundaries-5d1a46e1.cjs.prod.js');
-require('../../dist/key-a79acfe7.cjs.prod.js');
-require('../../dist/keyType-681c1c4a.cjs.prod.js');
-require('../../dist/registry-92c00ecd.cjs.prod.js');
-require('../../dist/hook-0bf192b2.cjs.prod.js');
+require('../../dist/key-330b98b1.cjs.prod.js');
+require('../../dist/keyType-8460e792.cjs.prod.js');
+require('../../dist/registry-29905dcc.cjs.prod.js');
+require('../../dist/hook-6c7550dc.cjs.prod.js');
 require('../../dist/state-0d29362f.cjs.prod.js');
 require('../../dist/pair-e5443c93.cjs.prod.js');
 require('../../dist/MutableHashMap-95493edb.cjs.prod.js');
 require('../../dist/SortedSet-424670fe.cjs.prod.js');
 require('../../dist/RedBlackTree-eb41ea8a.cjs.prod.js');
 require('../../dist/Scheduler-819ee02a.cjs.prod.js');
-require('../../dist/queue-f70dda1a.cjs.prod.js');
+require('../../dist/queue-b81aee38.cjs.prod.js');
 require('../../dist/MutableQueue-f8aba856.cjs.prod.js');
 require('../../dist/MutableList-732af09a.cjs.prod.js');