Lines Matching defs:character
1049 * Test for a combining character.
1055 unicode_combinable(u_int16_t character)
1060 if (character < 0x0300)
1063 value = bitmap[(character >> 8) & 0xFF];
1069 return (bitmap[(character & 0xFF) / 8] & (1 << (character % 8)) ? 1 : 0);
1075 * Test for a precomposed character.
1080 unicode_decomposeable(u_int16_t character) {
1084 if (character < 0x00C0)
1087 value = bitmap[(character >> 8) & 0xFF];
1093 return (bitmap[(character & 0xFF) / 8] & (1 << (character % 8)) ? 1 : 0);
1098 static int unicode_decompose(u_int16_t character, u_int16_t *convertedChars);
1380 u_int16_t character)
1384 if ((character < theTable[0]._key) || (character > theTable[numElem-1]._key))
1391 if (character < divider->_key) { q = divider - 1; }
1392 else if (character > divider->_key) { p = divider + 1; }
1408 u_int16_t character)
1412 if ((character < theTable[0]._key) || (character > theTable[numElem-1]._key))
1419 if (character < divider->_key)
1421 else if (character > divider->_key)
1431 unicode_recursive_decompose(u_int16_t character, u_int16_t *convertedChars)
1442 __UniCharDecompositionTableLength, character);
1483 * composed character into its correct decomposed
1489 unicode_decompose(u_int16_t character, u_int16_t *convertedChars)
1491 if ((character >= HANGUL_SBASE) &&
1492 (character <= (HANGUL_SBASE + HANGUL_SCOUNT))) {
1495 character -= HANGUL_SBASE;
1496 length = (character % HANGUL_TCOUNT ? 3 : 2);
1499 character / HANGUL_NCOUNT + HANGUL_LBASE;
1501 (character % HANGUL_NCOUNT) / HANGUL_TCOUNT + HANGUL_VBASE;
1503 *convertedChars = (character % HANGUL_TCOUNT) + HANGUL_TBASE;
1506 return (unicode_recursive_decompose(character, convertedChars));
1515 * a decomposed character sequence into a single precomposed
1516 * (composite) character.