Lines Matching refs:Elements
30 /// storing the elements that have non-zero bits set. In order to make this
289 ElementList Elements;
295 if (Elements.empty()) {
296 CurrElementIter = Elements.begin();
297 return Elements.begin();
301 if (CurrElementIter == Elements.end())
310 while (ElementIter != Elements.begin()
314 while (ElementIter != Elements.end() &&
346 if (BitVector->Elements.empty()) {
350 Iter = BitVector->Elements.begin();
377 // We may run out of elements in the bitmap.
378 if (Iter == BitVector->Elements.end()) {
436 Iter = BitVector->Elements.begin();
448 CurrElementIter = Elements.begin ();
456 ElementListConstIter ElementIter = RHS.Elements.begin();
457 while (ElementIter != RHS.Elements.end()) {
458 Elements.push_back(SparseBitVectorElement<ElementSize>(*ElementIter));
462 CurrElementIter = Elements.begin ();
467 Elements.clear();
472 Elements.clear();
474 ElementListConstIter ElementIter = RHS.Elements.begin();
475 while (ElementIter != RHS.Elements.end()) {
476 Elements.push_back(SparseBitVectorElement<ElementSize>(*ElementIter));
480 CurrElementIter = Elements.begin ();
487 if (Elements.empty())
495 if (ElementIter == Elements.end() ||
502 if (Elements.empty())
510 if (ElementIter == Elements.end() ||
518 Elements.erase(ElementIter);
526 if (Elements.empty()) {
528 ElementIter = Elements.insert(Elements.end(), Element);
533 if (ElementIter == Elements.end() ||
539 if (ElementIter != Elements.end() &&
541 ElementIter = Elements.insert(++ElementIter, Element);
543 ElementIter = Elements.insert(ElementIter, Element);
565 ElementListConstIter Iter1 = Elements.begin();
566 ElementListConstIter Iter2 = RHS.Elements.begin();
568 for (; Iter1 != Elements.end() && Iter2 != RHS.Elements.end();
573 return Iter1 == Elements.end() && Iter2 == RHS.Elements.end();
579 ElementListIter Iter1 = Elements.begin();
580 ElementListConstIter Iter2 = RHS.Elements.begin();
583 if (RHS.Elements.empty())
586 while (Iter2 != RHS.Elements.end()) {
587 if (Iter1 == Elements.end() || Iter1->index() > Iter2->index()) {
588 Elements.insert(Iter1,
600 CurrElementIter = Elements.begin();
607 ElementListIter Iter1 = Elements.begin();
608 ElementListConstIter Iter2 = RHS.Elements.begin();
611 if (Elements.empty() && RHS.Elements.empty())
614 // Loop through, intersecting as we go, erasing elements when necessary.
615 while (Iter2 != RHS.Elements.end()) {
616 if (Iter1 == Elements.end()) {
617 CurrElementIter = Elements.begin();
629 Elements.erase(IterTmp);
637 Elements.erase(IterTmp);
640 Elements.erase(Iter1, Elements.end());
641 CurrElementIter = Elements.begin();
649 ElementListIter Iter1 = Elements.begin();
650 ElementListConstIter Iter2 = RHS.Elements.begin();
653 if (Elements.empty() || RHS.Elements.empty())
656 // Loop through, intersecting as we go, erasing elements when necessary.
657 while (Iter2 != RHS.Elements.end()) {
658 if (Iter1 == Elements.end()) {
659 CurrElementIter = Elements.begin();
671 Elements.erase(IterTmp);
680 CurrElementIter = Elements.begin();
694 Elements.clear();
695 CurrElementIter = Elements.begin();
696 ElementListConstIter Iter1 = RHS1.Elements.begin();
697 ElementListConstIter Iter2 = RHS2.Elements.begin();
701 if (RHS1.Elements.empty())
704 // Loop through, intersecting as we go, erasing elements when necessary.
705 while (Iter2 != RHS2.Elements.end()) {
706 if (Iter1 == RHS1.Elements.end())
717 Elements.push_back(NewElement);
726 Elements.push_back(NewElement);
731 // copy the remaining elements
732 while (Iter1 != RHS1.Elements.end()) {
735 Elements.push_back(NewElement);
753 ElementListConstIter Iter1 = Elements.begin();
754 ElementListConstIter Iter2 = RHS.Elements.begin();
757 if (Elements.empty() && RHS.Elements.empty())
761 while (Iter2 != RHS.Elements.end()) {
762 if (Iter1 == Elements.end())
789 if (Elements.empty())
791 const SparseBitVectorElement<ElementSize> &First = *(Elements.begin());
797 return Elements.empty();
802 for (ElementListConstIter Iter = Elements.begin();
803 Iter != Elements.end();
820 for (ElementListConstIter Iter = Elements.begin();
821 Iter != Elements.end();
