/***************************************************************************
 *   Copyright (C) 2004 by ian reinhart geiser                             *
 *   ian@geiseri.com                                                       *
 *                                                                         *
 *   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 "battleround.h"

BattleRound::BattleRound()
{
	m_current = 0L;
}


BattleRound::~BattleRound()
{
}

void BattleRound::add( Unit * unit )
{
	m_units.append(unit);
}

Unit * BattleRound::unit( int idx ) const
{
	return m_units.at(idx);
}

int BattleRound::count( ) const
{
	return m_units.count();
}

Unit * BattleRound::deadUnit( int idx ) const
{
	return m_dead.at(idx);
}

int BattleRound::deadCount( ) const
{
	return m_dead.count();
}

void BattleRound::startRound( )
{
	m_current = m_units.begin();
}

Unit * BattleRound::nextUnit( ) const
{
	if( m_current == 0 )
		return 0;
	if( m_current == m_units.end() )
		return 0;
	Unit *retUnit = *m_current;
	++m_current;
	return retUnit;
}

void BattleRound::endRound( )
{
}

void BattleRound::remove( Unit * unt ) const
{
	
}

void BattleRound::order( )
{

}



