Lines Matching refs:fChildList

552 	fChildList(NULL),
566 fChildList(NULL),
592 return fChildList != 0;
1300 return parentRow->fChildList ? parentRow->fChildList->ItemAt(Index) : NULL;
1310 return parentRow->fChildList ? parentRow->fChildList->ItemAt(Index) : 0;
1358 if (parentRow->fChildList)
1359 return parentRow->fChildList->CountItems();
1375 row->fChildList = 0;
1410 container1 = parentRow1->fChildList;
1418 container2 = parentRow2->fChildList;
3321 if (row->fChildList)
3322 RecursiveDeleteRows(row->fChildList, true);
4304 for (RecursiveOutlineIterator iterator(parentRow->fChildList);
4312 for (RecursiveOutlineIterator iterator(parentRow->fChildList);
4355 for (RecursiveOutlineIterator iterator(row->fChildList);
4381 parentRow->fChildList->RemoveItem(row);
4382 if (parentRow->fChildList->CountItems() == 0) {
4383 delete parentRow->fChildList;
4384 parentRow->fChildList = 0;
4433 BRowContainer* list = (parentRow == NULL) ? &fRows : parentRow->fChildList;
4473 if (parentRow->fChildList == NULL)
4474 parentRow->fChildList = new BRowContainer;
4476 AddSorted(parentRow->fChildList, row);
4482 if (parentRow->fChildList == 0)
4483 parentRow->fChildList = new BRowContainer;
4485 if (Index < 0 || Index > parentRow->fChildList->CountItems())
4486 parentRow->fChildList->AddItem(row);
4488 parentRow->fChildList->AddItem(row, Index);
4573 if (parentRow && parentRow->fChildList->CountItems() == 1
4901 BRowContainer* childList = parentRow->fChildList;
5041 ASSERT(row->fParent->fChildList);
5042 return row->fParent->fChildList->IndexOf(row);
5126 if (currentRow->fChildList && (currentRow->fIsExpanded || !fOpenBranchesOnly)
5127 && currentRow->fChildList->CountItems() > 0) {
5137 fCurrentList = currentRow->fChildList;