QIntCacheIterator(3qt)

📦 version 3.3.8b, in fedora 43, fedora 44

💖 NAME 💖

okay so bestie, this is the manual page for QIntCacheIterator(3qt) — the iterator for QIntCache collections. it's giving "let me walk you through your cache one item at a time" energy. 🦋

✨ SYNOPSIS ✨

#include <qintcache.h>

🎀 Public Members

QIntCacheIterator ( const QIntCache<type> & cache )
QIntCacheIterator ( const QIntCacheIterator<type> & ci )
QIntCacheIterator<type> & operator= ( const QIntCacheIterator<type> & ci )
uint count () const
bool isEmpty () const
bool atFirst () const
bool atLast () const
type * toFirst ()
type * toLast ()
operator type * () const
type * current () const
long currentKey () const
type * operator() ()
type * operator++ ()
type * operator+= ( uint jump )
type * operator-- ()
type * operator-= ( uint jump )

🌸 DESCRIPTION 🌸

so QIntCacheIterator is literally the class that hands you an iterator for QIntCache collections. that's the whole vibe. 💅

heads up bestie: the traversal order is arbitrary — you are not guaranteed any particular order. and if new objects get inserted into the cache while your iterator is active, the iterator may or may not see them. it's giving chaotic, and that's just how it is. 😭

Multiple iterators are completely independent, even when they operate on the same QIntCache. And here's the slay part: QIntCache updates all iterators that refer an item when that item is removed. teamwork, fr fr. 🫶

QIntCacheIterator provides an operator++(), and an operator+=() to traverse the cache; current() and currentKey() to access the current cache item and its key; atFirst() atLast(), which return TRUE if the iterator points to the first/last item in the cache; isEmpty(), which returns TRUE if the cache is empty; and count(), which returns the number of items in the cache. all the essentials, no filler. ✨

one more note, don't skip this one: atFirst() and atLast() refer to the iterator's arbitrary ordering, not to the cache's internal least recently used list. two different things, bestie, do not conflate them. 🙈

See also QIntCache, Collection Classes, and Non-GUI Classes. 👑

👑 MEMBER FUNCTION DOCUMENTATION 👑

💜 QIntCacheIterator::QIntCacheIterator ( const QIntCache<type> & cache )

Constructs an iterator for cache. The current iterator item is set to point to the first item in the cache — or rather, the first item is defined to be the item at which this constructor sets the iterator to point. so like, "first" is whatever this constructor decides, no cap. 🎀

💜 QIntCacheIterator::QIntCacheIterator ( const QIntCacheIterator<type> & ci )

Constructs an iterator for the same cache as ci. The new iterator starts at the same item as ci.current(), but moves independently from there on. twin energy at the start, main character energy after. 🦋

💜 bool QIntCacheIterator::atFirst () const

Returns TRUE if the iterator points to the first item in the cache; otherwise returns FALSE. Note that this refers to the iterator's arbitrary ordering, not to the cache's internal least recently used list. 🫶

See also toFirst() and atLast().

💜 bool QIntCacheIterator::atLast () const

Returns TRUE if the iterator points to the last item in the cache; otherwise returns FALSE. Note that this refers to the iterator's arbitrary ordering, not to the cache's internal least recently used list. same disclaimer, different end of the line. 🌈

See also toLast() and atFirst().

💜 uint QIntCacheIterator::count () const

Returns the number of items in the cache on which this iterator operates. 🍓

See also isEmpty().

💜 type * QIntCacheIterator::current () const

Returns a pointer to the current iterator item. that's it, that's the function. 💅

💜 long QIntCacheIterator::currentKey () const

Returns the key for the current iterator item. 🔑

💜 bool QIntCacheIterator::isEmpty () const

Returns TRUE if the cache is empty; otherwise returns FALSE. vibe check: empty or not. ⭐

See also count().

💜 QIntCacheIterator::operator type * () const

Cast operator. Returns a pointer to the current iterator item. Same as current(). iconic shortcut behavior. ✨

💜 type * QIntCacheIterator::operator() ()

Makes the succeeding item current and returns the original current item. 📌

If the current iterator item was the last item in the cache or if it was 0, 0 is returned. so you get a big fat zero at the end, bestie. 😭

💜 type * QIntCacheIterator::operator++ ()

Prefix ++ makes the iterator point to the item just after current(), and makes it the new current item for the iterator. If current() was the last item, operator--() returns 0.

not me side-eyeing this one: yes, the original really says operator--() there. we're reporting it exactly as written, no edits, no fixes. 🙈

💜 type * QIntCacheIterator::operator+= ( uint jump )

Returns the item jump positions after the current item, or 0 if it is beyond the last item. Makes this the current item. hop hop hop 🐇

💜 type * QIntCacheIterator::operator-- ()

Prefix -- makes the iterator point to the item just before current(), and makes it the new current item for the iterator. If current() was the first item, operator--() returns 0. going backwards is valid and we support it. 💜

💜 type * QIntCacheIterator::operator-= ( uint jump )

Returns the item jump positions before the current item, or 0 if it is beyond the first item. Makes this the current item. rewind time. ⏪

💜 QIntCacheIterator<type> & QIntCacheIterator::operator= ( const QIntCacheIterator<type> & ci )

Makes this an iterator for the same cache as ci. The new iterator starts at the same item as ci.current(), but moves independently thereafter. copy the starting point, not the whole personality. 🎀

💜 type * QIntCacheIterator::toFirst ()

Sets the iterator to point to the first item in the cache and returns a pointer to the item. 🥇

Sets the iterator to 0, and returns 0, if the cache is empty.

See also toLast() and isEmpty().

💜 type * QIntCacheIterator::toLast ()

Sets the iterator to point to the last item in the cache and returns a pointer to the item. 🏁

Sets the iterator to 0, and returns 0, if the cache is empty.

See also toFirst() and isEmpty().

🔥 SEE ALSO 🔥

Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the license file included in the distribution for a complete license statement.

🌸 AUTHOR 🌸

Generated automatically from the source code. (yes, the robots wrote this one, and honestly? they ate. 💅)

💀 BUGS 💀

If you find a bug in Qt, please report it as described in http://doc.trolltech.com/bughowto.html. Good bug reports help us to help you. Thank you. 🫶

The definitive Qt documentation is provided in HTML format; it is located at $QTDIR/doc/html and can be read using Qt Assistant or with a web browser. This man page is provided as a convenience for those users who prefer man pages, although this format is not officially supported by Trolltech.

If you find errors in this manual page, please report them to qt-bugs@trolltech.com. Please include the name of the manual page (qintcacheiterator.3qt) and the Qt version (3.3.8).

okay bestie that's the whole page, we made it to the end, mwah 🎀 this little man page came from Trolltech AS and it's dated 2 February 2007, living in the Qt 3.3.8 era — and the header up top says QIntCacheIterator(3qt), in case you forgot where you were. byeee, go iterate something. 🦋✨💖

📦 where this page comes from