Class TreeNodeTest

src/test/java/com/lodborg/intervaltree/TreeNodeTest.java:11–237

import java.util.*;

public class TreeNodeTest {
	@Test
	public void test_iteratorNormal(){
		IntervalTree<Integer> tree = new IntervalTree<>();
		Interval<Integer>[] arr = new IntegerInterval[]{
				new IntegerInterval(6, 10, Bounded.OPEN),
				new IntegerInterval(2, 100, Bounded.CLOSED),
				new IntegerInterval(8, 20, Bounded.CLOSED),
				new IntegerInterval(-2, 0, Bounded.CLOSED),
				new IntegerInterval(-3, 0, Bounded.CLOSED_RIGHT),
				new IntegerInterval(10, 20, Bounded.CLOSED_LEFT),
				new IntegerInterval(11, 14, Bounded.CLOSED_LEFT),
				new IntegerInterval(-20, -10, Bounded.CLOSED),
				new IntegerInterval(-14, -11, Bounded.CLOSED),
				new IntegerInterval(-14, -10, Bounded.OPEN),
				new IntegerInterval(0, 4, Bounded.OPEN)
		};
		for (Interval<Integer> interval: arr)
			tree.add(interval);
		List<Interval<Integer>> list = new ArrayList<>();
		for (Interval<Integer> interval: tree)
			list.add(interval);

		assertThat(new HashSet<>(Arrays.asList(arr)), is(new HashSet<>(list)));
		assertEquals(arr.length, list.size());
	}

	@Test
	public void test_iteratorEmpty(){
		IntervalTree<Integer> tree = new IntervalTree<>();
		assertFalse(tree.iterator().hasNext());
		tree.add(new IntegerInterval(1, 3, Bounded.CLOSED));
		Iterator<Interval<Integer>> it = tree.iterator();
		it.next();
		assertFalse(it.hasNext());
		try{
			it.next();
			fail();
		} catch (Exception e){
			assertTrue(e instanceof NoSuchElementException);
		}
	}

	@Test
	public void test_iteratorBackToRootWithMultipleIntervals(){
		IntervalTree<Integer> tree = new IntervalTree<>();
		Set<Interval<Integer>> set = new HashSet<>(new ArrayList<Interval<Integer>>(Arrays.asList(
				new IntegerInterval(12, 22, Bounded.CLOSED_RIGHT),
				new IntegerInterval(12, 25, Bounded.CLOSED_RIGHT),
				new IntegerInterval(0, 10, Bounded.CLOSED_RIGHT)
		)));
		for (Interval<Integer> next: set)
			tree.add(next);
		Set<Interval<Integer>> result = new HashSet<>();
		for (Interval<Integer> next: tree)
			result.add(next);
		assertThat(set, is(result));
	}