QMutableSetIterator< T > Class Template Reference

#include <qset.h>

Class Description

template<typename T>
class QMutableSetIterator< T >

Definition at line 333 of file qset.h.

Public Member Functions
	QMutableSetIterator (QSet< T > &container)
	~QMutableSetIterator ()
QMutableSetIterator &	operator= (QSet< T > &container)
void	toFront ()
void	toBack ()
bool	hasNext () const
const T &	next ()
const T &	peekNext () const
bool	hasPrevious () const
const T &	previous ()
const T &	peekPrevious () const
void	remove ()
const T &	value () const
bool	findNext (const T &t)
bool	findPrevious (const T &t)

Constructor & Destructor Documentation

QMutableSetIterator ( QSet< T > &  container )

inline

Definition at line 341 of file qset.h.

        : c(&container)
    { c->setSharable(false); i = c->begin(); n = c->end(); }

~QMutableSetIterator ( )

inline

Definition at line 344 of file qset.h.

    { c->setSharable(true); }

Member Function Documentation

QMutableSetIterator& operator= ( QSet< T > &  container )

inline

Definition at line 346 of file qset.h.

    { c->setSharable(true); c = &container; c->setSharable(false);
      i = c->begin(); n = c->end(); return *this; }

void toFront ( )

inline

Definition at line 349 of file qset.h.

{ i = c->begin(); n = c->end(); }

void toBack ( )

inline

Definition at line 350 of file qset.h.

{ i = c->end(); n = i; }

bool hasNext ( ) const

inline

Definition at line 351 of file qset.h.

{ return c->constEnd() != i; }

const T& next ( )

inline

Definition at line 352 of file qset.h.

{ n = i++; return *n; }

const T& peekNext ( ) const

inline

Definition at line 353 of file qset.h.

{ return *i; }

bool hasPrevious ( ) const

inline

Definition at line 354 of file qset.h.

{ return c->constBegin() != i; }

const T& previous ( )

inline

Definition at line 355 of file qset.h.

{ n = --i; return *n; }

const T& peekPrevious ( ) const

inline

Definition at line 356 of file qset.h.

{ iterator p = i; return *--p; }

void remove ( )

inline

Definition at line 357 of file qset.h.

    { if (c->constEnd() != n) { i = c->erase(n); n = c->end(); } }

const T& value ( ) const

inline

Definition at line 359 of file qset.h.

{ Q_ASSERT(item_exists()); return *n; }

bool findNext ( const T &  t )

inline

Definition at line 360 of file qset.h.

    { while (c->constEnd() != (n = i)) if (*i++ == t) return true; return false; }

bool findPrevious ( const T &  t )

inline

Definition at line 362 of file qset.h.

    { while (c->constBegin() != i) if (*(n = --i) == t) return true;
      n = c->end(); return false;  }

---

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

• QtCore/qset.h