powner.c

这是一个使用了 cursor 编程技术实现的车站自动售票系统的源代码

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<fcntl.h>
#include<signal.h>
#include<curses.h>
#include<malloc.h>

#define	MAXOWN	1000
#define	ROWS	15
#define	ROW	5
#define	INROW	22
#define	MSGROW	23
#define	NITEM	2

struct	owner{
	int	no;
	char	name[50];
}own[MAXOWN];
int	nown;
int	order[MAXOWN];
int	delf[MAXOWN];
int	col[NITEM]={20,30};

char	*title[NITEM]={"编号","单位名称"};
char	*tab[]={"***** 车 主 信 息 *****",
		"----------------------------------------"
		"---------------------------------------",
		"Q-退出  A-添加  M-修改  D-删除  U-恢复 S-保存  R-排序"
		"  P-打印"
	};

enum	Key{
	NONE,Up,Down,Right,Left,Center,End,PgDn,Home,
	PgUp,Ins,F1,F2,F3,F4,F5,F6,F7,F8,F9,F10,F11,F12
};

char	*RP;

main(int argc,char *argv[])
{
	char	c;
	int	flag=0;
	int	quit=0;
	int	sown,pown;
	int	n;

	RP=getenv("ROOTPATH");
	if(RP==NULL)
		return	-1;

	init();
	if((nown=readown())!=-1)
	{
		sown=0;
		pown=0;
		sort();
		for(n=0;n<nown;n++)
			delf[n]=0;
	}
	else
		nown=0;
	while(quit==0)
	{
		show(sown,pown);
		move(ROW+ROWS+1,41+strlen(tab[2])/2);
		refresh();
		c=getkey();
		refresh();
		clrin();
		clrmsg();
		if(c>='A'&&c<='Z')
			c=c-'A'+'a';
		switch(c)
		{
			case	-1:
				break;
			case	Down:
				if(pown<nown-1)
					pown++;
				if(pown-sown>=ROWS)
					sown++;
				break;
			case	Up:
				if(pown>0)
					pown--;
				if(pown<sown&&sown>0)
					sown--;
				break;
			case	PgUp:
				if(sown>=ROWS)
					sown-=ROWS;
				else
					sown=0;
				if(pown>=ROWS)
					pown-=ROWS;
				else
					pown=0;
				break;
			case	PgDn:
				if(sown<nown-ROWS)
					sown+=ROWS;
				if(pown<nown-ROWS)
					pown+=ROWS;
				else
					pown=nown-1;
				break;
			case	Home:
				sown=0;
				pown=0;
				break;
			case	End:
				if(nown%ROWS==0)
					sown=nown-ROWS;
				else
					sown=nown-nown%ROWS;
				pown=nown-1;
				break;
			case	'a':
				if(append()==0)
					flag=1;
				if(nown%ROWS==0)
					sown=nown-ROWS;
				else
					sown=nown-nown%ROWS;
				pown=nown-1;
				break;
			case	'm':
				if(modify(sown,pown)==0)
					flag=1;
				break;
			case	'd':
				if(delete(sown,pown)==0)
					flag=1;
				break;
			case	'u':
				if(undelete(sown,pown)==0)
					flag=1;
				break;
			case	's':
				if(save()==0)
					flag=0;
				break;
			case	'r':
				sort();
				break;
			case	'p':
				print();
				break;
			case	'q':
				if(flag==0)
					quit=1;
				else
					if(save()==0)
						quit=1;
					else
						if(yn("fail to save, quit(y/n)? ")==0)
							quit=1;
				break;
			default:
				printf("\07");
				break;
		}
	}
	erase();
	clear();
	refresh();
	endwin();
}

init()
{
	int	i;

	signal(SIGINT,SIG_IGN);
	initscr();
	raw();
	nonl();
	noecho();

	clear();
	mvaddstr(ROW-4,40-strlen(tab[0])/2,tab[0]);
	for(i=0;i<NITEM;i++)
		mvaddstr(ROW-2,col[i],title[i]);
	mvaddstr(ROW-1,0,tab[1]);
	mvaddstr(ROW+ROWS,0,tab[1]);
	mvaddstr(ROW+ROWS+1,40-strlen(tab[2])/2,tab[2]);
	refresh();
}

int	readown()
{
	char	fn[80];
	char	msg[128];
	int	fd;
	long	size;

	sprintf(fn,"%s/bas/owner.dat",RP);
	fd=open(fn,O_RDONLY);
	if(fd==-1)
	{
		sprintf(msg,"文件%s打开失败!",fn);
		showmsg(msg);
		return	0;
	}
	else
	{
		size=lseek(fd,0L,2);
		if(size>MAXOWN*sizeof(struct owner))
			size=MAXOWN*sizeof(struct owner);
		lseek(fd,0L,0);
		read(fd,(char *)own,size);
		close(fd);
		return	size/sizeof(struct owner);
	}
}

