-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.c
71 lines (57 loc) · 1.52 KB
/
stack.c
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/***************************************************************************
begin........: June 2012
copyright....: Sebastian Fedrau
email........: sebastian.fedrau@gmail.com
***************************************************************************/
/***************************************************************************
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License v3 as published by
the Free Software Foundation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License v3 for more details.
***************************************************************************/
/**
* \file stack.c
* \brief Generic stack.
* \author Sebastian Fedrau <sebastian.fedrau@gmail.com>
*/
#include <stdlib.h>
#include <assert.h>
#include "stack.h"
bool
stack_pop(Stack *stack, void **data)
{
assert(stack != NULL);
assert(data != NULL);
bool success = false;
if(slist_count(stack))
{
void *ptr = slist_pop(stack);
if(data)
{
*data = ptr;
}
success = true;
}
else if(data)
{
*data = NULL;
}
return success;
}
bool
stack_head(const Stack *stack, void **data)
{
assert(stack != NULL);
assert(data != NULL);
SListItem *iter = slist_head(stack);
bool success = false;
if(iter)
{
*data = iter->data;
success = true;
}
return success;
}