HashSet.take

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

Time complexity: O(n)

class HashSet(V, alias Hash = Container.hash, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
bool
take
(
ref V element
)

Meta