Lines Matching defs:GoodSuffixTable
463 class GoodSuffixTable : public UMemory
466 GoodSuffixTable(CEList &patternCEs, BadCharacterTable &badCharacterTable, UErrorCode &status);
467 ~GoodSuffixTable();
472 int32_t *goodSuffixTable;
475 GoodSuffixTable::GoodSuffixTable(CEList &patternCEs, BadCharacterTable &badCharacterTable, UErrorCode &status)
476 : goodSuffixTable(NULL)
519 // now build goodSuffixTable
520 goodSuffixTable = NEW_ARRAY(int32_t, patlen);
522 if (goodSuffixTable == NULL) {
531 goodSuffixTable[i] = maxSkip;
547 if (goodSuffixTable[prefix] == maxSkip) {
548 goodSuffixTable[prefix] = prefixSkip;
557 goodSuffixTable[patlen - 1 - suff[i]] = badCharacterTable.minLengthInChars(i + 1);
563 GoodSuffixTable::~GoodSuffixTable()
565 DELETE_ARRAY(goodSuffixTable);
568 int32_t GoodSuffixTable::operator[](int32_t offset) const
570 return goodSuffixTable[offset];
596 GoodSuffixTable *BoyerMooreSearch::getGoodSuffixTable()
598 return goodSuffixTable;
603 : data(theData), patCEs(NULL), badCharacterTable(NULL), goodSuffixTable(NULL), pattern(patternString), target(NULL)
624 goodSuffixTable = new GoodSuffixTable(*patCEs, *badCharacterTable, status);
634 delete goodSuffixTable;
721 int32_t gsOffset = tOffset + (*goodSuffixTable)[pIndex];
804 tOffset += (*goodSuffixTable)[0]; // really? Maybe += 1 or += maxSkip?
