|
LLVM 22.0.0git
|
This file defines a Levenshtein distance function that works for any two sequences, with each element of each sequence being analogous to a character in a string. More...
Go to the source code of this file.
Namespaces | |
| namespace | llvm |
| This is an optimization pass for GlobalISel generic memory operations. | |
Functions | |
| template<typename T, typename Functor> | |
| unsigned | llvm::ComputeMappedEditDistance (ArrayRef< T > FromArray, ArrayRef< T > ToArray, Functor Map, bool AllowReplacements=true, unsigned MaxEditDistance=0) |
| Determine the edit distance between two sequences. | |
| template<typename T> | |
| unsigned | llvm::ComputeEditDistance (ArrayRef< T > FromArray, ArrayRef< T > ToArray, bool AllowReplacements=true, unsigned MaxEditDistance=0) |
This file defines a Levenshtein distance function that works for any two sequences, with each element of each sequence being analogous to a character in a string.
Definition in file edit_distance.h.