git.pond.sub.org Git - empserver/blob - src/lib/commands/newe.c

   1 /*
   2  *  Empire - A multi-player, client/server Internet based war game.
   3  *  Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
   4  *                           Ken Stevens, Steve McClure
   5  *
   6  *  This program is free software; you can redistribute it and/or modify
   7  *  it under the terms of the GNU General Public License as published by
   8  *  the Free Software Foundation; either version 2 of the License, or
   9  *  (at your option) any later version.
  10  *
  11  *  This program is distributed in the hope that it will be useful,
  12  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  *  GNU General Public License for more details.
  15  *
  16  *  You should have received a copy of the GNU General Public License
  17  *  along with this program; if not, write to the Free Software
  18  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  19  *
  20  *  ---
  21  *
  22  *  See files README, COPYING and CREDITS in the root of the source
  23  *  tree for related information and legal notices.  It is expected
  24  *  that future projects/authors will amend these files as needed.
  25  *
  26  *  ---
  27  *
  28  *  newe.c: Show new sector efficiency (projected)
  29  *
  30  *  Known contributors to this file:
  31  *     Thomas Ruschak, 1993
  32  */
  33
  34 #include <config.h>
  35
  36 #include "misc.h"
  37 #include "player.h"
  38 #include "xy.h"
  39 #include "nsc.h"
  40 #include "sect.h"
  41 #include "nat.h"
  42 #include "item.h"
  43 #include "file.h"
  44 #include "commands.h"
  45 #include "optlist.h"
  46
  47 int
  48 newe(void)
  49 {
  50     struct natstr *natp;
  51     struct sctstr sect;
  52     struct nstr_sect nstr;
  53     double work, lcms, hcms;
  54     int nsect;
  55     int civs = 0;
  56     int uws = 0;
  57     int bwork;
  58     int twork;
  59     int type;
  60     int eff;
  61     int maxpop;
  62
  63     if (!snxtsct(&nstr, player->argp[1]))
  64         return RET_SYN;
  65     player->simulation = 1;
  66     prdate();
  67     nsect = 0;
  68     while (nxtsct(&nstr, &sect)) {
  69         if (!player->owner)
  70             continue;
  71         if (!sect.sct_off) {
  72             civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
  73             uws = (1.0 + uwbrate * etu_per_update) * sect.sct_item[I_UW];
  74             natp = getnatp(sect.sct_own);
  75             maxpop = max_pop(natp->nat_level[NAT_RLEV], &sect);
  76             /* This isn't quite right, since research might rise/fall */
  77             /* during the update, but it's the best we can really do  */
  78             work = new_work(&sect,
  79                             total_work(sect.sct_work, etu_per_update,
  80                                        civs, sect.sct_item[I_MILIT], uws,
  81                                        maxpop));
  82             bwork = work / 2;
  83
  84             type = sect.sct_type;
  85             eff = sect.sct_effic;
  86             if (sect.sct_newtype != type) {
  87                 twork = (eff + 3) / 4;
  88                 if (twork > bwork) {
  89                     twork = bwork;
  90                 }
  91                 work -= twork;
  92                 bwork -= twork;
  93                 eff -= twork * 4;
  94                 if (eff <= 0) {
  95                     type = sect.sct_newtype;
  96                     eff = 0;
  97                 }
  98
  99                 twork = 100 - eff;
 100                 if (twork > bwork) {
 101                     twork = bwork;
 102                 }
 103                 if (dchr[type].d_lcms > 0) {
 104                     lcms = sect.sct_item[I_LCM];
 105                     lcms = (int)(lcms / dchr[type].d_lcms);
 106                     if (twork > lcms)
 107                         twork = lcms;
 108                 }
 109                 if (dchr[type].d_hcms > 0) {
 110                     hcms = sect.sct_item[I_HCM];
 111                     hcms = (int)(hcms / dchr[type].d_hcms);
 112                     if (twork > hcms)
 113                         twork = hcms;
 114                 }
 115                 work -= twork;
 116                 eff += twork;
 117             } else if (eff < 100) {
 118                 twork = 100 - eff;
 119                 if (twork > bwork) {
 120                     twork = bwork;
 121                 }
 122                 if (dchr[type].d_lcms > 0) {
 123                     lcms = sect.sct_item[I_LCM];
 124                     lcms = (int)(lcms / dchr[type].d_lcms);
 125                     if (twork > lcms)
 126                         twork = lcms;
 127                 }
 128                 if (dchr[type].d_hcms > 0) {
 129                     hcms = sect.sct_item[I_HCM];
 130                     hcms = (int)(hcms / dchr[type].d_hcms);
 131                     if (twork > hcms)
 132                         twork = hcms;
 133                 }
 134                 work -= twork;
 135                 eff += twork;
 136             }
 137         } else {
 138             eff = sect.sct_effic;
 139             type = sect.sct_type;
 140         }
 141         if (nsect++ == 0) {
 142             pr("EFFICIENCY SIMULATION\n");
 143             pr("   sect  des    projected eff\n");
 144         }
 145         prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
 146         pr(" %c", dchr[type].d_mnem);
 147         pr("    %3d%%\n", eff);
 148     }
 149     player->simulation = 0;
 150     if (nsect == 0) {
 151         if (player->argp[1])
 152             pr("%s: No sector(s)\n", player->argp[1]);
 153         else
 154             pr("%s: No sector(s)\n", "");
 155         return RET_FAIL;
 156     } else
 157         pr("%d sector%s\n", nsect, splur(nsect));
 158     return RET_OK;
 159 }