version 1.1, 2017/05/07 17:31:45 |
version 1.3, 2017/06/14 17:51:15 |
Line 52 term_tab_set(const struct termp *p, const char *arg) |
|
Line 52 term_tab_set(const struct termp *p, const char *arg) |
|
recording_period = 0; |
recording_period = 0; |
if (tabs.d == 0) { |
if (tabs.d == 0) { |
a2roffsu(".8i", &su, SCALE_IN); |
a2roffsu(".8i", &su, SCALE_IN); |
tabs.d = term_hspan(p, &su) / 24; |
tabs.d = term_hen(p, &su); |
} |
} |
return; |
return; |
} |
} |
Line 68 term_tab_set(const struct termp *p, const char *arg) |
|
Line 68 term_tab_set(const struct termp *p, const char *arg) |
|
arg++; |
arg++; |
} else |
} else |
add = 0; |
add = 0; |
if (a2roffsu(arg, &su, SCALE_EM) == 0) |
if (a2roffsu(arg, &su, SCALE_EM) == NULL) |
return; |
return; |
|
|
/* Select the list, and extend it if it is full. */ |
/* Select the list, and extend it if it is full. */ |
Line 81 term_tab_set(const struct termp *p, const char *arg) |
|
Line 81 term_tab_set(const struct termp *p, const char *arg) |
|
|
|
/* Append the new position. */ |
/* Append the new position. */ |
|
|
pos = term_hspan(p, &su); |
pos = term_hen(p, &su); |
tl->t[tl->n] = pos; |
tl->t[tl->n] = pos; |
if (add && tl->n) |
if (add && tl->n) |
tl->t[tl->n] += tl->t[tl->n - 1]; |
tl->t[tl->n] += tl->t[tl->n - 1]; |
Line 97 term_tab_next(size_t prev) |
|
Line 97 term_tab_next(size_t prev) |
|
if (i == tabs.a.n) { |
if (i == tabs.a.n) { |
if (tabs.p.n == 0) |
if (tabs.p.n == 0) |
return prev; |
return prev; |
/* |
|
return i ? prev : |
|
(prev / tabs.d + 1) * tabs.d; |
|
*/ |
|
tabs.a.n += tabs.p.n; |
tabs.a.n += tabs.p.n; |
if (tabs.a.s < tabs.a.n) { |
if (tabs.a.s < tabs.a.n) { |
tabs.a.s = tabs.a.n; |
tabs.a.s = tabs.a.n; |
Line 111 term_tab_next(size_t prev) |
|
Line 107 term_tab_next(size_t prev) |
|
tabs.a.t[i + j] = tabs.p.t[j] + |
tabs.a.t[i + j] = tabs.p.t[j] + |
(i ? tabs.a.t[i - 1] : 0); |
(i ? tabs.a.t[i - 1] : 0); |
} |
} |
if (prev < tabs.a.t[i] / 24) |
if (prev < tabs.a.t[i]) |
return tabs.a.t[i] / 24; |
return tabs.a.t[i]; |
} |
} |
} |
} |