c stl tutorial

Six major STL components-imitation function, six major stl components Functor is to make the use of a class or class template look like a function. The implementation is to overload operator () in a class or class template. This class or class template has the behavior of similar functions. The Imitation function is a smart function, just like the behavior of a smart pointer, which can be seen as a pointer.

In C ++, the STL container type is used as a function and does not use references, which leads to a decrease in program efficiency. stl containers I recently found a problem with algorithm questions: I implement an algorithm recursively, but in the TreeNode * createTree Function(Vector , Int left, int right) TreeNode * createTree (Vector , Int left, int right), The result always times out, I found some

Set and STL operations for specific stl operationsWrong operation before sorted set. Sorry./* Begin (), returns the first element of the set containerEnd (), returns the last element of the set container.Clear (), delete all elements in the set containerEmpty () to determine whether the set container is emptyMax_size () returns the maximum number of elements that a set container may contain.Size (), returns

STL container string basic usage summary, stl container string Summary // Method: append (), insert (), erase (), empty (), replace (), // find (), compare (), empty () // algorithm: reverse () # include

Examples of stl containers and stl containers in c ++ 1. set (set) -- contains sorted data. The values of these data must be unique. That is to say, after the set container is input, the data will be de-duplicated and sorted.S. insert () insert an elementS. begin () s. end () returns the first and last pointers respectively.S. clear () clears the setThe iterator set 2. stringstream (container)-You can s

NLP self-dream's STL algorithm learning in TianyaSTLAlgorithmSummary: Prerequisites: Download STL Source: http://www.sgi.com/tech/stl/download.htmlOpen Web: http://www.sgi.com/tech/stl/stl_index.html One function object: Function objects are used in many algorithms. Binary Function object. V1 and V2 are input a

I. Overview Priority_queue is the queue with the concept of ownership. It allows new elements to be added and old elements to be removed. Call make_heap (), pop_heap (), push_heap () in STL ()AlgorithmImplementation is another form of heap. However, it is a queue, so only elements can be added at the bottom and removed from the top. Sort: sort by weight, rather than by push. The higher the weight, the lower the weight. It is allowed to be insert

Algorithm: Used to process elements within a cluster. They can search, sort, modify, and use those elements for different purposes. An action or function that is applied to a container to handle its memory in various ways, such as sort (sort), copy (copy) ... The algorithm is embodied by the template function, which is not a member function of the container class, is a stand-alone function, they can be used in STL container, and can be used in ordina

STL source code analysis-Implementation of extraction programming (traits) technology, stltraits 1. Why? By default, a template provides a single definition that can be used for any template parameters that you can think! However, for the person who writes the template, this method is not flexible, especially when the template parameter is a pointer, if you want to instantiate a parameter different from the type, it becomes impossible! Sometimes, it i

Original address: http://www.cnblogs.com/duzouzhe/archive/2010/01/12/1645191.htmlThe STL container can be divided into the following major categories:One: Sequence container: Vector, List, deque, String.II: Associative containers: Set, Multiset, map, Mulmap, Hash_set, Hash_map, Hash_multiset, Hash_multimapIII: Miscellaneous: Stack, queue, Valarray, BitsetImplementation of various STL containers:(1) VectorIn

element to the list header.Rbegin () returns the reverse iterator pointing to the first element.Remove () delete an element from the listRemove_if () deletes an element based on the specified conditions.Rend () points to the reverse iterator at the end of the listResize () changes the list size.Reverse () Reverse the list elementSize () returns the number of elements in the list.Sort () sorts the listSplice (iterator position, list X) // list. splice (Position, list2) // prior to position in l

I. Category: StandardSTLSequential container: Vector, String, deque, and list. StandardSTLAssociated container: Set, Multiset, map, and multimap. Non-standard sequence containerSlist and rope. Slist is a one-way linked list, and rope is essentially a heavy string Non-standard associated containerHash_set, hash_multiset, hash_map, and hash_multimap. Several TypesStandard non-STLContainerIncluding array, bitset, valarray, stack, queue, and priority_queue It is worth noting that arrays can wo

Preface: Learning C ++ is now the ninth day, so I just have a simple understanding of C ++ theoretically. I have no practical experience in practical application. so next we will analyze the sgi stl source code.Article, More This is just a direct analysis of the source code, and there is no experience on the actual application scenario. So we only talk about the source code, and nothing else. For Hou Jie's article I have referenced some good

STL generic Algorithm # Include Execution result

Structure and uses a map (not a map in STL) to manage these segments. Map is a continuous space, and each element is a pointer. Point to another larger continuous linear space and become a buffer zone. The buffer zone is the subject of the deque bucket. Buffer expansion is quite complicated !!! [Note] deque is a better choice when using the insert/delete operation. It is more appropriate to select vector in other cases. 2) Use Header file to be load

operation is unsuccessful and ineffective, then you should use list or associative container.5. If you often need to search for elements based on a guideline, you should use the set or multiset to sort the elements with that sort criteria. Remember, in theory, the logarithm complexity is 10 times times better than the linear complexity in the order of 1000 elements. In terms of search speed, hash table is usually 5-10 times faster than a binary tree. But the elements of the hash table are not s

See more details: https://zcheng.ren/2016/08/23/STLVector/ In C + + because the array can not dynamically expand, so in the STL set vector to achieve the role of dynamic array, by allocating contiguous memory space to store elements, if the insertion of elements when the memory space is not large enough, you can reassign the memory to implement a dynamic array.The vector's structure consists of 3 parts: The starting iterator that marks the starting p

The common search algorithms are as follows:Find ()Find_if ()//Search_n ()Search ()Find_end ()Find_first_of ()Adjacent_find ()//These two methods are common, try out all the containers, but the lookup efficiency is slow, is the linear lookupFind () This complexity is linear complexityFIND_IF () This complexity is linear complexityAttention:1, if it is an ordered interval, you can use the ordered interval lookup algorithm (Binary_search includes () Lower_bound () Upper_bound ()).2, the associativ

Search_n () is used to find contiguous n-matched values or add predicatesSearch_n (b, E, C, v)Search_n (b, E, C, V, p)Note: The second form of the method should be search_n_if (b, E, C, p)#include STL STL Algorithm for C + +-Find algorithm (2)

The implementation principles of stl are simple and easy to understand, and stl principles are explained. SummaryPlease use vector for frequent Random Access2. listA list is a two-way linked list, where elements are stored in the heap. Each element is stored in a piece of memory. Its memory space can be discontinuous and data access can be performed through pointers, this feature makes random access very in