Include dependency graph for Util.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| OpenDDS | |
| The Internal API and Implementation of OpenDDS. | |
| OpenDDS::DCPS | |
Functions | |
| template<typename Container , typename FirstType , typename SecondType > | |
| int | OpenDDS::DCPS::bind (Container &c, const FirstType &first, const SecondType &second) |
| template<typename Container > | |
| int | OpenDDS::DCPS::unbind (Container &c, const typename Container::key_type &k, typename Container::mapped_type &v) |
| template<typename Container > | |
| int | OpenDDS::DCPS::unbind (Container &c, const typename Container::key_type &k) |
| template<typename Container , typename Key > | |
| int | OpenDDS::DCPS::find (Container &c, const Key &key, typename Container::mapped_type *&value) |
| template<typename Container , typename Key > | |
| int | OpenDDS::DCPS::find (const Container &c, const Key &key, typename Container::mapped_type &value) |
| template<typename Container , typename ValueType > | |
| int | OpenDDS::DCPS::insert (Container &c, const ValueType &v) |
| template<typename Container , typename ValueType > | |
| int | OpenDDS::DCPS::remove (Container &c, const ValueType &v) |
| template<typename Seq > | |
| void | OpenDDS::DCPS::push_back (Seq &seq, const typename Seq::value_type &val) |
| std::vector-style push_back() for CORBA Sequences More... | |
| template<typename Seq > | |
| Seq::size_type | OpenDDS::DCPS::grow (Seq &seq) |
| template<typename InputIteratorA , typename InputIteratorB , typename OutputIterator > | |
| OutputIterator | OpenDDS::DCPS::intersect_sorted_ranges (InputIteratorA a, InputIteratorA aEnd, InputIteratorB b, InputIteratorB bEnd, OutputIterator intersect) |
| template<typename InputIteratorA , typename InputIteratorB , typename OutputIterator , typename LessThan > | |
| OutputIterator | OpenDDS::DCPS::intersect_sorted_ranges (InputIteratorA a, InputIteratorA aEnd, InputIteratorB b, InputIteratorB bEnd, OutputIterator intersect, LessThan lessThan) |
| template<typename SetA , typename SortedB , typename LessThan > | |
| bool | OpenDDS::DCPS::set_intersect (SetA &sA, const SortedB &sB, LessThan lessThan) |
| template<typename Type , size_t count> | |
| size_t | OpenDDS::DCPS::array_count (Type(&)[count]) |
| template<typename T > | |
| int | OpenDDS::DCPS::mem_cmp (const T &a, const T &b) |
