blob: b74d36e1be9985b97c7cbfc5be912b00719c0a8e (
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
|
/*******************************************************************************
* Copyright (c) 2000, 2004 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Common Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/cpl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.compare.structuremergeviewer;
import java.util.ArrayList;
/**
* The standard implementation of a diff container element.
* <p>
* This class may be instantiated, or further subclassed.
* </p>
*/
public abstract class DiffContainer extends DiffElement implements IDiffContainer {
private static IDiffElement[] fgEmptyArray= new IDiffElement[0];
private ArrayList fChildren;
/**
* Creates a new container with the specified kind under the given parent.
*
* @param parent under which the new container is added as a child or <code>null</code>.
* @param kind of difference (defined in <code>Differencer</code>).
*/
public DiffContainer(IDiffContainer parent, int kind) {
super(parent, kind);
}
/**
* Tries to find the child with the given name.
* Returns <code>null</code> if no such child exists.
*
* @param name of the child to find
* @return the first element with a matching name
*/
public IDiffElement findChild(String name) {
Object[] children= getChildren();
for (int i= 0; i < children.length; i++) {
IDiffElement child= (IDiffElement) children[i];
if (name.equals(child.getName()))
return child;
}
return null;
}
/* (non Javadoc)
* see IDiffContainer.add
*/
public void add(IDiffElement diff) {
if (fChildren == null)
fChildren= new ArrayList();
fChildren.add(diff);
diff.setParent(this);
}
/*
* Removes the given child from this container.
* If the container becomes empty it is removed from its container.
*/
public void removeToRoot(IDiffElement child) {
if (fChildren != null) {
fChildren.remove(child);
child.setParent(null);
if (fChildren.size() == 0) {
IDiffContainer p= getParent();
if (p != null)
p.removeToRoot(this);
}
}
}
/**
* Removes the given child (non-recursively) from this container.
*
* @param child to remove
*/
public void remove(IDiffElement child) {
if (fChildren != null) {
fChildren.remove(child);
child.setParent(null);
}
}
/* (non Javadoc)
* see IDiffContainer.hasChildren
*/
public boolean hasChildren() {
return fChildren != null && fChildren.size() > 0;
}
/* (non Javadoc)
* see IDiffContainer.getChildren
*/
public IDiffElement[] getChildren() {
if (fChildren != null)
return (IDiffElement[]) fChildren.toArray(fgEmptyArray);
return fgEmptyArray;
}
}
|
