146 docstrings not included in the manual: DataStructures.is_minmax_heap :: Tuple{AbstractVector} DataStructures.FenwickTree :: Union{Tuple{Integer}, Tuple{T}} where T DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U DataStructures.Accumulator DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T Base.resize! :: Tuple{CircularBuffer, Integer} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.IntDisjointSet Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{OrderedRobinDict{K, V}, Any, Any}} where {K, V} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} 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{SwissDict{K, V}, Any, Any}} where {K, V} DataStructures.DefaultDict Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T Base.push! :: Tuple{BinaryHeap, Any} Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{IntDisjointSet{T}}, Tuple{T}} where T<:Integer Base.push! :: Union{Tuple{T}, Tuple{CircularBuffer{T}, Any}} where T Base.push! :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V Base.last :: Tuple{CircularDeque} Base.last :: Tuple{CircularBuffer} DataStructures.SortedDict :: Union{Tuple{}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.SortedDict :: Union{Tuple{D}, Tuple{K}, Tuple{Val{true}, Any}} where {K, D} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.num_groups :: Tuple{DisjointSet} Base.eltype :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} Base.size :: Tuple{CircularBuffer} DataStructures.CircularBuffer DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} DataStructures.search_node :: Tuple{Any, Any} DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} 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! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Vararg{AbstractDict{K, D}}}} where {K, D, Ord<:Base.Order.Ordering} Base.merge! :: Tuple{Accumulator, Accumulator} DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T Base.getindex :: Tuple{CircularBuffer, Int64} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.delete! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.delete! :: Tuple{OrderedRobinDict, 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{SwissDict, Any} Base.empty :: Union{Tuple{SortedDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}