news_sup.c

/*
    Copyright (C) 2005 Michael K. McCarty & Fritz Bronner

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/
// Interplay's BUZZ ALDRIN's RACE into SPACE
//
// Formerly -=> LiftOff : Race to the Moon :: IBM version MCGA
// Copyright 1991 by Strategic Visions, Inc.
// Designed by Fritz Bronner
// Programmed by Michael K McCarty
//
// Support files for NEWS.C

#include <Buzz_inc.h>
#include <externs.h>
#include <options.h>   //Damaged Equipment Cheat, Nikakd, 10/8/10

/** ???
 * 
 * \param type 1:postive -1:negative search
 */
int Steal(int p,int prog,int type) 
{
 int i=0,j=0,k=0,save[28],lo=0,hi=28;
 if (prog)EMPTY_BODY;
 memset(save,0x00,sizeof save);
 for (i=0;i<7;i++)
  {
   if (Data->P[p].Probe[i].Num>=0 && Data->P[other(p)].Probe[i].Num>=0)
    {
     if (type==1) save[i]=Data->P[other(p)].Probe[i].Safety-Data->P[p].Probe[i].Safety;
      else save[i]=Data->P[p].Probe[i].Safety-Data->P[other(p)].Probe[i].Safety;
     if (type==-1 && save[i]<0 && ((Data->P[p].Probe[i].Safety+save[i])<Data->P[p].Probe[i].Base))
      save[i]=0;
    }
   if (Data->P[p].Rocket[i].Num>=0 && Data->P[other(p)].Rocket[i].Num>=0)
    {
     if (type==1) save[i+7]=Data->P[other(p)].Rocket[i].Safety-Data->P[p].Rocket[i].Safety;
      else save[i+7]=Data->P[p].Rocket[i].Safety-Data->P[other(p)].Rocket[i].Safety;
     if (type==-1 && save[i+7]<0 && ((Data->P[p].Rocket[i].Safety+save[i+7])<Data->P[p].Rocket[i].Base))
      save[i+7]=0;
    }
   if (Data->P[p].Manned[i].Num>=0 && Data->P[other(p)].Manned[i].Num>=0)
    {
     if (type==1) save[i+14]=Data->P[other(p)].Manned[i].Safety-Data->P[p].Manned[i].Safety;
      else save[i+14]=Data->P[p].Manned[i].Safety-Data->P[other(p)].Manned[i].Safety;
     if (type==-1 && save[i+14]<0 && ((Data->P[p].Manned[i].Safety+save[i+14])<Data->P[p].Manned[i].Base))
      save[i+7]=0;
    }
   if (Data->P[p].Misc[i].Num>=0 && Data->P[other(p)].Misc[i].Num>=0)
    {
     if (type==1) save[i+21]=Data->P[other(p)].Misc[i].Safety-Data->P[p].Misc[i].Safety;
      else save[i+21]=Data->P[p].Misc[i].Safety-Data->P[other(p)].Misc[i].Safety;
     if (type==-1 && save[i+21]<0 && ((Data->P[p].Misc[i].Safety+save[i+21])<Data->P[p].Misc[i].Base))
      save[i+21]=0;
    }
  };
  save[25]=save[26]=save[27]=save[12]=save[13]=save[3]=save[4]=save[5]=save[6]=0;  
  if (type==1)
   {
    for (i=lo;i<hi;i++)
      if (save[i]<=0) save[i]=0;  // Positive Only
    }
  else
   {
    for (i=lo;i<hi;i++)
     if (save[i]>=0) save[i]=0;  // Negatives Only
      else save[i]*=-1;
    }
  for (i=lo;i<hi;i++) if (save[i]>0) j++; // Check if event is good.
  if (j==0) return 0;
  j=random(hi-lo);
  while((k <100) && (save[j+lo] <= 0)) {   // finds candidate
    j=random(hi-lo)+lo;
    k++;
  };
  if (k==100) return 0;
  if (j>=0 && j<7) {
    lo=0;
    Data->P[p].Probe[j].Safety+=(save[j]*type);
    strcpy(&Name[0],&Data->P[p].Probe[j].Name[0]);
  };
  if (j>=7 && j<14) {
    lo=7;
    Data->P[p].Rocket[j-lo].Safety+=(save[j]*type);
    strcpy(&Name[0],&Data->P[p].Rocket[j-lo].Name[0]);
  };
  if (j>=14 && j<21) {
    lo=14;
    Data->P[p].Manned[j-lo].Safety+=(save[j]*type);
    strcpy(&Name[0],&Data->P[p].Manned[j-lo].Name[0]);
  };
  if (j>=21 && j<28) {
    lo=21;
    Data->P[p].Misc[j-lo].Safety+=(save[j]*type);
    strcpy(&Name[0],&Data->P[p].Misc[j-lo].Name[0]);
  };
 return save[j];
}

/** ???
 * 
 * \param type 1:postive -1:negative search
 * \param per Amount of modification in percent
 */
