Fast queries to find the set of overlapping intervals in a collection of intervals. The interval could be of class Interval or Timespan. As of Oct 13 2011 does not include methods to insert or delete an interval from the tree. Using Timespans is slower than DateTree to create the tree but much faster to query. Converting the Timespans to Intervals of seconds speeds things up considerably.
Employee-Example2-rm.1.mcz