disallow mutation of BinaryHeap fields - #995

doctest failure in src/robin_dict.jl:550-559 ```jldoctest julia> d = RobinDict("a"=>1, "b"=>2) RobinDict{String, Int64} with 2 entries: "b" => 2 "a" => 1 julia> delete!(d, "b") RobinDict{String, Int64} with 1 entry: "a" => 1 ``` Subexpression: d = RobinDict("a"=>1, "b"=>2) Evaluated output: RobinDict{String, Int64} with 2 entries: "a" => 1 "b" => 2 Expected output: RobinDict{String, Int64} with 2 entries: "b" => 2 "a" => 1 diff = Warning: Diff output requires color. RobinDict{String, Int64} with 2 entries: "b" => 2 "a" => 11 "b" => 2

doctest failure in src/robin_dict.jl:312-327 ```jldoctest julia> d = RobinDict("a"=>1, "b"=>2, "c"=>3); julia> get!(d, "a", 5) 1 julia> get!(d, "d", 4) 4 julia> d RobinDict{String, Int64} with 4 entries: "c" => 3 "b" => 2 "a" => 1 "d" => 4 ``` Subexpression: d Evaluated output: RobinDict{String, Int64} with 4 entries: "d" => 4 "a" => 1 "b" => 2 "c" => 3 Expected output: RobinDict{String, Int64} with 4 entries: "c" => 3 "b" => 2 "a" => 1 "d" => 4 diff = Warning: Diff output requires color. RobinDict{String, Int64} with 4 entries: "c" => 3 "b" "d" => 2 4 "a" => 1 "d" "b" => 42 "c" => 3

doctest failure in src/robin_dict.jl:440-451 ```jldoctest julia> D = RobinDict('a'=>2, 'b'=>3) RobinDict{Char, Int64} with 2 entries: 'a' => 2 'b' => 3 julia> getkey(D, 'a', 1) 'a': ASCII/Unicode U+0061 (category Ll: Letter, lowercase) julia> getkey(D, 'd', 'a') 'a': ASCII/Unicode U+0061 (category Ll: Letter, lowercase) ``` Subexpression: D = RobinDict('a'=>2, 'b'=>3) Evaluated output: RobinDict{Char, Int64} with 2 entries: 'b' => 3 'a' => 2 Expected output: RobinDict{Char, Int64} with 2 entries: 'a' => 2 'b' => 3 diff = Warning: Diff output requires color. RobinDict{Char, Int64} with 2 entries: 'a' => 2 'b' => 33 'a' => 2

doctest failure in src/robin_dict.jl:418-429 ```jldoctest julia> D = RobinDict('a'=>2, 'b'=>3) RobinDict{Char, Int64} with 2 entries: 'a' => 2 'b' => 3 julia> haskey(D, 'a') true julia> haskey(D, 'c') false ``` Subexpression: D = RobinDict('a'=>2, 'b'=>3) Evaluated output: RobinDict{Char, Int64} with 2 entries: 'b' => 3 'a' => 2 Expected output: RobinDict{Char, Int64} with 2 entries: 'a' => 2 'b' => 3 diff = Warning: Diff output requires color. RobinDict{Char, Int64} with 2 entries: 'a' => 2 'b' => 33 'a' => 2

doctest failure in src/robin_dict.jl:261-272 ```jldoctest julia> A = RobinDict("a" => 1, "b" => 2) RobinDict{String, Int64} with 2 entries: "b" => 2 "a" => 1 julia> empty!(A); julia> A RobinDict{String, Int64}() ``` Subexpression: A = RobinDict("a" => 1, "b" => 2) Evaluated output: RobinDict{String, Int64} with 2 entries: "a" => 1 "b" => 2 Expected output: RobinDict{String, Int64} with 2 entries: "b" => 2 "a" => 1 diff = Warning: Diff output requires color. RobinDict{String, Int64} with 2 entries: "b" => 2 "a" => 11 "b" => 2

