Hi Niklas,
Niklas Nebel wrote:
Kay Ramme - Sun Germany - Hamburg wrote:
The calculation just gives, what the optimum (minimum) looks like. If
the implementation does more string instantiations than calculated,
than it is obviously not optimal (in this aspect) and the impact of
string con- / destruction is increased.
You're right. But real numbers, also for the memory overhead in a
complete running office, would sure be interesting.
this numbers obviously need to be measured. If they differ from what we
calculated, then we know that the implementations are not optimal (which
we probably know already anyway ;-), but I think the point is, that we
can judge the implementation. E.g. if the predicated value for string
instantiations is X and we measure 100 x X, we know that we are
relatively far away from the optimum and need to do some optimizations,
but if we measure 1.1 x X, than we know we are already near the optimum
and that it will probably be hard to improve performance further. Hope
you understand what I mean ;-).
Another thing: test_character_copy looks somewhat strange. 100
iterations of memcpy for 1024 bytes each, and the total time divided by
1024?
Hey, that is a bug! Thanks for pointing this out. Oh well, that happens
when one is too lazy to follow the little obscurities. That probably
means, that a sal_Unicode copy is much less (1/100) expansive than 34
insts. I will update the calculations accordingly.
Niklas
Kay
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
