Skip to main content
aboutsummaryrefslogtreecommitdiffstats
blob: 5f5763053e6a3fa76b19757cac70c585df86a261 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/*******************************************************************************
 * Copyright (c) 2006, 2008 IBM Corporation and others.
 *
 * This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License 2.0
 * which accompanies this distribution, and is available at
 * https://www.eclipse.org/legal/epl-2.0/
 *
 * SPDX-License-Identifier: EPL-2.0
 *
 * Contributors:
 *     IBM Corporation - initial API and implementation
 *******************************************************************************/
package org.eclipse.ui.workbench.texteditor.tests.rulers;

import static org.junit.Assert.*;

import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.Set;

import org.junit.Test;

import org.eclipse.ui.internal.texteditor.rulers.DAG;

/**
 * @since 3.3
 */
public class DAGTest {
	private static final Object A= "A";
	private static final Object B= "B";
	private static final Object C= "C";
	private static final Object D= "D";
	private static final Set<Object> AS= Collections.singleton(A);
	private static final Set<Object> BS= Collections.singleton(B);
	private static final Set<Object> CS= Collections.singleton(C);
	private static final Set<Object> AD= new LinkedHashSet<>(Arrays.asList(new Object[] { A, D }));
	private static final Set<Object> CD= new LinkedHashSet<>(Arrays.asList(new Object[] { C, D }));
	private static final Set<Object> ACD= new LinkedHashSet<>(Arrays.asList(new Object[] { A, C, D }));
	private static final Set<Object> BD= new LinkedHashSet<>(Arrays.asList(new Object[] { B, D }));

	private DAG<Object> fDag= new DAG<>();

	@Test
	public void testEmpty() throws Exception {
		assertTrue(fDag.getChildren(new Object()).isEmpty());
		assertTrue(fDag.getSources().isEmpty());
		assertTrue(fDag.getSinks().isEmpty());
	}
	
	@Test
	public void testIllegal() throws Exception {
		assertFalse(fDag.addEdge(A, A));
		try {
			fDag.addEdge(A, null);
			fail();
		} catch (RuntimeException x) {
		}
		try {
			fDag.addEdge(null, A);
			fail();
		} catch (RuntimeException x) {
		}
		try {
			fDag.addEdge(null, null);
			fail();
		} catch (RuntimeException x) {
		}
		try {
			fDag.addVertex(null);
			fail();
		} catch (RuntimeException x) {
		}
	}
	
	@Test
	public void testDag() throws Exception {
		assertTrue(fDag.addEdge(A, B));
		assertEquals(AS, fDag.getSources());
		assertEquals(BS, fDag.getSinks());
		assertFalse(fDag.addEdge(B, A));
		assertEquals(AS, fDag.getSources());
		assertEquals(BS, fDag.getSinks());
		assertEquals(BS, fDag.getChildren(A));
		assertTrue(fDag.getChildren(B).isEmpty());
		assertTrue(fDag.getChildren(C).isEmpty());
		assertTrue(fDag.getChildren(D).isEmpty());

		assertTrue(fDag.addEdge(B, C));
		assertEquals(AS, fDag.getSources());
		assertEquals(CS, fDag.getSinks());
		assertEquals(BS, fDag.getChildren(A));
		assertEquals(CS, fDag.getChildren(B));
		assertTrue(fDag.getChildren(C).isEmpty());
		assertTrue(fDag.getChildren(D).isEmpty());

		fDag.addVertex(C);
		assertEquals(AS, fDag.getSources());
		assertEquals(CS, fDag.getSinks());
		assertEquals(BS, fDag.getChildren(A));
		assertEquals(CS, fDag.getChildren(B));
		assertTrue(fDag.getChildren(C).isEmpty());
		assertTrue(fDag.getChildren(D).isEmpty());

		fDag.addVertex(D);
		assertEquals(AD, fDag.getSources());
		assertEquals(CD, fDag.getSinks());
		assertEquals(BS, fDag.getChildren(A));
		assertEquals(CS, fDag.getChildren(B));
		assertTrue(fDag.getChildren(C).isEmpty());
		assertTrue(fDag.getChildren(D).isEmpty());

		fDag.removeVertex(A);
		assertEquals(BD, fDag.getSources());
		assertEquals(CD, fDag.getSinks());
		assertTrue(fDag.getChildren(A).isEmpty());
		assertEquals(CS, fDag.getChildren(B));
		assertTrue(fDag.getChildren(C).isEmpty());
		assertTrue(fDag.getChildren(D).isEmpty());

		assertTrue(fDag.addEdge(A, B));
		assertTrue(fDag.addEdge(D, B));
		assertEquals(AD, fDag.getSources());
		assertEquals(CS, fDag.getSinks());
		assertEquals(BS, fDag.getChildren(A));
		assertEquals(CS, fDag.getChildren(B));
		assertTrue(fDag.getChildren(C).isEmpty());
		assertEquals(BS, fDag.getChildren(D));

		fDag.removeVertex(B);
		assertEquals(ACD, fDag.getSources());
		assertEquals(ACD, fDag.getSinks());
		assertTrue(fDag.getChildren(A).isEmpty());
		assertTrue(fDag.getChildren(B).isEmpty());
		assertTrue(fDag.getChildren(C).isEmpty());
		assertTrue(fDag.getChildren(D).isEmpty());
	}
}

Back to the top