2020-02-05 01:23:55 +00:00
|
|
|
/* Copyright (C) 2020 C. McEnroe <june@causal.agency>
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU 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 General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2020-02-05 02:27:52 +00:00
|
|
|
#include <assert.h>
|
|
|
|
#include <limits.h>
|
2020-02-05 01:23:55 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
2020-02-05 02:27:52 +00:00
|
|
|
#include <wchar.h>
|
2020-02-05 01:23:55 +00:00
|
|
|
|
|
|
|
#include "chat.h"
|
|
|
|
|
2020-02-05 02:27:52 +00:00
|
|
|
enum { Cap = 512 };
|
2020-02-05 05:20:39 +00:00
|
|
|
static wchar_t buf[Cap];
|
|
|
|
static size_t len;
|
|
|
|
static size_t pos;
|
2020-02-05 02:27:52 +00:00
|
|
|
|
2020-02-05 05:20:39 +00:00
|
|
|
char *editHead(void) {
|
2020-02-05 02:27:52 +00:00
|
|
|
static char mbs[MB_LEN_MAX * Cap];
|
|
|
|
const wchar_t *ptr = buf;
|
2020-02-05 05:20:39 +00:00
|
|
|
size_t n = wcsnrtombs(mbs, &ptr, pos, sizeof(mbs) - 1, NULL);
|
2020-02-05 02:27:52 +00:00
|
|
|
assert(n != (size_t)-1);
|
2020-02-05 05:20:39 +00:00
|
|
|
mbs[n] = '\0';
|
2020-02-05 02:27:52 +00:00
|
|
|
return mbs;
|
2020-02-05 01:23:55 +00:00
|
|
|
}
|
|
|
|
|
2020-02-05 05:20:39 +00:00
|
|
|
char *editTail(void) {
|
2020-02-05 02:27:52 +00:00
|
|
|
static char mbs[MB_LEN_MAX * Cap];
|
|
|
|
const wchar_t *ptr = &buf[pos];
|
2020-02-05 05:20:39 +00:00
|
|
|
size_t n = wcsnrtombs(mbs, &ptr, len - pos, sizeof(mbs) - 1, NULL);
|
2020-02-05 02:27:52 +00:00
|
|
|
assert(n != (size_t)-1);
|
2020-02-05 05:20:39 +00:00
|
|
|
mbs[n] = '\0';
|
2020-02-05 02:27:52 +00:00
|
|
|
return mbs;
|
2020-02-05 01:23:55 +00:00
|
|
|
}
|
2020-02-05 05:20:39 +00:00
|
|
|
|
2020-02-07 06:55:26 +00:00
|
|
|
static void reserve(size_t index, size_t count) {
|
|
|
|
if (len + count > Cap) return;
|
|
|
|
memmove(&buf[index + count], &buf[index], sizeof(*buf) * (len - index));
|
|
|
|
len += count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void delete(size_t index, size_t count) {
|
|
|
|
if (index + count > len) return;
|
|
|
|
memmove(
|
|
|
|
&buf[index], &buf[index + count], sizeof(*buf) * (len - index - count)
|
|
|
|
);
|
|
|
|
len -= count;
|
|
|
|
}
|
|
|
|
|
2020-02-05 05:20:39 +00:00
|
|
|
void edit(size_t id, enum Edit op, wchar_t ch) {
|
|
|
|
switch (op) {
|
2020-02-07 06:55:26 +00:00
|
|
|
break; case EditHome: pos = 0;
|
|
|
|
break; case EditEnd: pos = len;
|
|
|
|
break; case EditLeft: if (pos) pos--;
|
|
|
|
break; case EditRight: if (pos < len) pos++;
|
|
|
|
|
|
|
|
break; case EditKill: len = pos = 0;
|
|
|
|
break; case EditErase: if (pos) delete(--pos, 1);
|
|
|
|
|
2020-02-05 05:20:39 +00:00
|
|
|
break; case EditInsert: {
|
2020-02-07 06:55:26 +00:00
|
|
|
reserve(pos, 1);
|
|
|
|
if (pos < Cap) buf[pos++] = ch;
|
2020-02-05 05:20:39 +00:00
|
|
|
}
|
2020-02-08 02:30:25 +00:00
|
|
|
break; case EditComplete: {
|
|
|
|
// TODO
|
|
|
|
}
|
2020-02-05 05:20:39 +00:00
|
|
|
break; case EditEnter: {
|
|
|
|
pos = 0;
|
|
|
|
command(id, editTail());
|
|
|
|
len = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|