146 docstrings not included in the manual: 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.isequal :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, SortedDict{K, D, Ord}}} where {K, D, Ord<:Base.Order.Ordering} Base.isequal :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, SortedMultiDict{K, D, Ord}}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.Accumulator DataStructures.FasterReverse DataStructures.DisjointSet DataStructures.DefaultOrderedDict DataStructures.isfull :: Tuple{CircularBuffer} DataStructures.root_union! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.root_union! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, 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! :: 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} 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.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} Base.pop! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{BinaryHeap} DataStructures.search_node :: Tuple{Any, Any} DataStructures.IntDisjointSet DataStructures.counter :: Tuple{Any} Base.eltype :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.DefaultDict Base.push! :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.push! :: Union{Tuple{IntDisjointSet{T}}, Tuple{T}} where T<:Integer Base.push! :: Union{Tuple{T}, Tuple{CircularBuffer{T}, Any}} where T Base.push! :: Tuple{BinaryHeap, Any} Base.push! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D}, Pair}} where {K, D} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.in_same_set :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.in_same_set :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.FasterForward DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Union{Tuple{K}, Tupl