bux::C_RawQueue< N > Class Template Reference

#include <XQue.h>

Public Types
typedef size_t	size_type

Public Member Functions
	C_RawQueue ()=default
	C_RawQueue (const C_RawQueue &another)=delete
C_RawQueue &	operator= (const C_RawQueue &another)=delete
	~C_RawQueue ()
size_t	compact ()
bool	empty () const
void	splice (C_RawQueue &other)
void	swap (C_RawQueue &other)

Protected Member Functions
char *	backRaw () const
char *	frontRaw () const
void	popRaw ()
char *	pushRaw ()

Detailed Description

template<size_t N>
class bux::C_RawQueue< N >

Definition at line 12 of file XQue.h.

Member Typedef Documentation

size_type

template<size_t N>

size_t bux::C_RawQueue< N >::size_type

Definition at line 17 of file XQue.h.

Constructor & Destructor Documentation

C_RawQueue() [1/2]

template<size_t N>

bux::C_RawQueue< N >::C_RawQueue ( )

default

C_RawQueue() [2/2]

template<size_t N>

bux::C_RawQueue< N >::C_RawQueue ( const C_RawQueue< N > & another )

delete

~C_RawQueue()

template<size_t N>

bux::C_RawQueue< N >::~C_RawQueue ( )

inline

Definition at line 23 of file XQue.h.

Member Function Documentation

backRaw()

template<size_t N>

char * bux::C_RawQueue< N >::backRaw ( ) const

inlineprotected

Definition at line 35 of file XQue.h.

compact()

template<size_t N>

size_t bux::C_RawQueue< N >::compact

(

)

Returns

Count of deletions of recycled nodes

Unlink all of recycled nodes.

Definition at line 104 of file XQue.h.

empty()

template<size_t N>

bool bux::C_RawQueue< N >::empty ( ) const

inline

Definition at line 28 of file XQue.h.

Referenced by bux::C_UnicodeIn::get(), and bux::C_UnicodeIn::lastError().

Here is the caller graph for this function:

frontRaw()

template<size_t N>

char * bux::C_RawQueue< N >::frontRaw ( ) const

inlineprotected

Definition at line 36 of file XQue.h.

operator=()

template<size_t N>

C_RawQueue & bux::C_RawQueue< N >::operator= ( const C_RawQueue< N > & another )

delete

popRaw()

template<size_t N>

void bux::C_RawQueue< N >::popRaw ( )

protected

Definition at line 127 of file XQue.h.

pushRaw()

template<size_t N>

char * bux::C_RawQueue< N >::pushRaw ( )

protected

Definition at line 143 of file XQue.h.

splice()

template<size_t N>

void bux::C_RawQueue< N >::splice

(

C_RawQueue< N > &

other

)

Parameters

[in,out]

other

The queue the link of which are moves and appended this one.

Concatenate the internal queue of other after this queue. The other queue become empty.

In most cases the other queue will carry no recycled node, so constant complexity is expected.

Definition at line 168 of file XQue.h.

swap()

template<size_t N>

void bux::C_RawQueue< N >::swap

(

C_RawQueue< N > &

other

)

Parameters

other

The other queue to swap with

Definition at line 220 of file XQue.h.

---

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

• XQue.h