Why STL list size() complexity is O(1) in C++11, how it is calculated?

Shouldn't it be O(n), because to calculate the size of a doubly linked list, we have to traverse it?