diff options
| author | David Moc <personal@cdatgoose.org> | 2026-11-19 02:10:24 +0100 |
|---|---|---|
| committer | David Moc <personal@cdatgoose.org> | 2026-11-19 02:10:24 +0100 |
| commit | 74111495622a13104b4f6500f6dc8e9db6aec9bd (patch) | |
| tree | 9695ff6f2abbb1d5f04bf9061d3ffafc248fb9f1 /langs | |
Hello World!
Diffstat (limited to 'langs')
| -rw-r--r-- | langs/english.c | 80 | ||||
| -rw-r--r-- | langs/pinyin.c | 74 |
2 files changed, 154 insertions, 0 deletions
diff --git a/langs/english.c b/langs/english.c new file mode 100644 index 0000000..966b2c9 --- /dev/null +++ b/langs/english.c @@ -0,0 +1,80 @@ +#include <ctype.h> +#include "lang.h" + +static const char DIGRAPHS[] = "thsh"; + +static size_t first_letter_len(Span w) { + if (w.len == 0) return 0; + if (w.len >= 2) { + char a = (char)tolower((unsigned char)w.ptr[0]); + char b = (char)tolower((unsigned char)w.ptr[1]); + for (size_t i = 0; DIGRAPHS[i]; i += 2) + if (a == DIGRAPHS[i] && b == DIGRAPHS[i + 1]) return 2; + } + return 1; +} + +static int encrypt_word(SB *sb, Span w) { + size_t p = first_letter_len(w); + if (p == 0) return 0; + + if (sb_append_n(sb, w.ptr + p, w.len - p) != 0) return -1; + if (sb_push(sb, '@') != 0) return -1; + for (size_t i = 0; i < p; i++) + if (sb_push(sb, (char)tolower((unsigned char)w.ptr[i])) != 0) return -1; + return 0; +} + +static int decrypt_word(SB *sb, Span t) { + if (t.len == 0) return 0; + + size_t at = t.len; + for (size_t i = t.len; i-- > 0; ) { + if (t.ptr[i] == '@') { at = i; break; } + } + + if (at == t.len || at + 1 == t.len) + return sb_append_n(sb, t.ptr, t.len); + + if (sb_append_n(sb, t.ptr + at + 1, t.len - at - 1) != 0) return -1; + return sb_append_n(sb, t.ptr, at); +} + +char *lang_encrypt(const char *input) { + Span *words = NULL; + size_t n = split_spans(input, ' ', &words); + if (n == 0) return NULL; + + SB sb; + sb_init(&sb); + for (size_t i = 0; i < n; i++) { + if ((i > 0 && sb_push(&sb, '.') != 0) || encrypt_word(&sb, words[i]) != 0) { + sb_free(&sb); + free(words); + return NULL; + } + } + free(words); + return sb_take(&sb); +} + +char *lang_decrypt(const char *input) { + Span *tokens = NULL; + size_t n = split_spans(input, '.', &tokens); + if (n == 0) return NULL; + + SB sb; + sb_init(&sb); + for (size_t i = 0; i < n; i++) { + if ((i > 0 && sb_push(&sb, ' ') != 0) || decrypt_word(&sb, tokens[i]) != 0) { + sb_free(&sb); + free(tokens); + return NULL; + } + } + free(tokens); + + if (sb.len > 0) + sb.data[0] = (char)toupper((unsigned char)sb.data[0]); + return sb_take(&sb); +} diff --git a/langs/pinyin.c b/langs/pinyin.c new file mode 100644 index 0000000..c6d7f29 --- /dev/null +++ b/langs/pinyin.c @@ -0,0 +1,74 @@ +#include <ctype.h> +#include "lang.h" + +/* Longest first, so "zh" is tried before "z". */ +static const char *INITIALS[] = { + "zh", "ch", "sh", + "b", "p", "m", "f", "d", "t", "n", "l", "g", "k", "h", + "j", "q", "x", "r", "z", "c", "s", "y", "w", + NULL +}; + +static int is_digit(char c) { return c >= '0' && c <= '9'; } + +/* Length of the initial consonant at the start of the syllable, 0 if none. */ +static size_t initial_len(Span w) { + for (size_t i = 0; INITIALS[i]; i++) { + size_t n = strlen(INITIALS[i]); + if (w.len < n) continue; + size_t k = 0; + while (k < n && tolower((unsigned char)w.ptr[k]) == INITIALS[i][k]) k++; + if (k == n) return n; + } + return 0; +} + +static size_t find_digit(Span w) { + for (size_t i = 0; i < w.len; i++) + if (is_digit(w.ptr[i])) return i; + return w.len; /* w.len means "none" */ +} + +/* "chu1" -> "u1ch", "yao4" -> "ao4y". Syllables with no initial ("an4") or no + tone digit ("de") pass through, because decrypt couldn't find the split. */ +static int encrypt_word(SB *sb, Span w) { + size_t p = initial_len(w); + if (p == 0 || find_digit(w) == w.len) + return sb_append_n(sb, w.ptr, w.len); + + if (sb_append_n(sb, w.ptr + p, w.len - p) != 0) return -1; + return sb_append_n(sb, w.ptr, p); +} + +/* "u1ch" -> "chu1": everything after the first digit moves back to the front. */ +static int decrypt_word(SB *sb, Span t) { + size_t d = find_digit(t); + if (d == t.len) + return sb_append_n(sb, t.ptr, t.len); + + if (sb_append_n(sb, t.ptr + d + 1, t.len - d - 1) != 0) return -1; + return sb_append_n(sb, t.ptr, d + 1); +} + +/* Split on `from`, run `fn` on each piece, join with `to`. */ +static char *translate(const char *input, char from, char to, + int (*fn)(SB *, Span)) { + Span *parts = NULL; + size_t n = split_spans(input, from, &parts); + if (n == 0) return NULL; + + SB sb; + sb_init(&sb); + for (size_t i = 0; i < n; i++) { + if ((i > 0 && sb_push(&sb, to) != 0) || fn(&sb, parts[i]) != 0) { + sb_free(&sb); + free(parts); + return NULL; + } + } + free(parts); + return sb_take(&sb); +} + +char *lang_encrypt(const char *input) { return translate(input, ' ', '.', encrypt_word); } +char *lang_decrypt(const char *input) { return translate(input, '.', ' ', decrypt_word); } |
