|
static void * | operator new (size_t size) |
|
static void * | operator new (size_t size, Root &root) |
|
static void * | operator new (size_t size, Root *root) |
|
static void * | operator new[] (size_t size) |
|
static void * | operator new[] (size_t size, Root &root) |
|
static void * | operator new[] (size_t size, Root *root) |
|
static void | operator delete (void *) |
|
static void | operator delete (void *, Root &) |
|
static void | operator delete (void *, Root *) |
|
static void | operator delete[] (void *) |
|
static void | operator delete[] (void *, Root &) |
|
static void | operator delete[] (void *, Root *) |
|
Definition at line 110 of file sql_list.h.
drizzled::base_list::base_list |
( |
const base_list & |
tmp) | |
|
|
inline |
This is a shallow copy constructor that implicitly passes the ownership from the source list to the new instance. The old instance is not updated, so both objects end up sharing the same nodes. If one of the instances then adds or removes a node, the other becomes out of sync ('last' pointer), while still operational. Some old code uses and relies on this behaviour. This logic is quite tricky: please do not use it in any new code.
Definition at line 128 of file sql_list.h.
void drizzled::base_list::swap |
( |
base_list & |
rhs) | |
|
|
inline |
The documentation for this class was generated from the following file: