Lines Matching refs:tree
659 // This method is quite complicated: basically, it creates a real tree
665 BList* tree = _BuildTree(superItem, lastIndex);
667 _SortTree(tree, oneLevelOnly, compareFunc);
670 _PopulateTree(tree, fFullList, firstIndex, false);
677 _PopulateTree(tree, fList, lastIndex, true);
693 _DestructTree(tree);
979 BOutlineListView::_PopulateTree(BList* tree, BList& target,
983 int32 count = tree->CountItems();
986 BListItem* item = (BListItem*)tree->ItemAtFast(index);
999 BOutlineListView::_SortTree(BList* tree, bool oneLevelOnly,
1002 BListItem** items = (BListItem**)tree->Items();
1003 std::sort(items, items + tree->CountItems(),
1009 for (int32 index = tree->CountItems(); index-- > 0;) {
1010 BListItem* item = (BListItem*)tree->ItemAt(index);
1019 BOutlineListView::_DestructTree(BList* tree)
1021 for (int32 index = tree->CountItems(); index-- > 0;) {
1022 BListItem* item = (BListItem*)tree->ItemAt(index);
1028 delete tree;