Boost C++ Libraries: Ticket #12768: Provide intrusive unordered_set with automatic bucket management https://svn.boost.org/trac10/ticket/12768 <p> The current intrusive unordered_set and unordered_multiset containers require the user to manually take care of the bucket management. </p> <p> I've written a wrapper class template that takes care of the bucket management, automatically allocating them and rehashing as the set is growing. However, writing this code is still cumbersome and tricky. </p> <p> Boost intrusive would be more usable and useful if it was providing this kind of functionality out of the box. </p> <p> Consider providing unordered intrusive containers with automatic bucket management. Maybe this can be done by extending the existing unordered_set and unordered_multiset through some template option, or maybe it will require an entirely new class template. </p> <p> Some points to consider: </p> <p> These containers should be default-constructible. A default-constructed container should be valid and empty. Ideally, the default constructor should not dynamically allocate memory. Move and swap operations should be constant-time and no-throw. </p> en-us Boost C++ Libraries /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/12768 Trac 1.4.3 fdegros@… Mon, 27 Feb 2017 05:36:53 GMT <link>https://svn.boost.org/trac10/ticket/12768#comment:1 </link> <guid isPermaLink="false">https://svn.boost.org/trac10/ticket/12768#comment:1</guid> <description> <p> Ping? Any idea or progress on this topic? </p> </description> <category>Ticket</category> </item> <item> <author>fdegros@…</author> <pubDate>Wed, 26 Jul 2017 00:18:44 GMT</pubDate> <title/> <link>https://svn.boost.org/trac10/ticket/12768#comment:2 </link> <guid isPermaLink="false">https://svn.boost.org/trac10/ticket/12768#comment:2</guid> <description> <p> Ping? Any idea or progress on this topic? </p> </description> <category>Ticket</category> </item> </channel> </rss>