-
Notifications
You must be signed in to change notification settings - Fork 0
/
busRoute.pde
207 lines (183 loc) · 6.06 KB
/
busRoute.pde
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
class busRoute {
String routeNumber; //some are non-numeric, eg. D6
ArrayList<busStop> outwardLeg;
ArrayList<busStop> returnLeg;
busRoute(String rN) {
routeNumber = rN;
outwardLeg = new ArrayList<busStop>();
returnLeg = new ArrayList<busStop>();
}
}
class busRouteList {
private ArrayList<busRoute> routes;
//load the data file into routes
busRouteList(String filePath) {
//load the data file
String[] routeFile = loadStrings(filePath);
println("Loaded bus routes by " + millis() + " milliseconds");
//create new container
routes = new ArrayList<busRoute>();
//go through data line by line
for (int i = 1; i < routeFile.length; i++) {
String[] routeData = split(routeFile[i], ",");
//only bother if it's a valid line
if (routeData.length > 5) {
String routeNumber = trim(routeData[0]);
boolean outwardLeg = true;
if ((int(trim(routeData[1])) % 2) == 0) {
outwardLeg = false;
}
//get the stop and check it's real
String stopLBSL = trim(routeData[3]);
busStop thisStop = busStops.get(stopLBSL);
if (thisStop != null) {
//add it to the route!
busRoute thisRoute = this.get(routeNumber);
//add a new bus route if it doesn't already exist
if (thisRoute == null) {
thisRoute = new busRoute(routeNumber);
routes.add(thisRoute);
}
ArrayList<busStop> thisLeg;
int legNumber;
//work out which leg it's for
if (outwardLeg) {
thisLeg = thisRoute.outwardLeg;
legNumber = 1;
}
else {
thisLeg = thisRoute.returnLeg;
legNumber = 2;
}
//add the stop to this route of the leg
thisLeg.add(thisStop);
//add route/leg to the stop
stopRoute thisStopRoute = thisStop.getStopRoute(routeNumber);
if (thisStopRoute == null) {
//make a new one
thisStopRoute = new stopRoute(thisRoute, outwardLeg, !outwardLeg);
thisStop.routes.add(thisStopRoute);
}
else {
//it's already there, just flag that they stop both ways
thisStopRoute.outwardLeg = true;
thisStopRoute.returnLeg = true;
}
}
}
}
println("Processed bus routes by " + millis() + " milliseconds");
}
int size() {
return routes.size();
}
//how many stops on a route?
int totalStops() {
int count = 0;
for (int i = 0; i < routes.size(); i++) {
busRoute thisRoute = (busRoute)routes.get(i);
count += thisRoute.outwardLeg.size();
count += thisRoute.returnLeg.size();
}
return count;
}
//lookup by number
busRoute get(String routeNumber) {
for (int i = 0; i < routes.size(); i++) {
busRoute thisRoute = (busRoute)routes.get(i);
if (thisRoute.routeNumber.equals(routeNumber)) {
return thisRoute;
}
}
return null;
}
//
ArrayList<busStop> getStops(String routeNumber, boolean outward) {
for (int i = 0; i < routes.size(); i++) {
busRoute thisRoute = (busRoute)routes.get(i);
if (thisRoute.routeNumber.equals(routeNumber)) {
if (outward) {
return thisRoute.outwardLeg;
}
else {
return thisRoute.returnLeg;
}
}
}
return null;
}
//this is the time-consuming bit -> looking up to see if this pair already exists
void makePairs() {
for (int i = 0; i < routes.size(); i++) {
busRoute thisRoute = (busRoute)routes.get(i);
for (int j = 0; j < thisRoute.outwardLeg.size() - 1; j++) {
busStop firstStop = (busStop)thisRoute.outwardLeg.get(j);
busStop secondStop = (busStop)thisRoute.outwardLeg.get(j + 1);
stopPair thisPair = stopPairs.getLocation(firstStop.easting, firstStop.northing, secondStop.easting, secondStop.northing);
if (thisPair == null) {
thisPair = new stopPair(firstStop, secondStop);
stopPairs.add(thisPair);
}
else {
thisPair.busCount++;
if (thisPair.busCount > stopPairs.busiest) {
stopPairs.busiest = thisPair.busCount;
}
}
}
for (int j = 0; j < thisRoute.returnLeg.size() - 1; j++) {
busStop firstStop = (busStop)thisRoute.returnLeg.get(j);
busStop secondStop = (busStop)thisRoute.returnLeg.get(j + 1);
stopPair thisPair = stopPairs.getLocation(firstStop.easting, firstStop.northing, secondStop.easting, secondStop.northing);
if (thisPair == null) {
thisPair = new stopPair(firstStop, secondStop);
stopPairs.add(thisPair);
}
else {
thisPair.busCount++;
if (thisPair.busCount > stopPairs.busiest) {
stopPairs.busiest = thisPair.busCount;
}
}
}
}
stopPairs.updateScales();
stopPairs.updateScreen();
println("Made bus stop pairs by " + millis() + " milliseconds");
}
}
class stopRoute implements Comparable {
busRoute route;
boolean outwardLeg = false;
boolean returnLeg = false;
stopRoute(busRoute r, boolean out, boolean rtn) {
route = r;
if (out) {
outwardLeg = true;
}
if (rtn) {
returnLeg = true;
}
}
int compareTo(Object s) {
stopRoute sR = (stopRoute)s;
String route1 = this.route.routeNumber;
int iRoute1 = int(route1);
String route2 = sR.route.routeNumber;
int iRoute2 = int(route2);
//case 1: a is non-numeric, b is numeric -> b comes first
if ((iRoute1 == 0) && (iRoute2 != 0)) {
return 1;
}
//case 2: a is numeric, b is non-numeric -> a comes first
if ((iRoute1 != 0) && (iRoute2 == 0)) {
return -1;
}
//case 3: both are numeric -> lowered number comes first
if ((iRoute1 != 0) && (iRoute2 != 0)) {
return iRoute1 - iRoute2;
}
//case 4: neither is numeric -> sort as strings
return route1.compareTo(route2);
}
}