I'm trying to implement a polymorphic data structure e.g. an intrusive linked list (I already know the kernel has one - this is more of learning exper ...
I'm trying to implement a polymorphic data structure e.g. an intrusive linked list (I already know the kernel has one - this is more of learning exper ...
I am porting to C++11 a C code base that makes use of a number of custom intrusive data structures. In C, the usage patterns will typically look like ...
I want to allocate an object exact one time and push it to few lists. How can I do this with boost::intrusive_ptr and boost::intrusive::list? Or shoul ...
I am currently learning a lot about Intrusive Containers. So I often compare them to the standard containers. Let's take the std::list for example. I ...
In the Boost.Intrusive docs in the chapter "When to use?" https://www.boost.org/doc/libs/1_72_0/doc/html/intrusive/usage_when.html, it is stated that ...
Do Boost.Intrusive containers still have performance advantages over non-intrusive standard (std::) ones in the modern C++ (with move semantic, emplac ...
I am learning intrusive list: I understand the basic idea of intrusive list, but I cannot understand why push_back requires lvalue specifically. Fr ...
While reading about kernel data structures in FreeBSD, I stumbled on the MBuf. The MBuf contains a pointer to the next MBuf in a chain of MBuf's, impl ...
Lets say I want to write an intrusive list. I have an intrusive list class template that takes the type and a pointer to the member to use as the node ...
I have two boost intrusive sets which I need to merge it together. I have map_old.m_old_attributes boost intrusive set which I need to merge it to m_m ...
MyClass below represents a data structure that I need to be able to search very fast in two ways. So say I store the MyClass in and std::vector so tha ...
I have the following program. I built it with gcc-4.9.2 under linux. My questions are: 1) Why does the hashtable seem to be sorted the first time aro ...
So I'm writing an event handling system using FastDelegate<> and the boost library. I need to setup a Queue of shared pointers to event data as ...
I've declared the following node which inherits from boost::intrusive::slist_base_hook<> : declaration of the list which contains these node ...
While working boost intrusive container splay_set, i have to reset local iterator member variables. Please see sample code below - Intrusive contai ...
I have progressed greatly in my understanding of intrusive containers. I have a program that runs for a "while", and then on a line of code like this ...
if I uncomment these outside the loop and comment out the ones inside the loop it crashes. I need to be able to have the baselist (and memberlist) ...
The boost documentation (http://www.boost.org/doc/libs/1_55_0/doc/html/intrusive.html) states that the intrusive containers are implemented for list ( ...
I once heard that it is possible to map the Boost shared_ptr or intrusive_ptr reference add and release functions to my own implementations of add and ...
I'm working on a C project which defines a hash.h header, containing an intrusive hash structure and its interface, as well as a list.h header contain ...