[−][src]Struct qt_gui::q_set_of_q_byte_array::ConstIterator
The QSet::const_iterator class provides an STL-style const iterator for QSet.
C++ class: QSet<QByteArray>::const_iterator
.
The QSet::const_iterator class provides an STL-style const iterator for QSet.
QSet features both STL-style iterators and Java-style iterators. The STL-style iterators are more low-level and more cumbersome to use; on the other hand, they are slightly faster and, for developers who already know STL, have the advantage of familiarity.
QSet<Key, T>::const_iterator allows you to iterate over a QSet. If you want to modify the QSet as you iterate over it, you must use QSet::iterator instead. It is generally good practice to use QSet::const_iterator on a non-const QSet as well, unless you need to change the QSet through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QSet::const_iterator constructor creates an uninitialized iterator. You must initialize it using a function like QSet::begin(), QSet::end(), or QSet::insert() before you can start iterating. Here's a typical loop that prints all the items stored in a set:
QSet<QString> set; set << "January" << "February" << ... << "December";
QSet<QString>::const_iterator i; for (i = set.begin(); i != set.end(); ++i) qDebug() << *i;
STL-style iterators can be used as arguments to generic algorithms. For example, here's how to find an item in the set using the qFind() algorithm:
QSet<QString> set; ... QSet<QString>::iterator it = qFind(set.begin(), set.end(), "Jeanette"); if (it != set.constEnd()) cout << "Found Jeanette" << endl;
Warning: Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read Implicit sharing iterator problem.
Methods
impl ConstIterator
[src]
pub unsafe fn copy_from(
&mut self,
o: impl CastInto<Ref<ConstIterator>>
) -> MutRef<ConstIterator>
[src]
&mut self,
o: impl CastInto<Ref<ConstIterator>>
) -> MutRef<ConstIterator>
Assigns other to this.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator=(const QSet<QByteArray>::const_iterator& o)
.
Assigns other to this.
pub unsafe fn dec(&mut self) -> MutRef<ConstIterator>
[src]
The prefix -- operator (--it
) makes the preceding item current and returns an iterator to the new current item.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator--()
.
The prefix -- operator (--it
) makes the preceding item current and returns an iterator to the new current item.
Calling this function on QAssociativeIterable::begin() leads to undefined results.
See also operator++().
pub unsafe fn dec_postfix(&mut self, arg1: c_int) -> CppBox<ConstIterator>
[src]
This is an overloaded function.
Calls C++ function: QSet<QByteArray>::const_iterator QSet<QByteArray>::const_iterator::operator--(int arg1)
.
This is an overloaded function.
The postfix -- operator (it--
) makes the preceding item current and returns an iterator to the previously current item.
pub unsafe fn inc(&mut self) -> MutRef<ConstIterator>
[src]
The prefix ++ operator (++it
) advances the iterator to the next item in the container and returns an iterator to the new current item.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator++()
.
The prefix ++ operator (++it
) advances the iterator to the next item in the container and returns an iterator to the new current item.
Calling this function on QAssociativeIterable::end() leads to undefined results.
See also operator--().
pub unsafe fn inc_postfix(&mut self, arg1: c_int) -> CppBox<ConstIterator>
[src]
This is an overloaded function.
Calls C++ function: QSet<QByteArray>::const_iterator QSet<QByteArray>::const_iterator::operator++(int arg1)
.
This is an overloaded function.
The postfix ++ operator (it++
) advances the iterator to the next item in the container and returns an iterator to the previously current item.
pub unsafe fn indirection(&self) -> Ref<QByteArray>
[src]
Returns the current value, converted to a QVariant.
Calls C++ function: const QByteArray& QSet<QByteArray>::const_iterator::operator*() const
.
Returns the current value, converted to a QVariant.
pub unsafe fn new_0a() -> CppBox<ConstIterator>
[src]
Constructs an uninitialized iterator.
Calls C++ function: [constructor] void QSet<QByteArray>::const_iterator::const_iterator()
.
Constructs an uninitialized iterator.
Functions like operator*() and operator++() should not be called on an uninitialized iterator. Use operator=() to assign a value to it before using it.
See also QSet::begin() and QSet::end().
pub unsafe fn new_1a(o: impl CastInto<Ref<Iterator>>) -> CppBox<ConstIterator>
[src]
Calls C++ function: [constructor] void QSet<QByteArray>::const_iterator::const_iterator(const QSet<QByteArray>::iterator& o)
.
pub unsafe fn new_copy(
o: impl CastInto<Ref<ConstIterator>>
) -> CppBox<ConstIterator>
[src]
o: impl CastInto<Ref<ConstIterator>>
) -> CppBox<ConstIterator>
Calls C++ function: [constructor] void QSet<QByteArray>::const_iterator::const_iterator(const QSet<QByteArray>::const_iterator& o)
.
pub unsafe fn struct_deref(&self) -> Ptr<QByteArray>
[src]
Returns a pointer to the current result.
Calls C++ function: const QByteArray* QSet<QByteArray>::const_iterator::operator->() const
.
Returns a pointer to the current result.
Trait Implementations
impl<'_> Add<i32> for &'_ ConstIterator
[src]
type Output = CppBox<ConstIterator>
The resulting type after applying the +
operator.
fn add(self, j: c_int) -> CppBox<ConstIterator>
[src]
Returns an iterator to the item at j positions forward from this iterator.
Calls C++ function: QSet<QByteArray>::const_iterator QSet<QByteArray>::const_iterator::operator+(int j) const
.
Returns an iterator to the item at j positions forward from this iterator.
See also operator-() and operator+=().
impl AddAssign<i32> for ConstIterator
[src]
fn add_assign(&mut self, j: c_int)
[src]
Advances the iterator by j items.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator+=(int j)
.
Advances the iterator by j items.
See also operator-=() and operator+().
impl CppDeletable for ConstIterator
[src]
unsafe fn delete(&mut self)
[src]
The QSet::const_iterator class provides an STL-style const iterator for QSet.
Calls C++ function: [destructor] void QSet<QByteArray>::const_iterator::~const_iterator()
.
The QSet::const_iterator class provides an STL-style const iterator for QSet.
QSet features both STL-style iterators and Java-style iterators. The STL-style iterators are more low-level and more cumbersome to use; on the other hand, they are slightly faster and, for developers who already know STL, have the advantage of familiarity.
QSet<Key, T>::const_iterator allows you to iterate over a QSet. If you want to modify the QSet as you iterate over it, you must use QSet::iterator instead. It is generally good practice to use QSet::const_iterator on a non-const QSet as well, unless you need to change the QSet through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QSet::const_iterator constructor creates an uninitialized iterator. You must initialize it using a function like QSet::begin(), QSet::end(), or QSet::insert() before you can start iterating. Here's a typical loop that prints all the items stored in a set:
QSet<QString> set; set << "January" << "February" << ... << "December";
QSet<QString>::const_iterator i; for (i = set.begin(); i != set.end(); ++i) qDebug() << *i;
STL-style iterators can be used as arguments to generic algorithms. For example, here's how to find an item in the set using the qFind() algorithm:
QSet<QString> set; ... QSet<QString>::iterator it = qFind(set.begin(), set.end(), "Jeanette"); if (it != set.constEnd()) cout << "Found Jeanette" << endl;
Warning: Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read Implicit sharing iterator problem.
impl Decrement for ConstIterator
[src]
type Output = MutRef<ConstIterator>
Output type.
unsafe fn dec(&mut self) -> MutRef<ConstIterator>
[src]
The prefix -- operator (--it
) makes the preceding item current and returns an iterator to the new current item.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator--()
.
The prefix -- operator (--it
) makes the preceding item current and returns an iterator to the new current item.
Calling this function on QAssociativeIterable::begin() leads to undefined results.
See also operator++().
impl Increment for ConstIterator
[src]
type Output = MutRef<ConstIterator>
Output type.
unsafe fn inc(&mut self) -> MutRef<ConstIterator>
[src]
The prefix ++ operator (++it
) advances the iterator to the next item in the container and returns an iterator to the new current item.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator++()
.
The prefix ++ operator (++it
) advances the iterator to the next item in the container and returns an iterator to the new current item.
Calling this function on QAssociativeIterable::end() leads to undefined results.
See also operator--().
impl Indirection for ConstIterator
[src]
type Output = Ref<QByteArray>
Output type.
unsafe fn indirection(&self) -> Ref<QByteArray>
[src]
impl PartialEq<Ref<ConstIterator>> for ConstIterator
[src]
fn eq(&self, o: &Ref<ConstIterator>) -> bool
[src]
Returns true
if other points to the same item as this iterator; otherwise returns false
.
Calls C++ function: bool QSet<QByteArray>::const_iterator::operator==(const QSet<QByteArray>::const_iterator& o) const
.
Returns true
if other points to the same item as this iterator; otherwise returns false
.
See also operator!=().
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'_> Sub<i32> for &'_ ConstIterator
[src]
type Output = CppBox<ConstIterator>
The resulting type after applying the -
operator.
fn sub(self, j: c_int) -> CppBox<ConstIterator>
[src]
Returns an iterator to the item at j positions backward from this iterator.
Calls C++ function: QSet<QByteArray>::const_iterator QSet<QByteArray>::const_iterator::operator-(int j) const
.
Returns an iterator to the item at j positions backward from this iterator.
See also operator+() and operator-=().
impl SubAssign<i32> for ConstIterator
[src]
fn sub_assign(&mut self, j: c_int)
[src]
Makes the iterator go back by j items.
Calls C++ function: QSet<QByteArray>::const_iterator& QSet<QByteArray>::const_iterator::operator-=(int j)
.
Makes the iterator go back by j items.
See also operator+=() and operator-().
Auto Trait Implementations
impl RefUnwindSafe for ConstIterator
impl Send for ConstIterator
impl Sync for ConstIterator
impl Unpin for ConstIterator
impl UnwindSafe for ConstIterator
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> CastInto<U> for T where
U: CastFrom<T>,
[src]
U: CastFrom<T>,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> StaticUpcast<T> for T
[src]
unsafe fn static_upcast(ptr: Ptr<T>) -> Ptr<T>
[src]
unsafe fn static_upcast_mut(ptr: MutPtr<T>) -> MutPtr<T>
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,