- Add the Codota plugin to your IDE and get smart completions
private void myMethod () {}
private double getWalkDisutility(Person person, Coord coord, Coord toCoord) { return this.ttCalculator.getWalkTravelDisutility(person, coord, toCoord); }
@Override public double getWalkTravelDisutility(Person person, Coord coord, Coord toCoord) { return routerDisutility.getWalkTravelDisutility(person, coord, toCoord); }
/** * Get the very next transitNode. * @param person Which person we are routing for. For default leave null. * @param coord The origin of the tree. * @param departureTime The time the person departures at the origin. * @return the next transitNode. */ private Map<Node, InitialNode> locateWrappedNearestTransitNode(Person person, Coord coord, double departureTime) { TransitRouterNetwork.TransitRouterNetworkNode nearestNode = network.getNearestNode(coord); Map<Node, InitialNode> wrappedNearestNodes = new LinkedHashMap<>(); Coord toCoord = nearestNode.stop.getStopFacility().getCoord(); double initialTime = travelDisutility.getWalkTravelTime(person, coord, toCoord); double initialCost = travelDisutility.getWalkTravelDisutility(person, coord, toCoord); wrappedNearestNodes.put(nearestNode, new InitialNode(initialCost, initialTime + departureTime)); return wrappedNearestNodes; }