HashMap.remove

Removes element instances, and returns the number of elements removed

Time complexity: O(1) average; O(n) worst

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

Meta