kits/interface/ColumnListView.cpp

39 /   Description:    Experimental multi-column list view.
320 			bool				SortList(BRowContainer* list, bool isVisible);
325 			void				AddSorted(BRowContainer* list, BRow* row);
326 			void				RecursiveDeleteRows(BRowContainer* list,
2037 					// add this column to the sort list
2537 		// Re-add the column at the end of the list.
3247 		// Make sure selection list doesn't point to deleted rows!
3309 OutlineView::RecursiveDeleteRows(BRowContainer* list, bool isOwner)
3311 	if (list == NULL)
3315 		BRow* row = list->RemoveItemAt(0L);
3326 		delete list;
3696 // the list in the background, the widget rect will be incorrect, possibly
3707 	// of the list.
4146 			// so we will select the first visible item in the list.
4431 		BRowContainer* list = (parentRow == NULL) ? &fRows : parentRow->fChildList;
4433 		if(list) {
4434 			int32 rowIndex = list->IndexOf(row);
4436 			ASSERT(list->ItemAt(rowIndex) == row);
4439 			if (rowIndex > 0 && CompareRows(list->ItemAt(rowIndex - 1), row) > 0)
4442 			if (rowIndex < list->CountItems() - 1 && CompareRows(list->ItemAt(rowIndex + 1),
4449 				SortList(list, parentIsVisible && (parentRow == NULL || parentRow->fIsExpanded));
4586 			// If the user is scrolled down too far when making the range smaller, the list
4601 OutlineView::AddSorted(BRowContainer* list, BRow* row)
4603 	if (list && row) {
4606 		int32 upper = list->CountItems()-1;
4609 			int32 cmp = CompareRows(row, list->ItemAt(middle));
4619 		else if( upper < list->CountItems() ) {
4620 			if( CompareRows(row, list->ItemAt(upper)) > 0 ) upper++;
4623 		if (upper >= list->CountItems())
4624 			list->AddItem(row);				// Adding to end.
4626 			list->AddItem(row, upper);		// Insert
4807 OutlineView::SortList(BRowContainer* list, bool isVisible)
4809 	if (list) {
4812 			= (BRow**) BObjectList<BRow>::Private(list).AsBList()->Items();
4813 		int32 numItems = list->CountItems();
4863 		BRowContainer* list;
4868 	stack[stackTop].list = &fRows;
4884 		bool haveLock = SortList(currentEntry->list, currentEntry->isVisible);
4893 		// next list.
4896 			for (int32 index = currentEntry->listIndex; index < currentEntry->list->CountItems();
4898 				BRow* parentRow = currentEntry->list->ItemAt(index);
4905 					stack[stackTop].list = childList;
5087 RecursiveOutlineIterator::RecursiveOutlineIterator(BRowContainer* list,
5095 	if (list == 0 || list->CountItems() == 0)
5098 		fCurrentList = list;
5127 			// Put current list on the stack if it needs to be revisited.
5139 			fCurrentListIndex++; // next item in current list