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/src/index.ts CHANGED
@@ -393,14 +393,14 @@ export * as HashMap from "./HashMap.js"
393
393
  *
394
394
  * ## Performance Characteristics
395
395
  *
396
- * - **Lookup** operations ({@linkcode HashSet.has}): **`O(1)`** average time
396
+ * - **Lookup** operations ({@link module:HashSet.has}): **`O(1)`** average time
397
397
  * complexity
398
- * - **Insertion** operations ({@linkcode HashSet.add}): **`O(1)`** average time
398
+ * - **Insertion** operations ({@link module:HashSet.add}): **`O(1)`** average time
399
399
  * complexity
400
- * - **Removal** operations ({@linkcode HashSet.remove}): **`O(1)`** average time
401
- * complexity
402
- * - **Set** operations ({@linkcode HashSet.union},
403
- * {@linkcode HashSet.intersection}): **`O(n)`** where n is the size of the
400
+ * - **Removal** operations ({@link module:HashSet.remove}): **`O(1)`** average
401
+ * time complexity
402
+ * - **Set** operations ({@link module:HashSet.union},
403
+ * {@link module:HashSet.intersection}): **`O(n)`** where n is the size of the
404
404
  * smaller set
405
405
  * - **Iteration**: **`O(n)`** where n is the size of the set
406
406
  *
@@ -413,40 +413,40 @@ export * as HashMap from "./HashMap.js"
413
413
  *
414
414
  * ## Operations Reference
415
415
  *
416
- * | Category | Operation | Description | Complexity |
417
- * | ------------ | -------------------------------- | ------------------------------------------- | ---------- |
418
- * | constructors | {@linkcode HashSet.empty} | Creates an empty HashSet | O(1) |
419
- * | constructors | {@linkcode HashSet.fromIterable} | Creates a HashSet from an iterable | O(n) |
420
- * | constructors | {@linkcode HashSet.make} | Creates a HashSet from multiple values | O(n) |
421
- * | | | | |
422
- * | elements | {@linkcode HashSet.has} | Checks if a value exists in the set | O(1) avg |
423
- * | elements | {@linkcode HashSet.some} | Checks if any element satisfies a predicate | O(n) |
424
- * | elements | {@linkcode HashSet.every} | Checks if all elements satisfy a predicate | O(n) |
425
- * | elements | {@linkcode HashSet.isSubset} | Checks if a set is a subset of another | O(n) |
426
- * | | | | |
427
- * | getters | {@linkcode HashSet.values} | Gets an iterator of all values | O(1) |
428
- * | getters | {@linkcode HashSet.toValues} | Gets an array of all values | O(n) |
429
- * | getters | {@linkcode HashSet.size} | Gets the number of elements | O(1) |
430
- * | | | | |
431
- * | mutations | {@linkcode HashSet.add} | Adds a value to the set | O(1) avg |
432
- * | mutations | {@linkcode HashSet.remove} | Removes a value from the set | O(1) avg |
433
- * | mutations | {@linkcode HashSet.toggle} | Toggles a value's presence | O(1) avg |
434
- * | | | | |
435
- * | operations | {@linkcode HashSet.difference} | Computes set difference (A - B) | O(n) |
436
- * | operations | {@linkcode HashSet.intersection} | Computes set intersection (A ∩ B) | O(n) |
437
- * | operations | {@linkcode HashSet.union} | Computes set union (A ∪ B) | O(n) |
438
- * | | | | |
439
- * | mapping | {@linkcode HashSet.map} | Transforms each element | O(n) |
440
- * | | | | |
441
- * | sequencing | {@linkcode HashSet.flatMap} | Transforms and flattens elements | O(n) |
442
- * | | | | |
443
- * | traversing | {@linkcode HashSet.forEach} | Applies a function to each element | O(n) |
444
- * | | | | |
445
- * | folding | {@linkcode HashSet.reduce} | Reduces the set to a single value | O(n) |
446
- * | | | | |
447
- * | filtering | {@linkcode HashSet.filter} | Keeps elements that satisfy a predicate | O(n) |
448
- * | | | | |
449
- * | partitioning | {@linkcode HashSet.partition} | Splits into two sets by a predicate | O(n) |
416
+ * | Category | Operation | Description | Complexity |
417
+ * | ------------ | ----------------------------------- | ------------------------------------------- | ---------- |
418
+ * | constructors | {@link module:HashSet.empty} | Creates an empty HashSet | O(1) |
419
+ * | constructors | {@link module:HashSet.fromIterable} | Creates a HashSet from an iterable | O(n) |
420
+ * | constructors | {@link module:HashSet.make} | Creates a HashSet from multiple values | O(n) |
421
+ * | | | | |
422
+ * | elements | {@link module:HashSet.has} | Checks if a value exists in the set | O(1) avg |
423
+ * | elements | {@link module:HashSet.some} | Checks if any element satisfies a predicate | O(n) |
424
+ * | elements | {@link module:HashSet.every} | Checks if all elements satisfy a predicate | O(n) |
425
+ * | elements | {@link module:HashSet.isSubset} | Checks if a set is a subset of another | O(n) |
426
+ * | | | | |
427
+ * | getters | {@link module:HashSet.values} | Gets an iterator of all values | O(1) |
428
+ * | getters | {@link module:HashSet.toValues} | Gets an array of all values | O(n) |
429
+ * | getters | {@link module:HashSet.size} | Gets the number of elements | O(1) |
430
+ * | | | | |
431
+ * | mutations | {@link module:HashSet.add} | Adds a value to the set | O(1) avg |
432
+ * | mutations | {@link module:HashSet.remove} | Removes a value from the set | O(1) avg |
433
+ * | mutations | {@link module:HashSet.toggle} | Toggles a value's presence | O(1) avg |
434
+ * | | | | |
435
+ * | operations | {@link module:HashSet.difference} | Computes set difference (A - B) | O(n) |
436
+ * | operations | {@link module:HashSet.intersection} | Computes set intersection (A ∩ B) | O(n) |
437
+ * | operations | {@link module:HashSet.union} | Computes set union (A ∪ B) | O(n) |
438
+ * | | | | |
439
+ * | mapping | {@link module:HashSet.map} | Transforms each element | O(n) |
440
+ * | | | | |
441
+ * | sequencing | {@link module:HashSet.flatMap} | Transforms and flattens elements | O(n) |
442
+ * | | | | |
443
+ * | traversing | {@link module:HashSet.forEach} | Applies a function to each element | O(n) |
444
+ * | | | | |
445
+ * | folding | {@link module:HashSet.reduce} | Reduces the set to a single value | O(n) |
446
+ * | | | | |
447
+ * | filtering | {@link module:HashSet.filter} | Keeps elements that satisfy a predicate | O(n) |
448
+ * | | | | |
449
+ * | partitioning | {@link module:HashSet.partition} | Splits into two sets by a predicate | O(n) |
450
450
  *
451
451
  * ## Notes
452
452
  *
package/src/internal/version.ts CHANGED
@@ -1,4 +1,4 @@
1
- let moduleVersion = "3.14.3"
1
+ let moduleVersion = "3.14.4"
2
2
 
3
3
  export const getCurrentVersion = () => moduleVersion
4
4