Re: [fpc-pascal] sort procedure of T(FP)List

2006-05-07 Thread Marc Santhoff
Am Samstag, den 06.05.2006, 19:36 +0300 schrieb Geno Roupsky: > > > 2006/5/6, Marc Santhoff <[EMAIL PROTECTED]>: > Am Freitag, den 05.05.2006, 11:03 +0300 schrieb Geno Roupsky: > > In fact you could have different function for every kind of > sort and > > switch th

Re: [fpc-pascal] sort procedure of T(FP)List

2006-05-07 Thread Geno Roupsky
2006/5/6, Marc Santhoff <[EMAIL PROTECTED]>: Am Freitag, den 05.05.2006, 11:03 +0300 schrieb Geno Roupsky:> In fact you could have different function for every kind of sort and> switch them on the fly when the properties determining the kind of> sort that should be made changes. In my experience th

Re: [fpc-pascal] sort procedure of T(FP)List

2006-05-06 Thread Marc Santhoff
Am Freitag, den 05.05.2006, 11:03 +0300 schrieb Geno Roupsky: > In fact you could have different function for every kind of sort and > switch them on the fly when the properties determining the kind of > sort that should be made changes. In my experience there is no much > code duplication involved

Re: [fpc-pascal] sort procedure of T(FP)List

2006-05-06 Thread Geno Roupsky
2006/5/2, Marc Santhoff <[EMAIL PROTECTED]>: Hi,i wonder why the declaration of the comparing function of list objectsis the way it is:TListSortCompare = function (Item1, Item2: Pointer): Integer;Since I am writing a class that sorts a list it owns depending on another property naming the property

[fpc-pascal] sort procedure of T(FP)List

2006-05-02 Thread Marc Santhoff
Hi, i wonder why the declaration of the comparing function of list objects is the way it is: TListSortCompare = function (Item1, Item2: Pointer): Integer; Since I am writing a class that sorts a list it owns depending on another property naming the property of the list items for sorting, I would