Struct QVariantMap

#[repr(C)]
pub struct QVariantMap { /* private fields */ }

Wrapper around QVariantMap typedef.

Implementations

impl QVariantMap

pub fn insert(&mut self, key: QString, element: QVariant)

Wrapper around insert(int, const QString &, const QVariant &) method.

pub fn remove(&mut self, key: QString) -> usize

Wrapper around remove(const QString &) method.

pub fn take(&mut self, key: QString) -> QVariant

Wrapper around take(const QString &) method.

pub fn len(&self) -> usize

Wrapper around size() method.

pub fn is_empty(&self) -> bool

Wrapper around isEmpty() method.

pub fn contains(&self, key: QString) -> bool

Wrapper around contains(const QString &) method.

pub fn clear(&mut self)

Wrapper around clear() method.

pub fn value(&self, key: QString, default_value: QVariant) -> QVariant

Wrapper around value(const QString &, const QVariant &) method.

pub fn key(&self, value: QVariant, default_key: QString) -> QString

Wrapper around key(const QVariant &, const QString &) method.

Trait Implementations

impl Clone for QVariantMap

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for QVariantMap

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for QVariantMap

fn default() -> Self

Returns the “default value” for a type.

impl Drop for QVariantMap

fn drop(&mut self)

Executes the destructor for this type.

impl<K, V, const N: usize> From<[(K, V); N]> for QVariantMap

where K: Into<QString>, V: Into<QVariant>,

fn from(m: [(K, V); N]) -> Self

Converts to this type from the input type.

impl<K, V> From<HashMap<K, V>> for QVariantMap

where K: Into<QString>, V: Into<QVariant>,

fn from(m: HashMap<K, V>) -> Self

Converts to this type from the input type.

impl<K, V> From<QVariantMap> for HashMap<K, V>

where K: Hash + Eq, V: Eq, QString: Into<K>, QVariant: Into<V>,

fn from(m: QVariantMap) -> Self

Converts to this type from the input type.

impl From<QVariantMap> for QVariant

fn from(a: QVariantMap) -> QVariant

Wrapper around QVariant(const QMap<QString, QVariant> &) constructor.

impl<K, V> FromIterator<(K, V)> for QVariantMap

where K: Into<QString>, V: Into<QVariant>,

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Creates a value from an iterator.

impl Index<QString> for QVariantMap

fn index(&self, key: QString) -> &Self::Output

Wrapper around at(int) method.

type Output = QVariant

The returned type after indexing.

impl IndexMut<QString> for QVariantMap

fn index_mut(&mut self, key: QString) -> &mut Self::Output

Wrapper around operator[](int) operator method.

impl<'a> IntoIterator for &'a QVariantMap

type Item = (&'a QString, &'a QVariant)

The type of the elements being iterated over.

type IntoIter = QVariantMapIterator<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for QVariantMap

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

Tests for self and other values to be equal, and is used by ==.

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 Eq for QVariantMap