>
> Yeah, you'll need to create a TreeFormat whose Comparator knows about
> the TableFormat and the selected columns.
>
> Whenever you need to sort 'leaves only' it's necessary to differentiate
> between leaves and non-leaves. Therefore that sorting mode isn't
> really appropriate for "variable depth" trees like file browsers.
Yes, but in the case I had in mind we have a fixed depth.
Hmm, I was thinking about a TableComparatorChooser implementation that
instead of setting the built comparator on a SortedList just fires a
property change with the new comparator.
This way, we could build and get at the required comparator for sorting
the leave nodes.
But how to tell TreeList/TreeFormat about the changed comparator, e.g. how to
trigger the resort of the nodes at depth x?
BTW, shouldn't
public Comparator<? extends E> getComparator(int depth);
be
public Comparator<? super E> getComparator(int depth);
in interface TreeList.Format<E>?
Thanks,
Holger
______________________________________________________
GRATIS für alle WEB.DE-Nutzer: Die maxdome Movie-FLAT!
Jetzt freischalten unter
http://movieflat.web.de---------------------------------------------------------------------
To unsubscribe, e-mail:
dev-unsubscribe@...
For additional commands, e-mail:
dev-help@...
