summaryrefslogtreecommitdiff
path: root/src/misc.cpp
diff options
context:
space:
mode:
authorSadie Powell <sadie@witchery.services>2024-02-29 21:56:14 +0000
committerSadie Powell <sadie@witchery.services>2024-02-29 21:56:14 +0000
commit1c1645096f953aa06b5809be6b302015b5bc73d6 (patch)
treebe03513aa05c44ea017ca4ecb1e6c497dd231857 /src/misc.cpp
parente0ac5509b4020cb6e78c6b7c591ef2e7f6314ced (diff)
If a user runs an invalid command try to suggest a valid one.
Diffstat (limited to 'src/misc.cpp')
-rw-r--r--src/misc.cpp36
1 files changed, 36 insertions, 0 deletions
diff --git a/src/misc.cpp b/src/misc.cpp
index b44176ecd..b40c69844 100644
--- a/src/misc.cpp
+++ b/src/misc.cpp
@@ -20,6 +20,7 @@
#include "sockets.h"
#include <cerrno>
+#include <numeric>
#include <sys/stat.h>
#include <sys/types.h>
#ifndef _WIN32
@@ -747,3 +748,38 @@ Anope::string Anope::Random(size_t len)
buf.append(chars[rand() % sizeof(chars)]);
return buf;
}
+
+// Implementation of https://en.wikipedia.org/wiki/Levenshtein_distance
+size_t Anope::Distance(const Anope::string &s1, const Anope::string &s2)
+{
+ if (s1.empty())
+ return s2.length();
+ if (s2.empty())
+ return s1.length();
+
+ std::vector<size_t> costs(s2.length() + 1);
+ std::iota(costs.begin(), costs.end(), 0);
+
+ size_t i = 0;
+ for (const auto c1 : s1)
+ {
+ costs[0] = i + 1;
+ size_t corner = i;
+ size_t j = 0;
+ for (const auto &c2 : s2)
+ {
+ size_t upper = costs[j + 1];
+ if (c1 == c2)
+ costs[j + 1] = corner;
+ else
+ {
+ size_t t = upper < corner ? upper : corner;
+ costs[j + 1] = (costs[j] < t ? costs[j] : t) + 1;
+ }
+ corner = upper;
+ j++;
+ }
+ i++;
+ }
+ return costs[s2.length()];
+}