|
|
1.1 root 1: /*
2: * Copyright (c) 1981 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #ifndef lint
21: static char sccsid[] = "@(#)deleteln.c 5.4 (Berkeley) 6/1/90";
22: #endif /* not lint */
23:
24: # include "curses.ext"
25:
26: /*
27: * This routine deletes a line from the screen. It leaves
28: * (_cury,_curx) unchanged.
29: *
30: */
31: wdeleteln(win)
32: reg WINDOW *win;
33: {
34: reg char *temp;
35: reg int y;
36: reg char *end;
37: reg int x;
38:
39: # ifdef DEBUG
40: fprintf(outf, "DELETELN(%0.2o)\n", win);
41: # endif
42: temp = win->_y[win->_cury];
43: for (y = win->_cury; y < win->_maxy - 1; y++) {
44: if (win->_orig == NULL)
45: win->_y[y] = win->_y[y + 1];
46: else
47: bcopy(win->_y[y + 1], win->_y[y], win->_maxx);
48: touchline(win, y, 0, win->_maxx - 1);
49: }
50: if (win->_orig == NULL)
51: win->_y[y] = temp;
52: else
53: temp = win->_y[y];
54: for (end = &temp[win->_maxx]; temp < end; )
55: *temp++ = ' ';
56: touchline(win, win->_cury, 0, win->_maxx - 1);
57: if (win->_orig == NULL)
58: _id_subwins(win);
59: return OK;
60: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.