maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Make SparseBitVector::set actually work properly when sets are not in ascending or descending order. 

llvm-svn: 42604
This commit is contained in:
Daniel Berlin 2007-10-04 05:25:51 +00:00
parent 01d7f489a9
commit 2738730c0f
1 changed files with 10 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
llvm/include/llvm/ADT/SparseBitVector.h
View File

@ -334,9 +334,8 @@ class SparseBitVector {
--ElementIter;
} else {
while (ElementIter != Elements.end() &&
ElementIter->index() <= ElementIndex)
ElementIter->index() < ElementIndex)
++ElementIter;
--ElementIter;
}
CurrElementIter = ElementIter;
return ElementIter;
@ -536,10 +535,17 @@ public:
if (ElementIter == Elements.end() ||
ElementIter->index() != ElementIndex) {
Element = new SparseBitVectorElement<ElementSize>(ElementIndex);
// Insert does insert before, and lower bound gives the one before.
ElementIter = Elements.insert(++ElementIter, Element);
// We may have hit the beginning of our SparseBitVector, in which case,
// we may need to insert right after this element, which requires moving
// the current iterator forward one, because insert does insert before.
if (ElementIter->index() < ElementIndex)
ElementIter = Elements.insert(++ElementIter, Element);
else
ElementIter = Elements.insert(ElementIter, Element);
}
}
CurrElementIter = ElementIter;
ElementIter->set(Idx % ElementSize);
}