87 INVALID_STRING_ID |
86 INVALID_STRING_ID |
88 }; |
87 }; |
89 |
88 |
90 void BuildVehicleList(VehicleListBase *vl, PlayerID owner, uint16 index, uint16 window_type) |
89 void BuildVehicleList(VehicleListBase *vl, PlayerID owner, uint16 index, uint16 window_type) |
91 { |
90 { |
92 if (!(vl->vehicles.flags & VL_REBUILD)) return; |
91 if (!vl->vehicles.NeedRebuild()) return; |
93 |
92 |
94 DEBUG(misc, 3, "Building vehicle list for player %d at station %d", owner, index); |
93 DEBUG(misc, 3, "Building vehicle list for player %d at station %d", owner, index); |
95 |
94 |
96 GenerateVehicleSortList(&vl->vehicles, vl->vehicle_type, owner, index, window_type); |
95 GenerateVehicleSortList(&vl->vehicles, vl->vehicle_type, owner, index, window_type); |
97 |
96 |
98 vl->vehicles.flags &= ~VL_REBUILD; |
97 vl->vehicles.RebuildDone(); |
99 vl->vehicles.flags |= VL_RESORT; |
|
100 } |
98 } |
101 |
99 |
102 /* cached values for VehicleNameSorter to spare many GetString() calls */ |
100 /* cached values for VehicleNameSorter to spare many GetString() calls */ |
103 static const Vehicle *_last_vehicle[2] = { NULL, NULL }; |
101 static const Vehicle *_last_vehicle[2] = { NULL, NULL }; |
104 static char _last_name[2][64] = { "", "" }; |
|
105 |
102 |
106 void SortVehicleList(VehicleListBase *vl) |
103 void SortVehicleList(VehicleListBase *vl) |
107 { |
104 { |
108 if (!(vl->vehicles.flags & VL_RESORT)) return; |
105 if (vl->vehicles.Sort()) return; |
109 |
106 |
110 /* invalidate cached values for name sorter - vehicle names could change */ |
107 /* invalidate cached values for name sorter - vehicle names could change */ |
111 _last_vehicle[0] = _last_vehicle[1] = NULL; |
108 _last_vehicle[0] = _last_vehicle[1] = NULL; |
112 |
|
113 _internal_sort_order = (vl->vehicles.flags & VL_DESC) != 0; |
|
114 qsort((void*)vl->vehicles.Begin(), vl->vehicles.Length(), sizeof(*vl->vehicles.Begin()), |
|
115 _vehicle_sorter[vl->vehicles.sort_type]); |
|
116 |
|
117 vl->vehicles.resort_timer = DAY_TICKS * PERIODIC_RESORT_DAYS; |
|
118 vl->vehicles.flags &= ~VL_RESORT; |
|
119 } |
109 } |
120 |
110 |
121 void DepotSortList(VehicleList *list) |
111 void DepotSortList(VehicleList *list) |
122 { |
112 { |
123 _internal_sort_order = 0; |
|
124 if (list->Length() < 2) return; |
113 if (list->Length() < 2) return; |
125 qsort((void*)list->Begin(), list->Length(), sizeof(*list->Begin()), _vehicle_sorter[0]); |
114 QSortT(list->Begin(), list->Length(), &VehicleNumberSorter); |
126 } |
115 } |
127 |
116 |
128 /** draw the vehicle profit button in the vehicle list window. */ |
117 /** draw the vehicle profit button in the vehicle list window. */ |
129 void DrawVehicleProfitButton(const Vehicle *v, int x, int y) |
118 void DrawVehicleProfitButton(const Vehicle *v, int x, int y) |
130 { |
119 { |
505 |
494 |
506 return DrawStringMultiLine(x, y, STR_SPEC_USERSTRING, w); |
495 return DrawStringMultiLine(x, y, STR_SPEC_USERSTRING, w); |
507 } |
496 } |
508 |
497 |
509 |
498 |
510 /* if the sorting criteria had the same value, sort vehicle by unitnumber */ |
499 /** Sort vehicles by their number */ |
511 #define VEHICLEUNITNUMBERSORTER(r, a, b) {if (r == 0) {r = a->unitnumber - b->unitnumber;}} |
500 static int CDECL VehicleNumberSorter(const Vehicle* const *a, const Vehicle* const *b) |
512 |
501 { |
513 static int CDECL VehicleNumberSorter(const void *a, const void *b) |
502 return (*a)->unitnumber - (*b)->unitnumber; |
514 { |
503 } |
515 const Vehicle* va = *(const Vehicle**)a; |
504 |
516 const Vehicle* vb = *(const Vehicle**)b; |
505 /** Sort vehicles by their name */ |
517 int r = va->unitnumber - vb->unitnumber; |
506 static int CDECL VehicleNameSorter(const Vehicle* const *a, const Vehicle* const *b) |
518 |
507 { |
519 return (_internal_sort_order & 1) ? -r : r; |
508 static char last_name[2][64]; |
520 } |
509 |
521 |
510 if (*a != _last_vehicle[0]) { |
522 static int CDECL VehicleNameSorter(const void *a, const void *b) |
511 _last_vehicle[0] = *a; |
523 { |
512 SetDParam(0, (*a)->index); |
524 const Vehicle* va = *(const Vehicle**)a; |
513 GetString(last_name[0], STR_VEHICLE_NAME, lastof(last_name[0])); |
525 const Vehicle* vb = *(const Vehicle**)b; |
514 } |
526 int r; |
515 |
527 |
516 if (*b != _last_vehicle[1]) { |
528 if (va != _last_vehicle[0]) { |
517 _last_vehicle[1] = *b; |
529 _last_vehicle[0] = va; |
518 SetDParam(0, (*b)->index); |
530 SetDParam(0, va->index); |
519 GetString(last_name[1], STR_VEHICLE_NAME, lastof(last_name[1])); |
531 GetString(_last_name[0], STR_VEHICLE_NAME, lastof(_last_name[0])); |
520 } |
532 } |
521 |
533 |
522 int r = strcmp(last_name[0], last_name[1]); |
534 if (vb != _last_vehicle[1]) { |
523 return (r != 0) ? r : VehicleNumberSorter(a, b); |
535 _last_vehicle[1] = vb; |
524 } |
536 SetDParam(0, vb->index); |
525 |
537 GetString(_last_name[1], STR_VEHICLE_NAME, lastof(_last_name[1])); |
526 /** Sort vehicles by their age */ |
538 } |
527 static int CDECL VehicleAgeSorter(const Vehicle* const *a, const Vehicle* const *b) |
539 |
528 { |
540 r = strcmp(_last_name[0], _last_name[1]); // sort by name |
529 int r = (*a)->age - (*b)->age; |
541 |
530 return (r != 0) ? r : VehicleNumberSorter(a, b); |
542 VEHICLEUNITNUMBERSORTER(r, va, vb); |
531 } |
543 |
532 |
544 return (_internal_sort_order & 1) ? -r : r; |
533 /** Sort vehicles by this year profit */ |
545 } |
534 static int CDECL VehicleProfitThisYearSorter(const Vehicle* const *a, const Vehicle* const *b) |
546 |
535 { |
547 static int CDECL VehicleAgeSorter(const void *a, const void *b) |
536 int r = ClampToI32((*a)->GetDisplayProfitThisYear() - (*b)->GetDisplayProfitThisYear()); |
548 { |
537 return (r != 0) ? r : VehicleNumberSorter(a, b); |
549 const Vehicle* va = *(const Vehicle**)a; |
538 } |
550 const Vehicle* vb = *(const Vehicle**)b; |
539 |
551 int r = va->age - vb->age; |
540 /** Sort vehicles by last year profit */ |
552 |
541 static int CDECL VehicleProfitLastYearSorter(const Vehicle* const *a, const Vehicle* const *b) |
553 VEHICLEUNITNUMBERSORTER(r, va, vb); |
542 { |
554 |
543 int r = ClampToI32((*a)->GetDisplayProfitLastYear() - (*b)->GetDisplayProfitLastYear()); |
555 return (_internal_sort_order & 1) ? -r : r; |
544 return (r != 0) ? r : VehicleNumberSorter(a, b); |
556 } |
545 } |
557 |
546 |
558 static int CDECL VehicleProfitThisYearSorter(const void *a, const void *b) |
547 /** Sort vehicles by their cargo */ |
559 { |
548 static int CDECL VehicleCargoSorter(const Vehicle* const *a, const Vehicle* const *b) |
560 const Vehicle* va = *(const Vehicle**)a; |
549 { |
561 const Vehicle* vb = *(const Vehicle**)b; |
550 const Vehicle *v; |
562 int r = ClampToI32(va->GetDisplayProfitThisYear() - vb->GetDisplayProfitThisYear()); |
551 AcceptedCargo diff; |
563 |
552 memset(diff, 0, sizeof(diff)); |
564 VEHICLEUNITNUMBERSORTER(r, va, vb); |
553 |
565 |
554 /* Append the cargo of the connected weagons */ |
566 return (_internal_sort_order & 1) ? -r : r; |
555 for (v = *a; v != NULL; v = v->Next()) diff[v->cargo_type] += v->cargo_cap; |
567 } |
556 for (v = *b; v != NULL; v = v->Next()) diff[v->cargo_type] -= v->cargo_cap; |
568 |
557 |
569 static int CDECL VehicleProfitLastYearSorter(const void *a, const void *b) |
|
570 { |
|
571 const Vehicle* va = *(const Vehicle**)a; |
|
572 const Vehicle* vb = *(const Vehicle**)b; |
|
573 int r = ClampToI32(va->GetDisplayProfitLastYear() - vb->GetDisplayProfitLastYear()); |
|
574 |
|
575 VEHICLEUNITNUMBERSORTER(r, va, vb); |
|
576 |
|
577 return (_internal_sort_order & 1) ? -r : r; |
|
578 } |
|
579 |
|
580 static int CDECL VehicleCargoSorter(const void *a, const void *b) |
|
581 { |
|
582 const Vehicle* va = *(const Vehicle**)a; |
|
583 const Vehicle* vb = *(const Vehicle**)b; |
|
584 const Vehicle* v; |
|
585 AcceptedCargo cargoa; |
|
586 AcceptedCargo cargob; |
|
587 int r = 0; |
558 int r = 0; |
588 |
|
589 memset(cargoa, 0, sizeof(cargoa)); |
|
590 memset(cargob, 0, sizeof(cargob)); |
|
591 for (v = va; v != NULL; v = v->Next()) cargoa[v->cargo_type] += v->cargo_cap; |
|
592 for (v = vb; v != NULL; v = v->Next()) cargob[v->cargo_type] += v->cargo_cap; |
|
593 |
|
594 for (CargoID i = 0; i < NUM_CARGO; i++) { |
559 for (CargoID i = 0; i < NUM_CARGO; i++) { |
595 r = cargoa[i] - cargob[i]; |
560 r = diff[i]; |
596 if (r != 0) break; |
561 if (r != 0) break; |
597 } |
562 } |
598 |
563 |
599 VEHICLEUNITNUMBERSORTER(r, va, vb); |
564 return (r != 0) ? r : VehicleNumberSorter(a, b); |
600 |
565 } |
601 return (_internal_sort_order & 1) ? -r : r; |
566 |
602 } |
567 /** Sort vehicles by their reliability */ |
603 |
568 static int CDECL VehicleReliabilitySorter(const Vehicle* const *a, const Vehicle* const *b) |
604 static int CDECL VehicleReliabilitySorter(const void *a, const void *b) |
569 { |
605 { |
570 int r = (*a)->reliability - (*b)->reliability; |
606 const Vehicle* va = *(const Vehicle**)a; |
571 return (r != 0) ? r : VehicleNumberSorter(a, b); |
607 const Vehicle* vb = *(const Vehicle**)b; |
572 } |
608 int r = va->reliability - vb->reliability; |
573 |
609 |
574 /** Sort vehicles by their max speed */ |
610 VEHICLEUNITNUMBERSORTER(r, va, vb); |
575 static int CDECL VehicleMaxSpeedSorter(const Vehicle* const *a, const Vehicle* const *b) |
611 |
576 { |
612 return (_internal_sort_order & 1) ? -r : r; |
577 int r = 0; |
613 } |
578 if ((*a)->type == VEH_TRAIN && (*b)->type == VEH_TRAIN) { |
614 |
579 r = (*a)->u.rail.cached_max_speed - (*b)->u.rail.cached_max_speed; |
615 static int CDECL VehicleMaxSpeedSorter(const void *a, const void *b) |
|
616 { |
|
617 const Vehicle* va = *(const Vehicle**)a; |
|
618 const Vehicle* vb = *(const Vehicle**)b; |
|
619 int r; |
|
620 |
|
621 if (va->type == VEH_TRAIN && vb->type == VEH_TRAIN) { |
|
622 r = va->u.rail.cached_max_speed - vb->u.rail.cached_max_speed; |
|
623 } else { |
580 } else { |
624 r = va->max_speed - vb->max_speed; |
581 r = (*a)->max_speed - (*b)->max_speed; |
625 } |
582 } |
626 |
583 return (r != 0) ? r : VehicleNumberSorter(a, b); |
627 VEHICLEUNITNUMBERSORTER(r, va, vb); |
584 } |
628 |
585 |
629 return (_internal_sort_order & 1) ? -r : r; |
586 /** Sort vehicles by model */ |
630 } |
587 static int CDECL VehicleModelSorter(const Vehicle* const *a, const Vehicle* const *b) |
631 |
588 { |
632 static int CDECL VehicleModelSorter(const void *a, const void *b) |
589 int r = (*a)->engine_type - (*b)->engine_type; |
633 { |
590 return (r != 0) ? r : VehicleNumberSorter(a, b); |
634 const Vehicle* va = *(const Vehicle**)a; |
591 } |
635 const Vehicle* vb = *(const Vehicle**)b; |
592 |
636 int r = va->engine_type - vb->engine_type; |
593 /** Sort vehciles by their value */ |
637 |
594 static int CDECL VehicleValueSorter(const Vehicle* const *a, const Vehicle* const *b) |
638 VEHICLEUNITNUMBERSORTER(r, va, vb); |
595 { |
639 |
|
640 return (_internal_sort_order & 1) ? -r : r; |
|
641 } |
|
642 |
|
643 static int CDECL VehicleValueSorter(const void *a, const void *b) |
|
644 { |
|
645 const Vehicle* va = *(const Vehicle**)a; |
|
646 const Vehicle* vb = *(const Vehicle**)b; |
|
647 const Vehicle *u; |
596 const Vehicle *u; |
648 Money valuea = 0, valueb = 0; |
597 Money diff = 0; |
649 |
598 |
650 for (u = va; u != NULL; u = u->Next()) valuea += u->value; |
599 for (u = *a; u != NULL; u = u->Next()) diff += u->value; |
651 for (u = vb; u != NULL; u = u->Next()) valueb += u->value; |
600 for (u = *b; u != NULL; u = u->Next()) diff -= u->value; |
652 |
601 |
653 int r = ClampToI32(valuea - valueb); |
602 int r = ClampToI32(diff); |
654 |
603 return (r != 0) ? r : VehicleNumberSorter(a, b); |
655 VEHICLEUNITNUMBERSORTER(r, va, vb); |
604 } |
656 |
605 |
657 return (_internal_sort_order & 1) ? -r : r; |
606 /** Sort vehicles by their length */ |
658 } |
607 static int CDECL VehicleLengthSorter(const Vehicle* const *a, const Vehicle* const *b) |
659 |
608 { |
660 static int CDECL VehicleLengthSorter(const void *a, const void *b) |
|
661 { |
|
662 const Vehicle *va = *(const Vehicle**)a; |
|
663 const Vehicle *vb = *(const Vehicle**)b; |
|
664 int r = 0; |
609 int r = 0; |
665 |
610 switch ((*a)->type) { |
666 switch (va->type) { |
|
667 case VEH_TRAIN: |
611 case VEH_TRAIN: |
668 r = va->u.rail.cached_total_length - vb->u.rail.cached_total_length; |
612 r = (*a)->u.rail.cached_total_length - (*b)->u.rail.cached_total_length; |
669 break; |
613 break; |
670 |
614 |
671 case VEH_ROAD: |
615 case VEH_ROAD: { |
672 for (const Vehicle *u = va; u != NULL; u = u->Next()) r += u->u.road.cached_veh_length; |
616 const Vehicle *u; |
673 for (const Vehicle *u = vb; u != NULL; u = u->Next()) r -= u->u.road.cached_veh_length; |
617 for (u = *a; u != NULL; u = u->Next()) r += u->u.road.cached_veh_length; |
674 break; |
618 for (u = *b; u != NULL; u = u->Next()) r -= u->u.road.cached_veh_length; |
|
619 } break; |
675 |
620 |
676 default: NOT_REACHED(); |
621 default: NOT_REACHED(); |
677 } |
622 } |
678 |
623 return (r != 0) ? r : VehicleNumberSorter(a, b); |
679 VEHICLEUNITNUMBERSORTER(r, va, vb); |
|
680 |
|
681 return (_internal_sort_order & 1) ? -r : r; |
|
682 } |
624 } |
683 |
625 |
684 void InitializeGUI() |
626 void InitializeGUI() |
685 { |
627 { |
686 memset(&_sorting, 0, sizeof(_sorting)); |
628 MemSetT(&_sorting, 0); |
687 } |
629 } |
688 |
630 |
689 /** Assigns an already open vehicle window to a new vehicle. |
631 /** Assigns an already open vehicle window to a new vehicle. |
690 * Assigns an already open vehicle window to a new vehicle. If the vehicle got |
632 * Assigns an already open vehicle window to a new vehicle. If the vehicle got |
691 * any sub window open (orders and so on) it will change owner too. |
633 * any sub window open (orders and so on) it will change owner too. |