Lines Matching refs:bigramFilter
102 const int codesBufferSize, const std::map<int, int> *bigramMap, const uint8_t *bigramFilter,
132 bigramMap, bigramFilter, useFullEditDistance, codesSrc + i + 1,
142 bigramMap, bigramFilter, useFullEditDistance, codesSrc + i, codesRemain - i,
165 startIndex + codesRemain, bigramMap, bigramFilter, useFullEditDistance, correction,
170 // bigramFilter is a bloom filter for fast rejection: see functions setInFilter and isInFilter
175 const std::map<int, int> *bigramMap, const uint8_t *bigramFilter,
187 xCoordinatesBuffer, yCoordinatesBuffer, codesSize, bigramMap, bigramFilter,
196 xCoordinatesBuffer, yCoordinatesBuffer, codesSize, bigramMap, bigramFilter,
202 bigramMap, bigramFilter, useFullEditDistance, masterCorrection, queuePool);
236 const int inputLength, const std::map<int, int> *bigramMap, const uint8_t *bigramFilter,
244 getOneWordSuggestions(proximityInfo, xcoordinates, ycoordinates, codes, bigramMap, bigramFilter,
317 const std::map<int, int> *bigramMap, const uint8_t *bigramFilter,
321 getSuggestionCandidates(useFullEditDistance, inputLength, bigramMap, bigramFilter, correction,
326 const int inputLength, const std::map<int, int> *bigramMap, const uint8_t *bigramFilter,
357 bigramMap, bigramFilter, correction, &childCount, &firstChildPos, &siblingPos,
494 0 /* bigramMap */, 0 /* bigramFilter */, correction, queuePool,
848 const std::map<int, int> *bigramMap, const uint8_t *bigramFilter, Correction *correction,
932 // bigramFilter is a bloom filter of said frequencies for even faster rejection.
933 const int probability = BinaryFormat::getProbability(initialPos, bigramMap, bigramFilter,
