"Standard Template Library Programmer's Guide" - читать интересную книгу автора
Introduction to the Standard Template Library Containers and algorithms Iterators Concepts and Modeling Refinement Other parts of the STL How to use the STL documentation Classification of STL components Using the STL documentation Containers Concepts General concepts Container Forward Container Reversible Container Random Access Container Sequences Sequence Front Insertion Sequence Back Insertion Sequence Associative Containers Associative Container Simple Associative Container Pair Associative Container Sorted Associative Container Hashed Associative Container Hash Function Unique Associative Container Multiple Associative Container Unique Sorted Associative Container Multiple Sorted Associative Container Unique Hashed Associative Container Multiple Hashed Associative Container Container classes Sequences vectorlt;T, Allocgt; dequelt;T, Allocgt; listlt;T, Allocgt; slistlt;T, Allocgt; bit_vector Associative Containers setlt;Key, Compare, Allocgt; maplt;Key, Data, Compare, Allocgt; multisetlt;Key, Compare, Allocgt; multimaplt;Key, Data, Compare, Allocgt; hash_setlt;Key, HashFcn, EqualKey, Allocgt; hash_maplt;Key, Data, HashFcn, EqualKey, Allocgt; hash_multisetlt;Key, HashFcn, EqualKey, Allocgt; hash_multimaplt;Key, Data, HashFcn, EqualKey, Allocgt; hashlt;Tgt; String package Character Traits char_traits basic_stringlt;charT, traits, Allocgt; ropelt;T, Allocgt; Container adaptors stacklt;T, Sequencegt; queuelt;T, Sequencegt; priority_queuelt;T, Sequence, Comparegt; bitsetlt;Ngt; Iterators Introduction Concepts Trivial Iterator Input Iterator Output Iterator Forward Iterator Bidirectional Iterator Random Access Iterator Iterator Tags Introduction iterator_traitslt;Iteratorgt; iterator_category distance_type value_type Iterator tag classes input_iterator_tag output_iterator_tag forward_iterator_tag bidirectional_iterator_tag random_access_iterator_tag Iterator base classes input_iteratorlt;T, Distancegt; output_iterator forward_iteratorlt;T, Distancegt; bidirectional_iteratorlt;T, Distancegt; random_access_iteratorlt;T, Distancegt; Iterator functions distance advance Iterator classes istream_iteratorlt;T, Distancegt; ostream_iteratorlt;Tgt; front_insert_iteratorlt;FrontInsertionSequencegt; back_insert_iteratorlt;BackInsertionSequencegt; insert_iteratorlt;Containergt; reverse_iteratorlt;RandomAccessIterator, T, Reference, Distancegt; reverse_bidirectional_iteratorlt;BidirectionalIterator, T, Reference, Distancegt; raw_storage_iteratorlt;ForwardIterator, Tgt; sequence_bufferlt;Container, buf_szgt; Algorithms Non-mutating algorithms for_each find find_if adjacent_find find_first_of count count_if mismatch equal search search_n find_end Mutating algorithms copy copy_n copy_backward Swap swap iter_swap swap_ranges transform Replace replace replace_if replace_copy replace_copy_if fill fill_n generate generate_n Remove remove remove_if remove_copy remove_copy_if unique unique_copy reverse reverse_copy rotate rotate_copy random_shuffle random_sample random_sample_n partition stable_partition Sorting Sort sort stable_sort partial_sort partial_sort_copy is_sorted nth_element Binary search lower_bound upper_bound equal_range binary_search merge inplace_merge Set operations on sorted ranges includes set_union set_intersection set_difference set_symmetric_difference Heap operations push_heap pop_heap make_heap sort_heap is_heap Minimum and maximum min max min_element max_element lexicographical_compare lexicographical_compare_3way next_permutation prev_permutation Generalized numeric algorithms iota accumulate inner_product partial_sum adjacent_difference power Function Objects Introduction Concepts Generator Unary Function Binary Function Adaptable Generator Adaptable Unary Function Adaptable Binary Function Predicates Predicate Binary Predicate Adaptable Predicate Adaptable Binary Predicate Strict Weak Ordering MonoidOperation Random Number Generator Predefined function objects Arithmetic operations pluslt;Tgt; minuslt;Tgt; multiplieslt;Tgt; divideslt;Tgt; moduluslt;Tgt; negatelt;Tgt; Comparisons equal_tolt;Tgt; not_equal_tolt;Tgt; lesslt;Tgt; greaterlt;Tgt; less_equallt;Tgt; greater_equallt;Tgt; Logical operations logical_andlt;Tgt; logical_orlt;Tgt; logical_notlt;Tgt; Generalized identity operations identitylt;Tgt; project1stlt;Arg1, Arg2gt; project2ndlt;Arg1, Arg2gt; select1stlt;Pairgt; select2ndlt;Pairgt; subtractive_rng Function object adaptors binder1stlt;AdaptableBinaryFunctiongt; binder2ndlt;AdaptableBinaryFunctiongt; ptr_fun pointer_to_unary_functionlt;Arg, Resultgt; pointer_to_binary_functionlt;Arg1, Arg2, Resultgt; unary_negatelt;AdaptablePredicategt; binary_negatelt;AdaptableBinaryPredicategt; unary_composelt;AdaptableUnaryFunction1,AdaptableUnaryFunction2gt; binary_composelt;AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2gt; Member function adaptors mem_fun_tlt;Result, Xgt; mem_fun_ref_tlt;Result, Xgt; mem_fun1_tlt;Result, X, Arggt; mem_fun1_ref_tlt;Result, X, Arggt; Utilities Concepts Assignable Default Constructible Equality Comparable LessThan Comparable Functions Relational Operators Classes pairlt;T1, T2gt; Memory Allocation Classes Allocators Functions construct destroy uninitialized_copy uninitialized_copy_n uninitialized_fill uninitialized_fill_n temporary_bufferlt;ForwardIterator, Tgt; get_temporary_buffer return_temporary_buffer Design documents Thread-safety for SGI STL STL Complexity Specifications Strings in SGI STL Rope Implementation Overview SGI STL Allocator Design What's New Other STL Web sites Al Stevens Interviews Alex Stepanov Frequently Asked Questionsabout the SGI Standard Template Library
Introduction to the Standard Template Library The Standard Template Library, or STL , is a C++ library of container classes, algorithms, and iterators; it provides many of the basic algorithms and data structures of computer science. The STL is a generic library, meaning that its components are heavily parameterized: almost every component in the STL is a template. You should make sure that you understand how templates work in C++ before you use the STL.