Minor optimization for substitution candidate creation.

MrAlexSee · Oct 23, 2018 · 3ecf914 · 3ecf914
1 parent fba5034
commit 3ecf914
Showing 1 changed file with 4 additions and 2 deletions.
diff --git a/related/neighborhood.cpp b/related/neighborhood.cpp
@@ -93,14 +93,15 @@ float runHammingK1(const unordered_set<string> &wordSet, const vector<string> &p
             // This search assumes k = 1.
             for (size_t i = 0; i < pattern.size(); ++i)
             {
+                string candidate = pattern;
+
                 for (const char c : alphabet)
                 {
                     if (pattern[i] == c)
                     {
                         continue;
                     }
 
-                    string candidate = pattern;
                     candidate[i] = c;
 
                     if (wordSet.find(candidate) != wordSet.end())
@@ -145,14 +146,15 @@ float runLevenK1(const unordered_set<string> &wordSet, const vector<string> &pat
             // Substitutions for k = 1.
             for (size_t i = 0; i < pattern.size(); ++i)
             {
+                string candidate = pattern;
+
                 for (const char c : alphabet)
                 {
                     if (pattern[i] == c)
                     {
                         continue;
                     }
 
-                    string candidate = pattern;
                     candidate[i] = c;
 
                     if (wordSet.find(candidate) != wordSet.end())