/* Copyright: (c) Kayne Ruse 2013
 * 
 * This software is provided 'as-is', without any express or implied
 * warranty. In no event will the authors be held liable for any damages
 * arising from the use of this software.
 * 
 * Permission is granted to anyone to use this software for any purpose,
 * including commercial applications, and to alter it and redistribute it
 * freely, subject to the following restrictions:
 * 
 * 1. The origin of this software must not be misrepresented; you must not
 * claim that you wrote the original software. If you use this software
 * in a product, an acknowledgment in the product documentation would be
 * appreciated but is not required.
 * 
 * 2. Altered source versions must be plainly marked as such, and must not be
 * misrepresented as being the original software.
 * 
 * 3. This notice may not be removed or altered from any source
 * distribution.
*/
#include "tile.hpp"

bool operator<(Tile const& lhs, Tile const& rhs) {
	//sort by depth -> y -> x
	if (lhs.depth == rhs.depth) {
		if (lhs.y == rhs.y) {
			return lhs.x < rhs.x;
		}
		return lhs.y < rhs.y;
	}
	return lhs.depth < rhs.depth;
}

inline bool operator>(Tile const& lhs, Tile const& rhs) {
	//wrap the other operator
	return rhs < lhs;
}

inline bool operator==(Tile const& lhs, Tile const& rhs) {
	//comparisons work on the location ONLY
	//this function is redundant as far as the std::set object is concerned
	return (lhs.x == rhs.x) && (lhs.y == rhs.y) && (lhs.depth == rhs.depth);
}