ZE-Standard-Libraries/test/test.c

#include "test.h"


int list(void) {
    List *p_list = initList(1);
    for(int i = 0; i < 12; i++){
        insertInTail(p_list, nodeWithInt(i, 0));
    }
    D_FILE *pd_file = initDataFileForWrite("data.db");
    STD_DATA *p_std = listToSTD(p_list);
    STD_DATA *pa_std = listToSTD(p_list);
    dataFileAddStandardData(pd_file, p_std);
    dataFileAddStandardData(pd_file, pa_std);
    dataFileWriteIn(pd_file);
    releaseList(p_list);
    releaseDFile(pd_file);

	return 0;
}

/*int _useTreeThroughDown(TNode *p_tnode, unsigned long long height) {
	printTNode(p_tnode,0);
	return  0;
}*/

/*int tree(void) {
	TNode *t_tnode, *cr_tnode, *cl_tnode;
	Tree *t_tree;
	TNode *gs_tnode;
	safeModeForTree(1);
	t_tree = initTree();
	t_tnode = tnodeWithInt(1);
	cr_tnode = tnodeWithInt(3);
	cl_tnode = tnodeWithInt(2);
	addChildInRight(t_tnode, cl_tnode);
	addChildInRight(t_tnode, cr_tnode);
	addChildInRight(cl_tnode, tnodeWithInt(4));
	gs_tnode = tnodeWithInt(5);
	addChildInRight(cl_tnode,gs_tnode);
	addChildInRight(cr_tnode, tnodeWithInt(6));
	addChildInRight(cr_tnode, tnodeWithInt(7));
	addChildInRight(gs_tnode, tnodeWithInt(8));
	setRoot(t_tree, t_tnode);
	TreeThroughUp(t_tree, _useTreeThroughDown);
	//printTNodeWithFamily(t_tnode, 0);
	releaseAllForTree();
	return 0;
}*/

int stack(void) {
	int i;
	Stack *t_stack = initStack();
	for (i = 0; i < 10; i++) {
		pushStack(t_stack, snodeWithInt(i));
	}
	for (i = 0; i < 10; i++) {
		printf("%d", getValueByIntForSNode(popStack(t_stack)));
	}
	releaseStack(t_stack);
	return 0;
}

int time_avg(void){
    List *t_list = initList(0);
    int64_t time_all = 0;
    for(int i = 0; i < 65535; i++) insertInTail(t_list,nodeWithInt(i, 0));
    for(int i = 0; i < 65535; i++) insertInTail(t_list,nodeWithInt(i, 0));
    for(int i = 0; i < 65535; i++) insertInTail(t_list,nodeWithInt(i, 0));
    for(int i = 0; i < 65535; i++) insertInTail(t_list,nodeWithInt(i, 0));
    for(int i = 0; i < 65535; i++) insertInTail(t_list,nodeWithInt(i, 0));
    enableListQuick(t_list);
    for (int i = 0; i < 100; i++){
     struct timeval start,stop;
     gettimeofday(&start,0);
     findByIndexForNode(t_list, 200000);
     gettimeofday(&stop,0);
     time_all += (int64_t)(stop.tv_usec-start.tv_usec);
     
     }
     double avg_time = (double) (time_all/(int64_t)100);
     printf("TIME: %fus\n",avg_time);
    releaseList(t_list);
    return 0;
}

int main(int argc, char **argv) {
    //time_avg();
    /*List *t_list = initList(0);
    for(int i = 0; i < 65535; i++) lisrti(t_list, i);
    for(int i = 0; i < 65535; i++) lisrti(t_list, i);
    for(int i = 0; i < 65535; i++) lisrti(t_list, i);
    for(int i = 0; i < 65535; i++) lisrti(t_list, i);
    for(int i = 0; i < 65535; i++) lisrti(t_list, i);
    enableListQuick(t_list);
    findByIndexForNode(t_list, 300000);
    lisrhi(t_list, -1);
    insertBeforeNode(t_list, findByIndexForNode(t_list, 5), lni(6));
    popFromHead(t_list);
    Node *p_node = findByIndexForNode(t_list, 7);
    releaseList(t_list);*/
    while(1){
        List *p_list = initList(0);
        for(int i = 0; i < 65535; i++){
            insertInTail(p_list, nodeWithInt(i, 1));
        }
        releaseList(p_list);
    }
	return 0;
}