@VRonin said in Implement QSortFilterProxyModel with own TreeModel?:

Good guess, can you show us your code?

I solved it: I had to pass the parent index (tree structure), so the line should look like this:

QVariant data = m_proxy->data(m_proxy->index(index.row(), 4, index.parent()));

@JonB, thanks, i will try your implementation.

@VRonin Thanx mate

@Kofr
mapFromSource() and mapToSource() are enough. The default implementation should depend on these methods only.

Yeah but the user also want to be able to reorder things as he wants, not just sort (ie, put this row here, drag all my selection at this position, invert these two rows, ...)

Is QCollator::compare a good option for this? I mean, I simply implement a sorting algorithm based on the result from QCollator::compare. Usually the number of files will be limited to ~3000.

I figured it out, that information is the header of the QTreeWidget. So, the code to extract this value from within a QTreeWidgetItem is:

self.treeWidget().header().sortIndicatorOrder()

and this you can check for being equal to Qt.DescendingOrder (or Qt.AscendingOrder if you prefer).