SortedMap.remove

Time complexity: O(n

size_t remove(IContainer!(V) e, bool all)
size_t remove(V value, bool all)
class SortedMap(K, V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
size_t
remove
(
V value
,
bool all = false
)

Meta

Source

See Implementation

tango util container SortedMap SortedMap aliases

Type

constructors

this

destructors

~this

functions

properties

variables

tree