summaryrefslogtreecommitdiff
path: root/lib/Support
diff options
context:
space:
mode:
authorDouglas Gregor <dgregor@apple.com>2009-12-30 17:23:44 +0000
committerDouglas Gregor <dgregor@apple.com>2009-12-30 17:23:44 +0000
commit441c8b4ad17c0d029b2247c367111395e7ad068c (patch)
treefd7a1d57e11e237fab718c328d99e73a226d5dcf /lib/Support
parent7fccf76048b66c2526197063feb133e706a48ad4 (diff)
downloadllvm-441c8b4ad17c0d029b2247c367111395e7ad068c.tar.gz
llvm-441c8b4ad17c0d029b2247c367111395e7ad068c.tar.bz2
llvm-441c8b4ad17c0d029b2247c367111395e7ad068c.tar.xz
Implement edit distance for StringRef
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92309 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support')
-rw-r--r--lib/Support/StringRef.cpp31
1 files changed, 31 insertions, 0 deletions
diff --git a/lib/Support/StringRef.cpp b/lib/Support/StringRef.cpp
index 2d023e4895..9084ea6ece 100644
--- a/lib/Support/StringRef.cpp
+++ b/lib/Support/StringRef.cpp
@@ -8,6 +8,7 @@
//===----------------------------------------------------------------------===//
#include "llvm/ADT/StringRef.h"
+#include <vector>
using namespace llvm;
// MSVC emits references to this into the translation units which reference it.
@@ -35,6 +36,36 @@ int StringRef::compare_lower(StringRef RHS) const {
return Length < RHS.Length ? -1 : 1;
}
+/// \brief Compute the edit distance between the two given strings.
+unsigned StringRef::edit_distance(llvm::StringRef Other,
+ bool AllowReplacements) {
+ size_type m = size();
+ size_type n = Other.size();
+
+ std::vector<unsigned> previous(n+1, 0);
+ for (std::vector<unsigned>::size_type i = 0; i <= n; ++i)
+ previous[i] = i;
+
+ std::vector<unsigned> current(n+1, 0);
+ for (size_type y = 1; y <= m; ++y) {
+ current.assign(n+1, 0);
+ current[0] = y;
+ for (size_type x = 1; x <= n; ++x) {
+ if (AllowReplacements) {
+ current[x] = min(previous[x-1] + ((*this)[y-1] == Other[x-1]? 0u:1u),
+ min(current[x-1], previous[x])+1);
+ }
+ else {
+ if ((*this)[y-1] == Other[x-1]) current[x] = previous[x-1];
+ else current[x] = min(current[x-1], previous[x]) + 1;
+ }
+ }
+ current.swap(previous);
+ }
+
+ return previous[n];
+}
+
//===----------------------------------------------------------------------===//
// String Searching
//===----------------------------------------------------------------------===//