> * TStringList.Grow
Once I have published alternatives to this.
However there cannot be done much more than
using different growing rates.
> * TStringList.QuickSort
Same here, a nonrecursive version based on something that I found in
an once famous free library and to which I gave proper credit.
Althought Quicksort is an idiot's choice for sorting strings.
> * TStringList.Find
Same here.
The only way to be different to Delphi's implementation
is to use another comparision.
Martin
_________________________________________________________________
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
archives at http://www.lazarus.freepascal.org/mailarchives
