KDevelop::ConvenientEmbeddedSetIterator< Data, Handler > Class Template Reference

Convenient iterator that automatically skips invalid/free items in the array. More...

#include <convenientfreelist.h>

Inheritance diagram for KDevelop::ConvenientEmbeddedSetIterator< Data, Handler >:

[legend]

List of all members.

Public Member Functions
	ConvenientEmbeddedSetIterator (const Data *data=0, uint count=0, int centralFreeItem=-1)
	operator bool () const
const Data &	operator* () const
ConvenientEmbeddedSetIterator &	operator++ ()
const Data *	operator-> () const
Protected Member Functions
void	moveToValid ()
Protected Attributes
uint	m_pos

---

Detailed Description

template<class Data, class Handler>
class KDevelop::ConvenientEmbeddedSetIterator< Data, Handler >

Convenient iterator that automatically skips invalid/free items in the array.

Definition at line 154 of file convenientfreelist.h.

---

Member Function Documentation

template<class Data, class Handler>

KDevelop::ConvenientEmbeddedSetIterator< Data, Handler >::operator bool

(

)

const [inline]

Returns true of this iterator has a value to return.

Reimplemented in KDevelop::ConvenientEmbeddedSetFilterIterator< Data, Handler, Data2, Handler2, KeyExtractor >, and KDevelop::ConvenientEmbeddedSetTreeFilterIterator< Data, Handler, Data2, TreeSet, KeyExtractor >.

Definition at line 162 of file convenientfreelist.h.

---

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

• convenientfreelist.h