HashMap.take

Remove and expose the first element. Returns false when no more elements are contained

Time complexity: O(n)

  1. bool take(V element)
    class HashMap(K, V, alias Hash = Container.hash, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
    final
    bool
    take
    (
    ref V element
    )
  2. bool take(K key, V value)

Meta