C implementation of an interval tree?

Question

I could find a C++ one here, but no pure C one. Any pointers?

Answer 1

If you limit the data to nonoverlapping segments, you can use the <search.h> tsearch/tfind etc. binary-tree functions, whereby you use the integer interval tuples as keys. A supplied comparison function would easily put a total-order on segments. To find a segment that includes a given point, tfind for a synthetic interval of width 0.

Answer 2

C code for a red and black tree, licensed with the very generous MIT license.

_{(Backup at archive.org.)}