drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-21 13:53:37 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format all C++ and Java code via clang-format

Browse Source 
Signed-off-by: Konstantin Pastbin <konstantin.pastbin@gmail.com>
This commit is contained in:
Konstantin Pastbin
2025-08-17 14:32:37 +07:00
parent 9f0290c0ec
commit bfffa1fff4
2169 changed files with 56441 additions and 64188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
libs/indexer/scale_index_builder.hpp
View File

@@ -26,7 +26,6 @@
#include <utility>
#include <vector>
namespace covering
{
template <class TDisplacementManager>
@@ -56,8 +55,8 @@ public:
void operator()(Feature & ft, uint32_t index) const
{
m_scalesIdx = 0;
uint32_t const minScaleClassif = std::min(
scales::GetUpperScale(), feature::GetMinDrawableScaleClassifOnly(feature::TypesHolder(ft)));
uint32_t const minScaleClassif =
std::min(scales::GetUpperScale(), feature::GetMinDrawableScaleClassifOnly(feature::TypesHolder(ft)));
// The classificator won't allow this feature to be drawable for smaller
// scales so the first buckets can be safely skipped.
// todo(@pimenov) Parallelizing this loop may be helpful.
@@ -71,9 +70,7 @@ public:
// Check feature's geometry and visibility.
if (!FeatureShouldBeIndexed(ft, static_cast<int>(bucket), bucket == minScaleClassif /* needReset */))
{
continue;
}
std::vector<int64_t> const cells = covering::CoverFeature(ft, m_codingDepth, 250);
m_displacement.Add(cells, bucket, ft, index);
@@ -124,8 +121,8 @@ private:
};
template <class FeaturesVector, class Writer>
void IndexScales(feature::DataHeader const & header, FeaturesVector const & features,
Writer & writer, std::string const &)
void IndexScales(feature::DataHeader const & header, FeaturesVector const & features, Writer & writer,
std::string const &)
{
// TODO: Make scale bucketing dynamic.
@@ -134,9 +131,7 @@ void IndexScales(feature::DataHeader const & header, FeaturesVector const & feat
std::vector<CellFeatureBucketTuple> cellsToFeaturesAllBuckets;
{
auto const PushCFT = [&cellsToFeaturesAllBuckets](CellFeatureBucketTuple const & v)
{
cellsToFeaturesAllBuckets.push_back(v);
};
{ cellsToFeaturesAllBuckets.push_back(v); };
using TDisplacementManager = DisplacementManager<decltype(PushCFT)>;
// Single-point features are heuristically rearranged and filtered to simplify
@@ -146,8 +141,7 @@ void IndexScales(feature::DataHeader const & header, FeaturesVector const & feat
TDisplacementManager manager(PushCFT);
std::vector<uint32_t> featuresInBucket(bucketsCount);
std::vector<uint32_t> cellsInBucket(bucketsCount);
features.ForEach(
FeatureCoverer<TDisplacementManager>(header, manager, featuresInBucket, cellsInBucket));
features.ForEach(FeatureCoverer<TDisplacementManager>(header, manager, featuresInBucket, cellsInBucket));
manager.Displace();
std::sort(cellsToFeaturesAllBuckets.begin(), cellsToFeaturesAllBuckets.end());
@@ -177,8 +171,7 @@ void IndexScales(feature::DataHeader const & header, FeaturesVector const & feat
SubWriter<Writer> subWriter(writer);
LOG(LINFO, ("Building interval index for bucket:", bucket));
BuildIntervalIndex(cellsToFeatures.begin(), cellsToFeatures.end(), subWriter,
RectId::DEPTH_LEVELS * 2 + 1);
BuildIntervalIndex(cellsToFeatures.begin(), cellsToFeatures.end(), subWriter, RectId::DEPTH_LEVELS * 2 + 1);
recordWriter.FinishRecord();
}