Diferente pentru blog/cpp11 intre reviziile #30 si #31

Nu exista diferente intre titluri.

Diferente intre continut:

These are hash-based implementations of the well known $set$ and $map$ containers; the average time complexity on most operations is $O(1)$. (These containers were previously available on infoarena under $tr1$, but only a small fraction of users were actually using them.)
== code(cpp) |
#include <unordered_map>
...
using namespace std;
...
unordered_map<string, int> age = {
  {"john", 18}, {"mary", 21}, {"anna", 19}
};

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.