Struct Iterator 

pub struct Iterator { /* private fields */ }

C++ class: QSet<QByteArray>::iterator.

Implementations

impl Iterator

pub unsafe fn add_assign(&self, j: c_int) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator+=(int j).

pub unsafe fn copy_from(&self, o: impl CastInto<Ref<Iterator>>) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator=(const QSet<QByteArray>::iterator& o).

pub unsafe fn dec(&self) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator--().

pub unsafe fn dec_postfix(&self, arg1: c_int) -> CppBox<Iterator>

Calls C++ function: QSet<QByteArray>::iterator QSet<QByteArray>::iterator::operator--(int arg1).

pub unsafe fn inc(&self) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator++().

pub unsafe fn inc_postfix(&self, arg1: c_int) -> CppBox<Iterator>

Calls C++ function: QSet<QByteArray>::iterator QSet<QByteArray>::iterator::operator++(int arg1).

pub unsafe fn indirection(&self) -> Ref<QByteArray>

Calls C++ function: const QByteArray& QSet<QByteArray>::iterator::operator*() const.

pub unsafe fn new() -> CppBox<Iterator>

Calls C++ function: [constructor] void QSet<QByteArray>::iterator::iterator().

pub unsafe fn new_copy(o: impl CastInto<Ref<Iterator>>) -> CppBox<Iterator>

Calls C++ function: [constructor] void QSet<QByteArray>::iterator::iterator(const QSet<QByteArray>::iterator& o).

pub unsafe fn struct_deref(&self) -> Ptr<QByteArray>

Calls C++ function: const QByteArray* QSet<QByteArray>::iterator::operator->() const.

pub unsafe fn sub_assign(&self, j: c_int) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator-=(int j).

Trait Implementations

impl Add<i32> for &Iterator

fn add(self, j: c_int) -> CppBox<Iterator>

Calls C++ function: QSet<QByteArray>::iterator QSet<QByteArray>::iterator::operator+(int j) const.

type Output = CppBox<Iterator>

The resulting type after applying the + operator.

impl CppDeletable for Iterator

unsafe fn delete(&self)

Calls C++ function: [destructor] void QSet<QByteArray>::iterator::~iterator().

impl Decrement for Iterator

unsafe fn dec(&self) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator--().

type Output = Ref<Iterator>

Output type.

impl Increment for Iterator

unsafe fn inc(&self) -> Ref<Iterator>

Calls C++ function: QSet<QByteArray>::iterator& QSet<QByteArray>::iterator::operator++().

type Output = Ref<Iterator>

Output type.

impl Indirection for Iterator

unsafe fn indirection(&self) -> Ref<QByteArray>

Calls C++ function: const QByteArray& QSet<QByteArray>::iterator::operator*() const.

type Output = Ref<QByteArray>

Output type.

impl PartialEq<Ref<ConstIterator>> for Iterator

fn eq(&self, o: &Ref<ConstIterator>) -> bool

Calls C++ function: bool QSet<QByteArray>::iterator::operator==(const QSet<QByteArray>::const_iterator& o) const.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq<Ref<Iterator>> for Iterator

fn eq(&self, o: &Ref<Iterator>) -> bool

Calls C++ function: bool QSet<QByteArray>::iterator::operator==(const QSet<QByteArray>::iterator& o) const.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Sub<i32> for &Iterator

fn sub(self, j: c_int) -> CppBox<Iterator>

Calls C++ function: QSet<QByteArray>::iterator QSet<QByteArray>::iterator::operator-(int j) const.

type Output = CppBox<Iterator>

The resulting type after applying the - operator.