From 1f0ce8533cc837aa2d4155b5fc17d2004bed0197 Mon Sep 17 00:00:00 2001 From: Michele Calgaro Date: Wed, 5 Jun 2024 19:02:23 +0900 Subject: Rename template library nt* related files to equivalent tq* Signed-off-by: Michele Calgaro --- doc/html/tqvaluestack.html | 158 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 158 insertions(+) create mode 100644 doc/html/tqvaluestack.html (limited to 'doc/html/tqvaluestack.html') diff --git a/doc/html/tqvaluestack.html b/doc/html/tqvaluestack.html new file mode 100644 index 000000000..114dcc59f --- /dev/null +++ b/doc/html/tqvaluestack.html @@ -0,0 +1,158 @@ + + + + + +TQValueStack Class + + + + + + + +

TQValueStack Class Reference

+ +

The TQValueStack class is a value-based template class that provides a stack. +More... +

All the functions in this class are reentrant when TQt is built with thread support.

#include <tqvaluestack.h> +

Inherits TQValueList<T>. +

List of all member functions. +

Public Members

TQValueStack ()
~TQValueStack ()
void push ( const T & d )
T pop ()
T & top ()
const T & top () const

Detailed Description

+ + +The TQValueStack class is a value-based template class that provides a stack. +

+ + + + +

Define a template instance TQValueStack<X> to create a stack of +values that all have the class X. TQValueStack is part of the TQt Template Library. +

Note that TQValueStack 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"; TQPtrStack, TQPtrList, +TQDict, etc., are "pointer based". +

A stack is a last in, first out (LIFO) structure. Items are added +to the top of the stack with push() and retrieved from the top +with pop(). The top() function provides access to the topmost item +without removing it. +

Example: +

+        TQValueStack<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
+

+ +

TQValueStack is a specialized TQValueList provided for convenience. +All of TQValueList's functionality also applies to TQPtrStack, for +example the facility to iterate over all elements using +TQValueStack::Iterator. See TQValueListIterator for further +details. +

Some classes cannot be used within a TQValueStack, for example +everything derived from TQObject and thus all classes that +implement widgets. Only values can be used in a TQValueStack. To +qualify as a value, the class must provide +

a copy constructor; +
an assignment operator; +
a default constructor, i.e. a constructor that does not take any arguments. +

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. +

Member Function Documentation

TQValueStack::TQValueStack () +

+ +

Constructs an empty stack. + +

TQValueStack::~TQValueStack () +

+ +

Destroys the stack. References to the values in the stack and all +iterators of this stack become invalidated. Because TQValueStack 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. + +

T TQValueStack::pop () +

+ +

Removes the top item from the stack and returns it. +

void TQValueStack::push ( const T & d ) +

+ +

Adds element, d, to the top of the stack. Last in, first out. +

This function is equivalent to append(). +

T & TQValueStack::top () +

+ +

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 TQValueList::fromLast(). + +

const T & TQValueStack::top () const +

+ +

This is an overloaded member function, provided for convenience. It behaves essentially like the above function. +

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 TQValueList::fromLast(). + + +

+ +

Trademarks +

TQt 3.3.8

+ -- cgit v1.2.1