Algo::LevenshteinDistance

LevenshteinDistance return the number of edit operation we need to transform RangeA to RangeB.

Windows
MacOS
Linux

References

Module

Core

Header

/Engine/Source/Runtime/Core/Public/Algo/LevenshteinDistance.h

Include

#include "Algo/LevenshteinDistance.h"

Syntax

namespace Algo
{
    template<typename RangeAType, typename RangeBType>
    int32 Algo::LevenshteinDistance
    (
        const RangeAType & RangeA,
        const RangeBType & RangeB
    )
}

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

Returns

The number of operation to transform RangeA to RangeB

Parameters

Parameter

Description

RangeA

The first range of element

RangeB

The second range of element

Help shape the future of Unreal Engine documentation! Tell us how we're doing so we can serve you better.
Take our survey
Dismiss