146 docstrings not included in the manual: Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{CircularDeque} DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.eltype :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} 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} Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K DataStructures.DisjointSet DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} Base.popfirst! :: Tuple{CircularBuffer} Base.popfirst! :: Tuple{CircularDeque} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T DataStructures.dec! :: Tuple{Accumulator, Any, Number} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.is_minmax_heap :: Tuple{AbstractVector} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} Base.resize! :: Tuple{CircularBuffer, Integer} Base.empty! :: Union{Tuple{SwissDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Union{Tuple{RobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Tuple{CircularBuffer} Base.empty! :: Union{Tuple{OrderedRobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.incdec! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer, Integer}, Tuple{FenwickTree{T}, Integer, Integer, Any}} where T DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T Base.empty :: Union{Tuple{SortedDict{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.empty :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} 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.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.IntDisjointSet Base.delete! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any}} where {K, V} Base.delete! :: Tuple{SwissDict, Any} Base.delete! :: Tuple{OrderedRobinDict, Any} Base.delete! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.delete! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64}} where T DataStructures.DefaultDict DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T DataStructures.popall! :: Tuple{BinaryMinMaxHeap} Base.merge! :: Tuple{Accumulator, Accumulator} Base.merge! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, Vararg{Any}}