|
swift
|
Build a QMap more efficiently when calling insert() in a for loop. More...
Public Member Functions | |
| template<typename... Ts> | |
| void | insert (Ts &&...keyAndValue) |
| Add an key/value pair to the map. Runs in amortized constant time. | |
| bool | isEmpty () const |
| True if no pairs have been inserted. | |
| operator QMap< K, V > () const & | |
| Return a container with unique keys. Runs in log-linear time. | |
| operator QMap< K, V > () && | |
| Return a container with unique keys. Runs in log-linear time. | |
| operator QHash< K, V > () const & | |
| Return a container with unique keys. Runs in log-linear time. | |
| operator QHash< K, V > () && | |
| Return a container with unique keys. Runs in log-linear time. | |
| operator std::map< K, V > () const & | |
| Return a container with unique keys. Runs in log-linear time. | |
| operator std::map< K, V > () && | |
| Return a container with unique keys. Runs in log-linear time. | |
Build a QMap more efficiently when calling insert() in a for loop.
Definition at line 25 of file mapbuilder.h.