1"effect/RedBlackTree#at":
2 replacement: "Array.drop"
3 note: "Represent the removed tree as sorted entries; for a non-negative index, Array.drop(entries, index) traverses forward from that absolute position."
4"effect/RedBlackTree#atReversed":
5 replacement: "Array.take + Array.reverse"
6 note: "For a valid absolute index, reverse Array.take(entries, index + 1) to traverse backward from it."
7"effect/RedBlackTree#Direction":
8 replacement: "none"
9 note: "The tree direction type was removed; use normal array order or Array.reverse."
10"effect/RedBlackTree#empty":
11 replacement: "Array.empty"
12 note: "The module was removed; use an empty Array<readonly [K, V]> and retain the Order separately."
13"effect/RedBlackTree#first":
14 replacement: "Array.head"
15 note: "On a sorted entry array, Array.head returns the same optional minimum entry."
16"effect/RedBlackTree#forEachBetween":
17 replacement: "Array.filter + Array.forEach"
18 note: "Filter sorted entries to min <= key < max with the retained Order, then visit them with Array.forEach."
19"effect/RedBlackTree#forEachGreaterThanEqual":
20 replacement: "Array.filter + Array.forEach"
21 note: "Filter sorted entries to key >= min with the retained Order, then visit them in ascending order."
22"effect/RedBlackTree#forEachLessThan":
23 replacement: "Array.filter + Array.forEach"
24 note: "Filter sorted entries to key < max with the retained Order, then visit them in ascending order."
25"effect/RedBlackTree#fromIterable":
26 replacement: "Array.sortWith"
27 note: "Sort the entry iterable by key and retain the Order separately; this does not preserve logarithmic tree operations."
28"effect/RedBlackTree#getAt":
29 replacement: "Array.get"
30 note: "Array.get on sorted entries preserves the optional index lookup behavior."
31"effect/RedBlackTree#getOrder":
32 replacement: "none"
33 note: "No replacement collection stores an Order; retain and pass the Order explicitly."
34"effect/RedBlackTree#greaterThan":
35 replacement: "Array.filter"
36 note: "Filter sorted entries with the retained Order for key > bound."
37"effect/RedBlackTree#greaterThanEqual":
38 replacement: "Array.filter"
39 note: "Filter sorted entries with the retained Order for key >= bound."
40"effect/RedBlackTree#greaterThanEqualReversed":
41 replacement: "Array.filter + Array.reverse"
42 note: "Filter sorted entries with the retained Order for key >= bound, then reverse for descending traversal."
43"effect/RedBlackTree#greaterThanReversed":
44 replacement: "Array.filter + Array.reverse"
45 note: "Filter sorted entries with the retained Order for key > bound, then reverse for descending traversal."
46"effect/RedBlackTree#has":
47 replacement: "Array.some"
48 note: "Use Array.some on sorted entries with Equal.equals for key membership; this is linear rather than logarithmic."
49"effect/RedBlackTree#insert":
50 replacement: "Array.prepend + Array.sortWith"
51 note: "Prepend the entry and sort by key to preserve newest-first comparator ties; use an external ordered multimap if logarithmic updates matter."
52"effect/RedBlackTree#isRedBlackTree":
53 replacement: "Array.isArray"
54 note: "The brand was removed; Array.isArray only checks the replacement representation and cannot prove its sorted invariant."
55"effect/RedBlackTree#keys":
56 replacement: "Array.map"
57 note: "Map sorted entries to keys and iterate the resulting array."
58"effect/RedBlackTree#keysReversed":
59 replacement: "Array.reverse + Array.map"
60 note: "Reverse sorted entries, map them to keys, and iterate the resulting array."
61"effect/RedBlackTree#last":
62 replacement: "Array.last"
63 note: "On a sorted entry array, Array.last returns the same optional maximum entry."
64"effect/RedBlackTree#lessThan":
65 replacement: "Array.filter"
66 note: "Filter sorted entries with the retained Order for key < bound."
67"effect/RedBlackTree#lessThanEqual":
68 replacement: "Array.filter"
69 note: "Filter sorted entries with the retained Order for key <= bound."
70"effect/RedBlackTree#lessThanEqualReversed":
71 replacement: "Array.filter + Array.reverse"
72 note: "Filter sorted entries with the retained Order for key <= bound, then reverse for descending traversal."
73"effect/RedBlackTree#lessThanReversed":
74 replacement: "Array.filter + Array.reverse"
75 note: "Filter sorted entries with the retained Order for key < bound, then reverse for descending traversal."
76"effect/RedBlackTree#make":
77 replacement: "Array.sortWith"
78 note: "Sort the supplied entries by key and retain the Order separately; this is not a balanced tree."
79"effect/RedBlackTree#RedBlackTree":
80 replacement: "ReadonlyArray<readonly [K, V]>"
81 note: "The core tree was removed; use sorted immutable entries for small collections or an external persistent ordered multimap when complexity or duplicate-key semantics matter."
82"effect/RedBlackTree#RedBlackTree.Direction":
83 replacement: "none"
84 note: "The nested direction type was removed; use normal array order or Array.reverse."
85"effect/RedBlackTree#reduce":
86 replacement: "Array.reduce"
87 note: "Reduce sorted entries in ascending order, adapting the callback to receive [key, value]."
88"effect/RedBlackTree#removeFirst":
89 replacement: "Array.findFirstIndex + Array.remove"
90 note: "Find the first entry whose key is Equal.equals to the target, then remove that index; leave the array unchanged when absent."
91"effect/RedBlackTree#reversed":
92 replacement: "Array.reverse"
93 note: "Reverse the sorted entry array for descending traversal."
94"effect/RedBlackTree#size":
95 replacement: "Array.length"
96 note: "Use Array.length or the .length property on the replacement entry array."
97"effect/RedBlackTree#TypeId":
98 replacement: "none"
99 note: "The RedBlackTree module and brand symbol were removed."
100"effect/RedBlackTree#values":
101 replacement: "Array.map"
102 note: "Map sorted entries to values and iterate the resulting array to preserve key order."
103"effect/RedBlackTree#valuesReversed":
104 replacement: "Array.reverse + Array.map"
105 note: "Reverse sorted entries, map them to values, and iterate to preserve reverse key order."