B4TMAN

7 ms·

1. 1.▲
   by B4TMAN 7y ago

   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 funct
2. 2.▲
   by B4TMAN 9y ago

   I am a little lost. What effect does `typedef int func(int arg);` have on the code?
3. 3.▲
   Null References: The Billion Dollar Mistake(infoq.com)

   1 points by B4TMAN 9y ago|0 comments
4. 4.▲
   by B4TMAN 9y ago

   Is there any place to get a proper manual of all these uses?
5. 5.▲
   by B4TMAN 9y ago

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