## StrictWeakOrdering

I always forget what strict weak ordering means, but it’s quite simple, actually. My explanation is based on the Programming Conversation of last week and I hope this will help me remember the next time I hear about this. Let’s start with ordering. A relation is an ordering if it is transitive. ordering --> for all a, b, c: r(a, b) and r(b, c) => r(a, c) And now strict....