13 return( theStack ? (intptr_t) theStack->
top : 0);
42 newNode->
info=newInfoPointer;
44 theStack->
top=newNode;
45 theStack->
tail=newNode;
48 newNode->
info=newInfoPointer;
50 theStack->
top=newNode;
61 oldNode=theStack->
top;
void StackDestroy(stk_stack *theStack, void DestFunc(void *a))
struct stk_stack_node * next
intptr_t StackNotEmpty(stk_stack *theStack)
void StackPush(stk_stack *theStack, DATA_TYPE newInfoPointer)
DATA_TYPE StackPop(stk_stack *theStack)
stk_stack * StackJoin(stk_stack *stack1, stk_stack *stack2)
stk_stack * StackCreate()
void * SafeMalloc(size_t size)