Skip to content

remove compat dependency #216

remove compat dependency

remove compat dependency #216

Triggered via push October 30, 2023 07:05
Status Success
Total duration 2m 42s
Artifacts

Documenter.yml

on: push
Fit to window
Zoom out
Zoom in

Annotations

10 warnings
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Utilities/Utilities.jl#L34
146 docstrings not included in the manual: Base.eltype :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer DataStructures.DefaultOrderedDict Base.isempty :: Tuple{CircularBuffer} Base.isempty :: Tuple{BinaryHeap} DataStructures.find_root! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T DataStructures.find_root! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T}} where T<:Integer Base.resize! :: Tuple{CircularBuffer, Integer} DataStructures.FasterForward Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K DataStructures.DefaultDict DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.push! :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.push! :: Union{Tuple{IntDisjointSet{T}}, Tuple{T}} where T<:Integer 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! :: Tuple{BinaryHeap, Any} 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.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{BinaryHeap} 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 Base.last :: Tuple{CircularDeque} Base.last :: Tuple{CircularBuffer} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} DataStructures.nsmallest :: Tuple{Accumulator} 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{SwissDict{K, V}, Any, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{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{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} DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.SwissDict DataStructures.extract_all_rev! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT Base.empty! :: Union{Tuple{RobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Union{Tuple{OrderedRobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Tuple{CircularBuffer} Base.empty! :: Union{Tuple{SwissDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.OrderedRobinDict DataStructures.CircularBuffer DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T DataStructures.dec! :: Tuple{Accumulator, Any, Number} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} Base.merge :: Tuple{Accum
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `stable` and linking `stable` to `v0.18.8`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.18` and linking `v0.18` to `v0.18.8`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.17` and linking `v0.17` to `v0.17.20`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.14` and linking `v0.14` to `v0.14.0`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.13` and linking `v0.13` to `v0.13.0`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.12` and linking `v0.12` to `v0.12.0`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.11` and linking `v0.11` to `v0.11.1`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.9` and linking `v0.9` to `v0.9.0`.
Documentation: ../../../.julia/packages/Documenter/bYYzK/src/Documenter.jl#L800
removing `v0.8` and linking `v0.8` to `V0.8.4`.