doctest failure in docs/src/trie.md:10-35 ```jldoctest julia> t = Trie{Char,Int}(); julia> t["Rob"] = 42; julia> t["Roger"] = 24; julia> haskey(t, "Rob") true julia> get(t, "Rob", nothing) 42 julia> keys(t) 2-element Vector{String}: "Roger" "Rob" julia> keys(subtrie(t, "Ro")) 2-element Vector{String}: "ger" "b" ``` Subexpression: keys(subtrie(t, "Ro")) Evaluated output: 2-element Vector{String}: "b" "ger" Expected output: 2-element Vector{String}: "ger" "b" diff = Warning: Diff output requires color. 2-element Vector{String}: "ger" "b""b" "ger"

doctest failure in docs/src/trie.md:10-35 ```jldoctest julia> t = Trie{Char,Int}(); julia> t["Rob"] = 42; julia> t["Roger"] = 24; julia> haskey(t, "Rob") true julia> get(t, "Rob", nothing) 42 julia> keys(t) 2-element Vector{String}: "Roger" "Rob" julia> keys(subtrie(t, "Ro")) 2-element Vector{String}: "ger" "b" ``` Subexpression: keys(t) Evaluated output: 2-element Vector{String}: "Rob" "Roger" Expected output: 2-element Vector{String}: "Roger" "Rob" diff = Warning: Diff output requires color. 2-element Vector{String}: "Roger" "Rob""Rob" "Roger"

doctest failure in docs/src/robin_dict.md:14-40 ```jldoctest julia> d = RobinDict{Int, Char}(1 => 'a', 2 => 'b') RobinDict{Int64, Char} with 2 entries: 2 => 'b' 1 => 'a' julia> d[3] = 'c'; julia> collect(d) 3-element Vector{Pair{Int64, Char}}: 2 => 'b' 3 => 'c' 1 => 'a' julia> delete!(d, 2); julia> d[1] 'a': ASCII/Unicode U+0061 (category Ll: Letter, lowercase) julia> d RobinDict{Int64, Char} with 2 entries: 3 => 'c' 1 => 'a' julia> pop!(d) 3 => 'c' ``` Subexpression: collect(d) Evaluated output: 3-element Vector{Pair{Int64, Char}}: 3 => 'c' 2 => 'b' 1 => 'a' Expected output: 3-element Vector{Pair{Int64, Char}}: 2 => 'b' 3 => 'c' 1 => 'a' diff = Warning: Diff output requires color. 3-element Vector{Pair{Int64, Char}}: 2 => 'b' 3 => 'c' 2 => 'b' 1 => 'a'

Node.js 20 is deprecated. The following actions target Node.js 20 but are being forced to run on Node.js 24: julia-actions/setup-julia@v2. For more information see: https://github.blog/changelog/2025-09-19-deprecation-of-node-20-on-github-actions-runners/

Generated HTML over size_threshold_warn limit: sorted_containers.md Generated file size: 117.98 (KiB) size_threshold_warn: 100.0 (KiB) size_threshold: 200.0 (KiB) HTML file: sorted_containers/index.html

132 docstrings not included in the manual: Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{Union{Function, Type}, RobinDict{K, V}, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{OrderedRobinDict{K, V}, Any, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{Union{Function, Type}, OrderedRobinDict{K, V}, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{SwissDict{K, V}, Any, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{Union{Function, Type}, SwissDict{K, V}, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{CircularDeque} DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.counter :: Tuple{Any} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.nlargest :: Tuple{Accumulator} Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.pop! :: Tuple{BinaryHeap} Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.delete! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any}} where {K, V} Base.delete! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.delete! :: Tuple{OrderedRobinDict, Any} Base.delete! :: Tuple{SwissDict, Any} Base.delete! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64}} where T DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T DataStructures.Accumulator DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{DataStructures.DefaultDictBase, Any} Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.root_union! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer DataStructures.root_union! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.FasterReverse DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T Base.in :: Union{Tuple{T}, Tuple{K}, Tuple{Any, Base.KeySet{K, T}}} where {K, T<:(DefaultDict{K})} Base.in :: Union{Tuple{T}, Tuple{K}, Tuple{Any, Base.KeySet{K, T}}} where {K, T<:(DefaultOrderedDict{K})} Base.popfirst! :: Tuple{CircularBuffer} Base.popfirst! :: Tuple{CircularDeque} DataStructures.IntDisjointSet Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.extract_all_rev! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T Base.insert! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K DataStructures.search_node :: Tuple{Any, Any} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} Base.push! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{T}, Tuple{CircularBuffer{T}, Any}} where T Base.push! :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base