If CodeGear are fair, they send you her Code in private so you have the
same chance to find Copyright issues as they have.
Until this isnt the case everything they suppose the fpc team is mess.
regards
Christoan
Michael Van Canneyt schrieb:
Hello,
The FPC team has been recently made aware th
On Mon, 19 Nov 2007, Stephen Dickason wrote:
> >>> Well, the solution is very simple :
> >>>
> >>> TSortAlgorithm = (saBubble,saShell,saMerge,saRadix,saQuick);
> >>>
> >>> TStringList = Class(TStrings);
> >>> Property SortAlgorithm : TSortAlgorithm Read FSA Write FSA;
> >>> end;
> >>>
> >>
> >
>>> Well, the solution is very simple :
>>>
>>> TSortAlgorithm = (saBubble,saShell,saMerge,saRadix,saQuick);
>>>
>>> TStringList = Class(TStrings);
>>> Property SortAlgorithm : TSortAlgorithm Read FSA Write FSA;
>>> end;
>>>
>>
>> I think it is a very good idea.
>
>I think so too.
>
TStringList
On Mon, 19 Nov 2007, Martin Waldenburg wrote:
> Damien Gerard schrieb:
> >> Well, the solution is very simple :
> >>
> >> TSortAlgorithm = (saBubble,saShell,saMerge,saRadix,saQuick);
> >>
> >> TStringList = Class(TStrings);
> >> Property SortAlgorithm : TSortAlgorithm Read FSA Write FSA;
> >> e
Damien Gerard schrieb:
>> Well, the solution is very simple :
>>
>> TSortAlgorithm = (saBubble,saShell,saMerge,saRadix,saQuick);
>>
>> TStringList = Class(TStrings);
>> Property SortAlgorithm : TSortAlgorithm Read FSA Write FSA;
>> end;
>>
>
> I think it is a very good idea.
I think so too.
>>
Paul Ishenin schrieb:
> Martin Waldenburg wrote:
>> Michael Van Canneyt schrieb:
>>
>>> Probably we could put a shellsort behind it, and no-one would notice :-)
>>>
>>
>> for comparision intensive sorting a well implemented Mergesort
>> beats everything,
>> especialy with caseinsensitive Uni
On Nov 19, 2007, at 1:13 PM, Michael Van Canneyt wrote:
On Mon, 19 Nov 2007, Florian Klaempfl wrote:
Martin Waldenburg schrieb:
Michael Van Canneyt schrieb:
Probably we could put a shellsort behind it, and no-one would
notice :-)
for comparision intensive sorting a well implemented Mer
Florian Klaempfl schrieb:
> For sorting large stringlists a radixsort might be even better?
not in my tests, I dit quite a lot.
Martin
_
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
Martin Waldenburg wrote:
Michael Van Canneyt schrieb:
Probably we could put a shellsort behind it, and no-one would notice :-)
for comparision intensive sorting a well implemented Mergesort
beats everything,
especialy with caseinsensitive Unicode it can exceed other
Algorithms 100 tim
On Mon, 19 Nov 2007, Florian Klaempfl wrote:
> Martin Waldenburg schrieb:
> > Michael Van Canneyt schrieb:
> >> Probably we could put a shellsort behind it, and no-one would notice :-)
> >
> > for comparision intensive sorting a well implemented Mergesort
> > beats everything,
>
> For sorting
Martin Waldenburg schrieb:
> Michael Van Canneyt schrieb:
>> Probably we could put a shellsort behind it, and no-one would notice :-)
>
> for comparision intensive sorting a well implemented Mergesort
> beats everything,
For sorting large stringlists a radixsort might be even better?
___
Michael Van Canneyt schrieb:
> Probably we could put a shellsort behind it, and no-one would notice :-)
for comparision intensive sorting a well implemented Mergesort
beats everything,
especialy with caseinsensitive Unicode it can exceed other
Algorithms 100 times for larger lists.
It uses slight
On Mon, 19 Nov 2007, Martin Waldenburg wrote:
> > * TStringList.Grow
>
> Once I have published alternatives to this.
> However there cannot be done much more than
> using different growing rates.
Which is exactly what we'll do.
>
> > * TStringList.QuickSort
>
> Same here, a nonrecursive ver
On Nov 19, 2007, at 12:03 PM, Martin Waldenburg wrote:
Florian Klaempfl schrieb:
Martin Waldenburg schrieb:
Althought Quicksort is an idiot's choice for sorting strings.
I guess the name gives no choice :)
a routine called Quicksort doesn't need to implement the Algorithm of
this name.
Florian Klaempfl schrieb:
> Martin Waldenburg schrieb:
>> Althought Quicksort is an idiot's choice for sorting strings.
>
> I guess the name gives no choice :)
a routine called Quicksort doesn't need to implement the Algorithm of
this name.
Nevertheless the one has stamped himself as one.
Marti
Martin Waldenburg schrieb:
>> * 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 f
> * 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
Let me notice that we are in difficult situation on the other hand: we
cannot be sure if some of the fpc/lazarus code wasn't used in Delphi ,
right ?
Correct. Borland/CodeGear must also be fair. Since fpc/laz is an open
source project (means everybody can read the source codes), it's very
pos
Michael Van Canneyt wrote:
Hello,
The FPC team has been recently made aware that a number of routines in the
Classes unit are apparently based on code originally from Borland/CodeGear.
After someone found a tool to automatically compare source code bodies to look
for structural similarities, we
19 matches
Mail list logo
