This library is an immutable implementation of the Interval Tree data structure.
Interval Trees are useful anytime you need to store and find overlapping intervals.
This is a good overview with examples: http://www.dgp.toronto.edu/people/JamesStewart/378notes/22intervals/
Guava is required, and JUnit is required just for the unit test.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.