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
|
/* Copyright (C) 2018 June 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/>.
*/
#include <err.h>
#include <stdlib.h>
#include <sysexits.h>
#include <wchar.h>
#include "edi.h"
struct Table tableAlloc(size_t cap) {
struct Slice *slices = malloc(sizeof(*slices) * cap);
if (!slices) err(EX_OSERR, "malloc");
return (struct Table) { .cap = cap, .slices = slices };
}
void tableFree(struct Table *table) {
free(table->slices);
}
void tablePush(struct Table *table, struct Slice slice) {
if (table->len == table->cap) {
table->cap *= 2;
table->slices = realloc(
table->slices,
sizeof(*table->slices) * table->cap
);
if (!table->slices) err(EX_OSERR, "malloc");
}
table->slices[table->len++] = slice;
}
void tableReplace(struct Table *table, struct Slice old, struct Slice new) {
for (size_t i = 0; i < table->len; ++i) {
if (table->slices[i].ptr != old.ptr) continue;
if (table->slices[i].len != old.len) continue;
table->slices[i] = new;
break;
}
}
struct Table tableInsert(const struct Table *prev, size_t at, struct Slice ins) {
struct Table next = tableAlloc(prev->len + 2);
struct Span span = { 0, 0 };
for (size_t i = 0; i < prev->len; ++i) {
span = spanNext(span, prev->slices[i].len);
if (span.at == at) {
next.slices[next.len++] = ins;
next.slices[next.len++] = prev->slices[i];
} else if (span.at < at && span.to > at) {
next.slices[next.len++] = (struct Slice) {
prev->slices[i].ptr,
at - span.at,
};
next.slices[next.len++] = ins;
next.slices[next.len++] = (struct Slice) {
&prev->slices[i].ptr[at - span.at],
prev->slices[i].len - (at - span.at),
};
} else {
next.slices[next.len++] = prev->slices[i];
}
}
if (span.to == at) {
next.slices[next.len++] = ins;
}
return next;
}
struct Table tableDelete(const struct Table *prev, struct Span del) {
struct Table next = tableAlloc(prev->len + 1);
struct Span span = { 0, 0 };
for (size_t i = 0; i < prev->len; ++i) {
span = spanNext(span, prev->slices[i].len);
if (span.at >= del.at && span.to <= del.to) {
(void)prev->slices[i];
} else if (span.at < del.at && span.to > del.to) {
next.slices[next.len++] = (struct Slice) {
prev->slices[i].ptr,
del.at - span.at,
};
next.slices[next.len++] = (struct Slice) {
&prev->slices[i].ptr[del.to - span.at],
prev->slices[i].len - (del.to - span.at),
};
} else if (span.at < del.at && span.to > del.at) {
next.slices[next.len++] = (struct Slice) {
prev->slices[i].ptr,
del.at - span.at,
};
} else if (span.at < del.to && span.to > del.to) {
next.slices[next.len++] = (struct Slice) {
&prev->slices[i].ptr[del.to - span.at],
prev->slices[i].len - (del.to - span.at),
};
} else {
next.slices[next.len++] = prev->slices[i];
}
}
return next;
}
#ifdef TEST
#include <assert.h>
static struct Slice slice(const wchar_t *str) {
return (struct Slice) { str, wcslen(str) };
}
static struct Span span(size_t at, size_t to) {
return (struct Span) { at, to };
}
static int eq(const wchar_t *str, const struct Table *table) {
for (size_t i = 0; i < table->len; ++i) {
if (wcsncmp(str, table->slices[i].ptr, table->slices[i].len)) {
return 0;
}
str = &str[table->slices[i].len];
}
return !str[0];
}
int main() {
struct Table abc = tableInsert(&TableEmpty, 0, slice(L"ABC"));
assert(eq(L"ABC", &abc));
struct Table dabc = tableInsert(&abc, 0, slice(L"D"));
struct Table abcd = tableInsert(&abc, 3, slice(L"D"));
struct Table adbc = tableInsert(&abc, 1, slice(L"D"));
assert(eq(L"DABC", &dabc));
assert(eq(L"ABCD", &abcd));
assert(eq(L"ADBC", &adbc));
tableFree(&dabc);
tableFree(&abcd);
tableFree(&adbc);
struct Table bc = tableDelete(&abc, span(0, 1));
struct Table ab = tableDelete(&abc, span(2, 3));
struct Table ac = tableDelete(&abc, span(1, 2));
struct Table __ = tableDelete(&abc, span(0, 3));
assert(eq(L"BC", &bc));
assert(eq(L"AB", &ab));
assert(eq(L"AC", &ac));
assert(eq(L"", &__));
tableFree(&bc);
tableFree(&ab);
tableFree(&ac);
tableFree(&__);
tableFree(&abc);
}
#endif
|