132 docstrings not included in the manual: DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.in_same_set :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer DataStructures.in_same_set :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T Base.merge! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, Vararg{Any}}} where {K, D, Ord<:Base.Order.Ordering} Base.merge! :: Tuple{Accumulator, Accumulator} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Tuple{OrderedRobinDict, Any} DataStructures.IntDisjointSet Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.SwissDict DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.FasterReverse Base.append! :: Tuple{CircularBuffer, AbstractVector} DataStructures.is_minmax_heap :: Tuple{AbstractVector} Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.extract_all_rev! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.nlargest :: Tuple{Accumulator} DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.counter :: Tuple{Any} DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.Accumulator Base.empty! :: Tuple{CircularBuffer} DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U DataStructures.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.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.num_groups :: Tuple{DisjointSet} Base.getkey :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Any, Any}} where {K, D, Ord<:Base.Order.Ordering} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{OrderedRobinDict{K, V}, Any, Any}} where {K, V} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{SwissDict{K, V}, Any, Any}} where {K, V} DataStructures.capacity :: Tuple{CircularDeque} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T Base.last :: Tuple{CircularDeque} Base.last :: Tuple{CircularBuffer} DataStructures.FasterForward 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}, 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