fix ci

Author: HuaHuaY

cpp/src/parquet/bloom_filter_reader_writer_test.cc

@@ -206,23 +206,33 @@ TEST_P(BloomFilterBuilderFoldingTest, RespectsOption) {
       ::arrow::SliceBuffer(buffer, location.offset, location.length));
   auto filter = parquet::BlockSplitBloomFilter::Deserialize(reader_properties, &reader);
 
+  const auto actual_bitset_size = filter.GetBitsetSize();
   EXPECT_EQ(BlockSplitBloomFilter::OptimalNumOfBytes(test_case.expected_bitset_ndv, kFpp),
-            filter.GetBitsetSize());
+            actual_bitset_size);
+
+  if (test_case.fold) {
+    EXPECT_LE(actual_bitset_size, initial_bitset_size);
+  } else {
+    EXPECT_EQ(actual_bitset_size, initial_bitset_size);
+  }
+
   for (uint64_t hash : hashes) {
     EXPECT_TRUE(filter.FindHash(hash));
   }
 
-  int32_t false_positives = 0;
-  constexpr int32_t kNonInsertedCount = 10'000;
-  for (int32_t i = test_case.inserted_count;
-       i < test_case.inserted_count + kNonInsertedCount; ++i) {
-    false_positives += filter.FindHash(filter.Hash(i));
+  if (test_case.fold && test_case.inserted_count > 0) {
+    int32_t false_positives = 0;
+    constexpr int32_t kNonInsertedCount = 10'000;
+    for (int32_t i = test_case.inserted_count;
+         i < test_case.inserted_count + kNonInsertedCount; ++i) {
+      false_positives += filter.FindHash(filter.Hash(i));
+    }
+    const auto sample_fpp = static_cast<double>(false_positives) / kNonInsertedCount;
+    EXPECT_LT(sample_fpp, kFpp);
+    // If the actual fpp, as computed on this sample, is significantly below kFpp / 2,
+    // then we could have folded the bloom filter at least once more.
+    EXPECT_GT(sample_fpp, kFpp / 2.1);
   }
-  const auto sample_fpp = static_cast<double>(false_positives) / kNonInsertedCount;
-  EXPECT_LT(sample_fpp, kFpp);
-  // If the actual fpp, as computed on this sample, is significantly below kFpp / 2,
-  // then we could have folded the bloom filter at least once more.
-  EXPECT_GT(sample_fpp, kFpp / 2.1);
 }
 
 INSTANTIATE_TEST_SUITE_P(