学步园

=

#include <deque><br /> #include <iterator><br /> #include <xutility><br /> #include <algorithm><br /> using namespace std;<br /> int main()<br /> {<br /> typedef deque<int> IntDeque;<br /> typedef IntDeque::iterator Iter;<br /> typedef IntDeque::const_iterator ConstIter;<br /> int a[]={0,1,2,3,4,5,6,7,8,9};<br /> IntDeque id(a,a+10);<br /> Iter i(id.begin());<br /> ConstIter ci=find(id.begin(),id.end(),4);<br /> //advance(i, distance(i,ci)); // error!<br /> //<br /> //----------------distance_impl------------------------<br /> //<br /> // template<typename InputIterator><br /> // typename iterator_traits<InputIterator>::difference_type<br /> // distance(InputIterator first, InputIterator last); //first and last must be same.<br /> //<br /> //-----------------------------------------------------</p> <p> advance(i, distance((ConstIter)i,ci));<br /> id.erase(i);<br /> return 0;<br /> }