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

feature_impl.cpp « indexer - github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 27341e2f86a75a4b818bfec09d651d5da7e4a42f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include "indexer/feature_impl.hpp"

#include "base/string_utils.hpp"
#include "base/logging.hpp"
#include "base/math.hpp"


namespace feature
{

bool IsDigit(int c)
{
  return (int('0') <= c && c <= int('9'));
}

bool IsNumber(strings::UniString const & s)
{
  for (size_t i = 0; i < s.size(); ++i)
  {
    // android production ndk-r8d has bug. "еда" detected as a number.
    if (!IsDigit(s[i]))
      return false;
  }
  return true;
}

bool IsStreetNumber(strings::UniString const & s)
{
  size_t count = s.size();
  if (count >= 2)
  {
    /// add different localities in future, if it's a problem.
    string streetEndings [] = {"st", "nd", "rd", "th"};
    for (size_t i = 0; i < ARRAY_SIZE(streetEndings); ++i)
    {
      size_t start = count - streetEndings[i].size();
      bool flag = false;
      for (size_t j = 0; j < streetEndings[i].size(); ++j)
      {
        if (streetEndings[i][j] != s[start + j])
        {
          flag = true;
          break;
        }
      }
      if (flag)
        return false;
    }
    return true;
  }
  return false;
}

bool IsHouseNumberDeepCheck(strings::UniString const & s)
{
  size_t const count = s.size();
  if (count == 0)
    return false;
  if (!IsDigit(s[0]))
    return false;
  if (IsStreetNumber(s))
    return false;
  return (count < 8);
}

bool IsHouseNumber(string const & s)
{
  return (!s.empty() && IsDigit(s[0]));
}

bool IsHouseNumber(strings::UniString const & s)
{
  return (!s.empty() && IsDigit(s[0]));
}

uint8_t PopulationToRank(uint64_t p)
{
  return static_cast<uint8_t>(min(0xFF, my::rounds(log(double(p)) / log(1.1))));
}

uint64_t RankToPopulation(uint8_t r)
{
  return static_cast<uint64_t>(pow(1.1, r));
}

} // namespace feature