In our previous episode, Thaddy said:
The comparison in the UTF-8 string example is very questionable. First
ch(i) is not equivalent to ch, not even closely related, and the claim
of O(N^2) operations deserves an proof - IMO it's simply wrong.
Yes, this caught my eye as well: O(N^2)
2010/11/14 Thaddy tha...@thaddy.com:
On 13-11-2010 20:56, Hans-Peter Diettrich wrote:
The comparison in the UTF-8 string example is very questionable. First
ch(i) is not equivalent to ch, not even closely related, and the claim of
O(N^2) operations deserves an proof - IMO it's simply wrong.
Graeme Geldenhuys wrote:
On 14 November 2010 04:09, Paul Breneman wrote:
This web page has i386 Win32 and ARM WinCE cross-compiler zips that include
everything needed (no install necessary) to test FPC 2.4.2 with the fpGUI
0.7 release (Aug 2010):
http://www.turbocontrol.com/easyfpgui.htm
On 14-11-2010 13:22, Vincent Snijders wrote:
would be evaluated every time. S
the O(N^2) stems from the fact that it is hard to get the ith
character in a a UTF8String in O(1). Suppose it is o(N), then the loop
is O(n^2).
Vincent
Hard to is implementation detail and not part of any algorithm. A
2010/11/14 Thaddy tha...@thaddy.com:
On 14-11-2010 13:22, Vincent Snijders wrote:
would be evaluated every time. S
the O(N^2) stems from the fact that it is hard to get the ith
character in a a UTF8String in O(1). Suppose it is o(N), then the loop
is O(n^2).
Vincent
Hard to is
In our previous episode, Thaddy said:
would be evaluated every time. S
the O(N^2) stems from the fact that it is hard to get the ith
character in a a UTF8String in O(1). Suppose it is o(N), then the loop
is O(n^2).
Hard to is implementation detail and not part of any algorithm. A
Hi,
I just downloaded all the PDF docs from the Free Pascal website, then
noticed they are all for v2.4.0, not 2.4.2. Just thought I would
mention this.
--
Regards,
- Graeme -
___
fpGUI - a cross-platform Free Pascal GUI toolkit
In our previous episode, Graeme Geldenhuys said:
I just downloaded all the PDF docs from the Free Pascal website, then
noticed they are all for v2.4.0, not 2.4.2. Just thought I would
mention this.
/me waves magic wand.
___
fpc-devel maillist -
Thaddy schrieb:
The comparison in the UTF-8 string example is very questionable. First
ch(i) is not equivalent to ch, not even closely related, and the claim
of O(N^2) operations deserves an proof - IMO it's simply wrong.
Yes, this caught my eye as well: O(N^2) seems only the case if length
Marco van de Voort schrieb:
A more grave reason though is that Delphi does not have low() and high() on
sets and a request to add it by me in 2006 was closed with their equivalent
of won't fix.
I wonder how FPC defines low() and high() for sets. The static bounds
can be obtained from the
Vincent Snijders schrieb:
2010/11/14 Thaddy tha...@thaddy.com:
On 13-11-2010 20:56, Hans-Peter Diettrich wrote:
The comparison in the UTF-8 string example is very questionable. First
ch(i) is not equivalent to ch, not even closely related, and the claim of
O(N^2) operations deserves an proof -
In our previous episode, Hans-Peter Diettrich said:
A more grave reason though is that Delphi does not have low() and high() on
sets and a request to add it by me in 2006 was closed with their equivalent
of won't fix.
I wonder how FPC defines low() and high() for sets.
See the source.
Paul Breneman wrote on 11/13/2010:
This web page has i386 Win32 and ARM WinCE cross-compiler zips that
include everything needed (no install necessary) to test FPC 2.4.2 with
the fpGUI 0.7 release (Aug 2010):
http://www.turbocontrol.com/easyfpgui.htm
The i386 Linux version is almost ready.
On Sun, Nov 14, 2010 at 08:52, Graeme Geldenhuys
graemeg.li...@gmail.com wrote:
If you use full-blown Iterator classes (instead of just for-in style)
you get a lot more too:
* full control over iteration
- move forward
- move back
- reset iteration
- peek forward/back
- skip,
On Mon, Nov 15, 2010 at 08:25, Marco van de Voort mar...@stack.nl wrote:
In our previous episode, Hans-Peter Diettrich said:
At least the example code has to be made work, i.e. the nonsense statement
DoSomething(ch(i));
has to be changed into something like
15 matches
Mail list logo
