#include <QtCore/qglobal.h>
Go to the source code of this file.
◆ Q_DECLARE_ASSOCIATIVE_FORWARD_ITERATOR
#define Q_DECLARE_ASSOCIATIVE_FORWARD_ITERATOR |
( |
|
C | ) |
|
Value:\
template <class Key, class T> \
{ \
inline
bool item_exists()
const {
return n !=
c.constEnd(); } \
public: \
:
c(container),
i(
c.constBegin()),
n(
c.constEnd()) {} \
inline
Q##
C##Iterator &operator=(
const Q##
C<Key,T> &container) \
{
c = container;
i =
c.constBegin();
n =
c.constEnd();
return *
this; } \
inline
void toFront() {
i =
c.constBegin();
n =
c.constEnd(); } \
inline
void toBack() {
i =
c.constEnd();
n =
c.constEnd(); } \
inline
bool hasNext()
const {
return i !=
c.constEnd(); } \
inline
Item peekNext()
const {
return i; } \
inline
const Key &
key()
const {
Q_ASSERT(item_exists());
return n.key(); } \
inline
bool findNext(
const T &
t) \
{
while ((
n =
i) !=
c.constEnd())
if (*
i++ ==
t)
return true;
return false; } \
};
small capitals from c petite p scientific i
[1]
typename C::const_iterator const_iterator
Definition at line 184 of file qiterator.h.
◆ Q_DECLARE_ASSOCIATIVE_ITERATOR
#define Q_DECLARE_ASSOCIATIVE_ITERATOR |
( |
|
C | ) |
|
Value:\
template <class Key, class T> \
{ \
inline
bool item_exists()
const {
return n !=
c.constEnd(); } \
public: \
:
c(container),
i(
c.constBegin()),
n(
c.constEnd()) {} \
inline
Q##
C##Iterator &operator=(
const Q##
C<Key,T> &container) \
{
c = container;
i =
c.constBegin();
n =
c.constEnd();
return *
this; } \
inline
void toFront() {
i =
c.constBegin();
n =
c.constEnd(); } \
inline
void toBack() {
i =
c.constEnd();
n =
c.constEnd(); } \
inline
bool hasNext()
const {
return i !=
c.constEnd(); } \
inline
Item peekNext()
const {
return i; } \
inline
bool hasPrevious()
const {
return i !=
c.constBegin(); } \
inline
Item previous() {
n = --
i;
return n; } \
inline
const Key &
key()
const {
Q_ASSERT(item_exists());
return n.key(); } \
inline
bool findNext(
const T &
t) \
{
while ((
n =
i) !=
c.constEnd())
if (*
i++ ==
t)
return true;
return false; } \
inline
bool findPrevious(
const T &
t) \
{
while (
i !=
c.constBegin())
if (*(
n = --
i) ==
t)
return true; \
n =
c.constEnd();
return false; } \
};
Definition at line 114 of file qiterator.h.
◆ Q_DECLARE_MUTABLE_ASSOCIATIVE_FORWARD_ITERATOR
#define Q_DECLARE_MUTABLE_ASSOCIATIVE_FORWARD_ITERATOR |
( |
|
C | ) |
|
Value:\
template <class Key, class T> \
class QMutable##
C##Iterator \
{ \
inline
bool item_exists()
const {
return const_iterator(
n) !=
c->constEnd(); } \
public: \
inline QMutable##
C##Iterator(
Q##
C<Key,T> &container) \
{
i =
c->begin();
n =
c->end(); } \
inline QMutable##
C##Iterator &operator=(
Q##
C<Key,T> &container) \
{
c = &container;
i =
c->begin();
n =
c->end();
return *
this; } \
inline
void toFront() {
i =
c->begin();
n =
c->end(); } \
inline
void toBack() {
i =
c->end();
n =
c->end(); } \
inline
Item peekNext()
const {
return i; } \
inline void remove() \
inline
const Key &
key()
const {
Q_ASSERT(item_exists());
return n.key(); } \
inline
bool findNext(
const T &
t) \
};
typename C::iterator iterator
header setValue("Host", "qt-project.org")
Definition at line 210 of file qiterator.h.
◆ Q_DECLARE_MUTABLE_ASSOCIATIVE_ITERATOR
#define Q_DECLARE_MUTABLE_ASSOCIATIVE_ITERATOR |
( |
|
C | ) |
|
◆ Q_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR
#define Q_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR |
( |
|
C | ) |
|
◆ Q_DECLARE_SEQUENTIAL_ITERATOR
#define Q_DECLARE_SEQUENTIAL_ITERATOR |
( |
|
C | ) |
|
Value:\
template <class T> \
{ \
public: \
inline
Q##
C##Iterator(
const Q##
C<T> &container) \
:
c(container),
i(
c.constBegin()) {} \
inline
Q##
C##Iterator &operator=(
const Q##
C<T> &container) \
{
c = container;
i =
c.constBegin();
return *
this; } \
inline
void toFront() {
i =
c.constBegin(); } \
inline
void toBack() {
i =
c.constEnd(); } \
inline
bool hasNext()
const {
return i !=
c.constEnd(); } \
inline
const T &
next() {
return *
i++; } \
inline
const T &peekNext()
const {
return *
i; } \
inline
bool hasPrevious()
const {
return i !=
c.constBegin(); } \
inline
const T &previous() {
return *--
i; } \
inline
bool findNext(
const T &
t) \
{
while (
i !=
c.constEnd())
if (*
i++ ==
t)
return true;
return false; } \
inline
bool findPrevious(
const T &
t) \
{
while (
i !=
c.constBegin())
if (*(--
i) ==
t)
return true; \
return false; } \
};
Definition at line 49 of file qiterator.h.