Struct cxx_qt_lib::QHash

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

The QHash class is a template class that provides a hash-table-based dictionary.

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

To use QHash with a custom pair, implement the QHashPair trait for T.

Implementations

impl QHash<QHashPair_QString_QVariant>

pub fn cxx_clear(&mut self)

impl QHash<QHashPair_QString_QVariant>

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

impl QHash<QHashPair_i32_QByteArray>

pub fn cxx_clear(&mut self)

impl QHash<QHashPair_i32_QByteArray>

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

impl<T> QHash<T>

where T: QHashPair,

pub fn clear(&mut self)

Removes all items from the hash.

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

Returns true if the hash contains an item with the key; otherwise returns false.

pub fn get(&self, key: &T::Key) -> Option<T::Value>

Returns the value associated with the key if it exists.

pub fn get_or_default(&self, key: &T::Key) -> T::Value

Returns the value associated with the key or a default value.

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

Inserts a new item with the key and a value of value.

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

pub fn is_empty(&self) -> bool

Returns true if the hash contains no items; otherwise returns false.

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

An iterator visiting all key-value pairs in arbitrary order. The iterator element type is (&’a T::Key, &’a T::Value).

pub fn len(&self) -> isize

Returns the number of items in the hash.

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

Removes all the items that have the key from the hash.

Returns true if at least one item was removed, otherwise returns false.

impl<T> QHash<T>

where T: QHashPair, T::Key: ExternType<Kind = Trivial>, T::Value: ExternType<Kind = Trivial>,

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

Inserts a new item with the key and a value of value.

Trait Implementations

impl<T> Clone for QHash<T>

where T: QHashPair,

fn clone(&self) -> Self

Constructs a copy of other.

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

Performs copy-assignment from source.

impl<T> Default for QHash<T>

where T: QHashPair,

fn default() -> Self

Constructs an empty hash.

impl<T> Drop for QHash<T>

where T: QHashPair,

fn drop(&mut self)

Destroys the hash.

impl<T> ExternType for QHash<T>

where T: QHashPair,

type Id = <T as QHashPair>::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 QHash<T>

where T: QHashPair, T::Value: PartialEq,

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T> Eq for QHash<T>

where T: QHashPair, T::Value: Eq,