Boost C++ Libraries: Ticket #2740: thread_group::size complexity https://svn.boost.org/trac10/ticket/2740 <p> The current implementation could have O(n) complexity due to the use of std::list. Even if we would have thread_group with no too many threads, it sounds extraneous to me to have a function size without constant complexity. As your implementation do not needs splice, what do you think about having a thread_group::size with constant complexity by adding an internal counter for example? </p> en-us Boost C++ Libraries /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/2740 Trac 1.4.3 viboes Fri, 11 Jun 2010 08:39:45 GMT status changed; resolution set https://svn.boost.org/trac10/ticket/2740#comment:1 https://svn.boost.org/trac10/ticket/2740#comment:1 <ul> <li><strong>status</strong> <span class="trac-field-old">new</span> → <span class="trac-field-new">closed</span> </li> <li><strong>resolution</strong> → <span class="trac-field-new">wontfix</span> </li> </ul> <p> As discussed on the Boost ML, the number of threads in a group should be reduced, so the the cost of a linear size should be negligible. In addition the modification will add more complexity to the usual case. </p> <p> So I don't think anymore this feature is interesting. </p> Ticket