title: Given a vector of objects, what's the quickest a range can be looked up?
body: <p>I have a vector of objects with fields min_length and max_length, I'd like to do a range look up on all the objects where length >= min_length and &lt;= max length.</p>
  
  <p>Performance is very critical so ideally I need to be able to do this in O(log n), is it possibile?</p>
  
  <p>I can't use any existing libraries so need to build this using just the basics. </p>
  
  <p>Thanks! </p>