Mercurial > fife-parpg
diff engine/core/util/math/angles.cpp @ 0:4a0efb7baf70
* Datasets becomes the new trunk and retires after that :-)
author | mvbarracuda@33b003aa-7bff-0310-803a-e67f0ece8222 |
---|---|
date | Sun, 29 Jun 2008 18:44:17 +0000 |
parents | |
children | 90005975cdbb |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/engine/core/util/math/angles.cpp Sun Jun 29 18:44:17 2008 +0000 @@ -0,0 +1,94 @@ +/*************************************************************************** + * Copyright (C) 2005-2008 by the FIFE team * + * http://www.fifengine.de * + * This file is part of FIFE. * + * * + * FIFE 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 St, Fifth Floor, Boston, MA 02110-1301 USA * + ***************************************************************************/ + +// Standard C++ library includes +#include <iostream> + +// 3rd party library includes + +// FIFE includes +// These includes are split up in two parts, separated by one empty line +// First block: files included from the FIFE root src directory +// Second block: files included from the same folder +#include "angles.h" + +namespace FIFE { + int getIndexByAngle(int angle, const type_angle2id& angle2id, int& closestMatchingAngle) { + int wangle = (360 + angle) % 360; + + if (angle2id.size() == 0) { + return -1; + } + if (angle2id.size() == 1) { + closestMatchingAngle = angle2id.begin()->first; + return angle2id.begin()->second; + } + + type_angle2id::const_iterator u(angle2id.upper_bound(wangle)); + type_angle2id::const_iterator tmp; + + // take care of the forward wrapping case + if (u == angle2id.end()) { + int ud = wangle - (--u)->first; + int ld = 360 - wangle + angle2id.begin()->first; + if (ud > ld) { + // wrapped value (first) + closestMatchingAngle = angle2id.begin()->first; + return angle2id.begin()->second; + } + // non-wrapped value + closestMatchingAngle = u->first; + return u->second; + } + + // take care of the backward wrapping case + if (u == angle2id.begin()) { + tmp = angle2id.end(); + tmp--; + int ld = u->first - wangle; + int ud = 360 - tmp->first + wangle; + if (ud > ld) { + // non-wrapped value (first) + closestMatchingAngle = angle2id.begin()->first; + return angle2id.begin()->second; + } + // wrapped value (last) + closestMatchingAngle = tmp->first; + return tmp->second; + } + + // value in the middle... + int ud = u->first - wangle; + int ucm = u->first; + int ui = u->second; + u--; + int ld = wangle - u->first; + int lcm = u->first; + int li = u->second; + + if (ud <= ld) { + closestMatchingAngle = ucm; + return ui; + } + closestMatchingAngle = lcm; + return li; + } +}