gistfile1.txt

Interval structure

Implement an efficient data structure for storing keys in intervals
mapping to values. The interval is defined as a 2-tuple: {low, high}.

When creating a new map the user can choose if the interval is open or
closed, in both ends.
Eg. given the left-closed, right-open map M=
[1, 10) -> a
[10, 20) -> b
[20, 30) -> c

find(1,M) = a
find(15,M) = b
find(20,M) = c
find(30,M) – EXCEPTION