Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
path: root/base
diff options
context:
space:
mode:
authortatiana-yan <tatiana.kondakova@gmail.com>2018-06-26 14:37:51 +0300
committertatiana-yan <tatiana.kondakova@gmail.com>2018-06-26 14:37:51 +0300
commitdfdb1a08d4fbb96ff90ca886db18d0d8ccdfc342 (patch)
tree2d3522d23752918136b8d1fc39933972f3a5908c /base
parentd5748f2847aa2d356674cb195d37ff932e7f0584 (diff)
[base] Fix infinite loop in LevenshteinDFA
Diffstat (limited to 'base')
-rw-r--r--base/levenshtein_dfa.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/base/levenshtein_dfa.cpp b/base/levenshtein_dfa.cpp
index 7ea5023724..b6bae3928b 100644
--- a/base/levenshtein_dfa.cpp
+++ b/base/levenshtein_dfa.cpp
@@ -203,7 +203,7 @@ LevenshteinDFA::LevenshteinDFA(UniString const & s, size_t prefixSize,
auto const pSize = static_cast<typename std::iterator_traits<
UniString::iterator>::difference_type>(prefixSize);
- for (auto it = s.begin(); std::distance(it, s.begin()) < pSize; ++it)
+ for (auto it = s.begin(); std::distance(s.begin(), it) < pSize; ++it)
{
for (auto const & misprints : prefixMisprints)
{