Re: Mule performance penalty

Martin, One thing I noticed that is excruciatingly slow under MULE is selecting a large nnfolder group in Gnus. It is easily 100 times slower than non-MULE. I can recall it taking 25 minutes to enter my xemacs-beta group on an Ultra 1, compared to 10 seconds non-MULE. I've not used MULE since... this was last winter. greg Martin> Martin> Hrvoje had trouble believing that the Mule penalty is only 30%. Martin> Obviously it depends on what you're doing. Martin> Martin> There will be places in the sources where switching from non-mule to Martin> mule will change an order-N algorithm to an order-N*N algorithm. I Martin> fixed such an algorithm in casefiddle.c. I am sure there are others. Martin> It is quite likely that using a fixed-width internal representation Martin> for characters instead of the current variable-width one is the right Martin> long-term strategy.