132 docstrings not included in the manual: DataStructures.DefaultOrderedDict DataStructures.nsmallest :: Tuple{Accumulator} DataStructures.nsmallest :: Tuple{Int64, AbstractVector} DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U DataStructures.minimum_node :: Tuple{RBTree, DataStructures.RBTreeNode} 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 DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{CircularBuffer} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} 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.SwissDict DataStructures.FasterForward DataStructures.nlargest :: Tuple{Accumulator} DataStructures.nlargest :: Tuple{Int64, AbstractVector} DataStructures.nextreme :: Union{Tuple{T}, Tuple{Base.Order.Ordering, Int64, AbstractVector{T}}} where T Base.popfirst! :: Tuple{CircularDeque} Base.popfirst! :: Tuple{CircularBuffer} DataStructures.DiBitVector :: Tuple{Integer} DataStructures.DiBitVector 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.setindex! :: Tuple{CircularBuffer, Any, Int64} DataStructures.reset! :: Union{Tuple{V}, Tuple{Accumulator{<:Any, V}, Any}} where V Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.is_minmax_heap :: Tuple{AbstractVector} Base.empty! :: Tuple{CircularBuffer} 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 Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.num_groups :: Tuple{DisjointSet} Base.empty :: Union{Tuple{SortedMultiDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering} Base.empty :: Union{Tuple{SortedSet{K, Ord}}, Tuple{U}, Tuple{Ord}, Tuple{K}, Tuple{SortedSet{K, Ord}, Type{U}}} where {K, Ord<:Base.Order.Ordering, U} DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K Base.getindex :: Tuple{CircularBuffer, Int64} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer} DataStructures.popmax! :: Tuple{BinaryMinMaxHeap} DataStructures.counter :: Tuple{Any} Base.haskey :: Tuple{SwissDict, Any} Base.haskey :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K Base.haskey :: Tuple{RobinDict, Any} Base.haskey :: Tuple{OrderedRobinDict, Any} DataStructures.search_node :: Tuple{Any, Any} DataStructures.isfull :: Tuple{CircularBuffer} DataStructures.CircularBuffer Base.first :: Tuple{CircularDeque} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{CircularBuffer} 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} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickT