HEVertexList< T > Class Template Reference

#include <TAPsHEVertexList.hpp>

List of all members.

Public Member Functions
void	Append (HEVertex< T > *const n)
HEVertex< T > *	Current () const
void	Delete (HEVertex< T > *pVertex)
HEVertex< T > *	Head ()
	HEVertexList ()
void	InsertAfter (HEVertex< T > *const n)
void	InsertBefore (HEVertex< T > *const n)
bool	IsEmpty () const
bool	IsHead () const
bool	IsTail () const
int	Length () const
HEVertex< T > *	NextCurrent ()
void	Prepend (HEVertex< T > *const n)
HEVertex< T > *	PrevCurrent ()
HEVertex< T > *	Remove (HEVertex< T > *pVertex)
HEVertex< T > *	Remove ()
int	Size () const
HEVertex< T > *	Tail ()
virtual	~HEVertexList ()
Protected Attributes
int	m_iLength
HEVertex< T > *	pCurrent
HEVertex< T > *	pHead
HEVertex< T > *	pTail

---

Detailed Description

template<typename T>
class HEVertexList< T >

Definition at line 18 of file TAPsHEVertexList.hpp.

---

Constructor & Destructor Documentation

template<typename T>

BEGIN_NAMESPACE_TAPs HEVertexList< T >::HEVertexList

(

)

[inline]

Definition at line 20 of file TAPsHEVertexList.cpp.

    : m_iLength( 0 ),
      pHead( NULL ), pTail( NULL ), pCurrent( NULL )
{}

template<typename T>

HEVertexList< T >::~HEVertexList

(

)

[inline, virtual]

Definition at line 28 of file TAPsHEVertexList.cpp.

{
    HEVertex<T> *tmp;
    pCurrent = pHead;
    while ( pHead != NULL ) {
        tmp = Remove();
        if ( tmp != NULL ) delete tmp;
    }
    m_iLength = 0;
}

---

Member Function Documentation

template<typename T>

void HEVertexList< T >::Append

(

HEVertex< T > *const

n

)

[inline]

Definition at line 115 of file TAPsHEVertexList.cpp.

{
    // 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;
    }
}

template<typename T>

HEVertex<T>* HEVertexList< T >::Current

(

)

const [inline]

Definition at line 60 of file TAPsHEVertexList.hpp.

{ return pCurrent; }

template<typename T>

void HEVertexList< T >::Delete

(

HEVertex< T > *

pVertex

)

[inline]

Definition at line 225 of file TAPsHEVertexList.cpp.

{
    HEVertex<T> * removeItem = Remove( pVertex );
    if ( removeItem )   delete removeItem;
}

template<typename T>

HEVertex<T>* HEVertexList< T >::Head

(

)

[inline]

Definition at line 62 of file TAPsHEVertexList.hpp.

{ pCurrent = pHead; return pCurrent; }

template<typename T>

void HEVertexList< T >::InsertAfter

(

HEVertex< T > *const

n

)

[inline]

Definition at line 64 of file TAPsHEVertexList.cpp.

{
    // 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;
    }
}

template<typename T>

void HEVertexList< T >::InsertBefore

(

HEVertex< T > *const

n

)

[inline]

Definition at line 43 of file TAPsHEVertexList.cpp.

                                                           {
    // 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 );
    }
}

template<typename T>

bool HEVertexList< T >::IsEmpty

(

)

const [inline]

Definition at line 57 of file TAPsHEVertexList.hpp.

{ return pHead == NULL ? true : false; }

template<typename T>

bool HEVertexList< T >::IsHead

(

)

const [inline]

Definition at line 66 of file TAPsHEVertexList.hpp.

{ return pHead == pCurrent ? true : false; }

template<typename T>

bool HEVertexList< T >::IsTail

(

)

const [inline]

Definition at line 67 of file TAPsHEVertexList.hpp.

{ return pTail == pCurrent ? true : false; }

template<typename T>

int HEVertexList< T >::Length

(

)

const [inline]

Definition at line 55 of file TAPsHEVertexList.hpp.

{ return m_iLength; }

template<typename T>

HEVertex<T>* HEVertexList< T >::NextCurrent

(

)

[inline]

Definition at line 64 of file TAPsHEVertexList.hpp.

{ pCurrent = pCurrent->Next(); return pCurrent; }

template<typename T>

void HEVertexList< T >::Prepend

(

HEVertex< T > *const

n

)

[inline]

Definition at line 94 of file TAPsHEVertexList.cpp.

{
    // 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;
    }
}

template<typename T>

HEVertex<T>* HEVertexList< T >::PrevCurrent

(

)

[inline]

Definition at line 65 of file TAPsHEVertexList.hpp.

{ pCurrent = pCurrent->Prev(); return pCurrent; }

template<typename T>

HEVertex< T > * HEVertexList< T >::Remove

(

HEVertex< T > *

pVertex

)

[inline]

Definition at line 180 of file TAPsHEVertexList.cpp.

{
    // 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
}

template<typename T>

HEVertex< T > * HEVertexList< T >::Remove

(

)

[inline]

Definition at line 136 of file TAPsHEVertexList.cpp.

{
    return Remove( pCurrent );

    /*
    // case empty list
    if ( pCurrent == NULL ) return NULL;
    //---------------------------------------------------------------
    HEVertex<T> *tmp = pCurrent;
    //-----------------------------------------------------
    // case one element list
    if ( pHead == pTail && pCurrent == pHead ) {
        pCurrent = pHead = pTail = NULL;    // make list empty
        m_iLength = 0;                      // size is zero
        return tmp;
    }
    //-----------------------------------------------------
    // case pCurrent == pHead
    else if ( pHead == pCurrent ) {
        pCurrent = pHead = pHead->Next();   // change current and head to next item
        pHead->Prev( NULL );                // set head prev point to null
    }
    //-----------------------------------------------------
    // case pCurrent == pTail
    else if ( pTail == pCurrent ) {
        pCurrent = pTail = pTail->Prev();   // change current and tail to previous item
        pTail->Next( NULL );                // set tail next point to null
    }
    //-----------------------------------------------------
    // case pCurrent is between pHead and pTail
    else {
        pCurrent = pCurrent->Next();
        tmp->Prev()->Next( pCurrent );
        pCurrent->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
    //*/
}

template<typename T>

int HEVertexList< T >::Size

(

)

const [inline]

Definition at line 56 of file TAPsHEVertexList.hpp.

{ return m_iLength; }

template<typename T>

HEVertex<T>* HEVertexList< T >::Tail

(

)

[inline]

Definition at line 63 of file TAPsHEVertexList.hpp.

{ pCurrent = pTail; return pCurrent; }

---

Member Data Documentation

template<typename T>

int HEVertexList< T >::m_iLength [protected]

Definition at line 23 of file TAPsHEVertexList.hpp.

template<typename T>

HEVertex<T>* HEVertexList< T >::pCurrent [protected]

Definition at line 26 of file TAPsHEVertexList.hpp.

template<typename T>

HEVertex<T>* HEVertexList< T >::pHead [protected]

Definition at line 24 of file TAPsHEVertexList.hpp.

template<typename T>

HEVertex<T>* HEVertexList< T >::pTail [protected]

Definition at line 25 of file TAPsHEVertexList.hpp.

---

The documentation for this class was generated from the following files:

• G:/spunak_xp/Works/TAPs/Include/TAPs/GeometricDataStructure/HalfEdge/TAPsHEVertexList.hpp
• G:/spunak_xp/Works/TAPs/Include/TAPs/GeometricDataStructure/HalfEdge/TAPsHEVertexList.cpp