diff options
author | Dimitri van Heesch <dimitri@stack.nl> | 2001-10-07 14:42:40 (GMT) |
---|---|---|
committer | Dimitri van Heesch <dimitri@stack.nl> | 2001-10-07 14:42:40 (GMT) |
commit | bbd28a0ff4c70dccb9729e6ce515c08fc4756272 (patch) | |
tree | d8a25d9352ffbba6e6fc08e678d7465211198851 /src/sortdict.h | |
parent | 9e4e94fbabe856b8de4041ff2a27524f923343dc (diff) | |
download | Doxygen-bbd28a0ff4c70dccb9729e6ce515c08fc4756272.zip Doxygen-bbd28a0ff4c70dccb9729e6ce515c08fc4756272.tar.gz Doxygen-bbd28a0ff4c70dccb9729e6ce515c08fc4756272.tar.bz2 |
Release-1.2.11.1
Diffstat (limited to 'src/sortdict.h')
-rw-r--r-- | src/sortdict.h | 8 |
1 files changed, 7 insertions, 1 deletions
diff --git a/src/sortdict.h b/src/sortdict.h index e78d038..b716d33 100644 --- a/src/sortdict.h +++ b/src/sortdict.h @@ -130,6 +130,12 @@ class SDict } #endif } + /*! Remove an item from the dictionary */ + bool remove(const char *key) + { + T *item = m_dict->take(key); + return item ? m_list->remove(item) : FALSE; + } /*! Sorts the members of the dictionary. First appending a number * of members and then sorting them is faster (O(NlogN) than using * inSort() for each member (O(N^2)). @@ -170,7 +176,7 @@ class SDict } /*! Equavalent to find(). */ - T *operator[](const char *key) + T *operator[](const char *key) const { return m_dict->find(key); } |