IntrusiveTwoDListIter< ElementT, ReturnT > Class Template Reference

Iterator over two intrusive doubly-linked lists. More...

#include <IntrusiveDList.h>

List of all members.

Public Member Functions
	IntrusiveTwoDListIter ()
	IntrusiveTwoDListIter (ElementT *list1, ElementT *list2)
virtual	~IntrusiveTwoDListIter ()
void	operator++ ()
ReturnT *	operator-> () const
	operator ReturnT * () const
ReturnT &	operator * () const
bool	operator== (IntrusiveTwoDListIter const &other) const
Protected Member Functions
virtual ReturnT *	getReturnElement (ElementT *element) const=0
	Returns a pointer to the return element corresponding to the element that the iterator is currently positioned at.
Private Attributes
ElementT *	curr
	Pointer to the current list element.
ElementT *	next
	Pointer to the start of the second list.
bool	processingNext
	True if the first list has been walked.

---

Detailed Description

template<class ElementT, class ReturnT>
class IntrusiveTwoDListIter< ElementT, ReturnT >

Iterator over two intrusive doubly-linked lists.

The first list is walked followed by the second list. The lists can only be walked over in the forward direction.

Elements in both lists are all of the same type. A callback method must be defined that determines what should be returned for each element in the lists.

Definition at line 153 of file IntrusiveDList.h.

---

Constructor & Destructor Documentation

template<class ElementT, class ReturnT>

IntrusiveTwoDListIter< ElementT, ReturnT >::IntrusiveTwoDListIter

(

)

[inline, explicit]

Definition at line 184 of file IntrusiveDList.h.

    {
        curr = NULL;
        next = NULL;
        processingNext = false;
    }

template<class ElementT, class ReturnT>

IntrusiveTwoDListIter< ElementT, ReturnT >::IntrusiveTwoDListIter	(	ElementT *	list1,
		ElementT *	list2
	)			[inline, explicit]

Definition at line 191 of file IntrusiveDList.h.

    {
        if (list1 == NULL) {
            curr = list2;
            processingNext = true;
        } else {
            curr = list1;
            next = list2;
            processingNext = false;
        }
    }

template<class ElementT, class ReturnT>

virtual IntrusiveTwoDListIter< ElementT, ReturnT >::~IntrusiveTwoDListIter

(

)

[inline, virtual]

Definition at line 203 of file IntrusiveDList.h.

    {
    }

---

Member Function Documentation

template<class ElementT, class ReturnT>

virtual ReturnT* IntrusiveTwoDListIter< ElementT, ReturnT >::getReturnElement

(

ElementT *

element

)

const [protected, pure virtual]

Returns a pointer to the return element corresponding to the element that the iterator is currently positioned at.

Parameters:

element

the current element

Returns:

pointer to the return element

Implemented in TwoQPageListIter< PageT >, and TwoQDirtyPageListIter< PageT >.

Referenced by IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator *(), IntrusiveTwoDListIter< ElementT, ReturnT >::operator ReturnT *(), and IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator->().

template<class ElementT, class ReturnT>

void IntrusiveTwoDListIter< ElementT, ReturnT >::operator++

(

)

[inline]

Definition at line 207 of file IntrusiveDList.h.

    {
        curr = static_cast<ElementT *>(curr->getNext());
        if (curr == NULL && !processingNext) {
            curr = next;
            processingNext = true;
        }
    }

template<class ElementT, class ReturnT>

ReturnT* IntrusiveTwoDListIter< ElementT, ReturnT >::operator->

(

)

const [inline]

Definition at line 216 of file IntrusiveDList.h.

    {
        return getReturnElement(curr);
    }

template<class ElementT, class ReturnT>

IntrusiveTwoDListIter< ElementT, ReturnT >::operator ReturnT *

(

)

const [inline]

Definition at line 221 of file IntrusiveDList.h.

References IntrusiveTwoDListIter< ElementT, ReturnT >::curr, and IntrusiveTwoDListIter< ElementT, ReturnT >::getReturnElement().

    {
        return getReturnElement(curr);
    }

template<class ElementT, class ReturnT>

ReturnT& IntrusiveTwoDListIter< ElementT, ReturnT >::operator *

(

)

const [inline]

Definition at line 226 of file IntrusiveDList.h.

    {
        return *(getReturnElement(curr));
    }

template<class ElementT, class ReturnT>

bool IntrusiveTwoDListIter< ElementT, ReturnT >::operator==

(

IntrusiveTwoDListIter< ElementT, ReturnT > const &

other

)

const [inline]

Definition at line 231 of file IntrusiveDList.h.

    {
        return curr == other.curr;
    }

---

Member Data Documentation

template<class ElementT, class ReturnT>

ElementT* IntrusiveTwoDListIter< ElementT, ReturnT >::curr [private]

Pointer to the current list element.

Definition at line 158 of file IntrusiveDList.h.

Referenced by IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::IntrusiveTwoDListIter(), IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator *(), IntrusiveTwoDListIter< ElementT, ReturnT >::operator ReturnT *(), IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator++(), IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator->(), and IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator==().

template<class ElementT, class ReturnT>

ElementT* IntrusiveTwoDListIter< ElementT, ReturnT >::next [private]

Pointer to the start of the second list.

Definition at line 163 of file IntrusiveDList.h.

Referenced by IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::IntrusiveTwoDListIter(), and IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator++().

template<class ElementT, class ReturnT>

bool IntrusiveTwoDListIter< ElementT, ReturnT >::processingNext [private]

True if the first list has been walked.

Definition at line 168 of file IntrusiveDList.h.

Referenced by IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::IntrusiveTwoDListIter(), and IntrusiveTwoDListIter< TwoQDirtyPage, PageT >::operator++().

---

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

• /home/pub/open/dev/fennel/common/IntrusiveDList.h

---