132 docstrings not included in the manual: Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.empty! :: Tuple{CircularBuffer} Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} 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.DefaultOrderedDict DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{CircularBuffer} DataStructures.DefaultDict DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} DataStructures.dec! :: Tuple{Accumulator, Any, Number} 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}} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} 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 Base.size :: Tuple{CircularBuffer} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.CircularBuffer Base.resize! :: Tuple{CircularBuffer, Integer} Base.merge! :: Tuple{Accumulator, Accumulator} Base.merge! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, Vararg{Any}}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} 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 DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U 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 :: 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} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.extract_all_rev! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T Base.fill! :: Tuple{CircularBuffer, Any}