3.0 inuxC编程实现通讯录项目（实际编程）

最新推荐文章于 2024-08-06 23:23:19 发布

itc工程师马虎虎

最新推荐文章于 2024-08-06 23:23:19 发布

阅读量130

点赞数

分类专栏： C++ 文章标签：数据结构链表 python

本文链接：https://blog.csdn.net/vernon055/article/details/119903963

版权

C++ 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

inuxC编程实现通讯录（结构体）
项目目的：了解结构体定义、数据结构
项目知识点：链表操作，添加节点，遍历，查找
推荐书籍：大话数据结构
课后练习题：按照姓名首字母存储通讯录，使用数组加链表

通讯录实现的架构设计与需求分析

1、把通讯录当成一款产品要怎么分析需求呢？
添加人员
打印显示所有人员
删除某一个人员
查找某一个人员
保存文件
加载文件

2、人员如何存储——用链表的方式
存储人员信息有哪些——姓名、电话
文件存储——人员数据的格式是什么？
姓名：xxx 电话：xxx

3、架构设计
从底层操作到最上层的操作依次是；
最底层操作：链表存储、文件读写
接口层操作：统一接口层，不管你底层换了什么存储方式对上层的业务逻辑没有影响
最上层操作：业务逻辑，就是添加、删除等操作
架构图
4、代码实现，这里是用C语言实现，你可以用其他语言


#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//宏定义
#define NAME_LENGTH			16
#define PHONE_LENGTH		32
#define BUFFER_LENGTH		128
#define MIN_TOKEN_LENGTH	5
#define INFO			printf
//宏定义链表的添加和删除，也可以用函数实现
#define LIST_INSERT(item, list) do {	\
	item->prev = NULL;					\
	item->next = list;					\
	if ((list) != NULL) (list)->prev = item; \
	(list) = item;						\
} while(0)
#define LIST_REMOVE(item, list) do {	\
	if (item->prev != NULL) item->prev->next = item->next; \
	if (item->next != NULL) item->next->prev = item->prev; \
	if (list == item) list = item->next; 					\
	item->prev = item->next = NULL;							\
} while(0)
//结构体的数据封装
//个人信息结构体
struct person {
	char name[NAME_LENGTH];
	char phone[PHONE_LENGTH];
//添加链表指针
	struct person *next;
	struct person *prev;
	
};
//通讯录结构体
struct contacts {
	struct person *people;
	int count;
};
//用枚举的方式替代数字
enum {
	OPER_INSERT = 1,
	OPER_PRINT,
	OPER_DELETE,
	OPER_SEARCH,
	OPER_SAVE,
	OPER_LOAD
};

// define interface 
//接口层,添加功能
int person_insert(struct person **ppeople, struct person *ps) {
	if (ps == NULL) return -1;

	LIST_INSERT(ps, *ppeople);

	return 0;}
	//删除功能
	int person_delete(struct person **ppeople, struct person *ps) {

	if (ps == NULL) return -1;
	if (ppeople == NULL) return -2;

	LIST_REMOVE(ps, *ppeople);

	return 0;
	
}
//查找功能
struct person* person_search(struct person *people, const char *name) {

	struct person *item = NULL;
	for (item = people;item != NULL;item = item->next) {
		if (!strcmp(name, item->name)) 
			break;
	}

	return item;
}
//打印功能
int person_traversal(struct person *people) {

	struct person *item = NULL;
	for (item = people;item != NULL;item = item->next) {
		INFO("name: %s,phone: %s\n", item->name, item->phone);
	}

	return 0;
}
//保存文件操作
int save_file(struct person *people, const char *filename) {

	FILE *fp = fopen(filename, "w");
	if (fp == NULL) return -1;

	struct person *item = NULL;
	for (item = people; item != NULL;item = item->next) {
	fprintf(fp, "name: %s, phone: %s\n", item->name, item->phone);
		fflush(fp);
	}

	fclose(fp);
}
int parser_token(char *buffer, int length, char *name, char *phone) {

	if (buffer == NULL) return -1;
	if (length < MIN_TOKEN_LENGTH) return -2;
	int i = 0, j = 0, status = 0;
	for (i = 0;buffer[i] != ',';i ++) {
		if (buffer[i] == ' ') {
			status = 1;
		} else if (status == 1) {
			name[j ++] = buffer[i];
		}
	}
	status = 0;
	j = 0;
	for (;i < length;i ++) {
		if (buffer[i] == ' ') {
			status = 1;
		} else if (status == 1) {
			phone[j ++] = buffer[i];
		}
	}
INFO("file token : %s --> %s\n", name, phone);

	return 0;
	
}
//加载文件
int load_file(struct person **ppeople, int *count, const char *filename) {

	FILE *fp = fopen(filename, "r");
	if (fp == NULL) return -1;

	while (!feof(fp)) {
	char buffer[BUFFER_LENGTH] = {0};
		fgets(buffer, BUFFER_LENGTH, fp);
		int length = strlen(buffer);
		INFO("length : %d\n", length);

		// name: qiuxiang,telephone: 98765678123
		char name[NAME_LENGTH] = {0};
		char phone[PHONE_LENGTH] = {0};
		if (0 != parser_token(buffer, length, name, phone)) {
			continue;
			struct person *p = (struct person*)malloc(sizeof(struct person));
		if (p == NULL) return -2;

		memcpy(p->name, name, NAME_LENGTH);
		memcpy(p->phone, phone, PHONE_LENGTH);

		person_insert(ppeople, p);
		
		(*count) ++;
		}
		}

	fclose(fp);

	return 0;
}
//业务逻辑实现
//添加
int insert_entry(struct contacts *cts) {

	if (cts == NULL) return -1;

	struct person *p = (struct person*)malloc(sizeof(struct person));
	if (p == NULL) return -2;
	memset(p, 0, sizeof(struct person));
	// name
	INFO("Please Input Name: \n");
	scanf("%s", p->name); //
	
	// phone
	INFO("Please Input Phone: \n");
	scanf("%s", p->phone);
	// add people
	if (0 != person_insert(&cts->people, p)) {
		free(p);
		return -3;
	}
	cts->count ++;
	INFO("Insert Success\n");

	return 0;}
	//打印
