PUBLIC

BlkDQueueG::InsFirst(const T &) BlkDQueueG::Top(void) BlkDQueueG::Push(const T &) BlkDQueueG::Pop(void) BlkQueueG::GetFirst(void) BlkQueueG::InsLast(const T &) BlkQueueG::First(void) BlkQueueG::First(void) const BlkQueueG::Last(void) BlkQueueG::Last(void) const BlkQueueG::IsEmpty(void) const BlkQueueG::Size(void) const BlkQueueG::DelFirst(void) BlkQueueG::Empty(void) BlkQueueG::DbPrint(void) BlkQueueG::Init(void) BlkQueueG::FixFirst(void) BlkQueueG::AllocBlk(void) BlkQueueG::FirstBlk(void) BlkQueueG::DelBlk(void)

BlkDQueueG<class T>
Queue which alows items to be removed from both ends.
include	"amma/BlkQueue.hh"
User Level:	Default
Library:	Mstack
Example:	exQueue.cc
Section:	Containers.Queues
In Scope:	std

Parent Classes:

public BlkQueueG<class T>

void InsFirst(const T & data)

T & Top()

void Push(const T & d)

T Pop()

T GetFirst()

void InsLast(const T & data)

T & First()

const T & First() const

T & Last()

const T & Last() const

int IsEmpty() const

int Size() const

void DelFirst()

may be faster than GetFirst

void Empty()

void DbPrint()

void Init()

void FixFirst()

q_Blk * AllocBlk()

void FirstBlk()

void DelBlk()