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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/* Copyright (C) 2018 Curtis McEnroe <june@causal.agency>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#define _XOPEN_SOURCE_EXTENDED
#include <curses.h>
#include <err.h>
#include <locale.h>
#include <stdbool.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sysexits.h>
#include <unistd.h>
static struct Span {
size_t at, to;
} Span(size_t at, size_t to) {
return (struct Span) { at, to };
}
static bool spanEqual(struct Span a, struct Span b) {
return a.at == b.at && a.to == b.to;
}
static bool spanIn(struct Span a, struct Span b) {
return a.at > b.at && a.to < b.to;
}
static bool spanHeadIn(struct Span a, struct Span b) {
return a.at > b.at && a.at < b.to;
}
static bool spanTailIn(struct Span a, struct Span b) {
return a.to > b.at && a.to < b.to;
}
static struct Vec {
char *ptr;
size_t len;
} Vec(char *ptr, size_t len) {
return (struct Vec) { ptr, len };
}
static struct Vec vecHead(struct Vec vec, struct Span span, size_t at) {
return Vec(vec.ptr, at - span.at);
}
static struct Vec vecTail(struct Vec vec, struct Span span, size_t at) {
return Vec(vec.ptr + (at - span.at), vec.len - (at - span.at));
}
static struct Table {
struct Table *next, *prev;
size_t len;
struct Vec vec[];
} *Table(size_t cap) {
size_t size = sizeof(struct Table) + cap * sizeof(struct Vec);
struct Table *table = malloc(size);
if (!table) err(EX_OSERR, "malloc");
memset(table, 0, size);
return table;
}
static struct TableIter {
struct Table *table;
size_t i;
struct Vec vec;
struct Span span;
} TableIter(struct Table *table) {
return (struct TableIter) { table, 0, Vec(NULL, 0), Span(0, 0) };
}
static bool tableNext(struct TableIter *it) {
if (it->i == it->table->len) return false;
it->vec = it->table->vec[it->i++];
it->span = Span(it->span.to, it->span.to + it->vec.len);
return true;
}
static bool tablePrev(struct TableIter *it) {
if (!it->i) return false;
it->vec = it->table->vec[--it->i];
it->span = Span(it->span.at - it->vec.len, it->span.at);
return true;
}
static struct Table *tableInsert(struct Table *prev, size_t at, struct Vec vec) {
struct Table *next = Table(prev->len + 2);
if (!prev->len) {
next->vec[next->len++] = vec;
return next;
}
struct Span span = Span(at, at + vec.len);
for (struct TableIter it = TableIter(prev); tableNext(&it); (void)it) {
if (it.span.at == at) {
next->vec[next->len++] = vec;
next->vec[next->len++] = it.vec;
} else if (spanHeadIn(span, it.span)) {
next->vec[next->len++] = vecHead(it.vec, it.span, at);
next->vec[next->len++] = vec;
next->vec[next->len++] = vecTail(it.vec, it.span, at);
} else {
next->vec[next->len++] = it.vec;
}
}
return next;
}
static struct Table *tableDelete(struct Table *prev, struct Span span) {
struct Table *next = Table(prev->len + 1);
for (struct TableIter it = TableIter(prev); tableNext(&it); (void)it) {
if (spanIn(it.span, span) || spanEqual(it.span, span)) {
// drop
} else if (spanIn(span, it.span)) {
next->vec[next->len++] = vecHead(it.vec, it.span, span.at);
next->vec[next->len++] = vecTail(it.vec, it.span, span.to);
} else if (spanHeadIn(span, it.span)) {
next->vec[next->len++] = vecHead(it.vec, it.span, span.at);
} else if (spanTailIn(span, it.span)) {
next->vec[next->len++] = vecTail(it.vec, it.span, span.to);
} else {
next->vec[next->len++] = it.vec;
}
}
return next;
}
static struct VecIter {
struct Vec vec;
size_t i;
wchar_t ch;
} VecIter(struct Vec vec, size_t i) {
return (struct VecIter) { vec, i, 0 };
}
static bool vecNext(struct VecIter *it) {
if (it->i >= it->vec.len) return false;
int len = mbtowc(&it->ch, &it->vec.ptr[it->i], it->vec.len - it->i);
if (len < 0) errx(EX_DATAERR, "mbtowc");
it->i += len;
return true;
}
static bool vecPrev(struct VecIter *it) {
if (!it->i) return false;
int len;
for (int n = 1; n < MB_CUR_MAX; ++n) {
len = mbtowc(&it->ch, &it->vec.ptr[it->i - n], n);
if (len > 0) break;
}
if (len < 0) errx(EX_DATAERR, "mbtowc");
it->i -= len;
return true;
}
//static void curse(void) {
// setlocale(LC_CTYPE, "");
// initscr();
// cbreak();
// noecho();
// keypad(stdscr, true);
// set_escdelay(100);
//}
//
//static void curseChar(wchar_t ch, attr_t attr, short color) {
// cchar_t cc;
// wchar_t ws[] = { ch, 0 };
// setcchar(&cc, ws, attr, color, NULL);
// add_wch(&cc);
//}
static void draw(struct Table *table) {
//move(0, 0);
struct TableIter it = TableIter(table);
tableNext(&it);
printf("(%zu,%zu)%.*s", it.span.at, it.span.to, (int)it.vec.len, it.vec.ptr);
tableNext(&it);
printf("(%zu,%zu)%.*s", it.span.at, it.span.to, (int)it.vec.len, it.vec.ptr);
tablePrev(&it);
printf("(%zu,%zu)%.*s", it.span.at, it.span.to, (int)it.vec.len, it.vec.ptr);
tablePrev(&it);
printf("(%zu,%zu)%.*s", it.span.at, it.span.to, (int)it.vec.len, it.vec.ptr);
}
int main() {
struct Table *table = Table(0);
table = tableInsert(table, 0, Vec("Hello, world!\nGoodbye, world!\n", 30));
table = tableDelete(table, Span(1, 5));
table = tableInsert(table, 1, Vec("owdy", 4));
table = tableDelete(table, Span(3, 6));
table = tableInsert(table, 3, Vec(" Ω", 3));
//curse();
draw(table);
//getch();
//endwin();
}
|