146 docstrings not included in the manual: DataStructures.DefaultOrderedDict DataStructures.capacity :: Tuple{CircularDeque} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.find_root! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T}} where T<:Integer DataStructures.find_root! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T DataStructures.is_minmax_heap :: Tuple{AbstractVector} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} Base.empty! :: Union{Tuple{RobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Tuple{CircularBuffer} Base.empty! :: Union{Tuple{OrderedRobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Union{Tuple{SwissDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} DataStructures.search_node :: Tuple{Any, Any} DataStructures.FenwickTree :: Union{Tuple{Integer}, Tuple{T}} where T DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U DataStructures.DisjointSet Base.empty :: Union{Tuple{SortedDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} Base.empty :: Union{Tuple{SortedSet{K, Ord}}, Tuple{U}, Tuple{Ord}, Tuple{K}, Tuple{SortedSet{K, Ord}, Type{U}}} where {K, Ord<:Base.Order.Ordering, U} Base.empty :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V DataStructures.FasterReverse DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} Base.pop! :: Tuple{BinaryHeap} Base.pop! :: Tuple{CircularBuffer} Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} Base.isequal :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, SortedDict{K, D, Ord}}} where {K, D, Ord<:Base.Order.Ordering} Base.isequal :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, SortedMultiDict{K, D, Ord}}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.FasterForward Base.delete! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.delete! :: Tuple{SwissDict, Any} Base.delete! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any}} where {K, V} Base.delete! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64}} where T Base.delete! :: Tuple{OrderedRobinDict, Any} DataStructures.isfull :: Tuple{CircularBuffer} DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.dec! :: Tuple{Accumulator, Any, Number} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.RobinDict Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} Base.insert! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K 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! :: Tuple{Function, Any, Any} 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{SwissDict{K, V}, Any, Any}} where {K, V} Base.get! :: Tuple{Any, Any, Any}

removing `stable` and linking `stable` to `v0.18.8`.

removing `v0.18` and linking `v0.18` to `v0.18.8`.

removing `v0.17` and linking `v0.17` to `v0.17.20`.

removing `v0.14` and linking `v0.14` to `v0.14.0`.

removing `v0.13` and linking `v0.13` to `v0.13.0`.

removing `v0.12` and linking `v0.12` to `v0.12.0`.

removing `v0.11` and linking `v0.11` to `v0.11.1`.

removing `v0.9` and linking `v0.9` to `v0.9.0`.