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
|
/* $NetBSD: prtable.c,v 1.10 2013/10/19 17:23:08 christos Exp $ */
/*-
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Barry Brachman.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. Neither the name of the University 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 REGENTS 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 REGENTS 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.
*
* @(#)prtable.c 8.1 (Berkeley) 6/11/93
*/
#include <sys/cdefs.h>
#ifndef lint
__RCSID("$NetBSD: prtable.c,v 1.10 2013/10/19 17:23:08 christos Exp $");
#endif /* not lint */
#include <ncurses.h>
#define __USE(a) (/*LINTED*/(void)(a))
#include "extern.h"
#define NCOLS 5
static int get_maxlen(const char *const [], int, int (*)(const char *const *, int));
/*
* 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 address of the base and
* an index
*/
void
prtable(const char *const base[], int num, int d_cols, int width,
void (*prentry)(const char *const [], int),
int (*length)(const char *const [], int))
{
int c, j;
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);
__USE(col);
move(row + 1, 0);
}
refresh();
}
static int
get_maxlen(const char *const base[], int num,
int (*length)(const char *const *, int))
{
int i, len, max;
max = (*length)(base, 0);
for (i = 0; i < num; i++) {
if ((len = (*length)(base, i)) > max)
max = len;
}
return(max);
}
|
