StringUtils.hpp

Go to the documentation of this file.

/*
 * StringUtils.hpp
 *
 *  Created on: Sep 15, 2020
 *      Author: Nicola Mori
 */

#ifndef STRINGUTILS_HPP_
#define STRINGUTILS_HPP_

#include "core/Traits.h"
#include "utils/levenshtein-sse.hpp"

namespace EA {

namespace StringUtils {

template <typename Container>
std::enable_if_t<!(EA::is_pointer<typename Container::value_type>::value), std::string>
FindSimilar(const std::string &str, const Container &cont) {
  std::size_t minDist = std::numeric_limits<std::size_t>::max();
  typename Container::const_iterator mostSimilarIter;
  for (auto stringIter = cont.begin(); stringIter != cont.end(); ++stringIter) {
    std::size_t dist = levenshteinSSE::levenshtein(str, *stringIter);
    if (dist < minDist) {
      mostSimilarIter = stringIter;
      if (dist == 0) {
        break;
      } else {
        minDist = dist;
      }
    }
  }
  return *mostSimilarIter;
}

template <typename Container>
std::enable_if_t<EA::is_pointer<typename Container::value_type>::value, std::string>
FindSimilar(const std::string &str, const Container &cont) {
  std::size_t minDist = std::numeric_limits<std::size_t>::max();
  typename Container::const_iterator mostSimilarIter;
  for (auto stringIter = cont.begin(); stringIter != cont.end(); ++stringIter) {
    std::size_t dist = levenshteinSSE::levenshtein(str, *(*stringIter));
    if (dist < minDist) {
      mostSimilarIter = stringIter;
      if (dist == 0) {
        break;
      } else {
        minDist = dist;
      }
    }
  }
  return *(*mostSimilarIter);
}

} // namespace StringUtils

} // namespace EA

#endif /* STRINGUTILS_HPP_ */