rbmatlab  1.16.09
 All Classes Namespaces Files Functions Variables Modules Pages
IdMapNode.m
1 classdef IdMapNode < Greedy.DataTree.Detailed.INode & DataTree.IdMapNode
2  % specialization of detailed data tree node with an id map for its children
3 
4  methods
5  function imddn = IdMapNode(idmap)
6  % function imddn = IdMapNode(idmap)
7  % constructor
8  imddn = imddn@DataTree.IdMapNode(idmap, 0);
9  end
10 
11 % function active_leaf = get_active_leaf(this, rmodel)
12 % candidate = get(this, 1);
13 % if isa(candidate, 'DataTree.DummyLeafNode')
14 % active_leaf = get(candidate, 1);
15 % else
16 % active_leaf = get_active_leaf(candidate, rmodel);
17 % end
18 % end
19 
20  function siz = get_rb_size(this)
21  rb_index = get_by_description(this, 'rb');
22  if isempty(rb_index)
23  siz = -1;
24  else
25  siz = get_rb_size(rb_index);
26  end
27  end
28 
29  function siz = get_ei_size(this)
30  siz = DataTree.IdMapNode(this.idmap, 0);
31  for i = 1:length(this)
32  set(siz, i, get_ei_size(get(this,i)));
33  end
34  end
35 
36  function [ot1, ot2, ot3] = offtime(this, rmodel)
37  [ot1, ot2, ot3] = offtime(this.values{1}, rmodel);
38  [ot3, temp, temp2] = offtime(this.values{2}, rmodel);
39  end
40  end
41 
42 end
DataTree implementation for generated detailed and reduced data
Definition: DuneRBLeafNode.m:2
Data Tree element which can be filtered by ids
Definition: IdMapNode.m:18
DataTree specialization for detailed data generated by a Greedy algorithm instance.
Definition: DuneRBLeafNode.m:3
specialization of detailed data tree node with an id map for its children
Definition: IdMapNode.m:20
Interface class for general data tree nodes storing detailed data returned by Greedy.Interface.gen_detailed_data()
Definition: INode.m:20
Customizable implementation of an abstract greedy algorithm.
Definition: DuneRBLeafNode.m:1