effect 3.14.3 → 3.14.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (14) hide show
  1. package/dist/cjs/HashSet.js +111 -87
  2. package/dist/cjs/HashSet.js.map +1 -1
  3. package/dist/cjs/internal/version.js +1 -1
  4. package/dist/dts/HashSet.d.ts +149 -106
  5. package/dist/dts/HashSet.d.ts.map +1 -1
  6. package/dist/dts/index.d.ts +40 -40
  7. package/dist/esm/HashSet.js +111 -87
  8. package/dist/esm/HashSet.js.map +1 -1
  9. package/dist/esm/index.js +40 -40
  10. package/dist/esm/internal/version.js +1 -1
  11. package/package.json +1 -1
  12. package/src/HashSet.ts +149 -106
  13. package/src/index.ts +40 -40
  14. package/src/internal/version.ts +1 -1
package/dist/esm/index.js CHANGED
@@ -341,14 +341,14 @@ export * as HashMap from "./HashMap.js";
341
341
  *
342
342
  * ## Performance Characteristics
343
343
  *
344
- * - **Lookup** operations ({@linkcode HashSet.has}): **`O(1)`** average time
344
+ * - **Lookup** operations ({@link module:HashSet.has}): **`O(1)`** average time
345
345
  * complexity
346
- * - **Insertion** operations ({@linkcode HashSet.add}): **`O(1)`** average time
346
+ * - **Insertion** operations ({@link module:HashSet.add}): **`O(1)`** average time
347
347
  * complexity
348
- * - **Removal** operations ({@linkcode HashSet.remove}): **`O(1)`** average time
349
- * complexity
350
- * - **Set** operations ({@linkcode HashSet.union},
351
- * {@linkcode HashSet.intersection}): **`O(n)`** where n is the size of the
348
+ * - **Removal** operations ({@link module:HashSet.remove}): **`O(1)`** average
349
+ * time complexity
350
+ * - **Set** operations ({@link module:HashSet.union},
351
+ * {@link module:HashSet.intersection}): **`O(n)`** where n is the size of the
352
352
  * smaller set
353
353
  * - **Iteration**: **`O(n)`** where n is the size of the set
354
354
  *
@@ -361,40 +361,40 @@ export * as HashMap from "./HashMap.js";
361
361
  *
362
362
  * ## Operations Reference
363
363
  *
