On 10/28/14 2:33 PM, "Nordlöw" wrote:
On Tuesday, 28 October 2014 at 18:29:49 UTC, Marc Schütz wrote:
It always was the argument against generalizing `in` to arrays. `in`
is not alone in this respect. It's also expected that indexing and
slicing be "cheap" operations.
BTW: Does anybody have an efficient unordered set container lying around
somewhere?
I haven't touched it in a LONG time, but dcollections has this (HashSet).
I don't claim that it's the most efficient however :)
https://github.com/schveiguy/dcollections/blob/master/dcollections/HashSet.d
-Steve
