C语言学习之维护零件数据库（链表）

通过链表的使用，与结构数组的用法进行比较，学习各自的特点
readline.h和之前相同

// Maintains a parts database(array version)
#include "readline.h"
#include <stdio.h>
#include <stdlib.h>

#define NAME_LEN 25

struct part {
	int number;
	char name[NAME_LEN + 1];
	int on_hand;
	struct part *next;
};

struct part *inventory = NULL;//变量inventory是指向链表首节点的指针
struct part *find_part(int number);
void insert(void);
void search(void);
void update(void);
void print(void);

int main(void)
{
	char code;

	for (;;) {
		printf("Enter operation code: ");
		scanf(" %c", &code);//%c允许scanf函数再度入操作码之前跳过空白字符（前一行输入行末尾的换行符）
		while (getchar() != '\n')
			;
		switch (code) {
		case 'i':insert();
			break;
		case 's':search();
			break;
		case 'u':update();
			break;
		case 'p':print();
			break;
		case 'q':return 0;
		default:printf("Illegal code\n");
		}
		printf("\n");
	}
}

struct part *find_part(int number)//与结构数组查找方式不同
{
	struct part *p;

	for (p = inventory;
		p != NULL && number > p->number;
		p = p->next)
		;
	if (p != NULL && number == p->number)
		return p;//返回当前指针，即链表中零件的位置
	return NULL;//如果没找到该零件编号，返回空指针
}

void insert(void)
{
	struct part *cur, *prev, *new_node;//具有part结构的指针

	new_node = malloc(sizeof(struct part));
	if (new_node == NULL) {
		printf("Database is full; can't add more parts.\n");
		return;
	}

	printf("Enter part number: ");
	scanf("%d", &new_node->number);

	for (cur = inventory, prev = NULL;
		cur != NULL && new_node->number > cur->number;
		prev = cur, cur = cur->next)
		;
	if (cur != NULL && new_node->number == cur->number) {
		printf("Part already exists.\n");
		free(new_node);
		return;
	}

	printf("Enter part name: ");
	read_line(new_node->name, NAME_LEN);
	printf("Enter quantity on hand: ");
	scanf("%d", &new_node->on_hand);
	
	new_node->next = cur;
	if (prev == NULL)
		inventory = new_node;
	else
		prev->next = new_node;
}

void search(void)
{
	int number;
	struct part *p;

	printf("Enter part number: ");
	scanf("%d", &number);
	p = find_part(number);
	if (p != NULL) {
		printf("Part name: %s\n", p->name);
		printf("Quantity on hand: %d\n", p->on_hand);
	}
	else
		printf("Part not found.\n");
}

void update(void)
{
	int number, change;
	struct part *p;

	printf("Enter part number: ");
	scanf("%d", &number);
	p = find_part(number);
	if (p != NULL) {
		printf("Enter change in quantity on hand: ");
		scanf("%d", &change);
		p->on_hand += change;
	}
	else
		printf("Part not found.\n");
}

void print(void)
{
	struct part *p;

	printf("Part Number  Part Name             "
		   "Quantity on Hand\n");
	for (p = inventory; p != NULL; p = p->next)
		printf("%7d      %-25s%11d\n", p->number, p->name,
			    p->on_hand);
}