Algo::LevenshteinDistance

Navigation

API > API/Runtime > API/Runtime/Core > API/Runtime/Core/Algo

References

namespace Algo  
{  
    template<typename RangeAType, typename RangeBType>  
    int32 Algo&58;&58;LevenshteinDistance  
    &40;  
        const RangeAType & RangeA,  
        const RangeBType & RangeB  
    &41;  
}  
Copy full snippet

namespace Algo {     template<typename RangeAType, typename RangeBType>     int32 Algo&58;&58;LevenshteinDistance     &40;         const RangeAType & RangeA,         const RangeBType & RangeB     &41; }

Remarks

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

Parameters