Maintain the cached bitCount to avoid cost query time.

1 files changed, 2 insertions, 2 deletions

diff --git a/searchlib/src/tests/bitvector/bitvectorbenchmark.cpp b/searchlib/src/tests/bitvector/bitvectorbenchmark.cpp
index ed681d9021b..a9df188d417 100644
--- a/searchlib/src/tests/bitvector/bitvectorbenchmark.cpp
+++ b/searchlib/src/tests/bitvector/bitvectorbenchmark.cpp
@@ -51,10 +51,10 @@ void BitVectorBenchmark::init(size_t n)
     BitVector *b(BitVector::create(n).release());
     srand(1);
     for(size_t i(0), j(0); i < n; i += rand()%10, j++) {
-        a->flip(i);
+        a->flipBit(i);
     }
     for(size_t i(0), j(0); i < n; i += rand()%10, j++) {
-        b->flip(i);
+        b->flipBit(i);
     }
     a->invalidateCachedCount();
     b->invalidateCachedCount();