From 00c03541f07f4fda104e5c803987b195c324efb2 Mon Sep 17 00:00:00 2001 From: Curtis McEnroe Date: Sun, 7 Oct 2018 00:09:58 -0400 Subject: Remove edi.c --- bin/edi.c | 204 -------------------------------------------------------------- 1 file changed, 204 deletions(-) delete mode 100644 bin/edi.c (limited to 'bin/edi.c') diff --git a/bin/edi.c b/bin/edi.c deleted file mode 100644 index 0bd606cd..00000000 --- a/bin/edi.c +++ /dev/null @@ -1,204 +0,0 @@ -/* Copyright (C) 2018 Curtis McEnroe - * - * 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 . - */ - -#define _XOPEN_SOURCE_EXTENDED - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -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(); -} -- cgit 1.4.1 pan>Allow names with prefixes of months and daysJune McEnroe 2022-08-15Add named dates to whenJune McEnroe 2022-08-14Remove tweets text fileJune McEnroe Such link rot. 2022-08-09Fix all copyright noticesJune McEnroe 2022-08-04Add Conversations With FriendsJune McEnroe The better of the two, but largely the same. I feel like these books are a bit too autobiographical, but I don't know if I'm allowed to accuse an author of that. My real problem is that I read these books as largely uncritical of their characters. They behave in nonsense ways, are mostly uncritical of their own behaviour, and don't really have arcs of growth or change. I suppose this book had a bit of one, but only in the last two chapters. 2022-07-30Add Normal PeopleJune McEnroe Unbearably straight. Eyerolls and sighs per page off the charts. Shout out to Joanna, I guess. I kinda like the lack of quotation marks though to be honest. After half of the Ruth Ozeki novel and now this, I need to get back to some genre fiction. 2022-07-26Rewrite glitch from new pngoJune McEnroe 2022-07-26Update Care with time-to-ID and piercingsJune McEnroe 2022-07-26Add -w to upJune McEnroe 2022-07-13Set push.autoSetupRemoteJune McEnroe 2022-07-08Remove TOURJune McEnroe There is not that much distinct stuff here anymore. 2022-07-03Add The Bone Shard EmperorJune McEnroe Suffers a little bit from middle book but I really enjoyed it. Read it faster than the first one too, despite its length. 2022-06-25Bump xterm font size to 12June McEnroe 2022-06-10Handle subshells (and functions) inside substitutionsJune McEnroe 2022-06-10Switch to jorts Install scriptJune McEnroe 2022-06-08Indicate if still reading or no resultsJune McEnroe 2022-06-08Add Maiden, Mother, CroneJune McEnroe Mixed bag like most collections of short stories. Some of them are pretty good. The author of the worst written story also has the worst written bio. 2022-06-05FIRST SHOW IN 2.5 YEARS BABEY!!!June McEnroe 2022-06-03Set line number on File linesJune McEnroe 2022-06-03Stop polling stdin after EOFJune McEnroe 2022-06-02Set TABSIZE=4June McEnroe Absolutely indiscriminately. 2022-06-02Do basic match highlightingJune McEnroe 2022-06-02Clean up parsing a littleJune McEnroe 2022-06-02Don't duplicate path stringJune McEnroe 2022-06-02Use stderr instead of /dev/tty, realloc buffer if lines too longJune McEnroe For some reason I haven't been able to figure out, trying to poll /dev/tty returns POLLNVAL (and this was using 100% CPU looping), but using stderr instead works fine. 2022-06-02Add initial working version of qfJune McEnroe 2022-05-29Set prompt for okshJune McEnroe