Set3 is a fast and pure set implmentation in and for Golang.
The code is derived from SwissMap and it is implementing the "Fast, Efficient, Cache-friendly Hash Table" found in Abseil. For details on the algorithm see the CppCon 2017 talk by Matt Kulukundis. The dependency on x86 assembler for SSE instructions has been removed for portability and speed (yes, the code is faster without SSE).
Iter iterates the elements of the Map, passing them to the callback.
It guarantees that any key in the Map will be visited only once, and
for un-mutated Maps, every key will be visited once. If the Map is
Mutated during iteration, mutations will be reflected on return from
Iter, but the Set3 of keys visited by Iter is non-deterministic.