def test_not_overlap_end_equal(self):
    assert not dt_windows_intersect(datetime(2009, 10, 1, 6, 0), datetime(
        2009, 10, 1, 7, 0), datetime(2009, 10, 1, 5, 0), datetime(2009, 10,
        1, 6, 0))

def test_not_overlap_greater_than(self):
    assert not dt_windows_intersect(datetime(2009, 10, 1, 6, 0), datetime(
        2009, 10, 1, 7, 0), datetime(2009, 10, 1, 7, 30), datetime(2009, 10,
        1, 8, 0))

def test_not_overlap_start_equal(self):
    assert not dt_windows_intersect(datetime(2009, 10, 1, 6, 0), datetime(
        2009, 10, 1, 7, 0), datetime(2009, 10, 1, 7, 0), datetime(2009, 10,
        1, 8, 0))
Is there a standard Python data structure that keeps thing in sorted order?