Lines Matching defs:Items
12 /// Items in A is subsets of integers,
13 /// Items in B some pointers (Successors).
76 CaseItems Items;
98 clustersVector.reserve(Items.size());
99 clustersVector.insert(clustersVector.begin(), Items.begin(), Items.end());
101 Items.clear();
102 Items.insert(Items.begin(), clustersVector.begin(), clustersVector.end());
252 // Don't public CaseItems itself. Don't allow edit the Items directly.
272 if (Items.empty())
275 for (CaseItemIt j = Items.begin(), i = j++, e = Items.end();
286 if (Items.empty() || RHS.empty())
289 for (CaseItemIt L = Items.begin(), R = RHS.Items.begin(),
290 el = Items.end(), er = RHS.Items.end(); L != el && R != er;) {
313 if (Items.size() < 2)
316 CaseItems OldItems = Items;
317 Items.clear();
340 // We recollected the Items, but we kept it sorted.
360 Items.push_back(std::make_pair(R, S));
381 Items.insert(Items.end(), RHS.Items.begin(), RHS.Items.end());
385 for (CaseItemIt i = RHS.Items.begin(), e = RHS.Items.end(); i != e; ++i)
395 void removeItem(RangeIterator i) { Items.erase(i); }
399 for (CaseItemIt i = Items.begin(); i != Items.end();)
402 Items.erase(i++);
409 for (CaseItemIt i = Items.begin(); i != Items.end();)
411 Items.erase(i++);
418 for (CaseItemIt i = Items.begin(); i != Items.end(); ++i) {
434 CaseItemConstIt L = Items.begin(), R = RHS.Items.begin();
435 while (L != Items.end() && R != RHS.Items.end()) {
472 while(L != Items.end() && L->first.getHigh() < RRange.getHigh()) {
481 while(R != RHS.Items.end() && R->first.getHigh() < LRange.getHigh()) {
494 if (L != Items.end()) {
500 while (L != Items.end()) {
504 } else if (R != RHS.Items.end()) {
510 while (R != RHS.Items.end()) {
552 for (CaseItemIt i = Items.begin(); i != Items.end(); ++i)
565 bool empty() const { return Items.empty(); }
568 Items.clear();
576 return Items.size();
579 RangeIterator begin() { return Items.begin(); }
580 RangeIterator end() { return Items.end(); }