Home | History | Annotate | Download | only in common

Lines Matching full:full

240          * full case mappings. Add them all.
263 closure=(const UChar *)pe+1; /* behind this slot, unless there are full case mappings */
269 /* add the full case folding */
274 /* start of full case mapping strings */
283 /* add the full case folding string */
296 closure=(const UChar *)pe; /* behind full case mappings */
789 int32_t full;
898 GET_SLOT_VALUE(excWord, UCASE_EXC_FULL_MAPPINGS, pe, full);
899 full&=UCASE_FULL_LOWER;
900 if(full!=0) {
905 return full;
933 int32_t full, idx;
969 GET_SLOT_VALUE(excWord, UCASE_EXC_FULL_MAPPINGS, pe, full);
971 /* start of full case mapping strings */
975 pe+=full&UCASE_FULL_LOWER;
976 full>>=4;
977 pe+=full&0xf;
978 full>>=4;
981 full&=0xf;
984 pe+=full&0xf;
985 full=(full>>4)&0xf;
988 if(full!=0) {
993 return full;
1032 * a full mapping, i.e., a string.
1041 # C: common case folding, common mappings shared by both simple and full mappings.
1042 # F: full case folding, mappings that cause strings to grow in length. Multiple characters are separated by spaces.
1050 # B. To do a full case folding, use the mappings with status C + F.
1143 int32_t full, idx;
1170 GET_SLOT_VALUE(excWord, UCASE_EXC_FULL_MAPPINGS, pe, full);
1172 /* start of full case mapping strings */
1176 pe+=full&UCASE_FULL_LOWER;
1177 full=(full>>4)&0xf;
1179 if(full!=0) {
1184 return full;