Lines Matching defs:character
645 // Handle either a single newline character (which becomes a space),
918 // Whether or not we should emit a character as we enter m_node (if it's a container) or as we hit it (if it's atomic).
941 // No character needed if this is the first node in the range.
982 // Emit a character to show the positioning of m_node.
986 // on m_node to see if it necessitates emitting a character first and will early return
1023 // emitted character is positioned visually.
1051 void TextIterator::emitCharacter(UChar character, Node& characterNode, Node* offsetBaseNode, int textStartOffset, int textEndOffset)
1061 m_copyableText.set(character);
1063 m_lastCharacter = character;
1073 // FIXME: This probably yields the wrong offsets when text-transform: lowercase turns a single character into two characters.
1701 static inline bool isKanaLetter(UChar character)
1704 if (character >= 0x3041 && character <= 0x3096)
1708 if (character >= 0x30A1 && character <= 0x30FA)
1710 if (character >= 0x31F0 && character <= 0x31FF)
1714 if (character >= 0xFF66 && character <= 0xFF9D && character != 0xFF70)
1720 static inline bool isSmallKanaLetter(UChar character)
1722 ASSERT(isKanaLetter(character));
1724 switch (character) {
1781 static inline VoicedSoundMarkType composedVoicedSoundMark(UChar character)
1783 ASSERT(isKanaLetter(character));
1785 switch (character) {
1848 static inline bool isCombiningVoicedSoundMark(UChar character)
1850 switch (character) {
1892 static bool isNonLatin1Separator(UChar32 character)
1894 ASSERT_ARG(character, character >= 256);
1896 return U_GET_GC_MASK(character) & (U_GC_S_MASK | U_GC_P_MASK | U_GC_Z_MASK | U_GC_CF_MASK);
1899 static inline bool isSeparator(UChar32 character)
1920 if (character < 256)
1921 return latin1SeparatorTable[character];
1923 return isNonLatin1Separator(character);
1945 // so if the target begins with such a character, we just ignore the AtWordStart option.
2097 // Check for differences in the kana letter character itself.
2157 // The last character of an uppercase run followed by a non-separator, non-digit
2178 // a word, so treat the position before any CJK character as a word start.
2219 // possibly including a combining character that's not yet in the buffer.
2347 // character at a time. To do this we take advantage of m_isCharacterStartBuffer, but if