boost-react-native-bundle

<html> <head> <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> <title>Complexity</title> <link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> <meta name="generator" content="DocBook XSL Stylesheets V1.74.0"> <link rel="home" href="../../index.html" title="Chapter 1. Boost.Icl"> <link rel="up" href="../implementation.html" title="Implementation"> <link rel="prev" href="../implementation.html" title="Implementation"> <link rel="next" href="inplace_and_infix_operators.html" title="Inplace and infix operators"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> <td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> <td align="center"><a href="../../../../../../index.html">Home</a></td> <td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> <td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> <td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> <td align="center"><a href="../../../../../../more/index.htm">More</a></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="../implementation.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../implementation.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_and_infix_operators.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> <div class="section boost_icl_implementation_complexity" lang="en"> <div class="titlepage"><div><div><h3 class="title"> <a name="boost_icl.implementation.complexity"></a><a class="link" href="complexity.html" title="Complexity">Complexity</a> </h3></div></div></div> <a name="boost_icl.implementation.complexity.complexity_of_element_containers"></a><h5> <a name="id1132060"></a> <a class="link" href="complexity.html#boost_icl.implementation.complexity.complexity_of_element_containers">Complexity of element containers</a> </h5> Since element containers <a href="http://www.cplusplus.com/reference/stl/set/" target="_top"><code class="computeroutput">std::set</code> </a> and <code class="computeroutput"><a class="link" href="../../boost/icl/map.html" title="Class template map">icl::map</a></code> are only extensions of stl::set and stl::map, their complexity characteristics are accordingly. So their major operations insertion (addition), deletion and search are all using logarithmic time. <a name="boost_icl.implementation.complexity.complexity_of_interval_containers"></a><h5> <a name="id1132106"></a> <a class="link" href="complexity.html#boost_icl.implementation.complexity.complexity_of_interval_containers">Complexity of interval containers</a> </h5> The operations on interval containers behave differently due to the fact that intervals unlike elements can overlap any number of other intervals in a container. As long as intervals are relatively small or just singleton, interval containers behave like containers of elements. For large intervals however time consumption of operations on interval containers may be worse, because most or all intervals of a container may have to be visited. As an example, time complexity of <a class="link" href="../function_reference/addition.html" title="Addition">Addition</a> on interval containers is briefly discussed. More information on complexity characteristics of icl's functions is contained in section <a class="link" href="../function_reference.html" title="Function Reference">Function Reference</a> <a name="boost_icl.implementation.complexity.time_complexity_of_addition"></a><h6> <a name="id1132157"></a> <a class="link" href="complexity.html#boost_icl.implementation.complexity.time_complexity_of_addition">Time Complexity of Addition</a> </h6> The next table gives the time complexities for the overloaded <code class="computeroutput">operator +=</code> on interval containers. The instance types of <code class="computeroutput">T</code> are given as column headers. Instances of type parameter <code class="computeroutput">P</code> are denoted in the second column. The third column contains the specific kind of complexity statement. If column three is empty worst case complexity is given in the related row. <div class="table"> <a name="id1132205"></a>Table 1.15. Time Complexity of Addition: <div class="table-contents"><table class="table" summary="Time Complexity of Addition:"> <colgroup> <col> <col> <col> <col> <col> <col> <col> <col> </colgroup> <thead><tr> <th> </th> <th> <code class="computeroutput">P</code> </th> <th> </th> <th> interval set </th> <th> separate interval set </th> <th> split interval set </th> <th> interval map </th> <th> split interval map </th> </tr></thead> <tbody> <tr> <td> <code class="computeroutput">T& operator +=(T& object, const P& addend)</code> </td> <td> <code class="computeroutput">T::element_type</code> </td> <td> </td> <td> O(log n) </td> <td> O(log n) </td> <td> O(log n) </td> <td> O(log n) </td> <td> O(log n) </td> </tr> <tr> <td> </td> <td> <code class="computeroutput">T::segment_type</code> </td> <td> best case </td> <td> O(log n) </td> <td> O(log n) </td> <td> O(log n) </td> <td> O(log n) </td> <td> O(log n) </td> </tr> <tr> <td> </td> <td> </td> <td> worst case </td> <td> O(n) </td> <td> O(n) </td> <td> O(n) </td> <td> O(n) </td> <td> O(n) </td> </tr> <tr> <td> </td> <td> </td> <td> amortized </td> <td> O(log n) </td> <td> O(log n) </td> <td> </td> <td> </td> <td> </td> </tr> <tr> <td> </td> <td> <code class="computeroutput">interval_sets</code> </td> <td> </td> <td> O(m log(n+m)) </td> <td> O(m log(n+m)) </td> <td> O(m log(n+m)) </td> <td> </td> <td> </td> </tr> <tr> <td> </td> <td> <code class="computeroutput">interval_maps</code> </td> <td> </td> <td> </td> <td> </td> <td> </td> <td> O(m log(n+m)) </td> <td> O(m log(n+m)) </td> </tr> </tbody> </table></div> </div> Adding an element or element value pair is always done in logarithmic time, where n is the number of intervals in the interval container. The same row of complexities applies to the insertion of a segment (an interval or an interval value pair) in the best case, where the inserted segment does overlap with only a small number of intervals in the container. In the worst case, where the inserted segment overlaps with all intervals in the container, the algorithms iterate over all the overlapped segments. Using inplace manipulations of segments and hinted inserts, it is possible to perform all necessary operations on each iteration step in constant time. This results in linear worst case time complexity for segment addition for all interval containers. After performing a worst case addition for an <code class="computeroutput"><a class="link" href="../../boost/icl/interval_set.html" title="Class template interval_set">interval_set</a></code> or a <code class="computeroutput"><a class="link" href="../../boost/icl/separate_interval_set.html" title="Class template separate_interval_set">separate_interval_sets</a></code> adding an interval that overlaps n intervals, we need n non overlapping additions of logarithmic time before we can launch another O(n) worst case addition. So we have only a logarithmic amortized time for the addition of an interval or interval value pair. For the addition of interval containers complexity is O(m log(n+m)). So for the worst case, where the container sizes n and m are equal and both containers cover the same ranges, the complexity of container addition is loglinear. For other cases, that occur frequently in real world applications performance can be much better. If the added container <code class="computeroutput">operand</code> is much smaller than <code class="computeroutput">object</code> and the intervals in <code class="computeroutput">operand</code> are relatively small, performance can be logarithmic. If m is small compared with n and intervals in <code class="computeroutput">operand</code> are large, performance tends to be linear. </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 © 2007 -2010 Joachim Faulhaber Copyright © 1999 -2006 Cortex Software GmbH Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) </div></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="../implementation.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../implementation.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_and_infix_operators.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html>