version 1.1.2.6, 2006/06/30 20:07:50
|
version 1.3, 2006/11/10 18:14:58
|
|
|
// | // |
//============================================================================== | //============================================================================== |
// | // |
// Author: Mike Brasher (m.brasher@inovadevelopment.com) |
|
// |
|
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
#include "List.h" | #include "List.h" |
#include "PegasusAssert.h" | #include "PegasusAssert.h" |
| |
#ifdef PEGASUS_LINKABLE_SANITY |
|
# define PEGASUS_LIST_ASSERT(COND) PEGASUS_ASSERT(COND) |
|
#else |
|
# define PEGASUS_LIST_ASSERT(COND) /* empty */ |
|
#endif |
|
|
|
#define PEGASUS_LIST_MAGIC 0x6456FD0A |
|
|
|
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
| |
ListRep::ListRep(void (*destructor)(Linkable*)) : |
ListRep::ListRep(void (*destructor)(Linkable*)) |
_magic(PEGASUS_LIST_MAGIC), _front(0), _back(0), _size(0) |
: _front(0), _back(0), _size(0) |
{ | { |
if (destructor) | if (destructor) |
_destructor = destructor; | _destructor = destructor; |
|
|
| |
ListRep::~ListRep() | ListRep::~ListRep() |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
| |
clear(); | clear(); |
#ifdef PEGASUS_LINKABLE_SANITY |
#ifdef PEGASUS_DEBUG |
memset(this, 0xDD, sizeof(ListRep)); | memset(this, 0xDD, sizeof(ListRep)); |
#endif | #endif |
} | } |
| |
void ListRep::clear() | void ListRep::clear() |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
| |
if (_destructor) | if (_destructor) |
{ | { |
|
|
| |
for (Linkable* p = front; p; ) | for (Linkable* p = front; p; ) |
{ | { |
PEGASUS_LIST_ASSERT(p->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(p->magic); |
Linkable* next = p->next; | Linkable* next = p->next; |
p->list = 0; | p->list = 0; |
_destructor(p); | _destructor(p); |
|
|
| |
void ListRep::insert_front(Linkable* elem) | void ListRep::insert_front(Linkable* elem) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(elem != 0); |
PEGASUS_DEBUG_ASSERT(elem != 0); |
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(elem->magic); |
PEGASUS_LIST_ASSERT(elem->list == 0); |
PEGASUS_DEBUG_ASSERT(elem->list == 0); |
| |
elem->list = this; | elem->list = this; |
elem->next = _front; | elem->next = _front; |
|
|
| |
void ListRep::insert_back(Linkable* elem) | void ListRep::insert_back(Linkable* elem) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(elem != 0); |
PEGASUS_DEBUG_ASSERT(elem != 0); |
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(elem->magic); |
PEGASUS_LIST_ASSERT(elem->list == 0); |
PEGASUS_DEBUG_ASSERT(elem->list == 0); |
| |
elem->list = this; | elem->list = this; |
elem->prev = _back; | elem->prev = _back; |
|
|
Linkable* pos, | Linkable* pos, |
Linkable* elem) | Linkable* elem) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(pos != 0); |
PEGASUS_DEBUG_ASSERT(pos != 0); |
PEGASUS_LIST_ASSERT(elem != 0); |
PEGASUS_DEBUG_ASSERT(elem != 0); |
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(elem->magic); |
PEGASUS_LIST_ASSERT(pos->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(pos->magic); |
PEGASUS_LIST_ASSERT(elem->list == 0); |
PEGASUS_DEBUG_ASSERT(elem->list == 0); |
| |
elem->list = this; | elem->list = this; |
elem->prev = pos; | elem->prev = pos; |
|
|
Linkable* pos, | Linkable* pos, |
Linkable* elem) | Linkable* elem) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(pos != 0); |
PEGASUS_DEBUG_ASSERT(pos != 0); |
PEGASUS_LIST_ASSERT(elem != 0); |
PEGASUS_DEBUG_ASSERT(elem != 0); |
PEGASUS_LIST_ASSERT(pos->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(pos->magic); |
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(elem->magic); |
PEGASUS_LIST_ASSERT(elem->list == 0); |
PEGASUS_DEBUG_ASSERT(elem->list == 0); |
| |
elem->list = this; | elem->list = this; |
elem->next = pos; | elem->next = pos; |
|
|
| |
void ListRep::remove(Linkable* pos) | void ListRep::remove(Linkable* pos) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(pos != 0); |
PEGASUS_DEBUG_ASSERT(pos != 0); |
PEGASUS_LIST_ASSERT(pos->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(pos->magic); |
PEGASUS_LIST_ASSERT(pos->list == this); |
PEGASUS_DEBUG_ASSERT(pos->list == this); |
PEGASUS_LIST_ASSERT(_size != 0); |
PEGASUS_DEBUG_ASSERT(_size != 0); |
| |
if (_size == 0) | if (_size == 0) |
return; | return; |
|
|
| |
bool ListRep::contains(const Linkable* elem) | bool ListRep::contains(const Linkable* elem) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(elem != 0); |
PEGASUS_DEBUG_ASSERT(elem != 0); |
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(elem->magic); |
| |
for (const Linkable* p = _front; p; p = p->next) | for (const Linkable* p = _front; p; p = p->next) |
{ | { |
|
|
| |
Linkable* ListRep::remove_front() | Linkable* ListRep::remove_front() |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
| |
if (_size == 0) | if (_size == 0) |
return 0; | return 0; |
|
|
| |
Linkable* ListRep::remove_back() | Linkable* ListRep::remove_back() |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(_size > 0); |
PEGASUS_DEBUG_ASSERT(_size > 0); |
| |
Linkable* elem = _back; | Linkable* elem = _back; |
remove(elem); | remove(elem); |
|
|
| |
Linkable* ListRep::find(ListRep::Equal equal, const void* client_data) | Linkable* ListRep::find(ListRep::Equal equal, const void* client_data) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(equal != 0); |
PEGASUS_DEBUG_ASSERT(equal != 0); |
| |
for (Linkable* p = _front; p; p = p->next) | for (Linkable* p = _front; p; p = p->next) |
{ | { |
if ((*equal)(p, client_data)) | if ((*equal)(p, client_data)) |
{ | { |
PEGASUS_LIST_ASSERT(p->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(p->magic); |
return p; | return p; |
} | } |
} | } |
|
|
| |
Linkable* ListRep::remove(ListRep::Equal equal, const void* client_data) | Linkable* ListRep::remove(ListRep::Equal equal, const void* client_data) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(equal != 0); |
PEGASUS_DEBUG_ASSERT(equal != 0); |
| |
Linkable* p = find(equal, client_data); | Linkable* p = find(equal, client_data); |
| |
if (p) | if (p) |
{ | { |
PEGASUS_LIST_ASSERT(p->magic == PEGASUS_LINKABLE_MAGIC); |
PEGASUS_DEBUG_ASSERT(p->magic); |
remove(p); | remove(p); |
} | } |
| |
|
|
| |
void ListRep::apply(ListRep::Apply apply, const void* client_data) | void ListRep::apply(ListRep::Apply apply, const void* client_data) |
{ | { |
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
PEGASUS_DEBUG_ASSERT(_magic); |
PEGASUS_LIST_ASSERT(apply != 0); |
PEGASUS_DEBUG_ASSERT(apply != 0); |
| |
for (Linkable* p = _front; p; p = p->next) | for (Linkable* p = _front; p; p = p->next) |
(*apply)(p, client_data); | (*apply)(p, client_data); |