Đang chuẩn bị liên kết để tải về tài liệu:
Lecture Practical C++ programming - Chapter 25: Standard template library
Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
The standard template library (STL) contains many different types of containers. These differ in their capibilities and the speed with which they perform their operations. This chapter provides only an overview of the STL, inviting you refer. | Chapter 25 Standard Template Library Practical C Programming Copyright 2003 O Reilly and Associates Page1 STL Components Containers - A collection of data Iterators - Things that go through the data Algorithms - Data manipulation functions Practical C Programming Copyright 2003 O Reilly and Associates Page2 Containers vector - Looks like an array deque - Like vector but allows faster insert and delete to the middle of the container. list - Double linked list no random access set - Unique ordered set of items multiset - Set with no unique restriction map - Associative array with unique keys multimap - Like map but no unique restriction Practical C Programming Copyright 2003 O Reilly and Associates .