Jean-Marc Lasgouttes <[EMAIL PROTECTED]> writes:
>>>>>> "Lars" == Lars Gullik Bjønnes <[EMAIL PROTECTED]> writes:
>
| Lars> We have other thing to do to speed up things before we begin
| Lars> with tricks like these...
>
| Probably.
>
| Lars> _and_ we must assume that the <string> implementation that we
| Lars> use will use the fastest way of comparing two strings.
>
| So you think that the fact that operator== calls a generic compare
| function that is able to catter for strings with different sizes and
| all does not matter? I think that in the (string,string) case, it is
| possible to do better.
>
| Lars> | You can't be much faster than that, if this is really the
| Lars> bottleneck.
>
| Lars> I have some ideas on how to speed this up. - dynamic cache - map
| Lars> - hash_map - storing actual pointer to layout in
| Lars> buffer/paragraph - etc.
>
| So you are going to undo all your layout-as-string stuff??
No, that will not be my first option.
I will try other things first.
One nice thing about the layout string though, is that we now does not
rely on hardcoded layout names or indices anywhere.
--
Lgb
