| 1 | "effect/SortedSet#add": |
| 2 | replacement: "HashSet.add" |
| 3 | note: "Direct persistent add on the replacement set; sort only when traversing." |
| 4 | "effect/SortedSet#difference": |
| 5 | replacement: "HashSet.difference + HashSet.fromIterable" |
| 6 | note: "Convert the old general iterable argument to HashSet before taking the difference." |
| 7 | "effect/SortedSet#empty": |
| 8 | replacement: "HashSet.empty" |
| 9 | note: "SortedSet was removed; use an immutable HashSet and retain the element Order separately." |
| 10 | "effect/SortedSet#filter": |
| 11 | replacement: "HashSet.filter" |
| 12 | note: "Direct persistent filtering on the replacement set; traversal is unordered until explicitly sorted." |
| 13 | "effect/SortedSet#fromIterable": |
| 14 | replacement: "HashSet.fromIterable" |
| 15 | note: "Use HashSet.fromIterable and retain the element Order separately." |
| 16 | "effect/SortedSet#getEquivalence": |
| 17 | replacement: "Equal.asEquivalence" |
| 18 | note: "HashSet implements Effect equality by set content; use Equal.asEquivalence<HashSet.HashSet<A>>()." |
| 19 | "effect/SortedSet#intersection": |
| 20 | replacement: "HashSet.intersection + HashSet.fromIterable" |
| 21 | note: "Convert the old general iterable argument to HashSet before taking the intersection." |
| 22 | "effect/SortedSet#isSortedSet": |
| 23 | replacement: "HashSet.isHashSet" |
| 24 | note: "Use the replacement model guard; it does not prove that observations were sorted." |
| 25 | "effect/SortedSet#make": |
| 26 | replacement: "HashSet.make" |
| 27 | note: "Remove the outer order-curried constructor and pass values directly to HashSet.make." |
| 28 | "effect/SortedSet#map": |
| 29 | replacement: "HashSet.map" |
| 30 | note: "Remove the output Order argument; retain it externally and sort only when traversing." |
| 31 | "effect/SortedSet#partition": |
| 32 | replacement: "HashSet.filter" |
| 33 | note: "Build [excluded, satisfying] with complementary HashSet.filter calls." |
| 34 | "effect/SortedSet#remove": |
| 35 | replacement: "HashSet.remove" |
| 36 | note: "Direct persistent removal on the replacement set." |
| 37 | "effect/SortedSet#size": |
| 38 | replacement: "HashSet.size" |
| 39 | note: "Direct size query on the replacement immutable set." |
| 40 | "effect/SortedSet#SortedSet": |
| 41 | replacement: "HashSet.HashSet" |
| 42 | note: "Use HashSet as the immutable core model and retain Order externally; ordered iteration requires sorting on observation." |
| 43 | "effect/SortedSet#TypeId": |
| 44 | replacement: "none" |
| 45 | note: "The SortedSet brand was removed and HashSet.TypeId is private; use HashSet.isHashSet when a guard is needed." |
| 46 | "effect/SortedSet#union": |
| 47 | replacement: "HashSet.union + HashSet.fromIterable" |
| 48 | note: "Convert the old general iterable argument to HashSet before taking the union." |
| 49 | "effect/SortedSet#values": |
| 50 | replacement: "Array.sort" |
| 51 | note: "Sort the replacement HashSet with the retained Order and iterate the resulting array." |
| 52 | "effect/SortedSet#every": |
| 53 | replacement: "HashSet.every" |
| 54 | note: "Run the predicate against the replacement HashSet; sort first only if traversal order has observable effects." |
| 55 | "effect/SortedSet#has": |
| 56 | replacement: "HashSet.has" |
| 57 | note: "Use direct membership testing on the replacement HashSet." |
| 58 | "effect/SortedSet#some": |
| 59 | replacement: "HashSet.some" |
| 60 | note: "Run the predicate against the replacement HashSet; sort first only if traversal order has observable effects." |
| 61 | "effect/SortedSet#toggle": |
| 62 | replacement: "HashSet.has + HashSet.add / HashSet.remove" |
| 63 | note: "HashSet has no toggle; branch on membership and add or remove the element." |