stl library

Reproduced in: http://blog.csdn.net/longshengguoji/article/details/8550235The C + + standard library provides a variety of different containers with unique features. Now the question is: How do you choose the best container category? The following table gives an overview.But some of these descriptions may not be practical. For example, if you need to deal with a small number of elements, can be the tiger complexity, because the linear algorithm is usu

relatively mature, the algorithm is basically fixed down, do not need you to spend your mind to consider the principle of the algorithm, and do not have to verify its accuracy. However, when you start to work in a computer language, you will find that you need to repeat the mature algorithms again and again in the face of different needs, and you will be caught in some bugs that are inadvertently generated by yourself. At this point, you want to find a tool that has helped you implement these f

STL learning, stl Queue is the Queue representation in STL. The feature is First In First Output FIFO ). The operation is to add and remove elements, add elements from the bottom, and obtain elements from the top, except for adding elements from the bottom and retrieving elements from the top, there is no other way to access other elements of the queue, that

A thread-safe STL with complete basic functions and stl with basic thread FunctionsMiniSTL Currently, an STL program is being completed, mainly to train C ++ programming, template programming, familiarity with STL, and data structure and algorithm capabilities. The goal of the project is to implement several

The hash table is often used in computer programming, and in C + +, STL programming is indispensable.This article describes the use of Hash_map in STL, the method of using custom types as key values in Hash_map, and the problems encountered when using char * types as key values. First, the required header files and namespaces under Linux use STL Hash_map to refer

Six major STL components-iterator, six major stl components Iterator:In addition to the subscript method that is common in other languages to access container elements, the C ++ language provides a completely new method-iterator (iterator) to access container elements. The iterator is similar to a reference and points to an element in the container. In another way, containers are generic data structures, wh

need to return the container_iterator type,Instead of returning a pointer to the data element (this method is not the same, it is too complex), so it will temporarily construct (call the constructor of the iterator) An iterator as the return value. Meaning: Class node {public: node (INT Nage = 0) {m_nage = Nage ;}...... PRIVATE: int m_nage;}; node Foo (int I) {return I;/* returns an int directly, but node has a node (INT) constructor, therefore, a Node object is constructed temporarily and retu

One, the Space Configurator standard interfaceSee "STL Source Code Anatomy" Chapter II-2.1.Ii. SGI Space Configurator with sub-configuration forceSGI STL's Configurator differs from the standard specification by its name alloc rather than allocator, and does not accept any parameters (although SGI also defines a configurator that conforms to some standard, named Sllocator, SGI has never used it and is not recommended, Mainly because of inefficiency).

Experiment 10: Problem C: STL -- heap-type automatic machine and stl Automatic Machine The command POP id t is incorrect. Only the first element of the queue is output, instead of the first element. Question, Because I Output Limit Exceed50 % 7 times ..... Home Web Board ProblemSet Standing Status Statistics Problem C: STL -- Heh-sha

find out how powerful the STL is and how easy it is to use it. STL follows UNIX system conventions, like Sed,awk and emacs--difficult to learn, but powerful and easy to use (I confess that I would never use Emacs to kill myself). If you really want to do some low-level programming, then know the STL bar! Where can I find more information about