1066 }

  1066 }

  1067 

  1067 

  1068 // --------

  1068 // --------

  1069 

  1069 

  1070 CircularSearchBuffer::CircularSearchBuffer(const String& s, bool isCaseSensitive)

  1070 CircularSearchBuffer::CircularSearchBuffer(const String& s, bool isCaseSensitive)

  1071     : m_target(isCaseSensitive ? s : s.foldCase())

  1074     : m_target(isCaseSensitive ? s : s.foldCase())

  1072     , m_isCaseSensitive(isCaseSensitive)

  1076     , m_isCaseSensitive(isCaseSensitive)

  1073     , m_characterBuffer(m_target.length())

  1077     , m_characterBuffer(m_target.length())

  1074     , m_isCharacterStartBuffer(m_target.length())

  1078     , m_isCharacterStartBuffer(m_target.length())

  1075     , m_isBufferFull(false)

  1079     , m_isBufferFull(false)

  1076     , m_cursor(0)

  1080     , m_cursor(0)

  1096         return;

  1100         return;

  1097     }

  1101     }

  1098     const int maxFoldedCharacters = 16; // sensible maximum is 3, this should be more than enough

  1102     const int maxFoldedCharacters = 16; // sensible maximum is 3, this should be more than enough

  1099     UChar foldedCharacters[maxFoldedCharacters];

  1103     UChar foldedCharacters[maxFoldedCharacters];

  1100     bool error;

  1104     bool error;

  1101     int numFoldedCharacters = foldCase(foldedCharacters, maxFoldedCharacters, &c, 1, &error);

  1108     int numFoldedCharacters = foldCase(foldedCharacters, maxFoldedCharacters, &c, 1, &error);

  1102     ASSERT(!error);

  1110     ASSERT(!error);

  1103     ASSERT(numFoldedCharacters);

  1111     ASSERT(numFoldedCharacters);

  1104     ASSERT(numFoldedCharacters <= maxFoldedCharacters);

  1112     ASSERT(numFoldedCharacters <= maxFoldedCharacters);

  1105     if (!error && numFoldedCharacters) {

  1113     if (!error && numFoldedCharacters) {

  1106         numFoldedCharacters = min(numFoldedCharacters, maxFoldedCharacters);

  1114         numFoldedCharacters = min(numFoldedCharacters, maxFoldedCharacters);