// Copyright (C) 2015 Jérôme Leclercq
// This file is part of the "Nazara Engine - Core module"
// For conditions of distribution and use, see copyright notice in Config.hpp

// Implémentation originale de Jukka Jylänki (Merci de sa contribution au domaine public)
// http://clb.demon.fi/projects/even-more-rectangle-bin-packing
// Je n'ai vraiment fait qu'adapter le code au moteur (Avec quelques améliorations), je n'ai aucun mérite sur le code ci-dessous

#include <Nazara/Core/GuillotineBinPack.hpp>
#include <Nazara/Core/Config.hpp>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <limits>
#include <Nazara/Core/Debug.hpp>

namespace Nz
{
	/*!
	* \ingroup core
	* \class Nz::GuillotineBinPack
	* \brief Core class that represents the "Guillotine problem", combination of the "Bin packing problem" and the "cutting stock"
	*/

	namespace
	{
		/*!
		* \brief Gets the score for fitting the area
		* \return Score of the fitting
		*
		* \param width Width
		* \param height Height
		* \param freeRectSize Free area
		*/

		int ScoreBestAreaFit(int width, int height, const Rectui& freeRectSize)
		{
			return freeRectSize.width * freeRectSize.height - width * height;
		}

		/*!
		* \brief Gets the score for fitting the area following long side
		* \return Score of the fitting following long side
		*
		* \param width Width
		* \param height Height
		* \param freeRectSize Free area
		*/

		int ScoreBestLongSideFit(int width, int height, const Rectui& freeRectSize)
		{
			int leftoverHoriz = std::abs(static_cast<int>(freeRectSize.width - width));
			int leftoverVert = std::abs(static_cast<int>(freeRectSize.height - height));
			int leftover = std::max(leftoverHoriz, leftoverVert);

			return leftover;
		}

		/*!
		* \brief Gets the score for fitting the area following short side
		* \return Score of the fitting following short side
		*
		* \param width Width
		* \param height Height
		* \param freeRectSize Free area
		*/

		int ScoreBestShortSideFit(int width, int height, const Rectui& freeRectSize)
		{
			int leftoverHoriz = std::abs(static_cast<int>(freeRectSize.width - width));
			int leftoverVert = std::abs(static_cast<int>(freeRectSize.height - height));
			int leftover = std::min(leftoverHoriz, leftoverVert);

			return leftover;
		}

		/*!
		* \brief Gets the worst score for fitting the area
		* \return Worst score of the fitting
		*
		* \param width Width
		* \param height Height
		* \param freeRectSize Free area
		*/

		int ScoreWorstAreaFit(int width, int height, const Rectui& freeRectSize)
		{
			return -ScoreBestAreaFit(width, height, freeRectSize);
		}

		/*!
		* \brief Gets the worst score for fitting the area following long side
		* \return Worst score of the fitting following long side
		*
		* \param width Width
		* \param height Height
		* \param freeRectSize Free area
		*/

		int ScoreWorstLongSideFit(int width, int height, const Rectui& freeRectSize)
		{
			return -ScoreBestLongSideFit(width, height, freeRectSize);
		}

		/*!
		* \brief Gets the worst score for fitting the area following short side
		* \return Worst score of the fitting following short side
		*
		* \param width Width
		* \param height Height
		* \param freeRectSize Free area
		*/

		int ScoreWorstShortSideFit(int width, int height, const Rectui& freeRectSize)
		{
			return -ScoreBestShortSideFit(width, height, freeRectSize);
		}
	}

	/*!
	* \brief Constructs a GuillotineBinPack object by default
	*/

	GuillotineBinPack::GuillotineBinPack()
	{
		Reset();
	}

	/*!
	* \brief Constructs a GuillotineBinPack object with width and height
	*
	* \param width Width
	* \param height Height
	*/

	GuillotineBinPack::GuillotineBinPack(unsigned int width, unsigned int height)
	{
		Reset(width, height);
	}

