summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorHenning Baldersheim <balder@yahoo-inc.com>2020-05-07 21:35:53 +0000
committerHenning Baldersheim <balder@yahoo-inc.com>2020-05-07 21:35:53 +0000
commit4b071b048ee01b58ef920899a64e928bbb0d88cf (patch)
treedc7e3d1fa8b38fc2361835c69ca4f089686264fe
parentb42b06208f31a120009adade2238d34ce228ed18 (diff)
Rename after change of sematics.
-rw-r--r--searchlib/src/vespa/searchlib/common/bitvector.cpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/searchlib/src/vespa/searchlib/common/bitvector.cpp b/searchlib/src/vespa/searchlib/common/bitvector.cpp
index 617e7537c7c..07d0815a910 100644
--- a/searchlib/src/vespa/searchlib/common/bitvector.cpp
+++ b/searchlib/src/vespa/searchlib/common/bitvector.cpp
@@ -20,9 +20,9 @@ using vespalib::alloc::Alloc;
namespace {
-void verifyContains(const search::BitVector & a, const search::BitVector & b) __attribute__((noinline));
+void verifyInclusiveStart(const search::BitVector & a, const search::BitVector & b) __attribute__((noinline));
-void verifyContains(const search::BitVector & a, const search::BitVector & b)
+void verifyInclusiveStart(const search::BitVector & a, const search::BitVector & b)
{
if (a.getStartIndex() < b.getStartIndex()) {
throw IllegalArgumentException(make_string("[%d, %d] is not contained in [%d, %d]",
@@ -177,7 +177,7 @@ BitVector::countInterval(Index start, Index end) const
void
BitVector::orWith(const BitVector & right)
{
- verifyContains(*this, right);
+ verifyInclusiveStart(*this, right);
if (right.size() < size()) {
ssize_t commonBytes = numActiveBytes(getStartIndex(), right.size()) - sizeof(Word);
@@ -208,7 +208,7 @@ BitVector::repairEnds()
void
BitVector::andWith(const BitVector & right)
{
- verifyContains(*this, right);
+ verifyInclusiveStart(*this, right);
uint32_t commonBytes = std::min(getActiveBytes(), numActiveBytes(getStartIndex(), right.size()));
IAccelrated::getAccelrator().andBit(getActiveStart(), right.getWordIndex(getStartIndex()), commonBytes);
@@ -224,7 +224,7 @@ BitVector::andWith(const BitVector & right)
void
BitVector::andNotWith(const BitVector& right)
{
- verifyContains(*this, right);
+ verifyInclusiveStart(*this, right);
if (right.size() < size()) {
ssize_t commonBytes = numActiveBytes(getStartIndex(), right.size()) - sizeof(Word);