132 docstrings not included in the manual: DataStructures.popall! :: Tuple{BinaryMinMaxHeap} DataStructures.minimum_node :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.is_minmax_heap :: Tuple{AbstractVector} Base.pushfirst! :: Tuple{CircularBuffer, Any} Base.pushfirst! :: Tuple{CircularDeque, Any} DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} Base.push! :: Union{Tuple{IntDisjointSet{T}}, Tuple{T}} where T<:Integer Base.push! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T 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 Base.push! :: Tuple{BinaryHeap, Any} DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T 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! :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{BinaryMinMaxHeap} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} Base.pop! :: Tuple{BinaryHeap} DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} DataStructures.prefixsum :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}} where T Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.SwissDict Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.get :: Union{Tuple{V}, Tuple{K}, Tuple{Union{Function, Type}, RobinDict{K, V}, Any}} where {K, V} 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} DataStructures.DefaultOrderedDict Base.isempty :: Tuple{CircularBuffer} Base.isempty :: Tuple{BinaryHeap} DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.IntDisjointSet DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.isfull :: Tuple{CircularBuffer} Base.empty! :: Tuple{CircularBuffer} DataStructures.counter :: Tuple{Any} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.OrderedRobinDict Base.length :: Tuple{CircularBuffer} Base.length :: Tuple{BinaryHeap} DataStructures.nlargest :: Tuple{Accumulator} DataStructures.nlargest :: Tuple{Int64, AbstractVector} Base.insert! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryHeap} DataStructures.extract_all_rev! :: U