B4TMAN

Can you elaborate why is it slow? Shouldn't it be faster tham `std::ordered_set` which uses a Red Black Tree as the undelying data structure thus proviing a O(logn) time complexity on the other hand `std::unordered_set` uses hash functions to `index` in an array and retrieve which essentially is a O(1) time complexity.

I am a little lost. What effect does `typedef int func(int arg);` have on the code?

Is there any place to get a proper manual of all these uses?

Any reference(s) where I can read more about writing emulators?