8.基于C语言的通讯录管理系统
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define NAME_LENGTH 16
#define FILE_NAME_LENGTH 128
#define PHONE_LENGTH 32
#define BUFFER_LENGTH 128
#define MIN_TOKEN_LENGHT 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);
return 0;
}
int parser_token(char *buffer, int length, char *name, char *phone) {
if (buffer == NULL) return -1;
if (length < MIN_TOKEN_LENGHT) 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 toen : %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: aaa,telephone: 123
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;
}
// end
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;
}
int print_entry(struct contacts *cts) {
if (cts == NULL) return -1;
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 does not exist\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 does not exist\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[FILE_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[FILE_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;
}
作者:lotuslaw
出处:https://www.cnblogs.com/lotuslaw/p/18700103
版权:本作品采用「署名-非商业性使用-相同方式共享 4.0 国际」许可协议进行许可。
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
2024-02-05 2-3动态计算图