blob: ab4dd67805b8f69a1cdd73bdb6a7727af1271e60 (
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
|
/*******************************************************************************
* Copyright (c) 2010 SAP AG.
* All rights reserved. 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:
* Mathias Kinzler (SAP AG) - initial implementation
*******************************************************************************/
package org.eclipse.egit.ui.internal.repository.tree;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;
import org.eclipse.core.runtime.IPath;
import org.eclipse.core.runtime.Path;
import org.eclipse.jgit.lib.Ref;
import org.eclipse.jgit.lib.Repository;
/**
* Represents the "Branch Hierarchy" node
*/
public class BranchHierarchyNode extends RepositoryTreeNode<IPath> {
/**
* Constructs the node.
*
* @param parent
* the parent node (may be null)
* @param repository
* the {@link Repository}
* @param path
* the path
*/
public BranchHierarchyNode(RepositoryTreeNode parent,
Repository repository, IPath path) {
// path must end with /
super(parent, RepositoryTreeNodeType.BRANCHHIERARCHY, repository, path.addTrailingSeparator());
}
/**
* @return the child paths
* @throws IOException
*/
public List<IPath> getChildPaths() throws IOException {
List<IPath> result = new ArrayList<>();
for (IPath myPath : getPathList()) {
if (getObject().isPrefixOf(myPath)) {
int segmentDiff = myPath.segmentCount()
- getObject().segmentCount();
if (segmentDiff > 1) {
IPath newPath = getObject().append(
myPath.segment(getObject().segmentCount()));
if (!result.contains(newPath))
result.add(newPath);
}
}
}
return result;
}
/**
* @return the direct child Refs (branches) only
* @throws IOException
*/
public List<Ref> getChildRefs() throws IOException {
List<Ref> childRefs = new ArrayList<>();
for (IPath myPath : getPathList()) {
if (getObject().isPrefixOf(myPath)) {
int segmentDiff = myPath.segmentCount()
- getObject().segmentCount();
if (segmentDiff == 1) {
Ref ref = getRepository()
.findRef(myPath.toPortableString());
childRefs.add(ref);
}
}
}
return childRefs;
}
/**
* @return all child Refs reachable from this hierarchy node
* @throws IOException
*/
public List<Ref> getChildRefsRecursive() throws IOException {
return getRepository().getRefDatabase()
.getRefsByPrefix(getObject().toPortableString()).stream()
.filter(ref -> !ref.isSymbolic()).collect(Collectors.toList());
}
private List<IPath> getPathList() throws IOException {
List<IPath> result = new ArrayList<>();
Map<String, Ref> refsMap = getRepository().getRefDatabase().getRefs(
getObject().toPortableString()); // getObject() returns path ending with /
for (Map.Entry<String, Ref> entry : refsMap.entrySet()) {
if (entry.getValue().isSymbolic())
continue;
result.add(getObject().append(new Path(entry.getKey())));
}
return result;
}
}
|