If you look at the Boost intrusive algorithms you notice that many of them have an option to be used as hook or member.
For smaller algorithms this doesn't really matter as the code is likely to...
Type: Posts; User: TotalTurd
If you look at the Boost intrusive algorithms you notice that many of them have an option to be used as hook or member.
For smaller algorithms this doesn't really matter as the code is likely to...
I'm trying to figure out if there is any benefit of creating a class template where a buffer can be statically allocated, useful for small buffers located on the stack and dynamically allocated...
If you take the following example with all method implementation code inside the class definition.
template<typename T>
class A
{
public:
void SomeMethod()
{
No I have not used serialization and maybe that's what I'm looking for. On receiver side I guess this require parsing the entire packet once first in order to find the members, basically unwinding...
This is for Mach OS/QNX type message IPC and I cannot just serialize like that. I realize the socket word in the original text was misleading. The structures are in memory and will end up in just...
I cannot use that in this case for performance reasons. Otherwise it would have been a good idea. I must send all the data in packet at once and I need to know the size from the beginning. The...
A lot of communication is done by creating packets (for sockets/IPC etc). Often you end up with variable sized packets for example strings in it. For example.
struct StringPacketBase
{...
Because class A should be able to put in a list as well as being able to be used in a hash table, however both the normal list and the hash table use the list implementation. Basically the object...
Since this is an intrusive list class, classes that want to be listable must own their own list data.
I have the following situation:
I have a List class, made up by class ListNode that is inherited in classes that wants to be put in lists.
struct _List_node_base
{
void...