5 function imn =
IdMapNode(idmap, initvalues)
14 function yesno = needs_subset_copy(this, rmodel)
16 for i = 1:length(this)
18 yesno = yesno & needs_subset_copy(child, rmodel);
22 function subset_reduced_data = extract_reduced_data_subset(this, rmodel)
23 if needs_subset_copy(this, rmodel)
24 children = cell(1, length(this));
25 for i = 1:length(this)
26 children{i} = extract_reduced_data_subset(
get(
this, i), rmodel);
30 subset_reduced_data =
this;
34 function conds = get_conds(
this)
35 conds = create_tree(this,
DataTree.ScalarCreator(@(X) get_conds(X)));
DataTree implementation for generated detailed and reduced data
Data Tree element which can be filtered by ids
DataTree specialization for reduced data constructed out of Greedy.DataTree.Detailed instances...
Customizable implementation of an abstract greedy algorithm.
Interface class for the generation and storage of offline matrices and vectors as described in Module...