Inserter.hxx File Reference

#include <iostream>
#include <utility>
#include <map>
#include <set>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include "rutil/ResipAssert.h"
#include "rutil/compat.hxx"
#include "rutil/LinkedHashMap.hxx"
#include "rutil/resipfaststreams.hxx"

Go to the source code of this file.

Classes
class	resip::InserterClass< T >
	Allows a (possibly recursive) container of anything with operator<< to be dumped to a stream. More...
class	resip::InserterPClass< T >
	Allows a (possibly recursive) container of anything with operator<< to be dumped to a stream. More...

Namespaces
namespace	resip
	dcm! – add UnusedChecking(_enum) below;

Functions
static const char *	resip::leftanglebracket ("<")
static const char *	resip::rightanglebracket (">")
static const char *	resip::leftsqbracket ("[")
static const char *	resip::rightsqbracket ("]")
static const char *	resip::sparrowsp (" -> ")
static const char *	resip::commaspace (", ")
template<class T >
EncodeStream &	resip::insert (EncodeStream &s, const std::vector< T > &c)
	Completely generic insert function.
template<class T >
EncodeStream &	resip::insert (EncodeStream &s, const std::deque< T > &c)
template<class T >
EncodeStream &	resip::insert (EncodeStream &s, const std::list< T > &c)
template<class K , class C >
EncodeStream &	resip::insert (EncodeStream &s, const std::set< K, C > &c)
template<class K , class C >
EncodeStream &	resip::insert (EncodeStream &s, const std::multiset< K, C > &c)
template<class K , class V , class H >
EncodeStream &	resip::insert (EncodeStream &s, const std::unordered_map< K, V, H > &c)
template<class V , class H >
EncodeStream &	resip::insert (EncodeStream &s, const std::unordered_set< V, H > &c)
template<class K , class V , class H , class P >
EncodeStream &	resip::insert (EncodeStream &s, const LinkedHashMap< K, V, H, P > &c)
template<class K , class V , class H >
EncodeStream &	resip::insert (EncodeStream &s, const std::map< K, V, H > &c)
template<class T >
EncodeStream &	resip::insert (EncodeStream &s, const std::basic_string< T > &str)
template<class T , class U >
EncodeStream &	resip::insert (EncodeStream &s, const std::pair< T, U > &p)
template<class T >
EncodeStream &	resip::operator<< (EncodeStream &s, const InserterClass< T > &inserter)
	Function to allow an Inserter to be used directly with a stream.
template<class T >
InserterClass< T >	resip::Inserter (const T &t)
	Templatized function to construct an instance of InserterClass for a container to be inserted.
template<class T >
EncodeStream &	resip::insertP (EncodeStream &s, const std::vector< T > &c)
	The following functions are more or less the same as the above, but add P to the naming and treat data items as pointers.
template<class T >
EncodeStream &	resip::insertP (EncodeStream &s, const std::deque< T > &c)
template<class T >
EncodeStream &	resip::insertP (EncodeStream &s, const std::list< T > &c)
template<class K , class C >
EncodeStream &	resip::insertP (EncodeStream &s, const std::set< K, C > &c)
template<class K , class C >
EncodeStream &	resip::insertP (EncodeStream &s, const std::multiset< K, C > &c)
template<class K , class V , class H >
EncodeStream &	resip::insertP (EncodeStream &s, const std::unordered_map< K, V, H > &c)
template<class V , class H >
EncodeStream &	resip::insertP (EncodeStream &s, const std::unordered_set< V, H > &c)
template<class K , class V , class H >
EncodeStream &	resip::insertP (EncodeStream &s, const std::map< K, V, H > &c)
template<class T >
EncodeStream &	resip::insertP (EncodeStream &s, const std::basic_string< T > &str)
template<class T , class U >
EncodeStream &	resip::insertP (EncodeStream &s, const std::pair< T, U > &p)
template<class T >
EncodeStream &	resip::operator<< (EncodeStream &s, const InserterPClass< T > &inserter)
	Function to allow an Inserter to be used directly with a stream.
template<class T >
InserterPClass< T >	resip::InserterP (const T &t)
	Templatized function to construct an instance of InserterClass for a container to be inserted.