TreeMap.remove

Removes an item by key. Returns the removed item if found, or K.init if not.

  1. E remove(T key)
  2. K remove(K key)
    struct TreeMap(K, E, bool nogcIndexing = true, alias less = "a < b")
    @safe pure nothrow
    K
    remove
    (
    K key
    )

Meta