stlab.adobe.com Adobe Systems Incorporated

circular_queue.hpp File Reference

#include <adobe/config.hpp>
#include <adobe/algorithm/equal.hpp>
#include <adobe/iterator.hpp>
#include <adobe/move.hpp>
#include <boost/operators.hpp>
#include <cassert>
#include <vector>

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

Defines

#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 > &)

Define Documentation

#define ADOBE_NOTHROW

Definition at line 210 of file circular_queue.hpp.

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google