24 template <
class T,
class CONTAINER>
27 typename CONTAINER::const_iterator last = vect.end();
28 for (
typename CONTAINER::const_iterator i=vect.begin();i!=last;++i)
29 if (*i==value)
return std::distance(vect.begin(),i);
30 return std::string::npos;
34 template <
class T>
inline typename std::list<T>::iterator
erase_return_next(std::list<T> &cont,
typename std::list<T>::iterator &it)
36 return cont.erase(it);
39 template <
class K,
class V>
inline typename std::map<K,V>::iterator
erase_return_next(std::map<K,V> &cont,
typename std::map<K,V>::iterator &it)
41 typename std::map<K,V>::iterator itRet = it; ++itRet;
46 template <
class K,
class V>
inline typename std::multimap<K,V>::iterator
erase_return_next(std::multimap<K,V> &cont,
typename std::multimap<K,V>::iterator &it)
48 typename std::multimap<K,V>::iterator itRet = it; ++itRet;
53 template <
class T>
inline typename std::set<T>::iterator
erase_return_next(std::set<T> &cont,
typename std::set<T>::iterator &it)
55 typename std::set<T>::iterator itRet = it; ++itRet;
size_t find_in_vector(const T &value, const CONTAINER &vect)
Returns the index of the value "T" in the container "vect" (std::vector,std::deque,...
std::list< T >::iterator erase_return_next(std::list< T > &cont, typename std::list< T >::iterator &it)
Calls the standard "erase" method of a STL container, but also returns an iterator to the next elemen...
This is the global namespace for all Mobile Robot Programming Toolkit (MRPT) libraries.