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>2010-12-30 06:01:08 +0300
committerAlex Zolotarev <alex@maps.me>2015-09-23 01:08:56 +0300
commite86f6bf2be16fca54ba8b8509bc4c903d450c49b (patch)
tree99b58f3e915d3710646f766b879c040c384d1029 /indexer/interval_index_builder.hpp
parent22844c07f36dc4ed22896727684e6fd5047cfd8a (diff)
Fix compilation in debug after the previous commit.
Diffstat (limited to 'indexer/interval_index_builder.hpp')
-rw-r--r--indexer/interval_index_builder.hpp16
1 files changed, 8 insertions, 8 deletions
diff --git a/indexer/interval_index_builder.hpp b/indexer/interval_index_builder.hpp
index 8706a91e58..0d75b59818 100644
--- a/indexer/interval_index_builder.hpp
+++ b/indexer/interval_index_builder.hpp
@@ -19,29 +19,29 @@ void BuildIntervalIndex(CellIdValueIterT const & beg, CellIdValueIterT const & e
{
uint32_t count = 0;
uint32_t maxCount = 0;
- typename CellIdValueIterT::value_type mostPopulousCell;
+ typename CellIdValueIterT::value_type mostPopulousCell = *beg;
CellIdValueIterT it = beg;
- int64_t prev = it->first;
+ int64_t prev = it->GetCell();
for (++it; it != end; ++it)
{
- ASSERT_GREATER(it->first, 0, ());
- ASSERT_LESS_OR_EQUAL(prev, it->first, ());
- count = (prev == it->first ? count + 1 : 0);
+ ASSERT_GREATER(it->GetCell(), 0, ());
+ ASSERT_LESS_OR_EQUAL(prev, it->GetCell(), ());
+ count = (prev == it->GetCell() ? count + 1 : 0);
if (count > maxCount)
{
maxCount = count;
mostPopulousCell = *it;
}
- prev = it->first;
+ prev = it->GetCell();
}
if (maxCount > 0)
{
LOG(LINFO, ("Most populous cell:", maxCount,
- mostPopulousCell.first, mostPopulousCell.second));
+ mostPopulousCell.GetCell(), mostPopulousCell.GetFeature()));
}
}
for (CellIdValueIterT it = beg; it != end; ++it)
- ASSERT_LESS(it->first, 1ULL << 8 * kCellIdBytes, ());
+ ASSERT_LESS(it->GetCell(), 1ULL << 8 * kCellIdBytes, ());
#endif
// Write header.
{