blob: d111a3922700743d90652ec4b46e56a37398362f (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/log/log.h>
LOG_SETUP("bitvector_benchmark");
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/searchlib/common/bitvector.h>
using namespace search;
namespace {
size_t scan(BitVector & bv) __attribute__((noinline));
size_t scan(BitVector & bv)
{
size_t count(0);
for (BitVector::Index i(bv.getFirstTrueBit()), m(bv.size()); i < m; i = bv.getNextTrueBit(i+1)) {
count++;
}
return count;
}
}
// This test is 10% faster with table lookup than with runtime shifting.
TEST("speed of getNextTrueBit")
{
BitVector::UP bv(BitVector::create(100000000));
bv->setInterval(0, bv->size() - 1);
for (size_t i(0); i < 10; i++) {
EXPECT_EQUAL(bv->size(), scan(*bv));
}
EXPECT_EQUAL(bv->size(), bv->countTrueBits());
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
