vc++_之vector使用方法（Vector usage of vc++_）.docVIP

vc++_之vector使用方法（Vector usage of vc++_） Vector is part of the C++ standard template library, occasionally translated as containers in Chinese, but not accurate. It is a versatile template class and a library of functions that can manipulate a variety of data structures and algorithms. Vector is considered a container because it can store various types of objects like containers, simply, vector is able to store any type of dynamic array, and can increase the compression of data. The simple way to use is as follows: Vectorint test; / / create a vector Test.pushback (1); / / the 1 and 2 into the vector such that test[0] is 1, test[1] is 2 Test.pushback (2); We can use an iterator: Vectorint:: iterator (iter=text.begin); / / define a int vector type iterative iterator ITER, which points to the first text While ((ITER) =text.end (); iter++) cout (*iter); //iter++ refers to a forward iteration, until the ITER goes beyond the end iterator until the output iterator points to the value In order to use vector, you must include the following code in your header file: #include vector Vector belongs to the STD naming domain, so you need to complete your code by naming restrictions: Using std:: vector; Vectorint vInts; Or join in, use the full name: Std:: vectorint vInts; It is recommended to use the global named domain approach: using namespace std; function formulation C.assign (beg, end) c.assign (n, elem) Assign the data in the [beg, end) interval to the C. Assign a copy of the N elem to the C. C.at (IDX) Returns the data referred to by index idx, and throws out_of_range if IDX is out of bounds. C.back () Returns the last data, and does not check for the existence of the data. C.begin () Returns the first data address in the iterator. C.capacity () Returns the number of data in the container. C.clear () Removes all data from the container. C.empty () Determine whether the container is empty. C.end () Point to the next element of an iterator, pointing to an element that does n