Fun with lower_bound

#include <stdio.h>
#include <vector>
#include <algorithm>

struct Marker {
    char type;
    int start;
    int end;

    Marker(char t, int s, int e) : type(t), start(s), end(e) {}
};

static bool doesNotOverlap(const Marker& lhv, const Marker& rhv) {
    return lhv.end < rhv.start;
}


int main (int argc, const char * argv[]) {

    std::vector<Marker> markers;
    markers.push_back(Marker('X', 2, 8));
    markers.push_back(Marker('O', 3, 4));
    markers.push_back(Marker('X', 12, 20));

    Marker newMarker('X', 7, 9);

    std::vector<Marker>::const_iterator iter =
        std::lower_bound(markers.begin(), markers.end(), newMarker, doesNotOverlap);

    printf("Found the thing %d!\n", int(iter-markers.begin()));
    return 0;
}