Method addChildHelper

core/2d/ParticleBatchNode.cpp:233–260

don't use lazy sorting, reordering the particle systems quads afterwards would be too complex FIXME: research whether lazy sorting + freeing current quads and calloc a new block with size of capacity would be faster FIXME: or possibly using vertexZ for reordering, that would be fastest this helper is almost equivalent to Node's addChild, but doesn't make use of the lazy sorting

// FIXME: or possibly using vertexZ for reordering, that would be fastest
// this helper is almost equivalent to Node's addChild, but doesn't make use of the lazy sorting
int ParticleBatchNode::addChildHelper(ParticleSystem* child, int z, int aTag, std::string_view name, bool setTag)
{
    AXASSERT(child != nullptr, "Argument must be non-nil");
    AXASSERT(child->getParent() == nullptr, "child already added. It can't be added again");

    _children.reserve(4);

    // don't use a lazy insert
    auto pos = searchNewPositionInChildrenForZ(z);

    _children.insert(pos, child);

    if (setTag)
        child->setTag(aTag);
    else
        child->setName(name);

    child->setLocalZOrder(z);

    child->setParent(this);

    if (_running)
    {
        child->onEnter();
        child->onEnterTransitionDidFinish();
    }
    return pos;
}

// Reorder will be done in this function, no "lazy" reorder to particles
void ParticleBatchNode::reorderChild(Node* aChild, int zOrder)