     Taking this into account, the complexities of all infix operators can be
        determined from the corresponding inplace <code class="computeroutput"><span class="identifier">operators</span>
        <span class="identifier">o</span><span class="special">=</span></code>
        they depend on.
      </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2007 -2010 J