Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Suppose I have a number of objects with a start value and an end value that are comparable via some Comparator.
What kind of collection can I use to make an index of the objects, so that given an arbitrary value V, I can find all the objects where V is between the start and end values?
I’m stumped.
See http://en.wikipedia.org/wiki/Interval_tree. You should probably ignore the complicated “centered tree” construction that occurs first there, and look instead at the “augmented tree” which is the standard way to do it.