40 MSVehicleContainer::VehicleDepartureVectorSortCrit::operator()
42 return e1.first < e2.first;
55 MSVehicleContainer::DepartFinder::operator()
57 return myTime +
DELTA_T > e.first && myTime <= e.first;
78 VehicleHeap::iterator i =
83 newElem.second.push_back(veh);
87 (*i).second.push_back(veh);
96 VehicleHeap::iterator i =
100 (*i).second.erase(std::remove((*i).second.begin(), (*i).second.end(), veh), (*i).second.end());
107 VehicleHeap::iterator j =
116 stored.reserve(stored.size() + cont.size());
117 copy(cont.begin(), cont.end(), back_inserter(stored));
127 for (
int i = (
int)
array.size(); i-- > 0;) {
128 assert(i < (
int)array2.size());
129 array2[i] =
array[i];
136 for (; hole > 1 && (x.first <
array[ hole / 2 ].first); hole /= 2) {
137 assert((
int)
array.size() > hole);
140 assert((
int)
array.size() > hole);
156 assert(
array.size() > 1);
157 return array[ 1 ].second;
166 assert(
array.size() > 1);
167 return array[ 1 ].first;
179 assert(
array.size() > 1);
200 assert((
int)
array.size() > hole);
208 if ((
array[ child ].first < tmp.first)) {
209 assert((
int)
array.size() > hole);
215 assert((
int)
array.size() > hole);
229 if (i !=
array.begin() + 1) {
232 std::cout << (*i).first;
234 std::cout << std::endl <<
"-------------------------" << std::endl;
239 strm <<
"------------------------------------" << std::endl;
242 for (MSVehicleContainer::VehicleVector::const_iterator i = v.begin(); i != v.end(); ++i) {
243 strm << (*i)->getParameter().depart << std::endl;