Hash :
eeffae82
Author :
Thomas de Grivel
Date :
2020-05-02T17:17:07
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
/*
* Copyright 2020 Thomas de Grivel <thoxdg@gmail.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <assert.h>
#include "stack.h"
void stack_init (s_stack *s)
{
assert(s);
s->head = 0;
s->length = 0;
}
void stack_destroy (s_stack *s)
{
assert(s);
list_delete_all(s->head);
s->head = 0;
s->length = 0;
}
void stack_push (s_stack *s, void *item)
{
assert(s);
s->head = list_new(item, s->head);
assert(s->head);
s->length++;
}
void * stack_pop (s_stack *s)
{
void *item;
assert(s);
assert(s->length > 0);
assert(s->head);
item = s->head->item;
s->head = s->head->next;
s->length--;
return item;
}