2 % specialization of detailed data tree node with an
id map
for its children
5 function imddn = IdMapNode(idmap)
6 %
function imddn = IdMapNode(idmap)
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);
16 % active_leaf = get_active_leaf(candidate, rmodel);
20 function siz = get_rb_size(
this)
21 rb_index = get_by_description(this, 'rb');
25 siz = get_rb_size(rb_index);
29 function siz = get_ei_size(this)
31 for i = 1:length(this)
32 set(siz, i, get_ei_size(get(this,i)));
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);
DataTree implementation for generated detailed and reduced data
Data Tree element which can be filtered by ids
DataTree specialization for detailed data generated by a Greedy algorithm instance.
specialization of detailed data tree node with an id map for its children
Interface class for general data tree nodes storing detailed data returned by Greedy.Interface.gen_detailed_data()
Customizable implementation of an abstract greedy algorithm.