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