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
|
/* 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/>.
*/
#include <stdlib.h>
#include <wchar.h>
struct Span {
size_t at, to;
};
static inline struct Span spanNext(struct Span span, size_t len) {
return (struct Span) { span.to, span.to + len };
}
struct Slice {
const wchar_t *ptr;
size_t len;
};
struct Buffer {
size_t cap;
size_t len;
struct Slice slice;
struct Block {
struct Block *prev;
wchar_t chars[];
} *block;
};
struct Buffer bufferAlloc(size_t cap);
void bufferFree(struct Buffer *buf);
void bufferInsert(struct Buffer *buf);
void bufferAppend(struct Buffer *buf, wchar_t ch);
wchar_t *bufferDest(struct Buffer *buf, size_t len);
struct Table {
size_t len;
struct Slice slices[];
};
struct Table *tableInsert(const struct Table *prev, size_t at, struct Slice slice);
struct Table *tableDelete(const struct Table *prev, struct Span del);
struct Log {
size_t cap;
size_t len;
size_t index;
struct State {
struct Table *table;
size_t prev;
size_t next;
} *states;
};
struct Log logAlloc(size_t cap);
void logFree(struct Log *log);
void logPush(struct Log *log, struct Table *table);
static inline struct Table *logTable(struct Log *log) {
return log->states[log->index].table;
}
static inline void logPrev(struct Log *log) {
log->index = log->states[log->index].prev;
}
static inline void logNext(struct Log *log) {
log->index = log->states[log->index].next;
}
static inline void logBack(struct Log *log) {
if (log->index) log->index--;
}
static inline void logFore(struct Log *log) {
if (log->index + 1 < log->len) log->index++;
}
|