int NMod(int p,int prog,int type,int per)
{
  int i=0,j=0,save[28],lo=0,hi=28;
  Equipment *Eptr[28];
  
  lo=(prog>0) ? (prog-1)*7 : 0;   hi=(prog>0) ? lo+7 : 28;
  if (prog==1) hi=lo+3;
  /* drvee: this loop was going to 25, not 28 */
  for (i=0;i<(int)ARRAY_LENGTH(Eptr);i++)
   {
       /** \bug Mismatch between data.h(250) and this code here */
    Eptr[i]=(Equipment *) &Data->P[p].Probe[i];
    save[i]= ((Eptr[i]->Safety+per*type)<=(Eptr[i]->MaxSafety)&& Eptr[i]->Num>=0) ? Eptr[i]->Safety+per*type : 0;
    if (Eptr[i]->Num<0) save[i]=0;
   };
  for(i=0;i<(int)ARRAY_LENGTH(save);i++) if (save[i]<0) save[i]=0;
  save[11]=save[25]=save[26]=save[27]=save[12]=save[13]=save[3]=save[4]=save[5]=save[6]=0;  
  for (i=lo;i<hi;i++) if (save[i]>0) j++; // Check if event is good.
  if (j==0) return 0;           
  j=hi-1; while(save[j] == 0) j--;
  // Increment value and return program name
  Eptr[j]->Safety=save[j];
  strcpy(&Name[0],&Eptr[j]->Name[0]);
  if(Eptr[j]->Safety>Eptr[j]->MaxSafety) Eptr[j]->Safety=Eptr[j]->MaxSafety;
  return save[j];
}


int DamMod(int p,int prog,int dam,int cost)
{
  int i=0,j=0,lo=0,hi=28;
  int save[28];
  Equipment *Eptr[28];
  
  memset(save,0x00,sizeof save);
  lo=(prog>0) ? (prog-1)*7 : 0;
  hi=(prog>0) ? lo+7 : 28;
  for (i=0;i<25;i++)
   {
    Eptr[i]=(Equipment *) &Data->P[p].Probe[i];
    save[i]= ((Eptr[i]->Safety > Eptr[i]->Base)&& Eptr[i]->Num>=0) ? Eptr[i]->Safety : 0;
   };
  for (i=0;i<25;i++) if ( save[i] <dam ) save[i]=0;
  save[25]=save[26]=save[27]=save[12]=save[13]=save[3]=save[4]=save[5]=save[6]=save[11]=0;
  save[19]=save[20]=0; //remove LM's
  for (i=lo;i<hi;i++) if (save[i]>0) j++; // Check if event is good.
  if (j==0) return 0;
  j=hi-1; while(save[j]==0) j--;
  strcpy(&Name[0],&Eptr[j]->Name[0]);
  if (options.cheat_no_damage==0) Eptr[j]->Damage+=dam;    //Damaged Equipment Cheat
  if (options.cheat_no_damage==0) Eptr[j]->DCost+=cost;
  return save[j];
}


int RDMods(int p,int prog,int type,int val)
{
  int i=0,j=0,save[28],lo=0,hi=28;
  Equipment *Eptr[28];
  
  memset(save,0x00,sizeof save);
  lo=(prog>0) ? (prog-1)*7 : 0;
  hi=(prog>0) ? lo+7 : 28;
  for (i=0;i<25;i++)
   {
    Eptr[i]=(Equipment *) &Data->P[p].Probe[i];
    save[i]= ((Eptr[i]->Safety > Eptr[i]->Base)&& Eptr[i]->Num>=0) ? Eptr[i]->Safety : 0;
   };
  save[11]=save[25]=save[26]=save[27]=save[12]=save[13]=save[3]=save[4]=save[5]=save[6]=0;
  for(i=0;i<28;i++) if (save[i]<0) save[i]=0;
  for (i=lo;i<hi;i++) if (save[i]>0) j++; // Check if event is good.
  if (j==0) return 0;
  j=hi-1; while(save[j]==0) j--;
  strcpy(&Name[0],&Eptr[j]->Name[0]);
  Eptr[j]->RDCost+=type*val;
  return save[j];
}


int SaveMods(char p,char prog)
{
  int i=0,j=0,save[28],lo=0,hi=28;

  for (i=0;i<28;i++) save[i]=0;
  switch (prog) {
    case 0: lo=0; hi=21;break;   // check ALL    programs
    case 1: lo=0; hi=7;break;    // check PROBE  programs
    case 2: lo=7; hi=14;break;   // check ROCKET programs
    case 3: lo=14; hi=18;break;  // check MANNED programs
    case 4: lo=18; hi=21;break;  // check LEM   programs
  };
  for (i=0;i<7;i++)
   {
    if (Data->P[p].Probe[i].Num>=0) save[i]=1;
    if (Data->P[p].Rocket[i].Num>=0) save[i+7]=1;
    if (Data->P[p].Manned[i].Num>=0) save[i+14]=1;
    if (Data->P[p].Misc[i].Num>=0) save[i+21]=1;
   };
  save[11]=save[25]=save[26]=save[27]=save[12]=save[13]=save[3]=save[4]=save[5]=save[6]=0;  
  for (i=lo;i<hi;i++) if (save[i]>0) j++; // Check if event is good.
  if (j==0) return 0;
  j=hi-1;while(save[j] == 0) j--;
  // Increment value and return program name
  if (j>=0 && j<7) {
    Data->P[p].Probe[j].SaveCard=1;
    strcpy(&Name[0],&Data->P[p].Probe[j].Name[0]);
  };
  if (j>=7 && j<14) {
    Data->P[p].Rocket[j-7].SaveCard=1;
    strcpy(&Name[0],&Data->P[p].Rocket[j-7].Name[0]);
  };
  if (j>=14 && j<21) {
    Data->P[p].Manned[j-14].SaveCard=1;
    strcpy(&Name[0],&Data->P[p].Manned[j-14].Name[0]);
  };
  return save[j];
}

// EOF