aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/histogram/adaptive/block_histogram.cpp
diff options
context:
space:
mode:
authorAnton Samokhvalov <pg83@yandex.ru>2022-02-10 16:45:17 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:45:17 +0300
commitd3a398281c6fd1d3672036cb2d63f842d2cb28c5 (patch)
treedd4bd3ca0f36b817e96812825ffaf10d645803f2 /library/cpp/histogram/adaptive/block_histogram.cpp
parent72cb13b4aff9bc9cf22e49251bc8fd143f82538f (diff)
downloadydb-d3a398281c6fd1d3672036cb2d63f842d2cb28c5.tar.gz
Restoring authorship annotation for Anton Samokhvalov <pg83@yandex.ru>. Commit 2 of 2.
Diffstat (limited to 'library/cpp/histogram/adaptive/block_histogram.cpp')
-rw-r--r--library/cpp/histogram/adaptive/block_histogram.cpp28
1 files changed, 14 insertions, 14 deletions
diff --git a/library/cpp/histogram/adaptive/block_histogram.cpp b/library/cpp/histogram/adaptive/block_histogram.cpp
index 0920bf435b..6586d13ff6 100644
--- a/library/cpp/histogram/adaptive/block_histogram.cpp
+++ b/library/cpp/histogram/adaptive/block_histogram.cpp
@@ -52,7 +52,7 @@ namespace {
private:
void SwapPositions(ui32 x, ui32 y) {
- std::swap(A[x], A[y]);
+ std::swap(A[x], A[y]);
Pos[A[x]] = x;
Pos[A[y]] = y;
}
@@ -147,8 +147,8 @@ namespace NKiwiAggr {
if (histo.GetType() == HT_ADAPTIVE_DISTANCE_HISTOGRAM ||
histo.GetType() == HT_ADAPTIVE_WEIGHT_HISTOGRAM ||
histo.GetType() == HT_ADAPTIVE_WARD_HISTOGRAM ||
- histo.GetType() == HT_ADAPTIVE_HISTOGRAM)
- {
+ histo.GetType() == HT_ADAPTIVE_HISTOGRAM)
+ {
Y_VERIFY(histo.FreqSize() == histo.PositionSize(), "Corrupted histo");
for (size_t j = 0; j < histo.FreqSize(); ++j) {
double value = histo.GetPosition(j);
@@ -188,7 +188,7 @@ namespace NKiwiAggr {
}
}
- void TBlockHistogram::Merge(TVector<IHistogramPtr> histogramsToMerge) {
+ void TBlockHistogram::Merge(TVector<IHistogramPtr> histogramsToMerge) {
Y_UNUSED(histogramsToMerge);
ythrow yexception() << "IHistogram::Merge(TVector<IHistogramPtr>) is not defined for TBlockHistogram";
}
@@ -204,15 +204,15 @@ namespace NKiwiAggr {
}
void TBlockHistogram::FromProto(const THistogram& histo) {
- Y_VERIFY(histo.HasType(), "Attempt to parse TBlockHistogram from THistogram protobuf with no Type field set");
- ;
+ Y_VERIFY(histo.HasType(), "Attempt to parse TBlockHistogram from THistogram protobuf with no Type field set");
+ ;
switch (histo.GetType()) { // check that histogram type is correct
case HT_ADAPTIVE_DISTANCE_HISTOGRAM:
case HT_ADAPTIVE_WEIGHT_HISTOGRAM:
case HT_ADAPTIVE_WARD_HISTOGRAM:
case HT_ADAPTIVE_HISTOGRAM:
break; // ok
- default: // not ok
+ default: // not ok
ythrow yexception() << "Attempt to parse TBlockHistogram from THistogram protobuf record of type = " << (ui32)histo.GetType();
}
@@ -312,7 +312,7 @@ namespace NKiwiAggr {
Sort(Bins.begin() + PrevSize, Bins.end());
if (PrevSize != 0) {
TVector<TWeightedValue> temp(Bins.begin(), Bins.begin() + PrevSize);
- std::merge(temp.begin(), temp.end(), Bins.begin() + PrevSize, Bins.end(), Bins.begin());
+ std::merge(temp.begin(), temp.end(), Bins.begin() + PrevSize, Bins.end(), Bins.begin());
}
}
@@ -496,13 +496,13 @@ namespace NKiwiAggr {
TBlockWardHistogram::TBlockWardHistogram(size_t intervals, ui64 id, size_t shrinkSize)
: TBlockHistogram(HT_ADAPTIVE_WARD_HISTOGRAM, CalcWardQuality, intervals, id, shrinkSize)
- {
- }
+ {
+ }
bool TBlockWardHistogram::CalcSplitInfo(
const TCumulatives::const_iterator beg,
const TCumulatives::const_iterator end, // (!) points to the final element
- TSplitInfo& splitInfo // out
+ TSplitInfo& splitInfo // out
) {
if (end - beg < 2) {
return false;
@@ -543,7 +543,7 @@ namespace NKiwiAggr {
TCumulative cumulative = {0., 0.};
cumulatives.push_back(cumulative);
for (size_t i = 0; i < Bins.size(); i++) {
- cumulative.first += Bins[i].second;
+ cumulative.first += Bins[i].second;
cumulative.second += Bins[i].second * Bins[i].first;
cumulatives.push_back(cumulative);
}
@@ -584,10 +584,10 @@ namespace NKiwiAggr {
auto splitBeg = *it;
auto splitEnd = *(it + 1);
double cnt = (splitEnd->first - splitBeg->first);
- double mu = (splitEnd->second - splitBeg->second) / cnt;
+ double mu = (splitEnd->second - splitBeg->second) / cnt;
Bins.push_back(TWeightedValue(mu, cnt));
}
}
-}
+}