SortedMap.add

Time complexity: O(log n)

Returns true if inserted, false where an existing key exists and was updated instead

class SortedMap(K, V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
bool
add
(
K key
,)

Meta