|
|
DataMuseum.dkPresents historical artifacts from the history of: DKUUG/EUUG Conference tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about DKUUG/EUUG Conference tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - downloadIndex: T p
Length: 2164 (0x874)
Types: TextFile
Names: »prtable.c«
└─⟦b20c6495f⟧ Bits:30007238 EUUGD18: Wien-båndet, efterår 1987
└─⟦this⟧ »EUUGD18/General/Bog/prtable.c«
/* vi: set tabstop=4 : */
#include <curses.h>
#define NCOLS 5
/*
* Routine to print a table
* Modified from 'ls.c' mods (BJB/83)
* Arguments:
* base - address of first entry
* num - number of entries
* d_cols - number of columns to use if > 0, "best" size if == 0
* width - max line width if not zero
* prentry - address of the routine to call to print the string
* length - address of the routine to call to determine the length
* of string to be printed
*
* prtable and length are called with the the address of the base and
* an index
*/
prtable(base, num, d_cols, width, prentry, length)
char *base;
int num, d_cols;
int (*prentry)(), (*length)();
{
register int c, j;
register int a, b, cols, loc, maxlen, nrows, z;
int col, row;
if (num == 0)
return;
maxlen = get_maxlen(base, num, length) + 1;
if (d_cols > 0)
cols = d_cols;
else
cols = width / maxlen;
if (cols == 0)
cols = NCOLS;
nrows = (num - 1) / cols + 1;
for (a = 1; a <= nrows; a++) {
b = c = z = loc = 0;
for (j = 0; j < num; j++) {
c++;
if (c >= a + b)
break;
}
while (j < num) {
(*prentry)(base, j);
loc += (*length)(base, j);
z++;
b += nrows;
for (j++; j < num; j++) {
c++;
if (c >= a + b)
break;
}
if (j < num) {
while (loc < z * maxlen) {
addch(' ');
loc++;
}
}
}
getyx(stdscr, row, col);
move(row + 1, 0);
}
refresh();
}
static int
get_maxlen(base, num, length)
char *base;
int num;
int (*length)();
{
register int i, len, max;
max = (*length)(base, 0);
for (i = 0; i < num; i++) {
if ((len = (*length)(base, i)) > max)
max = len;
}
return(max);
}