TAPsHEVertexList.cpp

Go to the documentation of this file.

/******************************************************************************
TAPsHEVertexList.hpp

Class HEVertexList is a doubly linked list for HEVertex (half-edge node).

SUKITTI PUNAK   (04/05/2005)
UPDATE          (03/25/2010)
******************************************************************************/
#include "TAPsHEVertexList.hpp"
// Using Inclusion Model (i.e. definitions are included in declarations)
//                       (this name.cpp is included in name.hpp)
// Each friend is defined directly inside its declaration.

BEGIN_NAMESPACE_TAPs
//=============================================================================
// Constructor(s)
//-----------------------------------------------------------------------------
template <typename T>
HEVertexList<T>::HEVertexList ()
    : m_iLength( 0 ),
      pHead( NULL ), pTail( NULL ), pCurrent( NULL )
{}
//=============================================================================
// Destructor
//-----------------------------------------------------------------------------
template <typename T>
HEVertexList<T>::~HEVertexList ()
{
    HEVertex<T> *tmp;
    while ( pHead != NULL ) {
        pCurrent = pHead;
        tmp = Remove();
        if ( tmp != NULL ) delete tmp;
    }
    m_iLength = 0;
}
//=============================================================================
// Operations
//-----------------------------------------------------------------------------
// Insert after pCurrent
template <typename T>
void HEVertexList<T>::InsertBefore ( HEVertex<T> * const n ) {
    // case empty list
    if ( pHead == NULL ) {
        pCurrent = pHead = pTail = n;
        n->Next( NULL );
        n->Prev( NULL );
        ++m_iLength;
    }
    // case pCurrent == pHead
    else if ( pCurrent == pHead ) {
        Prepend( n );
    }
    // case non-empty list
    else {
        pCurrent = pCurrent->Prev();
        InsertAfter( n );
    }
}
//-----------------------------------------------------------------------------
// Insert after pCurrent
template <typename T>
void HEVertexList<T>::InsertAfter ( HEVertex<T> * const n )
{
    // case empty list
    if ( pHead == NULL ) {
        pCurrent = pHead = pTail = n;
        n->Next( NULL );
        n->Prev( NULL );
        ++m_iLength;
    }
    // case pCurrent == pTail
    else if ( pCurrent == pTail ) {
        Append( n );
        //n->Prev( pCurrent );
        //n->Next( NULL );
        //pCurrent->Next( n );
        //pCurrent = pTail = n;
    }
    // case pCurrent != pTail
    else {
        n->Prev( pCurrent );
        n->Next( pCurrent->Next() );
        n->Next()->Prev( n );
        pCurrent->Next( n );
        pCurrent = n;
        ++m_iLength;
    }
}
//-----------------------------------------------------------------------------
// Insert at head
template <typename T>
void HEVertexList<T>::Prepend ( HEVertex<T> * const n )
{
    // case empty list
    if ( pHead == NULL ) {
        pCurrent = pHead = pTail = n;
        n->Next( NULL );
        n->Prev( NULL );
        ++m_iLength;
    }
    // case non-empty list
    else {
        n->Prev( NULL );
        n->Next( pHead );
        pHead->Prev( n );
        pHead = n;
        ++m_iLength;
    }
}
//-----------------------------------------------------------------------------
// Insert at tail
template <typename T>
void HEVertexList<T>::Append ( HEVertex<T> * const n )
{
    // case empty list
    if ( pHead == NULL ) {
        pCurrent = pHead = pTail = n;
        n->Next( NULL );
        n->Prev( NULL );
        ++m_iLength;
    }
    // case non-empty list
    else {
        n->Prev( pTail );
        n->Next( NULL );
        pTail = n;
        n->Prev()->Next( n );
        ++m_iLength;
    }
}
//-----------------------------------------------------------------------------
// Remove at pCurrent
template <typename T>
HEVertex<T> * HEVertexList<T>::Remove ()
{
    return Remove( pCurrent );
}
//-----------------------------------------------------------------------------
// Remove pVertex
template <typename T>
HEVertex<T> * HEVertexList<T>::Remove ( HEVertex<T> * pVertex )
{
    // case empty list
    if ( pVertex == NULL ) return NULL;
    //---------------------------------------------------------------
    HEVertex<T> *tmp = pVertex;
    //-----------------------------------------------------
    // case one element list
    if ( pHead == pTail && pVertex == pHead ) {
        //std::cout << "TAPsHEVertexList.cpp::Remove(): case one element list\n";
        pVertex = pHead = pTail = NULL; // make list empty
        m_iLength = 0;                  // size is zero
        return tmp;
    }
    //-----------------------------------------------------
    // case pVertex == pHead
    else if ( pHead == pVertex ) {
        //std::cout << "TAPsHEVertexList.cpp::Remove(): case pVertex == pHead\n";
        pVertex = pHead = pHead->Next();    // change current and head to next item
        pHead->Prev( NULL );                // set head prev point to null
    }
    //-----------------------------------------------------
    // case pVertex == pTail
    else if ( pTail == pVertex ) {
        //std::cout << "TAPsHEVertexList.cpp::Remove(): case pVertex == pTail\n";
        pVertex = pTail = pTail->Prev();    // change current and tail to previous item
        pTail->Next( NULL );                // set tail next point to null
    }
    //-----------------------------------------------------
    // case pVertex is between pHead and pTail
    else {
        //std::cout << "TAPsHEVertexList.cpp::Remove(): case pVertex is between pHead and pTail\n";
        pVertex = pVertex->Next();
        tmp->Prev()->Next( pVertex );
        pVertex->Prev( tmp->Prev() );
    }
    //-----------------------------------------------------
    tmp->Prev( NULL );      // isolate tmp by setting its prev and next to null
    tmp->Next( NULL );
    --m_iLength;            // reduce the list size by one
    return tmp;             // return tmp
}
//-----------------------------------------------------------------------------
// Delete pVertex
template <typename T>
void HEVertexList<T>::Delete ( HEVertex<T> * pVertex )
{
    HEVertex<T> * removeItem = Remove( pVertex );
    if ( removeItem )   delete removeItem;
}
//-----------------------------------------------------------------------------
//=============================================================================
END_NAMESPACE_TAPs
//345678901234567890123456789012345678901234567890123456789012345678901234567890
//--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8