136 docstrings not included in the manual: DataStructures.DefaultOrderedDict DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.SwissDict DataStructures.insert_node! :: Tuple{RBTree, DataStructures.RBTreeNode} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{DataStructures.DefaultDictBase, Any} Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V DataStructures.update! :: Union{Tuple{T}, Tuple{MutableBinaryHeap{T}, Int64, Any}} where T DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.top_with_handle :: Tuple{MutableBinaryHeap} DataStructures.DefaultDictBase 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, Vararg{Accumulator}} DataStructures.nlargest :: Tuple{Accumulator} DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.FasterForward 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.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{BinaryHeap} Base.pop! :: Tuple{SwissDict, Any} Base.pop! :: Tuple{CircularBuffer} Base.pop! :: Tuple{OrderedRobinDict, Any, Any} Base.pop! :: Tuple{BinaryMinMaxHeap} DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.incdec! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer, Integer}, Tuple{FenwickTree{T}, Integer, Integer, Any}} where T Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.haskey :: Tuple{OrderedRobinDict, Any} Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Tuple{RobinDict, Any} Base.getkey :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Any, Any}} where {K, D, Ord<:Base.Order.Ordering} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{RobinDict{K, V}, Any, Any}} where {K, V} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{OrderedRobinDict{K, V}, Any, Any}} where {K, V} Base.getkey :: Union{Tuple{V}, Tuple{K}, Tuple{SwissDict{K, V}, Any, Any}} where {K, V} DataStructures.is_minmax_heap :: Tuple{AbstractVector} DataStructures.find_root! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T}} where T<:Integer DataStructures.find_root! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T}} where T 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.search_node :: Tuple{Any, Any} DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T 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.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer DataStructures.capacity :: Tuple{CircularBuffer} DataSt