146 docstrings not included in the manual: DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.nlargest :: Tuple{Accumulator} DataStructures.FasterForward 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.top_with_handle :: Tuple{MutableBinaryHeap} Base.append! :: Tuple{CircularBuffer, AbstractVector} DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T DataStructures.IntDisjointSet DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T DataStructures.popall! :: Tuple{BinaryMinMaxHeap} Base.pushfirst! :: Tuple{CircularDeque, Any} Base.pushfirst! :: Tuple{CircularBuffer, Any} Base.size :: Tuple{CircularBuffer} DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} 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 :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Vararg{AbstractDict{K, D}}}} where {K, D, Ord<:Base.Order.Ordering} Base.merge :: Tuple{Accumulator, Vararg{Accumulator}} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.root_union! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.root_union! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.merge! :: Tuple{Accumulator, Accumulator} 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! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Vararg{AbstractDict{K, D}}}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.search_node :: Tuple{Any, Any} DataStructures.incdec! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer, Integer}, Tuple{FenwickTree{T}, Integer, Integer, Any}} where T DataStructures.DisjointSet Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} DataStructures.nsmallest :: Tuple{Accumulator} Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V DataStructures.DefaultOrderedDict Base.resize! :: Tuple{CircularBuffer, Integer} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryMinMaxHeap} DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.capacity :: Tuple{CircularDeque} DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{SwissDict{K, V}, Any, Any}} where {K, V} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.getkey