Hojun-Cho
852e129f62
Ctrl+H took the pending syllable as the query, but the keys typed after it started a composition of their own: gk, Ctrl+H, s showed 하ㄴ, and r, Ctrl+H, k showed ㄱㅏ. transstr now composes from a pending text, so the search goes on where the syllable left off. Escape ended the search and dropped the syllable it had taken; it puts it back as pending text.
111 lines
2.5 KiB
C
111 lines
2.5 KiB
C
#include "dat.h"
|
|
#include "fn.h"
|
|
#include "test.h"
|
|
|
|
static Str
|
|
kotrans(char *keys)
|
|
{
|
|
Str out, raw;
|
|
|
|
raw = mkstr(keys);
|
|
transstr(getlang(LangKO), nil, &raw, &out);
|
|
return out;
|
|
}
|
|
|
|
void
|
|
korean_sequences(struct ct *t)
|
|
{
|
|
static const struct { char *keys, *want; } cases[] = {
|
|
{ "r", "ㄱ" },
|
|
{ "rk", "가" },
|
|
{ "rkr", "각" },
|
|
{ "rkrk", "가가" },
|
|
{ "rkrtk", "각사" },
|
|
{ "rhk", "과" },
|
|
{ "rr", "ㄱㄱ" },
|
|
{ "Rk", "까" },
|
|
{ "rk1", "가1" },
|
|
{ "rt", "ㄳ" },
|
|
{ "rtk", "ㄱ사" },
|
|
{ "rtt", "ㄳㅅ" },
|
|
{ "kr", "가" },
|
|
{ "hkr", "과" },
|
|
{ "kk", "ㅏㅏ" },
|
|
};
|
|
Str out;
|
|
int i;
|
|
|
|
for(i = 0; i < nelem(cases); i++){
|
|
out = kotrans(cases[i].keys);
|
|
checkstr(t, cases[i].keys, cases[i].want, &out);
|
|
}
|
|
}
|
|
|
|
void
|
|
korean_compound_vowels(struct ct *t)
|
|
{
|
|
static const struct { char *keys, *want; } cases[] = {
|
|
{ "hk", "ㅘ" }, { "ho", "ㅙ" }, { "hl", "ㅚ" },
|
|
{ "nj", "ㅝ" }, { "np", "ㅞ" }, { "nl", "ㅟ" },
|
|
{ "ml", "ㅢ" },
|
|
};
|
|
Str out;
|
|
int i;
|
|
|
|
for(i = 0; i < nelem(cases); i++){
|
|
out = kotrans(cases[i].keys);
|
|
checkstr(t, cases[i].keys, cases[i].want, &out);
|
|
}
|
|
}
|
|
|
|
void
|
|
korean_compound_finals(struct ct *t)
|
|
{
|
|
static const struct { char *keys, *want, *split; } cases[] = {
|
|
{ "rkrt", "갃", "각사" }, { "rksw", "갅", "간자" },
|
|
{ "rksg", "갆", "간하" }, { "rkfr", "갉", "갈가" },
|
|
{ "rkfa", "갊", "갈마" }, { "rkfq", "갋", "갈바" },
|
|
{ "rkft", "갌", "갈사" }, { "rkfx", "갍", "갈타" },
|
|
{ "rkfv", "갎", "갈파" }, { "rkfg", "갏", "갈하" },
|
|
{ "rkqt", "값", "갑사" },
|
|
};
|
|
char keys[16];
|
|
Str out;
|
|
int i;
|
|
|
|
for(i = 0; i < nelem(cases); i++){
|
|
out = kotrans(cases[i].keys);
|
|
checkstr(t, cases[i].keys, cases[i].want, &out);
|
|
snprint(keys, sizeof keys, "%sk", cases[i].keys);
|
|
out = kotrans(keys);
|
|
checkstr(t, keys, cases[i].split, &out);
|
|
}
|
|
}
|
|
|
|
void
|
|
korean_backspace(struct ct *t)
|
|
{
|
|
static const struct { char *before, *after; } cases[] = {
|
|
{ "ㄱ", "" },
|
|
{ "ㄳ", "ㄱ" },
|
|
{ "가", "ㄱ" },
|
|
{ "과", "고" }, { "괘", "고" }, { "괴", "고" },
|
|
{ "궈", "구" }, { "궤", "구" }, { "귀", "구" },
|
|
{ "긔", "그" },
|
|
{ "각", "가" },
|
|
{ "갃", "각" }, { "갅", "간" }, { "갆", "간" },
|
|
{ "갉", "갈" }, { "갊", "갈" }, { "갋", "갈" },
|
|
{ "갌", "갈" }, { "갍", "갈" }, { "갎", "갈" },
|
|
{ "갏", "갈" }, { "값", "갑" },
|
|
};
|
|
Im state;
|
|
int i;
|
|
|
|
memset(&state, 0, sizeof state);
|
|
for(i = 0; i < nelem(cases); i++){
|
|
state.pre = mkstr(cases[i].before);
|
|
backko(&state);
|
|
checkstr(t, cases[i].before, cases[i].after, &state.pre);
|
|
}
|
|
}
|