STL Pocket Reference: Containers, Iterators, and Algorithms

by Ray Lischner

Overview

The STL Pocket Reference describes the functions, classes, and templates in that part of the C++ standard library often referred to as the Standard Template Library (STL). The STL encompasses containers, iterators, algorithms, and function objects, which collectively represent one of the most important and widely used subsets of standard library functionality.The C++ standard library, even the subset known as the STL, is vast. It's next to impossible to work with the STL without some sort of reference at your side to remind you of template parameters, function invocations, return types--indeed, the entire myriad of details you need to know in order to use the STL effectively and get work done. You need a memory-aid.Books that cover the standard library and the STL tend to be quite heavy and large, describing each aspect of the STL in detail. Such books are great when you're not familiar with the library, but get in the way when you simply need to remind yourself of a function name, or the order in which you pass arguments to a function. Programmers familiar with the STL need a small, lightweight memory-aid. That's what the STL Pocket Reference is. It's small, lightweight, and chock-full of information that you can take in at a glance, so you can get on with your work.

Product Details

ISBN-13:	9781491947531
Publisher:	O'Reilly Media, Incorporated
Publication date:	10/15/2003
Series:	Pocket Reference (O'Reilly)
Sold by:	Barnes & Noble
Format:	eBook
Pages:	130
File size:	1 MB

About the Author

Ray Lischner began his career as a software developer, but dropped out of the corporate rat race to become an author. He started using C++ in the late 1980s, working at a company that was rewriting its entire product line in C++. Over the years, he has witnessed the evolution of C++ from cfront to native compilers to integrated development environments to visual, component-based tools. Ray has taught C++ at Oregon State University. He is the author of Delphi in a Nutshell and O'Reilly's upcoming C++ in a Nutshell, as well as other books.

Table of Contents

	Introduction	1
	Containers	3
	Standard Containers	4
	Container Adapters	6
	Values	6
	Common Members	7
	Exceptions	16
	Deques	17
	Lists	18
	Maps	20
	Priority Queues	22
	Queues	23
	Sets	24
	Stacks	25
	Strings	26
	Vectors	38
	Iterators	39
	Iterator Categories	40
	Using Iterators	41
	Iterator Traits	43
	@const_iterators	45
	Insertion Iterators	46
	I/O Stream Iterators	47
	Raw Storage Iterator	53
	Reverse Iterators	54
	Iterator Function Templates	58
	Algorithms	59
	Nonmodifying Operations	61
	Comparison	61
	Searching	63
	Binary Search	65
	Modifying Sequence Operations	66
	Uninitialized Sequence Operations	71
	Sorting	72
	Merging	74
	Set Operations	74
	Heap Operations	76
	Permutations	78
	Miscellaneous	78
	Numerics	79
	Function Objects	80
	Using Functors	80
	Functor Foundations	82
	Adapters	83
	Binders	86
	Arithmetic and Logical Functors	87
	Comparison Functors	88
	Miscellaneous	89
	Allocators	89
	Bitset	92
	Pairs	95
	Smart Pointer	96
	Boost	98
	Arrays	99
	Dynamic Bitsets	100
	Binders	100
	Composition	102
	Adapters	103
	Functional Header Replacement	103
	Lambda Functions	104
	Smart Pointers	104
	Index	107