, operator < - , . , , API, . , std::map operator <, . , , , (O (log n)). . ( , , operator < , ).
, . . operator <, .
, , operator < operator >, , (, ). 1 5 , 1 < 2 < 3 < 4 < 5. , operator <(T left, T right), true, "" .
And after another passage over the text that you quoted, it seems to me that they are talking more about the person who wrote the algorithm that uses operator <, and not the one who writes the class that implements operator <. If you are writing an algorithm that should work with other people's code, and you want them to provide you with a way to arrange their elements, you only need to operator <. The point is to simplify the work of the "client".
source
share