2019-11-23 20:27:39 +08:00
|
|
|
/****************************************************************************
|
|
|
|
Copyright (c) 2008-2010 Ricardo Quesada
|
|
|
|
Copyright (c) 2009 Valentin Milea
|
|
|
|
Copyright (c) 2010-2012 cocos2d-x.org
|
|
|
|
Copyright (c) 2011 Zynga Inc.
|
|
|
|
Copyright (c) 2013-2016 Chukong Technologies Inc.
|
|
|
|
Copyright (c) 2017-2018 Xiamen Yaji Software Co., Ltd.
|
2021-07-15 17:32:50 +08:00
|
|
|
Copyright (c) 2021 Bytedance Inc.
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2022-10-01 16:24:52 +08:00
|
|
|
https://axmolengine.github.io/
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
|
|
in the Software without restriction, including without limitation the rights
|
|
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
|
|
all copies or substantial portions of the Software.
|
|
|
|
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
THE SOFTWARE.
|
|
|
|
****************************************************************************/
|
|
|
|
|
2023-06-11 13:08:08 +08:00
|
|
|
#include "2d/Node.h"
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
#include <string>
|
|
|
|
#include <regex>
|
|
|
|
|
2021-11-09 12:15:28 +08:00
|
|
|
#include "xxhash.h"
|
2023-06-11 13:08:08 +08:00
|
|
|
#include "base/Director.h"
|
|
|
|
#include "base/Scheduler.h"
|
|
|
|
#include "base/EventDispatcher.h"
|
|
|
|
#include "base/UTF8.h"
|
|
|
|
#include "2d/Camera.h"
|
|
|
|
#include "2d/ActionManager.h"
|
|
|
|
#include "2d/Scene.h"
|
|
|
|
#include "2d/Component.h"
|
|
|
|
#include "renderer/Material.h"
|
2019-11-23 20:27:39 +08:00
|
|
|
#include "math/TransformUtils.h"
|
|
|
|
#include "renderer/backend/ProgramStateRegistry.h"
|
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_NODE_RENDER_SUBPIXEL
|
2021-12-25 10:04:45 +08:00
|
|
|
# define RENDER_IN_SUBPIXEL
|
2019-11-23 20:27:39 +08:00
|
|
|
#else
|
2021-12-25 10:04:45 +08:00
|
|
|
# define RENDER_IN_SUBPIXEL(__ARGS__) (ceil(__ARGS__))
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
|
|
|
|
2021-11-09 12:15:28 +08:00
|
|
|
/*
|
2021-12-25 10:04:45 +08:00
|
|
|
* 4.5x faster than std::hash in release mode
|
|
|
|
*/
|
2022-07-16 10:43:05 +08:00
|
|
|
#define AX_HASH_NODE_NAME(name) (!name.empty() ? XXH3_64bits(name.data(), name.length()) : 0)
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2022-07-11 17:50:21 +08:00
|
|
|
NS_AX_BEGIN
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
// FIXME:: Yes, nodes might have a sort problem once every 30 days if the game runs at 60 FPS and each frame sprites are
|
|
|
|
// reordered.
|
2019-11-23 20:27:39 +08:00
|
|
|
std::uint32_t Node::s_globalOrderOfArrival = 0;
|
2021-12-25 10:04:45 +08:00
|
|
|
int Node::__attachedNodeCount = 0;
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
// MARK: Constructor, Destructor, Init
|
|
|
|
|
|
|
|
Node::Node()
|
2021-12-25 10:04:45 +08:00
|
|
|
: _rotationX(0.0f)
|
|
|
|
, _rotationY(0.0f)
|
|
|
|
, _rotationZ_X(0.0f)
|
|
|
|
, _rotationZ_Y(0.0f)
|
|
|
|
, _scaleX(1.0f)
|
|
|
|
, _scaleY(1.0f)
|
|
|
|
, _scaleZ(1.0f)
|
|
|
|
, _positionZ(0.0f)
|
|
|
|
, _usingNormalizedPosition(false)
|
|
|
|
, _normalizedPositionDirty(false)
|
|
|
|
, _skewX(0.0f)
|
|
|
|
, _skewY(0.0f)
|
|
|
|
, _anchorPoint(0, 0)
|
|
|
|
, _contentSize(Vec2::ZERO)
|
|
|
|
, _contentSizeDirty(true)
|
|
|
|
, _transformDirty(true)
|
|
|
|
, _inverseDirty(true)
|
|
|
|
, _additionalTransform(nullptr)
|
|
|
|
, _additionalTransformDirty(false)
|
|
|
|
, _transformUpdated(true)
|
|
|
|
// children (lazy allocs)
|
|
|
|
, _childrenIndexer(nullptr)
|
|
|
|
// lazy alloc
|
|
|
|
, _localZOrder$Arrival(0LL)
|
|
|
|
, _globalZOrder(0)
|
|
|
|
, _parent(nullptr)
|
|
|
|
// "whole screen" objects. like Scenes and Layers, should set _ignoreAnchorPointForPosition to true
|
|
|
|
, _tag(Node::INVALID_TAG)
|
|
|
|
, _name()
|
|
|
|
, _hashOfName(0)
|
|
|
|
// userData is always inited as nil
|
|
|
|
, _userData(nullptr)
|
|
|
|
, _userObject(nullptr)
|
|
|
|
, _running(false)
|
|
|
|
, _visible(true)
|
|
|
|
, _ignoreAnchorPointForPosition(false)
|
|
|
|
, _reorderChildDirty(false)
|
|
|
|
, _isTransitionFinished(false)
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2021-12-25 10:04:45 +08:00
|
|
|
, _scriptHandler(0)
|
|
|
|
, _updateScriptHandler(0)
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
2021-12-25 10:04:45 +08:00
|
|
|
, _componentContainer(nullptr)
|
|
|
|
, _displayedOpacity(255)
|
|
|
|
, _realOpacity(255)
|
|
|
|
, _displayedColor(Color3B::WHITE)
|
|
|
|
, _realColor(Color3B::WHITE)
|
|
|
|
, _cascadeColorEnabled(false)
|
|
|
|
, _cascadeOpacityEnabled(false)
|
2022-04-25 09:37:41 +08:00
|
|
|
, _childFollowCameraMask(false)
|
2021-12-25 10:04:45 +08:00
|
|
|
, _cameraMask(1)
|
|
|
|
, _onEnterCallback(nullptr)
|
|
|
|
, _onExitCallback(nullptr)
|
|
|
|
, _onEnterTransitionDidFinishCallback(nullptr)
|
|
|
|
, _onExitTransitionDidStartCallback(nullptr)
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_USE_PHYSICS
|
2021-12-25 10:04:45 +08:00
|
|
|
, _physicsBody(nullptr)
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
|
|
|
{
|
|
|
|
// set default scheduler and actionManager
|
2021-12-25 10:04:45 +08:00
|
|
|
_director = Director::getInstance();
|
2019-11-23 20:27:39 +08:00
|
|
|
_actionManager = _director->getActionManager();
|
|
|
|
_actionManager->retain();
|
|
|
|
_scheduler = _director->getScheduler();
|
|
|
|
_scheduler->retain();
|
|
|
|
_eventDispatcher = _director->getEventDispatcher();
|
|
|
|
_eventDispatcher->retain();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_transform = _inverse = Mat4::IDENTITY;
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
Node* Node::create()
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
Node* ret = new Node();
|
2021-12-08 00:11:53 +08:00
|
|
|
if (ret->init())
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
ret->autorelease();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_DELETE(ret);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
Node::~Node()
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXLOGINFO("deallocing Node: %p - tag: %i", this, _tag);
|
2021-11-09 12:15:28 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_DELETE(_childrenIndexer);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_updateScriptHandler)
|
|
|
|
{
|
|
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->removeScriptHandler(_updateScriptHandler);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// User object has to be released before others, since userObject may have a weak reference of this node
|
2021-12-25 10:04:45 +08:00
|
|
|
// It may invoke `node->stopAllActions();` while `_actionManager` is null if the next line is after
|
2022-07-16 10:43:05 +08:00
|
|
|
// `AX_SAFE_RELEASE_NULL(_actionManager)`.
|
|
|
|
AX_SAFE_RELEASE_NULL(_userObject);
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2022-07-21 19:19:08 +08:00
|
|
|
for (auto&& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->_parent = nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
removeAllComponents();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_DELETE(_componentContainer);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
stopAllActions();
|
|
|
|
unscheduleAllCallbacks();
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RELEASE_NULL(_actionManager);
|
|
|
|
AX_SAFE_RELEASE_NULL(_scheduler);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_eventDispatcher->removeEventListenersForTarget(this);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-08-08 18:02:17 +08:00
|
|
|
#if AX_NODE_DEBUG_VERIFY_EVENT_LISTENERS && _AX_DEBUG > 0
|
2019-11-23 20:27:39 +08:00
|
|
|
_eventDispatcher->debugCheckNodeHasNoEventListenersOnDestruction(this);
|
|
|
|
#endif
|
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(!_running,
|
2021-12-25 10:04:45 +08:00
|
|
|
"Node still marked as running on node destruction! Was base class onExit() called in derived class "
|
|
|
|
"onExit() implementations?");
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RELEASE(_eventDispatcher);
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
delete[] _additionalTransform;
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RELEASE(_programState);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
bool Node::init()
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-06-30 20:13:30 +08:00
|
|
|
bool Node::initLayer() {
|
|
|
|
_ignoreAnchorPointForPosition = true;
|
|
|
|
setAnchorPoint(Vec2(0.5f, 0.5f));
|
|
|
|
setContentSize(_director->getWinSize());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
void Node::cleanup()
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2020-02-24 23:08:47 +08:00
|
|
|
ScriptEngineManager::sendNodeEventToLua(this, kNodeOnCleanup);
|
2022-07-16 10:43:05 +08:00
|
|
|
#endif // #if AX_ENABLE_SCRIPT_BINDING
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// actions
|
|
|
|
this->stopAllActions();
|
|
|
|
// timers
|
|
|
|
this->unscheduleAllCallbacks();
|
|
|
|
|
|
|
|
// NOTE: Although it was correct that removing event listeners associated with current node in Node::cleanup.
|
|
|
|
// But it broke the compatibility to the versions before v3.16 .
|
2021-12-25 10:04:45 +08:00
|
|
|
// User code may call `node->removeFromParent(true)` which will trigger node's cleanup method, when the node
|
|
|
|
// is added to scene again, event listeners like EventListenerTouchOneByOne will be lost.
|
2019-11-23 20:27:39 +08:00
|
|
|
// In fact, user's code should use `node->removeFromParent(false)` in order not to do a cleanup and just remove node
|
2021-12-25 10:04:45 +08:00
|
|
|
// from its parent. For more discussion about why we revert this change is at
|
|
|
|
// https://github.com/cocos2d/cocos2d-x/issues/18104. We need to consider more before we want to correct the old and
|
|
|
|
// wrong logic code. For now, compatiblity is the most important for our users.
|
|
|
|
// _eventDispatcher->removeEventListenersForTarget(this);
|
|
|
|
|
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
child->cleanup();
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string Node::getDescription() const
|
|
|
|
{
|
|
|
|
return StringUtils::format("<Node | Tag = %d", _tag);
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: getters / setters
|
|
|
|
|
|
|
|
float Node::getSkewX() const
|
|
|
|
{
|
|
|
|
return _skewX;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setSkewX(float skewX)
|
|
|
|
{
|
|
|
|
if (_skewX == skewX)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_skewX = skewX;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
float Node::getSkewY() const
|
|
|
|
{
|
|
|
|
return _skewY;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setSkewY(float skewY)
|
|
|
|
{
|
|
|
|
if (_skewY == skewY)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_skewY = skewY;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setLocalZOrder(std::int32_t z)
|
|
|
|
{
|
|
|
|
if (getLocalZOrder() == z)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_setLocalZOrder(z);
|
|
|
|
if (_parent)
|
|
|
|
{
|
|
|
|
_parent->reorderChild(this, z);
|
|
|
|
}
|
|
|
|
|
|
|
|
_eventDispatcher->setDirtyForNode(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// zOrder setter : private method
|
|
|
|
/// used internally to alter the zOrder variable. DON'T call this method manually
|
|
|
|
void Node::_setLocalZOrder(std::int32_t z)
|
|
|
|
{
|
|
|
|
_localZOrder = z;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateOrderOfArrival()
|
|
|
|
{
|
|
|
|
_orderOfArrival = (++s_globalOrderOfArrival);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setGlobalZOrder(float globalZOrder)
|
|
|
|
{
|
|
|
|
if (_globalZOrder != globalZOrder)
|
|
|
|
{
|
|
|
|
_globalZOrder = globalZOrder;
|
|
|
|
_eventDispatcher->setDirtyForNode(this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// rotation getter
|
|
|
|
float Node::getRotation() const
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(_rotationZ_X == _rotationZ_Y, "CCNode#rotation. RotationX != RotationY. Don't know which one to return");
|
2019-11-23 20:27:39 +08:00
|
|
|
return _rotationZ_X;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// rotation setter
|
|
|
|
void Node::setRotation(float rotation)
|
|
|
|
{
|
|
|
|
if (_rotationZ_X == rotation)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_rotationZ_X = _rotationZ_Y = rotation;
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateRotationQuat();
|
|
|
|
}
|
|
|
|
|
|
|
|
float Node::getRotationSkewX() const
|
|
|
|
{
|
|
|
|
return _rotationZ_X;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setRotation3D(const Vec3& rotation)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (_rotationX == rotation.x && _rotationY == rotation.y && _rotationZ_X == rotation.z)
|
2019-11-23 20:27:39 +08:00
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
|
|
|
|
_rotationX = rotation.x;
|
|
|
|
_rotationY = rotation.y;
|
|
|
|
|
|
|
|
// rotation Z is decomposed in 2 to simulate Skew for Flash animations
|
|
|
|
_rotationZ_Y = _rotationZ_X = rotation.z;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateRotationQuat();
|
|
|
|
}
|
|
|
|
|
|
|
|
Vec3 Node::getRotation3D() const
|
|
|
|
{
|
|
|
|
// rotation Z is decomposed in 2 to simulate Skew for Flash animations
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(_rotationZ_X == _rotationZ_Y, "_rotationZ_X != _rotationZ_Y");
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
return Vec3(_rotationX, _rotationY, _rotationZ_X);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateRotationQuat()
|
|
|
|
{
|
|
|
|
// convert Euler angle to quaternion
|
|
|
|
// when _rotationZ_X == _rotationZ_Y, _rotationQuat = RotationZ_X * RotationY * RotationX
|
|
|
|
// when _rotationZ_X != _rotationZ_Y, _rotationQuat = RotationY * RotationX
|
2022-07-16 10:43:05 +08:00
|
|
|
float halfRadx = AX_DEGREES_TO_RADIANS(_rotationX / 2.f), halfRady = AX_DEGREES_TO_RADIANS(_rotationY / 2.f),
|
|
|
|
halfRadz = _rotationZ_X == _rotationZ_Y ? -AX_DEGREES_TO_RADIANS(_rotationZ_X / 2.f) : 0;
|
2021-12-25 10:04:45 +08:00
|
|
|
float coshalfRadx = cosf(halfRadx), sinhalfRadx = sinf(halfRadx), coshalfRady = cosf(halfRady),
|
|
|
|
sinhalfRady = sinf(halfRady), coshalfRadz = cosf(halfRadz), sinhalfRadz = sinf(halfRadz);
|
2019-11-23 20:27:39 +08:00
|
|
|
_rotationQuat.x = sinhalfRadx * coshalfRady * coshalfRadz - coshalfRadx * sinhalfRady * sinhalfRadz;
|
|
|
|
_rotationQuat.y = coshalfRadx * sinhalfRady * coshalfRadz + sinhalfRadx * coshalfRady * sinhalfRadz;
|
|
|
|
_rotationQuat.z = coshalfRadx * coshalfRady * sinhalfRadz - sinhalfRadx * sinhalfRady * coshalfRadz;
|
|
|
|
_rotationQuat.w = coshalfRadx * coshalfRady * coshalfRadz + sinhalfRadx * sinhalfRady * sinhalfRadz;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateRotation3D()
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
// convert quaternion to Euler angle
|
2019-11-23 20:27:39 +08:00
|
|
|
float x = _rotationQuat.x, y = _rotationQuat.y, z = _rotationQuat.z, w = _rotationQuat.w;
|
2021-12-25 10:04:45 +08:00
|
|
|
_rotationX = atan2f(2.f * (w * x + y * z), 1.f - 2.f * (x * x + y * y));
|
|
|
|
float sy = 2.f * (w * y - z * x);
|
|
|
|
sy = clampf(sy, -1, 1);
|
|
|
|
_rotationY = asinf(sy);
|
2019-11-23 20:27:39 +08:00
|
|
|
_rotationZ_X = atan2f(2.f * (w * z + x * y), 1.f - 2.f * (y * y + z * z));
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
_rotationX = AX_RADIANS_TO_DEGREES(_rotationX);
|
|
|
|
_rotationY = AX_RADIANS_TO_DEGREES(_rotationY);
|
|
|
|
_rotationZ_X = _rotationZ_Y = -AX_RADIANS_TO_DEGREES(_rotationZ_X);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setRotationQuat(const Quaternion& quat)
|
|
|
|
{
|
|
|
|
_rotationQuat = quat;
|
|
|
|
updateRotation3D();
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
Quaternion Node::getRotationQuat() const
|
|
|
|
{
|
|
|
|
return _rotationQuat;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setRotationSkewX(float rotationX)
|
|
|
|
{
|
|
|
|
if (_rotationZ_X == rotationX)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_rotationZ_X = rotationX;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateRotationQuat();
|
|
|
|
}
|
|
|
|
|
|
|
|
float Node::getRotationSkewY() const
|
|
|
|
{
|
|
|
|
return _rotationZ_Y;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setRotationSkewY(float rotationY)
|
|
|
|
{
|
|
|
|
if (_rotationZ_Y == rotationY)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_rotationZ_Y = rotationY;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateRotationQuat();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scale getter
|
|
|
|
float Node::getScale() const
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(_scaleX == _scaleY, "CCNode#scale. ScaleX != ScaleY. Don't know which one to return");
|
2019-11-23 20:27:39 +08:00
|
|
|
return _scaleX;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scale setter
|
|
|
|
void Node::setScale(float scale)
|
|
|
|
{
|
|
|
|
if (_scaleX == scale && _scaleY == scale && _scaleZ == scale)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_scaleX = _scaleY = _scaleZ = scale;
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scaleX getter
|
|
|
|
float Node::getScaleX() const
|
|
|
|
{
|
|
|
|
return _scaleX;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scale setter
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::setScale(float scaleX, float scaleY)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
if (_scaleX == scaleX && _scaleY == scaleY)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_scaleX = scaleX;
|
|
|
|
_scaleY = scaleY;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scaleX setter
|
|
|
|
void Node::setScaleX(float scaleX)
|
|
|
|
{
|
|
|
|
if (_scaleX == scaleX)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_scaleX = scaleX;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scaleY getter
|
|
|
|
float Node::getScaleY() const
|
|
|
|
{
|
|
|
|
return _scaleY;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scaleY setter
|
|
|
|
void Node::setScaleZ(float scaleZ)
|
|
|
|
{
|
|
|
|
if (_scaleZ == scaleZ)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_scaleZ = scaleZ;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scaleY getter
|
|
|
|
float Node::getScaleZ() const
|
|
|
|
{
|
|
|
|
return _scaleZ;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// scaleY setter
|
|
|
|
void Node::setScaleY(float scaleY)
|
|
|
|
{
|
|
|
|
if (_scaleY == scaleY)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
_scaleY = scaleY;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// position getter
|
|
|
|
const Vec2& Node::getPosition() const
|
|
|
|
{
|
|
|
|
return _position;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// position setter
|
|
|
|
void Node::setPosition(const Vec2& position)
|
|
|
|
{
|
2022-06-16 08:55:46 +08:00
|
|
|
setPosition(position.x, position.y);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::getPosition(float* x, float* y) const
|
|
|
|
{
|
|
|
|
*x = _position.x;
|
|
|
|
*y = _position.y;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setPosition(float x, float y)
|
|
|
|
{
|
|
|
|
if (_position.x == x && _position.y == y)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_position.x = x;
|
|
|
|
_position.y = y;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
_usingNormalizedPosition = false;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setPosition3D(const Vec3& position)
|
|
|
|
{
|
2022-06-16 08:55:46 +08:00
|
|
|
setPositionZ(position.z);
|
|
|
|
setPosition(position.x, position.y);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
Vec3 Node::getPosition3D() const
|
|
|
|
{
|
|
|
|
return Vec3(_position.x, _position.y, _positionZ);
|
|
|
|
}
|
|
|
|
|
|
|
|
float Node::getPositionX() const
|
|
|
|
{
|
|
|
|
return _position.x;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setPositionX(float x)
|
|
|
|
{
|
2022-06-16 08:55:46 +08:00
|
|
|
setPosition(x, _position.y);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
float Node::getPositionY() const
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
return _position.y;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setPositionY(float y)
|
|
|
|
{
|
2022-06-16 08:55:46 +08:00
|
|
|
setPosition(_position.x, y);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
float Node::getPositionZ() const
|
|
|
|
{
|
|
|
|
return _positionZ;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setPositionZ(float positionZ)
|
|
|
|
{
|
|
|
|
if (_positionZ == positionZ)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
|
|
|
|
_positionZ = positionZ;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// position getter
|
|
|
|
const Vec2& Node::getPositionNormalized() const
|
|
|
|
{
|
|
|
|
return _normalizedPosition;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// position setter
|
|
|
|
void Node::setPositionNormalized(const Vec2& position)
|
|
|
|
{
|
|
|
|
if (_normalizedPosition.equals(position))
|
|
|
|
return;
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
_normalizedPosition = position;
|
2019-11-23 20:27:39 +08:00
|
|
|
_usingNormalizedPosition = true;
|
|
|
|
_normalizedPositionDirty = true;
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t Node::getChildrenCount() const
|
|
|
|
{
|
|
|
|
return _children.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isVisible getter
|
|
|
|
bool Node::isVisible() const
|
|
|
|
{
|
|
|
|
return _visible;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isVisible setter
|
|
|
|
void Node::setVisible(bool visible)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (visible != _visible)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_visible = visible;
|
2021-12-25 10:04:45 +08:00
|
|
|
if (_visible)
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const Vec2& Node::getAnchorPointInPoints() const
|
|
|
|
{
|
|
|
|
return _anchorPointInPoints;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// anchorPoint getter
|
|
|
|
const Vec2& Node::getAnchorPoint() const
|
|
|
|
{
|
|
|
|
return _anchorPoint;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setAnchorPoint(const Vec2& point)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (!point.equals(_anchorPoint))
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_anchorPoint = point;
|
|
|
|
_anchorPointInPoints.set(_contentSize.width * _anchorPoint.x, _contentSize.height * _anchorPoint.y);
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// contentSize getter
|
2021-10-23 23:27:14 +08:00
|
|
|
const Vec2& Node::getContentSize() const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
return _contentSize;
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::setContentSize(const Vec2& size)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (!size.equals(_contentSize))
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_contentSize = size;
|
|
|
|
|
|
|
|
_anchorPointInPoints.set(_contentSize.width * _anchorPoint.x, _contentSize.height * _anchorPoint.y);
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = _contentSizeDirty = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
bool Node::hitTest(const Vec2& worldPoint) const
|
|
|
|
{
|
|
|
|
auto p = this->convertToNodeSpace(worldPoint);
|
2021-07-15 17:01:57 +08:00
|
|
|
auto& s = this->getContentSize();
|
|
|
|
return Rect{0.f, 0.f, s.width, s.height}.containsPoint(p);
|
|
|
|
}
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// isRunning getter
|
|
|
|
bool Node::isRunning() const
|
|
|
|
{
|
|
|
|
return _running;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// parent setter
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::setParent(Node* parent)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
_parent = parent;
|
2022-11-03 15:49:34 +08:00
|
|
|
_normalizedPositionDirty = true;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isRelativeAnchorPoint getter
|
|
|
|
bool Node::isIgnoreAnchorPointForPosition() const
|
|
|
|
{
|
|
|
|
return _ignoreAnchorPointForPosition;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isRelativeAnchorPoint setter
|
|
|
|
void Node::setIgnoreAnchorPointForPosition(bool newValue)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (newValue != _ignoreAnchorPointForPosition)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_ignoreAnchorPointForPosition = newValue;
|
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// tag getter
|
|
|
|
int Node::getTag() const
|
|
|
|
{
|
|
|
|
return _tag;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// tag setter
|
|
|
|
void Node::setTag(int tag)
|
|
|
|
{
|
2021-11-18 19:02:33 +08:00
|
|
|
updateParentChildrenIndexer(tag);
|
2021-12-25 10:04:45 +08:00
|
|
|
_tag = tag;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
std::string_view Node::getName() const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
return _name;
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::setName(std::string_view name)
|
2021-11-18 19:02:33 +08:00
|
|
|
{
|
|
|
|
updateParentChildrenIndexer(name);
|
|
|
|
_name = name;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateParentChildrenIndexer(int tag)
|
|
|
|
{
|
|
|
|
auto parentChildrenIndexer = getParentChildrenIndexer();
|
|
|
|
if (parentChildrenIndexer)
|
|
|
|
{
|
|
|
|
if (_tag != tag)
|
|
|
|
parentChildrenIndexer->erase(_tag);
|
|
|
|
(*parentChildrenIndexer)[tag] = this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::updateParentChildrenIndexer(std::string_view name)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
uint64_t newHash = AX_HASH_NODE_NAME(name);
|
2021-11-09 12:15:28 +08:00
|
|
|
auto parentChildrenIndexer = getParentChildrenIndexer();
|
|
|
|
if (parentChildrenIndexer)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
auto oldHash = AX_HASH_NODE_NAME(_name);
|
2021-11-09 12:15:28 +08:00
|
|
|
if (oldHash != newHash)
|
|
|
|
parentChildrenIndexer->erase(oldHash);
|
|
|
|
(*parentChildrenIndexer)[newHash] = this;
|
|
|
|
}
|
|
|
|
|
|
|
|
_hashOfName = newHash;
|
|
|
|
}
|
|
|
|
|
|
|
|
NodeIndexerMap_t* Node::getParentChildrenIndexer()
|
|
|
|
{
|
|
|
|
if (!_director->isChildrenIndexerEnabled())
|
|
|
|
return nullptr;
|
|
|
|
auto parent = getParent();
|
|
|
|
if (parent)
|
|
|
|
{
|
|
|
|
auto& indexer = parent->_childrenIndexer;
|
|
|
|
if (!indexer)
|
|
|
|
indexer = new NodeIndexerMap_t();
|
|
|
|
return indexer;
|
|
|
|
}
|
|
|
|
return nullptr;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// userData setter
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::setUserData(void* userData)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_userData = userData;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setUserObject(Ref* userObject)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_GC_FOR_NATIVE_OBJECTS
|
2019-11-23 20:27:39 +08:00
|
|
|
auto sEngine = ScriptEngineManager::getInstance()->getScriptEngine();
|
|
|
|
if (sEngine)
|
|
|
|
{
|
|
|
|
if (userObject)
|
|
|
|
sEngine->retainScriptObject(this, userObject);
|
|
|
|
if (_userObject)
|
|
|
|
sEngine->releaseScriptObject(this, _userObject);
|
|
|
|
}
|
2022-07-16 10:43:05 +08:00
|
|
|
#endif // AX_ENABLE_GC_FOR_NATIVE_OBJECTS
|
|
|
|
AX_SAFE_RETAIN(userObject);
|
|
|
|
AX_SAFE_RELEASE(_userObject);
|
2019-11-23 20:27:39 +08:00
|
|
|
_userObject = userObject;
|
|
|
|
}
|
|
|
|
|
|
|
|
Scene* Node::getScene() const
|
|
|
|
{
|
|
|
|
if (!_parent)
|
|
|
|
return nullptr;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
auto sceneNode = _parent;
|
|
|
|
while (sceneNode->_parent)
|
|
|
|
{
|
|
|
|
sceneNode = sceneNode->_parent;
|
|
|
|
}
|
|
|
|
|
|
|
|
return dynamic_cast<Scene*>(sceneNode);
|
|
|
|
}
|
|
|
|
|
|
|
|
Rect Node::getBoundingBox() const
|
|
|
|
{
|
|
|
|
Rect rect(0, 0, _contentSize.width, _contentSize.height);
|
|
|
|
return RectApplyAffineTransform(rect, getNodeToParentAffineTransform());
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: Children logic
|
|
|
|
|
|
|
|
// lazy allocs
|
|
|
|
void Node::childrenAlloc()
|
|
|
|
{
|
|
|
|
_children.reserve(4);
|
|
|
|
}
|
|
|
|
|
|
|
|
Node* Node::getChildByTag(int tag) const
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(tag != Node::INVALID_TAG, "Invalid tag");
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2021-11-09 12:15:28 +08:00
|
|
|
if (_childrenIndexer)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-11-09 12:15:28 +08:00
|
|
|
auto it = _childrenIndexer->find(tag);
|
|
|
|
if (it != _childrenIndexer->end())
|
|
|
|
return it->second;
|
|
|
|
}
|
2021-11-18 19:47:15 +08:00
|
|
|
|
|
|
|
for (const auto child : _children)
|
2021-11-09 12:15:28 +08:00
|
|
|
{
|
2021-11-18 19:47:15 +08:00
|
|
|
if (child && child->_tag == tag)
|
|
|
|
return child;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
Node* Node::getChildByName(std::string_view name) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
// AXASSERT(!name.empty(), "Invalid name");
|
|
|
|
auto hash = AX_HASH_NODE_NAME(name);
|
2021-11-09 12:15:28 +08:00
|
|
|
if (_childrenIndexer)
|
2021-11-07 16:14:31 +08:00
|
|
|
{
|
2021-11-09 12:15:28 +08:00
|
|
|
auto it = _childrenIndexer->find(hash);
|
|
|
|
if (it != _childrenIndexer->end())
|
|
|
|
return it->second;
|
|
|
|
}
|
2021-11-18 19:47:15 +08:00
|
|
|
|
|
|
|
for (const auto& child : _children)
|
2021-11-09 12:15:28 +08:00
|
|
|
{
|
2021-11-18 19:47:15 +08:00
|
|
|
// Different strings may have the same hash code, but can use it to compare first for speed
|
|
|
|
if (child->_hashOfName == hash && child->_name.compare(name) == 0)
|
|
|
|
return child;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::enumerateChildren(std::string_view name, std::function<bool(Node*)> callback) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(!name.empty(), "Invalid name");
|
|
|
|
AXASSERT(callback != nullptr, "Invalid callback function");
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
size_t length = name.length();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
size_t subStrStartPos = 0; // sub string start index
|
|
|
|
size_t subStrlength = length; // sub string length
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// Starts with '//'?
|
|
|
|
bool searchRecursively = false;
|
|
|
|
if (length > 2 && name[0] == '/' && name[1] == '/')
|
|
|
|
{
|
|
|
|
searchRecursively = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
subStrStartPos = 2;
|
2019-11-23 20:27:39 +08:00
|
|
|
subStrlength -= 2;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// End with '/..'?
|
|
|
|
bool searchFromParent = false;
|
2021-12-25 10:04:45 +08:00
|
|
|
if (length > 3 && name[length - 3] == '/' && name[length - 2] == '.' && name[length - 1] == '.')
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
searchFromParent = true;
|
|
|
|
subStrlength -= 3;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// Remove '//', '/..' if exist
|
2021-12-31 12:12:40 +08:00
|
|
|
auto newName = name.substr(subStrStartPos, subStrlength);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
const Node* target = this;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (searchFromParent)
|
|
|
|
{
|
|
|
|
if (nullptr == _parent)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
target = _parent;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (searchRecursively)
|
|
|
|
{
|
|
|
|
// name is '//xxx'
|
|
|
|
target->doEnumerateRecursive(target, newName, callback);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// name is xxx
|
2021-12-31 12:12:40 +08:00
|
|
|
target->doEnumerate(std::string{newName}, callback);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
bool Node::doEnumerateRecursive(const Node* node, std::string_view name, std::function<bool(Node*)> callback) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
bool ret = false;
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
if (node->doEnumerate(std::string{name}, callback))
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
// search itself
|
|
|
|
ret = true;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// search its children
|
|
|
|
for (const auto& child : node->getChildren())
|
|
|
|
{
|
|
|
|
if (doEnumerateRecursive(child, name, callback))
|
|
|
|
{
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
bool Node::doEnumerate(std::string name, std::function<bool(Node*)> callback) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
// name may be xxx/yyy, should find its parent
|
2021-12-25 10:04:45 +08:00
|
|
|
size_t pos = name.find('/');
|
2019-11-23 20:27:39 +08:00
|
|
|
std::string searchName = name;
|
2021-12-25 10:04:45 +08:00
|
|
|
bool needRecursive = false;
|
2019-11-23 20:27:39 +08:00
|
|
|
if (pos != name.npos)
|
|
|
|
{
|
|
|
|
searchName = name.substr(0, pos);
|
2021-12-25 10:04:45 +08:00
|
|
|
name.erase(0, pos + 1);
|
2019-11-23 20:27:39 +08:00
|
|
|
needRecursive = true;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
bool ret = false;
|
|
|
|
for (const auto& child : getChildren())
|
|
|
|
{
|
|
|
|
if (std::regex_match(child->_name, std::regex(searchName)))
|
|
|
|
{
|
|
|
|
if (!needRecursive)
|
|
|
|
{
|
|
|
|
// terminate enumeration if callback return true
|
|
|
|
if (callback(child))
|
|
|
|
{
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ret = child->doEnumerate(name, callback);
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* "add" logic MUST only be on this method
|
2021-12-25 10:04:45 +08:00
|
|
|
* If a class want's to extend the 'addChild' behavior it only needs
|
|
|
|
* to override this method
|
|
|
|
*/
|
|
|
|
void Node::addChild(Node* child, int localZOrder, int tag)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(child != nullptr, "Argument must be non-nil");
|
|
|
|
AXASSERT(child->_parent == nullptr, "child already added. It can't be added again");
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
addChildHelper(child, localZOrder, tag, "", true);
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::addChild(Node* child, int localZOrder, std::string_view name)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(child != nullptr, "Argument must be non-nil");
|
|
|
|
AXASSERT(child->_parent == nullptr, "child already added. It can't be added again");
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
addChildHelper(child, localZOrder, INVALID_TAG, name, false);
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::addChildHelper(Node* child, int localZOrder, int tag, std::string_view name, bool setTag)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
auto assertNotSelfChild([this, child]() -> bool {
|
|
|
|
for (Node* parent(getParent()); parent != nullptr; parent = parent->getParent())
|
|
|
|
if (parent == child)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
});
|
2019-11-23 20:27:39 +08:00
|
|
|
(void)assertNotSelfChild;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(assertNotSelfChild(), "A node cannot be the child of his own children");
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_children.empty())
|
|
|
|
{
|
|
|
|
this->childrenAlloc();
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
this->insertChild(child, localZOrder);
|
2021-11-09 12:15:28 +08:00
|
|
|
|
|
|
|
child->setParent(this);
|
2022-04-25 09:37:41 +08:00
|
|
|
|
|
|
|
if (_childFollowCameraMask)
|
2022-04-27 16:23:57 +08:00
|
|
|
{
|
2022-04-25 09:37:41 +08:00
|
|
|
child->setCameraMask(this->getCameraMask());
|
2022-04-27 16:23:57 +08:00
|
|
|
child->applyMaskOnEnter(true);
|
|
|
|
}
|
2022-04-25 09:37:41 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (setTag)
|
2021-11-18 19:02:33 +08:00
|
|
|
{
|
2019-11-23 20:27:39 +08:00
|
|
|
child->setTag(tag);
|
2021-11-18 19:02:33 +08:00
|
|
|
child->updateParentChildrenIndexer(child->getName());
|
|
|
|
}
|
2019-11-23 20:27:39 +08:00
|
|
|
else
|
2021-11-18 19:02:33 +08:00
|
|
|
{
|
2019-11-23 20:27:39 +08:00
|
|
|
child->setName(name);
|
2021-11-18 19:02:33 +08:00
|
|
|
child->updateParentChildrenIndexer(child->getTag());
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
child->updateOrderOfArrival();
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
if (_running)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->onEnter();
|
|
|
|
// prevent onEnterTransitionDidFinish to be called twice when a node is added in onEnter
|
|
|
|
if (_isTransitionFinished)
|
|
|
|
{
|
|
|
|
child->onEnterTransitionDidFinish();
|
|
|
|
}
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_cascadeColorEnabled)
|
|
|
|
{
|
|
|
|
updateCascadeColor();
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_cascadeOpacityEnabled)
|
|
|
|
{
|
|
|
|
updateCascadeOpacity();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::addChild(Node* child, int zOrder)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(child != nullptr, "Argument must be non-nil");
|
2019-11-23 20:27:39 +08:00
|
|
|
this->addChild(child, zOrder, child->_name);
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::addChild(Node* child)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(child != nullptr, "Argument must be non-nil");
|
2019-11-23 20:27:39 +08:00
|
|
|
this->addChild(child, child->getLocalZOrder(), child->_name);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::removeFromParent()
|
|
|
|
{
|
|
|
|
this->removeFromParentAndCleanup(true);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::removeFromParentAndCleanup(bool cleanup)
|
|
|
|
{
|
|
|
|
if (_parent != nullptr)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
_parent->removeChild(this, cleanup);
|
|
|
|
}
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* "remove" logic MUST only be on this method
|
2021-12-25 10:04:45 +08:00
|
|
|
* If a class want's to extend the 'removeChild' behavior it only needs
|
|
|
|
* to override this method
|
|
|
|
*/
|
2019-11-23 20:27:39 +08:00
|
|
|
void Node::removeChild(Node* child, bool cleanup /* = true */)
|
|
|
|
{
|
|
|
|
// explicit nil handling
|
|
|
|
if (_children.empty())
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t index = _children.getIndex(child);
|
2022-07-16 10:43:05 +08:00
|
|
|
if (index != AX_INVALID_INDEX)
|
2021-12-25 10:04:45 +08:00
|
|
|
this->detachChild(child, index, cleanup);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::removeChildByTag(int tag, bool cleanup /* = true */)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(tag != Node::INVALID_TAG, "Invalid tag");
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
Node* child = this->getChildByTag(tag);
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
if (child == nullptr)
|
|
|
|
{
|
2022-10-01 16:24:52 +08:00
|
|
|
AXLOG("axmol: removeChildByTag(tag = %d): child not found!", tag);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
this->removeChild(child, cleanup);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::removeChildByName(std::string_view name, bool cleanup)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(!name.empty(), "Invalid name");
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
Node* child = this->getChildByName(name);
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (child == nullptr)
|
|
|
|
{
|
2022-10-01 16:24:52 +08:00
|
|
|
AXLOG("axmol: removeChildByName(name = %s): child not found!", name.data());
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
this->removeChild(child, cleanup);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::removeAllChildren()
|
|
|
|
{
|
|
|
|
this->removeAllChildrenWithCleanup(true);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::removeAllChildrenWithCleanup(bool cleanup)
|
|
|
|
{
|
|
|
|
// not using detachChild improves speed here
|
|
|
|
for (const auto& child : _children)
|
|
|
|
{
|
2021-09-18 14:06:52 +08:00
|
|
|
resetChild(child, cleanup);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_children.clear();
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_DELETE(_childrenIndexer);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2021-09-18 14:06:52 +08:00
|
|
|
void Node::resetChild(Node* child, bool cleanup)
|
|
|
|
{ // IMPORTANT:
|
2019-11-23 20:27:39 +08:00
|
|
|
// -1st do onExit
|
|
|
|
// -2nd cleanup
|
|
|
|
if (_running)
|
|
|
|
{
|
|
|
|
child->onExitTransitionDidStart();
|
|
|
|
child->onExit();
|
|
|
|
}
|
|
|
|
|
|
|
|
// If you don't do cleanup, the child's actions will not get removed and the
|
|
|
|
// its scheduledSelectors_ dict will not get released!
|
2021-09-18 14:06:52 +08:00
|
|
|
if (cleanup)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->cleanup();
|
|
|
|
}
|
2021-09-18 14:06:52 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_GC_FOR_NATIVE_OBJECTS
|
2019-11-23 20:27:39 +08:00
|
|
|
auto sEngine = ScriptEngineManager::getInstance()->getScriptEngine();
|
|
|
|
if (sEngine)
|
|
|
|
{
|
|
|
|
sEngine->releaseScriptObject(this, child);
|
|
|
|
}
|
2022-07-16 10:43:05 +08:00
|
|
|
#endif // AX_ENABLE_GC_FOR_NATIVE_OBJECTS
|
2019-11-23 20:27:39 +08:00
|
|
|
// set parent nil at the end
|
|
|
|
child->setParent(nullptr);
|
2021-09-18 14:06:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::detachChild(Node* child, ssize_t childIndex, bool cleanup)
|
|
|
|
{
|
2021-11-25 16:27:43 +08:00
|
|
|
if (_childrenIndexer)
|
|
|
|
{
|
|
|
|
_childrenIndexer->erase(child->_tag);
|
|
|
|
_childrenIndexer->erase(child->_hashOfName);
|
|
|
|
}
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2021-11-25 16:27:43 +08:00
|
|
|
resetChild(child, cleanup);
|
2019-11-23 20:27:39 +08:00
|
|
|
_children.erase(childIndex);
|
|
|
|
}
|
|
|
|
|
|
|
|
// helper used by reorderChild & add
|
|
|
|
void Node::insertChild(Node* child, int z)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_GC_FOR_NATIVE_OBJECTS
|
2019-11-23 20:27:39 +08:00
|
|
|
auto sEngine = ScriptEngineManager::getInstance()->getScriptEngine();
|
|
|
|
if (sEngine)
|
|
|
|
{
|
|
|
|
sEngine->retainScriptObject(this, child);
|
|
|
|
}
|
2022-07-16 10:43:05 +08:00
|
|
|
#endif // AX_ENABLE_GC_FOR_NATIVE_OBJECTS
|
2021-12-25 10:04:45 +08:00
|
|
|
_transformUpdated = true;
|
2019-11-23 20:27:39 +08:00
|
|
|
_reorderChildDirty = true;
|
|
|
|
_children.pushBack(child);
|
|
|
|
child->_setLocalZOrder(z);
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::reorderChild(Node* child, int zOrder)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(child != nullptr, "Child must be non-nil");
|
2019-11-23 20:27:39 +08:00
|
|
|
_reorderChildDirty = true;
|
|
|
|
child->updateOrderOfArrival();
|
|
|
|
child->_setLocalZOrder(zOrder);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::sortAllChildren()
|
|
|
|
{
|
|
|
|
if (_reorderChildDirty)
|
|
|
|
{
|
|
|
|
sortNodes(_children);
|
|
|
|
_reorderChildDirty = false;
|
|
|
|
_eventDispatcher->setDirtyForNode(this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: draw / visit
|
|
|
|
|
|
|
|
void Node::draw()
|
|
|
|
{
|
|
|
|
auto renderer = _director->getRenderer();
|
|
|
|
draw(renderer, _modelViewTransform, FLAGS_TRANSFORM_DIRTY);
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::draw(Renderer* /*renderer*/, const Mat4& /*transform*/, uint32_t /*flags*/) {}
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
void Node::visit()
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
auto renderer = _director->getRenderer();
|
2019-11-23 20:27:39 +08:00
|
|
|
auto& parentTransform = _director->getMatrix(MATRIX_STACK_TYPE::MATRIX_STACK_MODELVIEW);
|
|
|
|
visit(renderer, parentTransform, FLAGS_TRANSFORM_DIRTY);
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t Node::processParentFlags(const Mat4& parentTransform, uint32_t parentFlags)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (_usingNormalizedPosition)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(_parent, "setPositionNormalized() doesn't work with orphan nodes");
|
2019-11-23 20:27:39 +08:00
|
|
|
if ((parentFlags & FLAGS_CONTENT_SIZE_DIRTY) || _normalizedPositionDirty)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
auto& s = _parent->getContentSize();
|
|
|
|
_position.x = _normalizedPosition.x * s.width;
|
|
|
|
_position.y = _normalizedPosition.y * s.height;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = _transformDirty = _inverseDirty = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
_normalizedPositionDirty = false;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Fixes Github issue #16100. Basically when having two cameras, one camera might set as dirty the
|
|
|
|
// node that is not visited by it, and might affect certain calculations. Besides, it is faster to do this.
|
|
|
|
if (!isVisitableByVisitingCamera())
|
|
|
|
return parentFlags;
|
|
|
|
|
|
|
|
uint32_t flags = parentFlags;
|
|
|
|
flags |= (_transformUpdated ? FLAGS_TRANSFORM_DIRTY : 0);
|
|
|
|
flags |= (_contentSizeDirty ? FLAGS_CONTENT_SIZE_DIRTY : 0);
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
if (flags & FLAGS_DIRTY_MASK)
|
2019-11-23 20:27:39 +08:00
|
|
|
_modelViewTransform = this->transform(parentTransform);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = false;
|
|
|
|
_contentSizeDirty = false;
|
|
|
|
|
|
|
|
return flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Node::isVisitableByVisitingCamera() const
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
auto camera = Camera::getVisitingCamera();
|
2019-11-23 20:27:39 +08:00
|
|
|
bool visibleByCamera = camera ? ((unsigned short)camera->getCameraFlag() & _cameraMask) != 0 : true;
|
|
|
|
return visibleByCamera;
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::visit(Renderer* renderer, const Mat4& parentTransform, uint32_t parentFlags)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
// quick return if not visible. children won't be drawn.
|
|
|
|
if (!_visible)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t flags = processParentFlags(parentTransform, parentFlags);
|
|
|
|
|
|
|
|
// IMPORTANT:
|
|
|
|
// To ease the migration to v3.0, we still support the Mat4 stack,
|
|
|
|
// but it is deprecated and your code should not rely on it
|
|
|
|
_director->pushMatrix(MATRIX_STACK_TYPE::MATRIX_STACK_MODELVIEW);
|
|
|
|
_director->loadMatrix(MATRIX_STACK_TYPE::MATRIX_STACK_MODELVIEW, _modelViewTransform);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
bool visibleByCamera = isVisitableByVisitingCamera();
|
|
|
|
|
|
|
|
int i = 0;
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
if (!_children.empty())
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
sortAllChildren();
|
|
|
|
// draw children zOrder < 0
|
2021-12-25 10:04:45 +08:00
|
|
|
for (auto size = _children.size(); i < size; ++i)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
auto node = _children.at(i);
|
|
|
|
|
|
|
|
if (node && node->_localZOrder < 0)
|
|
|
|
node->visit(renderer, _modelViewTransform, flags);
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// self draw
|
|
|
|
if (visibleByCamera)
|
|
|
|
this->draw(renderer, _modelViewTransform, flags);
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
for (auto it = _children.cbegin() + i, itCend = _children.cend(); it != itCend; ++it)
|
2019-11-23 20:27:39 +08:00
|
|
|
(*it)->visit(renderer, _modelViewTransform, flags);
|
|
|
|
}
|
|
|
|
else if (visibleByCamera)
|
|
|
|
{
|
|
|
|
this->draw(renderer, _modelViewTransform, flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
_director->popMatrix(MATRIX_STACK_TYPE::MATRIX_STACK_MODELVIEW);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// FIX ME: Why need to set _orderOfArrival to 0??
|
|
|
|
// Please refer to https://github.com/cocos2d/cocos2d-x/pull/6920
|
|
|
|
// reset for next frame
|
|
|
|
// _orderOfArrival = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
Mat4 Node::transform(const Mat4& parentTransform)
|
|
|
|
{
|
|
|
|
return parentTransform * this->getNodeToParentTransform();
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: events
|
|
|
|
|
|
|
|
void Node::onEnter()
|
|
|
|
{
|
|
|
|
if (!_running)
|
|
|
|
{
|
|
|
|
++__attachedNodeCount;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_onEnterCallback)
|
|
|
|
_onEnterCallback();
|
|
|
|
|
|
|
|
if (_componentContainer && !_componentContainer->isEmpty())
|
|
|
|
{
|
|
|
|
_componentContainer->onEnter();
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_isTransitionFinished = false;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
child->onEnter();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
this->resume();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_running = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2020-02-24 23:08:47 +08:00
|
|
|
ScriptEngineManager::sendNodeEventToLua(this, kNodeOnEnter);
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::onEnterTransitionDidFinish()
|
|
|
|
{
|
|
|
|
if (_onEnterTransitionDidFinishCallback)
|
|
|
|
_onEnterTransitionDidFinishCallback();
|
|
|
|
|
|
|
|
_isTransitionFinished = true;
|
2021-12-25 10:04:45 +08:00
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
child->onEnterTransitionDidFinish();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2020-02-24 23:08:47 +08:00
|
|
|
ScriptEngineManager::sendNodeEventToLua(this, kNodeOnEnterTransitionDidFinish);
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::onExitTransitionDidStart()
|
|
|
|
{
|
|
|
|
if (_onExitTransitionDidStartCallback)
|
|
|
|
_onExitTransitionDidStartCallback();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
child->onExitTransitionDidStart();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2020-02-24 23:08:47 +08:00
|
|
|
ScriptEngineManager::sendNodeEventToLua(this, kNodeOnExitTransitionDidStart);
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::onExit()
|
|
|
|
{
|
|
|
|
if (_running)
|
|
|
|
{
|
|
|
|
--__attachedNodeCount;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_onExitCallback)
|
|
|
|
_onExitCallback();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_componentContainer && !_componentContainer->isEmpty())
|
|
|
|
{
|
|
|
|
_componentContainer->onExit();
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
this->pause();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_running = false;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
child->onExit();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2020-02-24 23:08:47 +08:00
|
|
|
ScriptEngineManager::sendNodeEventToLua(this, kNodeOnExit);
|
2019-11-23 20:27:39 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setEventDispatcher(EventDispatcher* dispatcher)
|
|
|
|
{
|
|
|
|
if (dispatcher != _eventDispatcher)
|
|
|
|
{
|
|
|
|
_eventDispatcher->removeEventListenersForTarget(this);
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RETAIN(dispatcher);
|
|
|
|
AX_SAFE_RELEASE(_eventDispatcher);
|
2019-11-23 20:27:39 +08:00
|
|
|
_eventDispatcher = dispatcher;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setActionManager(ActionManager* actionManager)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (actionManager != _actionManager)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
this->stopAllActions();
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RETAIN(actionManager);
|
|
|
|
AX_SAFE_RELEASE(_actionManager);
|
2019-11-23 20:27:39 +08:00
|
|
|
_actionManager = actionManager;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: actions
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
Action* Node::runAction(Action* action)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(action != nullptr, "Argument must be non-nil");
|
2019-11-23 20:27:39 +08:00
|
|
|
_actionManager->addAction(action, this, !_running);
|
|
|
|
return action;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::stopAllActions()
|
|
|
|
{
|
|
|
|
_actionManager->removeAllActionsFromTarget(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::stopAction(Action* action)
|
|
|
|
{
|
|
|
|
_actionManager->removeAction(action);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::stopActionByTag(int tag)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(tag != Action::INVALID_TAG, "Invalid tag");
|
2019-11-23 20:27:39 +08:00
|
|
|
_actionManager->removeActionByTag(tag, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::stopAllActionsByTag(int tag)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(tag != Action::INVALID_TAG, "Invalid tag");
|
2019-11-23 20:27:39 +08:00
|
|
|
_actionManager->removeAllActionsByTag(tag, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::stopActionsByFlags(unsigned int flags)
|
|
|
|
{
|
|
|
|
if (flags > 0)
|
|
|
|
{
|
|
|
|
_actionManager->removeActionsByFlags(flags, this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
Action* Node::getActionByTag(int tag)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(tag != Action::INVALID_TAG, "Invalid tag");
|
2019-11-23 20:27:39 +08:00
|
|
|
return _actionManager->getActionByTag(tag, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t Node::getNumberOfRunningActions() const
|
|
|
|
{
|
|
|
|
return _actionManager->getNumberOfRunningActionsInTarget(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t Node::getNumberOfRunningActionsByTag(int tag) const
|
|
|
|
{
|
|
|
|
return _actionManager->getNumberOfRunningActionsInTargetByTag(this, tag);
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: Callbacks
|
|
|
|
|
|
|
|
void Node::setScheduler(Scheduler* scheduler)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (scheduler != _scheduler)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
this->unscheduleAllCallbacks();
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RETAIN(scheduler);
|
|
|
|
AX_SAFE_RELEASE(_scheduler);
|
2019-11-23 20:27:39 +08:00
|
|
|
_scheduler = scheduler;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Node::isScheduled(SEL_SCHEDULE selector) const
|
|
|
|
{
|
|
|
|
return _scheduler->isScheduled(selector, this);
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
bool Node::isScheduled(std::string_view key) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
return _scheduler->isScheduled(key, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::scheduleUpdate()
|
|
|
|
{
|
|
|
|
scheduleUpdateWithPriority(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::scheduleUpdateWithPriority(int priority)
|
|
|
|
{
|
|
|
|
_scheduler->scheduleUpdate(this, priority, !_running);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::scheduleUpdateWithPriorityLua(int nHandler, int priority)
|
|
|
|
{
|
|
|
|
unscheduleUpdate();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2019-11-23 20:27:39 +08:00
|
|
|
_updateScriptHandler = nHandler;
|
|
|
|
#endif
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_scheduler->scheduleUpdate(this, priority, !_running);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::unscheduleUpdate()
|
|
|
|
{
|
|
|
|
_scheduler->unscheduleUpdate(this);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_updateScriptHandler)
|
|
|
|
{
|
|
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->removeScriptHandler(_updateScriptHandler);
|
|
|
|
_updateScriptHandler = 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::schedule(SEL_SCHEDULE selector)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
this->schedule(selector, 0.0f, AX_REPEAT_FOREVER, 0.0f);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::schedule(SEL_SCHEDULE selector, float interval)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
this->schedule(selector, interval, AX_REPEAT_FOREVER, 0.0f);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Node::schedule(SEL_SCHEDULE selector, float interval, unsigned int repeat, float delay)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AXASSERT(selector, "Argument must be non-nil");
|
|
|
|
AXASSERT(interval >= 0, "Argument must be positive");
|
2019-11-23 20:27:39 +08:00
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
_scheduler->schedule(selector, this, interval, repeat, delay, !_running);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::schedule(const std::function<void(float)>& callback, std::string_view key)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_scheduler->schedule(callback, this, 0, !_running, key);
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::schedule(const std::function<void(float)>& callback, float interval, std::string_view key)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_scheduler->schedule(callback, this, interval, !_running, key);
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::schedule(const std::function<void(float)>& callback,
|
|
|
|
float interval,
|
|
|
|
unsigned int repeat,
|
|
|
|
float delay,
|
2021-12-31 12:12:40 +08:00
|
|
|
std::string_view key)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_scheduler->schedule(callback, this, interval, repeat, delay, !_running, key);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::scheduleOnce(SEL_SCHEDULE selector, float delay)
|
|
|
|
{
|
|
|
|
this->schedule(selector, 0.0f, 0, delay);
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::scheduleOnce(const std::function<void(float)>& callback, float delay, std::string_view key)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_scheduler->schedule(callback, this, 0, 0, delay, !_running, key);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::unschedule(SEL_SCHEDULE selector)
|
|
|
|
{
|
|
|
|
// explicit null handling
|
|
|
|
if (selector == nullptr)
|
|
|
|
return;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_scheduler->unschedule(selector, this);
|
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
void Node::unschedule(std::string_view key)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
_scheduler->unschedule(key, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::unscheduleAllCallbacks()
|
|
|
|
{
|
|
|
|
_scheduler->unscheduleAllForTarget(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::resume()
|
|
|
|
{
|
|
|
|
_scheduler->resumeTarget(this);
|
|
|
|
_actionManager->resumeTarget(this);
|
|
|
|
_eventDispatcher->resumeEventListenersForTarget(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::pause()
|
|
|
|
{
|
|
|
|
_scheduler->pauseTarget(this);
|
|
|
|
_actionManager->pauseTarget(this);
|
|
|
|
_eventDispatcher->pauseEventListenersForTarget(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
// override me
|
|
|
|
void Node::update(float fDelta)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
#if AX_ENABLE_SCRIPT_BINDING
|
2019-11-23 20:27:39 +08:00
|
|
|
if (0 != _updateScriptHandler)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
// only lua use
|
|
|
|
SchedulerScriptData data(_updateScriptHandler, fDelta);
|
|
|
|
ScriptEvent event(kScheduleEvent, &data);
|
2020-02-24 23:08:47 +08:00
|
|
|
ScriptEngineManager::sendEventToLua(event);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
#endif
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_componentContainer && !_componentContainer->isEmpty())
|
|
|
|
{
|
|
|
|
_componentContainer->visit(fDelta);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: coordinates
|
|
|
|
|
|
|
|
AffineTransform Node::getNodeToParentAffineTransform() const
|
|
|
|
{
|
|
|
|
AffineTransform ret;
|
|
|
|
GLToCGAffine(getNodeToParentTransform().m, &ret);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
Mat4 Node::getNodeToParentTransform(Node* ancestor) const
|
|
|
|
{
|
|
|
|
Mat4 t(this->getNodeToParentTransform());
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
for (Node* p = _parent; p != nullptr && p != ancestor; p = p->getParent())
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
t = p->getNodeToParentTransform() * t;
|
|
|
|
}
|
|
|
|
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
|
|
|
AffineTransform Node::getNodeToParentAffineTransform(Node* ancestor) const
|
|
|
|
{
|
|
|
|
AffineTransform t(this->getNodeToParentAffineTransform());
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
for (Node* p = _parent; p != nullptr && p != ancestor; p = p->getParent())
|
2019-11-23 20:27:39 +08:00
|
|
|
t = AffineTransformConcat(t, p->getNodeToParentAffineTransform());
|
|
|
|
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
const Mat4& Node::getNodeToParentTransform() const
|
|
|
|
{
|
|
|
|
if (_transformDirty)
|
|
|
|
{
|
|
|
|
// Translate values
|
|
|
|
float x = _position.x;
|
|
|
|
float y = _position.y;
|
|
|
|
float z = _positionZ;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_ignoreAnchorPointForPosition)
|
|
|
|
{
|
|
|
|
x += _anchorPointInPoints.x;
|
|
|
|
y += _anchorPointInPoints.y;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
bool needsSkewMatrix = (_skewX || _skewY);
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
// Build Transform Matrix = translation * rotation * scale
|
|
|
|
Mat4 translation;
|
2021-12-25 10:04:45 +08:00
|
|
|
// move to anchor point first, then rotate
|
2019-11-23 20:27:39 +08:00
|
|
|
Mat4::createTranslation(x, y, z, &translation);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
Mat4::createRotation(_rotationQuat, &_transform);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_rotationZ_X != _rotationZ_Y)
|
|
|
|
{
|
|
|
|
// Rotation values
|
|
|
|
// Change rotation code to handle X and Y
|
|
|
|
// If we skew with the exact same value for both x and y then we're simply just rotating
|
2022-07-16 10:43:05 +08:00
|
|
|
float radiansX = -AX_DEGREES_TO_RADIANS(_rotationZ_X);
|
|
|
|
float radiansY = -AX_DEGREES_TO_RADIANS(_rotationZ_Y);
|
2021-12-25 10:04:45 +08:00
|
|
|
float cx = cosf(radiansX);
|
|
|
|
float sx = sinf(radiansX);
|
|
|
|
float cy = cosf(radiansY);
|
|
|
|
float sy = sinf(radiansY);
|
|
|
|
|
|
|
|
float m0 = _transform.m[0], m1 = _transform.m[1], m4 = _transform.m[4], m5 = _transform.m[5],
|
|
|
|
m8 = _transform.m[8], m9 = _transform.m[9];
|
2019-11-23 20:27:39 +08:00
|
|
|
_transform.m[0] = cy * m0 - sx * m1;
|
|
|
|
_transform.m[4] = cy * m4 - sx * m5;
|
|
|
|
_transform.m[8] = cy * m8 - sx * m9;
|
|
|
|
_transform.m[1] = sy * m0 + cx * m1;
|
|
|
|
_transform.m[5] = sy * m4 + cx * m5;
|
|
|
|
_transform.m[9] = sy * m8 + cx * m9;
|
|
|
|
}
|
|
|
|
_transform = translation * _transform;
|
|
|
|
|
|
|
|
if (_scaleX != 1.f)
|
|
|
|
{
|
|
|
|
_transform.m[0] *= _scaleX;
|
|
|
|
_transform.m[1] *= _scaleX;
|
2021-12-25 10:04:45 +08:00
|
|
|
_transform.m[2] *= _scaleX;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
if (_scaleY != 1.f)
|
|
|
|
{
|
|
|
|
_transform.m[4] *= _scaleY;
|
|
|
|
_transform.m[5] *= _scaleY;
|
|
|
|
_transform.m[6] *= _scaleY;
|
|
|
|
}
|
|
|
|
if (_scaleZ != 1.f)
|
|
|
|
{
|
|
|
|
_transform.m[8] *= _scaleZ;
|
|
|
|
_transform.m[9] *= _scaleZ;
|
|
|
|
_transform.m[10] *= _scaleZ;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// FIXME:: Try to inline skew
|
|
|
|
// If skew is needed, apply skew and then anchor point
|
|
|
|
if (needsSkewMatrix)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
float skewMatArray[16] = {1,
|
2022-07-16 10:43:05 +08:00
|
|
|
(float)tanf(AX_DEGREES_TO_RADIANS(_skewY)),
|
2021-12-25 10:04:45 +08:00
|
|
|
0,
|
|
|
|
0,
|
2022-07-16 10:43:05 +08:00
|
|
|
(float)tanf(AX_DEGREES_TO_RADIANS(_skewX)),
|
2021-12-25 10:04:45 +08:00
|
|
|
1,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
1,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
1};
|
2019-11-23 20:27:39 +08:00
|
|
|
Mat4 skewMatrix(skewMatArray);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_transform = _transform * skewMatrix;
|
|
|
|
}
|
|
|
|
|
|
|
|
// adjust anchor point
|
|
|
|
if (!_anchorPointInPoints.isZero())
|
|
|
|
{
|
|
|
|
// FIXME:: Argh, Mat4 needs a "translate" method.
|
|
|
|
// FIXME:: Although this is faster than multiplying a vec4 * mat4
|
|
|
|
_transform.m[12] += _transform.m[0] * -_anchorPointInPoints.x + _transform.m[4] * -_anchorPointInPoints.y;
|
|
|
|
_transform.m[13] += _transform.m[1] * -_anchorPointInPoints.x + _transform.m[5] * -_anchorPointInPoints.y;
|
|
|
|
_transform.m[14] += _transform.m[2] * -_anchorPointInPoints.x + _transform.m[6] * -_anchorPointInPoints.y;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (_additionalTransform)
|
|
|
|
{
|
|
|
|
// This is needed to support both Node::setNodeToParentTransform() and Node::setAdditionalTransform()
|
|
|
|
// at the same time. The scenario is this:
|
|
|
|
// at some point setNodeToParentTransform() is called.
|
|
|
|
// and later setAdditionalTransform() is called every time. And since _transform
|
|
|
|
// is being overwritten everyframe, _additionalTransform[1] is used to have a copy
|
|
|
|
// of the last "_transform without _additionalTransform"
|
|
|
|
if (_transformDirty)
|
|
|
|
_additionalTransform[1] = _transform;
|
|
|
|
|
|
|
|
if (_transformUpdated)
|
|
|
|
_transform = _additionalTransform[1] * _additionalTransform[0];
|
|
|
|
}
|
|
|
|
|
|
|
|
_transformDirty = _additionalTransformDirty = false;
|
|
|
|
|
|
|
|
return _transform;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setNodeToParentTransform(const Mat4& transform)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
_transform = transform;
|
|
|
|
_transformDirty = false;
|
2019-11-23 20:27:39 +08:00
|
|
|
_transformUpdated = true;
|
|
|
|
|
|
|
|
if (_additionalTransform)
|
|
|
|
// _additionalTransform[1] has a copy of lastest transform
|
|
|
|
_additionalTransform[1] = transform;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setAdditionalTransform(const AffineTransform& additionalTransform)
|
|
|
|
{
|
|
|
|
Mat4 tmp;
|
|
|
|
CGAffineToGL(additionalTransform, tmp.m);
|
|
|
|
setAdditionalTransform(&tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setAdditionalTransform(const Mat4* additionalTransform)
|
|
|
|
{
|
|
|
|
if (additionalTransform == nullptr)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (_additionalTransform)
|
|
|
|
_transform = _additionalTransform[1];
|
2019-11-23 20:27:39 +08:00
|
|
|
delete[] _additionalTransform;
|
|
|
|
_additionalTransform = nullptr;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (!_additionalTransform)
|
|
|
|
{
|
2019-11-23 20:27:39 +08:00
|
|
|
_additionalTransform = new Mat4[2];
|
|
|
|
|
|
|
|
// _additionalTransform[1] is used as a backup for _transform
|
|
|
|
_additionalTransform[1] = _transform;
|
|
|
|
}
|
|
|
|
|
|
|
|
_additionalTransform[0] = *additionalTransform;
|
|
|
|
}
|
|
|
|
_transformUpdated = _additionalTransformDirty = _inverseDirty = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setAdditionalTransform(const Mat4& additionalTransform)
|
|
|
|
{
|
|
|
|
setAdditionalTransform(&additionalTransform);
|
|
|
|
}
|
|
|
|
|
|
|
|
AffineTransform Node::getParentToNodeAffineTransform() const
|
|
|
|
{
|
|
|
|
AffineTransform ret;
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
GLToCGAffine(getParentToNodeTransform().m, &ret);
|
2019-11-23 20:27:39 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
const Mat4& Node::getParentToNodeTransform() const
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
if (_inverseDirty)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
_inverse = getNodeToParentTransform().getInversed();
|
2019-11-23 20:27:39 +08:00
|
|
|
_inverseDirty = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return _inverse;
|
|
|
|
}
|
|
|
|
|
|
|
|
AffineTransform Node::getNodeToWorldAffineTransform() const
|
|
|
|
{
|
|
|
|
return this->getNodeToParentAffineTransform(nullptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
Mat4 Node::getNodeToWorldTransform() const
|
|
|
|
{
|
|
|
|
return this->getNodeToParentTransform(nullptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
AffineTransform Node::getWorldToNodeAffineTransform() const
|
|
|
|
{
|
|
|
|
return AffineTransformInvert(this->getNodeToWorldAffineTransform());
|
|
|
|
}
|
|
|
|
|
|
|
|
Mat4 Node::getWorldToNodeTransform() const
|
|
|
|
{
|
|
|
|
return getNodeToWorldTransform().getInversed();
|
|
|
|
}
|
|
|
|
|
|
|
|
Vec2 Node::convertToNodeSpace(const Vec2& worldPoint) const
|
|
|
|
{
|
|
|
|
Mat4 tmp = getWorldToNodeTransform();
|
|
|
|
Vec3 vec3(worldPoint.x, worldPoint.y, 0);
|
|
|
|
Vec3 ret;
|
2021-12-25 10:04:45 +08:00
|
|
|
tmp.transformPoint(vec3, &ret);
|
2019-11-23 20:27:39 +08:00
|
|
|
return Vec2(ret.x, ret.y);
|
|
|
|
}
|
|
|
|
|
|
|
|
Vec2 Node::convertToWorldSpace(const Vec2& nodePoint) const
|
|
|
|
{
|
|
|
|
Mat4 tmp = getNodeToWorldTransform();
|
|
|
|
Vec3 vec3(nodePoint.x, nodePoint.y, 0);
|
|
|
|
Vec3 ret;
|
2021-12-25 10:04:45 +08:00
|
|
|
tmp.transformPoint(vec3, &ret);
|
2019-11-23 20:27:39 +08:00
|
|
|
return Vec2(ret.x, ret.y);
|
|
|
|
}
|
|
|
|
|
|
|
|
Vec2 Node::convertToNodeSpaceAR(const Vec2& worldPoint) const
|
|
|
|
{
|
|
|
|
Vec2 nodePoint(convertToNodeSpace(worldPoint));
|
|
|
|
return nodePoint - _anchorPointInPoints;
|
|
|
|
}
|
|
|
|
|
|
|
|
Vec2 Node::convertToWorldSpaceAR(const Vec2& nodePoint) const
|
|
|
|
{
|
|
|
|
return convertToWorldSpace(nodePoint + _anchorPointInPoints);
|
|
|
|
}
|
|
|
|
|
|
|
|
Vec2 Node::convertToWindowSpace(const Vec2& nodePoint) const
|
|
|
|
{
|
|
|
|
Vec2 worldPoint(this->convertToWorldSpace(nodePoint));
|
|
|
|
return _director->convertToUI(worldPoint);
|
|
|
|
}
|
|
|
|
|
|
|
|
// convenience methods which take a Touch instead of Vec2
|
2021-12-25 10:04:45 +08:00
|
|
|
Vec2 Node::convertTouchToNodeSpace(Touch* touch) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
return this->convertToNodeSpace(touch->getLocation());
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
Vec2 Node::convertTouchToNodeSpaceAR(Touch* touch) const
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
Vec2 point = touch->getLocation();
|
|
|
|
return this->convertToNodeSpaceAR(point);
|
|
|
|
}
|
|
|
|
|
2022-12-07 09:24:46 +08:00
|
|
|
Vec2 Node::getWorldPosition() const
|
|
|
|
{
|
|
|
|
return convertToWorldSpace(Vec2(_anchorPoint.x * _contentSize.width, _anchorPoint.y * _contentSize.height));
|
|
|
|
}
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
void Node::updateTransform()
|
|
|
|
{
|
|
|
|
// Recursively iterate over children
|
2021-12-25 10:04:45 +08:00
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
child->updateTransform();
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: components
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
Component* Node::getComponent(std::string_view name)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
if (_componentContainer)
|
|
|
|
return _componentContainer->get(name);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
bool Node::addComponent(Component* component)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
// lazy alloc
|
|
|
|
if (!_componentContainer)
|
2021-12-08 00:11:53 +08:00
|
|
|
_componentContainer = new ComponentContainer(this);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// should enable schedule update, then all components can receive this call back
|
|
|
|
scheduleUpdate();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2022-09-27 17:32:04 +08:00
|
|
|
const auto added = _componentContainer->add(component);
|
|
|
|
if (added && _running)
|
|
|
|
component->onEnter();
|
|
|
|
|
|
|
|
return added;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2021-12-31 12:12:40 +08:00
|
|
|
bool Node::removeComponent(std::string_view name)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
if (_componentContainer)
|
|
|
|
return _componentContainer->remove(name);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
bool Node::removeComponent(Component* component)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
if (_componentContainer)
|
|
|
|
{
|
|
|
|
return _componentContainer->remove(component);
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::removeAllComponents()
|
|
|
|
{
|
|
|
|
if (_componentContainer)
|
|
|
|
_componentContainer->removeAll();
|
|
|
|
}
|
|
|
|
|
|
|
|
// MARK: Opacity and Color
|
|
|
|
|
|
|
|
uint8_t Node::getOpacity() const
|
|
|
|
{
|
|
|
|
return _realOpacity;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint8_t Node::getDisplayedOpacity() const
|
|
|
|
{
|
|
|
|
return _displayedOpacity;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setOpacity(uint8_t opacity)
|
|
|
|
{
|
|
|
|
_displayedOpacity = _realOpacity = opacity;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateCascadeOpacity();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateDisplayedOpacity(uint8_t parentOpacity)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
_displayedOpacity = _realOpacity * parentOpacity / 255.0;
|
2019-11-23 20:27:39 +08:00
|
|
|
updateColor();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_cascadeOpacityEnabled)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->updateDisplayedOpacity(_displayedOpacity);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Node::isCascadeOpacityEnabled() const
|
|
|
|
{
|
|
|
|
return _cascadeOpacityEnabled;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setCascadeOpacityEnabled(bool cascadeOpacityEnabled)
|
|
|
|
{
|
|
|
|
if (_cascadeOpacityEnabled == cascadeOpacityEnabled)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_cascadeOpacityEnabled = cascadeOpacityEnabled;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (cascadeOpacityEnabled)
|
|
|
|
{
|
|
|
|
updateCascadeOpacity();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
disableCascadeOpacity();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateCascadeOpacity()
|
|
|
|
{
|
|
|
|
uint8_t parentOpacity = 255;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_parent != nullptr && _parent->isCascadeOpacityEnabled())
|
|
|
|
{
|
|
|
|
parentOpacity = _parent->getDisplayedOpacity();
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateDisplayedOpacity(parentOpacity);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::disableCascadeOpacity()
|
|
|
|
{
|
|
|
|
_displayedOpacity = _realOpacity;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->updateDisplayedOpacity(255);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
void Node::setOpacityModifyRGB(bool /*value*/) {}
|
2019-11-23 20:27:39 +08:00
|
|
|
|
|
|
|
bool Node::isOpacityModifyRGB() const
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
const Color3B& Node::getColor() const
|
|
|
|
{
|
|
|
|
return _realColor;
|
|
|
|
}
|
|
|
|
|
|
|
|
const Color3B& Node::getDisplayedColor() const
|
|
|
|
{
|
|
|
|
return _displayedColor;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setColor(const Color3B& color)
|
|
|
|
{
|
|
|
|
_displayedColor = _realColor = color;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateCascadeColor();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateDisplayedColor(const Color3B& parentColor)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
_displayedColor.r = _realColor.r * parentColor.r / 255.0;
|
|
|
|
_displayedColor.g = _realColor.g * parentColor.g / 255.0;
|
|
|
|
_displayedColor.b = _realColor.b * parentColor.b / 255.0;
|
2019-11-23 20:27:39 +08:00
|
|
|
updateColor();
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_cascadeColorEnabled)
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->updateDisplayedColor(_displayedColor);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Node::isCascadeColorEnabled() const
|
|
|
|
{
|
|
|
|
return _cascadeColorEnabled;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setCascadeColorEnabled(bool cascadeColorEnabled)
|
|
|
|
{
|
|
|
|
if (_cascadeColorEnabled == cascadeColorEnabled)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
_cascadeColorEnabled = cascadeColorEnabled;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
if (_cascadeColorEnabled)
|
|
|
|
{
|
|
|
|
updateCascadeColor();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
disableCascadeColor();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::updateCascadeColor()
|
|
|
|
{
|
|
|
|
Color3B parentColor = Color3B::WHITE;
|
|
|
|
if (_parent && _parent->isCascadeColorEnabled())
|
|
|
|
{
|
|
|
|
parentColor = _parent->getDisplayedColor();
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
updateDisplayedColor(parentColor);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::disableCascadeColor()
|
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
for (const auto& child : _children)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
child->updateDisplayedColor(Color3B::WHITE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-25 10:04:45 +08:00
|
|
|
bool isScreenPointInRect(const Vec2& pt, const Camera* camera, const Mat4& w2l, const Rect& rect, Vec3* p)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
if (nullptr == camera || rect.size.width <= 0 || rect.size.height <= 0)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// first, convert pt to near/far plane, get Pn and Pf
|
|
|
|
Vec3 Pn(pt.x, pt.y, -1), Pf(pt.x, pt.y, 1);
|
|
|
|
Pn = camera->unprojectGL(Pn);
|
|
|
|
Pf = camera->unprojectGL(Pf);
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// then convert Pn and Pf to node space
|
|
|
|
w2l.transformPoint(&Pn);
|
|
|
|
w2l.transformPoint(&Pf);
|
|
|
|
|
|
|
|
// Pn and Pf define a line Q(t) = D + t * E which D = Pn
|
|
|
|
auto E = Pf - Pn;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// second, get three points which define content plane
|
|
|
|
// these points define a plane P(u, w) = A + uB + wC
|
|
|
|
Vec3 A = Vec3(rect.origin.x, rect.origin.y, 0);
|
|
|
|
Vec3 B(rect.origin.x + rect.size.width, rect.origin.y, 0);
|
|
|
|
Vec3 C(rect.origin.x, rect.origin.y + rect.size.height, 0);
|
|
|
|
B = B - A;
|
|
|
|
C = C - A;
|
2021-12-25 10:04:45 +08:00
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// the line Q(t) intercept with plane P(u, w)
|
|
|
|
// calculate the intercept point P = Q(t)
|
|
|
|
// (BxC).A - (BxC).D
|
|
|
|
// t = -----------------
|
|
|
|
// (BxC).E
|
|
|
|
Vec3 BxC;
|
|
|
|
Vec3::cross(B, C, &BxC);
|
|
|
|
auto BxCdotE = BxC.dot(E);
|
2021-12-25 10:04:45 +08:00
|
|
|
if (BxCdotE == 0)
|
|
|
|
{
|
2019-11-23 20:27:39 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
auto t = (BxC.dot(A) - BxC.dot(Pn)) / BxCdotE;
|
|
|
|
Vec3 P = Pn + t * E;
|
2021-12-25 10:04:45 +08:00
|
|
|
if (p)
|
|
|
|
{
|
2019-11-23 20:27:39 +08:00
|
|
|
*p = P;
|
|
|
|
}
|
|
|
|
return rect.containsPoint(Vec2(P.x, P.y));
|
|
|
|
}
|
|
|
|
|
2022-04-25 09:37:41 +08:00
|
|
|
void Node::applyMaskOnEnter(bool applyChildren)
|
|
|
|
{
|
|
|
|
_childFollowCameraMask = applyChildren;
|
|
|
|
}
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
// MARK: Camera
|
|
|
|
void Node::setCameraMask(unsigned short mask, bool applyChildren)
|
|
|
|
{
|
|
|
|
_cameraMask = mask;
|
|
|
|
if (applyChildren)
|
|
|
|
{
|
|
|
|
for (const auto& child : _children)
|
|
|
|
{
|
|
|
|
child->setCameraMask(mask, applyChildren);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int Node::getAttachedNodeCount()
|
|
|
|
{
|
|
|
|
return __attachedNodeCount;
|
|
|
|
}
|
|
|
|
|
2020-10-16 16:23:14 +08:00
|
|
|
void Node::setProgramStateWithRegistry(uint32_t programType, Texture2D* texture)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
2021-12-25 10:04:45 +08:00
|
|
|
auto samplerFlags = texture ? texture->getSamplerFlags() : 0;
|
2021-06-27 20:58:50 +08:00
|
|
|
auto programState = backend::ProgramStateRegistry::getInstance()->newProgramState(programType, samplerFlags);
|
2023-08-25 16:46:32 +08:00
|
|
|
setProgramState(programState, false);
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2023-08-25 16:46:32 +08:00
|
|
|
bool Node::setProgramState(backend::ProgramState* programState, bool needsRetain)
|
2019-11-23 20:27:39 +08:00
|
|
|
{
|
|
|
|
if (_programState != programState)
|
|
|
|
{
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RELEASE(_programState);
|
2019-11-23 20:27:39 +08:00
|
|
|
_programState = programState;
|
2023-08-25 16:46:32 +08:00
|
|
|
if (needsRetain)
|
2022-07-16 10:43:05 +08:00
|
|
|
AX_SAFE_RETAIN(_programState);
|
2020-07-21 23:11:03 +08:00
|
|
|
return !!_programState;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
2020-07-21 23:11:03 +08:00
|
|
|
return false;
|
2019-11-23 20:27:39 +08:00
|
|
|
}
|
|
|
|
|
2020-09-09 13:03:31 +08:00
|
|
|
void Node::updateProgramStateTexture(Texture2D* texture)
|
|
|
|
{
|
|
|
|
if (texture == nullptr || texture->getBackendTexture() == nullptr || _programState == nullptr)
|
|
|
|
return;
|
|
|
|
|
|
|
|
_programState->setTexture(texture->getBackendTexture());
|
|
|
|
}
|
|
|
|
|
2019-11-23 20:27:39 +08:00
|
|
|
backend::ProgramState* Node::getProgramState() const
|
|
|
|
{
|
|
|
|
return _programState;
|
|
|
|
}
|
|
|
|
|
2022-07-11 17:50:21 +08:00
|
|
|
NS_AX_END
|