[Boost-users] [Fusion] Runtime complexity of boost::fusion::find?

Hi everyone On the following documentation page: http://www.boost.org/doc/libs/1_45_0/libs/fusion/doc/html/fusion/algorithm/q... It mentions that the computational complexity for "find" is linear. However, I can not understand how this is the case. As far as I understand all find needs to do is to look through types, simply iterating through the sequence types at compile time using result_of::next<X>::type where where X is initially result_of::begin<SEQ>::type. So I can't see how any actual work is done by find. Am I missing something here? I'm working on a parameter library, and I assumed things like "find" used constant or no time to execute. Could people please explain how find could use linear time? Thanks Clinton