|
You are here |
sdowney.org | ||
| | | | |
poignardazur.github.io
|
|
| | | | | This is an informal proposal for improving the Rust programming language. I'll assume familiarity with the language. | |
| | | | |
www.kuniga.me
|
|
| | | | | NP-Incompleteness: | |
| | | | |
quuxplusone.github.io
|
|
| | | | | Consider the following example of an "STL-style algorithm," taken from a lab exercise in one of my training courses: template<class It> bool is_palindrome(It first, It last) { while (first != last) { -last; if (first == last) break; if (*first != *last) { return false; } ++first; } return true; } A palindrome is equal to itself when read forwards or backwards, so, I said blithely, we could rewrite it like this: template<class It> bool is_palindrome(It first, It last) { return std::equal( first, last, std::reverse_iterator(last), std::reverse_iterator(first) ); } But look out - this code has a bug that causes undefined behavior! Do you see it? | |
| | | | |
www.cppstories.com
|
|
| | | C++11 conformance GCC 4.81 - 100% Clang 3.3 - 100% Intel 14.0 - 84% Visual C++ 2013 - 66% Another year is almost over so it is a good time to check what is going on with C++. This time more stats and real data compared to my post from the previous year. | ||