sincerely
Singaporean
If you have not done so, read this full tutorial on how to use SGEXTN to build an application.
SGLUnorderedMap::SGLUnorderedMap();
[[nodiscard]] V& SGLUnorderedMap::at(const K& x);
[[nodiscard]] const V& SGLUnorderedMap::at(const K &x) const;
[[nodiscard]] SGLUnorderedMap::Iterator SGLUnorderedMap::begin();
[[nodiscard]] SGLUnorderedMap::ConstIterator SGLUnorderedMap::constBegin() const;
[[nodiscard]] SGLUnorderedMap::ConstIterator SGLUnorderedMap::constEnd() const;
[[nodiscard]] bool SGLUnorderedMap::contains(const K& x) const;
[[nodiscard]] int SGLUnorderedMap::count(const K& x) const;
[[nodiscard]] SGLUnorderedMap::Iterator SGLUnorderedMap::end();
bool SGLUnorderedMap::erase(SGLUnorderedMap::Iterator& x);
bool SGLUnorderedMap::erase(const K& x);
[[nodiscard]] SGLUnorderedMap::Iterator SGLUnorderedMap::find(const K& x);
[[nodiscard]] SGLUnorderedMap::ConstIterator SGLUnorderedMap::find(const K& x) const;
bool SGLUnorderedMap::insert(const K& xKey, const V& xValue);
[[nodiscard]] int SGLUnorderedMap::length() const;
void SGLUnorderedMap::reserve(int newMemoryLength);
©2025 05524F.sg (Singapore)