sort()
{
	int	i,j,k,n;

	for(i=0;i<nown;i++)
		order[i]=i;
	k=nown/2;
	while(k>0)
	{
		for(j=k;j<nown;j++)
		{
			n=order[j];
			i=j-k;
			while(i>=0&&own[order[i]].no>own[n].no)
			{
				order[i+k]=order[i];
				i-=k;
			}
			order[i+k]=n;
		}
		k/=2;
	}
}

int	append()
{
	int	i,j,n;
	int	no;
	char	name[50];
	int	sown,pown;

	sown=nown-nown%ROWS;
	i=0;
	while(1)
	{
		nown++;
		if(nown>=MAXOWN)
		{
			showmsg("空间已满, 不能再增加!");
			break;
		}
		pown=nown-1;
		order[pown]=pown;
		if(nown>1)
			no=own[order[pown-1]].no+1;
		else
			no=0;
		name[0]='\0';
		own[order[pown]].no=no;
		own[order[pown]].name[0]='\0';
		if(pown-sown>=ROWS)
			sown++;
		show(sown,pown);

		while(1)
		{
			if((n=get_n(pown-sown+ROW,col[0],"",&no,col[1]-col[0]))==-1)
				break;
			for(j=0;j<nown-1&&no!=own[j].no;j++)
				;
			if(j<nown-1)
				showmsg("此车主号有重复!");
			else
				break;
		}
		if(n==-1)
			break;

		if(get_s(pown-sown+ROW,col[1],"",name,79-col[1])==-1)
			break;

		own[pown].no=no;
		strcpy(own[pown].name,name);
		i++;
	}
	nown--;
	move(pown-sown+ROW,0);
	clrtoeol();
	refresh();
	if(i>0)
		return	i;
	else
		return	-1;
}

int	modify(int sown,int pown)
{
	char	name[50];

	strcpy(name,own[order[pown]].name);
	if(get_s(pown-sown+ROW,col[1],"",name,79-col[1])==-1)
		return	-1;

	strcpy(own[order[pown]].name,name);
	return	0;
}

int	delete(int sown,int pown)
{
	if(nown<=0)
		return	-1;
	if(delf[order[pown]]==0)
	{
		delf[order[pown]]=1;
		mvaddch(pown-sown+ROW,col[0]-1,'*');
		refresh();
		return	0;
	}
	else
		return	-1;
}

int	undelete(int sown,int pown)
{
	if(nown<=0)
		return	-1;
	if(delf[order[pown]]==0)
		return	-1;
	else
	{
		delf[order[pown]]=0;
		mvaddch(pown-sown+ROW,col[0]-1,' ');
		refresh();
		return	0;
	}
}

int	save()
{
	char	fn[80];
	char	msg[128];
	int	fd;
	long	size;
	int	i;

	sprintf(fn,"%s/bas/owner.dat",RP);
	fd=open(fn,O_WRONLY|O_TRUNC);
	if(fd==-1)
	{
		fd=open(fn,O_CREAT|O_WRONLY);
		if(fd==-1)
		{
			sprintf(msg,"文件%s打开失败!",fn);
			showmsg(msg);
			return	-1;
		}
	}
	size=sizeof(struct owner);
	for(i=0;i<nown;i++)
		if(delf[i]==0)
			write(fd,(char *)(own+i),size);
	close(fd);
	return	0;
}

int	print()
{
	int	i,n,start,end;
	
	start=0;
	while(1)
	{
		clrin();
		if(get_n(INROW,30,"起始序号: ",&start,10)==-1)
			return	-1;
		if(start>=0&&start<nown)
			break;
	}
	end=nown-1;
	while(1)
	{
		clrin();
		if(get_n(INROW,30,"结束序号: ",&end,10)==-1)
			return	-1;
		if(end>=start&&end<nown)
			break;
	}

	printf("%c{",0x1b);	/* print initialize string */
	printf("%30s\n%-10s%s\n%s\n",tab[0],title[0],title[1],tab[1]);
	for(i=start;i<=end;i++)
	{
		n=order[i];
		printf("%-10d%s\n",own[n].no,own[n].name);
	}
	printf("%c}",0x1b);	/* print end string */
	return	0;
}

int	get_n(int y,int x,char *prompt,int *n,int b)
{
	char	c,s[80],ss[80];
	int	i;

	sprintf(s,"%d",*n);
	for(i=0;i<b-1;i++)
		ss[i]=' ';
	ss[b-1]='\0';
	mvaddstr(y,x,prompt);
	x+=strlen(prompt);
	mvaddstr(y,x,ss);
	mvaddstr(y,x,s);
	refresh();

	i=0;
	while(1)
	{
		move(y,x+i);
		refresh();
		if(i>=b-1)
			c=0x0d;
		else
			c=getkey();
		switch(c)
		{
			case	-1:
				continue;
			case 	0x1b:		/* <ESC> pressed */
				return	-1;
			case	0x0d:		/* <ENTER> pressed */
				if(i)
				{
					ss[i]='\0';
					*n=atoi(ss);
				}
				return	0;
			case	0x08:		/* <BS> pressed */
				if(i<=0)
					continue;
				else
				{
					ss[--i]=' ';
					ss[i]='\0';
				}
				break;
			case	'0':
			case	'1':
			case	'2':
			case	'3':
			case	'4':
			case	'5':
			case	'6':
			case	'7':
			case	'8':
			case	'9':
				ss[i++]=c;
				break;
			default:
				printf("\7\7");
				break;
		}
		mvaddstr(y,x,ss);
		refresh();
	}
}

