This is the complete list of members for rapidfuzz::CachedLevenshtein< CharT1 >, including all inherited members.
| CachedLevenshtein(const Sentence1 &s1_, LevenshteinWeightTable aWeights={1, 1, 1}) | rapidfuzz::CachedLevenshtein< CharT1 > | inline |
| CachedLevenshtein(InputIt1 first1, InputIt1 last1, LevenshteinWeightTable aWeights={1, 1, 1}) | rapidfuzz::CachedLevenshtein< CharT1 > | inline |
| distance(InputIt2 first2, InputIt2 last2, int64_t score_cutoff=std::numeric_limits< int64_t >::max()) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| distance(const Sentence2 &s2, int64_t score_cutoff=std::numeric_limits< int64_t >::max()) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| normalized_distance(InputIt2 first2, InputIt2 last2, double score_cutoff=1.0) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| normalized_distance(const Sentence2 &s2, double score_cutoff=1.0) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| normalized_similarity(InputIt2 first2, InputIt2 last2, double score_cutoff=0.0) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| normalized_similarity(const Sentence2 &s2, double score_cutoff=0.0) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| similarity(InputIt2 first2, InputIt2 last2, int64_t score_cutoff=0) const | rapidfuzz::CachedLevenshtein< CharT1 > | |
| similarity(const Sentence2 &s2, int64_t score_cutoff=0) const | rapidfuzz::CachedLevenshtein< CharT1 > |