SortedMap.remove

Time complexity: O(n)

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

Meta