mirror of https://github.com/axmolengine/axmol.git
1466 lines
34 KiB
C++
1466 lines
34 KiB
C++
/****************************************************************************
|
|
Copyright (c) 2010-2012 cocos2d-x.org
|
|
Copyright (c) 2008-2010 Ricardo Quesada
|
|
Copyright (c) 2009 Valentin Milea
|
|
Copyright (c) 2011 Zynga Inc.
|
|
|
|
http://www.cocos2d-x.org
|
|
|
|
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.
|
|
****************************************************************************/
|
|
|
|
#include "CCNode.h"
|
|
|
|
#include <algorithm>
|
|
|
|
#include "cocoa/CCString.h"
|
|
#include "support/data_support/ccCArray.h"
|
|
#include "support/TransformUtils.h"
|
|
#include "CCCamera.h"
|
|
#include "effects/CCGrid.h"
|
|
#include "CCDirector.h"
|
|
#include "CCScheduler.h"
|
|
#include "event_dispatcher/CCTouch.h"
|
|
#include "actions/CCActionManager.h"
|
|
#include "script_support/CCScriptSupport.h"
|
|
#include "shaders/CCGLProgram.h"
|
|
#include "event_dispatcher/CCEventDispatcher.h"
|
|
#include "event_dispatcher/CCEvent.h"
|
|
#include "event_dispatcher/CCTouchEvent.h"
|
|
|
|
// externals
|
|
#include "kazmath/GL/matrix.h"
|
|
#include "support/component/CCComponent.h"
|
|
#include "support/component/CCComponentContainer.h"
|
|
|
|
|
|
|
|
#if CC_NODE_RENDER_SUBPIXEL
|
|
#define RENDER_IN_SUBPIXEL
|
|
#else
|
|
#define RENDER_IN_SUBPIXEL(__ARGS__) (ceil(__ARGS__))
|
|
#endif
|
|
|
|
NS_CC_BEGIN
|
|
|
|
#if CC_USE_ARRAY_VECTOR
|
|
bool nodeComparisonLess(const RCPtr<Object>& pp1, const RCPtr<Object>& pp2)
|
|
{
|
|
Object *p1 = static_cast<Object*>(pp1);
|
|
Object *p2 = static_cast<Object*>(pp2);
|
|
Node *n1 = static_cast<Node*>(p1);
|
|
Node *n2 = static_cast<Node*>(p2);
|
|
|
|
return( n1->getZOrder() < n2->getZOrder() ||
|
|
( n1->getZOrder() == n2->getZOrder() && n1->getOrderOfArrival() < n2->getOrderOfArrival() )
|
|
);
|
|
}
|
|
#else
|
|
bool nodeComparisonLess(Object* p1, Object* p2)
|
|
{
|
|
Node *n1 = static_cast<Node*>(p1);
|
|
Node *n2 = static_cast<Node*>(p2);
|
|
|
|
return( n1->getZOrder() < n2->getZOrder() ||
|
|
( n1->getZOrder() == n2->getZOrder() && n1->getOrderOfArrival() < n2->getOrderOfArrival() )
|
|
);
|
|
}
|
|
#endif
|
|
|
|
// XXX: Yes, nodes might have a sort problem once every 15 days if the game runs at 60 FPS and each frame sprites are reordered.
|
|
static int s_globalOrderOfArrival = 1;
|
|
int Node::_globalEventPriorityIndex = 0;
|
|
|
|
Node::Node(void)
|
|
: _rotationX(0.0f)
|
|
, _rotationY(0.0f)
|
|
, _scaleX(1.0f)
|
|
, _scaleY(1.0f)
|
|
, _vertexZ(0.0f)
|
|
, _position(Point::ZERO)
|
|
, _skewX(0.0f)
|
|
, _skewY(0.0f)
|
|
, _anchorPointInPoints(Point::ZERO)
|
|
, _anchorPoint(Point::ZERO)
|
|
, _contentSize(Size::ZERO)
|
|
, _additionalTransform(AffineTransform::IDENTITY)
|
|
, _transform(AffineTransform::IDENTITY)
|
|
, _inverse(AffineTransform::IDENTITY)
|
|
, _additionalTransformDirty(false)
|
|
, _transformDirty(true)
|
|
, _inverseDirty(true)
|
|
, _camera(NULL)
|
|
// children (lazy allocs)
|
|
// lazy alloc
|
|
, _grid(NULL)
|
|
, _ZOrder(0)
|
|
, _children(NULL)
|
|
, _parent(NULL)
|
|
// "whole screen" objects. like Scenes and Layers, should set _ignoreAnchorPointForPosition to true
|
|
, _tag(Node::INVALID_TAG)
|
|
// userData is always inited as nil
|
|
, _userData(NULL)
|
|
, _userObject(NULL)
|
|
, _shaderProgram(NULL)
|
|
, _orderOfArrival(0)
|
|
, _running(false)
|
|
, _visible(true)
|
|
, _ignoreAnchorPointForPosition(false)
|
|
, _reorderChildDirty(false)
|
|
, _isTransitionFinished(false)
|
|
, _updateScriptHandler(0)
|
|
, _componentContainer(NULL)
|
|
, _eventPriority(0)
|
|
, _oldEventPriority(0)
|
|
{
|
|
// set default scheduler and actionManager
|
|
Director *director = Director::getInstance();
|
|
_actionManager = director->getActionManager();
|
|
_actionManager->retain();
|
|
_scheduler = director->getScheduler();
|
|
_scheduler->retain();
|
|
|
|
ScriptEngineProtocol* pEngine = ScriptEngineManager::getInstance()->getScriptEngine();
|
|
_scriptType = pEngine != NULL ? pEngine->getScriptType() : kScriptTypeNone;
|
|
}
|
|
|
|
Node::~Node()
|
|
{
|
|
CCLOGINFO( "deallocing Node: %p - tag: %i", this, _tag );
|
|
|
|
if (_updateScriptHandler)
|
|
{
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->removeScriptHandler(_updateScriptHandler);
|
|
}
|
|
|
|
CC_SAFE_RELEASE(_actionManager);
|
|
CC_SAFE_RELEASE(_scheduler);
|
|
// attributes
|
|
CC_SAFE_RELEASE(_camera);
|
|
|
|
CC_SAFE_RELEASE(_grid);
|
|
CC_SAFE_RELEASE(_shaderProgram);
|
|
CC_SAFE_RELEASE(_userObject);
|
|
|
|
if(_children && _children->count() > 0)
|
|
{
|
|
Object* child;
|
|
CCARRAY_FOREACH(_children, child)
|
|
{
|
|
Node* node = static_cast<Node*>(child);
|
|
if (node)
|
|
{
|
|
node->_parent = NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
// children
|
|
CC_SAFE_RELEASE(_children);
|
|
|
|
removeAllComponents();
|
|
|
|
CC_SAFE_DELETE(_componentContainer);
|
|
|
|
removeAllEventListeners();
|
|
}
|
|
|
|
bool Node::init()
|
|
{
|
|
return true;
|
|
}
|
|
|
|
float Node::getSkewX() const
|
|
{
|
|
return _skewX;
|
|
}
|
|
|
|
void Node::setSkewX(float newSkewX)
|
|
{
|
|
_skewX = newSkewX;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
float Node::getSkewY() const
|
|
{
|
|
return _skewY;
|
|
}
|
|
|
|
void Node::setSkewY(float newSkewY)
|
|
{
|
|
_skewY = newSkewY;
|
|
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
/// zOrder getter
|
|
int Node::getZOrder() const
|
|
{
|
|
return _ZOrder;
|
|
}
|
|
|
|
/// zOrder setter : private method
|
|
/// used internally to alter the zOrder variable. DON'T call this method manually
|
|
void Node::_setZOrder(int z)
|
|
{
|
|
_ZOrder = z;
|
|
}
|
|
|
|
void Node::setZOrder(int z)
|
|
{
|
|
_setZOrder(z);
|
|
if (_parent)
|
|
{
|
|
_parent->reorderChild(this, z);
|
|
}
|
|
}
|
|
|
|
/// vertexZ getter
|
|
float Node::getVertexZ() const
|
|
{
|
|
return _vertexZ;
|
|
}
|
|
|
|
|
|
/// vertexZ setter
|
|
void Node::setVertexZ(float var)
|
|
{
|
|
_vertexZ = var;
|
|
}
|
|
|
|
|
|
/// rotation getter
|
|
float Node::getRotation() const
|
|
{
|
|
CCASSERT(_rotationX == _rotationY, "CCNode#rotation. RotationX != RotationY. Don't know which one to return");
|
|
return _rotationX;
|
|
}
|
|
|
|
/// rotation setter
|
|
void Node::setRotation(float newRotation)
|
|
{
|
|
_rotationX = _rotationY = newRotation;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
float Node::getRotationX() const
|
|
{
|
|
return _rotationX;
|
|
}
|
|
|
|
void Node::setRotationX(float fRotationX)
|
|
{
|
|
_rotationX = fRotationX;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
float Node::getRotationY() const
|
|
{
|
|
return _rotationY;
|
|
}
|
|
|
|
void Node::setRotationY(float fRotationY)
|
|
{
|
|
_rotationY = fRotationY;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
/// scale getter
|
|
float Node::getScale(void) const
|
|
{
|
|
CCASSERT( _scaleX == _scaleY, "CCNode#scale. ScaleX != ScaleY. Don't know which one to return");
|
|
return _scaleX;
|
|
}
|
|
|
|
/// scale setter
|
|
void Node::setScale(float scale)
|
|
{
|
|
_scaleX = _scaleY = scale;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
/// scaleX getter
|
|
float Node::getScaleX() const
|
|
{
|
|
return _scaleX;
|
|
}
|
|
|
|
/// scaleX setter
|
|
void Node::setScaleX(float newScaleX)
|
|
{
|
|
_scaleX = newScaleX;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
/// scaleY getter
|
|
float Node::getScaleY() const
|
|
{
|
|
return _scaleY;
|
|
}
|
|
|
|
/// scaleY setter
|
|
void Node::setScaleY(float newScaleY)
|
|
{
|
|
_scaleY = newScaleY;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
/// position getter
|
|
const Point& Node::getPosition() const
|
|
{
|
|
return _position;
|
|
}
|
|
|
|
/// position setter
|
|
void Node::setPosition(const Point& newPosition)
|
|
{
|
|
_position = newPosition;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
|
|
void Node::getPosition(float* x, float* y) const
|
|
{
|
|
*x = _position.x;
|
|
*y = _position.y;
|
|
}
|
|
|
|
void Node::setPosition(float x, float y)
|
|
{
|
|
setPosition(Point(x, y));
|
|
}
|
|
|
|
float Node::getPositionX() const
|
|
{
|
|
return _position.x;
|
|
}
|
|
|
|
float Node::getPositionY() const
|
|
{
|
|
return _position.y;
|
|
}
|
|
|
|
void Node::setPositionX(float x)
|
|
{
|
|
setPosition(Point(x, _position.y));
|
|
}
|
|
|
|
void Node::setPositionY(float y)
|
|
{
|
|
setPosition(Point(_position.x, y));
|
|
}
|
|
|
|
unsigned int Node::getChildrenCount() const
|
|
{
|
|
return _children ? _children->count() : 0;
|
|
}
|
|
|
|
/// camera getter: lazy alloc
|
|
Camera* Node::getCamera()
|
|
{
|
|
if (!_camera)
|
|
{
|
|
_camera = new Camera();
|
|
}
|
|
|
|
return _camera;
|
|
}
|
|
|
|
/// grid setter
|
|
void Node::setGrid(GridBase* pGrid)
|
|
{
|
|
CC_SAFE_RETAIN(pGrid);
|
|
CC_SAFE_RELEASE(_grid);
|
|
_grid = pGrid;
|
|
}
|
|
|
|
|
|
/// isVisible getter
|
|
bool Node::isVisible() const
|
|
{
|
|
return _visible;
|
|
}
|
|
|
|
/// isVisible setter
|
|
void Node::setVisible(bool var)
|
|
{
|
|
_visible = var;
|
|
}
|
|
|
|
const Point& Node::getAnchorPointInPoints() const
|
|
{
|
|
return _anchorPointInPoints;
|
|
}
|
|
|
|
/// anchorPoint getter
|
|
const Point& Node::getAnchorPoint() const
|
|
{
|
|
return _anchorPoint;
|
|
}
|
|
|
|
void Node::setAnchorPoint(const Point& point)
|
|
{
|
|
if( ! point.equals(_anchorPoint))
|
|
{
|
|
_anchorPoint = point;
|
|
_anchorPointInPoints = Point(_contentSize.width * _anchorPoint.x, _contentSize.height * _anchorPoint.y );
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
}
|
|
|
|
/// contentSize getter
|
|
const Size& Node::getContentSize() const
|
|
{
|
|
return _contentSize;
|
|
}
|
|
|
|
void Node::setContentSize(const Size & size)
|
|
{
|
|
if ( ! size.equals(_contentSize))
|
|
{
|
|
_contentSize = size;
|
|
|
|
_anchorPointInPoints = Point(_contentSize.width * _anchorPoint.x, _contentSize.height * _anchorPoint.y );
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
}
|
|
|
|
// isRunning getter
|
|
bool Node::isRunning() const
|
|
{
|
|
return _running;
|
|
}
|
|
|
|
/// parent setter
|
|
void Node::setParent(Node * var)
|
|
{
|
|
_parent = var;
|
|
}
|
|
|
|
/// isRelativeAnchorPoint getter
|
|
bool Node::isIgnoreAnchorPointForPosition() const
|
|
{
|
|
return _ignoreAnchorPointForPosition;
|
|
}
|
|
/// isRelativeAnchorPoint setter
|
|
void Node::ignoreAnchorPointForPosition(bool newValue)
|
|
{
|
|
if (newValue != _ignoreAnchorPointForPosition)
|
|
{
|
|
_ignoreAnchorPointForPosition = newValue;
|
|
_transformDirty = _inverseDirty = true;
|
|
}
|
|
}
|
|
|
|
/// tag getter
|
|
int Node::getTag() const
|
|
{
|
|
return _tag;
|
|
}
|
|
|
|
/// tag setter
|
|
void Node::setTag(int var)
|
|
{
|
|
_tag = var;
|
|
}
|
|
|
|
/// userData setter
|
|
void Node::setUserData(void *var)
|
|
{
|
|
_userData = var;
|
|
}
|
|
|
|
int Node::getOrderOfArrival() const
|
|
{
|
|
return _orderOfArrival;
|
|
}
|
|
|
|
void Node::setOrderOfArrival(int orderOfArrival)
|
|
{
|
|
CCASSERT(orderOfArrival >=0, "Invalid orderOfArrival");
|
|
_orderOfArrival = orderOfArrival;
|
|
}
|
|
|
|
void Node::setUserObject(Object *pUserObject)
|
|
{
|
|
CC_SAFE_RETAIN(pUserObject);
|
|
CC_SAFE_RELEASE(_userObject);
|
|
_userObject = pUserObject;
|
|
}
|
|
|
|
void Node::setShaderProgram(GLProgram *pShaderProgram)
|
|
{
|
|
CC_SAFE_RETAIN(pShaderProgram);
|
|
CC_SAFE_RELEASE(_shaderProgram);
|
|
_shaderProgram = pShaderProgram;
|
|
}
|
|
|
|
Rect Node::getBoundingBox() const
|
|
{
|
|
Rect rect = Rect(0, 0, _contentSize.width, _contentSize.height);
|
|
return RectApplyAffineTransform(rect, getNodeToParentTransform());
|
|
}
|
|
|
|
Node * Node::create(void)
|
|
{
|
|
Node * pRet = new Node();
|
|
if (pRet && pRet->init())
|
|
{
|
|
pRet->autorelease();
|
|
}
|
|
else
|
|
{
|
|
CC_SAFE_DELETE(pRet);
|
|
}
|
|
return pRet;
|
|
}
|
|
|
|
void Node::cleanup()
|
|
{
|
|
// actions
|
|
this->stopAllActions();
|
|
this->unscheduleAllSelectors();
|
|
|
|
if ( _scriptType != kScriptTypeNone)
|
|
{
|
|
int action = kNodeOnCleanup;
|
|
BasicScriptData data(this,(void*)&action);
|
|
ScriptEvent scriptEvent(kNodeEvent,(void*)&data);
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->sendEvent(&scriptEvent);
|
|
}
|
|
|
|
// timers
|
|
arrayMakeObjectsPerformSelector(_children, cleanup, Node*);
|
|
}
|
|
|
|
|
|
const char* Node::description() const
|
|
{
|
|
return String::createWithFormat("<Node | Tag = %d>", _tag)->getCString();
|
|
}
|
|
|
|
// lazy allocs
|
|
void Node::childrenAlloc(void)
|
|
{
|
|
_children = Array::createWithCapacity(4);
|
|
_children->retain();
|
|
}
|
|
|
|
Node* Node::getChildByTag(int aTag)
|
|
{
|
|
CCASSERT( aTag != Node::INVALID_TAG, "Invalid tag");
|
|
|
|
if(_children && _children->count() > 0)
|
|
{
|
|
Object* child;
|
|
CCARRAY_FOREACH(_children, child)
|
|
{
|
|
Node* pNode = static_cast<Node*>(child);
|
|
if(pNode && pNode->_tag == aTag)
|
|
return pNode;
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
/* "add" logic MUST only be on this method
|
|
* If a class want's to extend the 'addChild' behavior it only needs
|
|
* to override this method
|
|
*/
|
|
void Node::addChild(Node *child, int zOrder, int tag)
|
|
{
|
|
CCASSERT( child != NULL, "Argument must be non-nil");
|
|
CCASSERT( child->_parent == NULL, "child already added. It can't be added again");
|
|
|
|
if( ! _children )
|
|
{
|
|
this->childrenAlloc();
|
|
}
|
|
|
|
this->insertChild(child, zOrder);
|
|
|
|
child->_tag = tag;
|
|
|
|
child->setParent(this);
|
|
child->setOrderOfArrival(s_globalOrderOfArrival++);
|
|
|
|
if( _running )
|
|
{
|
|
child->onEnter();
|
|
// prevent onEnterTransitionDidFinish to be called twice when a node is added in onEnter
|
|
if (_isTransitionFinished) {
|
|
child->onEnterTransitionDidFinish();
|
|
}
|
|
}
|
|
}
|
|
|
|
void Node::addChild(Node *child, int zOrder)
|
|
{
|
|
CCASSERT( child != NULL, "Argument must be non-nil");
|
|
this->addChild(child, zOrder, child->_tag);
|
|
}
|
|
|
|
void Node::addChild(Node *child)
|
|
{
|
|
CCASSERT( child != NULL, "Argument must be non-nil");
|
|
this->addChild(child, child->_ZOrder, child->_tag);
|
|
}
|
|
|
|
void Node::removeFromParent()
|
|
{
|
|
this->removeFromParentAndCleanup(true);
|
|
}
|
|
|
|
void Node::removeFromParentAndCleanup(bool cleanup)
|
|
{
|
|
if (_parent != NULL)
|
|
{
|
|
_parent->removeChild(this,cleanup);
|
|
}
|
|
}
|
|
|
|
/* "remove" logic MUST only be on this method
|
|
* If a class want's to extend the 'removeChild' behavior it only needs
|
|
* to override this method
|
|
*/
|
|
void Node::removeChild(Node* child, bool cleanup /* = true */)
|
|
{
|
|
// explicit nil handling
|
|
if (_children == NULL)
|
|
{
|
|
return;
|
|
}
|
|
|
|
int index = _children->getIndexOfObject(child);
|
|
if( index != CC_INVALID_INDEX )
|
|
this->detachChild( child, index, cleanup );
|
|
}
|
|
|
|
void Node::removeChildByTag(int tag, bool cleanup/* = true */)
|
|
{
|
|
CCASSERT( tag != Node::INVALID_TAG, "Invalid tag");
|
|
|
|
Node *child = this->getChildByTag(tag);
|
|
|
|
if (child == NULL)
|
|
{
|
|
CCLOG("cocos2d: removeChildByTag(tag = %d): child not found!", tag);
|
|
}
|
|
else
|
|
{
|
|
this->removeChild(child, cleanup);
|
|
}
|
|
}
|
|
|
|
void Node::removeAllChildren()
|
|
{
|
|
this->removeAllChildrenWithCleanup(true);
|
|
}
|
|
|
|
void Node::removeAllChildrenWithCleanup(bool cleanup)
|
|
{
|
|
// not using detachChild improves speed here
|
|
if ( _children && _children->count() > 0 )
|
|
{
|
|
Object* child;
|
|
CCARRAY_FOREACH(_children, child)
|
|
{
|
|
Node* pNode = static_cast<Node*>(child);
|
|
if (pNode)
|
|
{
|
|
// IMPORTANT:
|
|
// -1st do onExit
|
|
// -2nd cleanup
|
|
if(_running)
|
|
{
|
|
pNode->onExitTransitionDidStart();
|
|
pNode->onExit();
|
|
}
|
|
|
|
if (cleanup)
|
|
{
|
|
pNode->cleanup();
|
|
}
|
|
// set parent nil at the end
|
|
pNode->setParent(NULL);
|
|
}
|
|
}
|
|
|
|
_children->removeAllObjects();
|
|
}
|
|
|
|
}
|
|
|
|
void Node::detachChild(Node *child, int childIndex, bool doCleanup)
|
|
{
|
|
// IMPORTANT:
|
|
// -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!
|
|
if (doCleanup)
|
|
{
|
|
child->cleanup();
|
|
}
|
|
|
|
// set parent nil at the end
|
|
child->setParent(NULL);
|
|
|
|
_children->removeObjectAtIndex(childIndex);
|
|
}
|
|
|
|
|
|
// helper used by reorderChild & add
|
|
void Node::insertChild(Node* child, int z)
|
|
{
|
|
_reorderChildDirty = true;
|
|
_children->addObject(child);
|
|
child->_setZOrder(z);
|
|
}
|
|
|
|
void Node::reorderChild(Node *child, int zOrder)
|
|
{
|
|
CCASSERT( child != NULL, "Child must be non-nil");
|
|
_reorderChildDirty = true;
|
|
child->setOrderOfArrival(s_globalOrderOfArrival++);
|
|
child->_setZOrder(zOrder);
|
|
}
|
|
|
|
void Node::sortAllChildren()
|
|
{
|
|
#if 0
|
|
if (_reorderChildDirty)
|
|
{
|
|
int i,j,length = _children->count();
|
|
|
|
// insertion sort
|
|
for(i=1; i<length; i++)
|
|
{
|
|
j = i-1;
|
|
auto tempI = static_cast<Node*>( _children->getObjectAtIndex(i) );
|
|
auto tempJ = static_cast<Node*>( _children->getObjectAtIndex(j) );
|
|
|
|
//continue moving element downwards while zOrder is smaller or when zOrder is the same but mutatedIndex is smaller
|
|
while(j>=0 && ( tempI->_ZOrder < tempJ->_ZOrder || ( tempI->_ZOrder == tempJ->_ZOrder && tempI->_orderOfArrival < tempJ->_orderOfArrival ) ) )
|
|
{
|
|
_children->fastSetObject( tempJ, j+1 );
|
|
j = j-1;
|
|
if(j>=0)
|
|
tempJ = static_cast<Node*>( _children->getObjectAtIndex(j) );
|
|
}
|
|
_children->fastSetObject(tempI, j+1);
|
|
}
|
|
|
|
//don't need to check children recursively, that's done in visit of each child
|
|
|
|
_reorderChildDirty = false;
|
|
}
|
|
#else
|
|
if( _reorderChildDirty ) {
|
|
std::sort( std::begin(*_children), std::end(*_children), nodeComparisonLess );
|
|
_reorderChildDirty = false;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
|
|
void Node::draw()
|
|
{
|
|
//CCASSERT(0);
|
|
// override me
|
|
// Only use- this function to draw your stuff.
|
|
// DON'T draw your stuff outside this method
|
|
}
|
|
|
|
void Node::visit()
|
|
{
|
|
// quick return if not visible. children won't be drawn.
|
|
if (!_visible)
|
|
{
|
|
return;
|
|
}
|
|
kmGLPushMatrix();
|
|
|
|
if (_grid && _grid->isActive())
|
|
{
|
|
_grid->beforeDraw();
|
|
}
|
|
|
|
this->transform();
|
|
int i = 0;
|
|
|
|
if(_children && _children->count() > 0)
|
|
{
|
|
sortAllChildren();
|
|
// draw children zOrder < 0
|
|
for( ; i < _children->count(); i++ )
|
|
{
|
|
auto node = static_cast<Node*>( _children->getObjectAtIndex(i) );
|
|
|
|
if ( node && node->_ZOrder < 0 )
|
|
node->visit();
|
|
else
|
|
break;
|
|
}
|
|
// self draw
|
|
this->draw();
|
|
updateEventPriorityIndex();
|
|
|
|
for( ; i < _children->count(); i++ )
|
|
{
|
|
auto node = static_cast<Node*>( _children->getObjectAtIndex(i) );
|
|
if (node)
|
|
node->visit();
|
|
}
|
|
}
|
|
else
|
|
{
|
|
this->draw();
|
|
updateEventPriorityIndex();
|
|
}
|
|
|
|
// reset for next frame
|
|
_orderOfArrival = 0;
|
|
|
|
if (_grid && _grid->isActive())
|
|
{
|
|
_grid->afterDraw(this);
|
|
}
|
|
|
|
kmGLPopMatrix();
|
|
}
|
|
|
|
void Node::transformAncestors()
|
|
{
|
|
if( _parent != NULL )
|
|
{
|
|
_parent->transformAncestors();
|
|
_parent->transform();
|
|
}
|
|
}
|
|
|
|
void Node::transform()
|
|
{
|
|
kmMat4 transfrom4x4;
|
|
|
|
// Convert 3x3 into 4x4 matrix
|
|
CGAffineToGL(this->getNodeToParentTransform(), transfrom4x4.mat);
|
|
|
|
// Update Z vertex manually
|
|
transfrom4x4.mat[14] = _vertexZ;
|
|
|
|
kmGLMultMatrix( &transfrom4x4 );
|
|
|
|
|
|
// XXX: Expensive calls. Camera should be integrated into the cached affine matrix
|
|
if ( _camera != NULL && !(_grid != NULL && _grid->isActive()) )
|
|
{
|
|
bool translate = (_anchorPointInPoints.x != 0.0f || _anchorPointInPoints.y != 0.0f);
|
|
|
|
if( translate )
|
|
kmGLTranslatef(RENDER_IN_SUBPIXEL(_anchorPointInPoints.x), RENDER_IN_SUBPIXEL(_anchorPointInPoints.y), 0 );
|
|
|
|
_camera->locate();
|
|
|
|
if( translate )
|
|
kmGLTranslatef(RENDER_IN_SUBPIXEL(-_anchorPointInPoints.x), RENDER_IN_SUBPIXEL(-_anchorPointInPoints.y), 0 );
|
|
}
|
|
|
|
}
|
|
|
|
|
|
void Node::onEnter()
|
|
{
|
|
_isTransitionFinished = false;
|
|
|
|
arrayMakeObjectsPerformSelector(_children, onEnter, Node*);
|
|
|
|
this->resumeSchedulerAndActions();
|
|
|
|
_running = true;
|
|
|
|
if (_scriptType != kScriptTypeNone)
|
|
{
|
|
int action = kNodeOnEnter;
|
|
BasicScriptData data(this,(void*)&action);
|
|
ScriptEvent scriptEvent(kNodeEvent,(void*)&data);
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->sendEvent(&scriptEvent);
|
|
}
|
|
}
|
|
|
|
void Node::onEnterTransitionDidFinish()
|
|
{
|
|
_isTransitionFinished = true;
|
|
|
|
arrayMakeObjectsPerformSelector(_children, onEnterTransitionDidFinish, Node*);
|
|
|
|
if (_scriptType != kScriptTypeNone)
|
|
{
|
|
int action = kNodeOnEnterTransitionDidFinish;
|
|
BasicScriptData data(this,(void*)&action);
|
|
ScriptEvent scriptEvent(kNodeEvent,(void*)&data);
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->sendEvent(&scriptEvent);
|
|
}
|
|
}
|
|
|
|
void Node::onExitTransitionDidStart()
|
|
{
|
|
arrayMakeObjectsPerformSelector(_children, onExitTransitionDidStart, Node*);
|
|
if (_scriptType != kScriptTypeNone)
|
|
{
|
|
int action = kNodeOnExitTransitionDidStart;
|
|
BasicScriptData data(this,(void*)&action);
|
|
ScriptEvent scriptEvent(kNodeEvent,(void*)&data);
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->sendEvent(&scriptEvent);
|
|
}
|
|
}
|
|
|
|
void Node::onExit()
|
|
{
|
|
this->pauseSchedulerAndActions();
|
|
|
|
_running = false;
|
|
if (_scriptType != kScriptTypeNone)
|
|
{
|
|
int action = kNodeOnExit;
|
|
BasicScriptData data(this,(void*)&action);
|
|
ScriptEvent scriptEvent(kNodeEvent,(void*)&data);
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->sendEvent(&scriptEvent);
|
|
}
|
|
|
|
arrayMakeObjectsPerformSelector(_children, onExit, Node*);
|
|
|
|
removeAllEventListeners();
|
|
}
|
|
|
|
void Node::setActionManager(ActionManager* actionManager)
|
|
{
|
|
if( actionManager != _actionManager ) {
|
|
this->stopAllActions();
|
|
CC_SAFE_RETAIN(actionManager);
|
|
CC_SAFE_RELEASE(_actionManager);
|
|
_actionManager = actionManager;
|
|
}
|
|
}
|
|
|
|
Action * Node::runAction(Action* action)
|
|
{
|
|
CCASSERT( action != NULL, "Argument must be non-nil");
|
|
_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)
|
|
{
|
|
CCASSERT( tag != Action::INVALID_TAG, "Invalid tag");
|
|
_actionManager->removeActionByTag(tag, this);
|
|
}
|
|
|
|
Action * Node::getActionByTag(int tag)
|
|
{
|
|
CCASSERT( tag != Action::INVALID_TAG, "Invalid tag");
|
|
return _actionManager->getActionByTag(tag, this);
|
|
}
|
|
|
|
unsigned int Node::getNumberOfRunningActions() const
|
|
{
|
|
return _actionManager->getNumberOfRunningActionsInTarget(this);
|
|
}
|
|
|
|
// Node - Callbacks
|
|
|
|
void Node::setScheduler(Scheduler* scheduler)
|
|
{
|
|
if( scheduler != _scheduler ) {
|
|
this->unscheduleAllSelectors();
|
|
CC_SAFE_RETAIN(scheduler);
|
|
CC_SAFE_RELEASE(_scheduler);
|
|
_scheduler = scheduler;
|
|
}
|
|
}
|
|
|
|
bool Node::isScheduled(SEL_SCHEDULE selector)
|
|
{
|
|
return _scheduler->isScheduledForTarget(selector, this);
|
|
}
|
|
|
|
void Node::scheduleUpdate()
|
|
{
|
|
scheduleUpdateWithPriority(0);
|
|
}
|
|
|
|
void Node::scheduleUpdateWithPriority(int priority)
|
|
{
|
|
_scheduler->scheduleUpdateForTarget(this, priority, !_running);
|
|
}
|
|
|
|
void Node::scheduleUpdateWithPriorityLua(int nHandler, int priority)
|
|
{
|
|
unscheduleUpdate();
|
|
_updateScriptHandler = nHandler;
|
|
_scheduler->scheduleUpdateForTarget(this, priority, !_running);
|
|
}
|
|
|
|
void Node::unscheduleUpdate()
|
|
{
|
|
_scheduler->unscheduleUpdateForTarget(this);
|
|
if (_updateScriptHandler)
|
|
{
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->removeScriptHandler(_updateScriptHandler);
|
|
_updateScriptHandler = 0;
|
|
}
|
|
}
|
|
|
|
void Node::schedule(SEL_SCHEDULE selector)
|
|
{
|
|
this->schedule(selector, 0.0f, kRepeatForever, 0.0f);
|
|
}
|
|
|
|
void Node::schedule(SEL_SCHEDULE selector, float interval)
|
|
{
|
|
this->schedule(selector, interval, kRepeatForever, 0.0f);
|
|
}
|
|
|
|
void Node::schedule(SEL_SCHEDULE selector, float interval, unsigned int repeat, float delay)
|
|
{
|
|
CCASSERT( selector, "Argument must be non-nil");
|
|
CCASSERT( interval >=0, "Argument must be positive");
|
|
|
|
_scheduler->scheduleSelector(selector, this, interval , repeat, delay, !_running);
|
|
}
|
|
|
|
void Node::scheduleOnce(SEL_SCHEDULE selector, float delay)
|
|
{
|
|
this->schedule(selector, 0.0f, 0, delay);
|
|
}
|
|
|
|
void Node::unschedule(SEL_SCHEDULE selector)
|
|
{
|
|
// explicit nil handling
|
|
if (selector == 0)
|
|
return;
|
|
|
|
_scheduler->unscheduleSelector(selector, this);
|
|
}
|
|
|
|
void Node::unscheduleAllSelectors()
|
|
{
|
|
_scheduler->unscheduleAllForTarget(this);
|
|
}
|
|
|
|
void Node::resumeSchedulerAndActions()
|
|
{
|
|
_scheduler->resumeTarget(this);
|
|
_actionManager->resumeTarget(this);
|
|
}
|
|
|
|
void Node::pauseSchedulerAndActions()
|
|
{
|
|
_scheduler->pauseTarget(this);
|
|
_actionManager->pauseTarget(this);
|
|
}
|
|
|
|
// override me
|
|
void Node::update(float fDelta)
|
|
{
|
|
if (0 != _updateScriptHandler)
|
|
{
|
|
//only lua use
|
|
SchedulerScriptData data(_updateScriptHandler,fDelta);
|
|
ScriptEvent event(kScheduleEvent,&data);
|
|
ScriptEngineManager::getInstance()->getScriptEngine()->sendEvent(&event);
|
|
}
|
|
|
|
if (_componentContainer && !_componentContainer->isEmpty())
|
|
{
|
|
_componentContainer->visit(fDelta);
|
|
}
|
|
}
|
|
|
|
const AffineTransform& Node::getNodeToParentTransform() const
|
|
{
|
|
if (_transformDirty)
|
|
{
|
|
|
|
// Translate values
|
|
float x = _position.x;
|
|
float y = _position.y;
|
|
|
|
if (_ignoreAnchorPointForPosition)
|
|
{
|
|
x += _anchorPointInPoints.x;
|
|
y += _anchorPointInPoints.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
|
|
float cx = 1, sx = 0, cy = 1, sy = 0;
|
|
if (_rotationX || _rotationY)
|
|
{
|
|
float radiansX = -CC_DEGREES_TO_RADIANS(_rotationX);
|
|
float radiansY = -CC_DEGREES_TO_RADIANS(_rotationY);
|
|
cx = cosf(radiansX);
|
|
sx = sinf(radiansX);
|
|
cy = cosf(radiansY);
|
|
sy = sinf(radiansY);
|
|
}
|
|
|
|
bool needsSkewMatrix = ( _skewX || _skewY );
|
|
|
|
|
|
// optimization:
|
|
// inline anchor point calculation if skew is not needed
|
|
// Adjusted transform calculation for rotational skew
|
|
if (! needsSkewMatrix && !_anchorPointInPoints.equals(Point::ZERO))
|
|
{
|
|
x += cy * -_anchorPointInPoints.x * _scaleX + -sx * -_anchorPointInPoints.y * _scaleY;
|
|
y += sy * -_anchorPointInPoints.x * _scaleX + cx * -_anchorPointInPoints.y * _scaleY;
|
|
}
|
|
|
|
|
|
// Build Transform Matrix
|
|
// Adjusted transform calculation for rotational skew
|
|
_transform = AffineTransformMake( cy * _scaleX, sy * _scaleX,
|
|
-sx * _scaleY, cx * _scaleY,
|
|
x, y );
|
|
|
|
// XXX: Try to inline skew
|
|
// If skew is needed, apply skew and then anchor point
|
|
if (needsSkewMatrix)
|
|
{
|
|
AffineTransform skewMatrix = AffineTransformMake(1.0f, tanf(CC_DEGREES_TO_RADIANS(_skewY)),
|
|
tanf(CC_DEGREES_TO_RADIANS(_skewX)), 1.0f,
|
|
0.0f, 0.0f );
|
|
_transform = AffineTransformConcat(skewMatrix, _transform);
|
|
|
|
// adjust anchor point
|
|
if (!_anchorPointInPoints.equals(Point::ZERO))
|
|
{
|
|
_transform = AffineTransformTranslate(_transform, -_anchorPointInPoints.x, -_anchorPointInPoints.y);
|
|
}
|
|
}
|
|
|
|
if (_additionalTransformDirty)
|
|
{
|
|
_transform = AffineTransformConcat(_transform, _additionalTransform);
|
|
_additionalTransformDirty = false;
|
|
}
|
|
|
|
_transformDirty = false;
|
|
}
|
|
|
|
return _transform;
|
|
}
|
|
|
|
void Node::setAdditionalTransform(const AffineTransform& additionalTransform)
|
|
{
|
|
_additionalTransform = additionalTransform;
|
|
_transformDirty = true;
|
|
_additionalTransformDirty = true;
|
|
}
|
|
|
|
const AffineTransform& Node::getParentToNodeTransform() const
|
|
{
|
|
if ( _inverseDirty ) {
|
|
_inverse = AffineTransformInvert(this->getNodeToParentTransform());
|
|
_inverseDirty = false;
|
|
}
|
|
|
|
return _inverse;
|
|
}
|
|
|
|
AffineTransform Node::getNodeToWorldTransform() const
|
|
{
|
|
AffineTransform t = this->getNodeToParentTransform();
|
|
|
|
for (Node *p = _parent; p != NULL; p = p->getParent())
|
|
t = AffineTransformConcat(t, p->getNodeToParentTransform());
|
|
|
|
return t;
|
|
}
|
|
|
|
AffineTransform Node::getWorldToNodeTransform() const
|
|
{
|
|
return AffineTransformInvert(this->getNodeToWorldTransform());
|
|
}
|
|
|
|
Point Node::convertToNodeSpace(const Point& worldPoint) const
|
|
{
|
|
Point ret = PointApplyAffineTransform(worldPoint, getWorldToNodeTransform());
|
|
return ret;
|
|
}
|
|
|
|
Point Node::convertToWorldSpace(const Point& nodePoint) const
|
|
{
|
|
Point ret = PointApplyAffineTransform(nodePoint, getNodeToWorldTransform());
|
|
return ret;
|
|
}
|
|
|
|
Point Node::convertToNodeSpaceAR(const Point& worldPoint) const
|
|
{
|
|
Point nodePoint = convertToNodeSpace(worldPoint);
|
|
return nodePoint - _anchorPointInPoints;
|
|
}
|
|
|
|
Point Node::convertToWorldSpaceAR(const Point& nodePoint) const
|
|
{
|
|
Point pt = nodePoint + _anchorPointInPoints;
|
|
return convertToWorldSpace(pt);
|
|
}
|
|
|
|
Point Node::convertToWindowSpace(const Point& nodePoint) const
|
|
{
|
|
Point worldPoint = this->convertToWorldSpace(nodePoint);
|
|
return Director::getInstance()->convertToUI(worldPoint);
|
|
}
|
|
|
|
// convenience methods which take a Touch instead of Point
|
|
Point Node::convertTouchToNodeSpace(Touch *touch) const
|
|
{
|
|
Point point = touch->getLocation();
|
|
return this->convertToNodeSpace(point);
|
|
}
|
|
Point Node::convertTouchToNodeSpaceAR(Touch *touch) const
|
|
{
|
|
Point point = touch->getLocation();
|
|
return this->convertToNodeSpaceAR(point);
|
|
}
|
|
|
|
void Node::updateTransform()
|
|
{
|
|
// Recursively iterate over children
|
|
arrayMakeObjectsPerformSelector(_children, updateTransform, Node*);
|
|
}
|
|
|
|
Component* Node::getComponent(const char *pName)
|
|
{
|
|
if( _componentContainer )
|
|
return _componentContainer->get(pName);
|
|
return nullptr;
|
|
}
|
|
|
|
bool Node::addComponent(Component *pComponent)
|
|
{
|
|
// lazy alloc
|
|
if( !_componentContainer )
|
|
_componentContainer = new ComponentContainer(this);
|
|
return _componentContainer->add(pComponent);
|
|
}
|
|
|
|
bool Node::removeComponent(const char *pName)
|
|
{
|
|
if( _componentContainer )
|
|
return _componentContainer->remove(pName);
|
|
return false;
|
|
}
|
|
|
|
void Node::removeAllComponents()
|
|
{
|
|
if( _componentContainer )
|
|
_componentContainer->removeAll();
|
|
}
|
|
|
|
void Node::resetEventPriorityIndex()
|
|
{
|
|
_globalEventPriorityIndex = 0;
|
|
}
|
|
|
|
void Node::associateEventListener(EventListener* listener)
|
|
{
|
|
_eventlisteners.insert(listener);
|
|
}
|
|
|
|
void Node::dissociateEventListener(EventListener* listener)
|
|
{
|
|
_eventlisteners.erase(listener);
|
|
}
|
|
|
|
void Node::removeAllEventListeners()
|
|
{
|
|
auto dispatcher = EventDispatcher::getInstance();
|
|
|
|
for (auto& listener : _eventlisteners)
|
|
{
|
|
dispatcher->removeEventListener(listener);
|
|
}
|
|
}
|
|
|
|
void Node::setDirtyForAllEventListeners()
|
|
{
|
|
auto dispatcher = EventDispatcher::getInstance();
|
|
|
|
for (auto& listener : _eventlisteners)
|
|
{
|
|
dispatcher->setDirtyForEventType(listener->type, true);
|
|
}
|
|
}
|
|
|
|
// NodeRGBA
|
|
NodeRGBA::NodeRGBA()
|
|
: _displayedOpacity(255)
|
|
, _realOpacity(255)
|
|
, _displayedColor(Color3B::WHITE)
|
|
, _realColor(Color3B::WHITE)
|
|
, _cascadeColorEnabled(false)
|
|
, _cascadeOpacityEnabled(false)
|
|
{}
|
|
|
|
NodeRGBA::~NodeRGBA() {}
|
|
|
|
bool NodeRGBA::init()
|
|
{
|
|
if (Node::init())
|
|
{
|
|
_displayedOpacity = _realOpacity = 255;
|
|
_displayedColor = _realColor = Color3B::WHITE;
|
|
_cascadeOpacityEnabled = _cascadeColorEnabled = false;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
GLubyte NodeRGBA::getOpacity(void) const
|
|
{
|
|
return _realOpacity;
|
|
}
|
|
|
|
GLubyte NodeRGBA::getDisplayedOpacity(void) const
|
|
{
|
|
return _displayedOpacity;
|
|
}
|
|
|
|
void NodeRGBA::setOpacity(GLubyte opacity)
|
|
{
|
|
_displayedOpacity = _realOpacity = opacity;
|
|
|
|
if (_cascadeOpacityEnabled)
|
|
{
|
|
GLubyte parentOpacity = 255;
|
|
RGBAProtocol* pParent = dynamic_cast<RGBAProtocol*>(_parent);
|
|
if (pParent && pParent->isCascadeOpacityEnabled())
|
|
{
|
|
parentOpacity = pParent->getDisplayedOpacity();
|
|
}
|
|
this->updateDisplayedOpacity(parentOpacity);
|
|
}
|
|
}
|
|
|
|
void NodeRGBA::updateDisplayedOpacity(GLubyte parentOpacity)
|
|
{
|
|
_displayedOpacity = _realOpacity * parentOpacity/255.0;
|
|
|
|
if (_cascadeOpacityEnabled)
|
|
{
|
|
Object* pObj;
|
|
CCARRAY_FOREACH(_children, pObj)
|
|
{
|
|
RGBAProtocol* item = dynamic_cast<RGBAProtocol*>(pObj);
|
|
if (item)
|
|
{
|
|
item->updateDisplayedOpacity(_displayedOpacity);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
bool NodeRGBA::isCascadeOpacityEnabled(void) const
|
|
{
|
|
return _cascadeOpacityEnabled;
|
|
}
|
|
|
|
void NodeRGBA::setCascadeOpacityEnabled(bool cascadeOpacityEnabled)
|
|
{
|
|
_cascadeOpacityEnabled = cascadeOpacityEnabled;
|
|
}
|
|
|
|
const Color3B& NodeRGBA::getColor(void) const
|
|
{
|
|
return _realColor;
|
|
}
|
|
|
|
const Color3B& NodeRGBA::getDisplayedColor() const
|
|
{
|
|
return _displayedColor;
|
|
}
|
|
|
|
void NodeRGBA::setColor(const Color3B& color)
|
|
{
|
|
_displayedColor = _realColor = color;
|
|
|
|
if (_cascadeColorEnabled)
|
|
{
|
|
Color3B parentColor = Color3B::WHITE;
|
|
RGBAProtocol *parent = dynamic_cast<RGBAProtocol*>(_parent);
|
|
if (parent && parent->isCascadeColorEnabled())
|
|
{
|
|
parentColor = parent->getDisplayedColor();
|
|
}
|
|
|
|
updateDisplayedColor(parentColor);
|
|
}
|
|
}
|
|
|
|
void NodeRGBA::updateDisplayedColor(const Color3B& parentColor)
|
|
{
|
|
_displayedColor.r = _realColor.r * parentColor.r/255.0;
|
|
_displayedColor.g = _realColor.g * parentColor.g/255.0;
|
|
_displayedColor.b = _realColor.b * parentColor.b/255.0;
|
|
|
|
if (_cascadeColorEnabled)
|
|
{
|
|
Object *obj = NULL;
|
|
CCARRAY_FOREACH(_children, obj)
|
|
{
|
|
RGBAProtocol *item = dynamic_cast<RGBAProtocol*>(obj);
|
|
if (item)
|
|
{
|
|
item->updateDisplayedColor(_displayedColor);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
bool NodeRGBA::isCascadeColorEnabled(void) const
|
|
{
|
|
return _cascadeColorEnabled;
|
|
}
|
|
|
|
void NodeRGBA::setCascadeColorEnabled(bool cascadeColorEnabled)
|
|
{
|
|
_cascadeColorEnabled = cascadeColorEnabled;
|
|
}
|
|
|
|
NS_CC_END
|