146 docstrings not included in the manual: DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.FasterReverse Base.pushfirst! :: Tuple{CircularBuffer, Any} Base.pushfirst! :: Tuple{CircularDeque, Any} 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.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 Base.delete! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any}} where {K, V} Base.delete! :: Tuple{SwissDict, Any} Base.getindex :: Tuple{CircularBuffer, Int64} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.eltype :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.FasterForward DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.incdec! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer, Integer}, Tuple{FenwickTree{T}, Integer, Integer, Any}} where T Base.empty! :: Union{Tuple{RobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Union{Tuple{SwissDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Union{Tuple{OrderedRobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} Base.empty! :: Tuple{CircularBuffer} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, 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} DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V Base.size :: Tuple{CircularBuffer} DataStructures.isfull :: Tuple{CircularBuffer} Base.push! :: Union{Tuple{IntDisjointSet{T}}, Tuple{T}} where T<:Integer Base.push! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T Base.push! :: Tuple{BinaryHeap, Any} Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D}, Pair}} where {K, D} Base.push! :: Union{Tuple{T}, Tuple{CircularBuffer{T}, Any}} where T Base.push! :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Tuple{BinaryHeap} Base.pop! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} 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.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.dec! :: Tuple{Accumulator, Any, Number} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} DataStructures.nlargest :: Tuple{Accumulator} DataStructures.nlargest :: Tuple{Int64, AbstractVector} Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} DataStructures.Di