stl software

Http://blog.csdn.net/sunlylorn/article/details/6788768 GDB user-defined commands are very useful. You can use user-defined commands to directly operate the data in the container and conveniently view the data in the STL container. This link dbinit_stl_views is a custom command written by Dan C Marinescu to view STL containers (you can modify it if it is not suitable for your

Abstract: This article lists several basic STL map and STL set questions. By answering these questions, we explain the data structure in the STL associated container, finally, we raised the question about the built-in balanced binary tree library functions and map and set selection in Unix/Linux, and analyzed the advantages of MAP and set. For those who want to l

Directory Problem SGI Version Space Configurator-std::alloc First-level Space Configurator Second-level Space Configurator Refill, Chunkalloc functions Finally, the Simple_alloc interface that the Configurator encapsulates Problem In our daily writing C + + programs, we often use our STL standard library to help us solve the problem, in which we use the most estimate is its vector, list container, they bring the convenience of

C ++ STL study Note 1: General description This learning note mainly describes the basic knowledge and system framework of C ++ STL. It is mainly suitable for beginners and has some reference value for understanding STL. The notes are illustrated in images and texts, I hope to help you better understand STL. Main threa

SGI designed a two-tier Configurator, the first-level configurator directly uses malloc () and free (), and the second-level Configurator uses different strategies depending on the situation: when the configuration chunk exceeds 128bytes, the first-level configurator is called when it is "large enough", and when the configuration area is less than 128bytes, As "too small", in order to reduce the additional burden, the use of complex memory pool collation, and no longer recourse to the first leve

STL only specifies the interface and complexity, and does not require specific implementation. The set is mostly implemented by the red/black tree, but STL provides a so-called hash_set in addition to the standard specification, which is implemented by hash table. Hash_set interfaces and hash_table are provided. Therefore, almost all hash_set operations directly call the hash_table function. In addition to

suitability of this software to any * purpose. It is provided ' as is ' without express or implied warranty. */* Note:this is a internal header file, included by the other STL headers. * You should not attempt to use it directly. * * #ifndef __sgi_stl_internal_stack_h #define __SGI_STL_INTERNAL_STACK_H __stl_begin_namespace// If the compiler cannot derive the default parameter type that is used later ba

without fee, * provided that above Copyri Ght notice appear in all copies and * so both that the copyright notice and this permission notice appear * in supporting Documentation. Hewlett-Packard Company makes no * representations about the suitability of this software to any * purpose. It is provided ' as is ' without express or implied warranty. * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * Permission to use, copy, mod

Article 3 C ++ STL container Technology Sgi stl code home: http://www.sgi.com/tech/stl/ Chapter 2 vector container Source code of stl_vector.h Common functions of Vector Http://www.cplusplus.com/reference/stl/vector/ Chapter 2 deque dual-end queue container Deque container usage Http://www.cplusplus.com/reference/

STL is built on generalization. The array is generalized to a container, and the type of the contained object is parameterized. function generalization is an algorithm that parameterize the type of iterator used. Pointer generalization is an iterator that parameterize the type of object being pointed to. Six components in the STL: containers, Algorithms, iterators, Configurator, adapters, functor.These six

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