Lines Matching defs:fPackages
131 int32 lastIndex = static_cast<int32>(fPackages.size()) - 1;
152 float height = fPackages.size() * HEIGHT_PACKAGE;
174 BString packageName = fPackages[index]->Name();
202 fPackages[index] = package;
210 for (std::vector<PackageInfoRef>::iterator it = fPackages.begin();
211 it != fPackages.end(); it++) {
214 fPackages.clear();
222 return fPackages.size() == 0;
275 if (fPackages.empty())
288 // fPackages is sorted and for this reason it is possible to find the
289 // insertion point by identifying the first item in fPackages that does
293 = std::lower_bound(fPackages.begin(), fPackages.end(), package,
296 if (itInsertionPt == fPackages.end()
300 fPackages.begin(), itInsertionPt);
303 fPackages.insert(itInsertionPt, package);
319 fPackages[index]->RemoveListener(fPackageListener);
320 fPackages.erase(fPackages.begin() + index);
353 = std::lower_bound(fPackages.begin(), fPackages.end(), package,
356 return (it == fPackages.end() || (*it)->Name() != package->Name())
357 ? -1 : it - fPackages.begin();
364 // the fPackages is not sorted on name and for this reason it is not
366 for (uint32 i = 0; i < fPackages.size(); i++) {
367 if (fPackages[i]->Name() == name)
394 _DrawPackage(updateRect, fPackages[index], index, _YOfIndex(index),
639 if (fPackages.empty())
642 if (i < 0 || i >= static_cast<int32>(fPackages.size()))
656 if (fPackages.empty())
661 return std::min(i, (int32) (fPackages.size() - 1));
667 return BSize(B_SIZE_UNLIMITED, HEIGHT_PACKAGE * fPackages.size());
674 fPackages;