-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy path06_min_max.html
486 lines (388 loc) · 17.3 KB
/
06_min_max.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width">
<title>6. Ordering, min, and max</title>
<link rel="stylesheet" href="template/style.css">
</head>
<body>
<span style="float: right">
[
<a href="05_swap.html">previous</a>,
<a href="index.html">contents</a>,
<a href="07_min_range.html">next</a>
]
</span>
<a name="L6.-Ordering-2c--min-2c--and-max"></a>
<h1>6. Ordering, min, and max</h1>
<a name="Learning-to-design-code"></a>
<h2>Learning to design code</h2>
<p>Sometime it feels like I should just tell you what’s in STL.
But, I don’t want to do that.
I want to teach
you to think so that you could design something equal or better.
So most of the algorithms we are looking at are in STL,
but they are not exposed.
They’re beyond what the C++ Standard Committee would ever consider.
You might say, “Alex this is a simple problem. Couldn’t you show us how
to build a search engine?”
Not in a class.</p>
<a name="Reviewing-Total-Orderings"></a>
<h2>Reviewing Total Orderings</h2>
<p>Programmers need to know mathematics.
They have to know certain fundamental things.
When we talked about <code>Regular</code> and <code>TotallyOrdered</code> types we defined the
<code><</code> operator
and some axioms it must satisfy.</p>
<p><strong>Axiom 1:</strong> Anti-reflexive (also called <strong>strict</strong>): <code>!(a < a)</code></p>
<p>This property is what distinguishes <code><</code> from <code><=</code>.</p>
<p>Recall that from <code><</code> and <code>==</code> we defined all other comparison operators
<code>></code>, <code><=</code>, <code>>=</code>, <code>!=</code>.
Why did I pick <code><</code> (the <strong>strict</strong> operator) to be primary in the STL,
instead of <code><=</code>?
It’s important to note that this was a choice I made.
They give you roughly the same universe of things, so you could design
it around either.
But somehow I felt <code><</code> is a more fundamental relation.
<code><</code> requires a little less typing.
There are other reasons, too.</p>
<p><strong>Axiom 2:</strong> Transitive: If <code>a < b</code> and <code>b < c</code> then <code>a < c</code>.</p>
<p>Why is it important?
Think about sorting.
If I checked that <code>b</code> wins over <code>a</code>.
Then I check that <code>c</code> wins over <code>b</code>, I don’t have to do the third check.
It’s guaranteed.</p>
<p><strong>Axiom 3:</strong> Anti-symmetric: If <code>a < b</code> then <code>!(b < a)</code>.</p>
<p><strong>Axiom 4:</strong> If <code>a != b</code> then <code>a < b</code> or <code>b > a</code>.</p>
<p>This is also called the trichotomy law,
because for all elements, exactly one of three things must be true<sup id="fnref:1"><a href="#fn:1" rel="footnote">1</a></sup>:</p>
<pre><code>(a < b) or (b < a) or (a == b)
</code></pre>
<p>There is a fundamental connection between <code><</code> and <code>==</code>.
If <code>!(b < a)</code> then it must be the case that <code>b >= a</code>.</p>
<a name="Weak-orderings"></a>
<h2>Weak orderings</h2>
<p>Our goal is to write the <code>min</code> component.
We could write it for <code>TotallyOrdered</code> types,
but there are other types and orderings it will work on as well.
Specifically, <code>TotallyOrdered</code> is a bit too strong, and not required.
“Partial ordering” may come to mind, but that’s tricky
to work with.
A partial ordering is one that cannot always be used to compare elements.
It is not defined for all elements in the domain<sup id="fnref:2"><a href="#fn:2" rel="footnote">2</a></sup>.
We won’t talk too much about them.</p>
<p>Consider a <code>struct</code> with several fields, and we want to order based on them.
For example, ordering employee records by last name.
If you’re in China there will be many people in the same buckets
because the set of last names is small
and the number of people is very large.
There will be people which are
not less, nor equal, nor greater but they’re not equal.
They are <em>equivalent but not equal</em>.</p>
<p>The concept we need is called <code>StrictWeakOrdering</code>.
A <code>StrictWeakOrdering</code> is exactly the same as total ordering but in a total ordering,
trichotomy says it’s greater or less or equal.
In case of weak ordering it says it’s greater, or less, or <em>equivalent</em>.
There is some equivalence relation, such as last name.</p>
<p>Some people would say, well equal is a kind of equivalence,
so let’s define <code><</code> to just be weak ordering.
I say it’s evil.
Why?
Because for <code>TotallyOrdered</code> we need to be able to know</p>
<pre><code>!(a < b) <=> (a >= b)
</code></pre>
<p>The <code>==</code> is equality, not another equivalence relation.
We can’t conclude that with a weak ordering.
We must overload symbols for what they commonly mean.</p>
<a name="Min"></a>
<h2>Min</h2>
<p>What we will do is write an incorrect version
and then fix it.
We will start with <code>TotallyOrdered</code> because
we are more familiar:</p>
<pre><code>template <typename T>
// T is TotallyOrdered
inline
const T& min(const T& a, const T& b) {
if (a < b) {
return a;
} else {
return b;
}
}
</code></pre>
<p>Notice that we need to pass things by <code>const</code> reference.
We want to be able to write <code>min(5, 3)</code>,
and 5 and 3 are literals which are constant.</p>
<a name="When-elements-are-equal"></a>
<h3>When elements are equal</h3>
<p>What should we return when <code>a == b</code>?
It seems it doesn’t matter.
But that’s the problem.
Everywhere in programming you do something and it seems to be correct.
But you have to think deeply and then you discover a problem.
There is nothing little in programming.</p>
<p>Let me construct a proof for you.
When we sort a range which is already sorted,
we should not do any operations.
Nothing should be swapped.
It’s a good requirement.</p>
<p>Another requirement is if I sort two things,
the first guy should be the <code>min</code> afterwards
and the second guy should be the <code>max</code>.
We agreed that default ordering for sorting should be ascending.
Zero, one, two, three is natural.
Three, two, one, zero is when you launch missiles.
So what we can conclude is that <code>min</code> on two equal arguments
should return the first. We will see more of this later.</p>
<p>So let’s correct it, so we don’t swap unless necessary.</p>
<pre><code>if (b < a) {
return b;
} else {
return a;
}
</code></pre>
<p>When you design a function you often think about just this
function, and ignore how it interacts with other parts of your API.
Then you discover inconsistencies which can be very subtle but painful.
There are several profound mistakes in STL.
They are still in the standard, despite all my attempts to change them.
It’s very easy to make a mistake and it’s really hard to fix it.</p>
<a name="Correct-implementation"></a>
<h3>Correct implementation</h3>
<p>Now we have a correct version for <code>TotallyOrdered</code>, let’s generalize it for <code>StrictWeakOrdering</code>.
We no longer can rely on the <code><</code> operator on the type, as there may be many
orderings and equivalence relations on a type.</p>
<pre><code>template <typename T, typename Compare>
// Compare is StrictWeakOrdering on type T
inline
const T& min(const T& a, const T& b, Compare cmp) {
if (cmp(b, a)) {
return b;
} else {
return a;
}
}
</code></pre>
<p>Why do we pass compare as a generic type argument instead of a function pointer?
There are two reasons:</p>
<ol>
<li><p><strong>Functionality:</strong> Making it a type would allow it to have state. Pointers to functions have no state.</p></li>
<li><p><strong>Performance:</strong> If we were passing a pointer it would have to do a function call through the pointer.
The function call has to save and restore registers.
It’s slow especially if it sits inside a loop and is called a gazillion times.</p></li>
</ol>
<a name="Less-than-function-object"></a>
<h2>Less than function object</h2>
<p>It’s somewhat inconvenient to pass <code>cmp</code> when you actually want to use a <code>TotallyOrdered</code> type.
Therefore there should be a version of <code>min</code> which doesn’t take that parameter.
The wrong way is to use a default template argument.
Sometimes you want to get a pointer to the function <code>min</code>
with a comparison function inserted.
For example:</p>
<pre><code>min<int, std::less<int>>
</code></pre>
<p>We also want to be able to say:</p>
<pre><code>min<int>
</code></pre>
<p>So we write a second interface:</p>
<pre><code>const T& min(const T& a, const T& b) {
return min(a, b, std::less<T>());
}
</code></pre>
<p>Let’s implement a standard class called <a href="https://en.cppreference.com/w/cpp/utility/functional/less"><code>std::less</code></a>.
It overrides the evaluation operator so it can be called just like a function<sup id="fnref:3"><a href="#fn:3" rel="footnote">3</a></sup>.</p>
<pre><code>template<typename T>
// T is TotallyOrdered
struct less {
bool operator()(const T& a, const T& b) const {
return a < b;
}
};
</code></pre>
<p>Function objects are a very important technique to allow you to pass things to template algorithms.
It will literally be inlined at compile time.
It is very good to be inlined like this.
Instead of a function call it will be one instruction,
which is most likely going to be done in parallel with some other instructions.
It is free.</p>
<p>Here is an example of how to use it:</p>
<pre><code>int a[] = { 4, 9, 3, 1, 4 };
std::sort(a, a + 5, std::less<int>());
</code></pre>
<p>Notice that we aren’t passing a type, we are actually creating an object<sup id="fnref:4"><a href="#fn:4" rel="footnote">4</a></sup>.
You can write your own function objects.
If you have a record and you want to do sorting, or min, or max on the second field you could
write one which compares the second field of the record.
It will be inlined.
Remember the faster computers get, the slower function calls are.</p>
<a name="Max"></a>
<h2>Max</h2>
<p>Let us try to do <code>max</code>.
It is a hard one.
I got it wrong in STL and only realized after it was accepted as an international standard.
I started this campaign on changing it to the correct one.
The campaign has been going on close to twenty years without any success.
So, the one in the standard is still broken.
Let us see why.</p>
<p>It seems that <code>max</code> is just <code>min</code> with <code>></code>.
So why do we need it?
We still want to provide what is convenient for the customer.
When they think <code>max</code> and go looking for it, it should somehow work.
But, it’s a little bit more.</p>
<a name="Sort2"></a>
<h3>Sort2</h3>
<p>We previously said that <code>min</code>, <code>max</code>, and <code>sort</code> should work together naturally.<br/>
To see how they should all work, let’s write <code>sort2</code>, which sorts two things.</p>
<pre><code>template<typename T, typename Compare>
// requires Compare is a StrictWeakOrdering on T
inline
void sort2(T& a, T& b, Compare cmp) {
if (cmp(b, a)) {
swap(a, b);
}
}
</code></pre>
<p>It’s always preferable to sort in-place because we can obtain a composable
one by first copying, and then applying the in-place algorithm.</p>
<p>Note once again the order of comparison.
We have to be careful that we aren’t going to swap when they are equal.
I want the following invariant, after <code>sort2</code>
<code>a</code> contains min and <code>b</code> contains max.
It’s very natural.
But, we have to ensure it works, even when the two parameters
are equivalent.</p>
<a name="Implementation"></a>
<h3>Implementation</h3>
<p>So, if we define <code>max</code> with <code>min</code> and <code><</code>
it’s not going to work.
Suppose we have <code>a == b</code> (they are both equivalent), then</p>
<pre><code>min(a, b) = a
max(a, b) = a
</code></pre>
<p>You actually want <code>min</code> and <code>max</code>
to do different things because they’re both useful.
When there are two equivalent things, <code>min</code> will return the first,
and <code>max</code> will do the opposite and return the last.</p>
<pre><code>template<typename T, typename Compare>
// requires Compare is a StrictWeakOrdering on T
inline
const T& max(const T& a, const T& b, Compare cmp) {
if (cmp(b, a)) {
return a;
} else {
return b;
}
}
</code></pre>
<p>The naive user will never even know about what happens to equal.
This is for sophisticated guys like you who write complicated and relevant algorithms.
You need to understand the finer things of programming.</p>
<p>Every time I talk to one member of the standard
committee he always says, “Alex you are too theoretical”.
I guess I am because I pay attention to
these little details.
But I claim to be able to show you that
things like that will matter.</p>
<p>Later we will generalize it on a bunch of things.
Sometimes I want to find the first min, sometimes I want
to find the last min, and the same for max.</p>
<p><strong>Exercise</strong>: Define a version of <code>max</code> that uses <code>TotalOrdering</code> instead of <code>Compare</code>, like we did for <code>min</code>.</p>
<a name="Fundamental-logical-laws-are-not-always-obeyed"></a>
<h2>Fundamental logical laws are not always obeyed</h2>
<p>We have to address an issue which will cause lots of trouble.
The people at Google encountered it and they couldn’t figure out.
Certain thing should always work, such as the following:</p>
<pre><code>a = a
a < b or b >= a
</code></pre>
<p>We assume these statements are true,
but it’s not true.
There are exceptions which cause enormous amounts of harm
and break all the laws of equality and ordering.</p>
<pre><code>double x(0.0/0.0);
std::cout << (x == x ? "yes" : "no") << std::endl;
</code></pre>
<p>This should always print “yes”, but it prints, “no”.</p>
<p>You could say, “Only total idiots will write code like that”.
The problem is much harsher problem.
You could have a floating-point computation which leads to this result
and is utterly invisible to you.
The problem actually appears when people do complicated things.
Perhaps they do millions of computations and then sort them.
Sort assumes that equality and inequality work like
they should and bad things happen.</p>
<p>The <a href="https://en.wikipedia.org/wiki/IEEE_754">IEEE floating point standard</a> is one of the great accomplishments of
computer science. One of the top five.
From my point of view, we haven’t got that many accomplished.
We might have six altogether.
It was terrible before it.
But somehow they decided to
indicate undetermined floating-point value by breaking fundamental logical axioms.</p>
<p>They are also not <code>!=</code> which is weird too:</p>
<pre><code>double x(0.0/0.0);
std::cout << (x < x || x >= x ? "yes" : "no") << std::endl;
</code></pre>
<p>Prints “no”.
Law of excluded middle doesn’t work anymore,
and this is sad.
You can’t make reasonable assumptions.</p>
<p>What’s the solution?
There are two solutions</p>
<ol>
<li>abandoning the laws.</li>
<li>putting a wall around bad values.</li>
</ol>
<p>I’m advocating the second one.
We keep the laws and define singularities.
If there are singular values, the universe collapses,
you know nothing applies.
You have to assure that singular values do not appear in your computation.</p>
<a name="Final-code"></a>
<h2>Final code</h2>
<ul>
<li><a href="code/minmax.h">minmax.h</a></li>
</ul>
<div class="footnotes">
<hr/>
<ol>
<li id="fn:1">
Alex recommends chapter 4 of “Elements of Programming”
to learn more about this subject.<a href="#fnref:1" rev="footnote">↩</a></li>
<li id="fn:2">
The classic example of a partial ordering
is the relation subset on the domain of sets.
The set <code>{ 1 }</code> is a subset of <code>{ 1, 2, 3 }</code>
But, <code>{ 1, 4 }</code> is not a subset of <code>{ 1, 2, 3 }</code>.
Neither is <code>{ 1, 2, 3 }</code> a subset of <code>{ 1, 4 }</code>.
The two elements are incomparable.<a href="#fnref:2" rev="footnote">↩</a></li>
<li id="fn:3">
Function objects like this in C++ fulfil
the same role as <a href="https://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book-Z-H-21.html#%_sec_3.2">closures or lambdas</a>.
They capture variables or state, and then use them to evaluate the function.
The main difference is that their saved context is explicit rather
than implicit.<a href="#fnref:3" rev="footnote">↩</a></li>
<li id="fn:4">
Alex:
How big is this object?
You might say it’s empty.
But, sadly enough, there is a great secret.
There are no empty things.
They are still one byte because C doesn’t want us to allocate two objects at the same
address.
If you have zero size you will be able to just pile objects on top
of each other so you do use one byte.
Does it matter?
Not at all.<a href="#fnref:4" rev="footnote">↩</a></li>
</ol>
</div>
<span style="float: right">
[
<a href="05_swap.html">previous</a>,
<a href="index.html">contents</a>,
<a href="07_min_range.html">next</a>
]
</span>
</body>
</html>