circular_queue.hpp File Reference

Go to the source code of this file.

Classes
class	circular_queue< T >
	A queue with a fixed capacity which supports putting back elements. Pushing more elements than there is capacity will pop the least recently pushed elements. More...

Namespaces
namespace	adobe

Macros
#define	ADOBE_NOTHROW

Functions
template<typename T>
bool	operator== (const circular_queue< T > &x, const circular_queue< T > &y)
template<typename T>
void	swap (circular_queue< T > &, circular_queue< T > &)

Macro Definition Documentation

ADOBE_NOTHROW

#define ADOBE_NOTHROW

Definition at line 214 of file circular_queue.hpp.