|
| template<typename T > |
| std::vector< T > & | inet::addAll (std::vector< T > &v, const std::vector< T > &w) |
| |
| template<typename T > |
| std::set< T > & | inet::addAll (std::set< T > &s, const std::set< T > &t) |
| |
| template<typename K , typename V > |
| std::map< K, V > & | inet::addAll (std::map< K, V > &m, const std::map< K, V > &n) |
| |
| template<typename T > |
| std::vector< T >::iterator | inet::find (std::vector< T > &v, const T &a) |
| |
| template<typename T > |
| std::vector< T >::const_iterator | inet::find (const std::vector< T > &v, const T &a) |
| |
| template<typename T > |
| int | inet::count (const std::vector< T > &v, const T &a) |
| |
| template<typename T > |
| int | inet::indexOf (const std::vector< T > &v, const T &a) |
| |
| template<typename T > |
| bool | inet::contains (const std::vector< T > &v, const T &a) |
| |
| template<typename K , typename V > |
| bool | inet::containsKey (const std::map< K, V > &m, const K &a) |
| |
| template<typename T > |
| void | inet::insert (std::vector< T > &v, int pos, const T &a) |
| |
| template<typename T > |
| void | inet::erase (std::vector< T > &v, int pos) |
| |
| template<typename T , typename A > |
| void | inet::remove (std::vector< T > &v, const A &a) |
| |
| template<typename K , typename V > |
| std::vector< K > | inet::keys (const std::map< K, V > &m) |
| |
| template<typename K , typename V > |
| std::vector< V > | inet::values (const std::map< K, V > &m) |
| |
| template<typename T > |
| void | inet::sort (std::vector< T > &v) |
| |
| template<typename T > |
| std::vector< T > | inet::sorted (const std::vector< T > &v) |
| |
| template<typename T > |
| std::string | inet::to_str (const std::vector< T > &v) |
| |
| template<typename K , typename V > |
| std::string | inet::to_str (const std::map< K, V > &m) |
| |