19 package tutorial.programming.example21tutorialTUBclass.class2016.events;
21 import java.util.HashMap;
53 public void reset(
int iteration) {
54 distanceDistribution =
new int[30];
59 if (travelledDistance.containsKey(event.
getPersonId())){
60 vehicles2Persons.put(event.
getVehicleId(),
event.getPersonId());
66 if (this.travelledDistance.containsKey(event.
getPersonId())){
67 double distance = this.travelledDistance.get(event.
getPersonId());
69 int distanceInKm = (int) (distance/1000);
70 if (distanceInKm>29) {
74 this.distanceDistribution[distanceInKm]++;
82 if (!event.
getPersonId().toString().startsWith(
"pt_")){
90 if (this.vehicles2Persons.containsKey(event.
getVehicleId())){
91 Id<Person> personId = this.vehicles2Persons.get(event.
getVehicleId());
92 double distanceSoFarTravelled = this.travelledDistance.get(personId);
94 double newDistanceTravelled = distanceSoFarTravelled+length;
95 this.travelledDistance.put(personId, newDistanceTravelled);
101 if (this.vehicles2Persons.containsKey(event.
getVehicleId())){
Id< Vehicle > getVehicleId()
int[] distanceDistribution
void handleEvent(LinkEnterEvent event)
void handleEvent(PersonLeavesVehicleEvent event)
CarTravelDistanceEvaluator(Network network)
void handleEvent(PersonDepartureEvent event)
Id< Person > getPersonId()
int[] getDistanceDistribution()
Map< Id< Vehicle >, Id< Person > > vehicles2Persons
Map< Id< Person >, Double > travelledDistance
void handleEvent(PersonArrivalEvent event)
Id< Person > getPersonId()
Id< Person > getPersonId()
Map< Id< Link >,?extends Link > getLinks()
void handleEvent(PersonEntersVehicleEvent event)
Id< Vehicle > getVehicleId()
Id< Vehicle > getVehicleId()
void reset(int iteration)