48 elem(0), first_station(0), beauty(0), player_desc(0)
79 for (
int i = 0; i < 8; i++) {
83 for (
int n = 0; n < 8; n++) {
160 for (
int i = 0; i < 8; i++) {
167 for (
int n = 0; n < 8; n++) {
180 for (
int n = 0; n < 8; n++) {
186 double loaded_mass = 0;
198 sprintf_s(weight,
"%d kg", (
int) ((design->
mass + load->
mass) * 1000));
205 loaded_mass = design->
mass + load->
mass;
213 loaded_mass = design->
mass;
215 sprintf_s(weight,
"%d kg", (
int) (loaded_mass * 1000));
252 for (
int s = 0; s < 8; s++)
269 for (
int i = 0; i < 8 && !found; i++) {
272 mounts[i][station] =
true;
277 mounts[index][station] =
true;
289 for (
int i = 0; i < 8; i++)
305 for (
int i = 0; i < nstations; i++) {
329 if (!
elem || nn < 0 || nn >= 8 ||
loads[nn] == -1)
337 for (
int i = 0; i < 8 && index < 0; i++) {
351 if (!
elem || nn < 0 || nn >= 8)
359 for (
int i = 0; i < 8 && result < 0; i++) {
360 if (
designs[i] == wep_design) {
376 for (
int i = 0; i < 8 && item < 0; i++) {
377 for (
int n = 0; n < 8 && station < 0; n++) {
385 if (item >= 0 && station >= 0) {
386 if (
loads[station] == item)
389 loads[station] = item;
391 for (
int n = 0; n < 8; n++) {
402 for (
int n = 0; n < nstations; n++)
413 for (
int n = 0; n < nstations; n++)
426 double mass = d->
mass;
428 for (
int n = 0; n < nstations; n++) {
434 sprintf_s(weight,
"%d kg", (
int) (mass * 1000));
455 if (sl->
name == loadname) {
456 shipload = sl.
value();
460 if (!shipload)
return;
464 sprintf_s(weight,
"%d kg", (
int) ((design->
mass + shipload->
mass) * 1000));
483 int* loadout = shipload->
load;
485 for (
int i = 0; i < 8; i++)
488 for (
int i = 0; i < nstations; i++)
491 for (
int i = 0; i < 8; i++) {
492 for (
int n = 0; n < 8; n++) {