132 docstrings not included in the manual: DataStructures.counter :: Tuple{Any} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.IntDisjointSet DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} 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 Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.is_minmax_heap :: Tuple{AbstractVector} Base.last :: Tuple{CircularDeque} Base.last :: Tuple{CircularBuffer} Base.resize! :: Tuple{CircularBuffer, Integer} DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.FasterForward 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! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.delete! :: Tuple{SwissDict, Any} Base.delete! :: Tuple{OrderedRobinDict, Any} DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} DataStructures.minimum_node :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.heapify! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.root_union! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer DataStructures.root_union! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer 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} Base.get! :: Tuple{Any, Any, Any} Base.get! :: Tuple{Function, Any, Any} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}} DataStructures.dec! :: Tuple{Accumulator, Any, Number} DataStructures.DefaultDict DataStructures.CircularBuffer DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} Base.size :: Tuple{CircularBuffer} Base.pushfirst! :: Tuple{CircularBuffer, Any} Base.pushfirst! :: Tuple{CircularDeque, Any} 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! :: Tuple{Accumulator, Accumulator} Base.push! :: Tuple{BinaryHeap, Any} 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 DataStructures.