tb_node_tree.h

// ================================================================================
// ==      This file is a part of Turbo Badger. (C) 2011-2014, Emil Segerås      ==
// ==                     See tb_core.h for more information.                    ==
// ================================================================================

#ifndef TB_NODE_TREE_H
#define TB_NODE_TREE_H

#include "parser/tb_parser.h"
#include "tb_linklist.h"

namespace tb {

enum TB_NODE_READ_FLAGS {
    TB_NODE_READ_FLAGS_NONE = 0,
    TB_NODE_READ_FLAGS_APPEND = 1,
};
MAKE_ENUM_FLAG_COMBO(TB_NODE_READ_FLAGS);

class TBNode : public TBLinkOf<TBNode>
{
public:
    TBNode() : m_name(nullptr), m_parent(nullptr), m_cycle_id(0) {}
    ~TBNode();

    static TBNode *Create(TBStr name);

    bool ReadFile(const TBStr & filename, TB_NODE_READ_FLAGS flags = TB_NODE_READ_FLAGS_NONE);

    void ReadData(const char *data, TB_NODE_READ_FLAGS flags = TB_NODE_READ_FLAGS_NONE);

    void ReadData(const char *data, int data_len, TB_NODE_READ_FLAGS flags = TB_NODE_READ_FLAGS_NONE);

    void Clear();

    bool WriteFile(const TBStr & filename);

    bool WriteNode(TBStr & str, int depth = 0);

    void Add(TBNode *n) { m_children.AddLast(n); n->m_parent = this; }

    void AddBefore(TBNode *n, TBNode *reference) { m_children.AddBefore(n, reference); n->m_parent = this; }

    void AddAfter(TBNode *n, TBNode *reference) { m_children.AddAfter(n, reference); n->m_parent = this; }

    void Remove(TBNode *n) { m_children.Remove(n); n->m_parent = nullptr; }

    void Delete(TBNode *n) { m_children.Delete(n); }

    bool CloneChildren(TBNode *source);

    enum GET_MISS_POLICY {
        GET_MISS_POLICY_NULL,
        GET_MISS_POLICY_CREATE
    };

    TBNode *GetNode(const char *request, GET_MISS_POLICY mp = GET_MISS_POLICY_NULL);

    const TBStr & GetName() const { return m_name; }

    TBValue &GetValue() { return m_value; }

    TBValue &GetValueFollowRef();

    int GetValueInt(const char *request, int def);

    float GetValueFloat(const char *request, float def);

    TBStr GetValueString(const char *request, const char *def);

    TBStr GetValueStringRaw(const char *request, const char *def);

    static const char *GetNextNodeSeparator(const char *request);

    inline TBNode *GetParent() const { return m_parent; }
    inline TBNode *GetFirstChild() const { return m_children.GetFirst(); }
    inline TBNode *GetLastChild() const { return m_children.GetLast(); }
private:
friend class TBNodeTarget;
friend class TBNodeRefTree;
    TBNode *GetNodeFollowRef(const char *request,
                            GET_MISS_POLICY mp = GET_MISS_POLICY_NULL);
    TBNode *GetNodeInternal(const char *name, int name_len) const;
    TBStr m_name;
    TBValue m_value;
    TBLinkListOf<TBNode> m_children;
    TBNode *m_parent;
    uint32_t m_cycle_id;    
};

} // namespace tb

#endif // TB_NODE_TREE_H