(t *testing.T)
| 155 | } |
| 156 | |
| 157 | func TestIntervalTree_All(t *testing.T) { |
| 158 | tree := NewIntervalTree() |
| 159 | |
| 160 | intervals := []ast.Interval{ |
| 161 | makeTestInterval(100, 200), |
| 162 | makeTestInterval(50, 75), |
| 163 | makeTestInterval(150, 250), |
| 164 | } |
| 165 | |
| 166 | for _, i := range intervals { |
| 167 | tree.Insert(i) |
| 168 | } |
| 169 | |
| 170 | count := 0 |
| 171 | tree.All(func(interval ast.Interval) error { |
| 172 | count++ |
| 173 | return nil |
| 174 | }) |
| 175 | |
| 176 | if count != len(intervals) { |
| 177 | t.Errorf("All() returned %d intervals, want %d", count, len(intervals)) |
| 178 | } |
| 179 | } |
| 180 | |
| 181 | func TestIntervalTree_Clear(t *testing.T) { |
| 182 | tree := NewIntervalTree() |
nothing calls this directly
no test coverage detected