Implementing normal algorithms using predicate versions

Gabriel Dos Reis gdr@integrable-solutions.net
Mon Nov 29 15:29:00 GMT 2004


Chris Jefferson <caj@cs.york.ac.uk> writes:

[...]

| I've tried this on the entire of sort and the story appears to be that
| -O1 is sufficent to remove any inefficency. -O0 gets hurt quite badly
| however.

The front-end does no inlining at -O0.  So, I'm not surprised.

-- Gaby



More information about the Libstdc++ mailing list