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
diff options
context:
space:
mode:
authorYury Melnichek <melnichek@gmail.com>2011-04-24 18:53:32 +0400
committerAlex Zolotarev <alex@maps.me>2015-09-23 01:16:21 +0300
commit830281b9eeb7b939676d338c505a79fc6cf6582b (patch)
tree1779170539d6ecebd488ea3aa0071ac7555541b2 /indexer/cell_coverer.hpp
parentac31ed145aaede41548d55c09feff5a8059289c6 (diff)
Remove commented-out CoverPolygon().
Diffstat (limited to 'indexer/cell_coverer.hpp')
-rw-r--r--indexer/cell_coverer.hpp75
1 files changed, 0 insertions, 75 deletions
diff --git a/indexer/cell_coverer.hpp b/indexer/cell_coverer.hpp
index fd98a88b62..2f575493c2 100644
--- a/indexer/cell_coverer.hpp
+++ b/indexer/cell_coverer.hpp
@@ -219,78 +219,3 @@ inline void CoverRect(CoordT minX, CoordT minY,
ASSERT_LESS_OR_EQUAL(result.size(), cells_count, (minX, minY, maxX, maxY));
cells.insert(cells.end(), result.begin(), result.end());
}
-
-/*
-template <typename BoundsT, typename CellIdT>
-inline void CoverPolygon(vector<CoordPointT> const & polyLine, size_t cellDepth,
- vector<CellIdT> & cells)
-{
- CoverPolyLine<BoundsT>(polyLine, cellDepth, cells);
- if (cells.size() < 8)
- return;
-
- CellIdT minX = CellX(cells[0]), minY = CellY(cells[0]),
- maxX = CellX(cells[0]), maxY = CellY(cells[0]);
- for (size_t i = 1; i < cells.size(); ++i)
- {
- CellIdT cellX = CellX(cells[i]);
- CellIdT cellY = CellY(cells[i]);
-
- if (cellX.m_V < minX.m_V) minX.m_V = cellX.m_V;
- if (cellY.m_V < minY.m_V) minY.m_V = cellY.m_V;
- if (cellX.m_V > maxX.m_V) maxX.m_V = cellX.m_V;
- if (cellY.m_V > maxY.m_V) maxY.m_V = cellY.m_V;
- }
-
- vector< vector<bool> > covered;
- covered.resize(static_cast<size_t>(maxY.m_V - minY.m_V + 3));
- for (size_t i = 0; i < covered.size(); ++i)
- {
- covered[i].resize(static_cast<size_t>(maxX.m_V - minX.m_V + 3));
- }
-
- vector< vector<bool> > outer = covered;
-
- for (size_t i = 0; i < cells.size(); ++i)
- {
- size_t offsetX = static_cast<size_t>(CellX(cells[i]).m_V - minX.m_V + 1);
- size_t offsetY = static_cast<size_t>(CellY(cells[i]).m_V - minY.m_V + 1);
-
- covered[offsetY][offsetX] = true;
- }
-
- queue< pair<size_t, size_t> > flood;
- size_t outerY = outer.size();
- size_t outerX = outer[0].size();
- flood.push(make_pair(0, 0));
-
- while (!flood.empty())
- {
- size_t i = flood.front().first;
- size_t j = flood.front().second;
- flood.pop();
- outer[i][j] = true;
- if ((j > 0) && (!outer[i][j - 1]) && (!covered[i][j - 1]))
- flood.push(make_pair(i, j - 1));
- if ((i > 0) && (!outer[i - 1][j]) && (!covered[i - 1][j]))
- flood.push(make_pair(i - 1, j));
- if ((j < outerX - 1) && (!outer[i][j + 1]) && (!covered[i][j + 1]))
- flood.push(make_pair(i, j + 1));
- if ((i < outerY - 1) && (!outer[i + 1][j]) && (!covered[i + 1][j]))
- flood.push(make_pair(i + 1, j));
- }
-
- cells.clear();
-
- for (size_t i = 0; i < outer.size(); ++i)
- {
- for (size_t j = 0; j < outer[i].size(); ++j)
- {
- if (!outer[i][j])
- {
- cells.push_back(CellFromCellXY(cellDepth, minX.m_V + j - 1, minY.m_V + i - 1));
- }
- }
- }
-}
-*/