rapidfuzz::CachedLevenshtein< CharT1 > Struct Template Reference

#include <rapidfuzz_amalgamated.hpp>

Public Member Functions
template<typename Sentence1 >
	CachedLevenshtein (const Sentence1 &s1_, LevenshteinWeightTable aWeights={1, 1, 1})
template<typename InputIt1 >
	CachedLevenshtein (InputIt1 first1, InputIt1 last1, LevenshteinWeightTable aWeights={1, 1, 1})
template<typename InputIt2 >
int64_t	distance (InputIt2 first2, InputIt2 last2, int64_t score_cutoff=std::numeric_limits< int64_t >::max()) const
template<typename Sentence2 >
int64_t	distance (const Sentence2 &s2, int64_t score_cutoff=std::numeric_limits< int64_t >::max()) const
template<typename InputIt2 >
int64_t	similarity (InputIt2 first2, InputIt2 last2, int64_t score_cutoff=0) const
template<typename Sentence2 >
int64_t	similarity (const Sentence2 &s2, int64_t score_cutoff=0) const
template<typename InputIt2 >
double	normalized_distance (InputIt2 first2, InputIt2 last2, double score_cutoff=1.0) const
template<typename Sentence2 >
double	normalized_distance (const Sentence2 &s2, double score_cutoff=1.0) const
template<typename InputIt2 >
double	normalized_similarity (InputIt2 first2, InputIt2 last2, double score_cutoff=0.0) const
template<typename Sentence2 >
double	normalized_similarity (const Sentence2 &s2, double score_cutoff=0.0) const

Constructor & Destructor Documentation

CachedLevenshtein() [1/2]

template<typename CharT1 >

template<typename Sentence1 >

rapidfuzz::CachedLevenshtein< CharT1 >::CachedLevenshtein ( const Sentence1 &  s1_, LevenshteinWeightTable  aWeights = {1, 1, 1}  )

inline

CachedLevenshtein() [2/2]

template<typename CharT1 >

template<typename InputIt1 >

rapidfuzz::CachedLevenshtein< CharT1 >::CachedLevenshtein ( InputIt1  first1, InputIt1  last1, LevenshteinWeightTable  aWeights = {1, 1, 1}  )

inline

Member Function Documentation

distance() [1/2]

template<typename CharT1 >

template<typename Sentence2 >

int64_t rapidfuzz::CachedLevenshtein< CharT1 >::distance	(	const Sentence2 &	s2,
		int64_t	score_cutoff = std::numeric_limits<int64_t>::max()
	)		const

distance() [2/2]

template<typename CharT1 >

template<typename InputIt2 >

int64_t rapidfuzz::CachedLevenshtein< CharT1 >::distance	(	InputIt2	first2,
		InputIt2	last2,
		int64_t	score_cutoff = std::numeric_limits<int64_t>::max()
	)		const

normalized_distance() [1/2]

template<typename CharT1 >

template<typename Sentence2 >

double rapidfuzz::CachedLevenshtein< CharT1 >::normalized_distance	(	const Sentence2 &	s2,
		double	score_cutoff = 1.0
	)		const

normalized_distance() [2/2]

template<typename CharT1 >

template<typename InputIt2 >

double rapidfuzz::CachedLevenshtein< CharT1 >::normalized_distance	(	InputIt2	first2,
		InputIt2	last2,
		double	score_cutoff = 1.0
	)		const

normalized_similarity() [1/2]

template<typename CharT1 >

template<typename Sentence2 >

double rapidfuzz::CachedLevenshtein< CharT1 >::normalized_similarity	(	const Sentence2 &	s2,
		double	score_cutoff = 0.0
	)		const

normalized_similarity() [2/2]

template<typename CharT1 >

template<typename InputIt2 >

double rapidfuzz::CachedLevenshtein< CharT1 >::normalized_similarity	(	InputIt2	first2,
		InputIt2	last2,
		double	score_cutoff = 0.0
	)		const

similarity() [1/2]

template<typename CharT1 >

template<typename Sentence2 >

int64_t rapidfuzz::CachedLevenshtein< CharT1 >::similarity	(	const Sentence2 &	s2,
		int64_t	score_cutoff = 0
	)		const

similarity() [2/2]

template<typename CharT1 >

template<typename InputIt2 >

int64_t rapidfuzz::CachedLevenshtein< CharT1 >::similarity	(	InputIt2	first2,
		InputIt2	last2,
		int64_t	score_cutoff = 0
	)		const

---

The documentation for this struct was generated from the following file:

• rapidfuzz_amalgamated.hpp