ByteBuffer.h File Reference

#include "Define.h"
#include "Errors.h"
#include "ByteConverter.h"
#include "Util.h"
#include <exception>
#include <list>
#include <map>
#include <string>
#include <vector>
#include <cstring>
#include <time.h>
#include <cmath>
#include <type_traits>

Include dependency graph for ByteBuffer.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	ByteBufferException
class	ByteBufferPositionException
class	ByteBufferSourceException
class	ByteBuffer

Functions
template<typename T >
ByteBuffer &	operator<< (ByteBuffer &b, std::vector< T > v)
template<typename T >
ByteBuffer &	operator>> (ByteBuffer &b, std::vector< T > &v)
template<typename T >
ByteBuffer &	operator<< (ByteBuffer &b, std::list< T > v)
template<typename T >
ByteBuffer &	operator>> (ByteBuffer &b, std::list< T > &v)
template<typename K , typename V >
ByteBuffer &	operator<< (ByteBuffer &b, std::map< K, V > &m)
template<typename K , typename V >
ByteBuffer &	operator>> (ByteBuffer &b, std::map< K, V > &m)
template<>
std::string	ByteBuffer::read< std::string > ()
template<>
void	ByteBuffer::read_skip< std::string > ()

Function Documentation

template<>

std::string ByteBuffer::read< std::string > ( )

inline

Todo:

Make a ByteBuffer.cpp and move all this inlining to it.

{
 std::string tmp;
 *this >> tmp;
 return tmp;
}

template<>

void ByteBuffer::read_skip< std::string > ( )

inline

{
 read_skip<char*>();
}

template<typename T >

ByteBuffer& operator<< ( ByteBuffer &  b, std::vector< T >  v  )

inline

{
 b << (uint32)v.size();
 for (typename std::vector<T>::iterator i = v.begin(); i != v.end(); ++i)
 {
 b << *i;
 }
 return b;
}

Here is the call graph for this function:

template<typename T >

ByteBuffer& operator<< ( ByteBuffer &  b, std::list< T >  v  )

inline

{
 b << (uint32)v.size();
 for (typename std::list<T>::iterator i = v.begin(); i != v.end(); ++i)
 {
 b << *i;
 }
 return b;
}

Here is the call graph for this function:

template<typename K , typename V >

ByteBuffer& operator<< ( ByteBuffer &  b, std::map< K, V > &  m  )

inline

{
 b << (uint32)m.size();
 for (typename std::map<K, V>::iterator i = m.begin(); i != m.end(); ++i)
 {
 b << i->first << i->second;
 }
 return b;
}

Here is the call graph for this function:

template<typename T >

ByteBuffer& operator>> ( ByteBuffer &  b, std::vector< T > &  v  )

inline

{
 uint32 vsize;
 b >> vsize;
 v.clear();
 while (vsize--)
 {
 T t;
 b >> t;
 v.push_back(t);
 }
 return b;
}

template<typename T >

ByteBuffer& operator>> ( ByteBuffer &  b, std::list< T > &  v  )

inline

{
 uint32 vsize;
 b >> vsize;
 v.clear();
 while (vsize--)
 {
 T t;
 b >> t;
 v.push_back(t);
 }
 return b;
}

template<typename K , typename V >

ByteBuffer& operator>> ( ByteBuffer &  b, std::map< K, V > &  m  )

inline

{
 uint32 msize;
 b >> msize;
 m.clear();
 while (msize--)
 {
 K k;
 V v;
 b >> k >> v;
 m.insert(make_pair(k, v));
 }
 return b;
}