fAreas
BObjectList<Area> fAreas;
BObjectList<Area> fAreas;
fAreas;
fAreas(areas),
delete_area(fAreas[i]);
fAreas[(*fAreaCount)++] = area;
area_id* fAreas;
fAreas.erase(serverArea);
std::map<area_id, area_mapping>::iterator it = fAreas.find(serverArea);
if (it != fAreas.end()) {
fAreas.erase(serverArea);
while (!fAreas.empty()) {
std::map<area_id, area_mapping>::iterator it = fAreas.begin();
fAreas.erase(it);
std::map<area_id, area_mapping>::iterator it = fAreas.find(serverArea);
if (it != fAreas.end()) {
mapping = &fAreas[serverArea];
for (AreaList::ConstIterator it = fAreas.GetIterator(); it.HasNext();) {
for (AreaList::Iterator it = fAreas.GetIterator(); it.HasNext();) {
fAreas.Add(area);
while (Area *area = fAreas.Head()) {
fAreas.Remove(area);
AreaList fAreas;
for (int32 i = 0; i < row->fAreas.CountItems(); i++) {
BSize prefSize = row->fAreas.ItemAt(i)->Item()->PreferredSize();
double negPen = row->fAreas.ItemAt(i)->ShrinkPenalties().height;
for (int32 i = 0; i < column->fAreas.CountItems(); i++) {
BSize prefSize = column->fAreas.ItemAt(i)->Item()->PreferredSize();
double negPen = column->fAreas.ItemAt(i)->ShrinkPenalties().height;
row->fAreas.AddItem(area);
column->fAreas.AddItem(area);
row->fAreas.RemoveItem(area);
if (row->fAreas.CountItems() == 0) {
column->fAreas.RemoveItem(area);
if (column->fAreas.CountItems() == 0) {
area = fAreas.Next(area);
area = fAreas.Next(area);
area = fAreas.Next(area);
VMUserArea* area = fAreas.FindClosest(address, true);
VMUserArea* area = fAreas.FindClosest(address, less);
area = less ? fAreas.Previous(area) : fAreas.Next(area);
fAreas.Remove(area);
VMUserArea* next = fAreas.Next(static_cast<VMUserArea*>(area));
next = fAreas.Next(next);
VMUserArea* next = fAreas.Next(area);
VMUserArea* nextNext = fAreas.Next(next);
VMUserArea* area = fAreas.FindClosest(address, false);
for (VMUserAreaTree::Iterator it = fAreas.GetIterator(area);
for (VMUserAreaTree::Iterator it = fAreas.GetIterator();
for (VMUserAreaTree::ConstIterator it = fAreas.GetIterator();
VMUserArea* reserved = fAreas.FindClosest(start, true);
fAreas.Remove(reserved);
fAreas.Insert(newReserved);
fAreas.Insert(area);
VMUserArea* next = fAreas.FindClosest(start + size, false);
? fAreas.Previous(next) : fAreas.FindClosest(start + size, true);
VMUserAreaTree::Iterator it = fAreas.GetIterator(
next != NULL ? next : fAreas.LeftMost());
it = fAreas.GetIterator();
fAreas.Remove(next);
fAreas.Insert(area);
VMUserArea* area = fAreas.LeftMost();
VMUserAreaTree fAreas;