136 docstrings not included in the manual: Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} Base.last :: Tuple{CircularBuffer} Base.last :: Tuple{CircularDeque} DataStructures.CircularBuffer 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.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.is_minmax_heap :: Tuple{AbstractVector} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{BinaryMinMaxHeap} DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T Base.isempty :: Tuple{CircularBuffer} Base.isempty :: Tuple{BinaryHeap} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.capacity :: Tuple{CircularDeque} 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} Base.union! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer Base.union! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} 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} Base.get! :: Tuple{Any, Any, Any} Base.get! :: Tuple{Function, Any, Any} DataStructures.DefaultOrderedDict DataStructures.OrderedRobinDict Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{DataStructures.DefaultDictBase, Any} Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} DataStructures.DefaultDict 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 DataStructures.Accumulator DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} DataStructures.dec! :: Tuple{Accumulator, Any, Number} 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 Base.append! :: Tuple{CircularBuffer, AbstractVector} DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.DisjointSet DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.extract_all_rev! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.FasterForward DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} w