mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-09-27 20:20:49 +00:00
Fixed codestyle
This commit is contained in:
parent
068633fc3e
commit
82d60c74db
@ -227,18 +227,21 @@ void IPolygonDictionary::loadData()
|
|||||||
|
|
||||||
std::vector<std::pair<Polygon, size_t>> polygon_ids;
|
std::vector<std::pair<Polygon, size_t>> polygon_ids;
|
||||||
polygon_ids.reserve(polygons.size());
|
polygon_ids.reserve(polygons.size());
|
||||||
for (size_t i = 0; i < polygons.size(); ++i) {
|
for (size_t i = 0; i < polygons.size(); ++i)
|
||||||
|
{
|
||||||
auto & polygon = polygons[i];
|
auto & polygon = polygons[i];
|
||||||
bg::correct(polygon);
|
bg::correct(polygon);
|
||||||
areas.push_back(bg::area(polygon));
|
areas.push_back(bg::area(polygon));
|
||||||
polygon_ids.emplace_back(polygon, i);
|
polygon_ids.emplace_back(polygon, i);
|
||||||
}
|
}
|
||||||
sort(polygon_ids.begin(), polygon_ids.end(), [& areas](const auto & lhs, const auto & rhs) {
|
sort(polygon_ids.begin(), polygon_ids.end(), [& areas](const auto & lhs, const auto & rhs)
|
||||||
|
{
|
||||||
return areas[lhs.second] < areas[rhs.second];
|
return areas[lhs.second] < areas[rhs.second];
|
||||||
});
|
});
|
||||||
std::vector<size_t> correct_ids;
|
std::vector<size_t> correct_ids;
|
||||||
correct_ids.reserve(polygon_ids.size());
|
correct_ids.reserve(polygon_ids.size());
|
||||||
for (size_t i = 0; i < polygon_ids.size(); ++i) {
|
for (size_t i = 0; i < polygon_ids.size(); ++i)
|
||||||
|
{
|
||||||
auto & polygon = polygon_ids[i];
|
auto & polygon = polygon_ids[i];
|
||||||
correct_ids.emplace_back(ids[polygon.second]);
|
correct_ids.emplace_back(ids[polygon.second]);
|
||||||
polygons[i] = polygon.first;
|
polygons[i] = polygon.first;
|
||||||
|
@ -39,7 +39,8 @@ const FinalCell * DividedCell::find(Float64 x, Float64 y) const
|
|||||||
}
|
}
|
||||||
|
|
||||||
GridRoot::GridRoot(const size_t min_intersections_, const size_t max_depth_, const std::vector<Polygon> & polygons_):
|
GridRoot::GridRoot(const size_t min_intersections_, const size_t max_depth_, const std::vector<Polygon> & polygons_):
|
||||||
kMinIntersections(min_intersections_), kMaxDepth(max_depth_), polygons(polygons_) {
|
kMinIntersections(min_intersections_), kMaxDepth(max_depth_), polygons(polygons_)
|
||||||
|
{
|
||||||
setBoundingBox();
|
setBoundingBox();
|
||||||
std::vector<size_t> order(polygons.size());
|
std::vector<size_t> order(polygons.size());
|
||||||
std::iota(order.begin(), order.end(), 0);
|
std::iota(order.begin(), order.end(), 0);
|
||||||
|
Loading…
Reference in New Issue
Block a user