#include <xst_stack.h>
Collaboration diagram for xst_stack:

StackT
Definition at line 54 of file xst_stack.h.
Public Types | |
| enum | { const_value_, depth_ = 1, capacity_ = 1, primitive_id_ = primitive_id_stack } |
| typedef value_T | dereferenced_value_T |
| Defines type of dereferenced stack primitive, which is type of object stored in the stack. | |
| typedef xst_stack< StackT > | left_T |
| Defines type of left scalar primitive of lambda compound. | |
| typedef xst_stack< typename xst_storage_adaptor< StackT >::reference > | reference_T |
| Defines reference type for stack primitive. | |
| typedef xst_stack< StackT > | right_T |
| Defines type of right scalar primitive of lambda compound. | |
| typedef xst_storage_adaptor< StackT >::value_type | stack_T |
| Defines type of encapsulated stack object. | |
| typedef stack_T::value_type | value_T |
| Defines type of object stored in the stack. | |
Public Member Functions | |
| template<int LocationT> | |
| dereferenced_value_T & | dereferenced_value (xst_lambda_wrap< xst_const_scalar< LocationT > > subscript_) |
| Dereferenced stack primitive returns top stack element. | |
| left_T const & | left_lambda () const |
| Direct constant access to left-hand-side stack lambda compound node. | |
| left_T & | left_lambda () |
| Direct mutable access to left-hand-side stack lambda compound node. | |
| reference_T | make_reference () const |
| Manufactures copy of reference object for stack primitive. | |
| template<int LocationT> | |
| void | pop (xst_lambda_wrap< xst_const_scalar< LocationT > >) |
| Push data from stack. | |
| template<int LocationT, typename InputValueT> | |
| void | push (xst_lambda_wrap< xst_const_scalar< LocationT > >, InputValueT const &data_) |
| Push data to stack. | |
| right_T const & | right_lambda () const |
| Direct constant access to right-hand-side stack lambda compound node. | |
| right_T & | right_lambda () |
| Direct mutable access to right-hand-side stack lambda compound node. | |
| template<int LocationT> | |
| size_t | size (xst_lambda_wrap< xst_const_scalar< LocationT > >) const |
| Get stack size. | |
| template<int LocationT> | |
| stack_T * | stack_ptr (xst_lambda_wrap< xst_const_scalar< LocationT > >) |
| Get mutable pointer to stack encapsulated by lambda compound node. | |
| template<int LocationT> | |
| stack_T const * | stack_ptr (xst_lambda_wrap< xst_const_scalar< LocationT > >) const |
| Get constant pointer to stack encapsulated by lambda compound node. | |
| template<int LocationT> | |
| value_T & | top (xst_lambda_wrap< xst_const_scalar< LocationT > >) |
| Mutable access to top element of stack. | |
| template<int LocationT> | |
| value_T const & | top (xst_lambda_wrap< xst_const_scalar< LocationT > >) const |
| Constant access to top element of stack. | |
| template<typename FunctorT> | |
| void | traverse_bottom_up (FunctorT &functor_) const |
| Lambda compound bottom up traversal algorithm with constant access to terminal nodes. | |
| template<typename FunctorT> | |
| void | traverse_bottom_up (FunctorT &functor_) |
| Lambda compound bottom up traversal algorithm with mutable access to terminal nodes. | |
| template<typename FunctorT> | |
| void | traverse_top_down (FunctorT &functor_) const |
| Lambda compound top-down traversal algorithm with constant access to terminal nodes. | |
| template<typename FunctorT> | |
| void | traverse_top_down (FunctorT &functor_) |
| Lambda compound top-down traversal algorithm with mutable access to terminal nodes. | |
| xst_stack (xst_stack< StackT > const &other_) | |
| Copy constructor. | |
| xst_stack (value_T const &) | |
| Constructs stack primitive from type of object stored in the stack. | |
| xst_stack (StackT stack_) | |
| Constructs stack primitive from stack or reference to stack. | |
| xst_stack () | |
| Default constructor. | |
Static Public Member Functions | |
| template<typename FunctorT> | |
| void | subscript_bottom_up (FunctorT &functor_) |
| Subscript bottom-up traversal algorithm. | |
| template<typename FunctorT> | |
| void | subscript_top_down (FunctorT &functor_) |
| Subscript top-down subscript traversal algorithm. | |
|
|
Defines type of dereferenced stack primitive, which is type of object stored in the stack.
Definition at line 83 of file xst_stack.h. |
|
|
Defines type of left scalar primitive of lambda compound.
Definition at line 86 of file xst_stack.h. |
|
|
Defines reference type for stack primitive.
Definition at line 92 of file xst_stack.h. |
|
|
Defines type of right scalar primitive of lambda compound.
Definition at line 89 of file xst_stack.h. |
|
|
Defines type of encapsulated stack object.
Definition at line 77 of file xst_stack.h. |
|
|
Defines type of object stored in the stack.
Definition at line 80 of file xst_stack.h. |
|
|
Definition at line 62 of file xst_stack.h. |
|
|
Default constructor.
Definition at line 95 of file xst_stack.h. |
|
|
Constructs stack primitive from stack or reference to stack.
Definition at line 100 of file xst_stack.h. |
|
|
Constructs stack primitive from type of object stored in the stack.
Definition at line 112 of file xst_stack.h. |
|
|
Copy constructor.
Definition at line 117 of file xst_stack.h. |
|
|
Dereferenced stack primitive returns top stack element.
Definition at line 133 of file xst_stack.h. References cttl::alias::top(). |
|
|
Direct constant access to left-hand-side stack lambda compound node.
Definition at line 150 of file xst_stack.h. |
|
|
Direct mutable access to left-hand-side stack lambda compound node.
Definition at line 143 of file xst_stack.h. |
|
|
Manufactures copy of reference object for stack primitive.
Definition at line 124 of file xst_stack.h. |
|
|
Push data from stack.
Definition at line 247 of file xst_stack.h. |
|
||||||||||||
|
Push data to stack.
Definition at line 229 of file xst_stack.h. References CTTL_TRACE_DEPOSIT_TEXT, and cttl::alias::identity(). |
|
|
Direct constant access to right-hand-side stack lambda compound node.
Definition at line 162 of file xst_stack.h. |
|
|
Direct mutable access to right-hand-side stack lambda compound node.
Definition at line 156 of file xst_stack.h. |
|
|
Get stack size.
Definition at line 284 of file xst_stack.h. |
|
|
Get mutable pointer to stack encapsulated by lambda compound node.
Definition at line 310 of file xst_stack.h. |
|
|
Get constant pointer to stack encapsulated by lambda compound node.
Definition at line 297 of file xst_stack.h. |
|
|
Subscript bottom-up traversal algorithm.
Definition at line 181 of file xst_stack.h. References const_scalar. |
|
|
Subscript top-down subscript traversal algorithm.
Definition at line 174 of file xst_stack.h. References const_scalar. |
|
|
Mutable access to top element of stack.
Definition at line 271 of file xst_stack.h. |
|
|
Constant access to top element of stack.
Definition at line 259 of file xst_stack.h. |
|
|
Lambda compound bottom up traversal algorithm with constant access to terminal nodes.
Definition at line 206 of file xst_stack.h. |
|
|
Lambda compound bottom up traversal algorithm with mutable access to terminal nodes.
Definition at line 192 of file xst_stack.h. |
|
|
Lambda compound top-down traversal algorithm with constant access to terminal nodes.
Definition at line 213 of file xst_stack.h. |
|
|
Lambda compound top-down traversal algorithm with mutable access to terminal nodes.
Definition at line 199 of file xst_stack.h. |
1.3.9.1