TypeLayoutBase Class Reference

Small container for printing style for putting of structured objects (array, maps, pairs). More...

#include <Sprinter.h>

Inheritance diagram for TypeLayoutBase:

Collaboration diagram for TypeLayoutBase:

Public Types
typedef char	cstr_t
Public Types inherited from UniTuple< char, 3 >
typedef char	value_type
typedef UniTuple< char, N >	tuple_t
typedef char *	iterator
typedef const char *	const_iterator
Public Types inherited from TupleBase< S, N >
typedef TupleBase< S, N >	tuplebase_t
typedef S	value_type
typedef S *	iterator
typedef S const *	const_iterator

Public Member Functions
bool	empty () const
Public Member Functions inherited from UniTuple< char, 3 >
	UniTuple (const TT &... args)
	UniTuple (const UniTuple< char, N > &t)
	Copy constructor.
	UniTuple (std::initializer_list< S > l)
tuple_t &	operator= (const tuple_t &t)
tuple_t &	operator= (const value_type &value)
tuple_t &	operator= (std::initializer_list< S > l)
virtual const_iterator	begin () const override final
virtual iterator	begin () override final
virtual const_iterator	end () const override final
virtual iterator	end () override final
const tuple_t &	tuple () const
tuple_t &	tuple ()
tuple_t &	tuple (const TT &... args)
void	debug (std::ostream &ostr) const
Public Member Functions inherited from TupleBase< S, N >
const S &	at (size_t i) const
	Return const reference to element i.
const S &	operator[] (size_t i) const
S &	at (size_t i)
	Return reference to element i.
S &	operator[] (size_t i)
bool	operator== (const tuplebase_t &t) const
	Equality operator.
bool	operator== (const value_type &t) const
	Equality operator against single value.
bool	operator!= (const tuplebase_t &t) const
	Inequality operator.
template<class T >
T &	toSequence (T &sequence) const
	Copy elements to a Sequence, like stl::list, stl::set or stl::vector.
void	set (const tuplebase_t &t)
template<class T2 , size_t N2 = 2>
void	set (const TupleBase< T2, N2 > &t)
	Assign tuple of different type and/or size.
void	set (const S &arg)
template<typename ... SS>
void	set (const S &arg, const SS &... rest)
	Set element(s).
template<typename T >
void	set (std::initializer_list< T > l)
template<class T >
tuplebase_t &	assignSequence (T &sequence, bool LENIENT=false)
	Proposed for tuples only; derived classes should not shadow this.
void	fill (S i)
	Set all the elements to i.
void	clear ()
virtual void	toStreamFormatted (std::ostream &ostr, char separator=',') const
virtual void	toStream (std::ostream &ostr) const
std::string	toStr (char separator=',') const
virtual void	updateTuple ()

Public Attributes
cstr_t &	prefix
cstr_t &	separator
cstr_t &	suffix

Additional Inherited Members
Static Public Member Functions inherited from TupleBase< S, N >
static size_t	size ()
	Return the number of elements.
Static Public Attributes inherited from UniTuple< char, 3 >
static const size_t	tuple_size
Static Public Attributes inherited from TupleBase< S, N >
static const size_t	storageTypeSize = sizeof(S)
Protected Member Functions inherited from UniTuple< char, 3 >
	UniTuple (UniTuple< char, N2 > &tuple, size_t i)
char &	next ()
Protected Member Functions inherited from TupleBase< S, N >
void	setIndexed (size_t i)
	Argument stack endpoint function; final step of variadic argument set(arg, ...) .
template<typename T2 , typename ... TT>
void	setIndexed (size_t i, T2 arg, const TT &... rest)
	Worker called by set(T2 arg, T2 arg2, ...)
Protected Attributes inherited from UniTuple< char, 3 >
const iterator	start

Detailed Description

Small container for printing style for putting of structured objects (array, maps, pairs).

Designed for recursive traversal or structures (like JSON trees).

Notice that set() derived from UniTuple<char,3> has argument order: prefix, separator, suffix

---

The documentation for this class was generated from the following file:

• src/drain/Sprinter.h