version 1.1, 2006/06/29 17:31:36
|
version 1.1.2.2, 2006/06/30 02:52:01
|
|
|
|
//%2006//////////////////////////////////////////////////////////////////////// |
|
// |
|
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
|
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation, The Open Group. |
|
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; Symantec Corporation; The Open Group. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a copy |
|
// of this software and associated documentation files (the "Software"), to |
|
// deal in the Software without restriction, including without limitation the |
|
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
|
// sell copies of the Software, and to permit persons to whom the Software is |
|
// furnished to do so, subject to the following conditions: |
|
// |
|
// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN |
|
// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED |
|
// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT |
|
// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR |
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |
|
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
|
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION |
|
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
// |
|
//============================================================================== |
|
// |
|
// Author: Mike Brasher (m.brasher@inovadevelopment.com) |
|
// |
|
//%///////////////////////////////////////////////////////////////////////////// |
|
|
|
#include "List.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 |
|
|
|
ListRep::ListRep(void (*destructor)(Linkable*)) : |
|
_magic(PEGASUS_LIST_MAGIC), _front(0), _back(0), _size(0) |
|
{ |
|
if (destructor) |
|
_destructor = destructor; |
|
else |
|
_destructor = 0; |
|
} |
|
|
|
ListRep::~ListRep() |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
|
|
clear(); |
|
#ifdef PEGASUS_LINKABLE_SANITY |
|
memset(this, 0xDD, sizeof(ListRep)); |
|
#endif |
|
} |
|
|
|
void ListRep::clear() |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
|
|
if (_destructor) |
|
{ |
|
for (Linkable* p = _front; p; ) |
|
{ |
|
PEGASUS_LIST_ASSERT(p->magic == PEGASUS_LINKABLE_MAGIC); |
|
Linkable* next = p->next; |
|
_destructor(p); |
|
p = next; |
|
} |
|
|
|
_front = 0; |
|
_back = 0; |
|
_size = 0; |
|
} |
|
} |
|
|
|
void ListRep::insert_front(Linkable* elem) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem != 0); |
|
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem->list == 0); |
|
|
|
elem->list = this; |
|
elem->next = _front; |
|
elem->prev = 0; |
|
|
|
if (_front) |
|
_front->prev = elem; |
|
else |
|
_back = elem; |
|
|
|
_front = elem; |
|
_size++; |
|
} |
|
|
|
void ListRep::insert_back(Linkable* elem) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem != 0); |
|
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem->list == 0); |
|
|
|
elem->list = this; |
|
elem->prev = _back; |
|
elem->next = 0; |
|
|
|
if (_back) |
|
_back->next = elem; |
|
else |
|
_front = elem; |
|
|
|
_back = elem; |
|
_size++; |
|
} |
|
|
|
void ListRep::insert_after( |
|
Linkable* pos, |
|
Linkable* elem) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(pos != 0); |
|
PEGASUS_LIST_ASSERT(elem != 0); |
|
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(pos->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem->list == 0); |
|
|
|
elem->list = this; |
|
elem->prev = pos; |
|
elem->next = pos->next; |
|
|
|
if (pos->next) |
|
pos->next->prev = elem; |
|
|
|
pos->next = elem; |
|
|
|
if (pos == _back) |
|
_back = elem; |
|
|
|
_size++; |
|
} |
|
|
|
void ListRep::insert_before( |
|
Linkable* pos, |
|
Linkable* elem) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(pos != 0); |
|
PEGASUS_LIST_ASSERT(elem != 0); |
|
PEGASUS_LIST_ASSERT(pos->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem->list == 0); |
|
|
|
elem->list = this; |
|
elem->next = pos; |
|
elem->prev = pos->prev; |
|
|
|
if (pos->prev) |
|
pos->prev->next = elem; |
|
|
|
pos->prev = elem; |
|
|
|
if (pos == _front) |
|
_front = elem; |
|
|
|
_size++; |
|
} |
|
|
|
void ListRep::remove(Linkable* pos) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(pos != 0); |
|
PEGASUS_LIST_ASSERT(pos->magic == PEGASUS_LINKABLE_MAGIC); |
|
PEGASUS_LIST_ASSERT(pos->list == this); |
|
PEGASUS_LIST_ASSERT(_size != 0); |
|
|
|
if (_size == 0) |
|
return; |
|
|
|
if (pos->prev) |
|
pos->prev->next = pos->next; |
|
|
|
if (pos->next) |
|
pos->next->prev = pos->prev; |
|
|
|
if (pos == _front) |
|
_front = pos->next; |
|
|
|
if (pos == _back) |
|
_back = pos->prev; |
|
|
|
pos->list = 0; |
|
|
|
_size--; |
|
} |
|
|
|
bool ListRep::contains(const Linkable* elem) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(elem != 0); |
|
PEGASUS_LIST_ASSERT(elem->magic == PEGASUS_LINKABLE_MAGIC); |
|
|
|
return elem && elem->list == this; |
|
|
|
#if 0 |
|
for (const Linkable* p = _front; p; p = p->next) |
|
{ |
|
if (p == elem) |
|
return true; |
|
} |
|
|
|
// Not found! |
|
return false; |
|
#endif |
|
} |
|
|
|
Linkable* ListRep::remove_front() |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
|
|
if (_size == 0) |
|
return 0; |
|
|
|
Linkable* elem = _front; |
|
remove(elem); |
|
|
|
return elem; |
|
} |
|
|
|
Linkable* ListRep::remove_back() |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(_size > 0); |
|
|
|
Linkable* elem = _back; |
|
remove(elem); |
|
|
|
return elem; |
|
} |
|
|
|
Linkable* ListRep::find(ListRep::Equal equal, const void* client_data) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(equal != 0); |
|
|
|
for (Linkable* p = _front; p; p = p->next) |
|
{ |
|
if ((*equal)(p, client_data)) |
|
{ |
|
PEGASUS_LIST_ASSERT(p->magic == PEGASUS_LINKABLE_MAGIC); |
|
return p; |
|
} |
|
} |
|
|
|
// Not found! |
|
return 0; |
|
} |
|
|
|
Linkable* ListRep::remove(ListRep::Equal equal, const void* client_data) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(equal != 0); |
|
|
|
Linkable* p = find(equal, client_data); |
|
|
|
if (p) |
|
{ |
|
PEGASUS_LIST_ASSERT(p->magic == PEGASUS_LINKABLE_MAGIC); |
|
remove(p); |
|
} |
|
|
|
return p; |
|
} |
|
|
|
void ListRep::apply(ListRep::Apply apply, const void* client_data) |
|
{ |
|
PEGASUS_LIST_ASSERT(_magic == PEGASUS_LIST_MAGIC); |
|
PEGASUS_LIST_ASSERT(apply != 0); |
|
|
|
for (Linkable* p = _front; p; p = p->next) |
|
(*apply)(p, client_data); |
|
} |
|
|
|
PEGASUS_NAMESPACE_END |