effectiveC++,moreeffectiveC++和effectivestl(*.pdf,*.chm)资源-CSDN文库

共275个文件

html：116个

png：75个

htm：61个

effectiveC++

5星 · 超过95%的资源需积分: 10 131 浏览量 2011-05-16 23:05:42 上传评论收藏 5.21MB RAR 举报

资源详情

资源评论

收起资源包目录

effective C++, more effective C++和effective stl(*.pdf,*.chm) （275个子文件）

Effective C++.chm 459KB

[More Effective C++][CH].chm 222KB

all.css 428B

all.css 367B

Thumbs.db 49KB

More Effective C++ (WQ版).doc 1.35MB

item_43.htm 20KB

intro.htm 18KB

item_34.htm 14KB

item_49.htm 13KB

item_10.htm 12KB

item_07.htm 12KB

item_39.htm 11KB

item_36.htm 11KB

item_33.htm 10KB

item_21.htm 10KB

item_35.htm 9KB

item_42.htm 8KB

item_14.htm 8KB

item_18.htm 8KB

item_23.htm 7KB

item_50.htm 7KB

item_29.htm 7KB

item_28.htm 7KB

item_19.htm 7KB

item_45.htm 7KB

item_47.htm 6KB

item_08.htm 6KB

item_41.htm 6KB

item_12.htm 6KB

item_24.htm 6KB

item_17.htm 6KB

item_16.htm 6KB

item_40.htm 6KB

item_25.htm 5KB

preface.htm 5KB

item_22.htm 5KB

item_46.htm 5KB

item_31.htm 5KB

item_15.htm 5KB

item_01.htm 5KB

item_11.htm 4KB

item_26.htm 4KB

item_02.htm 4KB

item_32.htm 4KB

item_38.htm 4KB

item_30.htm 4KB

item_37.htm 3KB

item_03.htm 3KB

chap_4.htm 3KB

item_13.htm 3KB

item_20.htm 3KB

item_05.htm 3KB

item_44.htm 3KB

chap_6.htm 2KB

item_09.htm 2KB

item_06.htm 2KB

item_27.htm 2KB

item_48.htm 2KB

item_04.htm 1KB

chap_2.htm 1KB

lostmouse.htm 1KB

chap_1.htm 1KB

chap_5.htm 1001B

chap_3.htm 774B

chap_7.htm 704B

cover.htm 568B

item_29.html 39KB

item_28.html 35KB

item_31.html 34KB

item_26.html 21KB

item_30.html 20KB

item_27.html 19KB

item_33.html 16KB

introduction.html 16KB

item_49.html 15KB

item_45.html 15KB

appendix_a.html 15KB

item_05.html 14KB

item_43.html 14KB

item_17.html 13KB

intro.html 13KB

item_10.html 12KB

item_24.html 12KB

item_35.html 12KB

item_10.html 11KB

item_12.html 11KB

bibliography.html 11KB

item_23.html 10KB

recommend.html 10KB

item_05.html 10KB

item_50.html 10KB

item_22.html 10KB

item_32.html 10KB

item_08.html 9KB

item_34.html 9KB

item_14.html 9KB

item_31.html 9KB

item_02.html 9KB

acknowledgments.html 9KB

共 275 条

Content

Containers ................................................................................................................... 1

Item 1. Choose your containers with care........................................................... 1

Item 2. Beware the illusion of container-independent code................................ 4

Item 3. Make copying cheap and correct for objects in containers..................... 9

Item 4. Call empty instead of checking size() against zero. ............................. 11

Item 5. Prefer range member functions to their single-element counterparts... 12

Item 6. Be alert for C++'s most vexing parse................................................... 20

Item 7. When using containers of newed pointers, remember to delete the

pointers before the container is destroyed. ........................................................... 22

Item 8. Never create containers of auto_ptrs. ................................................... 27

Item 9. Choose carefully among erasing options.............................................. 29

Item 10. Be aware of allocator conventions and restrictions. ......................... 34

Item 11. Understand the legitimate uses of custom allocators........................ 40

Item 12. Have realistic expectations about the thread safety of STL containers.

vector and string........................................................................................................ 48

Item 13. Prefer vector and string to dynamically allocated arrays.................. 48

Item 14. Use reserve to avoid unnecessary reallocations................................ 50

Item 15. Be aware of variations in string implementations. ........................... 52

Item 16. Know how to pass vector and string data to legacy APIs. ............... 57

Item 17. Use "the swap trick" to trim excess capacity.................................... 60

Item 18. Avoid using vector<bool>. ............................................................... 62

Associative Containers.............................................................................................. 65

Item 19. Understand the difference between equality and equivalence.......... 65

Item 20.

Specify comparison types for associative containers of pointers. .... 69

Item 21. Always have comparison functions return false for equal values. ... 73

Item 22. Avoid in-place key modification in set and multiset. ....................... 76

Item 23. Consider replacing associative containers with sorted vectors. ....... 81

Item 24. Choose carefully between map::operator[] and map-insert when

efficiency is important. ......................................................................................... 87

Item 25. Familiarize yourself with the nonstandard hashed containers.......... 91

Iterators ..................................................................................................................... 95

Item 26. Prefer iterator to const iterator, reverse_iterator, and

