reklama - zainteresowany?

STL Pocket Reference. Containers, Iterators, and Algorithms - Helion

STL Pocket Reference. Containers, Iterators, and Algorithms
Autor: Ray Lischner
ISBN: 9781491947531
stron: 130, Format: ebook
Data wydania: 2003-10-15
Księgarnia: Helion

Cena książki: 29,67 zł (poprzednio: 34,50 zł)
Oszczędzasz: 14% (-4,83 zł)

Dodaj do koszyka STL Pocket Reference. Containers, Iterators, and Algorithms

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.

Dodaj do koszyka STL Pocket Reference. Containers, Iterators, and Algorithms

Spis treści

STL Pocket Reference. Containers, Iterators, and Algorithms eBook -- spis treści

  • STL: Pocket Reference
  • 1. STL Pocket Reference
    • Introduction
    • Conventions Used in This Book
    • Acknowledgments
    • Containers
      • Standard Containers
        • Sequence containers
        • Associative containers
      • Container Adapters
      • Values
      • Common Members
        • Member types
        • Constructors and destructor
        • Common member functions
        • Optional member functions
        • Sequence member functions
        • Associative member functions
      • Exceptions
      • Deques
      • Lists
      • Maps
      • Priority Queues
      • Queues
      • Sets
      • Stacks
      • Strings
      • Vectors
    • Iterators
      • Iterator Categories
      • Using Iterators
      • Iterator Traits
      • const_iterators
      • Insertion Iterators
      • I/O Stream Iterators
        • istream_iterator class template
        • istreambuf_iterator class template
        • ostream_iterator class template
        • ostreambuf_iterator class template
      • Raw Storage Iterator
      • Reverse Iterators
      • Iterator Function Templates
    • Algorithms
      • Nonmodifying Operations
      • Comparison
      • Searching
      • Binary Search
      • Modifying Sequence Operations
      • Uninitialized Sequence Operations
      • Sorting
      • Merging
      • Set Operations
      • Heap Operations
      • Permutations
      • Miscellaneous
      • Numerics
    • Function Objects
      • Using Functors
      • Functor Foundations
        • binary_function class template
        • unary_function class template
      • Adapters
        • mem_fun function template
        • mem_fun_ref function template
        • ptr_fun function template
      • Binders
      • Arithmetic and Logical Functors
      • Comparison Functors
    • Miscellaneous
      • Allocators
      • Bitset
      • Pairs
      • Smart Pointer
    • Boost
      • Arrays
      • Dynamic Bitsets
      • Binders
      • Composition
      • Adapters
      • Functional Header Replacement
      • Lambda Functions
      • Smart Pointers
  • Index
  • About the Author
  • Copyright

Dodaj do koszyka STL Pocket Reference. Containers, Iterators, and Algorithms

Code, Publish & WebDesing by

(c) 2005-2019 CATALIST agencja interaktywna, znaki firmowe należą do wydawnictwa Helion S.A.