rapidfuzz::common Namespace Reference

Classes
struct	BlockPatternMatchVector
struct	CharHashTable
struct	CharHashTable< CharT1, ValueType, 1 >
struct	ConstMatrixVectorView
struct	Matrix
struct	MatrixVectorView
struct	PatternMatchVector

Functions
template<typename InputIt1 , typename InputIt2 >
DecomposedSet< InputIt1, InputIt2, InputIt1 >	set_decomposition (SplittedSentenceView< InputIt1 > a, SplittedSentenceView< InputIt2 > b)
constexpr double	result_cutoff (double result, double score_cutoff)
template<int Max = 1>
constexpr double	norm_distance (int64_t dist, int64_t lensum, double score_cutoff=0)
template<typename T >
constexpr bool	is_zero (T a, T tolerance=std::numeric_limits< T >::epsilon())
template<typename Sentence , typename CharT = char_type<Sentence>, typename = std::enable_if_t<is_explicitly_convertible<Sentence, std::basic_string<CharT>>::value>>
std::basic_string< CharT >	to_string (Sentence &&str)
template<typename Sentence , typename CharT = char_type<Sentence>, typename = std::enable_if_t<!is_explicitly_convertible<Sentence, std::basic_string<CharT>>::value && has_data_and_size<Sentence>::value>>
std::basic_string< CharT >	to_string (const Sentence &str)
template<typename CharT >
CharT *	to_begin (CharT *s)
template<typename T >
auto	to_begin (T &x)
template<typename CharT >
CharT *	to_end (CharT *s)
template<typename T >
auto	to_end (T &x)
template<typename InputIterator1 , typename InputIterator2 >
std::pair< InputIterator1, InputIterator2 >	mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2)
	Finds the first mismatching pair of elements from two ranges: one defined by [first1, last1) and another defined by [first2,last2). Similar implementation to std::mismatch from C++14.
template<typename InputIt1 , typename InputIt2 >
StringAffix	remove_common_affix (InputIt1 &first1, InputIt1 &last1, InputIt2 &first2, InputIt2 &last2)
template<typename InputIt1 , typename InputIt2 >
int64_t	remove_common_prefix (InputIt1 &first1, InputIt1 last1, InputIt2 &first2, InputIt2 last2)
template<typename InputIt1 , typename InputIt2 >
int64_t	remove_common_suffix (InputIt1 first1, InputIt1 &last1, InputIt2 first2, InputIt2 &last2)
template<typename InputIt , typename CharT = iterator_type<InputIt>>
SplittedSentenceView< InputIt >	sorted_split (InputIt first, InputIt last)
template<typename T >
constexpr auto	to_unsigned (T value) -> typename std::make_unsigned< T >::type
template<typename T >
constexpr auto	to_signed (T value) -> typename std::make_unsigned< T >::type
template<typename T , typename U >
bool	CanTypeFitValue (const U value)