corrected complexity bound

[SVN r33543]
This commit is contained in:
Joaquín M. López Muñoz 2006-04-05 07:15:54 +00:00
parent 2448ba2a95
commit f86dce9db1

View File

@ -396,7 +396,7 @@ section</a>. The complexity signature of ordered indices is:
<li>insertion: <code>i(n)=log(n)</code>,</li>
<li>hinted insertion: <code>h(n)=1</code> (constant) if the hint element
precedes the point of insertion, <code>h(n)=log(n)</code> otherwise,</li>
<li>deletion: <code>d(n)=1</code> (constant),</li>
<li>deletion: <code>d(n)=1</code> (amortized constant),</li>
<li>replacement: <code>r(n)=1</code> (constant) if the element position does not
change, <code>r(n)=log(n)</code> otherwise,</li>
<li>modifying: <code>m(n)=1</code> (constant) if the element position does not
@ -954,7 +954,7 @@ Hashed indices
<br>
<p>Revised February 6th 2006</p>
<p>Revised March 31st 2006</p>
<p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
Distributed under the Boost Software