Clear the map
| 189 | |
| 190 | // Clear the map |
| 191 | void clear() |
| 192 | { |
| 193 | TreeAccessor treeAccessor(&tree); |
| 194 | |
| 195 | if (treeAccessor.getFirst()) |
| 196 | { |
| 197 | while (true) |
| 198 | { |
| 199 | KeyValuePair* temp = treeAccessor.current(); |
| 200 | bool haveMore = treeAccessor.fastRemove(); |
| 201 | delete temp; |
| 202 | if (!haveMore) |
| 203 | break; |
| 204 | } |
| 205 | } |
| 206 | |
| 207 | mCount = 0; |
| 208 | } |
| 209 | |
| 210 | // Returns true if value existed |
| 211 | bool remove(const KeyType& key) |
nothing calls this directly
no test coverage detected