[boost] Re: preprocessor puzzle

Paul Mensonides writes:

For the sake of argument, say you're going to do the above just for fun or as a learning tool. The approach that I described doesn't scale (even to just the built-in types). The code required would be so bloated that it would be easier to manually write a bunch of template specializations. If you were going to do something like this generally, a better approach would be to split words into single characters and compare strings of characters.

Is it implementable? -- Aleksey Gurtovoy MetaCommunications Engineering