	/*!
	* \brief Constructs a GuillotineBinPack object with area
	*
	* \param size Vector2 representing the area (width, height)
	*/

	GuillotineBinPack::GuillotineBinPack(const Vector2ui& size)
	{
		Reset(size);
	}

	/*!
	* \brief Clears the content
	*/

	void GuillotineBinPack::Clear()
	{
		m_freeRectangles.clear();
		m_freeRectangles.push_back(Rectui(0, 0, m_width, m_height));

		m_usedArea = 0;
	}

	/*!
	* \brief Expands the content
	*
	* \param newWidth New width for the expansion
	* \param newHeight New height for the expansion
	*
	* \see Expand
	*/

	void GuillotineBinPack::Expand(unsigned int newWidth, unsigned newHeight)
	{
		unsigned int oldWidth = m_width;
		unsigned int oldHeight = m_height;

		m_width = std::max(newWidth, m_width);
		m_height = std::max(newHeight, m_height);

		if (m_width > oldWidth)
			m_freeRectangles.push_back(Rectui(oldWidth, 0, m_width - oldWidth, oldHeight));

		if (m_height > oldHeight)
			m_freeRectangles.push_back(Rectui(0, oldHeight, m_width, m_height - oldHeight));

		// On va ensuite fusionner les rectangles tant que possible
		while (MergeFreeRectangles());
	}

	/*!
	* \brief Expands the content
	*
	* \param newSize New area for the expansion
	*
	* \see Expand
	*/

	void GuillotineBinPack::Expand(const Vector2ui& newSize)
	{
		Expand(newSize.x, newSize.y);
	}

	/*!
	* \brief Frees the rectangle
	*
	* \param rect Area to free
	*
	* \remark This method should only be called with computed rectangles by the method Insert and can produce fragmentation
	*/

	void GuillotineBinPack::FreeRectangle(const Rectui& rect)
	{
		m_freeRectangles.push_back(rect);

		m_usedArea -= rect.width * rect.height;
	}

	/*!
	* \brief Gets the height
	* \return Height of the area
	*/

	unsigned int GuillotineBinPack::GetHeight() const
	{
		return m_height;
	}

	/*!
	* \brief Gets percentage of occupation
	* \return Percentage of the already occupied area
	*/

	float GuillotineBinPack::GetOccupancy() const
	{
		return static_cast<float>(m_usedArea)/(m_width*m_height);
	}

	/*!
	* \brief Gets the size of the area
	* \return Size of the area
	*/

	Vector2ui GuillotineBinPack::GetSize() const
	{
		return Vector2ui(m_width, m_height);
	}

	/*!
	* \brief Gets the width
	* \return Width of the area
	*/

	unsigned int GuillotineBinPack::GetWidth() const
	{
		return m_width;
	}

	/*!
	* \brief Inserts rectangles in the area
	* \return true if each rectangle could be inserted
	*
	* \param rects List of rectangles
	* \param count Count of rectangles
	* \param merge Merge possible
	* \param rectChoice Heuristic to use to free
	* \param splitMethod Heuristic to use to split
	*/

	bool GuillotineBinPack::Insert(Rectui* rects, unsigned int count, bool merge, FreeRectChoiceHeuristic rectChoice, GuillotineSplitHeuristic splitMethod)
	{
		return Insert(rects, nullptr, nullptr, count, merge, rectChoice, splitMethod);
	}

	/*!
	* \brief Inserts rectangles in the area
	* \return true if each rectangle could be inserted
	*
	* \param rects List of rectangles
	* \param flipped List of flipped rectangles
	* \param count Count of rectangles
	* \param merge Merge possible
	* \param rectChoice Heuristic to use to free
	* \param splitMethod Heuristic to use to split
	*/

	bool GuillotineBinPack::Insert(Rectui* rects, bool* flipped, unsigned int count, bool merge, FreeRectChoiceHeuristic rectChoice, GuillotineSplitHeuristic splitMethod)
	{
		return Insert(rects, flipped, nullptr, count, merge, rectChoice, splitMethod);
	}

