[TCLCORE] Re: Hintermayer's string allocation patch

[Andreas K. <a.k...@we...>]

Hi, my two cents or so in this.

I go with George and John here, i.e. allocate until you the wall and
then retract from the boundary to fill the rest in smaller
increments.

What I like about this algorithm is that it not only preserves maximum
performance for as long as possible while still being able to fill the
memory to the max. but also that it is "self-tuning".

With this I mean that there is no need to adjust (tinker / fiddle
with) some parameters like with the current patch proposed as by
Gerhard to adapt the core to the host it is running on to get good
performance on average. We get this automatically.

This makes it also easier for distributors of binaries. No need to
guess some values for the parameters which will give good performance
over a __range_of_machines__.



Gerhard, are you willing to try and write a second patch which uses
this algorithm to solve the problem so that we may compare hard
numbers instead of running in argumentative circles without hard data ?


-- 
Sincerely,
	Andreas Kupries <a.k...@we...>
		<http://www.purl.org/NET/akupries/>
-------------------------------------------------------------------------------

--
The TclCore mailing list is sponsored by Ajuba Solutions
To unsubscribe:  email tcl...@aj... with the 
                 word UNSUBSCRIBE as the subject.