-
Notifications
You must be signed in to change notification settings - Fork 5
/
index.html
677 lines (638 loc) · 27.5 KB
/
index.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
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
<!doctype html>
<html>
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no">
<title>What's in C++17?</title>
<link rel="stylesheet" href="css/reveal.css">
<link rel="stylesheet" href="css/theme/league.css">
<!-- Theme used for syntax highlighting of code -->
<link rel="stylesheet" href="lib/css/zenburn.css">
<!-- Printing and PDF exports -->
<script>
var link = document.createElement( 'link' );
link.rel = 'stylesheet';
link.type = 'text/css';
link.href = window.location.search.match( /print-pdf/gi ) ? 'css/print/pdf.css' : 'css/print/paper.css';
document.getElementsByTagName( 'head' )[0].appendChild( link );
</script>
</head>
<body>
<div class="reveal">
<div class="slides">
<section>
<h1>What's in C++17?</h1>
<p><strong>JF Bastien <<a href="https://twitter.com/jfbastien">@jfbastien</a>></strong></p>
<p style="font-size:40%">Slides borrow heavily from Bryce Adelstein Lelbach <<a href="https://twitter.com/blelbach">@blelbach</a>></p>
<p style="font-size:40%"><a href="https://github.com/jfbastien/what-is-cpp17">github.com/jfbastien/what-is-cpp17</a></p>
</section>
<section>
<section>
<h1>The Standards Process</h1>
<p><a href="https://isocpp.org/std">isocpp.org/std</a></p>
</section>
<section>
<img src="wg21-timeline.png" style="border:none;background:none;box-shadow:none">
</section>
<section>
<h2>When is it coming?</h2>
<ol>
<li>Ballot resolution in February
<li>Officially adopted in July
</ol>
<p><small>(If everything goes well)</small></p>
<p><a href="http://wg21.link/N4618">📑 current draft</a></p>
</section>
<section>
<h2>When can I use it?</h2>
<p>See the <a href="http://en.cppreference.com/w/cpp/compiler_support">cppreference table</a>, or the individual status for:</p>
<ul>
<li><a href="http://clang.llvm.org/cxx_status.html#cxx17">clang</a>
<li><a href="https://gcc.gnu.org/projects/cxx-status.html#cxx1z">GCC</a>
<li><a href="http://libcxx.llvm.org/cxx1z_status.html">libc++</a>
<li><a href="https://gcc.gnu.org/onlinedocs/libstdc++/manual/status.html#status.iso.201z">libstdc++</a>
</ul>
</section>
</section>
<section>
<section><h1>What's in it?</h1></section>
<section>
<h1>Language</h1>
<ul style="font-size:60%">
<li>Structured bindings
<li><code>if constexpr</code>
<li><code>constexpr</code> lambdas
<li>Inline variables
<li>Folding expressions
<li><code>template <auto></code>
<li>Constructor template argument deduction
<li>Guaranteed copy elision
<li><code>noexcept</code> added to the type system
<li><code>if (init; cond)</code> and <code>switch (init; cond)</code>
<li><code>namespace A::B::C {}</code>
<li>Single-parameter <code>static_assert()</code>
<li><code>__has_include()</code>
</ul>
</section>
<section>
<h1>Library</h1>
<ul style="font-size:60%">
<li><code><filesystem></code>
<li><code><memory_resource></code>
<li><code>string_view</code>
<li><code>optional<></code>
<li><code>variant<></code>
<li><code>any</code>
<li>Parallel algorithms
<li>Aligned <code>new</code>
<li><code>shared_mutex</code> and variadic <code>lock_guard<></code>
<li>Math special functions
<li><code>invoke()</code>, <code>apply()</code>, and <code>is_callable<></code>
<li><code>*_v<></code> variable templates for type traits
<li><code>conjunction<></code>, <code>disjunction<></code>, and <code>negation<></code>
</ul>
</section>
<section>
<h1>🐞 Bug fixes 🐞</h1>
<br>
<p><small>New bugs? 🐜</small></p>
</section>
</section>
<section>
<section><h1>Structured binding</h1></section>
<section>
<p>Do you do this often?</p>
<pre><code class="c++" data-trim>
void g(T t) {
auto x = t.x;
auto y = t.y;
auto z = t.z;
// ...
}
</code></pre>
<aside class="notes">The destructuring problem: how do we assign convenient names to the components of a tuple-like struct?</aside>
</section>
<section>
<p>How about this?</p>
<pre><code class="c++" data-trim>
void g(T& t) {
auto& x = t.x;
auto& y = t.y;
auto& z = t.z;
// ...
}
</code></pre>
<aside class="notes">We may want those names to have reference semantics instead of value semantics, too!</aside>
</section>
<section>
<p>Ain't this beautiful?</p>
<pre><code class="c++" data-noescape data-trim>
std::tuple<T1, T2, T3> f();
T1 x; T2 y; T3 z;
std::tie(x, y, z) = f();
</code></pre>
<aside class="notes">Before C++17, the only way to do destructuring is with std::tie()
Problems with this:
The variables need to be separately declared before they are std::tie()’d.
</aside>
</section>
<section>
<p>Oops-prone...</p>
<pre><code class="c++" data-noescape data-trim>
std::tuple<T1, T2, T3> f();
int x; T2 y; T3 z;
std::tie(y, y, z) = f();
</code></pre>
<aside class="notes">More problems:
If the variables are PODs, they may be uninitialized.
Note the bug in the std::tie() call here – we’ve passed y twice!
We’ll get no error for this, and x will be left uninitialized</aside>
</section>
<section>
<p>What about:</p>
<ul>
<li>Non-default-constructible types
<li>Types we don't want to initialize (expensive?)
<li><code>const</code>
<li>Types with reference members
</ul>
</section>
<section>
<pre><code class="c++" data-noescape data-trim>
std::array<T, 3> f();
T x, y, z;
std::tie(x, y, z) = f(); // INVALID.
</code></pre>
<p style="font-size:300%">😕</p>
</section>
<section>
<pre><code class="c++" data-trim>
struct S { T1 x; T2 y; T3 z; };
S f();
T1 x; T2 y; T3 z;
std::tie(x, y, z) = f(); // INVALID.
</code></pre>
<p style="font-size:300%">🤔</p>
</section>
<section>
<pre><code class="c++" data-trim>
auto [x, y, z] = obj;
</code></pre>
<p style="font-size:300%">😁</p>
</section>
<section style="font-size:80%">
<p>The type of <code>obj</code> must be <em>Destructurable</em>:</p>
<ul>
<li>Either all non-static data members:
<ul>
<li>Must be public
<li>Must be direct members of the type or members of the same public base class of the type
<li>Cannot be anonymous unions
</ul>
<li>Or the type has:
<ul>
<li>An <code>obj.get<>()</code> method or an ADL-able <code>get<>(obj)</code> overload
<li>Specializations of <code>std::tuple_size<></code> and <code>std::tuple_element<></code>
</ul>
</ul>
<aside class="notes">STL destructurable types: array, tuple, pair.</aside>
</section>
<section><iframe src="https://godbolt.org/g/OE63nN" class="stretch"></iframe></section>
<section><iframe src="https://godbolt.org/g/xuhEVw" class="stretch"></iframe></section>
<section><iframe src="https://godbolt.org/g/l1hgnp" class="stretch"></iframe></section>
</section>
<section>
<section><img src="ctad.png" class="stretch" style="border:none;background:none;box-shadow:none"></section>
<section>
<p>Why won't the compiler just figure it out for me?</p>
<pre><code class="c++" data-noescape data-trim>
std::tuple<int, double> t(-42, 3.14);
return std::tuple<int, double>(-42, 3.14);
</code></pre>
<pre><code class="c++" data-noescape data-trim>
auto t = std::make_tuple(-42, 3.14);
return std::make_tuple(-42, 3.14);
</code></pre>
<p>Any why <code>make_*</code> <em>all</em> the things?</p>
</section>
<section><iframe src="https://godbolt.org/g/jGyzz2" class="stretch"></iframe></section>
<section>
<h2>How does it work?</h2>
<ul>
<li>Simple declarations of variables (or variable templates) that are also
definitions whose declarator is a noptr-declarator (i.e. not when
declaring functions, template parameters, function parameters,
non-static data members, pointers, references etc.), and
<li>Explicit type conversion (functional notation)
</ul>
</section>
<!-- FIXME I'm told this slide is wrong https://www.reddit.com/r/cpp/comments/5p0pkb/presentation_whats_in_c17/dcormnj/
<section>
<p>Translated to English (when C++ is ≲ English):</p>
<pre><code class="c++" data-noescape data-trim>
template<class ... Ts> struct X { X(Ts...) };
X x1{1}; // OK X<int>
X x11; // OK X<>
template<class T> X xv{(T*)0}; // OK decltype(xv<int>) == X<int*>
extern X x2; // NOT OK, needs to be a definition
X arr[10]; // OK X<>
X x1{1}, x2{2}; // OK, deduced to the same type X<int>
X *pointer = 0; // NOT OK
X &&reference = X<int>{1};
X function(); // NOT OK
</code></pre>
</section>
-->
</section>
<section>
<section><h1><code>if constexpr</code></h1></section>
<section>
<p>Template code is often specialized for the zero- and one-parameter case.</p>
<pre><code class="c++" data-noescape data-trim>
void g() { /* Zero parameters. */ }
template<typename T>
void g(T&& t) { /* Handle one T. */ }
template<typename T, typename... Rest>
void g(T&& t, Rest&&... r) {
g(std::forward<>(t)); // One T.
g(std::forward<Rest>(r)...); // And then the Rest, recursively.
}
</code></pre>
</section>
<section><iframe src="https://godbolt.org/g/S4JVax" class="stretch"></iframe></section>
<section>
<pre><code class="c++" data-trim>
if constexpr (cond1)
statement1;
else if constexpr (cond2)
statement2;
else
statement3;
</code></pre>
</section>
<section>
<h2>Consider this</h2>
<pre><code class="c++" data-noescape data-trim>
template<typename T, typename... Args>
std::unique_ptr<T> make_unique(Args&&... a);
</code></pre>
</section>
<section>
<pre><code class="c++" data-noescape data-trim>
template<typename T, typename... Args>
std::enable_if_t<
std::is_constructible_v<T, Args...>, std::unique_ptr<T>
>
make_unique(Args&&... a) {
return std::unique_ptr(new T(std::forward<Args>(a)...));
}
template<typename T, typename... Args>
std::enable_if_t<
!std::is_constructible_v<T, Args...>, std::unique_ptr<T>
>
make_unique(Args&&... a) {
return std::unique_ptr(new T{std::forward<Args>(a)...});
}
</code></pre>
<p>😵</p>
</section>
<section><iframe src="https://godbolt.org/g/IKlFO1" class="stretch"></iframe></section>
<section><iframe src="https://godbolt.org/g/8fN3Aa" class="stretch"></iframe></section>
</section>
<section>
<section><h1>Folding expressions</h1></section>
<section>
<p>Similar to <code>if constexpr</code>, template code often repeats <em>what</em> to do, or is expressed in terms of recursion.</p>
<pre><code class="c++" data-noescape data-trim>
auto sum() { return 0; }
template <typename T>
auto sum(T&& t) { return t; }
template <typename T, typename... Rest>
auto sum(T&& t, Rest&&... r) {
return t + sum(std::forward<Rest>(r)...);
}
</code></pre>
</section>
<section><iframe src="https://godbolt.org/g/FGWVIb" class="stretch"></iframe></section>
<section>
<h2>🌀 Will it fold? 🌀</h2>
<table style="font-size:60%">
<tr><td>Unary Right</td><td><code>(E op ...)</code></td><td>≣</td><td><code>E<sub>1</sub> op (... op (E<sub>N-1</sub> op E<sub>N</sub>))</code></td></tr>
<tr><td>Unary Left</td><td><code>(... op E)</code></td><td>≣</td><td><code>((E<sub>1</sub> op E<sub>2</sub>) op ...) op E<sub>N</sub></code></td></tr>
<tr><td>Binary Right</td><td><code>(E op ... op I)</code></td><td>≣</td><td><code>E<sub>1</sub> op (... op (E<sub>N-1</sub> op (E<sub>N</sub> op I)))</code></td></tr>
<tr><td>Binary Left</td><td><code>(I op ... op E)</code></td><td>≣</td><td><code>(((I op E<sub>1</sub>) op E<sub>2</sub>) op ...) op E<sub>N</sub></code></td></tr>
</table>
</section>
<section>
<h2>All binary operators are foldable</h2>
<pre><code class="c++" data-noescape>
== != < > <= >= && || , .* ->* =
+ - * / % ^ & | << >>
+= -= *= /= %= ^= &= |= <<= >>=
</code></pre>
<p><small>A gentleperson-programmer is someone who knows this fact but chooses not to exercise it. Especially when combined with operator overloading.</small></p>
</section>
<section>
<h2>Unary fold expressions</h2>
<p>If the parameter pack is empty then the value of the fold is:
<table>
<tr><td><code>&&</code></td><td>≣</td><td><code>true</code></tr>
<tr><td><code>||</code></td><td>≣</td><td><code>false</code></tr>
<tr><td><code>,</code> </td><td>≣</td><td><code>void()</code></tr>
</table>
<p>For any operator not listed above, an unary fold expression with an empty parameter pack is ill-formed.</p>
</section>
</section>
<section>
<section><h1><code>template <auto></code></h1></section>
<section>
<pre><code class="c++" data-noescape data-trim>
template <typename T, T v>
struct integral_constant {
static constexpr T value = v;
};
void f() { }
auto w = integral_constant<int, 2048>;
auto x = integral_constant<char, 'a'>;
auto y = integral_constant<bool, true>;
auto z = integral_constant<decltype(f), f>;
</code></pre>
<p>🙄 so much repetition</p>
</section>
<section>
<pre><code class="c++" data-noescape data-trim>
template <typename T, T... Elements>
struct integer_sequence { };
auto seq0 = integer_sequence<std::size_t, 0, 1, 2>;
auto seq1 = integer_sequence<char, 'h', 'i'>;
</code></pre>
<p>🙄 so much repetition</p>
</section>
<section><iframe src="https://godbolt.org/g/0X1aB8" class="stretch"></iframe></section>
</section>
<section>
<section><h1><code>if (init; cond)</code></h1><p>and <code>switch (init; cond)</code></p></section>
<section><iframe src="https://godbolt.org/g/vZZrsw" class="stretch"></iframe></section>
</section>
<section>
<section>
<h2><code><filesystem></code></h2>
<pre><code class="c++" data-trim>namespace fs = std::filesystem;</code></pre>
</section>
<section>
<ul>
<li>Based on <code>boost.filesystem</code>
<li>Somewhat POSIX
<li>ToCToU races included 😫 <sup><a href="https://www.google.com/#q=toctou+posix">(wat dat?)</a>
<li>Non-member functions taking paths
<ul>
<li><code>fs::path</code>
<li><code>fs::directory_entry</code>
<li><code>fs::directory_iterator</code>
<li><code>fs::file_status</code>
</ul>
</ul>
</section>
<section><iframe src="https://godbolt.org/g/OuhmjZ" class="stretch"></iframe></section>
<section>
<p>Exception versus error-code: why not both? 🤷</p>
<ul>
<li><code>void copy(fs::path const& from, fs::path& to);</code>
<li><code>void copy(fs::path const& from, fs::path& to, std::error_code& ec);</code>
</ul>
</section>
</section>
<section>
<section><h2><code>std::string_view</code></h2></section>
<section>
<p>A better <code>const char*</code></p>
<ul>
<li>Similar to <code>std::string</code> API
<li>Non-owning pointer + length
<li>No allocation
<li>Value semantics
<li>Can't modify contents
</ul>
</section>
<section><iframe src="https://godbolt.org/g/uV203U" class="stretch"></iframe></section>
</section>
<section>
<section><h2><code>std::optional<></code></h2></section>
<section>
<ul>
<li>Nullable object wrapper
<li>No allocation
<li>Value semantics
<li>Pointer-like API
</ul>
</section>
<section><iframe src="https://godbolt.org/g/Vj4a5D" class="stretch"></iframe></section>
</section>
<section>
<section><h2><code>std::variant<></code></h2></code></section>
<section>
<ul>
<li>Discriminate union
<li>No allocation
<li>Value semantics
<li>Visitor-style access
</ul>
</section>
<section><iframe src="https://godbolt.org/g/Asw9Xy" class="stretch"></iframe></section>
</section>
<section>
<section><h1>Parallel Algorithms</h1></section>
<section>
<p>Many STL algorithms, with parallel / vector</p>
<pre><code class="c++" data-trim>
std::for_each(std::par, first, last,
[](auto& x){ process(x); }
);
std::copy(std::par, first, last);
std::sort(std::par, first, last);
std::transform(std::par_unseq, xfirst, xlast, yfirst,
[=](double xi, double yi){ return a * xi + yi; }
);
</code></pre>
</section>
<section>
<code>
<table style="font-size:40%">
<tr><td>adjacent_difference </td><td>is_heap_until </td><td>replace_copy_if </td></tr>
<tr><td>adjacent_find </td><td>is_partitioned </td><td>replace_if </td></tr>
<tr><td>all_of </td><td>is_sorted </td><td>reverse </td></tr>
<tr><td>any_of </td><td>is_sorted_until </td><td>reverse_copy </td></tr>
<tr><td>copy </td><td>lexicographical_compare </td><td>rotate </td></tr>
<tr><td>copy_if </td><td>max_element </td><td>rotate_copy </td></tr>
<tr><td>copy_n </td><td>merge </td><td>search </td></tr>
<tr><td>count </td><td>min_element </td><td>search_n </td></tr>
<tr><td>count_if </td><td>minmax_element </td><td>set_difference </td></tr>
<tr><td>equal </td><td>mismatch </td><td>set_intersection </td></tr>
<tr><td>fill </td><td>move </td><td>set_symmetric_difference </td></tr>
<tr><td>fill_n </td><td>none_of </td><td>set_union </td></tr>
<tr><td>find </td><td>nth_element </td><td>sort </td></tr>
<tr><td>find_end </td><td>partial_sort </td><td>stable_partition </td></tr>
<tr><td>find_first_of </td><td>partial_sort_copy </td><td>stable_sort </td></tr>
<tr><td>find_if </td><td>partition </td><td>swap_ranges </td></tr>
<tr><td>find_if_not </td><td>partition_copy </td><td>transform </td></tr>
<tr><td>generate </td><td>remove </td><td>uninitialized_copy </td></tr>
<tr><td>generate_n </td><td>remove_copy </td><td>uninitialized_copy_n </td></tr>
<tr><td>includes </td><td>remove_copy_if </td><td>uninitialized_fill </td></tr>
<tr><td>inner_product </td><td>remove_if </td><td>uninitialized_fill_n </td></tr>
<tr><td>inplace_merge </td><td>replace </td><td>unique </td></tr>
<tr><td>is_heap </td><td>replace_copy </td><td>unique_copy </td></tr>
</table>
</code>
</section>
<section>
<h2>Execution policies</h2>
<table style="font-size:80%">
<tr><td><code>std::seq</code></td><td>indeterminately sequenced in the calling thread</td></tr>
<tr><td><code>std::par</code></td><td>indeterminately sequenced with respect to each other within the same thread</td></tr>
<tr><td><code>std::par_unseq</code></td><td>unsequenced with respect to each other and possibly interleaved</td></tr>
</table>
<aside class="notes">"Executors" will expand execution policies</aside>
</section>
<section>
<p>See <a href="https://www.youtube.com/watch?v=6Z3_qaFYF84">Hartmut Kaiser's CppCon talk</a>!<small>(<a href="https://github.com/CppCon/CppCon2016/blob/master/Presentations/Parallelism%20in%20Modern%20C++/Parallelism%20in%20Modern%20C++%20-%20Hartmut%20Kaiser%20-%20CppCon%202016.pdf">slides</a>)</small></p>
<p><small>He dives deep into C++ parallel algorithms, their performance, and where he thinks they'll go. Especially cool: parallel algorithms combined with <code>auto</code>-lambda, SIMD, executors, and coroutines.</small></p>
<p><small><code>mind == 💥💥💥</code></small></p>
</section>
</section>
<section>
<section>
<h1>What's in it?</h1>
<p>Here's what we covered</p>
</section>
<section>
<h1>Language</h1>
<ul style="font-size:60%;list-style:none;">
<li>☑ Structured bindings
<li>☑ <code>if constexpr</code>
<li>☐ <code>constexpr</code> lambdas
<li>☐ Inline variables
<li>☑ Folding expressions
<li>☑ <code>template <auto></code>
<li>☑ Constructor template argument deduction
<li>☐ Guaranteed copy elision
<li>☐ <code>noexcept</code> added to the type system
<li>☑ <code>if (init; cond)</code> and <code>switch (init; cond)</code>
<li>☐ <code>namespace A::B::C {}</code>
<li>☐ Single-parameter <code>static_assert()</code>
<li>☐ <code>__has_include()</code>
</ul>
</section>
<section>
<h1>Library</h1>
<ul style="font-size:60%;list-style:none;">
<li>☑ <code><filesystem></code>
<li>☐ <code><memory_resource></code>
<li>☑ <code>string_view</code>
<li>☑ <code>optional<></code>
<li>☑ <code>variant<></code>
<li>☐ <code>any</code>
<li>☑ Parallel algorithms
<li>☐ Aligned <code>new</code>
<li>☐ <code>shared_mutex</code> and variadic <code>lock_guard<></code>
<li>☐ Math special functions
<li>☐ <code>invoke()</code>, <code>apply()</code>, and <code>is_callable<></code>
<li>☐ <code>*_v<></code> variable templates for type traits
<li>☐ <code>conjunction<></code>, <code>disjunction<></code>, and <code>negation<></code>
</ul>
</section>
<section><h2>More we didn't talk about...</h2></section>
<section>
<h1>Language</h1>
<ul style="font-size:50%">
<li>C99 base → C11 base
<li>Specified expression evaluation order
<li>Forward progress guarantees
<li>Attributes on namespaces and enums
<li><code>[[fallthrough]]</code>, <code>[[nodiscard]]</code>, and <code>[[maybe_unused]]</code>
<li>UTF-8 character
<li>Hexadecimal floating point literals
<li>Generalized range-based <code>for</code>
<li>Lambda capture of <code>*this</code> by value
<li><code>auto a{b};</code> will not initialize <code>initializer_list<></code>
<li>Removed trigraphs, <code>operator++(bool)</code>, and <code>register</code>
</ul>
</section>
<section>
<h1>Library</h1>
<ul style="font-size:50%">
<li><code>destroy_*()</code> and new <code>uninitialized_*()</code> utilities
<li>Splicing and improved insertion for associative containers
<li><code>.is_always_lockfree()</code>
<li><code>hardware_*_interference_size</code>
<li><code>uncaught_exceptions()</code>
<li>Improved conversions in <code>unique_ptr<></code>
<li><code>owner_less<:void></code>
<li><code>noexcept</code> cleanup for allocators and containers
<li>ContiguousIterator concept
<li><code>as_const()</code>, <code>clamp()</code>, <code>sample()</code>, <code>search()</code>, and searchers
<li>non-<code>const string::data()</code>
<li>Incomplete type support for <code>vector<></code> and <code>lists</code>
<li>Non-member <code>size()</code>, <code>empty()</code>, and <code>data()</code>
<li><code>void_t<></code> and <code>bool_constant<></code>
<li><code>floor()</code>, <code>ceil()</code>, <code>round()</code>, and <code>abs()</code> for <code><chrono></code> types
<li>Removed <code>auto_ptr<></code> and <code>random_shuffle()</code>
<li>Removed C++98 function objects and binders
</ul>
</section>
</section>
<section>
<h1>🎊 C++17 🎉</h1>
<br>
<p>Now compiling in toolchains near you!</p>
<br>
<p>These slides:</p>
<p><a href="https://github.com/jfbastien/what-is-cpp17">github.com/jfbastien/what-is-cpp17</a></p>
</section>
</div>
</div>
<script src="lib/js/head.min.js"></script>
<script src="js/reveal.js"></script>
<script>
// More info https://github.com/hakimel/reveal.js#configuration
Reveal.initialize({
controls: true, // Display controls in the bottom right corner
progress: true, // Display a presentation progress bar
history: true, // Push each slide change to the browser history
keyboard: true, // Enable keyboard shortcuts for navigation
overview: true, // Enable the slide overview mode
center: true, // Vertical centering of slides
touch: true,
loop: false,
rtl: false,
shuffle: false,
fragments: true, // Turns fragments on and off globally
help: true, // Flags if we should show a help overlay when the questionmark key is pressed
showNotes: false, // Flags if speaker notes should be visible to all viewers
autoSlide: 0,
autoSlideStoppable: true, // Stop auto-sliding after user input
autoSlideMethod: Reveal.navigateNext,
mouseWheel: false,
hideAddressBar: true,
previewLinks: false, // Opens links in an iframe preview overlay
transition: 'default', // none/fade/slide/convex/concave/zoom
transitionSpeed: 'default', // default/fast/slow
backgroundTransition: 'default', // none/fade/slide/convex/concave/zoom
viewDistance: 3, // Number of slides away from the current that are visible
//parallaxBackgroundImage: 'bg.jpg',
//parallaxBackgroundSize: '2559px 1510px', // CSS syntax, e.g. "2100px 900px"
// Number of pixels to move the parallax background per slide
// - Calculated automatically unless specified
// - Set to 0 to disable movement along an axis
parallaxBackgroundHorizontal: null,
parallaxBackgroundVertical: null,
// More info https://github.com/hakimel/reveal.js#dependencies
dependencies: [
{ src: 'plugin/markdown/marked.js' },
{ src: 'plugin/markdown/markdown.js' },
{ src: 'plugin/notes/notes.js', async: true },
{ src: 'plugin/highlight/highlight.js', async: true, callback: function() { hljs.initHighlightingOnLoad(); } }
]
});
</script>
</body>
</html>