Maintain the cached bitCount to avoid cost query time.

1 files changed, 11 insertions, 11 deletions

diff --git a/searchlib/src/tests/common/bitvector/bitvector_test.cpp b/searchlib/src/tests/common/bitvector/bitvector_test.cpp
index 4cbe96c74b5..d720b105671 100644
--- a/searchlib/src/tests/common/bitvector/bitvector_test.cpp
+++ b/searchlib/src/tests/common/bitvector/bitvector_test.cpp
@@ -268,21 +268,21 @@ TEST("requireThatSequentialOperationsOnPartialWorks")
     p1.invalidateCachedCount();
     EXPECT_TRUE(p1.hasTrueBits());
     EXPECT_EQUAL(1u, p1.countTrueBits());
-    p1.slowSetBit(718);
-    p1.slowSetBit(739);
-    p1.slowSetBit(871);
-    p1.slowSetBit(903);
+    p1.setBitAndMaintainCount(718);
+    p1.setBitAndMaintainCount(739);
+    p1.setBitAndMaintainCount(871);
+    p1.setBitAndMaintainCount(903);
     EXPECT_EQUAL(5u, p1.countTrueBits());
     EXPECT_TRUE(assertBV("[718,719,739,871,903]", p1));
 
     PartialBitVector p2(717,919);
     EXPECT_FALSE(p1 == p2);
-    p2.slowSetBit(719);
-    p2.slowSetBit(718);
-    p2.slowSetBit(739);
-    p2.slowSetBit(871);
+    p2.setBitAndMaintainCount(719);
+    p2.setBitAndMaintainCount(718);
+    p2.setBitAndMaintainCount(739);
+    p2.setBitAndMaintainCount(871);
     EXPECT_FALSE(p1 == p2);
-    p2.slowSetBit(903);
+    p2.setBitAndMaintainCount(903);
     EXPECT_TRUE(p1 == p2);
 
     AllocatedBitVector full(1000);
@@ -422,10 +422,10 @@ TEST("requireThatSetWorks")
     EXPECT_EQUAL(4u, v1.countTrueBits());
     EXPECT_TRUE(assertBV("[7,39,80,103]", v1));
 
-    v1.slowSetBit(39);
+    v1.setBitAndMaintainCount(39);
     EXPECT_EQUAL(4u, v1.countTrueBits());
     EXPECT_TRUE(assertBV("[7,39,80,103]", v1));
-    v1.slowSetBit(57);
+    v1.setBitAndMaintainCount(57);
     EXPECT_EQUAL(5u, v1.countTrueBits());
     EXPECT_TRUE(assertBV("[7,39,57,80,103]", v1));
 }