blob: 825e8cfc45872986939ab71f469a49a9e5fd013f (
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
|
/*******************************************************************************
* Copyright (c) 2007, 2008 Wind River Systems, Inc. and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Markus Schorn - initial API and implementation
*******************************************************************************/
package org.eclipse.cdt.internal.ui.typehierarchy;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import org.eclipse.cdt.core.model.ICElement;
class THGraphNode {
private List<THGraphEdge> fOutgoing= Collections.emptyList();
private List<THGraphEdge> fIncoming= Collections.emptyList();
private ICElement fElement;
private ICElement[] fMembers= null;
THGraphNode(ICElement element) {
fElement= element;
}
void startEdge(THGraphEdge outgoing) {
fOutgoing= addElement(fOutgoing, outgoing);
}
void endEdge(THGraphEdge incoming) {
fIncoming= addElement(fIncoming, incoming);
}
ICElement getElement() {
return fElement;
}
private List<THGraphEdge> addElement(List<THGraphEdge> list, THGraphEdge elem) {
switch (list.size()) {
case 0:
return Collections.singletonList(elem);
case 1:
list= new ArrayList<THGraphEdge>(list);
list.add(elem);
return list;
}
list.add(elem);
return list;
}
List<THGraphEdge> getOutgoing() {
return fOutgoing;
}
List<THGraphEdge> getIncoming() {
return fIncoming;
}
public void setMembers(ICElement[] array) {
fMembers= array;
}
public ICElement[] getMembers(boolean addInherited) {
if (!addInherited) {
return fMembers;
}
ArrayList<ICElement> list= new ArrayList<ICElement>();
collectMembers(new HashSet<THGraphNode>(), list);
return list.toArray(new ICElement[list.size()]);
}
private void collectMembers(HashSet<THGraphNode> visited, List<ICElement> list) {
if (visited.add(this)) {
if (fMembers != null) {
list.addAll(Arrays.asList(fMembers));
}
List<THGraphEdge> bases= getOutgoing();
for (Iterator<THGraphEdge> iterator = bases.iterator(); iterator.hasNext();) {
THGraphEdge edge = iterator.next();
edge.getEndNode().collectMembers(visited, list);
}
}
}
}
|
