2011-12-14 00:35:28 +03:00
|
|
|
#pragma once
|
2010-04-02 05:07:40 +03:00
|
|
|
|
2009-04-15 17:03:31 +03:00
|
|
|
/*
|
2014-05-26 11:37:04 +03:00
|
|
|
* int3.h, part of VCMI engine
|
|
|
|
*
|
|
|
|
* Authors: listed in file AUTHORS in main folder
|
|
|
|
*
|
|
|
|
* License: GNU General Public License v2.0 or later
|
|
|
|
* Full text of license available in license.txt file, in main folder
|
|
|
|
*
|
|
|
|
*/
|
2009-04-16 14:14:13 +03:00
|
|
|
|
2011-02-22 13:52:36 +02:00
|
|
|
/// Class which consists of three integer values. Represents position on adventure map.
|
2009-04-16 14:14:13 +03:00
|
|
|
class int3
|
|
|
|
{
|
|
|
|
public:
|
2014-05-25 21:12:53 +03:00
|
|
|
si32 x, y, z;
|
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
//c-tor: x, y, z initialized to 0
|
|
|
|
int3() : x(0), y(0), z(0) {} // I think that x, y, z should be left uninitialized.
|
|
|
|
//c-tor: x, y, z initialized to i
|
|
|
|
explicit int3(const si32 i) : x(i), y(i), z(i) {}
|
|
|
|
//c-tor: x, y, z initialized to X, Y, Z
|
|
|
|
int3(const si32 X, const si32 Y, const si32 Z) : x(X), y(Y), z(Z) {}
|
|
|
|
int3(const int3 & c) : x(c.x), y(c.y), z(c.z) {} // Should be set to default (C++11)?
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
int3 & operator=(const int3 & c) // Should be set to default (C++11)?
|
|
|
|
{
|
|
|
|
x = c.x;
|
|
|
|
y = c.y;
|
|
|
|
z = c.z;
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
int3 operator-() const { return int3(-x, -y, -z); }
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
int3 operator+(const int3 & i) const { return int3(x + i.x, y + i.y, z + i.z); }
|
|
|
|
int3 operator-(const int3 & i) const { return int3(x - i.x, y - i.y, z - i.z); }
|
|
|
|
//returns int3 with coordinates increased by given number
|
|
|
|
int3 operator+(const si32 i) const { return int3(x + i, y + i, z + i); }
|
|
|
|
//returns int3 with coordinates decreased by given number
|
|
|
|
int3 operator-(const si32 i) const { return int3(x - i, y - i, z - i); }
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
int3 & operator+=(const int3 & i)
|
|
|
|
{
|
|
|
|
x += i.x;
|
|
|
|
y += i.y;
|
|
|
|
z += i.z;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
int3 & operator-=(const int3 & i)
|
|
|
|
{
|
|
|
|
x -= i.x;
|
|
|
|
y -= i.y;
|
|
|
|
z -= i.z;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
//increases all coordinates by given number
|
|
|
|
int3 & operator+=(const si32 i)
|
|
|
|
{
|
|
|
|
x += i;
|
|
|
|
y += i;
|
|
|
|
z += i;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
//decreases all coordinates by given number
|
|
|
|
int3 & operator-=(const si32 i)
|
|
|
|
{
|
|
|
|
x -= i;
|
|
|
|
y -= i;
|
|
|
|
z -= i;
|
|
|
|
return *this;
|
|
|
|
}
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
bool operator==(const int3 & i) const { return (x == i.x && y == i.y && z == i.z); }
|
|
|
|
bool operator!=(const int3 & i) const { return (x != i.x || y != i.y || z != i.z); }
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
bool operator<(const int3 & i) const
|
|
|
|
{
|
|
|
|
if (z < i.z)
|
|
|
|
return true;
|
|
|
|
if (z > i.z)
|
|
|
|
return false;
|
|
|
|
if (y < i.y)
|
|
|
|
return true;
|
|
|
|
if (y > i.y)
|
|
|
|
return false;
|
|
|
|
if (x < i.x)
|
|
|
|
return true;
|
|
|
|
if (x > i.x)
|
|
|
|
return false;
|
|
|
|
return false;
|
|
|
|
}
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
//returns squared distance on Oxy plane (z coord is not used)
|
2014-08-30 19:45:11 +03:00
|
|
|
ui32 dist2dSQ(const int3 & o) const
|
2014-05-26 11:37:04 +03:00
|
|
|
{
|
|
|
|
const si32 dx = (x - o.x);
|
|
|
|
const si32 dy = (y - o.y);
|
2014-08-30 19:45:11 +03:00
|
|
|
return (ui32)(dx*dx) + (ui32)(dy*dy);
|
2014-05-26 11:37:04 +03:00
|
|
|
}
|
|
|
|
//returns distance on Oxy plane (z coord is not used)
|
|
|
|
double dist2d(const int3 & o) const
|
|
|
|
{
|
|
|
|
return std::sqrt((double)dist2dSQ(o));
|
|
|
|
}
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
bool areNeighbours(const int3 & o) const
|
|
|
|
{
|
|
|
|
return (dist2dSQ(o) < 4) && (z == o.z);
|
|
|
|
}
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
//returns "(x y z)" string
|
|
|
|
std::string operator ()() const //Change to int3::toString()?
|
|
|
|
{
|
|
|
|
std::string result("(");
|
|
|
|
result += boost::lexical_cast<std::string>(x); result += ' ';
|
|
|
|
result += boost::lexical_cast<std::string>(y); result += ' ';
|
|
|
|
result += boost::lexical_cast<std::string>(z); result += ')';
|
|
|
|
return result;
|
|
|
|
}
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
bool valid() const //Should be named "isValid"?
|
|
|
|
{
|
|
|
|
return z >= 0; //minimal condition that needs to be fulfilled for tiles in the map
|
|
|
|
}
|
2014-05-25 21:12:53 +03:00
|
|
|
|
|
|
|
template <typename Handler>
|
2014-05-26 11:37:04 +03:00
|
|
|
void serialize(Handler &h, const int version)
|
|
|
|
{
|
|
|
|
h & x & y & z;
|
|
|
|
}
|
2009-04-16 14:14:13 +03:00
|
|
|
};
|
2014-05-25 21:12:53 +03:00
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
inline std::ostream & operator<<(std::ostream & str, const int3 & sth)
|
2014-05-25 21:12:53 +03:00
|
|
|
{
|
2014-05-26 11:37:04 +03:00
|
|
|
return str << sth.x << ' ' << sth.y << ' ' << sth.z;
|
2014-05-25 21:12:53 +03:00
|
|
|
}
|
2009-04-16 14:14:13 +03:00
|
|
|
inline std::istream & operator>>(std::istream & str, int3 & dest)
|
|
|
|
{
|
2014-05-25 21:12:53 +03:00
|
|
|
return str >> dest.x >> dest.y >> dest.z;
|
2009-04-16 14:14:13 +03:00
|
|
|
}
|
|
|
|
|
2014-05-26 11:37:04 +03:00
|
|
|
//Why not normal function?
|
2011-01-20 19:25:15 +02:00
|
|
|
struct ShashInt3
|
|
|
|
{
|
|
|
|
size_t operator()(int3 const& pos) const
|
|
|
|
{
|
2013-06-29 16:05:48 +03:00
|
|
|
size_t ret = std::hash<int>()(pos.x);
|
|
|
|
vstd::hash_combine(ret, pos.y);
|
|
|
|
vstd::hash_combine(ret, pos.z);
|
2011-01-20 19:25:15 +02:00
|
|
|
return ret;
|
|
|
|
}
|
2014-05-30 17:50:06 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
static const int3 dirs[] = { int3(0,1,0),int3(0,-1,0),int3(-1,0,0),int3(+1,0,0),
|
2014-06-18 10:57:36 +03:00
|
|
|
int3(1,1,0),int3(-1,1,0),int3(1,-1,0),int3(-1,-1,0) };
|
|
|
|
|
|
|
|
template<typename Container>
|
|
|
|
int3 findClosestTile (Container & container, int3 dest)
|
|
|
|
{
|
2014-08-30 20:08:04 +03:00
|
|
|
static_assert(std::is_same<typename Container::value_type, int3>::value,
|
2014-08-30 19:45:11 +03:00
|
|
|
"findClosestTile requires <int3> container.");
|
|
|
|
|
|
|
|
int3 result(-1, -1, -1);
|
2014-06-18 10:57:36 +03:00
|
|
|
ui32 distance = std::numeric_limits<ui32>::max();
|
2014-08-30 19:45:11 +03:00
|
|
|
for (const int3& tile : container)
|
2014-06-18 10:57:36 +03:00
|
|
|
{
|
2014-08-30 19:45:11 +03:00
|
|
|
const ui32 currentDistance = dest.dist2dSQ(tile);
|
2014-06-18 10:57:36 +03:00
|
|
|
if (currentDistance < distance)
|
|
|
|
{
|
|
|
|
result = tile;
|
|
|
|
distance = currentDistance;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|