On Tue, Dec 16, 2014 at 3:11 PM, jungle Boogie <jungleboog...@gmail.com> wrote: > > > > Sorting by "age" is doable, but I think (at least for the initial > > implementation) it will be a new page request - in other words a server > > round-trip. > > Take a look at this: http://tablesorter.com/docs/ > > Since the data that you want to sort is already on the page, I don't > know what would need to be fetched to sort the list. > > I think tablesorter simply sorts a single linear table. That's not what is going on here. We are sorting a tree. That's a little different.
The representation in HTML is as nested <ul> lists. You could maybe translated the nested <ul> lists in to a linear table (with a hidden "depth" column or something) but even then, the sorting is not as tablesorter does it because you only want to sort siblings within the same subdirectory. And you need to do the recursively. -- D. Richard Hipp d...@sqlite.org
_______________________________________________ fossil-users mailing list fossil-users@lists.fossil-scm.org http://lists.fossil-scm.org:8080/cgi-bin/mailman/listinfo/fossil-users
