Home | All Classes | Main Classes | Annotated | Grouped Classes | Functions |
The QValueStack class is a value-based template class that provides a stack. More...
#include <qvaluestack.h>
Inherits QValueList<T>.
Define a template instance QValueStack<X> to create a stack of values that all have the class X. QValueStack is part of the Qt Template Library.
Note that QValueStack does not store pointers to the members of the stack; it holds a copy of every member. That is why these kinds of classes are called "value based"; QPtrStack, QPtrList, and QDict are "reference based".
A stack is a last in, first ut (LIFO) structure. Items are added to the top of the stack with push() and retrieved from the top with pop(). Furthermore, top() provides access to the topmost item without removing it.
Example:
QValueStack<int> stack; stack.push( 1 ); stack.push( 2 ); stack.push( 3 ); while ( ! stack.isEmpty() ) cout << "Item: " << stack.pop() << endl; // Output: // Item: 3 // Item: 2 // Item: 1
QValueStack is a specialized QValueList provided for
convenience. All of QValueList's functionality also applies to
QPtrStack, for example the facility to iterate over all elements using
QValueStack Some classes cannot be used within a QValueStack, for example everything
derived from QObject and thus all classes that implement widgets.
Only values can be used in a QValueStack. To qualify as a value, the class
must provide
Note that C++ defaults to field-by-field assignment operators and
copy constructors if no explicit version is supplied. In many cases
this is sufficient.
See also Qt Template Library Classes, Implicitly and Explicitly Shared Classes and Non-GUI Classes.
Constructs an empty stack.
Destroys the stack. References to the values in the stack and all
iterators of this stack become invalidated. Because QValueStack is
highly tuned for performance, you won't see warnings if you use
invalid iterators because it is impossible for an iterator to check
whether or not it is valid.
Removes the top item from the stack and returns it.
Adds element, d, to the top of the stack. Last in, first out.
This function is equivalent to append().
Returns a reference to the top item of the stack or the item
referenced by end() if no
such item exists. Note that you must not change
the value the end() iterator points to.
This function is equivalent to last().
See also pop(), push() and QValueList::fromLast().
Returns a reference to the top item of the stack or the item
referenced by end() if no such item exists.
This function is equivalent to last().
See also pop(), push() and QValueList::fromLast().
This file is part of the Qt toolkit.
Copyright © 1995-2002
Trolltech. All Rights Reserved.
Member Function Documentation
QValueStack::QValueStack ()
QValueStack::~QValueStack ()
T QValueStack::pop ()
void QValueStack::push ( const T & d )
T & QValueStack::top ()
const T & QValueStack::top () const
This is an overloaded member function, provided for convenience. It behaves essentially like the above function.
Copyright © 2002
Trolltech Trademarks