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.
17 #include "telescope.h"
26 * There's a simple text wrapping algorithm.
28 * 1. if it's a line in a pre-formatted block:
31 * 2. otherwise advance the line char by char.
32 * 3. when ending the space, split the line at the last occurrence of
33 * a "word separator" (i.e. " \t-") or at point if none.
39 erase_buffer(struct buffer *buffer)
42 empty_linelist(buffer);
46 empty_linelist(struct buffer *buffer)
50 TAILQ_FOREACH_SAFE(l, &buffer->page.head, lines, lt) {
51 TAILQ_REMOVE(&buffer->page.head, l, lines);
59 empty_vlist(struct buffer *buffer)
63 buffer->top_line = NULL;
65 buffer->current_line = NULL;
68 TAILQ_FOREACH_SAFE(vl, &buffer->head, vlines, t) {
69 TAILQ_REMOVE(&buffer->head, vl, vlines);
76 push_line(struct buffer *buffer, const struct line *l, const char *buf, size_t len, int flags)
82 if ((vl = calloc(1, sizeof(*vl))) == NULL)
85 if (len != 0 && (vl->line = calloc(1, len+1)) == NULL) {
92 memcpy(vl->line, buf, len);
95 if (TAILQ_EMPTY(&buffer->head))
96 TAILQ_INSERT_HEAD(&buffer->head, vl, vlines);
98 TAILQ_INSERT_TAIL(&buffer->head, vl, vlines);
103 * Build a list of visual line by wrapping the given line, assuming
104 * that when printed will have a leading prefix prfx.
107 wrap_text(struct buffer *buffer, const char *prfx, struct line *l, size_t width)
109 const char *separators = " \t-";
110 const char *start, *end, *line, *lastsep, *lastchar;
111 uint32_t cp = 0, state = 0;
112 size_t cur, prfxwidth, w;
115 if ((line = l->line) == NULL)
116 return push_line(buffer, l, NULL, 0, 0);
118 prfxwidth = utf8_swidth(prfx);
124 for (; *line; line++) {
125 if (utf8_decode(&state, &cp, *line))
127 w = utf8_chwidth(cp);
128 if (cur + w >= width -1) {
129 end = lastsep == NULL
130 ? utf8_next_cp((char*)lastchar)
131 : utf8_next_cp((char*)lastsep);
132 if (!push_line(buffer, l, start, end - start, flags))
134 flags = L_CONTINUATION;
136 cur = prfxwidth + utf8_swidth_between(start, lastchar);
137 } else if (strchr(separators, *line) != NULL) {
141 lastchar = utf8_prev_cp(line, l->line);
145 return push_line(buffer, l, start, line - start, flags);
149 hardwrap_text(struct buffer *buffer, struct line *l, size_t width)
151 const char *line, *start, *lastchar;
153 uint32_t state = 0, cp = 0;
156 if ((line = l->line) == NULL)
157 return push_line(buffer, l, NULL, 0, 0);
163 for (; *line; line++) {
164 if (utf8_decode(&state, &cp, *line))
166 w = utf8_chwidth(cp);
167 if (cur + w >= width) {
168 if (!push_line(buffer, l, start, lastchar - start, cont))
175 lastchar = utf8_prev_cp(line, l->line);
179 return push_line(buffer, l, start, line - start, cont);