Code: Select all
Structure person
name.s
starsign.s
age.l
EndStructure
NewList people.person()
for x=1 to 5
AddElement(people())
next x
Code: Select all
SortList(people(), #PB_SORTLIST_DOWN , name)
That's a fairly specific sorting request and does not really fit in with the alphabetical sorting of strings. Much better to have a sort system where you have some standard sorts and perhaps a way to extend it (yes, I can hear people crying about how "difficult" it would be to use).Originally posted by Kale
relevant fields of the structure? say if i want to sort the list to display the eldest person, or the youngest, or in alphabetical order of their names? maybe something like:
#PB_SORTLIST_DOWN ; 0-9, a-z sorting
#PB_SORTLIST_UP ; 9-0, z-a sorting
Fred is free to my code if he wants, although I wouldn't be able to convert it to ASMI would be grateful if you (Fred) could have a think about this one as many seem to request it
yeah your right, i want Fred/people to have a think about what could be doneThat's a fairly specific sorting request and does not really fit in with the alphabetical sorting of strings. Much better to have a sort system where you have some standard sorts and perhaps a way to extend it (yes, I can hear people crying about how "difficult" it would be to use).
so now i'm in the debugging fase. With the information supplied hereafter you will get an impression of it.Just out of curiosity, what needs changed. Wouldn't new sorting commands just need commands added to the sort library?Originally posted by fred
On my TODO list, yes. But don't know when, it need some compiler changes.
Code: Select all
Procedure ByNameAscending(*a.test,*b.test)
If *a\name <= *b\name : result = #true : EndIf
ProcedureReturn result
EndProcedure
Code: Select all
Procedure ByNameAndCity(*a.test,*b.test)
If *a\name < *b\name or (*a\name = *b\name and *a\city <= *b\city)
ProcedureReturn #true
EndIf
EndProcedure
That is basically what my sort routines on the resources site do. It is all set up for sorting arrays and lists using various algorithms and provides comparison functions for all the basic types. There are a few demos too.Originally posted by horst
I think a sort function can be very simple, if the actual compare
operation is an external function written by the programmer.
This means, the programmer can write any code he wants to decide
whether two given elements are in the right order or not.
The code I wrote gives full access to the complete elements. Hoever, I agree that the function calls could be simpler, especially since most parameters are e.g. size of arrays, size of structures, etc. Hopefulyl PB would be able to work this out for itself.Originally posted by horst
> That is basically what my sort routines on the resources site do.
Yes, but I had a very simple solution im mind, that requires no
extra parameters, and where the complete elements are available in
the comparison function.