pfultz2

12 ms·

1. 61.▲
   by pfultz2 13y ago

   > If in is an operator and overloaded by std::vector, then it's easy to implement. However, searching a `std::vector` is not really part of its implementation. So, requiring every single range to overload an operator for trivial sea
2. 62.▲
   by pfultz2 13y ago

   > But hey, at least they have a Turing-complete template language to go with their macros! Priorities, right? And with that you can build reflection: http://stackoverflow.com/a/11744832/375343
3. 63.▲
   by pfultz2 14y ago

   So the expression of unbounded recursion can be expressed like this: #define EMPTY() #define DEFER(id) id EMPTY() #define FOREVER() \ ? \ DEFER(FOREVER_INDIRECT) () () #define FOREVER_INDIRECT() FOREVER