starfighter/code/cargo.cpp

121 lines
2.7 KiB
C++
Raw Normal View History

/*
Copyright (C) 2003 Parallel Realities
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.
*/
#include "cargo.h"
void initCargo()
{
for (int i = 0 ; i < MAX_CARGO ; i++)
{
cargo[i].active = false;
cargo[i].owner = NULL;
}
}
/*
* I think you all know what this does by now! ;)
*/
int getCargo()
{
for (int i = 0 ; i < MAX_CARGO ; i++)
{
if (!cargo[i].active)
return i;
}
return -1;
}
object *addCargo(object *owner, int cargoType)
{
int index = getCargo();
if (index == -1)
return NULL;
cargo[index].active = false;
cargo[index].owner = owner;
cargo[index].x = owner->x;
cargo[index].y = owner->y;
cargo[index].dx = 0;
cargo[index].dy = 0;
cargo[index].collectType = cargoType;
cargo[index].image[0] = graphics.shape[32];
if (cargoType == P_PHOEBE)
cargo[index].image[0] = graphics.shipShape[20];
return &cargo[index];
}
void becomeCollectable(int i)
{
if (cargo[i].collectType != P_PHOEBE)
{
addCollectable(cargo[i].x, cargo[i].y, cargo[i].collectType, 1, 600);
}
else
{
enemy[FR_PHOEBE].active = true;
enemy[FR_PHOEBE].x = cargo[i].x;
enemy[FR_PHOEBE].y = cargo[i].y;
setRadioMessage(FACE_PHOEBE, "Thanks!! Watch out, WEAPCO! Phoebe's loose and she's ANGRY!!!", 1);
}
cargo[i].active = false;
}
void doCargo()
{
float dx, dy, chainX, chainY;
for (int i = 0 ; i < MAX_CARGO ; i++)
{
if (cargo[i].active)
{
if (!cargo[i].owner->active)
{
becomeCollectable(i);
continue;
}
graphics.blit(cargo[i].image[0], (int)cargo[i].x, (int)cargo[i].y);
cargo[i].x += engine.ssx;
cargo[i].y += engine.ssy;
Math::limitFloat(&cargo[i].x, cargo[i].owner->x - 50, cargo[i].owner->x + 50);
Math::limitFloat(&cargo[i].y, cargo[i].owner->y - 50, cargo[i].owner->y + 50);
dx = (cargo[i].x - cargo[i].owner->x) / 10;
dy = (cargo[i].y - cargo[i].owner->y) / 10;
chainX = cargo[i].x - cargo[i].dx;
chainY = cargo[i].y - cargo[i].dy;
// draw the chain link line
for (int j = 0 ; j < 10 ; j++)
{
graphics.blit(graphics.shape[30], (int)chainX, (int)chainY);
chainX -= dx;
chainY -= dy;
}
}
}
}