InfoNode.m

classdef InfoNode < Greedy.DataTree.Detailed.INode
  % very simple detailed data tree node with only one child
  %
  % @todo Do I need it? If yes, document it.

  properties
    % handle to the only child
    child;

    % a descriptive name for the node
    name;
  end

  methods

    function ddin = InfoNode(child, name)
      % constructor for this node
      ddin.child = child;
      ddin.name  = name;
    end

    function siz = get_rb_size(this)
      siz = get_rb_size(this.child);
    end

    function siz = get_ei_size(this)
      siz = get_ei_size(this.child);
    end

    function data     = get(this, index)
      if index == 1
        data = this.child;
      else
        error('index exceeds dimensions');
      end
    end

    function [ot1, ot2, ot3] = offtime(this, rmodel)

      ot1 = 0;
      ot2 = 0;
      ot3 = 0;
    end

    function index    = get_index(this, id, mu, nt)
      index = [1, get_index(this.child, id, mu, nt)];
    end

    function tree     = create_tree(this, creator, ids, mu_cube, tslice, basepath)
      % function tree = create_tree(this, creator, ids, mu_cube, tslice, basepath)
      % @copybrief DataTreeINodecreate_tree()
      %
      % @copydetails DataTreeINodecreate_tree()
      %

      if nargin < 3
        ids = [];
      end
      if nargin < 4
        mu_cube = [];
      end
      if nargin < 5
        tslice = [];
      end
      if nargin < 6
        basepath = [];
      end

      tree = create_tree(this.child, creator, ids, mu_cube, tslice, [basepath,1]);
    end

    function children = length(this)
      children = 1;
    end

    function this     = set(this, index, value)
      assert(index == 1);
      this.child = value;
    end
  end
end