1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
|
\documentclass{article}
\usepackage{axiom}
\begin{document}
\title{\$SPAD/src/lib prt.c}
\author{The Axiom Team}
\maketitle
\begin{abstract}
\end{abstract}
\eject
\tableofcontents
\eject
\section{License}
<<license>>=
/*
Copyright (c) 1991-2002, The Numerical ALgorithms Group Ltd.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
- Neither the name of The Numerical ALgorithms Group Ltd. nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
@
<<*>>=
<<license>>
#include "axiom-c-macros.h"
#include <string.h>
#include <stdio.h>
#include <sys/types.h>
#include "edible.h"
#include "prt.H1"
#include "edin.H1"
void
myputchar(char c)
{
if (ECHOIT)
putchar(c);
return;
}
void
clear_buff(void)
{
int count;
/*** called when spadbuf gives me a line incase there is something already
on the line ****/
if (buff_pntr > 0) {
/*** backup to the beginning of the line ***/
for (count = curr_pntr; count > 0; count--)
myputchar(_BKSPC);
/** blank over the line ***/
for (count = 0; count < buff_pntr; count++) {
myputchar(_BLANK);
}
/** back up again ***/
for (count = buff_pntr; count > 0; count--)
myputchar(_BKSPC);
init_buff(buff, buff_pntr);
init_flag(buff_flag, buff_pntr);
curr_pntr = buff_pntr = 0;
}
}
void
move_end(void)
{
/** Moves cursor to the end of the line ***/
if (curr_pntr == buff_pntr) {
putchar(_BELL);
}
else {
for (; curr_pntr < buff_pntr;) {
myputchar(buff[curr_pntr++]);
}
}
fflush(stdout);
}
void
move_home(void)
{
/*** Moves the cursor to the front of the line ***/
if (curr_pntr > 0) {
for (; curr_pntr > 0;) {
myputchar(_BKSPC);
curr_pntr--;
}
}
else {
putchar(_BELL);
}
fflush(stdout);
}
void
move_fore_word(void)
{
/** move the cursor to the next blank space **/
if (curr_pntr != buff_pntr) {
myputchar(buff[curr_pntr]);
curr_pntr++;
while (curr_pntr < buff_pntr && buff[curr_pntr] != ' ') {
myputchar(buff[curr_pntr]);
curr_pntr++;
}
}
else
putchar(_BELL);
fflush(stdout);
return;
}
void
move_back_word(void)
{
/*** moves the cursor to the last blank space ***/
if (curr_pntr > 0) {
myputchar(_BKSPC);
curr_pntr--;
while (curr_pntr > 0 && buff[curr_pntr - 1] != ' ') {
myputchar(_BKSPC);
curr_pntr--;
}
}
else
putchar(_BELL);
fflush(stdout);
return;
}
void
delete_current_char(void)
{
/** deletes the char currently above the current_pntr, if it can be **/
if (curr_pntr != buff_pntr) {
if (buff_flag[curr_pntr] == 1 || buff_flag[curr_pntr] == 0) {
myputchar(_BLANK);
myputchar(_BKSPC);
strcpy(&buff[curr_pntr],
&buff[curr_pntr + 1]);
flagcpy(&buff_flag[curr_pntr],
&buff_flag[curr_pntr + 1]);
buff_pntr--;
del_print(curr_pntr, 1);
}
else {
/** lets delete two of the little buggers **/
myputchar(_BLANK);
myputchar(_BLANK);
myputchar(_BKSPC);
myputchar(_BKSPC);
strcpy(&buff[curr_pntr],
&buff[curr_pntr + 2]);
flagcpy(&buff_flag[curr_pntr],
&buff_flag[curr_pntr + 2]);
buff_pntr -= 2;
del_print(curr_pntr, 2);
}
}
else {
putchar(_BELL);
fflush(stdout);
}
num_proc = num_proc + 3;
}
void
delete_to_end_of_line(void)
{
int count;
/*** deletes from the curr_pntr to the end of line ***/
if (curr_pntr == buff_pntr)
return; /** There is nothing to do **/
/** blank over the end of the line ***/
for (count = curr_pntr; count < buff_pntr; count++) {
myputchar(_BLANK);
}
/** back up again ***/
for (count = buff_pntr; count > curr_pntr; count--)
myputchar(_BKSPC);
buff_pntr = curr_pntr;
fflush(stdout);
return;
}
void
delete_line(void)
{
int count;
/*** deletes the entire line *****/
if (buff_pntr == 0)
return; /** There is nothing to do **/
/** first I have to back up to the beginning of the line ****/
for (count = curr_pntr; count > 0; count--)
myputchar(_BKSPC);
/** blank over the end of the line ***/
for (count = 0; count < buff_pntr; count++) {
myputchar(_BLANK);
}
/** back up again ***/
for (count = buff_pntr; count > 0; count--)
myputchar(_BKSPC);
/* Also clear the buffer */
init_buff(buff, buff_pntr);
init_flag(buff_flag, buff_pntr);
buff_pntr = curr_pntr = 0;
fflush(stdout);
return;
}
void
printbuff(int start,int num)
{
int trace;
for (trace = start; trace < start + num; trace++)
if (buff[trace] != '\0')
myputchar(buff[trace]);
fflush(stdout);
}
void
del_print(int start, int num)
{
int count;
/*** move the rest of the string ***/
for (count = start; count < buff_pntr; count++) {
myputchar(buff[count]);
}
/** now blank out the number of chars we are supposed to ***/
for (count = 0; count < num; count++)
myputchar(_BLANK);
/*** Now back up ***/
for (count = buff_pntr + num; count > start; count--)
myputchar(_BKSPC);
fflush(stdout);
}
void
ins_print(int start,int num)
{
int count;
/** write the rest of the word ***/
for (count = start; count < buff_pntr + num; count++) {
myputchar(buff[count]);
}
/** now back up to where we should be ***/
for (count = buff_pntr; count > start; count--)
myputchar(_BKSPC);
fflush(stdout);
}
void
reprint(int start)
{
/** simply reprints a single character **/
if (buff[start] == '\0')
myputchar(_BLANK);
else
myputchar(buff[start]);
myputchar(_BKSPC);
fflush(stdout);
return;
}
void
back_up(int num_chars)
{
int cnt;
for (cnt = 0; cnt < num_chars; cnt++)
myputchar(_BKSPC);
for (cnt = 0; cnt < num_chars; cnt++)
myputchar(_BLANK);
for (cnt = 0; cnt < num_chars; cnt++)
myputchar(_BKSPC);
fflush(stdout);
}
void
back_it_up(int num_chars)
{
int cnt;
for (cnt = 0; cnt < num_chars; cnt++)
myputchar(_BKSPC);
fflush(stdout);
}
void
print_whole_buff(void)
{
int trace;
for (trace = 0; trace < buff_pntr; trace++)
if (buff[trace] != '\0')
myputchar(buff[trace]);
fflush(stdout);
}
void
move_ahead(void)
{
/*** simply moves the pointer ahead a single word ***/
if (curr_pntr == buff_pntr) {
putchar(_BELL);
}
else {
if (buff_flag[curr_pntr] == 2) {
myputchar(buff[curr_pntr++]);
}
myputchar(buff[curr_pntr++]);
}
fflush(stdout);
}
void
move_back(void)
{
/** simply moves the cursor back one position **/
if (curr_pntr == 0) {
putchar(_BELL);
}
else {
if (!buff_flag[curr_pntr - 1]) {
myputchar(_BKSPC);
curr_pntr--;
}
myputchar(_BKSPC);
curr_pntr--;
}
fflush(stdout);
}
void
back_over_current_char(void)
{
/*** simply backs over the character behind the cursor ***/
if (curr_pntr == 0) {
putchar(_BELL);
}
else {
if (!buff_flag[curr_pntr - 1]) {
myputchar(_BKSPC);
myputchar(_BKSPC);
myputchar(_BLANK);
myputchar(_BLANK);
myputchar(_BKSPC);
myputchar(_BKSPC);
strcpy(&buff[curr_pntr - 2],
&buff[curr_pntr]);
flagcpy(&buff_flag[curr_pntr - 2],
&buff_flag[curr_pntr]);
buff_pntr -= 2;
curr_pntr -= 2;
del_print(curr_pntr, 2);
}
else {
myputchar(_BKSPC);
myputchar(_BLANK);
myputchar(_BKSPC);
strcpy(&buff[curr_pntr - 1],
&buff[curr_pntr]);
flagcpy(&buff_flag[curr_pntr - 1],
&buff_flag[curr_pntr]);
curr_pntr--;
buff_pntr--;
del_print(curr_pntr, 1);
}
}
fflush(stdout);
return;
}
@
\eject
\begin{thebibliography}{99}
\bibitem{1} nothing
\end{thebibliography}
\end{document}
|