class SortedQueue : public Queue

Ancestor of all sorted queues

Inheritance:

SortedQueue < Queue

Public Methods

virtual Int	Compare (Void *obj1, Void *obj2) abstract method for comparing two objects
virtual Err	Insert (Void *obj) Sorted insert

Inherited from Queue:

Public Methods

Void Queue::Delete(Void *obj)

Void Queue::DeleteAll()

Void* Queue::DeleteAt(Int index)

Void Queue::DeleteCurrent()

Void* Queue::First()

Err Queue::Insert(Void *obj)

Int Queue::InsertAt(Void *obj, Int index)

Err Queue::InsertAtCurrent(Void *obj)

Void* Queue::ItemAt(Int index)

Int Queue::ItemsOfQ()

Void* Queue::Next()

Queue::Queue()

Void Queue::SetCurrent(Int index)

Void Queue::SetCurrent(Void *obj)

Queue::~Queue()

Public

methods

Queue()

constructor

virtual ~Queue()

destructor

virtual Err Insert(Void *obj)

Inserts at the end of Q

virtual Int InsertAt(Void *obj, Int index)

Inserts at position ; returns the real position of storage

Void Delete(Void *obj)

Deletes 1st item which "object" corresponds to

Void* DeleteAt(Int index)

Deletes item at position; return the pointer to the object

Void DeleteAll()

Deletes all items in Q

Void* First()

Returns the 1st object in Q

Void* Next()

Returns the "current's successor" object; sets the "current" to it

Void* ItemAt(Int index)

Returns the object at position

Int ItemsOfQ()

Returns number of items in Q

Protected

attributes

methods

Void SetCurrent(Int index)

Sets "current" pointer to the item at -th position

Void SetCurrent(Void *obj)

Sets "current" to the item which object corresponds to

virtual Err InsertAtCurrent(Void *obj)

Inserts at "current"; doesn't care about "first" setting

Void DeleteCurrent()

Deletes the "current" item (new current will be the next one)

virtual Int Compare(Void *obj1, Void *obj2)

abstract method for comparing two objects

virtual Err Insert(Void *obj)

Sorted insert

Direct child classes:

TimeSortedQueue

Author:

Jirka

alphabetic index hierarchy of classes

generated by doc++