int	get_s(int y,int x,char prompt[],char s[],int n)
	/* x,y  location of cursor; s  the string  */
	/* n  length of s; */
{
	char	c,ss[128];
	int	i;

	for(i=0;i<n-1;i++)
		ss[i]=' ';
	ss[n-1]='\0';
	mvaddstr(y,x,prompt);
	x+=strlen(prompt);
	mvaddstr(y,x,ss);
	mvaddstr(y,x,s);
	refresh();

	i=0;
	while(1)
	{
		move(y,x+i);
		refresh();
		if(i>=n-1)
			c=0x0d;
		else
			c=getkey();
		switch(c)
		{
			case	-1:
				continue;
			case 	0x1b:		/* <ESC> pressed */
				return	-1;
			case	0x0d:		/* <ENTER> pressed */
				if(i)
				{
					ss[i]='\0';
					strcpy(s,ss);
				}
				return	0;
			case	0x08:		/* <BS> pressed */
				if(i<=0)
					continue;
				else
					ss[--i]=' ';
				break;
			default:
				ss[i++]=c;
				break;
		}
		mvaddstr(y,x,ss);
		refresh();
	}
}

getkey()
{
	char	c,key;
	char	keys[]={Up,Down,Right,Left,NONE,End,PgDn,Home,
		PgUp,NONE,NONE,Ins};
	void	timeint();

	sigset(SIGALRM,timeint);
	key=getch();
	refresh();
	if(key==0x1b)
	{
		alarm(1);
		if(getch()!=-1)
		{
			c=getch();
			refresh();
			key=keys[c-'A'];
		}
	}
	sigignore(SIGALRM);
	return	key;
}

void	timeint()
{
}

show(int sown,int pown)
{
	static	int	n=-1;
	static	int	s=-1;
	static	int	p=-1;
	static	int	o[ROWS];
	int	i;

	move(2,70);
	clrtoeol();
	if(nown>0)
		mvprintw(2,70,"%d/%d",pown+1,nown);
	else
	{
		mvaddstr(2,70,"0/0");
		clrscr();
		refresh();
		return;
	}

	mvaddch(p-s+ROW,col[0]-2,' ');
	if(p!=pown)
		p=pown;
	for(i=0;i<ROWS&&s+i<nown&&o[i]==order[s+i];i++)
		;
	if((n!=nown&&(p-s)>=ROWS)||s!=sown||(i<ROWS&&s+i<nown))
	{
		n=nown;
		s=sown;
		for(i=0;i<ROWS&&(s+i)<nown;i++)
		{
			o[i]=order[s+i];
			showone(ROW+i,o[i]);
		}
		for(;i<ROWS;i++)
			move(ROW+i,0),	clrtoeol();
	}
	else
	{
		move(p-s+ROW,0);
		clrtoeol();
		showone(p-s+ROW,order[p]);
	}
	mvaddch(p-s+ROW,col[0]-2,'>');
	refresh();
}

showone(int row,int n)
{
	move(row,0),	clrtoeol();

	if(delf[n])
		mvaddch(row,col[0]-1,'*');
	move(row,col[0]);
	printw("%d",own[n].no);
	mvaddstr(row,col[1],own[n].name);
	refresh();
}

clrscr()
{
	int	i;

	for(i=0;i<ROWS;i++)
	{
		move(ROW+i,0);
		clrtoeol();
	
	}
	refresh();
}

showmsg(char s[])
{
	move(MSGROW,0);
	clrtoeol();
	mvaddstr(MSGROW,(80-strlen(s))/2,s);
	refresh();
	printf("\7\7");
}

clrmsg()
{
	move(MSGROW,0);
	clrtoeol();
	refresh();
}

clrin()
{
	move(INROW,0);
	clrtoeol();
	refresh();
}

int	yn(char *p)
{
	char	c;

	do{
		move(INROW,0);
		clrtoeol();
		mvprintw(INROW,40-strlen(p)/2,p);
		move(INROW,41+strlen(p)/2);
		refresh();
		c=getkey();
	}while(c!='y'&&c!='Y'&&c!='n'&&c!='N');
	if(c>='A'&&c<='Z')
		c=c-'A'+'a';
	if(c=='y')
		return	0;
	else
		return	1;
}