indexer/feature_visibility.cpp - master - githubmirror/omim

indexer/feature_visibility.cpp
590 строк14 KB
tatiana-yan
[indexer] Keep invisible recycling=* types.
29 май 2020, 15:45
29 май 2020, 15:4520c38de
#include "indexer/feature_visibility.hpp"

#include "indexer/classificator.hpp"
#include "indexer/drawing_rules.hpp"
#include "indexer/feature.hpp"
#include "indexer/feature_data.hpp"
#include "indexer/scales.hpp"

#include "base/assert.hpp"
#include "base/checked_cast.hpp"

#include <algorithm>
#include <array>

using namespace std;

template <typename ToDo>
typename ToDo::ResultType Classificator::ProcessObjects(uint32_t type, ToDo & toDo) const
{
  typedef typename ToDo::ResultType ResultType;
  ResultType res = ResultType(); // default initialization

  ClassifObject const * p = GetObject(type);
  if (p != &m_root)
  {
    ASSERT(p, ());
    toDo(p, res);
  }
  return res;
}

ClassifObject const * Classificator::GetObject(uint32_t type) const
{
  ClassifObject const * p = &m_root;
  uint8_t i = 0;

  // get the final ClassifObject
  uint8_t v;
  while (ftype::GetValue(type, i, v))
  {
    ++i;
    p = p->GetObject(v);
  }

  return p;
}

string Classificator::GetFullObjectName(uint32_t type) const
{
  ClassifObject const * p = &m_root;
  uint8_t i = 0;
  string s;

  // get the final ClassifObject
  uint8_t v;
  while (ftype::GetValue(type, i, v))
  {
    ++i;
    p = p->GetObject(v);
    s = s + p->GetName() + '|';
  }

  return s;
}

vector<string> Classificator::GetFullObjectNamePath(uint32_t type) const
{
  ClassifObject const * p = &m_root;
  uint8_t i = 0;
  vector<string> res;

  // get the final ClassifObject
  uint8_t v;
  while (ftype::GetValue(type, i, v))
  {
    ++i;
    p = p->GetObject(v);
    res.push_back(p->GetName());
  }

  return res;
}

namespace feature
{
namespace
{
  class DrawRuleGetter
  {
    int m_scale;
    GeomType m_gt;
    drule::KeysT & m_keys;

  public:
    DrawRuleGetter(int scale, GeomType gt, drule::KeysT & keys)
      : m_scale(scale), m_gt(gt), m_keys(keys)
    {
    }

    typedef bool ResultType;

    void operator() (ClassifObject const *)
    {
    }
    bool operator() (ClassifObject const * p, bool & res)
    {
      res = true;
      p->GetSuitable(min(m_scale, scales::GetUpperStyleScale()), m_gt, m_keys);
      return false;
    }
  };
}

pair<int, bool> GetDrawRule(TypesHolder const & types, int level,
                            drule::KeysT & keys)
{
  ASSERT ( keys.empty(), () );
  Classificator const & c = classif();

  DrawRuleGetter doRules(level, types.GetGeomType(), keys);
  for (uint32_t t : types)
    (void)c.ProcessObjects(t, doRules);

  return make_pair(static_cast<int>(types.GetGeomType()), types.Has(c.GetCoastType()));
}

void GetDrawRule(vector<uint32_t> const & types, int level, GeomType geomType, drule::KeysT & keys)

{
  ASSERT ( keys.empty(), () );
  Classificator const & c = classif();

  DrawRuleGetter doRules(level, geomType, keys);

  for (uint32_t t : types)
    (void)c.ProcessObjects(t, doRules);
}

void FilterRulesByRuntimeSelector(FeatureType & f, int zoomLevel, drule::KeysT & keys)
{
  keys.erase_if([&f, zoomLevel](drule::Key const & key)->bool
  {
    drule::BaseRule const * const rule = drule::rules().Find(key);
    if (rule == nullptr)
      return true;
    return !rule->TestFeature(f, zoomLevel);
  });
}

namespace
{
  class IsDrawableChecker
  {
    int m_scale;

  public:
    explicit IsDrawableChecker(int scale) : m_scale(scale) {}

