1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
|
/***************************************************************************
* Copyright (C) 2005-2019 by the FIFE team *
* http://www.fifengine.net *
* This file is part of FIFE. *
* *
* FIFE is free software; you can redistribute it and/or *
* modify it under the terms of the GNU Lesser General Public *
* License as published by the Free Software Foundation; either *
* version 2.1 of the License, or (at your option) any later version. *
* *
* This library 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 *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this library; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *
***************************************************************************/
// Standard C++ library includes
// 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 "util/log/logger.h"
#include "util/base/exception.h"
#include "model/structures/instance.h"
#include "model/metamodel/object.h"
#include "model/metamodel/action.h"
#include "visual.h"
namespace FIFE {
/** Logger to use for this source file.
* @relates Logger
*/
static Logger _log(LM_VIEW);
OverlayColors::OverlayColors() {
}
OverlayColors::OverlayColors(ImagePtr image):
m_image(image) {
}
OverlayColors::OverlayColors(AnimationPtr animation):
m_animation(animation) {
}
OverlayColors::~OverlayColors() {
}
void OverlayColors::setColorOverlayImage(ImagePtr image) {
m_image = image;
}
ImagePtr OverlayColors::getColorOverlayImage() {
return m_image;
}
void OverlayColors::setColorOverlayAnimation(AnimationPtr animation) {
m_animation = animation;
}
AnimationPtr OverlayColors::getColorOverlayAnimation() {
return m_animation;
}
void OverlayColors::changeColor(const Color& source, const Color& target) {
std::pair<std::map<Color, Color>::iterator, bool> inserter = m_colorMap.insert(std::make_pair(source, target));
if (!inserter.second) {
Color& c = inserter.first->second;
c.set(target.getR(), target.getG(), target.getB(), target.getAlpha());
}
}
const std::map<Color, Color>& OverlayColors::getColors() {
return m_colorMap;
}
void OverlayColors::resetColors() {
m_colorMap.clear();
}
Visual2DGfx::Visual2DGfx() {
}
Visual2DGfx::~Visual2DGfx() {
}
ObjectVisual::ObjectVisual() {
}
ObjectVisual* ObjectVisual::create(Object* object) {
if (object->getVisual<ObjectVisual>()) {
throw Duplicate("Object already contains visualization");
}
ObjectVisual* v = new ObjectVisual();
object->adoptVisual(v);
return v;
}
ObjectVisual::~ObjectVisual() {
}
void ObjectVisual::addStaticImage(uint32_t angle, int32_t image_index) {
m_angle2img[angle % 360] = image_index;
}
int32_t ObjectVisual::getStaticImageIndexByAngle(int32_t angle) {
int32_t closestMatch = 0;
return getIndexByAngle(angle, m_angle2img, closestMatch);
}
void ObjectVisual::addStaticColorOverlay(uint32_t angle, const OverlayColors& colors) {
OverlayColors t = colors;
m_map[angle % 360] = angle % 360;
std::pair<AngleColorOverlayMap::iterator, bool> inserter = m_colorOverlayMap.insert(std::make_pair(angle % 360, colors));
if (!inserter.second) {
OverlayColors tmp = colors;
OverlayColors& c = inserter.first->second;
c.setColorOverlayImage(tmp.getColorOverlayImage());
const std::map<Color, Color>& colorMap = tmp.getColors();
std::map<Color, Color>::const_iterator it = colorMap.begin();
for (; it != colorMap.end(); ++it) {
c.changeColor(it->first, it->second);
}
}
}
OverlayColors* ObjectVisual::getStaticColorOverlay(int32_t angle) {
if (m_colorOverlayMap.empty()) {
return 0;
}
int32_t closestMatch = 0;
return &m_colorOverlayMap[getIndexByAngle(angle, m_map, closestMatch)];
}
void ObjectVisual::removeStaticColorOverlay(int32_t angle) {
if (m_colorOverlayMap.empty()) {
return;
}
int32_t closestMatch = 0;
int32_t index = getIndexByAngle(angle, m_map, closestMatch);
m_colorOverlayMap.erase(index);
m_map.erase(index);
}
int32_t ObjectVisual::getClosestMatchingAngle(int32_t angle) {
int32_t closestMatch = 0;
getIndexByAngle(angle, m_angle2img, closestMatch);
return closestMatch;
}
void ObjectVisual::getStaticImageAngles(std::vector<int32_t>& angles) {
angles.clear();
type_angle2id::const_iterator i(m_angle2img.begin());
while (i != m_angle2img.end()) {
angles.push_back(i->first);
++i;
}
}
InstanceVisual::InstanceVisual():
m_transparency(0),
m_visible(true),
m_stackposition(0),
m_instance(NULL) {
}
InstanceVisual* InstanceVisual::create(Instance* instance) {
if (instance->getVisual<InstanceVisual>()) {
throw Duplicate("Instance already contains visualization");
}
InstanceVisual* v = new InstanceVisual();
instance->setVisual(v);
v->m_instance = instance;
return v;
}
InstanceVisual::~InstanceVisual() {
}
void InstanceVisual::setTransparency(uint8_t transparency) {
if (m_transparency != transparency) {
m_transparency = transparency;
m_instance->callOnTransparencyChange();
}
}
uint8_t InstanceVisual::getTransparency() {
return m_transparency;
}
void InstanceVisual::setVisible(bool visible) {
if (m_visible != visible) {
m_visible = visible;
m_instance->callOnVisibleChange();
}
}
bool InstanceVisual::isVisible() {
return m_visible;
}
void InstanceVisual::setStackPosition(int32_t stackposition) {
if (m_stackposition != stackposition) {
m_stackposition = stackposition;
m_instance->callOnStackPositionChange();
}
}
int32_t InstanceVisual::getStackPosition() {
return m_stackposition;
}
ActionVisual::ActionVisual(): m_animation_map(), m_map() {
}
ActionVisual* ActionVisual::create(Action* action) {
if (action->getVisual<ActionVisual>()) {
throw Duplicate("Action already contains visualization");
}
ActionVisual* v = new ActionVisual();
action->adoptVisual(v);
return v;
}
ActionVisual::~ActionVisual() {
}
void ActionVisual::addAnimation(uint32_t angle, AnimationPtr animationptr) {
m_animation_map[angle % 360] = animationptr;
m_map[angle % 360] = angle % 360;
}
AnimationPtr ActionVisual::getAnimationByAngle(int32_t angle) {
int32_t closestMatch = 0;
return m_animation_map[getIndexByAngle(angle, m_map, closestMatch)];
}
void ActionVisual::addAnimationOverlay(uint32_t angle, int32_t order, AnimationPtr animationptr) {
std::map<int32_t, AnimationPtr>& orderMap = m_animationOverlayMap[angle % 360];
m_map[angle % 360] = angle % 360;
orderMap.insert(std::pair<int32_t, AnimationPtr>(order, animationptr));
}
std::map<int32_t, AnimationPtr> ActionVisual::getAnimationOverlay(int32_t angle) {
int32_t closestMatch = 0;
return m_animationOverlayMap[getIndexByAngle(angle, m_map, closestMatch)];
}
void ActionVisual::removeAnimationOverlay(uint32_t angle, int32_t order) {
if (m_animationOverlayMap.empty()) {
return;
}
int32_t closestMatch = 0;
AngleAnimationOverlayMap::iterator it = m_animationOverlayMap.find(getIndexByAngle(angle, m_map, closestMatch));
if (it != m_animationOverlayMap.end()) {
it->second.erase(order);
if (it->second.empty()) {
m_animationOverlayMap.erase(it);
}
}
}
void ActionVisual::addColorOverlay(uint32_t angle, const OverlayColors& colors) {
m_map[angle % 360] = angle % 360;
std::pair<AngleColorOverlayMap::iterator, bool> inserter = m_colorOverlayMap.insert(std::make_pair(angle % 360, colors));
if (!inserter.second) {
OverlayColors tmp = colors;
OverlayColors& c = inserter.first->second;
c.setColorOverlayAnimation(tmp.getColorOverlayAnimation());
const std::map<Color, Color>& colorMap = tmp.getColors();
std::map<Color, Color>::const_iterator it = colorMap.begin();
for (; it != colorMap.end(); ++it) {
c.changeColor(it->first, it->second);
}
}
}
OverlayColors* ActionVisual::getColorOverlay(int32_t angle) {
if (m_colorOverlayMap.empty()) {
return 0;
}
int32_t closestMatch = 0;
int32_t index = getIndexByAngle(angle, m_map, closestMatch);
if (m_colorOverlayMap.find(index) == m_colorOverlayMap.end()) {
return 0;
}
return &m_colorOverlayMap[getIndexByAngle(angle, m_map, closestMatch)];
}
void ActionVisual::removeColorOverlay(int32_t angle) {
if (m_colorOverlayMap.empty()) {
return;
}
int32_t closestMatch = 0;
int32_t index = getIndexByAngle(angle, m_map, closestMatch);
m_colorOverlayMap.erase(index);
}
void ActionVisual::addColorOverlay(uint32_t angle, int32_t order, const OverlayColors& colors) {
std::map<int32_t, OverlayColors>& orderMap = m_colorAnimationOverlayMap[angle % 360];
m_map[angle % 360] = angle % 360;
std::pair<std::map<int32_t, OverlayColors>::iterator, bool> inserter = orderMap.insert(std::make_pair(order, colors));
if (!inserter.second) {
OverlayColors tmp = colors;
OverlayColors& c = inserter.first->second;
c.setColorOverlayAnimation(tmp.getColorOverlayAnimation());
const std::map<Color, Color>& colorMap = tmp.getColors();
std::map<Color, Color>::const_iterator it = colorMap.begin();
for (; it != colorMap.end(); ++it) {
c.changeColor(it->first, it->second);
}
}
}
OverlayColors* ActionVisual::getColorOverlay(int32_t angle, int32_t order) {
if (m_colorAnimationOverlayMap.empty()) {
return 0;
}
int32_t closestMatch = 0;
AngleColorAnimationOverlayMap::iterator it = m_colorAnimationOverlayMap.find(getIndexByAngle(angle, m_map, closestMatch));
if (it != m_colorAnimationOverlayMap.end()) {
std::map<int32_t, OverlayColors>::iterator sit = it->second.find(order);
if (sit != it->second.end()) {
return &it->second[order];
}
}
return 0;
}
void ActionVisual::removeColorOverlay(int32_t angle, int32_t order) {
if (m_colorAnimationOverlayMap.empty()) {
return;
}
int32_t closestMatch = 0;
AngleColorAnimationOverlayMap::iterator it = m_colorAnimationOverlayMap.find(getIndexByAngle(angle, m_map, closestMatch));
if (it != m_colorAnimationOverlayMap.end()) {
it->second.erase(order);
if (it->second.empty()) {
m_colorAnimationOverlayMap.erase(it);
}
}
}
void ActionVisual::getActionImageAngles(std::vector<int32_t>& angles) {
angles.clear();
type_angle2id::const_iterator i(m_map.begin());
while (i != m_map.end()) {
angles.push_back(i->first);
++i;
}
}
void ActionVisual::convertToOverlays(bool color) {
bool colorOverlay = color && !m_colorOverlayMap.empty();
type_angle2id::const_iterator it = m_map.begin();
for (; it != m_map.end(); ++it) {
addAnimationOverlay(it->first, 0, getAnimationByAngle(it->first));
if (colorOverlay) {
OverlayColors* oldC = getColorOverlay(it->first);
if (oldC) {
OverlayColors c = OverlayColors(*oldC);
addColorOverlay(it->first, 0, c);
}
}
}
}
}
|