Module |
|
Header |
/Engine/Source/Runtime/Core/Public/Algo/LevenshteinDistance.h |
Include |
#include "Algo/LevenshteinDistance.h" |
namespace Algo
{
template<typename RangeAType, typename RangeBType>
int32 Algo::LevenshteinDistance
(
const RangeAType & RangeA,
const RangeBType & RangeB
)
}
LevenshteinDistance return the number of edit operation we need to transform RangeA to RangeB. Operation type are Add/Remove/substitution of range element. Base on Levenshtein algorithm.
Range[A/B]Type: Support [] operator and the range element must be able to be compare with == operator Support GetNum() functionality
The number of operation to transform RangeA to RangeB
Parameter |
Description |
---|---|
RangeA |
The first range of element |
RangeB |
The second range of element |