136 docstrings not included in the manual: DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} 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.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.FasterReverse DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} 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, Vararg{Accumulator}} Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} 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.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.counter :: Tuple{Any} Base.isempty :: Tuple{CircularBuffer} Base.isempty :: Tuple{BinaryHeap} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{CircularBuffer, Int64} Base.getindex :: Tuple{DataStructures.DefaultDictBase, Any} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.search_node :: Tuple{Any, Any} Base.isfull :: Tuple{CircularBuffer} DataStructures.capacity :: Tuple{CircularDeque} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.incdec! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer, Integer}, Tuple{FenwickTree{T}, Integer, Integer, Any}} where T DataStructures.DefaultOrderedDict DataStructures.DisjointSet DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V Base.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{BinaryHeap} 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.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Tuple{RobinDict, Any} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}}