c stl tutorial

1. Overview The idea of generic programming is based on the assertion that the partial algorithm proposed by A.stepanov can be independent of the data structure. The early 1990s A.stepanov and Meng Lee wrote STL in C + + in accordance with the theory of generic programming. Until 1998, however, STL became the official standard for C + +. In the later years, the major mainstream compilers have also been adde

STL 1. Introduction to STL STL (Standard Template Library) is a collection of software developed by the HP lab. It was developed by Alexander Stepanov, Meng Lee, and David R musser while working at the HP lab. Although it mainly appears in C ++, this technology has existed for a long time before it was introduced into C ++. In a broad sense,

Note: memory management is always the red-light area of the C/C ++ program. There are two focuses on memory management. One is the correct use of memory. For example, new and delete in C ++ should appear in pairs and use raiI to manage memory resources, auto_ptr and other aspects, many C/C ++ books use the introduction of skills. The other is the implementation of memory management, such as the slab distributor of the Linux kernel, Allocator implementation in

I recently used 3D files in STL format to learn how to add them to my favorites. From: http://www.cnblogs.com/ourshell/archive/2010/05/03/1726821.html STL can only be used to indicate closed faces or bodies. STL files can be in either the plaintext format or binary format. Its file format is very simple Plaintext:Solid nameFacet normal Ni NJ NKOuter LoopVertex v1

Http://wenku.baidu.com/view/a3ab7a26ee06eff9aef8077b.html[the definition of each triangular patch includes the three-dimensional coordinates of each point of the triangle and the normal vector of triangular patches. It is a vector, a vertical line on a triangular plane]]Science and Technology Law [E+n][e (representing an exponent) means multiplying the preceding number by the power of N of 10. ]:10 binary 123456789 = 1.23e+7STL formatThe most important feature of

The following contents are reproduced: HTTP://STLCHINA.HUHOO.NET/BIN/VIEW.PL/MAIN/STLDETAILHASHMAPDetailed explanation of STL Hash_map series Detailed explanation of STL Hash_map series 0 Why do I need hash_map 1 data structure: hash_map principle 2 Hash_map Use 2.1 A simple example The hash function of 2.2 hash_map Comparison function of 2.3 ha

Original:STL "source code" analysis-Key Knowledge summarySTL is one of the important components of C + +, the university saw the "STL Source Code Analysis" This book, these days reviewed a bit, summed up the following LZ think more important knowledge points, content a little bit more:)1. STL OverviewSTL provides six components that can be combined with each other: Container (Containers): A variety

STL hash_map Series STL hash_map Series 0 Why hash_map 1. Data Structure: hash_map Principle 2 Use hash_map 2.1 A simple instance 2.2 Hash Functions of hash_map 2.3 comparison functions of hash_map 2.4 hash_map Function 3 related hash containers 4 others 4.1 what is the difference between hash_map and map? 4.2 When do I need hash_map and map?

This section is enclosed in the following, and is summarized by yourself outside the brackets. /*************************************** **************************************** **************************************** **************************************** * ************** Study Notes-Objective STL-use STL to program a new article: miscellaneous-so-called algorithms and cooking Clause 43: use algorithms t

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, the standard Template Library, is a highly efficient C + + library with industrial strength.It is housed in the C + + standard library, which is the newest and most revolutionary part of the Ansi/iso C + + standard. The library contains many basic data structures and basic algorithms commonly used in computer science. For the vast number of C + + programmers to provide a scalable application framework, highly reflects the reusability of software.

I. Overview of STL Container C + + STL (Standard Template Library Standard Template gallery) is a universal class template and algorithm collection, it provides us with some standard data structure implementation such as queues (queue), lists (linked list), and stacks (stack) and so on. When we use C + + programming, we often use the STL container, which is very

After the ANSI/iso c ++ STL standard version is officially passed, each C ++ compiler vendor can implement the C ++ STL generic library according to the prototype described in the standard, as a result, there are a variety of generic Libraries that comply with the standard interface, but the specific implementation code is different, mainly including: HP STL Hp

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

VectorSimilar to the built-in array,It has a continuous memory and the starting address remains unchanged.Therefore, it supports random access, that is, the [] Operator. However, because its memory space is continuous, inserting and deleting in the middle will cause the copy of memory blocks, in addition, when the memory space after the array is insufficient, you need to apply for a memory that is sufficiently large and copy the memory. These greatly affect the efficiency of vector.ListIt is a t

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

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