	/*!
	* \brief Inserts rectangles in the area
	* \return true if each rectangle could be inserted
	*
	* \param rects List of rectangles
	* \param flipped List of flipped rectangles
	* \param flipped List of inserted rectangles
	* \param count Count of rectangles
	* \param merge Merge possible
	* \param rectChoice Heuristic to use to free
	* \param splitMethod Heuristic to use to split
	*/

	bool GuillotineBinPack::Insert(Rectui* rects, bool* flipped, bool* inserted, unsigned int count, bool merge, FreeRectChoiceHeuristic rectChoice, GuillotineSplitHeuristic splitMethod)
	{
		std::vector<Rectui*> remainingRects(count); // Position of the rectangle
		for (unsigned int i = 0; i < count; ++i)
			remainingRects[i] = &rects[i];

		// Pack rectangles one at a time until we have cleared the rects array of all rectangles.
		while (!remainingRects.empty())
		{
			// Stores the penalty score of the best rectangle placement - bigger=worse, smaller=better.
			bool bestFlipped;
			std::size_t bestFreeRect;
			std::size_t bestRect;
			int bestScore = std::numeric_limits<int>::max();

			for (std::size_t i = 0; i < m_freeRectangles.size(); ++i)
			{
				Rectui& freeRect = m_freeRectangles[i];

				for (std::size_t j = 0; j < remainingRects.size(); ++j)
				{
					Rectui& rect = *remainingRects[j];

					// If this rectangle is a perfect match, we pick it instantly.
					if (rect.width == freeRect.width && rect.height == freeRect.height)
					{
						bestFreeRect = i;
						bestRect = j;
						bestFlipped = false;
						bestScore = std::numeric_limits<int>::min();
						i = m_freeRectangles.size(); // Force a jump out of the outer loop as well - we got an instant fit.
						break;
					}
					// If flipping this rectangle is a perfect match, pick that then.
					else if (rect.height == freeRect.width && rect.width == freeRect.height)
					{
						bestFreeRect = i;
						bestRect = j;
						bestFlipped = true;
						bestScore = std::numeric_limits<int>::min();
						i = m_freeRectangles.size(); // Force a jump out of the outer loop as well - we got an instant fit.
						break;
					}
					// Try if we can fit the rectangle upright.
					else if (rect.width <= freeRect.width && rect.height <= freeRect.height)
					{
						int score = ScoreByHeuristic(rect.width, rect.height, freeRect, rectChoice);
						if (score < bestScore)
						{
							bestFreeRect = i;
							bestRect = j;
							bestFlipped = false;
							bestScore = score;
						}
					}
					// If not, then perhaps flipping sideways will make it fit?
					else if (rect.height <= freeRect.width && rect.width <= freeRect.height)
					{
						int score = ScoreByHeuristic(rect.height, rect.width, freeRect, rectChoice);
						if (score < bestScore)
						{
							bestFreeRect = i;
							bestRect = j;
							bestFlipped = true;
							bestScore = score;
						}
					}
				}
			}

			// If we didn't manage to find any rectangle to pack, abort.
			if (bestScore == std::numeric_limits<int>::max())
			{
				// If we can do it, we mark the rectangle could be inserted
				if (inserted)
				{
					for (Rectui* rect : remainingRects)
					{
						std::ptrdiff_t position = rect - rects;
						inserted[position] = false;
					}
				}

				return false;
			}

			// Otherwise, we're good to go and do the actual packing.
			std::ptrdiff_t position = remainingRects[bestRect] - rects;
			Rectui& rect = *remainingRects[bestRect];
			rect.x = m_freeRectangles[bestFreeRect].x;
			rect.y = m_freeRectangles[bestFreeRect].y;

			if (bestFlipped)
				std::swap(rect.width, rect.height);

			if (flipped)
				flipped[position] = bestFlipped;

			if (inserted)
				inserted[position] = true;

			// Remove the free space we lost in the bin.
			SplitFreeRectByHeuristic(m_freeRectangles[bestFreeRect], rect, splitMethod);
			m_freeRectangles.erase(m_freeRectangles.begin() + bestFreeRect);

			// Remove the rectangle we just packed from the input list.
			remainingRects.erase(remainingRects.begin() + bestRect);

			// Perform a Rectangle Merge step if desired.
			if (merge)
				MergeFreeRectangles();

			m_usedArea += rect.width * rect.height;
		}

		return true;
	}

