63 lines
1.1 KiB
C
63 lines
1.1 KiB
C
|
#include "test.h"
|
||
|
|
|
||
|
|
int list(void) {
|
||
|
|
init_rand();
|
||
|
|
safeModeForNode(1);
|
||
|
|
List *t_list = initList();
|
||
|
|
|
||
|
|
/*for(int i = 0; i < 9; i++){
|
||
|
|
Node *t_node = initNode();
|
||
|
|
int *t_i = (int *)malloc(sizeof(int));
|
||
|
|
*t_i = i;
|
||
|
|
initMallocValue(t_node,"int",(void *)t_i);
|
||
|
|
insertInTail(t_list,t_node);
|
||
|
|
}*/
|
||
|
|
|
||
|
|
/*Node *t_node = initNode();
|
||
|
|
insertInTail(t_list,t_node);
|
||
|
|
initMalllocValue(t_node,(void *)"there");*/
|
||
|
|
|
||
|
|
for (int i = 0; i < 12; i++) {
|
||
|
|
insertInHead(t_list, nodeWithInt(i));
|
||
|
|
insertInTail(t_list, nodeWithInt(i));
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
printListInfo(t_list, 0);
|
||
|
|
printList(t_list);
|
||
|
|
List *m_list;
|
||
|
|
m_list = m_findByIntForNode(t_list, 5);
|
||
|
|
printList(m_list);
|
||
|
|
printf("\n");
|
||
|
|
|
||
|
|
releaseAllForNode();
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
int tree(void) {
|
||
|
|
safeModeForTree(1);
|
||
|
|
Tree *t_tree = initTree();
|
||
|
|
releaseAllForTree();
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
int stack(void) {
|
||
|
|
Stack *t_stack = initStack();
|
||
|
|
for (int i = 0; i < 10; i++) {
|
||
|
|
pushStack(t_stack, snodeWithInt(i));
|
||
|
|
}
|
||
|
|
for (int i = 0; i < 10; i++) {
|
||
|
|
printf("%d", getValueByIntForSNode(popStack(t_stack)));
|
||
|
|
}
|
||
|
|
releaseStack(t_stack);
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
int main(int argc, char **argv) {
|
||
|
|
tree();
|
||
|
|
getchar();
|
||
|
|
return 0;
|
||
|
|
}
|