Seeking algorithm: find last greater than

[Kenneth Porter]

I have a sorted vector of structs, each containing a upper limit of a
range:

struct Datum
{
double upper_limit;
// other stuff
};

std::vector<Datumdata;

Given an input value, I want to find the structure that goes with this
value.

Is there a simple STL idiom to search the vector for the matching
structure?

I'm thinking I need to iterate from rbegin() to rend() until I find (p->
upper_limit input) and then return --(p->base()).

[Daniel Pitts]

Kenneth Porter wrote:

I have a sorted vector of structs, each containing a upper limit of a
range:

struct Datum
{
double upper_limit;
// other stuff
};

std::vector<Datumdata;

Given an input value, I want to find the structure that goes with this
value.

Is there a simple STL idiom to search the vector for the matching
structure?

I'm thinking I need to iterate from rbegin() to rend() until I find (p->
upper_limit input) and then return --(p->base()).

Sounds like you might want to use std::lower_bound or std::upper_bound.

--
Daniel Pitts' Tech Blog: <http://virtualinfinity.net/wordpress/>