You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
ryzom-core/nel/src/3d/tile_vegetable_desc.cpp

147 lines
3.8 KiB
C++

// NeL - MMORPG Framework <http://dev.ryzom.com/projects/nel/>
// Copyright (C) 2010 Winch Gate Property Limited
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as
// published by the Free Software Foundation, either version 3 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 Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#include "std3d.h"
#include "nel/3d/tile_vegetable_desc.h"
#include "nel/misc/common.h"
#include "nel/3d/vegetable_manager.h"
using namespace NLMISC;
using namespace std;
#ifdef DEBUG_NEW
#define new DEBUG_NEW
#endif
namespace NL3D
{
// ***************************************************************************
CTileVegetableDesc::CTileVegetableDesc()
{
_Empty= true;
}
// ***************************************************************************
void CTileVegetableDesc::clear()
{
for(sint i=0; i<NL3D_VEGETABLE_BLOCK_NUMDIST; i++)
{
_VegetableList[i].clear();
}
_Empty= true;
}
// ***************************************************************************
void CTileVegetableDesc::build(const std::vector<CVegetable> &vegetables)
{
uint i;
// first clear().
clear();
// Parse all landscape vegetables, and store them in appropriate distance Type.
for(i=0;i<vegetables.size();i++)
{
uint distType= vegetables[i].DistType;
distType= min(distType, (uint)(NL3D_VEGETABLE_BLOCK_NUMDIST-1));
_VegetableList[distType].push_back(vegetables[i]);
}
// Compute Seed such that creation of one vegetable for a tile will never receive same seed.
uint sumVeget= 0;
for(i=0; i<NL3D_VEGETABLE_BLOCK_NUMDIST; i++)
{
_VegetableSeed[i]= sumVeget;
// add number of vegetable for next seed.
sumVeget+= (uint)_VegetableList[i].size();
}
// compile some data
compileRunTime();
}
// ***************************************************************************
void CTileVegetableDesc::registerToManager(CVegetableManager *vegetableManager)
{
// Pasre all distanceType.
for(uint i=0; i<NL3D_VEGETABLE_BLOCK_NUMDIST; i++)
{
// Parse all vegetables of the list.
for(uint j=0; j<_VegetableList[i].size(); j++)
{
// register the vegetable to the manager
_VegetableList[i][j].registerToManager(vegetableManager);
}
}
}
// ***************************************************************************
void CTileVegetableDesc::serial(NLMISC::IStream &f)
{
(void)f.serialVersion(0);
nlassert(NL3D_VEGETABLE_BLOCK_NUMDIST==5);
for(uint i=0; i<NL3D_VEGETABLE_BLOCK_NUMDIST; i++)
{
f.serialCont(_VegetableList[i]);
f.serial(_VegetableSeed[i]);
}
// compile some data
if(f.isReading())
compileRunTime();
}
// ***************************************************************************
const std::vector<CVegetable> &CTileVegetableDesc::getVegetableList(uint distType) const
{
nlassert(distType < NL3D_VEGETABLE_BLOCK_NUMDIST);
return _VegetableList[distType];
}
// ***************************************************************************
uint CTileVegetableDesc::getVegetableSeed(uint distType) const
{
nlassert(distType < NL3D_VEGETABLE_BLOCK_NUMDIST);
return _VegetableSeed[distType];
}
// ***************************************************************************
void CTileVegetableDesc::compileRunTime()
{
// Compute _Empty flag
_Empty= true;
for(uint i=0; i<NL3D_VEGETABLE_BLOCK_NUMDIST; i++)
{
if(!_VegetableList[i].empty())
{
_Empty= false;
break;
}
}
}
} // NL3D