Y_VERIFY->Y_ABORT_UNLESS at ^l

https://clubs.at.yandex-team.ru/arcadia/29404

1 files changed, 16 insertions, 16 deletions

diff --git a/library/cpp/histogram/adaptive/adaptive_histogram.cpp b/library/cpp/histogram/adaptive/adaptive_histogram.cpp
index 3e91ed1131..4bc4f63cda 100644
--- a/library/cpp/histogram/adaptive/adaptive_histogram.cpp
+++ b/library/cpp/histogram/adaptive/adaptive_histogram.cpp
@@ -82,7 +82,7 @@ namespace NKiwiAggr {
             histo.GetType() == HT_ADAPTIVE_WARD_HISTOGRAM ||
             histo.GetType() == HT_ADAPTIVE_HISTOGRAM)
         {
-            Y_VERIFY(histo.FreqSize() == histo.PositionSize(), "Corrupted histo");
+            Y_ABORT_UNLESS(histo.FreqSize() == histo.PositionSize(), "Corrupted histo");
             for (size_t j = 0; j < histo.FreqSize(); ++j) {
                 double value = histo.GetPosition(j);
                 double weight = histo.GetFreq(j);
@@ -182,7 +182,7 @@ namespace NKiwiAggr {
     }
 
     void TAdaptiveHistogram::FromProto(const THistogram& histo) {
-        Y_VERIFY(histo.HasType(), "Attempt to parse TAdaptiveHistogram from THistogram protobuf with no Type field set");
+        Y_ABORT_UNLESS(histo.HasType(), "Attempt to parse TAdaptiveHistogram from THistogram protobuf with no Type field set");
         ;
         switch (histo.GetType()) { // check that histogram type could be deduced
             case HT_ADAPTIVE_DISTANCE_HISTOGRAM:
@@ -352,7 +352,7 @@ namespace NKiwiAggr {
     }
 
     double TAdaptiveHistogram::CalcUpperBound(double sum) {
-        Y_VERIFY(sum >= 0, "Sum must be >= 0");
+        Y_ABORT_UNLESS(sum >= 0, "Sum must be >= 0");
         if (sum == 0.0) {
             return MinValue;
         }
@@ -393,7 +393,7 @@ namespace NKiwiAggr {
     }
 
     double TAdaptiveHistogram::CalcLowerBound(double sum) {
-        Y_VERIFY(sum >= 0, "Sum must be >= 0");
+        Y_ABORT_UNLESS(sum >= 0, "Sum must be >= 0");
         if (sum == 0.0) {
             return MaxValue;
         }
@@ -511,13 +511,13 @@ namespace NKiwiAggr {
             ++rightBin;
             TWeightedValue newBin(value, weight + currentBin->second);
             if (rightBin != Bins.end()) {
-                Y_VERIFY(BinsByQuality.erase(CalcQuality(*currentBin, *rightBin)) == 1, "Erase failed");
+                Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*currentBin, *rightBin)) == 1, "Erase failed");
                 BinsByQuality.insert(CalcQuality(newBin, *rightBin));
             }
             if (currentBin != Bins.begin()) {
                 TPairSet::iterator leftBin = currentBin;
                 --leftBin;
-                Y_VERIFY(BinsByQuality.erase(CalcQuality(*leftBin, *currentBin)) == 1, "Erase failed");
+                Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*leftBin, *currentBin)) == 1, "Erase failed");
                 BinsByQuality.insert(CalcQuality(*leftBin, newBin));
             }
             Bins.erase(currentBin);
@@ -532,7 +532,7 @@ namespace NKiwiAggr {
             if (rightBin == Bins.end()) {
                 BinsByQuality.insert(CalcQuality(*leftBin, weightedValue));
             } else {
-                Y_VERIFY(BinsByQuality.erase(CalcQuality(*leftBin, *rightBin)) == 1, "Erase failed");
+                Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*leftBin, *rightBin)) == 1, "Erase failed");
                 BinsByQuality.insert(CalcQuality(*leftBin, weightedValue));
                 BinsByQuality.insert(CalcQuality(weightedValue, *rightBin));
             }
@@ -545,20 +545,20 @@ namespace NKiwiAggr {
 
     void TAdaptiveHistogram::Erase(double value) {
         TPairSet::iterator currentBin = Bins.lower_bound(TWeightedValue(value, -1.0));
-        Y_VERIFY(currentBin != Bins.end() && currentBin->first == value, "Can't find bin that should be erased");
+        Y_ABORT_UNLESS(currentBin != Bins.end() && currentBin->first == value, "Can't find bin that should be erased");
         TPairSet::iterator rightBin = currentBin;
         ++rightBin;
         if (currentBin == Bins.begin()) {
-            Y_VERIFY(rightBin != Bins.end(), "No right bin for the first bin");
-            Y_VERIFY(BinsByQuality.erase(CalcQuality(*currentBin, *rightBin)) != 0, "Erase failed");
+            Y_ABORT_UNLESS(rightBin != Bins.end(), "No right bin for the first bin");
+            Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*currentBin, *rightBin)) != 0, "Erase failed");
         } else {
             TPairSet::iterator leftBin = currentBin;
             --leftBin;
             if (rightBin == Bins.end()) {
-                Y_VERIFY(BinsByQuality.erase(CalcQuality(*leftBin, *currentBin)) != 0, "Erase failed");
+                Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*leftBin, *currentBin)) != 0, "Erase failed");
             } else {
-                Y_VERIFY(BinsByQuality.erase(CalcQuality(*leftBin, *currentBin)) != 0, "Erase failed");
-                Y_VERIFY(BinsByQuality.erase(CalcQuality(*currentBin, *rightBin)) != 0, "Erase failed");
+                Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*leftBin, *currentBin)) != 0, "Erase failed");
+                Y_ABORT_UNLESS(BinsByQuality.erase(CalcQuality(*currentBin, *rightBin)) != 0, "Erase failed");
                 BinsByQuality.insert(CalcQuality(*leftBin, *rightBin));
             }
         }
@@ -567,12 +567,12 @@ namespace NKiwiAggr {
 
     void TAdaptiveHistogram::Shrink() {
         TPairSet::iterator worstBin = BinsByQuality.begin();
-        Y_VERIFY(worstBin != BinsByQuality.end(), "No right bin for the first bin");
+        Y_ABORT_UNLESS(worstBin != BinsByQuality.end(), "No right bin for the first bin");
         TPairSet::iterator leftBin = Bins.lower_bound(TWeightedValue(worstBin->second, -1.0));
-        Y_VERIFY(leftBin != Bins.end() && leftBin->first == worstBin->second, "Can't find worst bin");
+        Y_ABORT_UNLESS(leftBin != Bins.end() && leftBin->first == worstBin->second, "Can't find worst bin");
         TPairSet::iterator rightBin = leftBin;
         ++rightBin;
-        Y_VERIFY(rightBin != Bins.end(), "Can't find right bin");
+        Y_ABORT_UNLESS(rightBin != Bins.end(), "Can't find right bin");
 
         TWeightedValue newBin((leftBin->first * leftBin->second + rightBin->first * rightBin->second) / (leftBin->second + rightBin->second), leftBin->second + rightBin->second);
         if (Bins.size() > 2) {