do not drop repeat keys in Accumulate(::Pairs...) #195
Annotations
1 warning
Documentation:
../../../.julia/packages/Documenter/bYYzK/src/Utilities/Utilities.jl#L34
146 docstrings not included in the manual:
Base.merge :: Tuple{Accumulator, Vararg{Accumulator}}
Base.merge :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Vararg{AbstractDict{K, D}}}} where {K, D, Ord<:Base.Order.Ordering}
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! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedDict{K, D, Ord}, Vararg{AbstractDict{K, D}}}} where {K, D, Ord<:Base.Order.Ordering}
Base.merge! :: Tuple{Accumulator, Accumulator}
Base.merge! :: Union{Tuple{Ord}, Tuple{D}, Tuple{K}, Tuple{SortedMultiDict{K, D, Ord}, Vararg{Any}}} where {K, D, Ord<:Base.Order.Ordering}
DataStructures.nsmallest :: Tuple{Accumulator}
DataStructures.nsmallest :: Tuple{Int64, AbstractVector}
DataStructures.SwissDict
Base.resize! :: Tuple{CircularBuffer, Integer}
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! :: Union{Tuple{RobinDict{K, V}}, Tuple{V}, Tuple{K}} where {K, V}
Base.empty! :: Tuple{CircularBuffer}
DataStructures.isheap :: Union{Tuple{AbstractArray}, Tuple{AbstractArray, Base.Order.Ordering}}
DataStructures.heappush! :: Union{Tuple{AbstractArray, Any}, Tuple{AbstractArray, Any, Base.Order.Ordering}}
Base.first :: Tuple{BinaryHeap}
Base.first :: Tuple{CircularDeque}
Base.first :: Tuple{BinaryMinMaxHeap}
Base.first :: Tuple{CircularBuffer}
DataStructures.dec! :: Union{Tuple{FenwickTree, Integer}, Tuple{FenwickTree, Integer, Any}}
DataStructures.dec! :: Tuple{Accumulator, Any, Number}
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.root_union! :: Union{Tuple{T}, Tuple{DisjointSet{T}, T, T}} where T
DataStructures.root_union! :: Union{Tuple{T}, Tuple{IntDisjointSet{T}, T, T}} where T<:Integer
DataStructures.FasterForward
Base.setindex! :: Tuple{CircularBuffer, Any, Int64}
DataStructures.popmin! :: Tuple{BinaryMinMaxHeap, Integer}
DataStructures.popmin! :: Tuple{BinaryMinMaxHeap}
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}
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{SortedDict{K, D, Ord}}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering}
DataStructures.capacity :: Tuple{CircularDeque}
DataStructures.capacity :: Tuple{CircularBuffer}
DataStructures.find_prefixes :: Union{Tuple{T}, Tuple{Trie, T}} where T
DataStructures.top_with_handle :: Tuple{MutableBinaryHeap}
DataStructures.RobinDict
DataStructures.DefaultOrderedDict
DataStructures.right_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode}
Base.delete! :: Tuple{SwissDict, Any}
Base.delete! :: Union{Tuple{K}, Tuple{RBTree{K}, K}} where K
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! :: Tuple{OrderedRobinDict, Any}
DataStructures.fix_insert! :: Tuple{RBTree, DataStructures.RBTreeNode}
Base.last :: Tuple{CircularDeque}
Base.last :: Tuple{CircularBuffer}
DataStructures.left_rotate! :: Tuple{RBTree, DataStructures.RBTreeNode}
DataStructures.nlargest :: Tuple{Accumulator}
DataStructures.nlargest :: Tuple{Int64, AbstractVector}
DataStructures.popmax! :: Tuple{BinaryMinMaxHeap, Integer}
DataStructures.popmax! :: Tuple{BinaryMinMaxHeap}
DataStructures.SortedDict :: Union{Tuple{}, Tuple{Ord}, Tuple{D}, Tuple{K}} where {K, D, Ord<:Base.Order.Ordering}
DataStructures.SortedDict :: Union{Tuple{D}, Tuple{
|