    typedef bool ResultType;

    void operator() (ClassifObject const *) {}
    bool operator() (ClassifObject const * p, bool & res)
    {
      if (p->IsDrawable(m_scale))
      {
        res = true;
        return true;
      }
      return false;
    }
  };

  class IsDrawableLikeChecker
  {
    GeomType m_geomType;
    bool m_emptyName;

  public:
    IsDrawableLikeChecker(GeomType geomType, bool emptyName = false)
      : m_geomType(geomType), m_emptyName(emptyName)
    {
    }

    typedef bool ResultType;

    void operator() (ClassifObject const *) {}
    bool operator() (ClassifObject const * p, bool & res)
    {
      if (p->IsDrawableLike(m_geomType, m_emptyName))
      {
        res = true;
        return true;
      }
      return false;
    }
  };

  class IsDrawableRulesChecker
  {
    int m_scale;
    GeomType m_gt;
    bool m_arr[3];

  public:
    IsDrawableRulesChecker(int scale, GeomType gt, int rules)
      : m_scale(scale), m_gt(gt)
    {
      m_arr[0] = rules & RULE_CAPTION;
      m_arr[1] = rules & RULE_PATH_TEXT;
      m_arr[2] = rules & RULE_SYMBOL;
    }

    typedef bool ResultType;

    void operator() (ClassifObject const *) {}
    bool operator() (ClassifObject const * p, bool & res)
    {
      drule::KeysT keys;
      p->GetSuitable(m_scale, m_gt, keys);

      for (auto const & k : keys)
      {
        if ((m_arr[0] && k.m_type == drule::caption) ||
            (m_arr[1] && k.m_type == drule::pathtext) ||
            (m_arr[2] && k.m_type == drule::symbol))
        {
          res = true;
          return true;
        }
      }

      return false;
    }
  };

  bool HasRoutingExceptionType(uint32_t t)
  {
    static uint32_t const s = classif().GetTypeByPath({"route", "shuttle_train"});
    return s == t;
  }

  /// Add here all exception classificator types: needed for algorithms,
  /// but don't have drawing rules.
  /// Warning: Geometry of features with always existing types will be indexed in mwm on all
  /// zoom levels. If you add an always existing type to drawing types, the displacement of icons
  /// may work not correctly.
  bool TypeAlwaysExists(uint32_t type, GeomType g = GeomType::Undefined)
  {
    if (!classif().IsTypeValid(type))
      return false;

    static uint32_t const internet = classif().GetTypeByPath({"internet_access"});
    static uint32_t const complexEntry = classif().GetTypeByPath({"complex_entry"});

    if ((g == GeomType::Line || g == GeomType::Undefined) && HasRoutingExceptionType(type))
      return true;

    ftype::TruncValue(type, 1);
    if (g != GeomType::Line && type == internet)
      return true;

    if (type == complexEntry)
      return true;

    return false;
  }

