Lines Matching defs:CountItems

142 			for (int32 i = 0; i < areas.CountItems(); i++) {
189 return fWindowLayerOrder.ItemAt(fWindowLayerOrder.CountItems() - 1);
204 for (int32 i = 1; i < fWindowList.CountItems(); i++) {
255 if (fWindowList.CountItems() <= 1)
352 for (int32 i = 0; i < fWindowList.CountItems(); i++) {
564 for (int i = 0; i < list.CountItems(); i++) {
725 for (int32 i = 0; i < fCrossingList.CountItems(); i++) {
730 for (int32 i = 0; i < fCrossingList.CountItems(); i++) {
743 for (int32 i = 0; i < fCrossingList.CountItems(); i++) {
749 for (int32 i = 0; i < fCrossingList.CountItems(); i++) {
803 if (fSATWindowList.CountItems() > 0)
805 //while (fSATWindowList.CountItems() > 0)
922 if (CountItems() >= 2)
930 SATGroup::CountItems()
932 return fSATWindowList.CountItems();
1081 archive.AddInt32("htab_count", fHorizontalTabs.CountItems());
1082 archive.AddInt32("vtab_count", fVerticalTabs.CountItems());
1084 for (int i = 0; i < fWindowAreaList.CountItems(); i++) {
1098 for (int a = 0; a < windowList.CountItems(); a++)
1178 for (int i = 0; i < list.CountItems(); i++)
1190 if (removedArea == NULL || removedArea->WindowList().CountItems() > 1)
1201 (int)newGroup.CountItems());
1202 if (newGroup.CountItems() == 1
1203 && newGroup.ItemAt(0)->WindowList().CountItems() == 1) {
1238 for (int i = 0; i < crossingList->CountItems(); i++) {
1264 for (int i = 0; i < crossingList->CountItems(); i++) {
1290 for (int i = 0; i < crossingList->CountItems(); i++) {
1317 for (int i = 0; i < crossingList->CountItems(); i++) {
1339 if (seedList.CountItems() == 0)
1356 for (int i = 0; i < neighbours.CountItems(); i++) {
1369 for (int i = 0; i < neighbours.CountItems(); i++)
1384 for (int i = 0; i < newGroup.CountItems(); i++)
1399 if (group == NULL || group->CountItems() < 1)
1422 for (int i = 0; i < group->CountItems(); i++) {