#include <stack.h>
Public Member Functions | |
LockFreeStack () | |
constructor | |
~LockFreeStack () | |
destructor | |
bool | pop (T &ret) |
Pop data from the Stack. | |
void | push (const T d) |
Push data onto Stack. | |
bool | empty () |
Check to see if Stack is empty. | |
int | size () |
Get the size of stack. | |
bool | peekTop (T &ret) |
Get the topmost element in the stack. If the stack is empty, it will return false. else return true and assign the topmost element to the parameter. | |
Classes | |
class | StackNode |
The node type, which stores the data and a next pointer in it. More... |
T | Type of element stored in it |
amino::LockFreeStack< T >::LockFreeStack | ( | ) | [inline] |
constructor
amino::LockFreeStack< T >::~LockFreeStack | ( | ) | [inline] |
destructor
bool amino::LockFreeStack< T >::pop | ( | T & | ret | ) | [inline] |
void amino::LockFreeStack< T >::push | ( | const T | d | ) | [inline] |
Push data onto Stack.
d | data to be pushed into the stack. |
bool amino::LockFreeStack< T >::empty | ( | ) | [inline] |
Check to see if Stack is empty.
int amino::LockFreeStack< T >::size | ( | ) | [inline] |
Get the size of stack.
bool amino::LockFreeStack< T >::peekTop | ( | T & | ret | ) | [inline] |
Get the topmost element in the stack. If the stack is empty, it will return false. else return true and assign the topmost element to the parameter.
ret | The topmost element in the stack. It is valid if the return value is true. |