数据结构第二章Chapter 2

Contents
Stack Containers
A stack allows access at only one end of the sequence, called the top.
top top
A
C
B A
C
top
top
B A
B A
top
A
B
Push A
Push B (a)
Push C
Pop C
16
Main Index Contents
CLASS vector
Operations
<vector>
void push_back(const T& value); Add a value at the rear of the vector. Postcondition: The vector has a new element at the rear and its size increases by 1. void pop_back(); Remove the item at the rear of the vector. Precondition: The vector is not empty. Postcondition: The vector has a new element at the rear or is empty.
B
C
D
E
D elete
8
Main Index
Contents
Priority Queue Containers
A priority queue is a storage structure that has restricted access operations similar to a stack or queue. Elements can enter the priority queue in any order. Once in the container, a delete operation removes the largest (or smallest) value. V alue = 8
10
Main Index
Contents
Map Containers
A map is a storage structure that implements a keyvalue relationship.
Index A 29-468 D 7B -916 W 91-A 83
P art # D 7B -916 W 91-A 83 A 29-468
P rice 4.95 12.50 8.75
Vendor M irage C allow ay M art in
11
Main Index
Contents
Vectors
v[0]
v[1]
v[2]
. . .
v [ n-1 ]
ro o m to gro w
0
1
2
n-1
12
Main Index
Conts itio n 2
P o s itio n 3
P o s itio n 4
3
Main Index
Contents
Associative Containers
Associative containers store elements by key.
–

Ex: name, social security number, or part number.
Sequence Containers Adapter Containers Associative Containers
Vector
Stack
Set, Multiset
Map, Mutltimap
Deque(双端队列） Queue
List Priority Queue
2
Main Index
Contents
17
Main Index
Contents
CLASS vector
Operations
<vector>
void resize((int n, const T& fill = T()); Modify the size of the vector. If the size is increased, the value fill is added to the elements on the tail of the vector. If the size is decreased, the original values at the front are retained. Postcondition: The vector has size n. int size() const; Return the number of elements in the vector.
Pop B (b)
7
Main Index
Contents
Queue Containers
A queue is a container that allows access only at the front and rear of the sequence.
A
B
C
D Ins ert E rear A fro nt
– The Vector Container
Container Types Vectors
-Constructor
Chapter 4
-Operations
Sequence Containers
- List - Declaring Vector Objects -Adding and Removing Elements -Resizing a Vector -Output with Vectors -Joining Sorted Sublists

A program accesses an element in an associative container by its key, which may bear no relationship to the location of the element in the container.
14
Main Index
Contents
CLASS vector
Operations
<vector>
T& back(); Return the value of the item at the rear of the vector. Precondition: The vector must contain at least one element. const T& back() const; Constant version of back(). bool empty() const; Return true if the vector is empty and false otherwise.
18
Main Index
Contents
Output with Vectors
// number of elements in list is v.size()
template <typename T> void writeVector ( const vector<T>& v ) {
// capture the size of the vector in n
13
Main Index Contents
CLASS vector
Constructors
<vector>
vector(T *first, T *last); Initialize the vector using the address range [first,last). The notation *first and *last is a pointer notation.
18 3 15 13
27
9
Main Index
Contents
Set Containers
A set is a collection of unique values, called keys or set members.
S et A 5 3 27 15 1 S et B Buic k F o rd H o nd a BM W Jaguar Jeep
CLASS vector
Constructors
<vector>
vector(); Create an empty vector. This is the default constructor. vector(int n, const T& value = T()); Create a vector with n elements, each having a specified value. If the value argument is omitted, the elements are filled with the default value for type T. Type T must have a default constructor, and the default value of type T is specified by the notation T().
4
Main Index
Contents
Adapter Containers
An adapter contains another container as its underlying storage structure. The programmer interface for an adapter provides only a restricted set of operations from the underlying storage structure.