From efc7bfe9b22d09b6fa87c80923e17034afe3098f Mon Sep 17 00:00:00 2001
From: Saturneic <huyibing@huyibingdeAir>
Date: Sat, 9 Jun 2018 16:25:07 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E5=A4=8D=E4=BA=86=E7=9B=AE=E5=BD=95?=
 =?UTF-8?q?=E3=80=82?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ZE-Standard-Libraries/list/list.c      |  32 --
 ZE-Standard-Libraries/list/list.h      | 451 -------------------------
 ZE-Standard-Libraries/list/list_easy.h |  72 ----
 3 files changed, 555 deletions(-)
 delete mode 100644 ZE-Standard-Libraries/list/list.c
 delete mode 100644 ZE-Standard-Libraries/list/list.h
 delete mode 100644 ZE-Standard-Libraries/list/list_easy.h

diff --git a/ZE-Standard-Libraries/list/list.c b/ZE-Standard-Libraries/list/list.c
deleted file mode 100644
index 582fd0c..0000000
--- a/ZE-Standard-Libraries/list/list.c
+++ /dev/null
@@ -1,32 +0,0 @@
-/* ********************************************************
- * This file is used to test the header file(list.h).
- * When the project is finished, this file will be deleted.
- * This file create by saturneric at 20:04 on Feb 7th.
- * *******************************************************/
-
-#include "list.h"
-
-int main(int argc, char **argv){	
-	rand_init();
-	safeMode(1);
-	List *t_list = init_list();
-	
-	for(int i = 0; i < 9; i++){
-		Node *t_node = init_node();
-		int *t_i = (int *)malloc(sizeof(int));
-		*t_i = i;
-		init_value(t_node,"int",(void *)t_i);
-		insertInTail(t_list,t_node);
-	}
-	
-	/*Node *t_node = init_node();
-	insertInTail(t_list,t_node);
-	init_value(t_node,(void *)"there");*/
-	
-	int *f_i = (int *)malloc(sizeof(int));
-	*f_i = 3;
-    //releaseMalloc();
-	releaseAll();
-	
-	return 0;
-}
diff --git a/ZE-Standard-Libraries/list/list.h b/ZE-Standard-Libraries/list/list.h
deleted file mode 100644
index d4ed1f7..0000000
--- a/ZE-Standard-Libraries/list/list.h
+++ /dev/null
@@ -1,451 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <time.h>
-
-#ifndef LIST_H 
-#define LIST_H
-
-typedef struct Node{
-	unsigned long long id;//唯一标识符
-	void *value;
-	int if_setvalue;//记录是否已经初始化值
-	const char *type;//记录值的类型
-	struct Node *next;
-	struct Node *last;
-}Node;
-
-
-typedef struct List{
-    unsigned long long id;//唯一标识符
-	Node *head;
-	Node *tail;
-	unsigned long long length;//链表长度
-}List;
-
-int safeMode(int ifon);//安全模式确保显式声明过的内存都会被释放
-int releaseMalloc(void);//释放所有声明过的内存
-int releaseSingleList(List *p_list);
-int releaseSingleNode(List *p_list);
-int releaseAll(void);//安全模式最后调用的函数
-
-List *init_list(void);
-Node *init_node(void);
-int init_value(Node *,const char *,void *);
-void init_rand(void);
-
-unsigned long long getId(void);
-
-int insertInHead(List *p_list, Node *p_node);
-int insertInTail(List *p_list, Node *p_node);
-
-int removeById(List *p_list, unsigned long id);
-int removeByNode(List *p_list, Node *p_node);
-
-int popFromHead(List *p_list);
-int popFromTail(List *p_list);
-
-unsigned long long len(List *p_list);
-
-Node *findById(List *p_list, const unsigned long long id);
-Node *findByValue(List *p_list, const char *type, const void *value);
-List *mply_findByValue(List *p_list, const char *type, const void *value);//寻找多个值匹配的节点
-
-int releaseList(List *p_list);
-int releaseNode(Node *p_node);
-
-int isListEmpty(List *p_list);
-
-/*有关安全模式的变量*/
-int if_safeMode = 0;
-List *node_list = NULL; //储存声明过的节点.
-List *list_list = NULL; //储存声明过的链表.
-
-int safeMode(int ifon){
-	if(ifon == 1){
-		if (node_list == NULL && list_list == NULL){
-			node_list = (List *)malloc(sizeof(List));
-			list_list = (List *)malloc(sizeof(List));
-            
-            list_list->head = NULL;
-            list_list->length = 0;
-            list_list->tail = NULL;
-            
-            node_list->head = NULL;
-            node_list->length = 0;
-            node_list->tail = NULL;
-            
-			if_safeMode = 1;
-		}
-		else{
-			return -1;
-		}
-	}
-	
-	return ifon;
-}
-
-int releaseSingleList(List *p_list){
-    Node *p_node = p_list->head;
-    List *plv_node = NULL;
-    while(p_node != NULL){
-        plv_node = (List *)p_node->value;
-        plv_node->id = 0;
-        plv_node->head = NULL;
-        plv_node->length = 0;
-        plv_node->tail = NULL;
-        free(plv_node);
-        p_node = p_node->next;
-    }
-    p_list->head = NULL;
-    p_list->length = 0;
-    p_list->tail = NULL;
-    p_list->id = 0;
-    free(p_list);
-    return 0;
-}
-
-int releaseSingleNode(List *p_list){
-    Node *p_node = p_list->head;
-    Node *pnv_node = NULL;
-    while(p_node != NULL){
-        pnv_node = (Node *)p_node->value;
-        pnv_node->id = 0;
-        pnv_node->if_setvalue = 0;
-        pnv_node->last = NULL;
-        pnv_node->next = NULL;
-        pnv_node->type = NULL;
-        pnv_node->value = NULL;
-        free(pnv_node);
-        p_node = p_node->next;
-    }
-    p_list->id = 0;
-    p_list->head = NULL;
-    p_list->length = 0;
-    p_list->tail = NULL;
-    free(p_list);
-    return 0;
-}
-
-int releaseAll(void){
-	if(if_safeMode == 1){
-		if_safeMode = 0;
-		releaseList(node_list);
-		releaseSingleList(list_list);
-	}
-	return 0;
-}
-
-Node *init_node(void){
-	Node *p_node = (Node *) malloc(sizeof(Node));
-	p_node->id = getId();
-	p_node->if_setvalue = 0;
-    p_node->next = NULL;
-    p_node->last = NULL;
-    if(if_safeMode) {
-        if_safeMode = 0;
-        Node *prec_node = init_node();
-        if_safeMode = 1;
-        init_value(prec_node, "pointer", (void *)p_node);
-        insertInTail(node_list,prec_node);
-    }
-	return p_node;
-}
-
-List *init_list(void){
-	List *p_list = (List *) malloc(sizeof(List));
-    p_list->id = getId();
-	p_list->head = NULL;
-	p_list->tail = NULL;
-    p_list->length = 0;
-	if(if_safeMode){
-        if_safeMode = 0;
-		Node *p_node = init_node();
-        if_safeMode = 1;
-        init_value(p_node,"pointer",(void *)p_list);
-		insertInTail(list_list,p_node);
-	}
-	return p_list;
-}
-
-int init_value(Node *p_node,const char *type,void *p_value){
-	p_node->if_setvalue = 1;
-	p_node->type = type;
-	p_node->value = p_value;
-	return 0;
-}
-
-void rand_init(void){
-	srandom((unsigned)time(NULL));
-}
-
-unsigned long long getId(void){
-	unsigned long long id = 0;
-	id = ((random()%9)+1);
-	for(int i = 0; i < 15; i++){
-		id *= 10;
-		id += random()%10;
-	}
-	return id;
-}
-
-int insertInHead(List *p_list, Node *p_node){
-	if( isListEmpty(p_list) ){
-		p_list->head = p_node;
-		p_list->tail = p_node;
-	}
-	else{
-		p_list->head->last = p_node;
-		p_node->last = NULL;
-		p_node->next = p_list->head;
-		p_list->head = p_node;
-	}
-	p_list->length += 1;
-	return 0;
-}
-
-int insertInTail(List *p_list, Node *p_node){
-	if( isListEmpty(p_list) ){
-		p_list->head = p_node;
-		p_list->tail = p_node;
-	}
-	else{
-		p_list->tail->next = p_node;
-		p_node->next = NULL;
-		p_node->last = p_list->tail;
-		p_list->tail = p_node;
-	}
-	p_list->length += 1;
-	return 0;
-}
-
-int releaseNode(Node *p_node){
-	if(if_safeMode == 1){
-		removeByNode(node_list,p_node);
-	}
-	if(p_node->if_setvalue == 1){
-		free(p_node->value);
-		p_node->value = NULL;
-	}
-	p_node->last = NULL;
-	p_node->next = NULL;
-    p_node->type = NULL;
-    p_node->value = NULL;
-    p_node->id = 0;
-    p_node->if_setvalue = 0;
-	free(p_node);
-	return 0;
-}
-
-
-
-int releaseList(List *p_list){
-	Node *p_node, *pl_node;
-	p_node = p_list->head;
-	if(if_safeMode == 1){
-		Node *tar_list = findByValue(list_list,"pointer",(void *)p_list);//turn pointer in to int to compare.
-		removeByNode(list_list,tar_list);
-	}
-	while (p_node != NULL){
-		pl_node = p_node;
-		p_node = p_node->next;
-		pl_node->next = NULL;
-		pl_node->last = NULL;
-		releaseNode(pl_node);
-	}
-	p_list->head = NULL;
-	p_list->tail = NULL;
-	p_list->length = 0;
-    p_list->id = 0;
-	free(p_list);
-	return 0;
-}
-
-unsigned long long len(List *p_list){
-	return p_list->length;
-}
-
-int removeById(List *p_list, unsigned long id){
-	Node *tmp = p_list->head;
-	if( isListEmpty(p_list) )
-		return -1;
-	do{	
-		if(tmp->id == id) {
-			tmp->last->next = tmp->next;
-			tmp->next->last = tmp->last;
-			//releaseNode(tmp); 在安全模式下不必要
-			p_list->length -= 1;
-			return 1;//found
-		}
-		else{
-			tmp = tmp->next;
-		}
-	}while(tmp != NULL);
-
-	return 0;//not find
-}
-
-int removeByNode(List *p_list, Node *p_node){
-	Node *tmp = p_list->head;
-	if( isListEmpty(p_list) )
-		return -1;
-	do{
-		if(tmp == p_node){
-			tmp->last->next = tmp->next;
-			tmp->next->last = tmp->last;
-			//releaseNode(tmp); 在安全模式下不必要
-			p_list->length -= 1;
-			return 1;//found
-		}
-		else{
-			tmp = tmp->next;
-		}	
-	}while(tmp != NULL);
-
-	return 0;//not find
-}
-
-int popFromHead(List *p_list){
-	if( isListEmpty(p_list) )
-		return -1;
-	else{
-		//Node *tmp = p_list->head;
-		p_list->head->next->last = NULL;
-		p_list->head = p_list->head->next;
-		//releaseNode(tmp); not necessary
-		p_list->length -= 1;
-	}
-
-	if( isListEmpty(p_list) ){
-		p_list->head = NULL;
-		p_list->tail = NULL;
-	}
-	return 0;
-}
-
-int popFromTail(List *p_list){
-	if( isListEmpty(p_list) )
-		return -1;
-	else{
-		//Node *tmp = p_list->tail;
-		p_list->tail->last->next = NULL;
-		p_list->tail = p_list->tail->last;
-		//releaseNode(tmp); not necessary
-		p_list->length -= 1;
-	}
-
-	if( isListEmpty(p_list) ){
-		p_list->head = NULL;
-		p_list->tail = NULL;
-	}
-	return 0;
-}
-
-/*该函数算法需要改进*/
-Node *findById(List *p_list, const unsigned long long id){
-	Node *ph_node = p_list->head;
-	Node *pt_node = p_list->tail;
-	int direction = 0;
-	while(ph_node != pt_node){
-		if (direction == 0){
-			if (ph_node->id == id){
-				return ph_node;
-			}
-			else{
-				ph_node = ph_node->next;
-			}
-			direction = 1;
-		}
-		else{
-			if (pt_node->id == id){
-				return pt_node;
-			}
-			else{
-				pt_node = pt_node->last;
-			}
-		}
-	}
-	return NULL;
-}
-
-
-Node *findByValue(List *p_list, const char *type, const void *value){
-	Node *p_node = p_list->head;
-	while(p_node != NULL){
-		if(strcmp(p_node->type,type)) continue;//continue when type is not the same.
-		if(!strcmp(type,"int")){
-			if(*((int *)p_node->value) == *((int *)value)){
-				return p_node;
-			}
-		}
-		else if(!strcmp(type,"double")){
-			if(*((double *)p_node->value) == *((double *)value)){
-				return p_node;
-			}
-		}
-		else if(!strcmp	(type,"string")){
-			if(!strcmp((char *)p_node->value,(char *)value))
-			{
-				return p_node;
-			}
-		}
-		else if(!strcmp(type,"pointer")){
-			if(p_node->value == value){
-				return p_node;
-			}
-		}
-		
-		p_node = p_node->next;
-		
-	}
-	return NULL;
-}
-
-List *mply_findByValue(List *p_list, const char *type, const void *value){
-	List *f_list = init_list();
-	Node *p_node = p_list->head;
-	while(p_node != NULL){
-		if(strcmp(p_node->type,type)) continue;
-		if(!strcmp(type,"int")){
-			if(*((int *)p_node->value) == *((int *)value)){
-				Node *f_node = init_node();
-				init_value(f_node,"pointer",(void *)p_node);
-				insertInTail(f_list,f_node);
-			}
-		}
-		else if(!strcmp(type,"double")){
-			if(*((double *)p_node->value) == *((double *)value)){
-				Node *f_node = init_node();
-				init_value(f_node,"pointer",(void *)p_node);
-				insertInTail(f_list,f_node);
-			}
-		}
-		else if(!strcmp	(type,"string")){
-			if(!strcmp((char *)p_node->value,(char *)value))
-			{
-				Node *f_node = init_node();
-				init_value(f_node,"pointer",(void *)p_node);
-				insertInTail(f_list,f_node);
-			}
-		}
-		else if(!strcmp(type,"pointer")){
-			if(p_node->value == value){
-				Node *f_node = init_node();
-				init_value(f_node,"pointer",(void *)p_node);
-				insertInTail(f_list,f_node);
-			}
-		}
-		
-		p_node = p_node->next;
-		
-	}
-	return f_list;
-}
-
-int isListEmpty(List *p_list){
-	if(p_list->head == NULL || p_list->tail == NULL)// If its head or tail is NULL,it would be thought as empty.
-		return 1;				// But we should ensure that both of them are NULL when we
-	return 0;					// want to make a list empty.
-}
-
-#endif
diff --git a/ZE-Standard-Libraries/list/list_easy.h b/ZE-Standard-Libraries/list/list_easy.h
deleted file mode 100644
index e35c68e..0000000
--- a/ZE-Standard-Libraries/list/list_easy.h
+++ /dev/null
@@ -1,72 +0,0 @@
-#include "list.h"
-
-#ifndef LIST_EASY_H
-#define LIST_EASY_H
-
-Node *new_nodeWithInt(int);
-Node *new_nodeWithDouble(double);
-Node *new_nodeWithString(const char *);
-Node *new_nodeWithPointer(void *);
-Node *find_nodeByIndex(List *, unsigned long long);
-int list_through(List *p_list, int (*p_func)(void *, const char *));//Go through the list.Call p_func every time.
-
-
-Node *new_nodeWithInt(int m_int){
-	int *p_int = (int *)malloc(sizeof(int));
-	*p_int = m_int;
-	Node *p_node = init_node();
-	init_value(p_node,"int",(void *)p_int);
-	return p_node;
-}
-
-Node *new_nodeWithDouble(double m_double){
-	double *p_double = (double *)malloc(sizeof(double));
-	*p_double = m_double;
-	Node *p_node = init_node();
-	init_value(p_node,"double",(void *)p_double);
-	return p_node;
-}
-
-Node *new_nodeWithString(const char *m_string){
-	char *p_string = (char *)malloc(sizeof(char)*(strlen(m_string)+1));
-	strcpy(p_string,m_string);
-	Node *p_node = init_node();
-	init_value(p_node,"string",(void *)p_string);
-	return p_node;
-}
-
-Node *new_nodeWithPointer(void *m_pointer){
-	Node *p_node = init_node();
-	init_value(p_node,"pointer",(void *)m_pointer);
-	return p_node;
-}
-
-Node *find_nodeByIndex(List *p_list, unsigned long long m_index){
-	Node *p_node = p_list->head;
-	for(unsigned long long i= 0; i < m_index; i++){
-		p_node = p_node->next;
-	}
-	return p_node;
-}
-
-int list_through(List *p_list, int (*p_func)(void *, const char *)){
-	Node *p_node = p_list->head;
-	while(p_node != NULL){
-		if(p_node->if_setvalue == 1){
-			int m_return = (*p_func)(p_node->value, p_node->type);
-			if (m_return == -1) break;
-			else if (m_return == 1){
-				p_node = p_node->last;
-				continue;
-			}
-			else{
-				
-			}
-		}
-		p_node = p_node->next;
-	}
-	return 0;
-}
-
-
-#endif