84 lines
1.7 KiB
C
84 lines
1.7 KiB
C
/* See LICENSE file for copyright and license details. */
|
|
#include <assert.h>
|
|
#include <stdbool.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include "text.h"
|
|
#include "util.h"
|
|
|
|
static long chars = 65;
|
|
static struct linebuf b = EMPTY_LINEBUF;
|
|
|
|
static long n_columns;
|
|
static long n_rows;
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
int c;
|
|
long i, l, col;
|
|
size_t maxlen = 0;
|
|
char *space;
|
|
FILE *fp;
|
|
|
|
while ((c = getopt(argc, argv, "c:")) != -1)
|
|
switch (c) {
|
|
case 'c':
|
|
chars = estrtol(optarg, 0);
|
|
if (chars < 3)
|
|
eprintf("%d: too few character columns");
|
|
break;
|
|
default:
|
|
exit(2);
|
|
}
|
|
|
|
/* XXX librarify this chunk, too? only useful in sponges though */
|
|
if(optind == argc)
|
|
getlines(stdin, &b);
|
|
else for(; optind < argc; optind++) {
|
|
if(!(fp = fopen(argv[optind], "r")))
|
|
eprintf("fopen %s:", argv[optind]);
|
|
getlines(fp, &b);
|
|
fclose(fp);
|
|
}
|
|
|
|
for(l = 0; l < b.nlines; ++l) {
|
|
size_t len = strlen(b.lines[l]);
|
|
if(len > 0 && b.lines[l][len-1] == '\n')
|
|
b.lines[l][--len] = '\0';
|
|
if(len > maxlen)
|
|
maxlen = len;
|
|
if(maxlen > (chars - 1) / 2)
|
|
break;
|
|
}
|
|
|
|
n_columns = (chars + 1) / (maxlen + 1);
|
|
if(n_columns <= 1) {
|
|
for(l = 0; l < b.nlines; ++l) {
|
|
fputs(b.lines[l], stdout);
|
|
}
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
if(!(space = malloc(maxlen + 2)))
|
|
eprintf("malloc:");
|
|
memset(space, ' ', maxlen + 1);
|
|
space[maxlen + 1] = '\0';
|
|
|
|
n_rows = (b.nlines + (n_columns - 1)) / n_columns;
|
|
for(i = 0; i < n_rows; ++i) {
|
|
for(l = i, col = 1; l < b.nlines; l += n_rows, ++col) {
|
|
/*sprintf(b.lines[l], "%ld,%ld$", i, col);*/
|
|
fputs(b.lines[l], stdout);
|
|
if(col < n_columns)
|
|
fputs(space + strlen(b.lines[l]), stdout);
|
|
}
|
|
fputs("\n", stdout);
|
|
}
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|