smagellan / intervaltree Goto Github PK

Hi, I am Abhishek and a student. I am implementing a code which generates 
certain number of ranges. After generation of ranges I am trying to merge the 
overlapping ranges to form a certain set of ranges.(Overlap condition: if 
endElement of one range >= startElement of another range).

As I was thinking of using this code.I have a question. Can this method be used 
achieve the above results? If yes the please tell me how.

Looking forward to your reply.

what operating system?
Linux-Debian

Regards
Abhishek

I have started porting this interval tree implementation to C++11. As I am very 
new to C++ templates (learning about them for the past week or so) and know no 
C# to speak of, I have run into two problems:

1. The enumerators need to be converted into iterators (AFAIK). This also 
involves “unwrapping” the way they work. Sadly, “yield” isn’t 
available even in C++11.
2. The memory management needs to be checked. 

Please have a look and tell me if you can help out in any way: 
https://github.com/JanX2/intervaltree-cpp11

Pointers welcome ;)