c stl cookbook

0 Why hash_map Have you used map? Map provides a very common function, that is, the key-value storage and search function. For example, if I want to record a person's name and the corresponding storage, and add it at any time, I need to quickly search for and modify it: Yue Bu Qun-the manager of Huashan school, known as Zhang Sanfeng, the manager of Wudang school, the founder of Taijiquan undefeated the East-the first master, Kwai Hua baodian...It is not complicated to save the information, but

Many Algorithm functions (including algorithm) in STL must provide a parameter called a function object. Why is such a parameter required? First, these algorithms usually perform some operation on many elements in a container (that is, objects that store a bunch of similar elements, such as list and vector, for example, sort sorts the elements in the container, find_if finds the elements that meet certain conditions in the container, and count_if calc

Author: winter IntroductionThis article discusses how to use the standard template library (STL), Class templates, function templates, and other programming techniques to solve practical problems. This article involves STL collections and vectors, function templates, class templates, constant checks, error handling, and STL file I/O. To read this article, you mus

Article 36: Understand the correct implementation of copy_if STL has many interesting aspects, one of which is an algorithm with 11 names including "copy: Copy Copy_backward Replace_copy Reverse_copy Replace_copy_if Unique_copy Remove_copy Rotate_copy Remove_copy_if Partial_sort_copy Unintialized_copy But none of them are copy_if. This means you can replace_copy_if, You Can

The feature of set is that all elements are automatically sorted according to the key value, the set element does not have the real value (value) and the key value (key) as well as the map, the key value of the set is the real value, and the real value is the key value. Set does not allow two elements to have the same key value. The value of a set element cannot be modified by an iterator.The only difference between multiset and set is that Multiset allows key values to be duplicated.We use the

the use of STL map and set is not complicated, but there are some difficult to understand, such as: # Why is the efficiency of the insertion and deletion of map and set higher than the other sequence container? # Why did the previously saved iterator not expire after each insert? # Why don't map and set have a reserve function like a vector to pre-allocate data? # When data elements increase (10000 to 20,000 comparisons), how does the insertion and se

 The next function defaults to the order from small to large, and the pre function defaults to the order of the largest to the smallest;{3,1,2} results from Next are {3,1,2} and {3,2,1};The result obtained with the pre is {3,1,2},{2,3,1},{2,1,3},{1,3,2,},{1,2,3};The principle is as follows:The principle and use of "STL" next_permutation1, Encounter Next_permutation (permutation: The meaning of the sequence)Today, a simple question (srm531-division T

As we all know, the STL container class is for the object to store management. Although there is no clear limit to the inclusion of pointers in the STL container class, the STL does not care about the objects or pointers that you store in the container. But carefully consider the original intention of STL, the use of p

-duty priority selection mechanisms, Select the most appropriate bitwise template for instantiation! 3. Significance of Partial Specialization: We provide a special version for the general design (that is, some template parameters in the general version are explicitly specified to influence the template instantiation type ); 4. one of its applications in STL: Traits programming techniques. The core point is to instantiate a template, whether it is a c

Simplified STL Chinese Version"Translation Just like the first two sister books in this book (semantic C ++, more than tivec ++), the focus of this book is to improve the reader's experience, this time, I only focused on the C ++ standard library, and it is one of the most interesting parts-STL. C ++ is a programming language that is easy to learn and difficult to use. From learning to using C ++ well, it

For_each (Vec.begin (), Vec.end (), [] (const t t) {cout There is a proverb in the West: Don't invent the wheel again. STL almost encapsulates all the algorithms in the data structure, from the list to the queue, from vectors to stacks, to hash to two forks, from search to sort, from add to delete ... It can be said that if you understand the STL, you will find that you do not have to adhere to the algori

Re-review the STLWhat is STL?STL (template and Standard Template Library), which implements type-independent algorithms and data types, requires that the type in the implementation be parameterized, allowing the user to make different types according to its needs.one or one-like introductionSTL, the standard Template Library, is a highly efficient C + + library with industrial strength. It is housed in the

STL Introduction (Standard Template Library) basic components of STL: Containers (Container), iterators (iterator), function objects (functions object) algorithm (algorithms) Iterators is a bridge between the algorithm and the container that uses iterators as parameters to access the container rather than the container directly as the parameter of the algorithm, using the function object as a parameter of t

Finally, I found the complete Chinese version of objective STL and gave it to everyone.The author explains how to combine STL components to maximize the benefits of library design. This information allows you to develop simple and direct solutions for simple and direct problems, and helps you design elegant methods for more complex problems. I described common STL