RangeMap

A C++ class for efficiently solving the interval query problem.

Interval Query

Given a list L of intervals of the form [a, b) and a point p, determine the set of all intervals in L that contain p.

Usage

// ...
#include "RangeMap.h"

int main() {
  // Interval arrays of start (S) and end (E) points
  int S[] = {0, 5, 10, 15};
  int E[] = {8, 7, 13, 25};
  
  RangeMap<int> rm;
  rm.Build(S, E, 4);
  
  auto qr = rm.Query(20);
  
  return 0;
}