Class AbsBehaviorTree

bt_editor/bt_editor_base.h:89–133

};

class AbsBehaviorTree
{
public:

    typedef std::deque<AbstractTreeNode> NodesVector;

    AbsBehaviorTree() {}

    ~AbsBehaviorTree();

    size_t nodesCount() const {
        return _nodes.size();
    }

    const NodesVector& nodes() const { return _nodes; }

    NodesVector& nodes() { return _nodes; }

    const AbstractTreeNode* node(size_t index) const { return &_nodes.at(index); }

    AbstractTreeNode* node(size_t index) { return &_nodes.at(index); }

    AbstractTreeNode* rootNode();

    const AbstractTreeNode* rootNode() const;

    std::vector<const AbstractTreeNode*> findNodes(const QString& instance_name);

    const AbstractTreeNode* findFirstNode(const QString& instance_name);

    AbstractTreeNode* addNode(AbstractTreeNode* parent, AbstractTreeNode &&new_node );

    void debugPrint() const;

    bool operator ==(const AbsBehaviorTree &other) const;

    bool operator !=(const AbsBehaviorTree &other) const{
        return !(*this == other);
    }

    void clear();

private:
    NodesVector _nodes;
};

static int GetUID()
{