HashSet.remove

Remove the provided element. Returns true if found, false otherwise

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

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

Meta