Class TDblQue

class TDblQue : public TDblQueBase;

Description

A templated class that provides the behaviour for managing a doubly linked list.

It also acts as the head of the list, maintaining the pointers into the list.

The template parameter defines the type of element that forms the doubly linked list and is the class that acts as host to the link object.

Derivation

• TDblQueBase - A base class that provides implementation for the doubly linked list header.

• TDblQue - A templated class that provides the behaviour for managing a doubly linked list.

Members

Defined in TDblQue:

• AddFirst(T &)Inserts the specified list element at the front of the doubly linked list.
• AddLast(T &)Inserts the specified list element at the back of the doubly linked list.
• First()constGets a pointer to the first list element in the doubly linked list.
• IsFirst(const T *)constTests whether the specified element is the first in the doubly linked list.
• IsHead(const T *)constTests whether the end of a list has been reached.
• IsLast(const T *)constTests whether the specified element is the last in the doubly linked list.
• Last()constGets a pointer to the last list element in the doubly linked list.
• TDblQue()Constructs an empty list header and sets the offset value of the link object to ...
• TDblQue(TInt)Constructs an empty list header and sets the offset of the link object to the sp...

Inherited from TDblQueBase:

• DoAddFirst(TAny *)Implements the insertion of the specified list element at the front of the doubl...
• DoAddLast(TAny *)Implements the insertion of the specified list element at the back of the doubly...
• DoAddPriority(TAny *)Implements the insertion of the specified list element in priority order.
• IsEmpty()constTests whether the doubly linked list is empty, i.e. has no list elements.
• Reset()Empties the doubly linked list.
• SetOffset(TInt)Sets the offset of the link object from the start of a doubly linked list elemen...
• TDblQueBase(TInt)Constructor with specified offset.
• __DbgTestEmpty()constTests whether the queue is empty.
• iHeadThe head, or anchor point of the queue.
• iOffsetThe offset of a component link object within elements that form the list.

See also:

• TDblQueLink...

inline TDblQue();

Description

Constructs an empty list header and sets the offset value of the link object to zero.

In practice, never assume that the offset of the link object from the start of a list element is zero, even if the link object is declared as the first data member in the list element class.

If this default constructor is used, then call the TDblQueBase::SetOffset(TInt) function of the base class to ensure that the offset value is set correctly.

See also:

• TDblQueBase::SetOffset(TInt)Sets the offset of the link object from the start of a doubly linked list elemen...

inline TDblQue(TInt aOffset);

Description

Constructs an empty list header and sets the offset of the link object to the specified value.

Parameters

TInt aOffset The offset of the link object from the start of a list element. The macro _FOFF can be used to calculate this value.

Panic codes

USER 78. if aOffset is not divisble by 4.

inline void AddFirst(T &aRef);

Description

Inserts the specified list element at the front of the doubly linked list.

If the list is not empty, the specified element becomes the first in the list. What was previously the first element becomes the second in the list.

Parameters

T &aRef The list element to be inserted at the front of the doubly linked list.

inline void AddLast(T &aRef);

Description

Inserts the specified list element at the back of the doubly linked list.

If the list is not empty, the specified element becomes the last in the list. What was previously the last element becomes the next to last element in the list.

Parameters

T &aRef The list element to be inserted at the back of the doubly linked list.

inline TBool IsHead(const T *aPtr) const;

Description

Tests whether the end of a list has been reached.

A doubly linked list is circular; in following the chain of elements in a list (e.g. using the iterator operator++ or operator--), the chain eventually reaches the end of the list and aPtr corresponds to the header (although it will not point to a valid T object).

Parameters

const T *aPtr The pointer value to be checked.

Return value

TBool True, if the end of the list has been reached. False, if the end of the list has not been reached; aPtr points to an element in the list.

inline TBool IsFirst(const T *aPtr) const;

Description

Tests whether the specified element is the first in the doubly linked list.

Parameters

const T *aPtr A pointer to the element whose position in the list is to be checked.

Return value

TBool True, if the element is the first in the list; false, otherwise.

inline TBool IsLast(const T *aPtr) const;

Description

Tests whether the specified element is the last in the doubly linked list.

Parameters

const T *aPtr A pointer to the element whose position in the list is to be checked.

Return value

TBool True, if the element is the last in the list; false, otherwise.

inline T* First() const;

Description

Gets a pointer to the first list element in the doubly linked list.

Return value

T * A pointer to the first list element in the doubly linked list. If the list is empty, this pointer is not necessarily NULL and must not be assumed to point to a valid object.

inline T* Last() const;

Description

Gets a pointer to the last list element in the doubly linked list.

Return value

T * A pointer to the last list element in the doubly linked list. If the list is empty, this pointer is not necessarily NULL and must not be assumed to point to a valid object.