132 docstrings not included in the manual: DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.DisjointSet Base.empty :: Union{Tuple{SortedMultiDict{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} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} DataStructures.dec! :: Tuple{Accumulator, Any, Number} DataStructures.minimum_node :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.DiBitVector :: Tuple{Integer} DataStructures.DiBitVector Base.last :: Tuple{CircularDeque} Base.last :: Tuple{CircularBuffer} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.DefaultOrderedDict 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, Vararg{Accumulator}} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} Base.pop! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Tuple{BinaryHeap} Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} DataStructures.IntDisjointSet DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} Base.delete! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64}} where T Base.delete! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any}} where {K, V} Base.delete! :: Tuple{OrderedRobinDict, Any} Base.delete! :: Tuple{SwissDict, Any} Base.delete! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} 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} Base.insert! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.first :: Tuple{CircularDeque} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{BinaryMinMaxHeap} Base.push! :: Tuple{BinaryHeap, Any} Base.push! :: Union{Tuple{IntDisjointSet{T}}, Tuple{T}} where T<:Integer 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 DataStructures.OrderedRobinDict DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.nlargest :: Tuple{Accumulator} DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.CircularBuffer DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.FasterReverse DataStructures.popall! :: Tuple{BinaryMinMaxHeap} DataStructures.DefaultDict DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} 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{Orde