Mercurial > baum

comparison baum.c @ 10:0e15841ae111

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
s/list/stack/g because thats what it is
author meillo@marmaro.de
date Sat, 09 Feb 2008 16:49:29 +0100
parents c020b0d1cfca
children 8e34daa80f64
comparison
equal deleted inserted replaced
9:c020b0d1cfca 10:0e15841ae111
14 #include "baum.h" 14 #include "baum.h"
15 #include "actions.h" 15 #include "actions.h"
16 16
17 17
18 struct Node* root = 0; 18 struct Node* root = 0;
19 struct Listitem* list = NULL; 19 struct Stackitem* stack = NULL;
20 20
21 21
22 void logit(char* text) { 22 void logit(char* text) {
23 fprintf(stderr, "[%s]\n", text); 23 fprintf(stderr, "[%s]\n", text);
24 } 24 }
106 106
107 107
108 108
109 109
110 void push(struct Node* node) { 110 void push(struct Node* node) {
111 struct Listitem* tmp; 111 struct Stackitem* tmp;
112 struct Listitem* new; 112 struct Stackitem* new;
113 new = (struct Listitem*) malloc(sizeof(struct Listitem)); 113 new = (struct Stackitem*) malloc(sizeof(struct Stackitem));
114 new->node = node; 114 new->node = node;
115 tmp = list; 115 tmp = stack;
116 list = new; 116 stack = new;
117 list->next = tmp; 117 stack->next = tmp;
118 } 118 }
119 struct Node* pull() { 119 struct Node* pull() {
120 if (list == NULL) { 120 if (stack == NULL) {
121 return NULL; 121 return NULL;
122 } 122 }
123 struct Listitem* tmp; 123 struct Stackitem* tmp;
124 struct Node* node; 124 struct Node* node;
125 tmp = list; 125 tmp = stack;
126 list = list->next; 126 stack = stack->next;
127 node = tmp->node; 127 node = tmp->node;
128 free(tmp); tmp=0; 128 free(tmp); tmp=0;
129 return node; 129 return node;
130 } 130 }
131 131