const_reverse_iterator. .......................................................................................... 95

Item 27. Use distance and advance to convert a container's const_iterators to

iterators. 98

Item 28. Understand how to use a reverse_iterator's base iterator................ 101

Item 29. Consider istreambuf_iterators for character-by-character input..... 103

Algorithms .............................................................................................................. 106

Item 30. Make sure destination ranges are big enough................................. 106

Item 31. Know your sorting options. ............................................................ 111

Item 32. Follow remove-like algorithms by erase if you really want to remove

something. 116

Item 33. Be wary of remove-like algorithms on containers of pointers. ...... 120

Item 34. Note which algorithms expect sorted ranges. ................................. 123

Item 35. Implement simple case-insensitive string comparisons via mismatch

or lexicographical compare................................................................................. 126

Item 36. Understand the proper implementation of copy_if......................... 130

Item 37. Use accumulate or for_each to summarize ranges. ........................ 132

Functors, Functor Classes, Functions, etc............................................................... 138

Item 38. Design functor classes for pass-by-value. ...................................... 138

Item 39. Make predicates pure functions. ..................................................... 141

Item 40.

Make functor classes adaptable. ..................................................... 144

Item 41. Understand the reasons for ptr_fun, mem_fun, and mem_fun_ref. 148

Item 42. Make sure less<T> means operator<.............................................. 151

Programming with the STL .................................................................................... 155

Item 43. Prefer algorithm calls to hand-written loops. ................................. 155

Item 44. Prefer member functions to algorithms with the same names........ 162

Item 45. Distinguish among count, find, binary search, lower_bound,

upper_bound, and equal_range. .......................................................................... 165

Item 46. Consider function objects instead of functions as algorithm

parameters. 173

Item 47. Avoid producing write-only code................................................... 177

Item 48. Always #include the proper headers............................................... 179

Item 49. Learn to decipher STL-related compiler diagnostics...................... 181

Item 50. Familiarize yourself with STL-related web sites............................ 187

iii

Containers

Sure, the STL has iterators, algorithms, and function objects, but for most C++

programmers, it's the containers that stand out. More powerful and flexible than arrays,

they grow (and often shrink) dynamically, manage their own memory, keep track of

how many objects they hold, bound the algorithmic complexity of the operations they

support, and much, much more. Their popularity is easy to understand. They're simply

better than their competition, regardless of whether that competition comes from

containers in other libraries or is a container type you'd write yourself. STL containers

aren't just good. They're really good.

This chapter is devoted to guidelines applicable to all the STL containers. Later

chapters focus on specific container types. The topics addressed here include selecting

the appropriate container given the constraints you face: avoiding the delusion that

code written for one container type is likely to work with other container types: the

significance of copying operations for objects in containers: difficulties that arise when

pointers of auto_ptrs are stored in containers: the ins and outs of erasing: what you can

and cannot accomplish with custom allocators: tips on how to maximize efficiency:

and considerations for using containers in a threaded environment.

That's a lot of ground to cover, but don't worry. The Items break it down into bite-

sized chunks, and along the way, you're almost sure to pick up several ideas you can

apply to your code now.

Item 1. Choose your containers with care.

You know that C++ puts a variety of containers at your disposal, but do you realize

just how varied that variety is? To make sure you haven't overlooked any of your

options, here's a quick review.

• The standard STL sequence containers, vector, string, deque, and list.

•

The standard STL associative containers, set, multiset, map and multimap.

• The nonstandard sequence containers slist and rope. slist is a singly linked

list, and rope is essentially a heavy-duty

string. (A "rope" is a heavy-duty "string."

Get it?) You'll find a brief overview of these nonstandard (but commonly

available) containers in Item 50.

• The nonstandard associative containers hash_set, hash_multiset, hash_map,

and hash_multimap. I examine these widely available hash-table-based variants

on the standard associative containers in Item 25.

•

vector<char> as a replacement for string. Item 13 describes the conditions

under which such a replacement might make sense.

评论收藏

内容反馈

LinEvan

2014-06-27

STL是网页版的，而且每次要一个网页一个网页打开好麻烦

effective C++, more effective C++和effective stl(.pdf,.chm)

评论1

最新资源

effective C++, more effective C++和effective stl(*.pdf,*.chm)

评论1

最新资源

相关推荐

more effective C++

Effective STL .chm

C++标准库(中、英文) Effective C++ 高质量C++

C++从入门到精通（笔者收集的十几本C++相关教程）

Effective STL.chm

more effectiveC++

C++effective 和C++more effective

effective C++.chm

effective c++及more effective c++(简体中文chm)

常用的6本c++超级经典书籍

c++超级经典书籍集合(6本书合集)

Effective C++ STL

c++超级经典书籍集合

C++ Perimer Effective

effectiveC++.chm

【中文】【pdf】【高清】more effective c++

effectiveC++.pdf

effective C++.chm 和 more effective C++.chm

stl标准库 C++ Standard Library（《C++标准库》中文资料为侯捷译）英文pdf&chm 中文pdf

C&amp;C++优秀书籍

C++ STL书籍集

c++收藏书籍集合

Effective STL 中文版.chm

effective C++, more effective C++和effective stl(.pdf,.chm)

C&C++优秀书籍