[−][src]Struct qt_widgets::q_list_of_q_undo_stack::Iterator
The QList::iterator class provides an STL-style non-const iterator for QList and QQueue.
C++ class: QList<QUndoStack*>::iterator
.
The QList::iterator class provides an STL-style non-const iterator for QList and QQueue.
QList 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.
QList<T>::iterator allows you to iterate over a QList<T> (or QQueue<T>) and to modify the list item associated with the iterator. If you want to iterate over a const QList, use QList::const_iterator instead. It is generally good practice to use QList::const_iterator on a non-const QList as well, unless you need to change the QList through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QList::iterator constructor creates an uninitialized iterator. You must initialize it using a QList function like QList::begin(), QList::end(), or QList::insert() before you can start iterating. Here's a typical loop that prints all the items stored in a list:
QList<QString> list; list.append("January"); list.append("February"); ... list.append("December");
QList<QString>::iterator i; for (i = list.begin(); i != list.end(); ++i) cout << *i << endl;
Let's see a few examples of things we can do with a QList::iterator that we cannot do with a QList::const_iterator. Here's an example that increments every value stored in a QList<int> by 2:
QList<int>::iterator i; for (i = list.begin(); i != list.end(); ++i) *i += 2;
Most QList functions accept an integer index rather than an iterator. For that reason, iterators are rarely useful in connection with QList. One place where STL-style iterators do make sense is as arguments to generic algorithms.
For example, here's how to delete all the widgets stored in a QList<QWidget *>:
QList<QWidget *> list; ... qDeleteAll(list.begin(), list.end());
Multiple iterators can be used on the same list. However, be aware that any non-const function call performed on the QList will render all existing iterators undefined. If you need to keep iterators over a long period of time, we recommend that you use QLinkedList rather than QList.
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 Iterator
[src]
pub unsafe fn copy_from(
&mut self,
other: impl CastInto<Ref<Iterator>>
) -> MutRef<Iterator>
[src]
&mut self,
other: impl CastInto<Ref<Iterator>>
) -> MutRef<Iterator>
The QList::iterator class provides an STL-style non-const iterator for QList and QQueue.
Calls C++ function: QList<QUndoStack*>::iterator& QList<QUndoStack*>::iterator::operator=(const QList<QUndoStack*>::iterator& other)
.
The QList::iterator class provides an STL-style non-const iterator for QList and QQueue.
QList 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.
QList<T>::iterator allows you to iterate over a QList<T> (or QQueue<T>) and to modify the list item associated with the iterator. If you want to iterate over a const QList, use QList::const_iterator instead. It is generally good practice to use QList::const_iterator on a non-const QList as well, unless you need to change the QList through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QList::iterator constructor creates an uninitialized iterator. You must initialize it using a QList function like QList::begin(), QList::end(), or QList::insert() before you can start iterating. Here's a typical loop that prints all the items stored in a list:
QList<QString> list; list.append("January"); list.append("February"); ... list.append("December");
QList<QString>::iterator i; for (i = list.begin(); i != list.end(); ++i) cout << *i << endl;
Let's see a few examples of things we can do with a QList::iterator that we cannot do with a QList::const_iterator. Here's an example that increments every value stored in a QList<int> by 2:
QList<int>::iterator i; for (i = list.begin(); i != list.end(); ++i) *i += 2;
Most QList functions accept an integer index rather than an iterator. For that reason, iterators are rarely useful in connection with QList. One place where STL-style iterators do make sense is as arguments to generic algorithms.
For example, here's how to delete all the widgets stored in a QList<QWidget *>:
QList<QWidget *> list; ... qDeleteAll(list.begin(), list.end());
Multiple iterators can be used on the same list. However, be aware that any non-const function call performed on the QList will render all existing iterators undefined. If you need to keep iterators over a long period of time, we recommend that you use QLinkedList rather than QList.
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.
pub unsafe fn dec_postfix(&mut self, arg1: c_int) -> CppBox<Iterator>
[src]
This is an overloaded function.
Calls C++ function: QList<QUndoStack*>::iterator QList<QUndoStack*>::iterator::operator--(int arg1)
.
This is an overloaded function.
The postfix -- operator (i--
) makes the preceding item current and returns an iterator pointing to the previously current item.
pub unsafe fn inc_postfix(&mut self, arg1: c_int) -> CppBox<Iterator>
[src]
This is an overloaded function.
Calls C++ function: QList<QUndoStack*>::iterator QList<QUndoStack*>::iterator::operator++(int arg1)
.
This is an overloaded function.
The postfix ++ operator (i++
) advances the iterator to the next item in the hash and returns an iterator to the previously current item.
pub unsafe fn index(&self, j: c_longlong) -> MutRef<*mut QUndoStack>
[src]
Returns a modifiable reference to the item at offset j from the item pointed to by this iterator (the item at position *this + j
).
Calls C++ function: QUndoStack*& QList<QUndoStack*>::iterator::operator[](long long j) const
.
Warning: no exact match found in C++ documentation. Below is the C++ documentation for QJsonValueRef iterator::operator[](int j) const
:
Returns a modifiable reference to the item at offset j from the item pointed to by this iterator (the item at position *this + j
).
This function is provided to make QJsonArray iterators behave like C++ pointers.
The return value is of type QJsonValueRef, a helper class for QJsonArray and QJsonObject. When you get an object of type QJsonValueRef, you can use it as if it were a reference to a QJsonValue. If you assign to it, the assignment will apply to the character in the QJsonArray of QJsonObject from which you got the reference.
See also operator+().
pub unsafe fn new() -> CppBox<Iterator>
[src]
Constructs an uninitialized iterator.
Calls C++ function: [constructor] void QList<QUndoStack*>::iterator::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 QList::begin() and QList::end().
pub unsafe fn new_copy(o: impl CastInto<Ref<Iterator>>) -> CppBox<Iterator>
[src]
Calls C++ function: [constructor] void QList<QUndoStack*>::iterator::iterator(const QList<QUndoStack*>::iterator& o)
.
pub unsafe fn struct_deref(&self) -> MutPtr<*mut QUndoStack>
[src]
Returns a pointer to the current item's value.
Calls C++ function: QUndoStack** QList<QUndoStack*>::iterator::operator->() const
.
Returns a pointer to the current item's value.
See also value().
Trait Implementations
impl PartialEq<Ref<Iterator>> for Iterator
[src]
fn eq(&self, o: &Ref<Iterator>) -> bool
[src]
Returns true
if other points to the same item as this iterator; otherwise returns false
.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator==(const QList<QUndoStack*>::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 PartialEq<Ref<ConstIterator>> for Iterator
[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 QList<QUndoStack*>::iterator::operator==(const QList<QUndoStack*>::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<'_> Add<i64> for &'_ Iterator
[src]
type Output = CppBox<Iterator>
The resulting type after applying the +
operator.
fn add(self, j: c_longlong) -> CppBox<Iterator>
[src]
Calls C++ function: QList<QUndoStack*>::iterator QList<QUndoStack*>::iterator::operator+(long long j) const
.
impl<'_> Sub<i64> for &'_ Iterator
[src]
type Output = CppBox<Iterator>
The resulting type after applying the -
operator.
fn sub(self, j: c_longlong) -> CppBox<Iterator>
[src]
Calls C++ function: QList<QUndoStack*>::iterator QList<QUndoStack*>::iterator::operator-(long long j) const
.
impl<'_> Sub<Ref<Iterator>> for &'_ Iterator
[src]
type Output = c_int
The resulting type after applying the -
operator.
fn sub(self, j: Ref<Iterator>) -> c_int
[src]
Calls C++ function: int QList<QUndoStack*>::iterator::operator-(QList<QUndoStack*>::iterator j) const
.
impl AddAssign<i64> for Iterator
[src]
fn add_assign(&mut self, j: c_longlong)
[src]
Advances the iterator by j items. (If j is negative, the iterator goes backward.)
Calls C++ function: QList<QUndoStack*>::iterator& QList<QUndoStack*>::iterator::operator+=(long long j)
.
Warning: no exact match found in C++ documentation. Below is the C++ documentation for iterator &iterator::operator+=(int j)
:
Advances the iterator by j items. (If j is negative, the iterator goes backward.)
See also operator-=() and operator+().
impl SubAssign<i64> for Iterator
[src]
fn sub_assign(&mut self, j: c_longlong)
[src]
Makes the iterator go back by j items. (If j is negative, the iterator goes forward.)
Calls C++ function: QList<QUndoStack*>::iterator& QList<QUndoStack*>::iterator::operator-=(long long j)
.
Warning: no exact match found in C++ documentation. Below is the C++ documentation for iterator &iterator::operator-=(int j)
:
Makes the iterator go back by j items. (If j is negative, the iterator goes forward.)
See also operator+=() and operator-().
impl Lt<Ref<Iterator>> for Iterator
[src]
fn lt(&self, other: &Ref<Iterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is less than the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator<(const QList<QUndoStack*>::iterator& other) const
.
Returns true
if the item pointed to by this iterator is less than the item pointed to by the other iterator.
impl Lt<Ref<ConstIterator>> for Iterator
[src]
fn lt(&self, other: &Ref<ConstIterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is less than the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator<(const QList<QUndoStack*>::const_iterator& other) const
.
Returns true
if the item pointed to by this iterator is less than the item pointed to by the other iterator.
impl Le<Ref<Iterator>> for Iterator
[src]
fn le(&self, other: &Ref<Iterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is less than or equal to the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator<=(const QList<QUndoStack*>::iterator& other) const
.
Returns true
if the item pointed to by this iterator is less than or equal to the item pointed to by the other iterator.
impl Le<Ref<ConstIterator>> for Iterator
[src]
fn le(&self, other: &Ref<ConstIterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is less than or equal to the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator<=(const QList<QUndoStack*>::const_iterator& other) const
.
Returns true
if the item pointed to by this iterator is less than or equal to the item pointed to by the other iterator.
impl Gt<Ref<Iterator>> for Iterator
[src]
fn gt(&self, other: &Ref<Iterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is greater than the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator>(const QList<QUndoStack*>::iterator& other) const
.
Returns true
if the item pointed to by this iterator is greater than the item pointed to by the other iterator.
impl Gt<Ref<ConstIterator>> for Iterator
[src]
fn gt(&self, other: &Ref<ConstIterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is greater than the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator>(const QList<QUndoStack*>::const_iterator& other) const
.
Returns true
if the item pointed to by this iterator is greater than the item pointed to by the other iterator.
impl Ge<Ref<Iterator>> for Iterator
[src]
fn ge(&self, other: &Ref<Iterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is greater than or equal to the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator>=(const QList<QUndoStack*>::iterator& other) const
.
Returns true
if the item pointed to by this iterator is greater than or equal to the item pointed to by the other iterator.
impl Ge<Ref<ConstIterator>> for Iterator
[src]
fn ge(&self, other: &Ref<ConstIterator>) -> bool
[src]
Returns true
if the item pointed to by this iterator is greater than or equal to the item pointed to by the other iterator.
Calls C++ function: bool QList<QUndoStack*>::iterator::operator>=(const QList<QUndoStack*>::const_iterator& other) const
.
Returns true
if the item pointed to by this iterator is greater than or equal to the item pointed to by the other iterator.
impl CppDeletable for Iterator
[src]
unsafe fn delete(&mut self)
[src]
The QList::iterator class provides an STL-style non-const iterator for QList and QQueue.
Calls C++ function: [destructor] void QList<QUndoStack*>::iterator::~iterator()
.
The QList::iterator class provides an STL-style non-const iterator for QList and QQueue.
QList 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.
QList<T>::iterator allows you to iterate over a QList<T> (or QQueue<T>) and to modify the list item associated with the iterator. If you want to iterate over a const QList, use QList::const_iterator instead. It is generally good practice to use QList::const_iterator on a non-const QList as well, unless you need to change the QList through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QList::iterator constructor creates an uninitialized iterator. You must initialize it using a QList function like QList::begin(), QList::end(), or QList::insert() before you can start iterating. Here's a typical loop that prints all the items stored in a list:
QList<QString> list; list.append("January"); list.append("February"); ... list.append("December");
QList<QString>::iterator i; for (i = list.begin(); i != list.end(); ++i) cout << *i << endl;
Let's see a few examples of things we can do with a QList::iterator that we cannot do with a QList::const_iterator. Here's an example that increments every value stored in a QList<int> by 2:
QList<int>::iterator i; for (i = list.begin(); i != list.end(); ++i) *i += 2;
Most QList functions accept an integer index rather than an iterator. For that reason, iterators are rarely useful in connection with QList. One place where STL-style iterators do make sense is as arguments to generic algorithms.
For example, here's how to delete all the widgets stored in a QList<QWidget *>:
QList<QWidget *> list; ... qDeleteAll(list.begin(), list.end());
Multiple iterators can be used on the same list. However, be aware that any non-const function call performed on the QList will render all existing iterators undefined. If you need to keep iterators over a long period of time, we recommend that you use QLinkedList rather than QList.
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 &'_ mut Iterator
[src]
type Output = MutRef<Iterator>
Output type.
fn dec(self) -> MutRef<Iterator>
[src]
The prefix -- operator (--i
) makes the preceding item current and returns an iterator pointing to the new current item.
Calls C++ function: QList<QUndoStack*>::iterator& QList<QUndoStack*>::iterator::operator--()
.
The prefix -- operator (--i
) makes the preceding item current and returns an iterator pointing to the new current item.
Calling this function on QHash::begin() leads to undefined results.
See also operator++().
impl<'_> Indirection for &'_ Iterator
[src]
type Output = MutRef<*mut QUndoStack>
Output type.
fn indirection(self) -> MutRef<*mut QUndoStack>
[src]
Returns a modifiable reference to the current item's value.
Calls C++ function: QUndoStack*& QList<QUndoStack*>::iterator::operator*() const
.
impl<'_> Increment for &'_ mut Iterator
[src]
type Output = MutRef<Iterator>
Output type.
fn inc(self) -> MutRef<Iterator>
[src]
The prefix ++ operator (++i
) advances the iterator to the next item in the hash and returns an iterator to the new current item.
Calls C++ function: QList<QUndoStack*>::iterator& QList<QUndoStack*>::iterator::operator++()
.
The prefix ++ operator (++i
) advances the iterator to the next item in the hash and returns an iterator to the new current item.
Calling this function on QHash::end() leads to undefined results.
See also operator--().
Auto Trait Implementations
impl Send for Iterator
impl Unpin for Iterator
impl Sync for Iterator
impl UnwindSafe for Iterator
impl RefUnwindSafe for Iterator
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From<T> for 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>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
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> CastInto<U> for T where
U: CastFrom<T>,
[src]
U: CastFrom<T>,