[unix-history] / usr / src / lib / libcurses / PSD.doc / appen.C

.\" Copyright (c) 1980 Regents of the University of California.
.\" All rights reserved.  The Berkeley software License Agreement
.\" specifies the terms and conditions for redistribution.
.\"
.\"	@(#)appen.C	4.1 (Berkeley) %G%
.\"
.ie t .he ''\fBAppendix C\fR''
.el .he ''\fIAppendix C\fR''
.bp
.(x
.ti 0
.b "Appendix C"
.)x
.sh 1 "Examples" 1
.pp
Here we present a few examples
of how to use the package.
They attempt to be representative,
though not comprehensive.
.sh 1 "Screen Updating"
.pp
The following examples are intended to demonstrate
the basic structure of a program
using the screen updating sections of the package.
Several of the programs require calculational sections
which are irrelevant of to the example,
and are therefore usually not included.
It is hoped that the data structure definitions
give enough of an idea to allow understanding
of what the relevant portions do.
The rest is left as an exercise to the reader,
and will not be on the final.
.sh 2 "Twinkle"
.pp
This is a moderately simple program which prints
pretty patterns on the screen
that might even hold your interest for 30 seconds or more.
It switches between patterns of asterisks,
putting them on one by one in random order,
and then taking them off in the same fashion.
It is more efficient to write this
using only the motion optimization,
as is demonstrated below.
.(l I
.so twinkle1.gr
.)l
.sh 2 "Life"
.pp
This program plays the famous computer pattern game of life
(Scientific American, May, 1974).
The calculational routines create a linked list of structures
defining where each piece is.
Nothing here claims to be optimal,
merely demonstrative.
This program, however,
is a very good place to use the screen updating routines,
as it allows them to worry about what the last position looked like,
so you don't have to.
It also demonstrates some of the input routines.
.(l I
.so life.gr
.)l
.sh 1 "Motion optimization"
.pp
The following example shows how motion optimization
is written on its own.
Programs which flit from one place to another without
regard for what is already there
usually do not need the overhead of both space and time
associated with screen updating.
They should instead use motion optimization.
.sh 2 "Twinkle"
.pp
The
.b twinkle
program
is a good candidate for simple motion optimization.
Here is how it could be written
(only the routines that have been changed are shown):
.(l
.so twinkle2.gr
.)l
Commit	Line	Data
0499335a KM	1	.\" Copyright (c) 1980 Regents of the University of California.
	2	.\" All rights reserved. The Berkeley software License Agreement
	3	.\" specifies the terms and conditions for redistribution.
	4	.\"
	5	.\" @(#)appen.C 4.1 (Berkeley) %G%
	6	.\"
	7	.ie t .he ''\fBAppendix C\fR''
	8	.el .he ''\fIAppendix C\fR''
	9	.bp
	10	.(x
	11	.ti 0
	12	.b "Appendix C"
	13	.)x
	14	.sh 1 "Examples" 1
	15	.pp
	16	Here we present a few examples
	17	of how to use the package.
	18	They attempt to be representative,
	19	though not comprehensive.
	20	.sh 1 "Screen Updating"
	21	.pp
	22	The following examples are intended to demonstrate
	23	the basic structure of a program
	24	using the screen updating sections of the package.
	25	Several of the programs require calculational sections
	26	which are irrelevant of to the example,
	27	and are therefore usually not included.
	28	It is hoped that the data structure definitions
	29	give enough of an idea to allow understanding
	30	of what the relevant portions do.
	31	The rest is left as an exercise to the reader,
	32	and will not be on the final.
	33	.sh 2 "Twinkle"
	34	.pp
	35	This is a moderately simple program which prints
	36	pretty patterns on the screen
	37	that might even hold your interest for 30 seconds or more.
	38	It switches between patterns of asterisks,
	39	putting them on one by one in random order,
	40	and then taking them off in the same fashion.
	41	It is more efficient to write this
	42	using only the motion optimization,
	43	as is demonstrated below.
	44	.(l I
	45	.so twinkle1.gr
	46	.)l
	47	.sh 2 "Life"
	48	.pp
	49	This program plays the famous computer pattern game of life
	50	(Scientific American, May, 1974).
	51	The calculational routines create a linked list of structures
	52	defining where each piece is.
	53	Nothing here claims to be optimal,
	54	merely demonstrative.
	55	This program, however,
	56	is a very good place to use the screen updating routines,
	57	as it allows them to worry about what the last position looked like,
	58	so you don't have to.
	59	It also demonstrates some of the input routines.
	60	.(l I
	61	.so life.gr
	62	.)l
	63	.sh 1 "Motion optimization"
	64	.pp
65	The following example shows how motion optimization
66	is written on its own.
67	Programs which flit from one place to another without
68	regard for what is already there
69	usually do not need the overhead of both space and time
70	associated with screen updating.
71	They should instead use motion optimization.
72	.sh 2 "Twinkle"
73	.pp
74	The
75	.b twinkle
76	program
77	is a good candidate for simple motion optimization.
78	Here is how it could be written
79	(only the routines that have been changed are shown):
80	.(l
81	.so twinkle2.gr
82	.)l