|
swift
|
Build a QSet more efficiently when calling insert() in a for loop. More...
Public Member Functions | |
| bool | isEmpty () const |
| True if no elements have been inserted. | |
| void | insert (const T &value) |
| Add an element to the set. Runs in amortized constant time. | |
| void | insert (T &&value) |
| Add an element to the set. Runs in amortized constant time. | |
| operator QList< T > () const & | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator QList< T > () && | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator QSet< T > () const & | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator QSet< T > () && | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator std::set< T > () const & | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator std::set< T > () && | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator std::vector< T > () const & | |
| Return a container of unique elements. Runs in log-linear time. | |
| operator std::vector< T > () && | |
| Return a container of unique elements. Runs in log-linear time. | |
| template<typename U = T, typename = std::enable_if_t<std::is_same_v<U, QString>>> | |
| operator QStringList () const & | |
| Return a container of unique elements. Runs in log-linear time. | |
| template<typename U = T, typename = std::enable_if_t<std::is_same_v<U, QString>>> | |
| operator QStringList () && | |
| Return a container of unique elements. Runs in log-linear time. | |
Build a QSet more efficiently when calling insert() in a for loop.
Definition at line 24 of file setbuilder.h.