132 docstrings not included in the manual: 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 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.DefaultDict DataStructures.search_node :: Tuple{Any, Any} Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V 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 DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.num_groups :: Tuple{DisjointSet} 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} Base.pushfirst! :: Tuple{CircularDeque, Any} Base.pushfirst! :: Tuple{CircularBuffer, Any} DataStructures.counter :: Tuple{Any} 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! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.delete! :: Tuple{SwissDict, Any} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.OrderedRobinDict DataStructures.SwissDict DataStructures.FasterForward DataStructures.DisjointSet 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} DataStructures.Accumulator DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.minimum_node :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer Base.append! :: Tuple{CircularBuffer, AbstractVector} DataStructures.FasterReverse DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T Base.size :: Tuple{CircularBuffer} DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{CircularDeque} DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, Da