Reading Notes: C ++ STL Development Technology Guide-2

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/deque/

Deque Technical Principles

Chapter 2 list two-way linked list container

List container

Http://www.cplusplus.com/reference/stl/list/

 

Technical Principle of list

Chapter 2 slist one-way linked list container

Http://www.sgi.com/tech/stl/Slist.html

 

Chapter 2 bit_vector bit vector container

 

It should be the bitset container in the C ++ standard library.

Http://www.cplusplus.com/reference/stl/bitset/

Chapter 1 Set set

Set container

Set Technical Principles

Http://www.cplusplus.com/reference/stl/set/

 

Chapter 3 multi-set containers

Http://www.cplusplus.com/reference/stl/multiset/

Technical Principles of Multiset

Chapter 2 Map containers

Map container

Http://www.cplusplus.com/reference/stl/map/

 

Chapter 2 multimap multi-container

Multimap container

Http://www.cplusplus.com/reference/stl/multimap/

 

Chapter 2 hash_set hash set container

SGI hash_set implementation: http://www.sgi.com/tech/stl/hash_set.html

Technical Principles of hash_set

Hash Function

Hash_set is implemented based on hash_table.

Hash_set application Basics

1. Constructor

2. insert element

3. delete an element

4. Element traversal access

5. Element search

6. Other functions

Hash_set Summary

Chapter 2 hash_map hash ing container

Implementation principle of hash_map

Hash_map SGI implementation source code: http://www.sgi.com/tech/stl/hash_map.html

Hash_map Constructor

Insert hash_map Element

Element Deletion

Element Traversal

Element search

Other functions in hash_map

Hash_map Summary