blob: d42942a4674483aa69d958e38ae85b5a26736164 (
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
|
//
// ========================================================================
// Copyright (c) 1995-2013 Mort Bay Consulting Pty. Ltd.
// ------------------------------------------------------------------------
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// and Apache License v2.0 which accompanies this distribution.
//
// The Eclipse Public License is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// The Apache License v2.0 is available at
// http://www.opensource.org/licenses/apache2.0.php
//
// You may elect to redistribute this code under either of these licenses.
// ========================================================================
//
package org.eclipse.jetty.deploy.graph;
import java.util.List;
import java.util.concurrent.CopyOnWriteArrayList;
public class Path
{
private final List<Edge> _edges = new CopyOnWriteArrayList<Edge>();
private final List<Node> _nodes = new CopyOnWriteArrayList<Node>();
public Path()
{
}
public void add(Edge edge)
{
_edges.add(edge);
if (_nodes.size() == 0)
{
_nodes.add(edge.getFrom());
}
else
{
assert _nodes.get(_nodes.size() - 1).equals(edge.getFrom());
}
_nodes.add(edge.getTo());
}
public Path forkPath()
{
Path ep = new Path();
for (Edge edge : _edges)
{
ep.add(edge);
}
return ep;
}
public List<Node> getNodes()
{
return _nodes;
}
public List<Node> getEdges()
{
return _nodes;
}
public Node getNode(int index)
{
return _nodes.get(index);
}
public Node firstNode()
{
if (_nodes.size() == 0)
{
return null;
}
return _nodes.get(0);
}
public Node lastNode()
{
if (_nodes.size() == 0)
{
return null;
}
return _nodes.get(_nodes.size() - 1);
}
public int nodes()
{
return _nodes.size();
}
public int edges()
{
return _edges.size();
}
public boolean isEmpty()
{
return _edges.isEmpty();
}
public Edge firstEdge()
{
if (_edges.size() == 0)
{
return null;
}
return _edges.get(0);
}
public Edge lastEdge()
{
if (_edges.size() == 0)
{
return null;
}
return _edges.get(_edges.size() - 1);
}
public Edge getEdge(int index)
{
return _edges.get(index);
}
@Override
public String toString()
{
return super.toString() + _nodes.toString();
}
}
|
