2 * Copyright (c) 2021 Omar Polo <op@omarpolo.com>
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
20 #include "telescope.h"
27 * There's a simple text wrapping algorithm.
29 * 1. if it's a line in a pre-formatted block:
32 * 2. otherwise advance the line char by char.
33 * 3. when ending the space, split the line at the last occurrence of
34 * a "word separator" (i.e. " \t-") or at point if none.
40 erase_buffer(struct buffer *buffer)
43 empty_linelist(buffer);
47 empty_linelist(struct buffer *buffer)
51 TAILQ_FOREACH_SAFE(l, &buffer->page.head, lines, lt) {
52 TAILQ_REMOVE(&buffer->page.head, l, lines);
60 empty_vlist(struct buffer *buffer)
64 buffer->top_line = NULL;
66 buffer->current_line = NULL;
69 TAILQ_FOREACH_SAFE(vl, &buffer->head, vlines, t) {
70 TAILQ_REMOVE(&buffer->head, vl, vlines);
77 push_line(struct buffer *buffer, const struct line *l, const char *buf, size_t len, int flags)
83 if ((vl = calloc(1, sizeof(*vl))) == NULL)
86 if (len != 0 && (vl->line = calloc(1, len+1)) == NULL) {
93 memcpy(vl->line, buf, len);
96 if (TAILQ_EMPTY(&buffer->head))
97 TAILQ_INSERT_HEAD(&buffer->head, vl, vlines);
99 TAILQ_INSERT_TAIL(&buffer->head, vl, vlines);
104 * Build a list of visual line by wrapping the given line, assuming
105 * that when printed will have a leading prefix prfx.
108 wrap_text(struct buffer *buffer, const char *prfx, struct line *l, size_t width)
110 const char *separators = " \t-";
111 const char *start, *end, *line, *lastsep, *lastchar;
112 uint32_t cp = 0, state = 0;
113 size_t cur, prfxwidth, w;
116 if ((line = l->line) == NULL)
117 return push_line(buffer, l, NULL, 0, 0);
119 prfxwidth = utf8_swidth(prfx);
125 for (; *line; line++) {
126 if (utf8_decode(&state, &cp, *line))
128 w = utf8_chwidth(cp);
129 if (cur + w >= width -1) {
130 end = lastsep == NULL
131 ? utf8_next_cp((char*)lastchar)
132 : utf8_next_cp((char*)lastsep);
133 if (!push_line(buffer, l, start, end - start, flags))
135 flags = L_CONTINUATION;
137 cur = prfxwidth + utf8_swidth_between(start, lastchar);
138 } else if (strchr(separators, *line) != NULL) {
142 lastchar = utf8_prev_cp(line, l->line);
146 return push_line(buffer, l, start, line - start, flags);
150 hardwrap_text(struct buffer *buffer, struct line *l, size_t width)
152 const char *line, *start, *lastchar;
154 uint32_t state = 0, cp = 0;
157 if ((line = l->line) == NULL)
158 return push_line(buffer, l, NULL, 0, 0);
164 for (; *line; line++) {
165 if (utf8_decode(&state, &cp, *line))
167 w = utf8_chwidth(cp);
168 if (cur + w >= width) {
169 if (!push_line(buffer, l, start, lastchar - start, cont))
176 lastchar = utf8_prev_cp(line, l->line);
180 return push_line(buffer, l, start, line - start, cont);