364
- * | Category | Operation | Description | Complexity |
365
- * | ------------ | -------------------------------- | ------------------------------------------- | ---------- |
366
- * | constructors | {@linkcode HashSet.empty} | Creates an empty HashSet | O(1) |
367
- * | constructors | {@linkcode HashSet.fromIterable} | Creates a HashSet from an iterable | O(n) |
368
- * | constructors | {@linkcode HashSet.make} | Creates a HashSet from multiple values | O(n) |
369
- * | | | | |
370
- * | elements | {@linkcode HashSet.has} | Checks if a value exists in the set | O(1) avg |
371
- * | elements | {@linkcode HashSet.some} | Checks if any element satisfies a predicate | O(n) |
372
- * | elements | {@linkcode HashSet.every} | Checks if all elements satisfy a predicate | O(n) |
373
- * | elements | {@linkcode HashSet.isSubset} | Checks if a set is a subset of another | O(n) |
374
- * | | | | |
375
- * | getters | {@linkcode HashSet.values} | Gets an iterator of all values | O(1) |
376
- * | getters | {@linkcode HashSet.toValues} | Gets an array of all values | O(n) |
377
- * | getters | {@linkcode HashSet.size} | Gets the number of elements | O(1) |
378
- * | | | | |
379
- * | mutations | {@linkcode HashSet.add} | Adds a value to the set | O(1) avg |
380
- * | mutations | {@linkcode HashSet.remove} | Removes a value from the set | O(1) avg |
381
- * | mutations | {@linkcode HashSet.toggle} | Toggles a value's presence | O(1) avg |
382
- * | | | | |
383
- * | operations | {@linkcode HashSet.difference} | Computes set difference (A - B) | O(n) |
384
- * | operations | {@linkcode HashSet.intersection} | Computes set intersection (A ∩ B) | O(n) |
385
- * | operations | {@linkcode HashSet.union} | Computes set union (A ∪ B) | O(n) |
386
- * | | | | |
387
- * | mapping | {@linkcode HashSet.map} | Transforms each element | O(n) |
388
- * | | | | |
389
- * | sequencing | {@linkcode HashSet.flatMap} | Transforms and flattens elements | O(n) |
390
- * | | | | |
391
- * | traversing | {@linkcode HashSet.forEach} | Applies a function to each element | O(n) |
392
- * | | | | |
393
- * | folding | {@linkcode HashSet.reduce} | Reduces the set to a single value | O(n) |
394
- * | | | | |
395
- * | filtering | {@linkcode HashSet.filter} | Keeps elements that satisfy a predicate | O(n) |
396
- * | | | | |
397
- * | partitioning | {@linkcode HashSet.partition} | Splits into two sets by a predicate | O(n) |
364
+ * | Category | Operation | Description | Complexity |
365
+ * | ------------ | ----------------------------------- | ------------------------------------------- | ---------- |
366
+ * | constructors | {@link module:HashSet.empty} | Creates an empty HashSet | O(1) |
367
+ * | constructors | {@link module:HashSet.fromIterable} | Creates a HashSet from an iterable | O(n) |
368
+ * | constructors | {@link module:HashSet.make} | Creates a HashSet from multiple values | O(n) |
369
+ * | | | | |
370
+ * | elements | {@link module:HashSet.has} | Checks if a value exists in the set | O(1) avg |
371
+ * | elements | {@link module:HashSet.some} | Checks if any element satisfies a predicate | O(n) |
372
+ * | elements | {@link module:HashSet.every} | Checks if all elements satisfy a predicate | O(n) |
373
+ * | elements | {@link module:HashSet.isSubset} | Checks if a set is a subset of another | O(n) |
374
+ * | | | | |
375
+ * | getters | {@link module:HashSet.values} | Gets an iterator of all values | O(1) |
376
+ * | getters | {@link module:HashSet.toValues} | Gets an array of all values | O(n) |
377
+ * | getters | {@link module:HashSet.size} | Gets the number of elements | O(1) |
378
+ * | | | | |
379
+ * | mutations | {@link module:HashSet.add} | Adds a value to the set | O(1) avg |
380
+ * | mutations | {@link module:HashSet.remove} | Removes a value from the set | O(1) avg |
381
+ * | mutations | {@link module:HashSet.toggle} | Toggles a value's presence | O(1) avg |
382
+ * | | | | |
383
+ * | operations | {@link module:HashSet.difference} | Computes set difference (A - B) | O(n) |
384
+ * | operations | {@link module:HashSet.intersection} | Computes set intersection (A ∩ B) | O(n) |
385
+ * | operations | {@link module:HashSet.union} | Computes set union (A ∪ B) | O(n) |
386
+ * | | | | |
387
+ * | mapping | {@link module:HashSet.map} | Transforms each element | O(n) |
388
+ * | | | | |
389
+ * | sequencing | {@link module:HashSet.flatMap} | Transforms and flattens elements | O(n) |
390
+ * | | | | |
391
+ * | traversing | {@link module:HashSet.forEach} | Applies a function to each element | O(n) |
392
+ * | | | | |
393
+ * | folding | {@link module:HashSet.reduce} | Reduces the set to a single value | O(n) |
394
+ * | | | | |
395
+ * | filtering | {@link module:HashSet.filter} | Keeps elements that satisfy a predicate | O(n) |
396
+ * | | | | |
397
+ * | partitioning | {@link module:HashSet.partition} | Splits into two sets by a predicate | O(n) |
398
398
  *
399
399
  * ## Notes
400
400
  *
package/dist/esm/internal/version.js CHANGED
@@ -1,4 +1,4 @@
1
- let moduleVersion = "3.14.3";
1
+ let moduleVersion = "3.14.4";
2
2
  export const getCurrentVersion = () => moduleVersion;
3
3
  export const setCurrentVersion = version => {
4
4
  moduleVersion = version;
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "effect",
3
- "version": "3.14.3",
3
+ "version": "3.14.4",
4
4
  "description": "The missing standard library for TypeScript, for writing production-grade software.",
5
5
  "license": "MIT",
6
6
  "repository": {