move public outside

Author: meiravgri

src/VecSim/algorithms/brute_force/brute_force.h

@@ -144,10 +144,12 @@ class BruteForceIndex : public VecSimIndexAbstract<DataType, DistType> {
                    idToLabelMapping.capacity());
             resizeIndexCommon(indexCapacity() - this->blockSize);
         } else if (indexCapacity() == this->blockSize) {
-            // Make sure the last block is removed.
-            // To align with the initial capacity behaviour, where we always remove one block, we
-            // have this special condition. On newer version branches, where the initial capacity is
-            // deprecated, we immediately shrunk to 0 when the index size is 0.
+            // Special case to handle last block.
+            // This special condition resolves the ambiguity: when capacity==blockSize, we can't
+            // tell if this block came from growth (should shrink to 0) or initial capacity (should
+            // keep it). We choose to always shrink to 0 to maintain the one-block removal
+            // guarantee. In contrast, newer branches without initial capacity support use simpler
+            // logic: immediately shrink to 0 whenever index size becomes 0.
             assert(vectorBlocks.empty());
             assert(indexSize() == 0);
             resizeIndexCommon(0);

src/VecSim/algorithms/hnsw/hnsw.h

@@ -1356,12 +1356,17 @@ void HNSWIndex<DataType, DistType>::shrinkByBlock() {
         if (idToMetaData.capacity() >= (indexSize() + 2 * this->blockSize)) {
             resizeIndexCommon(idToMetaData.capacity() - this->blockSize);
         } else if (idToMetaData.capacity() == this->blockSize) {
+            // Special case to handle last block.
+            // This special condition resolves the ambiguity: when capacity==blockSize, we can't
+            // tell if this block came from growth (should shrink to 0) or initial capacity (should
+            // keep it). We choose to always shrink to 0 to maintain the one-block removal
+            // guarantee. In contrast, newer branches without initial capacity support use simpler
+            // logic: immediately shrink to 0 whenever index size becomes 0.
             assert(vectorBlocks.empty());
             assert(indexSize() == 0);
             assert(maxElements == this->blockSize);
             resizeIndexCommon(0);
         }
-
         // Take the lower bound into account.
         maxElements -= this->blockSize;
     }

src/VecSim/vec_sim_tiered_index.h

@@ -67,8 +67,8 @@ class VecSimTieredIndex : public VecSimIndexInterface {
                                 jobs.size());
     }
 
-#ifdef BUILD_TESTS
 public:
+#ifdef BUILD_TESTS
     int getMainIndexGuardWriteLockCount() const { return mainIndexGuard_write_lock_count; }
 #endif
     VecSimTieredIndex(VecSimIndexAbstract<DataType, DistType> *backendIndex_,