/
VirtualEdgeIterator.java
220 lines (186 loc) · 4.86 KB
/
VirtualEdgeIterator.java
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* Copyright 2015 Peter Karich.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.graphhopper.routing;
import com.graphhopper.routing.util.FlagEncoder;
import com.graphhopper.util.*;
import java.util.ArrayList;
import java.util.List;
/**
* @author Peter Karich
*/
class VirtualEdgeIterator implements EdgeIterator, CHEdgeIteratorState
{
private final List<EdgeIteratorState> edges;
private int current;
public VirtualEdgeIterator( int edgeCount )
{
edges = new ArrayList<EdgeIteratorState>(edgeCount);
reset();
}
void add( EdgeIteratorState edge )
{
edges.add(edge);
}
EdgeIterator reset()
{
current = -1;
return this;
}
int count()
{
return edges.size();
}
@Override
public boolean next()
{
current++;
return current < edges.size();
}
@Override
public EdgeIteratorState detach( boolean reverse )
{
if (reverse)
throw new IllegalStateException("Not yet supported");
return edges.get(current);
}
@Override
public int getEdge()
{
return edges.get(current).getEdge();
}
@Override
public int getBaseNode()
{
return edges.get(current).getBaseNode();
}
@Override
public int getAdjNode()
{
return edges.get(current).getAdjNode();
}
@Override
public PointList fetchWayGeometry( int mode )
{
return edges.get(current).fetchWayGeometry(mode);
}
@Override
public EdgeIteratorState setWayGeometry( PointList list )
{
return edges.get(current).setWayGeometry(list);
}
@Override
public double getDistance()
{
return edges.get(current).getDistance();
}
@Override
public EdgeIteratorState setDistance( double dist )
{
return edges.get(current).setDistance(dist);
}
@Override
public long getFlags()
{
return edges.get(current).getFlags();
}
@Override
public EdgeIteratorState setFlags( long flags )
{
return edges.get(current).setFlags(flags);
}
@Override
public String getName()
{
return edges.get(current).getName();
}
@Override
public EdgeIteratorState setName( String name )
{
return edges.get(current).setName(name);
}
@Override
public boolean getBoolean( int key, boolean reverse, boolean _default )
{
return edges.get(current).getBoolean(key, reverse, _default);
}
@Override
public String toString()
{
return edges.toString();
}
@Override
public int getAdditionalField()
{
return edges.get(current).getAdditionalField();
}
@Override
public EdgeIteratorState setAdditionalField( int value )
{
return edges.get(current).setAdditionalField(value);
}
@Override
public EdgeIteratorState copyPropertiesTo( EdgeIteratorState edge )
{
return edges.get(current).copyPropertiesTo(edge);
}
@Override
public boolean isBackward( FlagEncoder encoder )
{
return edges.get(current).isBackward(encoder);
}
@Override
public boolean isForward( FlagEncoder encoder )
{
return edges.get(current).isForward(encoder);
}
@Override
public boolean isShortcut()
{
EdgeIteratorState edge = edges.get(current);
return edge instanceof CHEdgeIteratorState && ((CHEdgeIteratorState) edge).isShortcut();
}
@Override
public double getWeight()
{
// will be called only from PreparationWeighting and if isShortcut is true
return ((CHEdgeIteratorState) edges.get(current)).getWeight();
}
@Override
public CHEdgeIteratorState setWeight( double weight )
{
throw new UnsupportedOperationException("Not supported.");
}
@Override
public int getSkippedEdge1()
{
throw new UnsupportedOperationException("Not supported.");
}
@Override
public int getSkippedEdge2()
{
throw new UnsupportedOperationException("Not supported.");
}
@Override
public void setSkippedEdges( int edge1, int edge2 )
{
throw new UnsupportedOperationException("Not supported.");
}
@Override
public boolean canBeOverwritten( long flags )
{
throw new UnsupportedOperationException("Not supported.");
}
}