  /// Add here all exception classificator types: needed for algorithms,
  /// but don't have drawing rules.
  bool IsUsefulNondrawableType(uint32_t type, GeomType g = GeomType::Undefined)
  {
    if (!classif().IsTypeValid(type))
      return false;

    if (TypeAlwaysExists(type, g))
      return true;

    static uint32_t const hwtag = classif().GetTypeByPath({"hwtag"});
    static uint32_t const roundabout = classif().GetTypeByPath({"junction", "roundabout"});
    static uint32_t const psurface = classif().GetTypeByPath({"psurface"});
    static uint32_t const wheelchair = classif().GetTypeByPath({"wheelchair"});
    static uint32_t const cuisine = classif().GetTypeByPath({"cuisine"});
    static uint32_t const recycling = classif().GetTypeByPath({"recycling"});
    static uint32_t const sponsored = classif().GetTypeByPath({"sponsored"});
    // Reserved for custom event processing, e.g. fc2018.
    // static uint32_t const event = classif().GetTypeByPath({"event" });

    // Caching type length to exclude generic [wheelchair].
    uint8_t const typeLength = ftype::GetLevel(type);

    if ((g == GeomType::Line || g == GeomType::Undefined) && type == roundabout)
      return true;

    ftype::TruncValue(type, 1);
    if (g == GeomType::Line || g == GeomType::Undefined)
    {
      if (type == hwtag || type == psurface)
        return true;
    }

    if (type == wheelchair && typeLength == 2)
      return true;

    if (type == cuisine || type == recycling)
      return true;

    if (g != GeomType::Line && type == sponsored)
      return true;

    // Reserved for custom event processing, e.g. fc2018.
    // if (event == type)
    //   return true;

    return false;
  }
}  // namespace

bool TypeIsUseful(uint32_t type)
{
  return IsUsefulNondrawableType(type) || classif().GetObject(type)->IsDrawableAny();
}

bool IsDrawableLike(vector<uint32_t> const & types, GeomType geomType)
{
  Classificator const & c = classif();

  IsDrawableLikeChecker doCheck(geomType);
  for (uint32_t t : types)
    if (c.ProcessObjects(t, doCheck))
      return true;
  return false;
}

bool IsDrawableForIndex(FeatureType & ft, int level)
{
  return IsDrawableForIndexGeometryOnly(ft, level) &&
         IsDrawableForIndexClassifOnly(TypesHolder(ft), level);
}

bool IsDrawableForIndex(TypesHolder const & types, m2::RectD limitRect, int level)
{
  return IsDrawableForIndexGeometryOnly(types, limitRect, level) &&
         IsDrawableForIndexClassifOnly(types, level);
}

bool IsDrawableForIndexGeometryOnly(FeatureType & ft, int level)
{
  return IsDrawableForIndexGeometryOnly(TypesHolder(ft),
                                        ft.GetLimitRect(FeatureType::BEST_GEOMETRY), level);
}
bool IsDrawableForIndexGeometryOnly(TypesHolder const & types, m2::RectD limitRect, int level)
{
  Classificator const & c = classif();

  static uint32_t const buildingPartType = c.GetTypeByPath({"building:part"});

  if (types.GetGeomType() == GeomType::Area && !types.Has(c.GetCoastType()) &&
      !types.Has(buildingPartType) && !scales::IsGoodForLevel(level, limitRect))
    return false;

  return true;
}

bool IsDrawableForIndexClassifOnly(TypesHolder const & types, int level)
{
  Classificator const & c = classif();
  IsDrawableChecker doCheck(level);
  for (uint32_t t : types)
  {
    if (TypeAlwaysExists(t) || c.ProcessObjects(t, doCheck))
      return true;
  }

  return false;
}

bool IsUsefulType(uint32_t t, GeomType geomType, bool emptyName)
{
  Classificator const & c = classif();

  if (IsUsefulNondrawableType(t, geomType))
    return true;

  IsDrawableLikeChecker doCheck(geomType, emptyName);
  if (c.ProcessObjects(t, doCheck))
    return true;

  // IsDrawableLikeChecker checks only unique area styles,
  // so we need to take into account point styles too.
  if (geomType == GeomType::Area)
  {
    IsDrawableLikeChecker doCheck(GeomType::Point, emptyName);
    if (c.ProcessObjects(t, doCheck))
      return true;
  }

  return false;
}

bool HasUsefulType(vector<uint32_t> const & types, GeomType geomType, bool emptyName)
{
  if (types.empty())
    return false;

  return any_of(types.begin(), types.end(), [&](uint32_t t) {
    return IsUsefulType(t, geomType, emptyName);
  });
}

bool RemoveUselessTypes(vector<uint32_t> & types, GeomType geomType, bool emptyName)
{
  base::EraseIf(types, [&] (uint32_t t) {
    return !IsUsefulType(t, geomType, emptyName);
  });

  return !types.empty();
}

int GetMinDrawableScale(FeatureType & ft)
{
  return GetMinDrawableScale(TypesHolder(ft), ft.GetLimitRect(FeatureType::BEST_GEOMETRY));
}

int GetMinDrawableScale(TypesHolder const & types, m2::RectD limitRect)
{
  int const upBound = scales::GetUpperStyleScale();

  for (int level = 0; level <= upBound; ++level)
  {
    if (IsDrawableForIndex(types, limitRect, level))
      return level;
  }

  return -1;
}

int GetMinDrawableScaleGeometryOnly(TypesHolder const & types, m2::RectD limitRect)
{
  int const upBound = scales::GetUpperStyleScale();

  for (int level = 0; level <= upBound; ++level)
  {
    if (IsDrawableForIndexGeometryOnly(types, limitRect, level))
      return level;
  }

  return -1;
}

int GetMinDrawableScaleClassifOnly(TypesHolder const & types)
{
  int const upBound = scales::GetUpperStyleScale();

  for (int level = 0; level <= upBound; ++level)
  {
    if (IsDrawableForIndexClassifOnly(types, level))
      return level;
  }

  return -1;
}

namespace
{
  void AddRange(pair<int, int> & dest, pair<int, int> const & src)
  {
    if (src.first != -1)
    {
      ASSERT_GREATER(src.first, -1, ());
      ASSERT_GREATER(src.second, -1, ());

      dest.first = min(dest.first, src.first);
      dest.second = max(dest.second, src.second);

      ASSERT_GREATER(dest.first, -1, ());
      ASSERT_GREATER(dest.second, -1, ());
    }
  }

