If you make a test:
map<string, int> m;
m["k"] = 3;
if (m.lower_bound("a") == m.end()) {
cout << "This should not happen";
}
But it happens, becuase upper_bound and lower_bound uses find instead of ifind.
And it does also happen because we suppose that upper_bound is always the next one of the one returned, but it can be the next one, or not depending if it existed already.
For more information about the behaviour it should have:
http://www.sgi.com/tech/stl/SortedAssociativeContainer.html [^]
PATCH 1. The not intrusive patch.
Just used ifind instead of find in all the map::lower_bound map::upper_bound. Minimum lines to solve the problem.
PATCH 2. ifind is a non standard name to lower_bound.
Due to the fact the the non-standard function ifind performs the same operation than lower_bound do, I think it should be renamed to be lower_bound, and every function that uses ifind should use lower_bound. This way you avoid introducing a non standard concept of lower_bound.
I prefer the second one, but you could use the first one if you think the second one is too intrusive.
uclibcxx-0.1.9-map_bound-1.patch [^] (1,893 bytes) 06-17-05 06:13 uclibcxx-0.1.9-map_bound-2.patch [^] (8,214 bytes) 06-17-05 06:14 
