TAPsHEFaceList.cpp

Go to the documentation of this file.

/******************************************************************************
TAPsHEFaceList.hpp

Class HEFaceList is a doubly linked list for HEFace (half-edge node).

SUKITTI PUNAK   (04/05/2005)
UPDATE          (04/10/2005)
******************************************************************************/
#include "TAPsHEFaceList.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>
HEFaceList<T>::HEFaceList ()
    : m_iLength( 0 ),
    pHead( NULL ), pTail( NULL ), pCurrent( NULL )
{}
//=============================================================================
// Destructor
//-----------------------------------------------------------------------------
template <typename T>
HEFaceList<T>::~HEFaceList ()
{
    HEFace<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 HEFaceList<T>::InsertBefore ( HEFace<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 HEFaceList<T>::InsertAfter ( HEFace<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 HEFaceList<T>::Prepend ( HEFace<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 HEFaceList<T>::Append ( HEFace<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>
HEFace<T> * HEFaceList<T>::Remove ()
{
    return Remove( pCurrent );
}
/*
//-----------------------------------------------------------------------------
// Remove this face
template <typename T>
HEFace<T> * HEFaceList<T>::Remove ( HEFace<T> *thisFace )
{
    pCurrent = pHead;
    while ( pCurrent != thisFace && pCurrent != NULL ) {
        pCurrent = pCurrent->Next();
    }
    return Remove();
}
//*/
//-----------------------------------------------------------------------------
// Remove this face
template <typename T>
HEFace<T> * HEFaceList<T>::Remove ( HEFace<T> * pFace )
{
    //---------------------------------------------------------------
    // case empty list
    if ( pFace == NULL ) return NULL;
    //---------------------------------------------------------------
    HEFace<T> *tmp = pFace;
    //---------------------------------------------------------------
    // case one element list
    if ( pHead == pTail && pFace == pHead ) {
        //std::cout << "// case one element list" << std::endl;
        pFace = pHead = pTail = NULL;   // make list empty
        m_iLength = 0;                  // size is zero
        return tmp;
    }
    //---------------------------------------------------------------
    // case pFace == pHead
    else if ( pHead == pFace ) {
        //std::cout << "// case pFace == pHead" << std::endl;
        pFace = pHead = pHead->Next();
        pHead->Prev( NULL );
    }
    //---------------------------------------------------------------
    // case pFace == pTail
    else if ( pTail == pFace ) {
        //std::cout << "// case pFace == pTail" << std::endl;
        pFace = pTail = pTail->Prev();
        pTail->Next( NULL );
    }
    //---------------------------------------------------------------
    // case between pHead and pTail
    else {
        //std::cout << "// case between pHead and pTail" << std::endl;
        pFace = pFace->Next();
        tmp->Prev()->Next( pFace );
        pFace->Prev( tmp->Prev() );
    }
    //---------------------------------------------------------------
    tmp->Prev( NULL );
    tmp->Next( NULL );
    --m_iLength;

    //std::cout << "Size: " << m_iLength << std::endl;

    return tmp;
}
//-----------------------------------------------------------------------------
// Delete pVertex
template <typename T>
void HEFaceList<T>::Delete ( HEFace<T> * pFace )
{
    HEFace<T> * removeItem = Remove( pFace );
    if ( removeItem )   delete removeItem;
}
//-----------------------------------------------------------------------------
//=============================================================================
END_NAMESPACE_TAPs
//345678901234567890123456789012345678901234567890123456789012345678901234567890
//--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8