	/*!
	* \brief Merges free rectangles together
	* \return true if there was a merge (and thus if a merge is still possible)
	*/

	bool GuillotineBinPack::MergeFreeRectangles()
	{
		std::size_t oriSize = m_freeRectangles.size();

		// Do a Theta(n^2) loop to see if any pair of free rectangles could me merged into one.
		// Note that we miss any opportunities to merge three rectangles into one. (should call this function again to detect that)
		for (std::size_t i = 0; i < m_freeRectangles.size(); ++i)
		{
			Rectui& firstRect = m_freeRectangles[i];

			for (std::size_t j = i+1; j < m_freeRectangles.size(); ++j)
			{
				Rectui& secondRect = m_freeRectangles[j];

				if (firstRect.width == secondRect.width && firstRect.x == secondRect.x)
				{
					if (firstRect.y == secondRect.y + secondRect.height)
					{
						firstRect.y -= secondRect.height;
						firstRect.height += secondRect.height;
						m_freeRectangles.erase(m_freeRectangles.begin() + j);
						--j;
					}
					else if (firstRect.y + firstRect.height == secondRect.y)
					{
						firstRect.height += secondRect.height;
						m_freeRectangles.erase(m_freeRectangles.begin() + j);
						--j;
					}
				}
				else if (firstRect.height == secondRect.height && firstRect.y == secondRect.y)
				{
					if (firstRect.x == secondRect.x + secondRect.width)
					{
						firstRect.x -= secondRect.width;
						firstRect.width += secondRect.width;
						m_freeRectangles.erase(m_freeRectangles.begin() + j);
						--j;
					}
					else if (firstRect.x + firstRect.width == secondRect.x)
					{
						firstRect.width += secondRect.width;
						m_freeRectangles.erase(m_freeRectangles.begin() + j);
						--j;
					}
				}
			}
		}

		return m_freeRectangles.size() < oriSize;
	}

	/*!
	* \brief Resets the area
	*/

	void GuillotineBinPack::Reset()
	{
		m_height = 0;
		m_width = 0;

		Clear();
	}

	/*!
	* \brief Resets the area
	*
	* \param width Width
	* \param height Height
	*/

	void GuillotineBinPack::Reset(unsigned int width, unsigned int height)
	{
		m_height = height;
		m_width = width;

		Clear();
	}

	/*!
	* \brief Resets the area
	*
	* \param size Size of the area
	*/

	void GuillotineBinPack::Reset(const Vector2ui& size)
	{
		Reset(size.x, size.y);
	}

	/*!
	* \brief Splits the free rectangle along axis
	*
	* \param freeRect Free rectangle to split
	* \param placedRect Already placed rectangle
	* \param splitHorizontal Split horizontally (or vertically)
	*/

	void GuillotineBinPack::SplitFreeRectAlongAxis(const Rectui& freeRect, const Rectui& placedRect, bool splitHorizontal)
	{
		// Form the two new rectangles.
		Rectui bottom;
		bottom.x = freeRect.x;
		bottom.y = freeRect.y + placedRect.height;
		bottom.height = freeRect.height - placedRect.height;

		Rectui right;
		right.x = freeRect.x + placedRect.width;
		right.y = freeRect.y;
		right.width = freeRect.width - placedRect.width;

		if (splitHorizontal)
		{
			bottom.width = freeRect.width;
			right.height = placedRect.height;
		}
		else // Split vertically
		{
			bottom.width = placedRect.width;
			right.height = freeRect.height;
		}

		// Add the new rectangles into the free rectangle pool if they weren't degenerate.
		if (bottom.width > 0 && bottom.height > 0)
			m_freeRectangles.push_back(bottom);

		if (right.width > 0 && right.height > 0)
			m_freeRectangles.push_back(right);
	}

