void stackPush(stack_t *stackP, stackElement_t element) { if (stackIsFull(stackP)) exit(EXIT_FAILURE); stackP->contents[++stackP->top] = element; }
int push(stack *s, btree_node *e) { int r = 0; if (!stackIsFull(s)) { s->top++; s->els[s->top] = e; } return r; }
//push int stackPush(struct stack *stack, void *data){ pthread_mutex_lock(&stack->lock); if(!stackIsFull(stack)){ stack->row[++stack->top] = data; pthread_mutex_unlock(&stack->lock); return 1; } pthread_mutex_unlock(&stack->lock); return -1; }
void stackPush(stackT *stackP, struct Node element) { check(!stackIsFull(stackP), "can't push: stack is full"); stackP->contents[stackP->top++] = element; }