Normalize romanized identifiers to Hepburn
This commit is contained in:
parent
7935e5e7ea
commit
787febbd07
72 changed files with 871 additions and 871 deletions
28
addelcmn.c
28
addelcmn.c
|
|
@ -30,7 +30,7 @@
|
|||
#include <string.h>
|
||||
#include "sj_euc.h"
|
||||
#include "sj_kcnv.h"
|
||||
#include "sj_hinsi.h"
|
||||
#include "sj_hinshi.h"
|
||||
#include "sj_yomi.h"
|
||||
#include "kanakan.h"
|
||||
|
||||
|
|
@ -40,7 +40,7 @@ void mvmemi(), mvmemd(), mkidxtbl();
|
|||
void set_size(unsigned char* p, int size, int plen, int nlen) {
|
||||
*p = (unsigned char)(size >> 8);
|
||||
if(nlen & 0x10) *p |= NokoriYomiTop;
|
||||
if(plen & 0x10) *p |= AssyukuYomiTop;
|
||||
if(plen & 0x10) *p |= AsshukuYomiTop;
|
||||
*(p + 1) = (unsigned char)size;
|
||||
*(p + 2) = (unsigned char)((nlen & 0x0f) | ((plen & 0x0f) << 4));
|
||||
}
|
||||
|
|
@ -91,9 +91,9 @@ static int
|
|||
isgrm(TypeGram gram) {
|
||||
int grm = gram;
|
||||
|
||||
if(MEISI_1 <= grm && grm <= D_MEISI_6) return TRUE;
|
||||
if(MYOUJI <= grm && grm <= JOSUUSI2) return TRUE;
|
||||
if(KEIYOUSI_1 <= grm && grm <= DO_ZAHEN) return TRUE;
|
||||
if(MEISHI_1 <= grm && grm <= D_MEISHI_6) return TRUE;
|
||||
if(MYOUJI <= grm && grm <= JOSUUSHI2) return TRUE;
|
||||
if(KEIYOUSHI_1 <= grm && grm <= DO_ZAHEN) return TRUE;
|
||||
if(DO_1DAN_1 <= grm && grm <= DO_WAGO_2) return TRUE;
|
||||
if(DO_KAGO_5 <= grm && grm <= DO_WAGO_5) return TRUE;
|
||||
if(DO_KAGO_6 <= grm && grm <= DO_WAGO_6) return TRUE;
|
||||
|
|
@ -113,7 +113,7 @@ addel_arg(unsigned char* yp, unsigned char* kp, TypeGram grm, unsigned char* nyp
|
|||
if(!sj2cd_str(yp, nyp, len)) err |= AD_BadYomi;
|
||||
if(!isvyomi(nyp)) err |= AD_BadYomi;
|
||||
if(!isvknj(kp)) err |= AD_BadKanji;
|
||||
if(!isgrm(grm)) err |= AD_BadHinsi;
|
||||
if(!isgrm(grm)) err |= AD_BadHinshi;
|
||||
return err;
|
||||
}
|
||||
|
||||
|
|
@ -169,9 +169,9 @@ int cvtknj(unsigned char* yomi, unsigned char* knj, unsigned char* dst) {
|
|||
yomi2kata(yomi, kana);
|
||||
|
||||
if((len = top_strcmp(yomi, knj)) != 0) {
|
||||
*dst = (unsigned char)(ZenHiraAssyuku | (len - 1));
|
||||
*dst = (unsigned char)(ZenHiraAsshuku | (len - 1));
|
||||
} else if((len = top_strcmp(kana, knj)) != 0) {
|
||||
*dst = (unsigned char)(ZenKataAssyuku | (len - 1));
|
||||
*dst = (unsigned char)(ZenKataAsshuku | (len - 1));
|
||||
}
|
||||
|
||||
if(len) {
|
||||
|
|
@ -182,10 +182,10 @@ int cvtknj(unsigned char* yomi, unsigned char* knj, unsigned char* dst) {
|
|||
if(*knj) {
|
||||
for(;;) {
|
||||
if((len = last_strcmp(yomi, knj)) != 0) {
|
||||
*dst++ = (unsigned char)(ZenHiraAssyuku | (len - 1));
|
||||
*dst++ = (unsigned char)(ZenHiraAsshuku | (len - 1));
|
||||
break;
|
||||
} else if((len = last_strcmp(kana, knj)) != 0) {
|
||||
*dst++ = (unsigned char)(ZenKataAssyuku | (len - 1));
|
||||
*dst++ = (unsigned char)(ZenKataAsshuku | (len - 1));
|
||||
break;
|
||||
} else if(*knj == SS2) {
|
||||
knj++;
|
||||
|
|
@ -253,7 +253,7 @@ int srchkana(unsigned char** ptr, int* saml) {
|
|||
return 0;
|
||||
}
|
||||
|
||||
int srchgram(unsigned char* ptr, unsigned char** dst, TypeGram hinsi) {
|
||||
int srchgram(unsigned char* ptr, unsigned char** dst, TypeGram hinshi) {
|
||||
unsigned char* endp;
|
||||
int cnt = 0, nlen;
|
||||
int flg = FALSE;
|
||||
|
|
@ -263,14 +263,14 @@ int srchgram(unsigned char* ptr, unsigned char** dst, TypeGram hinsi) {
|
|||
nlen = getnlen(ptr);
|
||||
ptr += DouonBlkSizeNumber + nlen;
|
||||
while(ptr < endp) {
|
||||
if(*ptr == hinsi) {
|
||||
if(*ptr == hinshi) {
|
||||
*dst = ptr;
|
||||
flg = TRUE;
|
||||
}
|
||||
|
||||
do {
|
||||
ptr += codesize(*ptr);
|
||||
} while(*ptr != HinsiBlkTerm);
|
||||
} while(*ptr != HinshiBlkTerm);
|
||||
ptr++;
|
||||
cnt++;
|
||||
}
|
||||
|
|
@ -290,7 +290,7 @@ int srchkanji(unsigned char** dst, unsigned char* knj, int klen) {
|
|||
|
||||
ptr = *dst + 1;
|
||||
|
||||
while(*ptr != HinsiBlkTerm) {
|
||||
while(*ptr != HinshiBlkTerm) {
|
||||
for(p = ptr, q = knj, len = klen; len; len--)
|
||||
if(*p++ != *q++) break;
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue