Thaddy schrieb:
Actually, I am *calling* the destructor in the finalizer, not copying
it. AFAIK this should take care of it.
IMO destructors and finalizers are mutually exclusive, I remember a note
like "Why a garbage collector never should call an destructor", that at
least applies to mark-
Alexander Klenin schrieb:
The total order will be something between O(n^1) and O(n^2), depending on
many factors (what is "n"?...).
Huh? O(f(n)) has a precise definition, and of course we are talking worst-case
complexity here (although average complexity would be the same in this case).
n is
Marco van de Voort schrieb:
First you would have to come up with a workable model for s[x] being
utf32chars in general that doesn't suffer from O(N^2) performance
degradation (read/write)
Right, UTF-32 or UCS2 were much more useful in computations.
And for it to be useful, it must be workabl
On Tue, Nov 16, 2010 at 01:50, Hans-Peter Diettrich
wrote:
>> The other of the algorithm is then still O(n^2), since UTF8Char will
>> already be O(n)?
>
> The total order will be something between O(n^1) and O(n^2), depending on
> many factors (what is "n"?...).
Huh? O(f(n)) has a precise definit
On 15 Nov 2010, at 17:23, Felipe Monteiro de Carvalho wrote:
> I have this procedure:
>
> function errorHandler(d: PDisplay; e: PXErrorEvent): cint; cdecl;
>
> And I would like to set a break-point in it in GDB. Any ideas how to do that?
>
> break errorHandler says that it can't find the proce
On Mon, Nov 15, 2010 at 11:21 AM, Michael Schnell wrote:
> ..forces the programmer to work with both UTF-8 and UCS32 coded Unicode
> characters. This might blow his mind even more (regarding that e.g. the
> Lazarus LCL forces him to work with UTF-8 coded Unicode in a string type
> called "ANSIStri
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
> >>DoSomething(GetUTF8char(s,i));
> >> before we can can talk honestly about the order of t
Hello,
I have this procedure:
function errorHandler(d: PDisplay; e: PXErrorEvent): cint; cdecl;
And I would like to set a break-point in it in GDB. Any ideas how to do that?
break errorHandler says that it can't find the procedure ...
thanks,
--
Felipe Monteiro de Carvalho
___
Marco van de Voort schrieb:
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
DoSomething(GetUTF8char(s,i));
before we can can talk honestly about the order of the loop.
The other of the algorithm is then
On 15-11-2010 14:59, Michael Van Canneyt wrote:
You must finalize, because ref. counting of interfaces etc. need to be
taken
care of. Interfaces may live outside the FPC memory space, and are
therefor
not accessible to the GC. If you want to let the GC collector handle all
that, you're in ess
On 15-11-2010 14:59, Michael Van Canneyt wrote:
You must finalize, because ref. counting of interfaces etc. need to be
taken
care of. Interfaces may live outside the FPC memory space, and are
therefor
not accessible to the GC. If you want to let the GC collector handle all
that, you're in ess
On 15-11-2010 14:50, Marco van de Voort wrote:
Oh. Am I supposed to do that? :-)
Yes, please :-) , but others are welcome...
(I just collect info about this subject because it is a recurring white
elephant. Regularly there is talk about it, but nobody has seen a working
implementation, and no
On Mon, 15 Nov 2010, Marco van de Voort wrote:
In our previous episode, Thaddy said:
You can find boehm garbage collector bindings for freepascal, incl.
replacement memory manager at
http://freepascal.thaddy.co.uk/fpc_boehm_gc.zip
For win32 a prebuild dll is included
For other platforms you
In our previous episode, Thaddy said:
>
> You can find boehm garbage collector bindings for freepascal, incl.
> replacement memory manager at
> http://freepascal.thaddy.co.uk/fpc_boehm_gc.zip
> For win32 a prebuild dll is included
> For other platforms you need to build the gc library from source
On 15-11-2010 10:22, Vincent Snijders wrote:
Maybe I did not understand Thaddy, but to give you O(1) access to the
ith character, I was thinking about a a translation table of the utf8
string, with key=index (1..length) and value=offset in bytes to the
ith character. Such a translation table wou
On 15/11/10 13:13, Paul Breneman wrote:
Michael Schnell wrote:
On 11/14/2010 03:09 AM, 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.tu
Michael Schnell wrote:
On 11/14/2010 03:09 AM, 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
The i38
As I promised Marco,
You can find boehm garbage collector bindings for freepascal, incl.
replacement memory manager at
http://freepascal.thaddy.co.uk/fpc_boehm_gc.zip
For win32 a prebuild dll is included
For other platforms you need to build the gc library from source (included)
Please test, I
On Wed, Nov 10, 2010 at 2:27 PM, Jonas Maebe wrote:
>
> On 30 Oct 2010, at 13:20, Matthias K. wrote:
>
>> the last days I've done a first step in Porting the i386 data flow
>> analyzer, asmcse and peephole optimizations.
>
> Quite impressive!
>
>> Main motivation is: target instruction level opti
In our previous episode, Michael Schnell said:
> > No, since that wouldn't describe the position of that char in the string
> > that is being iterated.
> Is this really wanted ?
>
> I suppose this would ask for a full blown iterator
Typically I'd iterate by means outside the language (I've us
On 11/15/2010 11:40 AM, Marco van de Voort wrote:
No, since that wouldn't describe the position of that char in the string
that is being iterated.
Is this really wanted ?
I suppose this would ask for a full blown iterator
-Michael
___
fpc-devel
In our previous episode, Michael Schnell 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.
>
> With UTF-8 strings and frie
On 11/15/2010 11:20 AM, Vincent Snijders wrote:
I agree, and that is why you need enumerators to make it work.
OK, in fact this _is_ an implementation of an enumerator, but same is
hidden and so the application programmer is not forced to bother. He
just sees the Unicode character in the loop
unintentionally deleted;
..forces the programmer to work with both UTF-8 and UCS32 coded Unicode
characters. This might blow his mind even more (regarding that e.g. the
Lazarus LCL forces him to work with UTF-8 coded Unicode in a string type
called "ANSIString" :( )
-Michael
2010/11/15 Michael Schnell :
> On 11/15/2010 10:22 AM, Vincent Snijders wrote:
>>
>> I cannot imagine another way that a translations table can give you o(1)
>> access.
>>
> Maybe I don't understand the o(1) correctly. Do you think it should be
> necessary to access each character in the string wit
On 11/15/2010 10:10 AM, Alexander Klenin wrote:
Actually, I do not think so. I believe that an integer containing the codepoint
is preferable implementation.
OK, Unicode always blows up the complexity of the code greatly ;).
Your suggestion would result in an UTF-8 -> UCS32 translation and thu
On 11/15/2010 10:22 AM, Vincent Snijders wrote:
I cannot imagine another way that a translations table can give you o(1) access.
Maybe I don't understand the o(1) correctly. Do you think it should be
necessary to access each character in the string with in each iteration
in this way.
What I
2010/11/15 Michael Schnell :
> On 11/14/2010 03:33 PM, Vincent Snijders wrote:
>>
>> I did not have in mind such a sophisticated UTF8 string
>> implementation, that included a translation table for easy indexing.
>
> I don't think you need a translation table to walk through an UTF-8 String
Maybe
On Mon, Nov 15, 2010 at 18:38, Michael Schnell wrote:
> On 11/13/2010 08:56 PM, 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
On 11/14/2010 10:12 PM, Hans-Peter Diettrich wrote:
With regards to UTF-8 (or other MBCS) strings, what does Length(s)
return in these cases? IMO other functions have to be used for the
determination of the true character count (as opposed to the char=byte
count).
Of course its possible without
On 11/14/2010 03:33 PM, Vincent Snijders wrote:
I did not have in mind such a sophisticated UTF8 string
implementation, that included a translation table for easy indexing.
I don't think you need a translation table to walk through an UTF-8
String Unicode-Character by Unicode-Character (and cre
On 11/14/2010 09:47 PM, Hans-Peter Diettrich wrote:
I wonder how FPC defines low() and high() for sets.
IMHO it should not. An "in" loop on sets should not use a defined
sequence. Relying on on an "order" of the elements of a set
mathematically is erroneous.
-Michael
__
On 11/13/2010 08:56 PM, 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.
With UTF-8 strings and friends wo
BTW.: Would it be possible to compile Lazarus with that distribution to
allow for native development on ARM/CE and ARM/Linux ?
Thanks for your work,
- Michael
___
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman
On 11/14/2010 03:09 AM, 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
The i386 Linux version is almos
35 matches
Mail list logo
