| 345 | } |
| 346 | |
| 347 | size_t LevenshteinDFA::Move(size_t s, UniChar c) const |
| 348 | { |
| 349 | ASSERT_GREATER(m_alphabet.size(), 0, ()); |
| 350 | ASSERT(is_sorted(m_alphabet.begin(), m_alphabet.end() - 1), ()); |
| 351 | |
| 352 | size_t i; |
| 353 | auto const it = lower_bound(m_alphabet.begin(), m_alphabet.end() - 1, c); |
| 354 | if (it == m_alphabet.end() - 1 || *it != c) |
| 355 | i = m_alphabet.size() - 1; |
| 356 | else |
| 357 | i = distance(m_alphabet.begin(), it); |
| 358 | |
| 359 | return m_transitions[s][i]; |
| 360 | } |
| 361 | |
| 362 | std::string DebugPrint(LevenshteinDFA::Position const & p) |
| 363 | { |