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
71
72
73
74
75
76
77
|
/*:*
*: File: ./src/data/stack.h
*: A simple interpreter
*:
*: WWW : http://fype.buetow.org
*: E-Mail : fype@dev.buetow.org
*:
*: Copyright (c) 2005 2006 2007 2008, Dipl.-Inf. (FH) Paul C. Buetow
*: All rights reserved.
*:
*: Redistribution and use in source and binary forms, with or without modi-
*: fication, are permitted provided that the following conditions are met:
*: * Redistributions of source code must retain the above copyright
*: notice, this list of conditions and the following disclaimer.
*: * Redistributions in binary form must reproduce the above copyright
*: notice, this list of conditions and the following disclaimer in the
*: documentation and/or other materials provided with the distribution.
*: * Neither the name of P. B. Labs nor the names of its contributors may
*: be used to endorse or promote products derived from this software
*: without specific prior written permission.
*:
*: THIS SOFTWARE IS PROVIDED BY Paul Buetow AS IS'' AND ANY EXPRESS OR
*: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
*: WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
*: DISCLAIMED. IN NO EVENT SHALL Paul Buetow BE LIABLE FOR ANY DIRECT,
*: INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
*: (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
*: SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
*: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
*: STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
*: IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
*: POSSIBILITY OF SUCH DAMAGE.
*:*/
#ifndef STACK_H
#define STACK_H
#define stack_top(s) s->p_first->p_val;
#include <stdlib.h>
typedef struct StackElem_ {
struct StackElem_ *p_next;
void *p_val;
} StackElem;
typedef struct {
StackElem *p_first;
StackElem *p_last; // Only needed for stack_merge
unsigned i_size;
} Stack;
typedef struct {
StackElem *p_current;
StackElem *p_prev;
} StackIterator;
Stack *stack_new();
StackElem *stackelem_new();
_Bool stack_empty(Stack *p_stack);
void stack_iterate(Stack *p_stack, void (*func)(void *p_void));
void stack_push(Stack *p_stack, void *p_val);
void stack_debug(Stack *p_stack, void *p_val);
void *stack_pop(Stack *p_stack);
void stack_clear(Stack *p_stack);
void stack_delete(Stack *p_stack);
void stack_delete_and_free(Stack *p_stack);
unsigned stack_size(Stack *p_stack);
void stack_merge(Stack *p_stack, Stack *p_stack_merge);
void stack_concat(Stack *p_stack, Stack *p_stack_concat);
StackIterator* stackiterator_new(Stack *p_stack);
void stackiterator_delete(StackIterator *p_iter);
_Bool stackiterator_has_next(StackIterator *p_iter);
void* stackiterator_next(StackIterator *p_iter);
_Bool stackiterator_remove_prev(StackIterator *p_iter);
#endif
|
