132 docstrings not included in the manual: DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer Base.append! :: Tuple{CircularBuffer, AbstractVector} Base.insert! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K DataStructures.DefaultOrderedDict DataStructures.incdec! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer, Integer}, Tuple{FenwickTree{T}, Integer, Integer, Any}} 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.CircularBuffer 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.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.resize! :: Tuple{CircularBuffer, Integer} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} 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.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.DisjointSet DataStructures.Accumulator DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.search_node :: Tuple{Any, Any} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} 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.minimum_node :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} Base.size :: Tuple{CircularBuffer} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} 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.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.capacity :: Tuple{CircularDeque} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.RobinDict DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} 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.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.Fenwic