/******************************************************************************
	libx42.net - skinned vertex animation library (.NET API)
	Copyright (C) 2007 HermitWorks Entertainment Corporation

	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.
		51 Franklin Street, Fifth Floor
		Boston, MA  02110-1301, USA.
******************************************************************************/

#include "Stdafx.h"
#include "Group.h"

#include "Model.h"
#include "Influence.h"
#include "IndexCollection.h"
#include "VertexData.h"
#include "UtilTypes.h"

using namespace System;
using namespace System::Collections::Generic;
using namespace System::IO;

namespace Libx42
{

Group::Group( Model ^owner, int index )
	: owner( owner ), index( index )
{
	infs = gcnew InfluenceCollection( owner, this );
	indices = gcnew IndexCollection( owner, this );
	verts = gcnew VertexData( this );
}

const x42group_t& Group::RawGroup::get( void )
{
	return owner->m->groups[index];
}

String^ Group::MaterialName::get( void )
{
	return owner->GetModelString( RawGroup.material );
}


String^ Group::SurfaceName::get( void )
{
	return owner->GetModelString( RawGroup.surfaceName );
}

int Group::PrimitiveCount::get( void )
{
	return Helpers::ElementCountToPrimitiveCount( PrimitiveType, ElementCount );
}

GroupCollection::GroupCollection( Model ^owner, int minGroup, int maxGroup )
	: ModelItemCollection< Group^ >( owner )
{
	if( !owner->Groups )
	{
		items = gcnew array< Group^ >( maxGroup - minGroup );
		for( int i = minGroup; i < maxGroup; i++ )
			items[i - minGroup] = gcnew Group( owner, (uint)i );
	}
	else
	{
		items = gcnew array< Group^ >( maxGroup - minGroup );
		for( int i = minGroup; i < maxGroup; i++ )
			items[i - minGroup] = owner->Groups[i];
	}
}

};