Public Member Functions
	PreparedTransitSchedule (TransitSchedule schedule)

	PreparedTransitSchedule ()

double	getNextDepartureTime (final TransitRoute route, final TransitRouteStop stop, final double depTime)

Private Attributes
final Map< TransitRoute, double[]>	sortedDepartureCache = new ConcurrentHashMap<TransitRoute, double[]>()

Detailed Description

Allows fast queries of a TransitSchedule for the next departure of a given route at a given stop, from a given point in time. If you need further queries of a TransitSchedule, put them here!

(I renamed this class and put the TransitSchedule in the constructor to make the purpose clear. michaz '13)

Thread-safe.

Author: mrieser

Definition at line 43 of file PreparedTransitSchedule.java.

Constructor & Destructor Documentation

◆ PreparedTransitSchedule() [1/2]

org.matsim.pt.router.PreparedTransitSchedule.PreparedTransitSchedule ( TransitSchedule schedule )

Definition at line 59 of file PreparedTransitSchedule.java.

                                                              {
 
     }

◆ PreparedTransitSchedule() [2/2]

org.matsim.pt.router.PreparedTransitSchedule.PreparedTransitSchedule ( )

Definition at line 67 of file PreparedTransitSchedule.java.

                                      {
 
     }

Member Function Documentation

◆ getNextDepartureTime()

double org.matsim.pt.router.PreparedTransitSchedule.getNextDepartureTime	(	final TransitRoute	route,
		final TransitRouteStop	stop,
		final double	depTime
	)

Definition at line 71 of file PreparedTransitSchedule.java.

References org.matsim.pt.transitSchedule.api.TransitRouteStop.getDepartureOffset(), org.matsim.pt.transitSchedule.api.TransitRoute.getDepartures(), and org.matsim.core.utils.misc.OptionalTime.seconds.

                                                                                                                     {
 
         double earliestDepartureTimeAtTerminus = depTime - stop.getDepartureOffset().seconds();
         // This shifts my time back to the terminus.
 
         if (earliestDepartureTimeAtTerminus >= MIDNIGHT) {
             earliestDepartureTimeAtTerminus = earliestDepartureTimeAtTerminus % MIDNIGHT;
         }
         if (earliestDepartureTimeAtTerminus < 0) {
             // this may happen when depTime < departureOffset, e.g. I want to start at 24:03, but the bus departs at 23:55 at terminus
             earliestDepartureTimeAtTerminus += MIDNIGHT;
         }
 
         // this will search for the terminus departure that corresponds to my departure at the stop:
         double[] cache = sortedDepartureCache.get(route);
         if (cache == null) {
             cache = new double[route.getDepartures().size()];
             int i = 0;
             for (Departure dep : route.getDepartures().values()) {
                 cache[i++] = dep.getDepartureTime();
             }
             Arrays.sort(cache);
             sortedDepartureCache.put(route, cache);
         }
         int pos = Arrays.binarySearch(cache, earliestDepartureTimeAtTerminus);
         if (pos < 0) {
             // (if the departure time is not found _exactly_, binarySearch returns (-(insertion point) - 1).  That is
             // retval = -(insertion point) - 1  or insertion point = -(retval+1) .
             // This will, in fact, be the normal situation, so it is important to understand this.)
             pos = -(pos + 1);
         }
         if (pos >= cache.length) {
             pos = 0; // there is no later departure time, take the first in the morning
         }
         double bestDepartureTime = cache[pos];
         // (departure time at terminus)
 
         bestDepartureTime += stop.getDepartureOffset().seconds();
         // (resulting departure time at stop)
 
         while (bestDepartureTime < depTime) {
             bestDepartureTime += MIDNIGHT;
             // (add enough "MIDNIGHT"s until we are _after_ the desired departure time)
         }
         return bestDepartureTime;
     }