TAPsHEFaceList.hpp

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)
******************************************************************************/
#ifndef TAPs_HE_FACE_LIST_HPP
#define TAPs_HE_FACE_LIST_HPP

#include "TAPsHEFace.hpp"

BEGIN_NAMESPACE_TAPs
//=============================================================================
template <typename T>
class HEFaceList {
//=============================================================================
// DATA MEMBERS
//=============================================================================
protected:
    int         m_iLength;  // number of nodes in the list
    HEFace<T> * pHead;      // ptr to header node
    HEFace<T> * pTail;      // ptr to tail node
    HEFace<T> * pCurrent;   // ptr to a (current) node in the list
//=============================================================================
// MEMBER FUNCTIONS
//=============================================================================
public:
    //-------------------------------------------------------------------------
    // Constructor(s) and Destructor
    HEFaceList ();
    virtual ~HEFaceList ();
    //-------------------------------------------------------------------------
    // Operations
    inline int Length () const  { return m_iLength; }
    inline int Size () const    { return m_iLength; }
    inline bool IsEmpty () const { return pHead == NULL ? true : false; }
    //inline HEFace<T> * Head ()    const   { return pHead; }
    //inline HEFace<T> * Tail ()    const   { return pTail; }
    inline HEFace<T> * Current ()   const   { return pCurrent; }
    inline void        Current ( HEFace<T> * const n ) { pCurrent = n; }
    inline HEFace<T> * Head ()  { pCurrent = pHead; return pCurrent; }
    inline HEFace<T> * Tail ()  { pCurrent = pTail; return pCurrent; }
    inline HEFace<T> * NextCurrent () { pCurrent = pCurrent->Next(); return pCurrent; }
    inline HEFace<T> * PrevCurrent () { pCurrent = pCurrent->Prev(); return pCurrent; }
    inline bool IsHead () const { return pHead == pCurrent ? true : false; }
    inline bool IsTail () const { return pTail == pCurrent ? true : false; }
    void InsertBefore ( HEFace<T> * const n );  // insert before pCurrent
    void InsertAfter  ( HEFace<T> * const n );  // insert after pCurrent
    void Prepend ( HEFace<T> * const n );   // insert at head
    void Append  ( HEFace<T> * const n );   // insert at tail
    //-------------------------------------------
    // Caution pVertex must be from this list, 
    // otherwise run time error will surely occur!
    inline HEFace<T> * Remove  ();                  // remove at pCurrent
    HEFace<T> * Remove ( HEFace<T> * pFace );       // remove pFace
    inline void Delete ( HEFace<T> * pFace );       // delete pFace
    //-------------------------------------------------------------------------
}; // END CLASS HEFaceList
//=============================================================================
END_NAMESPACE_TAPs
//-----------------------------------------------------------------------------
// Include definition if TAPs_USE_EXPORT is not defined
//#if !defined( TAPs_USE_EXPORT )
    #include "TAPsHEFaceList.cpp"
//#endif
//-----------------------------------------------------------------------------
#endif
//345678901234567890123456789012345678901234567890123456789012345678901234567890
//--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8