Intelligentedu Intelligentedu Free Computer and IT Books Gratuit ordinateur et il livres

The Standard Template Library, or STL , is a C++ (cplusplus)library of container classes, algorithms, and iterators; it provides many of the basic algorithms and data structures of computer science. La Standard Template Library, ou STL, est un C + + (cplusplus) bibliothèque de classes conteneurs, des algorithmes et des itérateurs, il fournit un grand nombre des algorithmes de base et des structures de données de l'informatique. The STL is a generic library, meaning that its components are heavily parameterized: almost every component in the STL is a template. La STL est une bibliothèque générique, ce qui signifie que ses éléments sont fortement paramétrés: près de chaque composant dans la STL est un modèle. You should make sure that you understand how templates work in C++ before you use the STL. Vous devez vous assurer que vous comprenez comment les modèles de travail en C + + avant d'utiliser la STL. The Standard Template Library Programmer's Guide La Standard Template Library Programmer's Guide will show you how to use these classes, algorithms and iterators when coding in the C++ programming language. vous montrera comment utiliser ces classes, les algorithmes et les itérateurs lors de codage en C + + langage de programmation. You can Vous pouvez download télécharger the full manual, and also available are le manuel complet, et sont également disponibles Frequently Asked Questions Foire aux questions to help and guide you. d'aider et vous guider.


The Standard Template Library Programmer's Guide La Standard Template Library Programmer's Guide

1. Introduction to the STL Introduction à la STL
2. How to use the documentation Comment utiliser la documentation
3. Containers Conteneurs
   1. Concepts Concepts
      1. General concepts Concepts généraux
         1. Container Container
         2. Forward Container Transférer des conteneurs
         3. Reversible Container Réversible conteneurs
         4. Random Access Container Random Access conteneur
      2. Sequences Séquences
         1. Sequence Séquence
         2. Front Insertion Sequence Front insertion séquence
         3. Back Insertion Sequence Retour séquence d'insertion
      3. Associative Containers Les conteneurs associatifs
         1. Associative Container Associative Container
         2. Simple Associative Container Simple associatif contenant
         3. Pair Associative Container Pair associatif contenant
         4. Sorted Associative Container Rangées associatif contenant
         5. Hashed Associative Container Haché associatif contenant
         6. HashFunction HashFunction
         7. Unique Associative Container Unique associatif contenant
         8. Multiple Associative Container Associatif contenant de multiples
         9. Unique Sorted Associative Container Unique triés associatif contenant
         10. Multiple Sorted Associative Container Rangées de multiples associatif contenant
         11. Unique Hashed Associative Container Unique haché associatif contenant
         12. Multiple Hashed Associative Container De multiples haché associatif contenant
   2. Container classes Classes conteneurs
      1. Sequences Séquences
         1. vector Vector
         2. deque deque
         3. list liste
         4. slist slist
         5. bit_vector bit_vector
      2. Associative Containers Les conteneurs associatifs
         1. set définir
         2. map la carte
         3. multiset multiset
         4. multimap Multimap
         5. hash_set hash_set
         6. hash_map hash_map
         7. hash_multiset hash_multiset
         8. hash_multimap hash_multimap
         9. hash hachage
      3. String package String paquet
         1. Character Traits Traits de caractères
         2. char_traits char_traits
         3. basic_string basic_string
      4. rope corde
      5. Container adaptors Container adaptateurs
         1. stack pile
         2. queue file d'attente
         3. priority_queue priority_queue
      6. bitset bitset
4. Iterators Itérateurs
   1. Introduction Introduction
   2. Concepts Concepts
      1. Trivial Iterator Trivial Iterator
      2. Input Iterator Entrée Iterator
      3. Output Iterator Résultats Iterator
      4. Forward Iterator Forward Iterator
      5. Bidirectional Iterator Iterator bidirectionnel
      6. Random Access Iterator Random Access Iterator
   3. Iterator Tags Iterator tags
      1. Introduction Introduction
      2. iterator_traits iterator_traits
      3. iterator_category iterator_category
      4. distance_type distance_type
      5. value_type value_type
      6. Iterator tag classes Iterator tag classes
         1. input_iterator_tag input_iterator_tag
         2. output_iterator_tag output_iterator_tag
         3. forward_iterator_tag forward_iterator_tag
         4. bidirectional_iterator_tag bidirectional_iterator_tag
         5. random_access_iterator_tag random_access_iterator_tag
      7. Iterator base classes Iterator classes de base
         1. input_iterator input_iterator
         2. output_iterator output_iterator
         3. forward_iterator forward_iterator
         4. bidirectional_iterator bidirectional_iterator
         5. random_access_iterator random_access_iterator
   4. Iterator functions Iterator fonctions
      1. distance à distance
      2. advance avance
   5. Iterator classes Iterator classes
      1. istream_iterator istream_iterator
      2. ostream_iterator ostream_iterator
      3. front_insert_iterator front_insert_iterator
      4. back_insert_iterator back_insert_iterator
      5. insert_iterator insert_iterator
      6. reverse_iterator reverse_iterator
      7. reverse_bidirectional_iterator reverse_bidirectional_iterator
      8. raw_storage_iterator raw_storage_iterator
      9. sequence_buffer sequence_buffer
5. Algorithms Algorithmique
   1. Non-mutating algorithms Non-mutation algorithmes
      1. for_each for_each
      2. find rechercher
      3. find_if find_if
      4. adjacent_find adjacent_find
      5. find_first_of find_first_of
      6. count count
      7. count_if count_if
      8. mismatch décalage
      9. equal l'égalité
      10. search recherche
      11. search_n search_n
      12. find_end find_end
   2. Mutating algorithms Algorithmes en mutation
      1. copy copie
      2. copy_n copy_n
      3. copy_backward copy_backward
      4. Swap Swap
         1. swap swap
         2. iter_swap iter_swap
         3. swap_ranges swap_ranges
      5. transform transformer
      6. Replace Remplacer
         1. replace remplacer
         2. replace_if replace_if
         3. replace_copy replace_copy
         4. replace_copy_if replace_copy_if
      7. fill remplir
      8. fill_n fill_n
      9. generate générer
      10. generate_n generate_n
      11. Remove Supprimer
          1. remove supprimer
          2. remove_if remove_if
          3. remove_copy remove_copy
          4. remove_copy_if remove_copy_if
      12. unique unique
      13. unique_copy unique_copy
      14. reverse inverser
      15. reverse_copy reverse_copy
      16. rotate rotation
      17. rotate_copy rotate_copy
      18. random_shuffle random_shuffle
      19. random_sample random_sample
      20. random_sample_n random_sample_n
      21. partition partition
      22. stable_partition stable_partition
   3. Sorting Tri
      1. Sort Trier
         1. sort trier
         2. stable_sort stable_sort
         3. partial_sort partial_sort
         4. partial_sort_copy partial_sort_copy
         5. is_sorted is_sorted
      2. nth_element nth_element
      3. Binary search Binaire de recherche
         1. lower_bound lower_bound
         2. upper_bound upper_bound
         3. equal_range equal_range
         4. binary_search binary_search
      4. merge fusionner
      5. inplace_merge inplace_merge
      6. Set operations on sorted ranges Ensemble des opérations de tri gammes
         1. includes comprend
         2. set_union set_union