Well, it's quite easy if you put those entries into a collection of objects as you mentioned in your last thread. You just scan the collection for the ones that fall between the upper bound and the lower bound.
Did you have a more specific question?