for(vector<int>::const_iterator iter = ivec.begin(); iter != ivec.end(); ++iter)
{//do your whatever you want here
}

#include <vector>
#include <iostream>struct State
{State( int state ) : m_state( state ){}~State() { std::cout << "~State(), m_state=" << m_state << std::endl; }void setState( int state ){ m_state = state; }int getState() const{ return m_state; }void print() const { std::cout << "State::print: " << m_state << std::endl; }private:int m_state;
};int main()
{std::vector<State*> vect;vect.push_back( new State(0) );vect.push_back( new State(1) );vect.push_back( new State(2) );vect.push_back( new State(3) );std::vector<State*>::iterator it( vect.begin() );std::vector<State*>::iterator ite( vect.end() );for ( ; it != ite; ++it ){(*it)->print();}system( "pause" );return 0;
}

 // TEMPLATE FUNCTION for_each

template<class _InIt,class _Fn1> inline_Fn1 for_each(_InIt _First, _InIt _Last, _Fn1 _Func){    // perform function for each element
_DEBUG_RANGE(_First, _Last);_DEBUG_POINTER(_Func);_CHECKED_BASE_TYPE(_InIt) _ChkFirst(_CHECKED_BASE(_First));_CHECKED_BASE_TYPE(_InIt) _ChkLast(_CHECKED_BASE(_Last));for (; _ChkFirst != _ChkLast; ++_ChkFirst)_Func(*_ChkFirst);return (_Func);}上面的代码看起来挺晕菜的，这里给出 effective STL 里面的一个实现，简单明了：template< typename InputIterator, typename Function >
Function for_each( InputIterator beg, InputIterator end, Function f ) {while ( beg != end )f( *beg++ );
} // TEMPLATE FUNCTION for_each

template<class _InIt,class _Fn1> inline_Fn1 for_each(_InIt _First, _InIt _Last, _Fn1 _Func){    // perform function for each element
_DEBUG_RANGE(_First, _Last);_DEBUG_POINTER(_Func);_CHECKED_BASE_TYPE(_InIt) _ChkFirst(_CHECKED_BASE(_First));_CHECKED_BASE_TYPE(_InIt) _ChkLast(_CHECKED_BASE(_Last));for (; _ChkFirst != _ChkLast; ++_ChkFirst)_Func(*_ChkFirst);return (_Func);}上面的代码看起来挺晕菜的，这里给出 effective STL 里面的一个实现，简单明了：template< typename InputIterator, typename Function >
Function for_each( InputIterator beg, InputIterator end, Function f ) {while ( beg != end )f( *beg++ );
}

       // TEMPLATE FUNCTION mem_fun
template<class _Result,class _Ty> inlinemem_fun_t<_Result, _Ty> mem_fun(_Result (_Ty::*_Pm)()){    // return a mem_fun_t functor adapterreturn (std::mem_fun_t<_Result, _Ty>(_Pm));}mem_fun 函数实际上是调用 mem_fun_t 函数，我们接着深入看看 mem_fun_t，// TEMPLATE CLASS mem_fun_t
template<class _Result,class _Ty>class mem_fun_t: public unary_function<_Ty *, _Result>{    // functor adapter (*p->*pfunc)(), non-const *pfunc
public:explicit mem_fun_t(_Result (_Ty::*_Pm)()): _Pmemfun(_Pm){    // construct from pointer
        }_Result operator()(_Ty *_Pleft) const{    // call functionreturn ((_Pleft->*_Pmemfun)());}
private:_Result (_Ty::*_Pmemfun)();    // the member function pointer
    };将上面这段代码定义的写的我们好看懂一点，如下：// TEMPLATE CLASS mem_fun_t
template< typename _Result, typename _Ty >
class mem_fun_t : public unary_function<_Ty *, _Result>
{    typedef _Result (_Ty::*_Pmemfun)();
public:explicit mem_fun_t( _Pmemfun& pfunc ): m_pfun( pfunc ){    // construct from pointer
    }_Result operator()(_Ty *_Pleft) const{    // call functionreturn ( (_Pleft->*m_pfun)() );}private:_Pmemfun m_pfun; // the member function pointer

};

 // TEMPLATE STRUCT unary_function
template<class _Arg,class _Result>struct unary_function{    // base class for unary functions
    typedef _Arg argument_type;typedef _Result result_type;};