source: orxonox.OLD/trunk/src/world_entities/npcs/npc.cc @ 8259

/*
   orxonox - the future of 3D-vertical-scrollers

   Copyright (C) 2004 orx

   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, or (at your option)
   any later version.

   ### File Specific:
   main-programmer: Patrick Boenzli
   co-programmer:
*/
#define DEBUG_SPECIAL_MODULE DEBUG_MODULE_WORLD_ENTITY


#include "npc.h"
#include "obb_tree.h"

#include "state.h"
#include "stdlibincl.h"
#include "power_ups/turret_power_up.h"
#include "power_ups/laser_power_up.h"

using namespace std;


NPC::NPC()
{
  this->setClassID(CL_NPC, "NPC");
  this->toList(OM_GROUP_00);
}


NPC::~NPC () {}


void NPC::collidesWith(WorldEntity* entity, const Vector& location)
{

  if (entity == collider)
    return;
  collider = entity;

  if (entity->isA(CL_PROJECTILE))
  {
    this->decreaseHealth(entity->getHealth() *(float)rand()/(float)RAND_MAX);
    // EXTREME HACK
    if (this->getHealth() <= 0.0f)
    {
      this->destroy();
    }
  }


// //    PRINTF(3)("collision %s vs %s @ (%f,%f,%f)\n", this->getName(), entity->getName(), location.x, location.y, location.z);
// //    this->applyForce(Vector(0,0,0)-location*1000);
//     if ((float)rand()/RAND_MAX < .3)
//     {
//       WorldEntity* powerUp = new TurretPowerUp();
//       powerUp->setAbsCoor(this->getAbsCoor());
// //      powerUp->toList(OM_COMMON);
//     }
//     else if ((float)rand()/RAND_MAX < .3)
//     {
//       WorldEntity* powerUp = new LaserPowerUp();
//       powerUp->setAbsCoor(this->getAbsCoor());
//       powerUp->toList(OM_COMMON);
//     }
//     this->toList(OM_DEAD);
//     this->removeNode();
//
//       this->collider = entity;
//   }
//   //  else if (entity->isA(CL_PLAYER))
//   //    this->applyForce(Vector(0,0,0)-location*100);
//   else if (entity->isA(CL_NPC))
//   {
//     this->setVisibiliy(false);
//     this->toList(OM_DEAD);
//     this->removeNode();
//   }
}