-
Notifications
You must be signed in to change notification settings - Fork 0
/
template.html
534 lines (449 loc) · 15.1 KB
/
template.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
<!--
Google IO 2012/2013 HTML5 Slide Template
Authors: Eric Bidelman <[email protected]>
Luke Mahé <[email protected]>
URL: https://code.google.com/p/io-2012-slides
-->
<!DOCTYPE html>
<html>
<head>
<title></title>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="chrome=1">
<!--<meta name="viewport" content="width=device-width, initial-scale=1.0, minimum-scale=1.0">-->
<!--<meta name="viewport" content="width=device-width, initial-scale=1.0">-->
<!--This one seems to work all the time, but really small on ipad-->
<!--<meta name="viewport" content="initial-scale=0.4">-->
<meta name="apple-mobile-web-app-capable" content="yes">
<link rel="stylesheet" media="all" href="theme/css/default.css">
<link rel="stylesheet" media="only screen and (max-device-width: 480px)" href="theme/css/phone.css">
<base target="_blank"> <!-- This amazingness opens all links in a new tab. -->
<script data-main="js/slides" src="js/require-1.0.8.min.js"></script>
</head>
<body style="opacity: 0">
<slides class="layout-widescreen">
<slide>
<hgroup>
<h2>Overview</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>C++ editions (pre-standard, C++98, C++11, C++14)
<li>Standard Library (smart pointers, containers, iterators, algorithms)</li>
<li>Basic Language (classes, destructors, copying, virtual functions, namespaces)</li>
<li>Advanced Language Features (templates, lambdas)
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Editions: Pre Standard</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>1979 to 1998</li>
<li>Unity and to some degree Unity Connection</li>
<li>C with Objects.</li>
<li>No standard library.</li>
<li>Limited support for templates.</li>
<li>Language not standardized, so must be careful switchign compilers.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Editions: C++98</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>1998 to 2010</li>
<li>Standard library with strings, collections, algorithms.</li>
<li>Boost created to extend standard library.</li>
<li>Better template support. Most of standard library written in templates.</li>
<li>Namespacing support</li>
<li>Limited support for templates.</li>
<li>Compilers (today) have excellent support for C++98 features.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Editions: C++2011</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>Originally called C++0x</li>
<li>Support added incrementally GCC 4.3 through GCC 4.8</li>
<li>Double the size of standard library</li>
<li>Added smart pointers, hash tables, threads, regex</li>
<li>Incorporated best parts of Boost directly in standard</li>
<li>Added lambas/closures making C++ more functional</li>
<li>Added for each loop.</li>
<li>Many improvements, convenience features</li>
<li><a href="http://en.wikipedia.org/wiki/C%2B%2B11">C++11 wiki page</a></li>
<li>Latest compilers have good support, but not as universal as C++98.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Editions: C++201y</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>Fleshing out some featurs from 2011 (better lambdas)</li>
<li>Scheduled for release in 2014</li>
<li>Very latest compilers have experimental support</li>
<li>Scheduled for release 2014</li>
<li>Not recommended for shipping products yet.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Standard Library</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>Standard library makes it unnecessary to do manual memory management.</li>
<li>Smart pointers for automatically managing memory</li>
<li>Collections (vector, map, unordered_map) for managing collecitons</li>
<li>Iterators provide uniform interface over different types of collections.</li>
<li>Algorithms that work with different collections (std::sort)</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Standard Library: Don't manage memory manually!</h2>
</hgroup>
<br/>
These functions are all unecessary in C++! Also, exceptions make
them risky to use (may cause memory leaks).
<br/><br/>
<article class="">
<ul>
<li>malloc</li>
<li>free</li>
<li>new</li>
<li>delete</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>Exceptions break manual resource managment</h2>
</hgroup>
<article class="smaller">
Bad!
<pre class="prettyprint" data-lang="c++">
MyClass* obj_ptr = new MyClass();
this_function_may_throw();
delete obj_ptr; // May not get executed!
</pre>
Good!
<pre class="prettyprint" data-lang="c++">
std::shared_ptr<MyClass> obj_ptr = std::make_shared<MyClass>();
this_function_may_throw();
// No need to manually delete!
// shared_ptr does reference counting for you.
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Standard Library: shared_ptr</h2>
</hgroup>
<article class="">
<ul>
<li>Reference counting smart pointer</li>
<li>Means you <em>never</em> need new/delete</li>
<li>Available from boost</li>
<li>Built into standard library in C++11</li>
<li>Some C++98 compilers also have it available as part of TR1</li>
<li>Referencing counting so cycles are possible</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Standard Library: Collections</h2>
</hgroup>
<article class="">
<ul>
<li>std::vector (dynamic replacement for arrays).</li>
<li>std::map (key value pairs stored in binary tree)</li>
<li>std::unordered_map (key value pairs stored in hash table)</li>
<li>Several others (single and double linked lists, deques, sets)</li>
<li>Collections contain by value. If you want by reference, use a collection of shared_ptr's</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>std::vector</h2>
</hgroup>
<article class="smaller">
<pre class="prettyprint" data-lang="c++">
// vectors should always be used instead of C arrays.
std::vector<int> vec = {1, 3, 4, 5}; // C++11 initializer syntax.
vec.push_back(6); // This copies the 6.
std::cout << vec[0] << std::endl;
// Can pass a vector to legacy API that expect C array by
// passing pointer to first element.
legacy_function(&vec[0]);
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>std::unordered_map</h2>
</hgroup>
<article class="smaller">
C++11 hash table. In C++98 you can use the binary tree std::map,
which is similar.
<pre class="prettyprint" data-lang="c++">
std::unordered_map<std::string, int> months = {
{"may", 31},
{"june", 30}
};
// Convenience read/assignment syntax.
// Note that the object gets default constructed, and then assigned.
months["january"] = 31;
months["february"] = 28;
// More efficient syntax for getting/inserting new elements
std::cout << months.find("may") << std::endl;
// The object gets directly constructed with the correct initial value.
monts.insert(std::pair<std::string, int>("november", 30);
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>std::map vs std::unordered_map</h2>
</hgroup>
<article class="">
<ul>
<li>Map is binary tree, wheras unordered_map is a hash table</li>
<li>map keys must have a < operator.</li>
<li>unordered_map keys need a hash function</li>
<li>map keys can be iterated in order, unordered_map keys cannot</li>
<li>unorderd_map is theoretically faster.</li>
<li>std::map is in C++98. unordered map is in Boost and C++11.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>Objects in collections must be copyable</h2>
</hgroup>
<article class="smaller">
By default values are copied into collections. If an object is
not copyable, and you want to use it in a collection, use a
collection of shared_ptrs. Don't use raw pointers, as that risks
memory leaks
<pre class="prettyprint" data-lang="c++">
// Note the space between > and > is needed in C++98, but not C++11.
std::vector<std::shared_ptr<MyClass> > vec;
vec.push_back(std::make_shared<MyClass>());
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>All objects can be iterated over the in same way</h2>
</hgroup>
<article class="smaller">
Iterators look syntactically the same as pointers.
<pre class="prettyprint" data-lang="c++">
std::list<int> lst = {1,2,3,4};
// Verbose C++98 syntax. Works in all compilers.
// Note that ++iter is faster than iter++.
for (std::list<int>::iterator iter = lst.begin();
iter != lst.end();
++iter) {
std::cout << *iter;
}
// Using C++11 auto keyword to automatically determine iterator type.
// Needs GCC 4.4.
for (auto iter = lst.begin(); iter != lst.end(); ++iter) {
std::cout << *iter;
}
// Using C++11 for each loop. This loop is syntactic suger for using
// an iterator. Needs GCC 4.6.
for (auto& elem: lst) {
std::cout << elem;
}
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>Algorithms</h2>
</hgroup>
<article class="">
<ul>
<li>C++ comes with common algorithms like sort, find, rotate.</li>
<li>Common point of confusion: They are not member
functions. Rather, template functions in std namespace</li>
<li>C++ algorithms use the iterator interface so they are not
tied to a particular collection</li>
<li>Some iterators are more powerful than others (see iterator
categories), so your collection must support he proper
category of iterator for a given algorithm</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>C++ Standard library comes with algorithms</h2>
</hgroup>
<article class="smaller">
<pre class="prettyprint" data-lang="c++">
std::vec<int> lst = {4, 2, 1, 8};
// Sort the vector.
std::sort(vec.begin(), vec.end());
// Find first even number.
// Note use of C++11 lambda. In C++98 you must pass in a function instead.
auto iter = std::find_if(vec.begin(), vec.end(), [](int x) {
return x % 2 == 0;
});
// Check if even number found and print it.
if (iter != vec.end()) {
std::cout << *iter;
}
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>Basic Language</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>References</li>
<li>Returning By Value. (RVO optimization)</li>
<li>Destructors (RAII patterns).</li>
<li>Value types (copying)</li>
<li>Polymorphic type (Use virtual functions, non-copyable).</li>
<li>Namespace (named and anonymous namespaces).
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>References Vs Pointers</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>A reference is another name for an existing variables. An alias.</li>
<li>Pointers are a variable that holds the address of another variable</li>
<li>References are not a kind of pointer.</li>
<li>A reference should be used in the same way as the original variable.</li>
<li>A reference cannot be pointed at something different.</li>
<li>Meaningless to have a reference to a reference.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>Reference Examples</h2>
</hgroup>
<article class="smaller">
<pre class="prettyprint" data-lang="c++">
int x = 1;
int& y = x;
y = 2; // Same as saying x = 2.
// x and y are different names for the same variable! Y usually doesnt
// take up stack space at compile time.
// Possible to make reference const, so that
const z& = x;
// This won't compile
z = 3;
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>Reference Parameter Examples</h2>
</hgroup>
<article class="smaller">
<pre class="prettyprint" data-lang="c++">
// References can be used to pass objects you don't want to copy.
// Prefer passing objects by reference to passing them by pointer.
void func(const MyClass& my_obj) {
std::cout << my_obj.to_string();
}
MyClass obj;
func(obj);
// The implementation may or may not use a pointer "under the hood"
// to pass the parameter.
// It may also inline the function, and treat my_obj and obj as the
// same variable.
</pre>
</article>
</slide>
<slide>
<hgroup>
<h2>Return by Value</h2>
</hgroup>
<article class="flexbox vcenter">
<ul>
<li>In C and early C++, "out parameters" were used heavily.</li>
<li>C++98 is optimized to make returning by value efficient in most cases</li>
<li>C++11 is further optimized to fix some edge cases</li>
<li>GCC in particular has the std::string class use Copy On Write to make
returning by value faster</li>
<li>In cases where you are still worried, return a smart pointer.</li>
</ul>
</article>
</slide>
<slide>
<hgroup>
<h2>Return by value example</h2>
</hgroup>
<article class="smaller">
<pre class="prettyprint" data-lang="c++">
//Best c++ approach.
// Named return value.
std::vector<int> make_vec() {
std::vector<int> vec;
vec.push_back(1);
vec.push_back(2);
/// etc...
// Always return same object to help optimizations.
return vec;
}
// This is efficient at least when compiler optimizations are turned on.
// In C++11, efficient even when turned off.
auto result = make_vec();
</pre>
</article>
</slide>
<slide class="title-slide segue nobackground">
<aside class="gdbar"><img src="images/google_developers_icon_128.png"></aside>
<!-- The content of this hgroup is replaced programmatically through the slide_config.json. -->
<hgroup class="auto-fadein">
<h1 data-config-title><!-- populated from slide_config.json --></h1>
<h2 data-config-subtitle><!-- populated from slide_config.json --></h2>
<p data-config-presenter><!-- populated from slide_config.json --></p>
</hgroup>
</slide>
<slide class="backdrop"></slide>
</slides>
<script>
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-XXXXXXXX-1']);
_gaq.push(['_trackPageview']);
(function() {
var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
})();
</script>
<!--[if IE]>
<script src="http://ajax.googleapis.com/ajax/libs/chrome-frame/1/CFInstall.min.js"></script>
<script>CFInstall.check({mode: 'overlay'});</script>
<![endif]-->
</body>
</html>