  class DoGetScalesRange
  {
    pair<int, int> m_scales;
  public:
    DoGetScalesRange() : m_scales(1000, -1000) {}
    typedef bool ResultType;

    void operator() (ClassifObject const *) {}
    bool operator() (ClassifObject const * p, bool & res)
    {
      res = true;
      AddRange(m_scales, p->GetDrawScaleRange());
      return false;
    }

    pair<int, int> GetScale() const
    {
      return (m_scales.first > m_scales.second ? make_pair(-1, -1) : m_scales);
    }
  };
}

pair<int, int> GetDrawableScaleRange(uint32_t type)
{
  DoGetScalesRange doGet;
  (void)classif().ProcessObjects(type, doGet);
  return doGet.GetScale();
}

pair<int, int> GetDrawableScaleRange(TypesHolder const & types)
{
  pair<int, int> res(1000, -1000);

  for (uint32_t t : types)
    AddRange(res, GetDrawableScaleRange(t));

  return (res.first > res.second ? make_pair(-1, -1) : res);
}

bool IsVisibleInRange(uint32_t type, pair<int, int> const & scaleRange)
{
  CHECK_LESS_OR_EQUAL(scaleRange.first, scaleRange.second, (scaleRange));
  if (TypeAlwaysExists(type))
    return true;

  Classificator const & c = classif();
  for (int scale = scaleRange.first; scale <= scaleRange.second; ++scale)
  {
    IsDrawableChecker doCheck(scale);
    if (c.ProcessObjects(type, doCheck))
      return true;
  }
  return false;
}

namespace
{
  bool IsDrawableForRules(TypesHolder const & types, int level, int rules)
  {
    Classificator const & c = classif();

    IsDrawableRulesChecker doCheck(level, types.GetGeomType(), rules);
    for (uint32_t t : types)
      if (c.ProcessObjects(t, doCheck))
        return true;

    return false;
  }
}

pair<int, int> GetDrawableScaleRangeForRules(TypesHolder const & types, int rules)
{
  int const upBound = scales::GetUpperStyleScale();
  int lowL = -1;
  for (int level = 0; level <= upBound; ++level)
  {
    if (IsDrawableForRules(types, level, rules))
    {
      lowL = level;
      break;
    }
  }

  if (lowL == -1)
    return make_pair(-1, -1);

  int highL = lowL;
  for (int level = upBound; level > lowL; --level)
  {
    if (IsDrawableForRules(types, level, rules))
    {
      highL = level;
      break;
    }
  }

  return make_pair(lowL, highL);
}

TypeSetChecker::TypeSetChecker(initializer_list<char const *> const & lst)
{
  m_type = classif().GetTypeByPath(lst);
  m_level = base::checked_cast<uint8_t>(lst.size());
}

bool TypeSetChecker::IsEqual(uint32_t type) const
{
  ftype::TruncValue(type, m_level);
  return (m_type == type);
}
}   // namespace feature