146 docstrings not included in the manual: DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} Base.popfirst! :: Tuple{CircularBuffer} Base.popfirst! :: Tuple{CircularDeque} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V Base.isempty :: Tuple{CircularBuffer} Base.isempty :: Tuple{BinaryHeap} DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.nlargest :: Tuple{Accumulator} DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.counter :: Tuple{Any} Base.pushfirst! :: Tuple{CircularDeque, Any} Base.pushfirst! :: Tuple{CircularBuffer, Any} Base.get! :: Union{Tuple{V}, Tuple{K}, Tuple{Union{Function, Type}, OrderedRobinDict{K, V}, Any}} where {K, V} Base.get! :: Tuple{Function, Any, Any} 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! :: Union{Tuple{V}, Tuple{K}, Tuple{OrderedRobinDict{K, V}, Any, Any}} where {K, V} Base.get! :: Union{Tuple{V}, Tuple{K}, Tuple{SwissDict{K, V}, Any, Any}} where {K, V} Base.eltype :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.isfull :: Tuple{CircularBuffer} DataStructures.OrderedRobinDict DataStructures.SortedMultiDict :: Union{Tuple{D}, Tuple{K}, Tuple{Val{true}, Any}} where {K, D} DataStructures.SortedMultiDict :: Union{Tuple{}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.SortedDict :: Union{Tuple{D}, Tuple{K}, Tuple{Val{true}, Any}} where {K, D} DataStructures.SortedDict :: Union{Tuple{}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.RobinDict 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.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Tuple{BinaryHeap} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} 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{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.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.IntDisjointSet DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT Base.last :: Tuple{CircularBuffer} Base.last :: Tuple{CircularDeque} Bas