Re: Problem with map upper_bound
On Jul 6, 12:06 am, Greg Herlihy <gre...@pacbell.net> wrote:
On 7/5/07 12:52 PM, in article 468d4c24$0$887$edfad...@dread12.news.tele.=
dk,
"Henrik Goldman" <henrik_gold...@mail.tele.dk> wrote:
Assume we have a std::map<time_t, int>.
Now I would like to find all values (second) which fits in (within the =
time
range of first) between first of April 1st. and end of July. Notice tha=
t we
did not yet reach end of July yet.
Using lower_bound I can easily find the first data value within this ra=
nge.
However with upper_bound I get an invalid iterator when trying to get a
future data. Ideally I would like the last record which has the highest=
time
value.
std::map's upper_bound() method returns an iterator to the first element
whose key is greater than the specified search key (or the end() iterator=
if
no such element exists in the map).
So, provided that upper_bound() does not return an iterator equal to begi=
n()
(meaning that all elements in the map are greater than the search key), t=
hen
simply decrementing the iterator that upper_bound() returns - will give y=
ou
an iterator to the last element in the map whose key value is less than or
equal to the specified search key.
But of course, he probably doesn't want an iterator to the last
element. If he wants to find all values in the range, he is
probably better off using the half open interval returned by
lower_bound and upper_bound. (The functions have been designed
as they were for a reason.)
--
James Kanze (GABI Software) email:james.kanze@gmail.com
Conseils en informatique orient=E9e objet/
Beratung in objektorientierter Datenverarbeitung
9 place S=E9mard, 78210 St.-Cyr-l'=C9cole, France, +33 (0)1 30 23 00 34