Y_VERIFY->Y_ABORT_UNLESS at ^l

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

4 files changed, 6 insertions, 6 deletions

diff --git a/library/cpp/containers/comptrie/write_trie_backwards.cpp b/library/cpp/containers/comptrie/write_trie_backwards.cpp
index fd8c28b0ed9..40d63e7d65e 100644
--- a/library/cpp/containers/comptrie/write_trie_backwards.cpp
+++ b/library/cpp/containers/comptrie/write_trie_backwards.cpp
@@ -101,7 +101,7 @@ namespace NCompactTrie {
                 memmove(data, pos, end - pos);
                 break;
             default:
-                Y_VERIFY(false);
+                Y_ABORT_UNLESS(false);
         }
 
         return end - pos;
diff --git a/library/cpp/containers/concurrent_hash/concurrent_hash.h b/library/cpp/containers/concurrent_hash/concurrent_hash.h
index 042bf0c0409..2c0f68cd8cb 100644
--- a/library/cpp/containers/concurrent_hash/concurrent_hash.h
+++ b/library/cpp/containers/concurrent_hash/concurrent_hash.h
@@ -39,19 +39,19 @@ public:
 
         const V& GetUnsafe(const K& key) const {
             typename TActualMap::const_iterator it = Map.find(key);
-            Y_VERIFY(it != Map.end(), "not found by key");
+            Y_ABORT_UNLESS(it != Map.end(), "not found by key");
             return it->second;
         }
 
         V& GetUnsafe(const K& key) {
             typename TActualMap::iterator it = Map.find(key);
-            Y_VERIFY(it != Map.end(), "not found by key");
+            Y_ABORT_UNLESS(it != Map.end(), "not found by key");
             return it->second;
         }
 
         V RemoveUnsafe(const K& key) {
             typename TActualMap::iterator it = Map.find(key);
-            Y_VERIFY(it != Map.end(), "removing non-existent key");
+            Y_ABORT_UNLESS(it != Map.end(), "removing non-existent key");
             V r = std::move(it->second);
             Map.erase(it);
             return r;
diff --git a/library/cpp/containers/paged_vector/paged_vector.h b/library/cpp/containers/paged_vector/paged_vector.h
index 0a6dd8f83c0..0fe1660763f 100644
--- a/library/cpp/containers/paged_vector/paged_vector.h
+++ b/library/cpp/containers/paged_vector/paged_vector.h
@@ -395,7 +395,7 @@ namespace NPagedVector {
             if (pagepart)
                 CurrentPage().resize(pagepart);
 
-            Y_VERIFY(sz == size(), "%" PRIu64 " %" PRIu64, (ui64)sz, (ui64)size());
+            Y_ABORT_UNLESS(sz == size(), "%" PRIu64 " %" PRIu64, (ui64)sz, (ui64)size());
         }
 
         reference at(size_t idx) {
diff --git a/library/cpp/containers/stack_vector/stack_vec.h b/library/cpp/containers/stack_vector/stack_vec.h
index 91ae8a47786..25a8658fd3c 100644
--- a/library/cpp/containers/stack_vector/stack_vec.h
+++ b/library/cpp/containers/stack_vector/stack_vec.h
@@ -74,7 +74,7 @@ namespace NPrivate {
         void deallocate(T* p, size_type n) {
             if (p >= reinterpret_cast<T*>(&StackBasedStorage[0]) &&
                     p < reinterpret_cast<T*>(&StackBasedStorage[CountOnStack])) {
-                Y_VERIFY(IsStorageUsed);
+                Y_ABORT_UNLESS(IsStorageUsed);
                 IsStorageUsed = false;
             } else {
                 FallbackAllocator().deallocate(p, n);