Hi everyone<br><br>On the following documentation page: <br><br><a href="http://www.boost.org/doc/libs/1_45_0/libs/fusion/doc/html/fusion/algorithm/query/functions/find.html">http://www.boost.org/doc/libs/1_45_0/libs/fusion/doc/html/fusion/algorithm/query/functions/find.html</a><br>
<br>It mentions that the computational complexity for &quot;find&quot; is linear. However, I can not understand how this is the case.<br><br>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&lt;X&gt;::type where where X is initially result_of::begin&lt;SEQ&gt;::type. So I can&#39;t see how any actual work is done by find.<br>
<br>Am I missing something here? I&#39;m working on a parameter library, and I assumed things like &quot;find&quot; used constant or no time to execute. Could people please explain how find could use linear time?<br><br>Thanks<br>
<br>Clinton<br>