TreeMachineNode.h

Go to the documentation of this file.

/*
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 3 of the License, or
 * (at your option) any later version.
 *
 * Written (W) 2012 Chiyuan Zhang
 * Copyright (C) 2012 Chiyuan Zhang
 */

#ifndef TREEMACHINENODE_H__
#define TREEMACHINENODE_H__

#include <shogun/base/SGObject.h>
#include <shogun/base/Parameter.h>

namespace shogun
{

template <typename T>
class CTreeMachineNode
    : public CSGObject
{
public:
    CTreeMachineNode()
        :m_left(NULL), m_right(NULL), m_parent(NULL), m_machine(-1)
    {
        SG_ADD((CSGObject**)&m_left,"m_left", "Left subtree", MS_NOT_AVAILABLE);
        SG_ADD((CSGObject**)&m_right,"m_right", "Right subtree", MS_NOT_AVAILABLE);
        SG_ADD((CSGObject**)&m_parent,"m_parent", "Parent node", MS_NOT_AVAILABLE);
        SG_ADD(&m_machine,"m_machine", "Index of associated machine", MS_NOT_AVAILABLE);
    }


    virtual ~CTreeMachineNode()
    {
        SG_UNREF(m_left);
        SG_UNREF(m_right);
    }

    virtual const char* get_name() const { return "TreeMachineNode"; }

    void machine(int32_t idx)
    {
        m_machine = idx;
    }
    int32_t machine()
    {
        return m_machine;
    }

    void parent(CTreeMachineNode *par)
    {
        m_parent = par;
    }
    CTreeMachineNode *parent()
    {
        return m_parent;
    }

    void left(CTreeMachineNode *l)
    {
        SG_REF(l);
        SG_UNREF(m_left);
        m_left = l;
        m_left->parent(this);
    }
    CTreeMachineNode *left()
    {
        return m_left;
    }

    void right(CTreeMachineNode *r)
    {
        SG_REF(r);
        SG_UNREF(m_right);
        m_right = r;
        m_right->parent(this);
    }
    CTreeMachineNode *right()
    {
        return m_right;
    }

    T data;

    typedef void (*data_print_func_t) (const T&);
    void debug_print(data_print_func_t data_print_func)
    {
        debug_print_impl(data_print_func, this, 0);
    }

private:
    CTreeMachineNode *m_left;    
    CTreeMachineNode *m_right;   
    CTreeMachineNode *m_parent;  
    int32_t           m_machine; 

    static void debug_print_impl(data_print_func_t data_print_func, CTreeMachineNode<T> *node, int32_t depth)
    {
        for (int32_t i=0; i < depth; ++i)
            SG_SPRINT("  ");
        data_print_func(node->data);
        if (node->left())
            debug_print_impl(data_print_func, node->left(), depth+1);
        if (node->right())
            debug_print_impl(data_print_func, node->right(), depth+1);
    }
};

} /* shogun */ 

#endif /* end of include guard: TREEMACHINENODE_H__ */