/*
Minetest-c55
Copyright (C) 2010 celeron55, Perttu Ahola <celeron55@gmail.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.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/

#include "mapsector.h"
#include "jmutexautolock.h"
#include "client.h"
#include "exceptions.h"

MapSector::MapSector(NodeContainer *parent, v2s16 pos):
		differs_from_disk(true),
		usage_timer(0.0),
		m_parent(parent),
		m_pos(pos),
		m_block_cache(NULL)
{
	m_mutex.Init();
	assert(m_mutex.IsInitialized());
}

MapSector::~MapSector()
{
	deleteBlocks();
}

void MapSector::deleteBlocks()
{
	JMutexAutoLock lock(m_mutex);

	// Clear cache
	m_block_cache = NULL;

	// Delete all
	core::map<s16, MapBlock*>::Iterator i = m_blocks.getIterator();
	for(; i.atEnd() == false; i++)
	{
		delete i.getNode()->getValue();
	}

	// Clear container
	m_blocks.clear();
}

MapBlock * MapSector::getBlockBuffered(s16 y)
{
	MapBlock *block;

	if(m_block_cache != NULL && y == m_block_cache_y){
		return m_block_cache;
	}
	
	// If block doesn't exist, return NULL
	core::map<s16, MapBlock*>::Node *n = m_blocks.find(y);
	if(n == NULL)
	{
		block = NULL;
	}
	// If block exists, return it
	else{
		block = n->getValue();
	}
	
	// Cache the last result
	m_block_cache_y = y;
	m_block_cache = block;
	
	return block;
}

MapBlock * MapSector::getBlockNoCreateNoEx(s16 y)
{
	JMutexAutoLock lock(m_mutex);
	
	return getBlockBuffered(y);
}

MapBlock * MapSector::getBlockNoCreate(s16 y)
{
	MapBlock *block = getBlockNoCreateNoEx(y);

	if(block == NULL)
		throw InvalidPositionException();
	
	return block;
}

MapBlock * MapSector::createBlankBlockNoInsert(s16 y)
{
	// There should not be a block at this position
	if(getBlockBuffered(y) != NULL)
		throw AlreadyExistsException("Block already exists");

	v3s16 blockpos_map(m_pos.X, y, m_pos.Y);
	
	MapBlock *block = new MapBlock(m_parent, blockpos_map);
	
	return block;
}

MapBlock * MapSector::createBlankBlock(s16 y)
{
	JMutexAutoLock lock(m_mutex);
	
	MapBlock *block = createBlankBlockNoInsert(y);
	
	m_blocks.insert(y, block);

	return block;
}

void MapSector::insertBlock(MapBlock *block)
{
	s16 block_y = block->getPos().Y;

	{
		JMutexAutoLock lock(m_mutex);

		MapBlock *block2 = getBlockBuffered(block_y);
		if(block2 != NULL){
			throw AlreadyExistsException("Block already exists");
		}

		v2s16 p2d(block->getPos().X, block->getPos().Z);
		assert(p2d == m_pos);
		
		// Insert into container
		m_blocks.insert(block_y, block);
	}
}

void MapSector::removeBlock(MapBlock *block)
{
	s16 block_y = block->getPos().Y;

	JMutexAutoLock lock(m_mutex);
	
	// Clear from cache
	m_block_cache = NULL;
	
	// Remove from container
	m_blocks.remove(block_y);
}

void MapSector::getBlocks(core::list<MapBlock*> &dest)
{
	JMutexAutoLock lock(m_mutex);

	core::list<MapBlock*> ref_list;

	core::map<s16, MapBlock*>::Iterator bi;

	bi = m_blocks.getIterator();
	for(; bi.atEnd() == false; bi++)
	{
		MapBlock *b = bi.getNode()->getValue();
		dest.push_back(b);
	}
}

/*
	ServerMapSector
*/

ServerMapSector::ServerMapSector(NodeContainer *parent, v2s16 pos):
		MapSector(parent, pos)
{
}

ServerMapSector::~ServerMapSector()
{
}

f32 ServerMapSector::getGroundHeight(v2s16 p, bool generate)
{
	return GROUNDHEIGHT_NOTFOUND_SETVALUE;
}

void ServerMapSector::setGroundHeight(v2s1<span class="hl com">/*</span>
<span class="hl com">Minetest</span>
<span class="hl com">Copyright (C) 2010-2013 celeron55, Perttu Ahola &lt;celeron55&#64;gmail.com&gt;</span>
<span class="hl com"></span>
<span class="hl com">This program is free software; you can redistribute it and/or modify</span>
<span class="hl com">it under the terms of the GNU Lesser General Public License as published by</span>
<span class="hl com">the Free Software Foundation; either version 2.1 of the License, or</span>
<span class="hl com">(at your option) any later version.</span>
<span class="hl com"></span>
<span class="hl com">This program is distributed in the hope that it will be useful,</span>
<span class="hl com">but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<span class="hl com">MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<span class="hl com">GNU Lesser General Public License for more details.</span>
<span class="hl com"></span>
<span class="hl com">You should have received a copy of the GNU Lesser General Public License along</span>
<span class="hl com">with this program; if not, write to the Free Software Foundation, Inc.,</span>
<span class="hl com">51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.</span>
<span class="hl com">*/</span>

<span class="hl ppc">#ifndef IRR_V2D_HEADER</span>
<span class="hl ppc">#define IRR_V2D_HEADER</span>

<span class="hl ppc">#include</span> <span class="hl pps">&quot;irrlichttypes.h&quot;</span><span class="hl ppc"></span>

<span class="hl ppc">#include &lt;vector2d.h&gt;</span>

<span class="hl kwc">typedef core</span><span class="hl opt">::</span>vector2d<span class="hl opt">&lt;</span>f32<span class="hl opt">&gt;</span> v2f<span class="hl opt">;</span>
<span class="hl kwc">typedef core</span><span class="hl opt">::</span>vector2d<span class="hl opt">&lt;</span>s16<span class="hl opt">&gt;</span> v2s16<span class="hl opt">;</span>
<span class="hl kwc">typedef core</span><span class="hl opt">::</span>vector2d<span class="hl opt">&lt;</span>s32<span class="hl opt">&gt;</span> v2s32<span class="hl opt">;</span>
<span class="hl kwc">typedef core</span><span class="hl opt">::</span>vector2d<span class="hl opt">&lt;</span>u32<span class="hl opt">&gt;</span> v2u32<span class="hl opt">;</span>
<span class="hl kwc">typedef core</span><span class="hl opt">