不多說(shuō)了，看代碼
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
template<class _Ty>
struct stPrintElement
: public std::unary_function<_Ty, void>
{
void operator()( const _Ty& Arg )
{
std::cout << Arg.second << std::endl;
}
};
int _tmain(int argc, _TCHAR* argv[])
{
typedef std::map<int, std::string> tMap;
typedef tMap::iterator tMapIterator;
tMap MyMap;
std::string str = "I'm the first!";
MyMap.insert(tMap::value_type(0, str));
str = "I'm the second!";
MyMap.insert(tMap::value_type(1, str));
std::for_each(MyMap.begin(), MyMap.end(), stPrintElement< std::pair<int, std::string> >());
for (tMapIterator it = MyMap.begin(); it != MyMap.end();)
{
if (it->second == str)
{
MyMap.erase(it++); /// Really smart! :-)
}
else
{
++it;
}
}
std::cout << "After erase: " << std::endl;
std::for_each(MyMap.begin(), MyMap.end(), stPrintElement< std::pair<int, std::string> >());
return 0;
}
后綴++解決了問(wèn)題，哈哈
這個(gè)在《c++標(biāo)準(zhǔn)程序庫(kù)》里有介紹，一直沒(méi)有用到這個(gè)，今天用到了
2007/04/05 重構(gòu)：
看了小明同志的回復(fù)后，優(yōu)化下
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
template<class TElement>
struct stPrintPairContainerElement
: public std::unary_function<TElement, void>
{
void operator()( const TElement& elem )
{
std::cout << elem.first
<< " : "
<< elem.second
<< std::endl;
}
};
template<class TElement>
struct stPrintNoPairContainerElement
: public std::unary_function<TElement, void>
{
void operator()( const TElement& elem ) const
{
std::cout << elem << std::endl;
}
};
template<class TLeft, class TRight>
struct stPred
: public std::binary_function<TLeft, TRight, bool>
{
bool operator()( const TLeft& left , const TRight& right) const /// 最后這個(gè)const不加不行
{
return left.second == right;
}
};
/// for vector, deque
template <class TContainer, class TElement>
inline
void vector_erase(TContainer & container, TElement const& elem)
{
container.erase( std::remove(container.begin(), container.end(), elem), container.end() );
}
template <class TContainer, class TPred>
inline
void vector_erase_if(TContainer & container, TPred pred)
{
container.erase( std::remove_if(container.begin(), container.end(), pred), container.end() );
}
/// for list, set, map
template <class TContainer, class TElement>
inline
void list_erase(TContainer & container, TElement const& elem)
{
for (TContainer::iterator it = container.begin(); it != container.end();)
{
if (*it == elem)
{
container.erase(it++);
}
else
{
++it;
}
}
}
template <class TContainer, class TPred>
inline
void list_erase_if(TContainer & container, TPred pred)
{
for (TContainer::iterator it = container.begin(); it != container.end();)
{
if (pred(*it))
{
container.erase(it++);
}
else
{
++it;
}
}
}
int _tmain(int argc, _TCHAR* argv[])
{
typedef std::map<int, std::string> tMap;
typedef tMap::iterator tMapIterator;
tMap MyMap;
std::string str = "I'm the first!";
MyMap.insert(tMap::value_type(0, str));
str = "I'm the second!";
MyMap.insert(tMap::value_type(1, str));
std::for_each(MyMap.begin(), MyMap.end(), stPrintPairContainerElement< std::pair<int, std::string> >());
list_erase_if( MyMap, std::bind2nd(stPred< std::pair<int, std::string>, std::string >(), str) );
std::cout << "After erase: " << std::endl;
std::for_each(MyMap.begin(), MyMap.end(), stPrintPairContainerElement< std::pair<int, std::string> >());
/// for vector
typedef std::vector<int> tVector;
typedef tVector::iterator tVectorIterator;
tVector MyVec;
MyVec.push_back(1);
MyVec.push_back(2);
MyVec.push_back(3);
std::cout << "Before erase: " << std::endl;
std::for_each(MyVec.begin(), MyVec.end(), stPrintNoPairContainerElement<int>());
vector_erase(MyVec, 1);
std::cout << "After erase: " << std::endl;
std::for_each(MyVec.begin(), MyVec.end(), stPrintNoPairContainerElement<int>());
return 0;
}
另一種寫(xiě)法：
這個(gè)erase返回指向被刪除元素的下一個(gè)位置，所以不用再++了
template <class TContainer, class TPred>
inline
void list_erase_if(TContainer & container, TPred pred)
{
for (TContainer::iterator it = container.begin(); it != container.end();)
{
{
std::cout << it->first << " : " << it->second << std::endl;
if (pred(*it))
{
it = container.erase(it);
}
else
{
++it;
}
}
}
}
posted on 2007-04-05 00:12
七星重劍 閱讀(8062)
評(píng)論(7) 編輯 收藏 引用 所屬分類:
PL--c/c++ 、
C++ lib -- STL