39 MSVehicleContainer::VehicleDepartureVectorSortCrit::operator()
41 return e1.first < e2.first;
54 MSVehicleContainer::DepartFinder::operator()
56 return myTime +
DELTA_T > e.first && myTime <= e.first;
77 VehicleHeap::iterator i =
82 newElem.second.push_back(veh);
86 (*i).second.push_back(veh);
95 VehicleHeap::iterator i =
99 (*i).second.erase(std::remove((*i).second.begin(), (*i).second.end(), veh), (*i).second.end());
106 VehicleHeap::iterator j =
115 stored.reserve(stored.size() + cont.size());
116 copy(cont.begin(), cont.end(), back_inserter(stored));
126 for (
int i = (
int)
array.size(); i-- > 0;) {
127 assert(i < (
int)array2.size());
128 array2[i] =
array[i];
135 for (; hole > 1 && (x.first <
array[ hole / 2 ].first); hole /= 2) {
136 assert((
int)
array.size() > hole);
139 assert((
int)
array.size() > hole);
155 assert(
array.size() > 1);
156 return array[ 1 ].second;
165 assert(
array.size() > 1);
166 return array[ 1 ].first;
178 assert(
array.size() > 1);
199 assert((
int)
array.size() > hole);
207 if ((
array[ child ].first < tmp.first)) {
208 assert((
int)
array.size() > hole);
214 assert((
int)
array.size() > hole);
228 if (i !=
array.begin() + 1) {
231 std::cout << (*i).first;
233 std::cout << std::endl <<
"-------------------------" << std::endl;
238 strm <<
"------------------------------------" << std::endl;
241 for (MSVehicleContainer::VehicleVector::const_iterator i = v.begin(); i != v.end(); ++i) {
242 strm << (*i)->getParameter().depart << std::endl;