iter_swap (STL Samples)
在 Visual C++ 演示如何使用 iter_swap 标准 (STL)模板库函数。
template<class ForwardIterator1, class ForwardIterator2> inline
void iter_swap(
ForwardIterator1 First,
ForwardIterator2 Second
)
备注
.gif "说明") 说明 |
|---|
类/参数名在原型不匹配版本在头文件。修改某些提高可读性。 |
iter_swap 算法交换两个迭代器表示的两个元素。
示例
// iter_swap.cpp
// compile with: /EHsc
//
// Functions:
// iter_swap - Swap two elements in a sequence represented by
// two iterators.
//
// begin - Returns an iterator that points to the first element
// in a sequence.
//
// end - Returns an iterator that points one past the end of
// a sequence.
// disable warning C4786: symbol greater than 255 characters
// okay to ignore
#pragma warning(disable: 4786)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// return the next Fibonacci number in the
// Fibonacci series.
int Fibonacci(void)
{
static int r;
static int f1 = 0;
static int f2 = 1;
r = f1 + f2 ;
f1 = f2 ;
f2 = r ;
return f1 ;
}
int main()
{
const int VECTOR_SIZE = 8 ;
// Define a template class vector of integers
typedef vector<int > IntVector ;
//Define an iterator for template class vector of integer
typedef IntVector::iterator IntVectorIt ;
IntVector Numbers(VECTOR_SIZE) ; //vector containing numbers
IntVectorIt start, end, it ;
start = Numbers.begin() ; // location of first
// element of Numbers
end = Numbers.end() ; // one past the location
// last element of Numbers
// fill the range [first, last +1) with a series of
// Fibonacci numbers using the Fibonacci function
generate(start, end, Fibonacci) ;
cout << "Before calling iter_swap" << endl ;
// print content of Numbers
cout << "Numbers { " ;
for(it = start; it != end; it++)
cout << *it << " " ;
cout << " }\n" << endl ;
// swap the first and last elements of the
// sequence using iter_swap
iter_swap(start, end - 1) ;
cout << "After calling iter_swap" << endl ;
// print content of Numbers
cout << "Numbers { " ;
for(it = start; it != end; it++)
cout << *it << " " ;
cout << " }\n" << endl ;
}
要求
标题: algorithm