	/*!
	* \brief Splits the free rectangle using the heuristic
	*
	* \param freeRect Free rectangle to split
	* \param placedRect Already placed rectangle
	* \param method Method used to split
	*
	* \remark Produces a NazaraError if enumeration GuillotineSplitHeuristic is invalid
	*/

	void GuillotineBinPack::SplitFreeRectByHeuristic(const Rectui& freeRect, const Rectui& placedRect, GuillotineSplitHeuristic method)
	{
		// Compute the lengths of the leftover area
		const int w = freeRect.width - placedRect.width;
		const int h = freeRect.height - placedRect.height;

		// Placing placedRect into freeRect results in an L-shaped free area, which must be split into
		// two disjoint rectangles. This can be achieved with by splitting the L-shape using a single line
		// We have two choices: horizontal or vertical

		// Use the given heuristic to decide which choice to make

		bool splitHorizontal;
		switch (method)
		{
			case SplitLongerAxis:
				// Split along the longer total axis
				splitHorizontal = (freeRect.width > freeRect.height);
				break;

			case SplitLongerLeftoverAxis:
				// Split along the longer leftover axis
				splitHorizontal = (w > h);
				break;

			case SplitMaximizeArea:
				// Maximize the smaller area == minimize the larger area
				// Tries to make the rectangles more even-sized
				splitHorizontal = (placedRect.width * h <= w * placedRect.height);
				break;

			case SplitMinimizeArea:
				// Maximize the larger area == minimize the smaller area
				// Tries to make the single bigger rectangle
				splitHorizontal = (placedRect.width * h > w * placedRect.height);
				break;

			case SplitShorterAxis:
				// Split along the shorter total axis
				splitHorizontal = (freeRect.width <= freeRect.height);
				break;

			case SplitShorterLeftoverAxis:
				// Split along the shorter leftover axis
				splitHorizontal = (w <= h);
				break;

			default:
				NazaraError("Split heuristic out of enum (0x" + String::Number(method, 16) + ')');
				splitHorizontal = true;
		}

		// Perform the actual split
		SplitFreeRectAlongAxis(freeRect, placedRect, splitHorizontal);
	}

	/*!
	* \brief Gets the score using heuristic
	* \return Score of the heuristic
	*
	* \param width Width
	* \param height Height
	* \param freeRect Free area
	* \param rectChoice Heuristic to get score
	*
	* \remark Produces a NazaraError if enumeration FreeRectChoiceHeuristic is invalid
	*/

	int GuillotineBinPack::ScoreByHeuristic(int width, int height, const Rectui& freeRect, FreeRectChoiceHeuristic rectChoice)
	{
		switch (rectChoice)
		{
			case RectBestAreaFit:
				return ScoreBestAreaFit(width, height, freeRect);

			case RectBestLongSideFit:
				return ScoreBestLongSideFit(width, height, freeRect);

			case RectBestShortSideFit:
				return ScoreBestShortSideFit(width, height, freeRect);

			case RectWorstAreaFit:
				return ScoreWorstAreaFit(width, height, freeRect);

			case RectWorstLongSideFit:
				return ScoreWorstLongSideFit(width, height, freeRect);

			case RectWorstShortSideFit:
				return ScoreWorstShortSideFit(width, height, freeRect);
		}

		NazaraError("Rect choice heuristic out of enum (0x" + String::Number(rectChoice, 16) + ')');
		return std::numeric_limits<int>::max();
	}
}