version 1.18, 2016/03/16 15:36:26 |
version 1.19, 2016/09/17 15:06:41 |
|
|
return (0); |
return (0); |
} |
} |
|
|
for (i = 1; i < len; i++) |
for (i = 1; i < len; i++) |
if (!IS_UTF8_TRAIL(s[i])) |
if (!IS_UTF8_TRAIL(s[i])) |
return (0); |
return (0); |
return (1); |
return (1); |
|
|
{ |
{ |
/* The table is small; use linear search. */ |
/* The table is small; use linear search. */ |
int i; |
int i; |
for (i = 0; i < sizeof (comb_table) / sizeof (*comb_table); i++) { |
for (i = 0; i < sizeof (comb_table) / sizeof (*comb_table); i++) { |
if (ch1 == comb_table[i].first && |
if (ch1 == comb_table[i].first && |
ch2 == comb_table[i].last) |
ch2 == comb_table[i].last) |
return (1); |
return (1); |