org.opentripplanner.street.model.vertex.StreetVertex Maven / Gradle / Ivy
package org.opentripplanner.street.model.vertex;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Objects;
import java.util.Set;
import java.util.stream.Collectors;
import java.util.stream.Stream;
import org.opentripplanner.framework.i18n.I18NString;
import org.opentripplanner.framework.i18n.LocalizedString;
import org.opentripplanner.street.model.edge.Edge;
import org.opentripplanner.street.model.edge.StreetEdge;
import org.opentripplanner.street.search.TraverseMode;
import org.opentripplanner.transit.model.site.AreaStop;
/**
* Abstract base class for vertices in the street layer of the graph. This includes both vertices
* representing intersections or points (IntersectionVertices) and Elevator*Vertices.
*/
public abstract class StreetVertex extends Vertex {
private static final Set EMPTY_SET = Set.of();
/** All locations for flex transit, which this vertex is part of */
private Set areaStops = EMPTY_SET;
StreetVertex(double x, double y) {
super(x, y);
}
/**
* Creates intersection name out of all outgoing names
*
* This can be: - name of the street if it is only 1 - unnamedStreed (localized in requested
* language) if it doesn't have a name - corner of 0 and 1 (localized corner of zero and first
* street in the corner)
*
* @return already localized street names and non-localized corner of x and unnamedStreet
*/
public I18NString getIntersectionName() {
// generate names for corners when no name was given
Set uniqueNameSet = new HashSet<>();
for (Edge e : getOutgoing()) {
if (e instanceof StreetEdge) {
uniqueNameSet.add(e.getName());
}
}
List uniqueNames = new ArrayList<>(uniqueNameSet);
if (uniqueNames.size() > 1) {
return new LocalizedString("corner", uniqueNames.get(0), uniqueNames.get(1));
} else if (uniqueNames.size() == 1) {
return uniqueNames.get(0);
} else {
return new LocalizedString("unnamedStreet");
}
}
public boolean isConnectedToWalkingEdge() {
return this.getOutgoing()
.stream()
.anyMatch(
edge ->
edge instanceof StreetEdge &&
((StreetEdge) edge).getPermission().allows(TraverseMode.WALK)
);
}
/**
* Does the vertex have an outgoing edge that allows driving.
*/
public boolean isConnectedToDriveableEdge() {
return this.getOutgoing()
.stream()
.anyMatch(
edge ->
edge instanceof StreetEdge && ((StreetEdge) edge).getPermission().allows(TraverseMode.CAR)
);
}
public boolean isEligibleForCarPickupDropoff() {
return isConnectedToDriveableEdge() && isConnectedToWalkingEdge();
}
/**
* Returns the list of area stops that this vertex is inside of.
*/
public Set areaStops() {
return areaStops;
}
/**
* Add a collection of area stops to this vertex.
*/
public void addAreaStops(Collection toBeAdded) {
Objects.requireNonNull(toBeAdded);
synchronized (this) {
if (areaStops == EMPTY_SET) {
areaStops = Set.copyOf(toBeAdded);
} else {
areaStops = Stream.concat(areaStops.stream(), toBeAdded.stream()).collect(
Collectors.toUnmodifiableSet()
);
}
}
}
}