The current tree table sorting algorithm is incomplete. The A->Z sorting works as expected, but the Z->A sorting simply reverses the A->Z sorting, which is not what we ultimately want for tree table sorting.
Tree Table
Sort A->Z with respect to higher order level
Sort Z-> with respect to higher order level
Table
Sort column A->Z based completely on the basis of the selected column
Sort column Z->A based completely on the basis of the selected column
Rows unexpanded to the selected column level should appear at the bottom of the table via a filter in tree view and no filtering should be applied in tree table view
Minda
commented
10 years ago
The current tree table sorting algorithm is incomplete. The A->Z sorting works as expected, but the Z->A sorting simply reverses the A->Z sorting, which is not what we ultimately want for tree table sorting.
Tree Table Sort A->Z with respect to higher order level Sort Z-> with respect to higher order level
Table Sort column A->Z based completely on the basis of the selected column Sort column Z->A based completely on the basis of the selected column
Rows unexpanded to the selected column level should appear at the bottom of the table via a filter in tree view and no filtering should be applied in tree table view