|
|
template<class Key , class Value > |
| using | caseless_unordered_map = std::unordered_map< Key, Value, CaselessHash< Key >, CaselessEq< Key > > |
| |
|
template<class Key , class Value > |
| using | caseless_unordered_multimap = std::unordered_multimap< Key, Value, CaselessHash< Key >, CaselessEq< Key > > |
| |
|
template<class Key , class Value > |
| using | caseless_map = std::map< Key, Value, CaselessLess< Key > > |
| |
|
template<class Key > |
| using | caseless_set = std::set< Key, CaselessLess< Key > > |
| |
|
| void | ltrim (std::string &s) |
| | trim from start (in place) More...
|
| |
| void | rtrim (std::string &s) |
| | trim from end (in place) More...
|
| |
| std::string & | trim (std::string &s) |
| | Trims std::string from both ends (in place) More...
|
| |
| std::vector< std::string > | split (const std::string &src, const std::string &delimiter) |
| | split string into a vector of substrings More...
|
| |
| template<typename T , typename A > |
| std::string | joinVec (std::vector< T, A > const &vec, std::string const &glue=std::string(",")) |
| | create a string representation for a vector of values, without any suffixes or prefixes More...
|
| |
| template<typename T , typename A > |
| std::string | dumpVec (std::vector< T, A > const &vec) |
| | create a string representation for a vector of values, enclosing text in a square brackets More...
|
| |
| template<typename T , typename A > |
| T | product (std::vector< T, A > const &vec) |
| | multiply vector's values More...
|
| |
| template<typename T , typename A > |
| bool | equal (const std::vector< T, A > &v1, const std::vector< T, A > &v2) |
| | check if vectors contain same values More...
|
| |
| bool | equal (const std::string &lhs, const std::string &rhs, bool ignoreCase=true) |
| | Checks whether two std::strings are equal. More...
|
| |
| bool | endsWith (const std::string &src, const char *with) |
| | check string end with given substring More...
|
| |
| std::string | tolower (const std::string &s) |
| | Converts all upper-case letters in a std::string to lower case. More...
|
| |
| template<typename C , typename T > |
| bool | contains (const C &container, const T &element) |
| | Simple helper function to check element presence in container container must provede stl-compliant find member function. More...
|
| |
| template<typename Container , typename PredicateT > |
| void | erase_if (Container &data, const PredicateT &predicate) |
| | Associative containers doesnt work with remove_if algorithm. More...
|
| |
| template<typename TIterator > |
| auto | product (TIterator beg, TIterator en) -> typename std::remove_reference< decltype(*beg)>::type |
| | Multiplies container. More...
|
| |
| void | clipping (int *idx, const int min, const int max) |
| | Clips element to be in range [min, max] More...
|
| |
| template<typename Set > |
| static Set | Intersection (const Set &lhs, const Set &rhs) |
| | Set containers intersection. More...
|
| |
| template<typename Set > |
| static bool | Intersects (const Set &lhs, const Set &rhs) |
| | Check whether two sets intersect. More...
|
| |
|
inline ::ngraph::element::Type | convertPrecision (const Precision &precision) |
| |
|
inline ::ngraph::element::Type | convertPrecision (const std::string &precision) |
| |
|
Precision | convertPrecision (const ::ngraph::element::Type &precision) |
| |
| CNNNetwork | cloneNetwork (const CNNNetwork &network) |
| | Clones input network including all layers and internal data objects. More...
|
| |