nt print_entry(struct contacts *cts) {

	if (cts == NULL) return -1;

	// cts->people
	person_traversal(cts->people);
}
//删除
int delete_entry(struct contacts *cts) {
	
	if (cts == NULL) return -1;

	INFO("Please Input Name : \n");
	char name[NAME_LENGTH] = {0};
	scanf("%s", name);

	// person
	struct person *ps = person_search(cts->people, name);
	if (ps == NULL) {
		INFO("Person don't Exit\n");
		return -2;
	}
	INFO("name: %s, phone: %s\n", ps->name, ps->phone);

	// delete
	person_delete(&cts->people, ps);
	free(ps);

	return 0;
}
//查找
int search_entry(struct contacts *cts) {

	if (cts == NULL) return -1;

	INFO("Please Input Name : \n");
	char name[NAME_LENGTH] = {0};
	scanf("%s", name);

	// person
	struct person *ps = person_search(cts->people, name);
	if (ps == NULL) {
		INFO("Person don't Exit\n");
		return -2;
	}

	INFO("name: %s,phone: %s\n", ps->name, ps->phone);

	return 0;
}
//保存
int save_entry(struct contacts *cts) {

	if (cts == NULL) return -1;

	INFO("Please Input Save Filename :\n");
	char filename[NAME_LENGTH] = {0};
	scanf("%s", filename);

	save_file(cts->people, filename);
	
}
//加载
int load_entry(struct contacts *cts) {
	if (cts == NULL) return -1;

	INFO("Please Input Load Filename :\n");
	char filename[NAME_LENGTH] = {0};
	scanf("%s", filename);

	load_file(&cts->people, &cts->count, filename);
}
//显示菜单
void menu_info(void) {

	INFO("\n\n********************************************************\n");
	INFO("***** 1. Add Person\t\t2. Print People ********\n");
	INFO("***** 3. Del Person\t\t4. Search Person *******\n");
	INFO("***** 5. Save People\t\t6. Load People *********\n");
	INFO("***** Other Key for Exiting Program ********************\n");
	INFO("********************************************************\n\n");

}
//主函数
int main() {

	struct contacts *cts = (struct contacts *)malloc(sizeof(struct contacts));
	if (cts == NULL) return -1;

	memset(cts, 0, sizeof(struct contacts));

	while (1) {
   menu_info();

		int select = 0;
		scanf("%d", &select);

		switch (select) {

			case OPER_INSERT:
				insert_entry(cts);
				break;

			case OPER_PRINT:
				print_entry(cts);
				break;
				case OPER_DELETE:
				delete_entry(cts);
				break;

			case OPER_SEARCH:
				search_entry(cts);
				break;

			case OPER_SAVE:
				save_entry(cts);
				break;

			case OPER_LOAD:
				load_entry(cts);
				break;

			default:
			goto exit;
				
		}

	}

exit:

	free(cts);
	
	return 0;

}

itc工程师马虎虎

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
3.0 inuxC编程实现通讯录项目（实际编程）

inuxC编程实现通讯录（结构体）项目目的：了解结构体定义、数据结构项目知识点：链表操作，添加节点，遍历，查找推荐书籍：大话数据结构课后练习题：按照姓名首字母存储通讯录，使用数组加链表通讯录实现的架构设计与需求分析1、把通讯录当成一款产品要怎么分析需求呢？添加人员打印显示所有人员删除某一个人员查找某一个人员保存文件加载文件2、人员如何存储——用链表的方式存储人员信息有哪些——姓名、电话文件存储——人员数据的格式是什么？姓名：xxx 电话：xxx3、架构设计从底层操
复制链接

扫一扫