effective stl

This article is only a personal learning process in conjunction with the online blog, the collation of STL, is only a brief introduction. Learn notes for individuals only. introduction of STL (excerpt from: Chenguang (morning))STL, the standard Template Library, is a highly efficient C + + library with industrial strength. It is housed in the C + + standard libra

Standard STL sequence Container: Vector, String, deque, and list.Standard STL Associative containers: Set, Multiset, map, and Multimap.Non-standard associative containers hash_set, Hase_multiset, Hash_map, and Hash_multimap.(1) Vector containerVector data is arranged and manipulated in a very similar way to array. The only difference between the two is the flexibility of the use of space. An array is a stat

Turn from: http://blog.csdn.net/feitianxuxue/article/details/7237749 Boost Library:The boost library is one of C + + third party libraries. As a backup of the standard library, some of these content is expected to become the next generation of C + + standard library content, is the "quasi" standard library, most of the use of Boost library features only need to include the corresponding header file, a few need to link the library. But there are also a lot of things that are experimental in boost

instantiation 'std: List , Class std: allocator >, Class std: allocator , Class std: allocator >>> 'Being compiled The Code is as follows:# Include # Include Using namespace std;List MyList; Void main (){}For example,Map MyMap . Answer: This warning means that list The symbols generated by the constructor is too long and exceed

()); } ~Vector() {}Private:typedefSimple_alloc//Simple_alloc RenameIterator start;//point to the currently used space headerIterator finish;//point to the end of the currently used spaceIterator end_of_storage;//point to the end of the space currently available}Here are some simple interface functions:Iteratorbegin(){returnStart;}//Get the head of the vectorConst_iteratorbegin() const {returnStart;}//Get vector head common methodIteratorEnd(){returnFinish;}//Get the tail of the vectorCons

Thank you: http://topic.csdn.net/t/20050429/20/3976956.htmlThank you: http://yzyanchao.blogbus.com/logs/47796444.htmlBut over there is reproduced from the "effective STL".Std::vector is very convenient, but sometimes called the function of the parameters specified is an array, need to convert the vector into an array, in addition to open a space, the vector of an item copy past costs too much, the following

C + + STL common traversal algorithmDesign concept of STL's container algorithm iterator1) STL container through class template technology, to achieve the separation of data type and container model2) STL's iterator technology realizes the unified method of traversing container, and provides the basis for the unification of STL algorithm.3)

Stack stacks container The stack is a linear table, and insertions and deletions are made only at one end of the table. This end is called the top of the stack, and the other end is the stack bottom (stack Bottom). The element insertion of the stack is called the stack, and the deletion of the element is called the stack. Because the element's stack and stack are always on top of the stack, the stack is a LIFO table, the LIFO table.The C + + STL stack

STL provides six major components that can be combined 1, container (containers): a variety of data structures, such as vertor,list,deque,set,map. From the perspective of implementation, the STL container is a class template 2, Algorithm (algorithms): various algorithms such as Sort,search,copy,earse. STL algorithm is a function template. 3, iterator (iterator

passing constant pointers is a better choice. But if you hit the STL again, and the iterators and function objects are all based on the C language pointers, then back to the original rule: the value of the pass is better than the reference. Unless noted, this blog article is original, reproduced please link to the form of this article address: http://harttle.com/2015/07/19/effective-cpp-1.html Copyri

Standard Template Library STL（StandardTemplate Library），即标准模板库，是一个具有工业强度的、高效的C++程序库。它被容纳于C++标准程序库（C++ Standard Library）中，是ANSI/ISO C++标准中最新的也是极具革命性的一部分。该库包含了诸多在计算机科学领域里所常用的基本数据结构和基本算法，为广大C++程序员们提供了一个可扩展的应用框架，高度体现了软件的可复用性。这种现象有些类似于Microsoft Visual C++中的MFC（MicrosoftFoundation Class Library），或者是Borland C++ Builder中的VCL(VisualComponent Library)。 STL是最新的C++标准函数库中的一个子集，这个庞大的子集占据了整个库大约80%的分量。introduction of

1. STL STL (Standard Template Library) is an important part of the C ++ language standard. STL takes the form of template classes and template functionsProgramProvides various data structures andAlgorithmIf programmers can make full use of STLCodeSpace, execution time, and coding efficiency are greatly improved. STL