摘要: 在模板參數，傳遞類名，在 ( 離散 ) 函數參數中，使用函數名 ( myStruct(); 或 myFunc ) 內置 <functional> ： greater <T>, less<T>, greater_equal<T>, less_equal<T>, equal_to<T>, not_equal_to<T&g...  閱讀全文

     摘要:   1#include<iostream>  2#include<string>  3#include<algorithm>  4using namespace std;  5int main()  6{ ...  閱讀全文

The C++ Queue is a container adapter that gives the programmer a FIFO (first-in, first-out) data structure.

Display all entries for C++ Queues on one page, or view entries individually:

Queue constructor	construct a new queue
back	returns a reference to last element of a queue
empty	true if the queue has no elements
front	returns a reference to the first element of a queue
pop	removes the first element of a queue
push	adds an element to the end of the queue
size	returns the number of items in the queue

Double-ended queues are like vectors, except that they allow fast insertions and deletions at the beginning (as well as the end) of the container.

Display all entries for C++ Double-ended Queues on one page, or view entries individually:

Container constructors	create dequeues and initialize them with some data
Container operators	compare, assign, and access elements of a dequeue
assign	assign elements to a dequeue
at	returns an element at a specific location
back	returns a reference to last element of a dequeue
begin	returns an iterator to the beginning of the dequeue
clear	removes all elements from the dequeue
empty	true if the dequeue has no elements
end	returns an iterator just past the last element of a dequeue
erase	removes elements from a dequeue
front	returns a reference to the first element of a dequeue
insert	inserts elements into the dequeue
max_size	returns the maximum number of elements that the dequeue can hold
pop_back	removes the last element of a dequeue
pop_front	removes the first element of the dequeue
push_back	add an element to the end of the dequeue
push_front	add an element to the front of the dequeue
rbegin	returns a reverse_iterator to the end of the dequeue
rend	returns a reverse_iterator to the beginning of the dequeue
resize	change the size of the dequeue
size	returns the number of items in the dequeue
swap	swap the contents of this dequeue with another

在我看來，deque就是一個雙端的array，和vector是一摸一樣的，雖然內部機制不一樣

先看函數：

Lists are sequences of elements stored in a linked list. Compared to vectors, they allow fast insertions and deletions, but slower random access.

Display all entries for C++ Lists on one page, or view entries individually:

List constructors	create lists and initialize them with some data
List operators	assign and compare lists
assign	assign elements to a list
back	returns a reference to last element of a list
begin	returns an iterator to the beginning of the list
clear	removes all elements from the list
empty	true if the list has no elements
end	returns an iterator just past the last element of a list
erase	removes elements from a list
front	returns a reference to the first element of a list
insert	inserts elements into the list
max_size	returns the maximum number of elements that the list can hold
merge	merge two lists
pop_back	removes the last element of a list
pop_front	removes the first element of the list
push_back	add an element to the end of the list
push_front	add an element to the front of the list
rbegin	returns a reverse_iterator to the end of the list
remove	removes elements from a list
remove_if	removes elements conditionally
rend	returns a reverse_iterator to the beginning of the list
resize	change the size of the list
reverse	reverse the list
size	returns the number of items in the list
sort	sorts a list into ascending order
splice	merge two lists in constant time
swap	swap the contents of this list with another
unique	removes consecutive duplicate elements

要注意的是list不提隨機的迭代器，迭代器是個雙向的，非連續(xù)存儲，而且是個環(huán)狀鏈表在尾端是個未初始化節(jié)點
空判斷：begin==end;
clear  remove  unique(把相同元素移出，留一個先sort)  insert(插入兩種方式)
只能使用成員函數 sort，不能使用 算法 sort(他只接受random iterator)

菜菜的學習了一下STL的vector，做一下筆記感覺這個網站講得通俗易懂http://www.cppreference.com/cppvector/index.html 寫了一下測試code(待續(xù))

Vectors contain contiguous elements stored as an array. Accessing members of a vector or appending elements can be done in constant time, whereas locating a specific value or inserting elements into the vector takes linear time.

Display all entries for C++ Vectors on one page, or view entries individually:

Vector constructors	create vectors and initialize them with some data
Vector operators	compare, assign, and access elements of a vector
assign	assign elements to a vector
at	returns an element at a specific location
back	returns a reference to last element of a vector
begin	returns an iterator to the beginning of the vector
capacity	returns the number of elements that the vector can hold
clear	removes all elements from the vector
empty	true if the vector has no elements
end	returns an iterator just past the last element of a vector
erase	removes elements from a vector
front	returns a reference to the first element of a vector
insert	inserts elements into the vector
max_size	returns the maximum number of elements that the vector can hold
pop_back	removes the last element of a vector
push_back	add an element to the end of the vector
rbegin	returns a reverse_iterator to the end of the vector
rend	returns a reverse_iterator to the beginning of the vector
reserve	sets the minimum capacity of the vector
resize	change the size of the vector
size	returns the number of items in the vector
swap	swap the contents of this vector with another

一直想有一個blog，做做筆記，整理整理思路，基于這個思想，這個blog誕生了！以后就靠這個來祭奠生活了。