Explore >> Select a destination
|
You are here 
|
www.think-cell.com | ||
| | | | |
www.foonathan.net
|
|
| | | | | The size of std::array is known at compile-time given the type. Yet it only provides a regular .size() member function: template struct array { constexpr std::size_t size() const { return N; } }; This is annoying if you're writing generic code that expects some sort of compile-time sized range. | |
| | | | |
eyakubovich.github.io
|
|
| | | | | In the previous post, we developed a logarithmic depth accumulate() function that can be used to emulate a for-loop. In this post, we'll look at how to construct a function that emulates a while-loop with the recursive depth of O(lg(n)) where n is the number of iterations of the while-loop.... | |
| | | | |
pydong.org
|
|
| | | | | P1306 gives us compile time repetition of a statement for each element of a range - what if we instead want the elements as a pack without introducing a new function scope? | |
| | | | |
www.fluentcpp.com
|
|
| | | Do you know how to partially specialize all the kinds of templates in C++? Check out this post for how to do it while keeping your code clear. | ||
