Struct QSet

#[repr(C)]
pub struct QSet<T>
where
    T: QSetElement,
{ /* private fields */ }

The QSet class is a template class that provides a hash-table-based set.

Note that this means that T needs to have a global qHash() function.

To use QSet with a custom type, implement the QSetElement trait for T.

Implementations

impl QSet<bool>

pub fn cxx_clear(&mut self)

impl QSet<bool>

pub fn cxx_contains(&self, arg0: &bool) -> bool

impl QSet<bool>

pub fn cxx_remove(&mut self, arg0: &bool) -> bool

impl QSet<f32>

pub fn cxx_clear(&mut self)

impl QSet<f32>

pub fn cxx_contains(&self, arg0: &f32) -> bool

impl QSet<f32>

pub fn cxx_remove(&mut self, arg0: &f32) -> bool

impl QSet<f64>

pub fn cxx_clear(&mut self)

impl QSet<f64>

pub fn cxx_contains(&self, arg0: &f64) -> bool

impl QSet<f64>

pub fn cxx_remove(&mut self, arg0: &f64) -> bool

impl QSet<i8>

pub fn cxx_clear(&mut self)

impl QSet<i8>

pub fn cxx_contains(&self, arg0: &i8) -> bool

impl QSet<i8>

pub fn cxx_remove(&mut self, arg0: &i8) -> bool

impl QSet<i16>

pub fn cxx_clear(&mut self)

impl QSet<i16>

pub fn cxx_contains(&self, arg0: &i16) -> bool

impl QSet<i16>

pub fn cxx_remove(&mut self, arg0: &i16) -> bool

impl QSet<i32>

pub fn cxx_clear(&mut self)

impl QSet<i32>

pub fn cxx_contains(&self, arg0: &i32) -> bool

impl QSet<i32>

pub fn cxx_remove(&mut self, arg0: &i32) -> bool

impl QSet<i64>

pub fn cxx_clear(&mut self)

impl QSet<i64>

pub fn cxx_contains(&self, arg0: &i64) -> bool

impl QSet<i64>

pub fn cxx_remove(&mut self, arg0: &i64) -> bool

impl QSet<QByteArray>

pub fn cxx_clear(&mut self)

impl QSet<QByteArray>

pub fn cxx_contains(&self, arg0: &QByteArray) -> bool

impl QSet<QByteArray>

pub fn cxx_remove(&mut self, arg0: &QByteArray) -> bool

impl QSet<QDate>

pub fn cxx_clear(&mut self)

impl QSet<QDate>

pub fn cxx_contains(&self, arg0: &QDate) -> bool

impl QSet<QDate>

pub fn cxx_remove(&mut self, arg0: &QDate) -> bool

impl QSet<QDateTime>

pub fn cxx_clear(&mut self)

impl QSet<QDateTime>

pub fn cxx_contains(&self, arg0: &QDateTime) -> bool

impl QSet<QDateTime>

pub fn cxx_remove(&mut self, arg0: &QDateTime) -> bool

impl QSet<QPersistentModelIndex>

pub fn cxx_clear(&mut self)

impl QSet<QPersistentModelIndex>

pub fn cxx_contains(&self, arg0: &QPersistentModelIndex) -> bool

impl QSet<QPersistentModelIndex>

pub fn cxx_remove(&mut self, arg0: &QPersistentModelIndex) -> bool

impl QSet<QString>

pub fn cxx_clear(&mut self)

impl QSet<QString>

pub fn cxx_contains(&self, arg0: &QString) -> bool

impl QSet<QString>

pub fn cxx_remove(&mut self, arg0: &QString) -> bool

impl QSet<QTime>

pub fn cxx_clear(&mut self)

impl QSet<QTime>

pub fn cxx_contains(&self, arg0: &QTime) -> bool

impl QSet<QTime>

pub fn cxx_remove(&mut self, arg0: &QTime) -> bool

impl QSet<QUrl>

pub fn cxx_clear(&mut self)

impl QSet<QUrl>

pub fn cxx_contains(&self, arg0: &QUrl) -> bool

impl QSet<QUrl>

pub fn cxx_remove(&mut self, arg0: &QUrl) -> bool

impl QSet<u8>

pub fn cxx_clear(&mut self)

impl QSet<u8>

pub fn cxx_contains(&self, arg0: &u8) -> bool

impl QSet<u8>

pub fn cxx_remove(&mut self, arg0: &u8) -> bool

impl QSet<u16>

pub fn cxx_clear(&mut self)

impl QSet<u16>

pub fn cxx_contains(&self, arg0: &u16) -> bool

impl QSet<u16>

pub fn cxx_remove(&mut self, arg0: &u16) -> bool

impl QSet<u32>

pub fn cxx_clear(&mut self)

impl QSet<u32>

pub fn cxx_contains(&self, arg0: &u32) -> bool

impl QSet<u32>

pub fn cxx_remove(&mut self, arg0: &u32) -> bool

impl QSet<u64>

pub fn cxx_clear(&mut self)

impl QSet<u64>

pub fn cxx_contains(&self, arg0: &u64) -> bool

impl QSet<u64>

pub fn cxx_remove(&mut self, arg0: &u64) -> bool

impl<T> QSet<T>

where T: QSetElement,

pub fn clear(&mut self)

Removes all elements from the set.

pub fn contains(&self, value: &T) -> bool

Returns true if the set contains item value; otherwise returns false.

pub fn insert_clone(&mut self, value: &T)

Inserts item value into the set, if value isn’t already in the set, and returns an iterator pointing at the inserted item.

The value is a reference here so it can be opaque or trivial but note that the value is copied when being inserted into the set.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements; otherwise returns false.

pub fn iter(&self) -> Iter<'_, T>

An iterator visiting all elements in arbitrary order. The iterator element type is &’a T.

pub fn len(&self) -> isize

Returns the number of items in the set.

pub fn remove(&mut self, value: &T) -> bool

Removes any occurrence of item value from the set. Returns true if an item was actually removed; otherwise returns false.

impl<T> QSet<T>

where T: QSetElement + ExternType<Kind = Trivial>,

pub fn insert(&mut self, value: T)

Inserts item value into the set, if value isn’t already in the set, and returns an iterator pointing at the inserted item.

Trait Implementations

impl<T> Clone for QSet<T>

where T: QSetElement,

fn clone(&self) -> Self

Constructs a copy of the QSet.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Default for QSet<T>

where T: QSetElement,

fn default() -> Self

Constructs an empty set.

impl<T> Drop for QSet<T>

where T: QSetElement,

fn drop(&mut self)

Destroys the QSet.

impl<T> ExternType for QSet<T>

where T: ExternType + QSetElement,

type Id = <T as QSetElement>::TypeId

A type-level representation of the type’s C++ namespace and type name.

type Kind = Trivial

Either cxx::kind::Opaque or cxx::kind::Trivial.

impl<T> PartialEq for QSet<T>

where T: QSetElement + PartialEq,

fn eq(&self, other: &Self) -> bool

Returns true if both sets contain the same elements

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<T> Eq for QSet<T>

where T: QSetElement + PartialEq,