Jean-Paul Chaput e22e7f7476 IntervalTree is now support multiple intervals with same lower bound. ... * New: Interval::CompareByMinMax, lexicographical comparison of Intervals, first compare the lower bound (VMin) then the upper bound (VMax). Needed for IntervalTree. * Change: In IntervalTree, the key comparison was only based on the lower bound (VMin). That means that the tree would accept only one interval for a given VMin. You couldn't store both [1:4] and [1:5]. Now use CompareByMinMax that allows it.		2023-03-28 14:52:23 +02:00
..
cmake_modules	Don't link libpython, it isn't there in manylinux	2023-02-21 16:10:55 +01:00
doc	Regenerated documentation, just to check.	2023-02-22 15:02:39 +01:00
src	IntervalTree is now support multiple intervals with same lower bound.	2023-03-28 14:52:23 +02:00
tests	* All Tools:	2012-12-03 08:26:28 +00:00
CMakeLists.txt	Downgrade CMake requirements to 3.16. Detects correctly Python 3.	2023-03-03 15:36:40 +01:00