rbmatlab  1.16.09
 All Classes Namespaces Files Functions Variables Modules Pages
IdMapNode.m
1 classdef IdMapNode < IReducedData & DataTree.IdMapNode
2 
3  methods
4 
5  function imn = IdMapNode(idmap, initvalues)
6 
7  if nargin <= 1
8  initvalues = [];
9  end
10 
11  imn = imn@DataTree.IdMapNode(idmap, initvalues);
12  end
13 
14  function yesno = needs_subset_copy(this, rmodel)
15  yesno = false;
16  for i = 1:length(this)
17  child = get(this, i);
18  yesno = yesno & needs_subset_copy(child, rmodel);
19  end
20  end
21 
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);
27  end
28  subset_reduced_data = Greedy.DataTree.Reduced.IdMapNode(this.idmap, children);
29  else
30  subset_reduced_data = this;
31  end
32  end
33 
34  function conds = get_conds(this)
35  conds = create_tree(this, DataTree.ScalarCreator(@(X) get_conds(X)));
36  end
37  end
38 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 reduced data constructed out of Greedy.DataTree.Detailed instances...
Definition: IdMapNode.m:3
Customizable implementation of an abstract greedy algorithm.
Definition: DuneRBLeafNode.m:1
Interface class for the generation and storage of offline matrices and vectors as described in Module...
Definition: IReducedData.m:17