146 docstrings not included in the manual: DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T 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{Union{Function, Type}, SwissDict{K, V}, Any}} where {K, V} Base.get! :: Tuple{Function, Any, Any} Base.get! :: Union{Tuple{V}, Tuple{K}, Tuple{OrderedRobinDict{K, V}, Any, Any}} where {K, V} Base.get! :: Tuple{Any, Any, Any} Base.get! :: Union{Tuple{V}, Tuple{K}, Tuple{SwissDict{K, V}, Any, Any}} where {K, V} DataStructures.capacity :: Tuple{CircularBuffer} DataStructures.capacity :: Tuple{CircularDeque} DataStructures.extract_all! :: Union{Tuple{AbstractHeap{VT}}, Tuple{VT}} where VT DataStructures.delete_fix :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}} Base.setindex! :: Tuple{CircularBuffer, Any, Int64} 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} Base.getkey :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Any, Any}} where {K, D, Ord<:Base.Order.Ordering} DataStructures.inc! :: Union{Tuple{T}, Tuple{FenwickTree{T}, Integer}, Tuple{FenwickTree{T}, Integer, Any}} where T DataStructures.inc! :: Tuple{Accumulator, Any, Number} DataStructures.FasterReverse DataStructures.is_minmax_heap :: Tuple{AbstractVector} DataStructures.num_groups :: Tuple{DisjointSet} DataStructures.num_groups :: Tuple{IntDisjointSet} DataStructures.DiBitVector DataStructures.DiBitVector :: Tuple{Integer} DataStructures.FenwickTree :: Union{Tuple{Integer}, Tuple{T}} where T DataStructures.FenwickTree :: Union{Tuple{AbstractVector{U}}, Tuple{U}} where U 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} Base.empty! :: Union{Tuple{RobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap} DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer} Base.isequal :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, SortedMultiDict{K, D, Ord}}} where {K, D, Ord<:Base.Order.Ordering} Base.isequal :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, SortedDict{K, D, Ord}}} where {K, D, Ord<:Base.Order.Ordering} Base.length :: Tuple{BinaryHeap} Base.length :: Tuple{CircularBuffer} DataStructures.CircularDeque :: Union{Tuple{Int64}, Tuple{T}} where T DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.popall! :: Tuple{BinaryMinMaxHeap} DataStructures.DefaultOrderedDict DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}} DataStructures.CircularBuffer Base.pushfirst! :: Tuple{CircularDeque, Any} Base.pushfirst! :: Tuple{CircularBuffer, Any} Base.getindex :: Tuple{CircularBuffer, Int64} Base.getindex :: Union{Tuple{K}, Tuple{RBTree{K}, Any}} where K DataStructures.heappop! :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}} DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode} DataStructures.rb_transplant :: Tuple{RBTree, Union{Nothing, DataStructures.RBTreeNode}, Union{Nothing, DataStructures.RBTreeNode}} DataStructures.children_and_grandchildren :: Union{Tuple{T}, Tuple{T, T}} where T<:Integer Base.first :: Tuple{BinaryHeap} Base.first :: Tuple{BinaryMinMaxHeap} Base.first :: Tuple{CircularBuffer} Base.first :: Tuple{CircularDeque} Base.fill! :: Tuple{CircularBuffer, Any} DataStructures.DisjointSet Base.isempty :: Tuple{BinaryHeap} Base.isempty :: Tuple{Cir