Referencia del Archivo src/qt/src/tools/qtl.h

#include "qglobal.h"
#include "qtextstream.h"
#include "qstring.h"

Ir al código fuente de este archivo.

Clases
class	QTextOStreamIterator< T >
class	QBackInsertIterator< Container >
Funciones
template<class InputIterator , class OutputIterator >
OutputIterator	qCopy (InputIterator _begin, InputIterator _end, OutputIterator _dest)
template<class BiIterator , class BiOutputIterator >
BiOutputIterator	qCopyBackward (BiIterator _begin, BiIterator _end, BiOutputIterator _dest)
template<class InputIterator1 , class InputIterator2 >
bool	qEqual (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
template<class ForwardIterator , class T >
void	qFill (ForwardIterator first, ForwardIterator last, const T &val)
template<class InputIterator , class T >
InputIterator	qFind (InputIterator first, InputIterator last, const T &val)
template<class InputIterator , class T , class Size >
void	qCount (InputIterator first, InputIterator last, const T &value, Size &n)
template<class T >
void	qSwap (T &_value1, T &_value2)
template<class InputIterator >
Q_INLINE_TEMPLATES void	qBubbleSort (InputIterator b, InputIterator e)
template<class Container >
void	qBubbleSort (Container &c)
template<class Value >
Q_INLINE_TEMPLATES void	qHeapSortPushDown (Value *heap, int first, int last)
template<class InputIterator , class Value >
Q_INLINE_TEMPLATES void	qHeapSortHelper (InputIterator b, InputIterator e, Value, uint n)
template<class InputIterator >
Q_INLINE_TEMPLATES void	qHeapSort (InputIterator b, InputIterator e)
template<class Container >
Q_INLINE_TEMPLATES void	qHeapSort (Container &c)
template<class Container >
QBackInsertIterator< Container >	qBackInserter (Container &c)

---

Documentación de las funciones

template<class Container >

QBackInsertIterator<Container> qBackInserter

(

Container &

c

)

[inline]

template<class Container >

void qBubbleSort

(

Container &

c

)

[inline]

template<class InputIterator >

Q_INLINE_TEMPLATES void qBubbleSort	(	InputIterator	b,
		InputIterator	e
	)

template<class InputIterator , class OutputIterator >

OutputIterator qCopy	(	InputIterator	_begin,
		InputIterator	_end,
		OutputIterator	_dest
	)		[inline]

template<class BiIterator , class BiOutputIterator >

BiOutputIterator qCopyBackward	(	BiIterator	_begin,
		BiIterator	_end,
		BiOutputIterator	_dest
	)		[inline]

template<class InputIterator , class T , class Size >

void qCount	(	InputIterator	first,
		InputIterator	last,
		const T &	value,
		Size &	n
	)		[inline]

template<class InputIterator1 , class InputIterator2 >

bool qEqual	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2
	)		[inline]

template<class ForwardIterator , class T >

void qFill	(	ForwardIterator	first,
		ForwardIterator	last,
		const T &	val
	)		[inline]

template<class InputIterator , class T >

InputIterator qFind	(	InputIterator	first,
		InputIterator	last,
		const T &	val
	)		[inline]

template<class InputIterator >

Q_INLINE_TEMPLATES void qHeapSort	(	InputIterator	b,
		InputIterator	e
	)

template<class Container >

Q_INLINE_TEMPLATES void qHeapSort

(

Container &

c

)

template<class InputIterator , class Value >

Q_INLINE_TEMPLATES void qHeapSortHelper	(	InputIterator	b,
		InputIterator	e,
		Value	,
		uint	n
	)

template<class Value >

Q_INLINE_TEMPLATES void qHeapSortPushDown	(	Value *	heap,
		int	first,
		int	last
	)

template<class T >

void qSwap	(	T &	_value1,
		T &	_value2
	)		[inline]