FiveTech Software tech support forums

If we use AUTOSORT clause while defining XBrowse, when the user clicks on a header, it automatically toggles sort ascending and descending.

... * LinkList: Method Sort( [lAsc], [lRecurse], [nCol] ) enhanced with three new parameters. Param.1 lAsc: .T. or "A" for ascending sort and .F. OR "D" for descending sort. Or, this parameter can be a codeblock also. Default: Ascending sort Param.2 lRecurse: Default ...

... is ON, XBrowse automatically sorts the data on click of header, using the value in oCol:cSortOrder. First click on the header sorts the data in ascending order. Second click on the header sorts the data in descending order. In case of DBF, it uses the RDD function OrdDescend() If oCol:cSortOrder ...

... is ON, XBrowse automatically sorts the data on click of header, using the value in oCol:cSortOrder. First click on the header sorts the data in ascending order. Second click on the header sorts the data in descending order. In case of DBF, it uses the RDD function OrdDescend() If oCol:cSortOrder ...

... is performed on multiple columns. For descending order, specify the column number as negative number. Eg: ASort( aArray,,{ 2, -4, 5 } ) Performs ascending sort of column 2 and where column 2 is equal, descending sort on column 4 and so on. * TGraph: - Fix: Runtime error when printing PIE graph ...

Set the sorted column's data cOrder := "A" or "D" depending on Ascending or Descending sort and then calll RefreshHeaders

Code: Select all  Expand view

oBrw:cOrders := ""
oCol:cOrder := "A"
oBrw:RefreshHeaders()

If user select a header to sort on or change ascending/descending order, how do I get xbrowse to always perform a oXbrw:goTop() afterwards?

No, as I want to sort for the second item descending and the first item ascending. Anyway, it doesn't work either.

EMG

... Number of elements starting from <nStart> to sort, default is all elements. <bSort> Code block for sorting order, default is ascending order {| x, y | x < y }. The code block should accept two parameters and must return .T. if the sort is in order, .F. if not.

... ; [ALL] ; [NEXT <nNumber>] ; [RECORD <nRecNo>] ; [REST] ; [EVAL <bBlock>] ; [EVERY <nInterval>] ; [UNIQUE] ; [ASCENDING|DESCENDING] ; [USECURRENT] ; [ADDITIVE] ; [CUSTOM] ; [NOOPTIMIZE] ; [TEMPORARY] ; [USEFILTER] ; [EXCLUSIVE]

... ; [ALL] ; [NEXT <nNumber>] ; [RECORD <nRecNo>] ; [REST] ; [EVAL <bBlock>] ; [EVERY <nInterval>] ; [UNIQUE] ; [ASCENDING|DESCENDING] ; [USECURRENT] ; [ADDITIVE] ; [CUSTOM] ; [NOOPTIMIZE] ; [TEMPORARY] ; [USEFILTER] ; [EXCLUSIVE] como puede ver hay una clausula ...

... This approach has the same cons as discussed above, i.e., the IDs generated may not be ascending the chronological order and some IDs in the serial may be missing. However, the fields RowID (autoincrement), CreateDt, UpdateDt, which are ...

... This approach has the same cons as discussed above, i.e., the IDs generated may not be ascending the chronological order and some IDs in the serial may be missing. However, the fields RowID (autoincrement), CreateDt, UpdateDt, which are ...

Dear Friend Silvio The inherent problem in this approach is that the IDs are not chronologically in ascending order and there can be gaps in the serial order. In case of invoices, invoice numbers not being in serial order would be highly objectionable. Some programmer friends ...

Dear Friend Silvio The inherent problem in this approach is that the IDs are not chronologically in ascending order and there can be gaps in the serial order. In case of invoices, invoice numbers not being in serial order would be highly objectionable. Some programmer friends ...