/**
* Copyright (C) 2011 Brian Ferris <bdferris@onebusaway.org>
*
* 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 org.onebusaway.transit_data_federation.services.beans;
import java.util.List;
import org.onebusaway.exceptions.ServiceException;
import org.onebusaway.geospatial.model.CoordinatePoint;
import org.onebusaway.transit_data.model.ListBean;
import org.onebusaway.transit_data.model.oba.LocalSearchResult;
import org.onebusaway.transit_data.model.oba.MinTravelTimeToStopsBean;
import org.onebusaway.transit_data.model.oba.TimedPlaceBean;
import org.onebusaway.transit_data.model.tripplanning.ConstraintsBean;
import org.onebusaway.transit_data.model.tripplanning.TransitLocationBean;
import org.onebusaway.transit_data.model.tripplanning.ItinerariesBean;
import org.onebusaway.transit_data.model.tripplanning.TransitShedConstraintsBean;
import org.onebusaway.transit_data.model.tripplanning.VertexBean;
public interface ItinerariesBeanService {
/**
*
* @param from
* @param to
* @param targetTime TODO
* @param constraints
* @return a list of trip plans computed between the two locations with the
* specified constraints
* @throws ServiceException
*/
public ItinerariesBean getItinerariesBetween(TransitLocationBean from,
TransitLocationBean to, long targetTime, ConstraintsBean constraints)
throws ServiceException;
public ListBean<VertexBean> getStreetGraphForRegion(double latFrom,
double lonFrom, double latTo, double lonTo);
public MinTravelTimeToStopsBean getMinTravelTimeToStopsFrom(
CoordinatePoint location, long time,
TransitShedConstraintsBean constraints);
/**
* Given a set of stops with min-travel time already determined, and a set of
* nearby places, complete the best plan calculation for each by looking for
* valid walking paths from stops to places and keeping the shortest paths.
*
* @param constraints
* @param travelTimes
* @param localResults
* @return
* @throws ServiceException
*/
public List<TimedPlaceBean> getLocalPaths(
ConstraintsBean constraints,
MinTravelTimeToStopsBean travelTimes, List<LocalSearchResult> localResults)
throws ServiceException;
}