1 classdef ILeafNode < DataTree.INode
2 % Interface
for a
leaf node of a data tree
7 function children = length(dummy)
8 %
function children = length(dummy)
11 % Default implementation
18 function index = get_index(dummy1, dummy2, dummy3, dummy)
19 %
function index = get_index(dummy1, dummy2, dummy3, dummy)
22 % Default implementation
29 %
function index = get_path_index(dummy1, dummy2, dummy3, dummy)
30 % %
function index = get_path_index(dummy1, dummy2, dummy3, dummy)
31 % % @copybrief DataTree.INode.get_path_index()
33 % % Default implementation
40 function this =
set(dummy1, dummy2, value)
41 %
function this =
set(dummy1, dummy2, value)
44 % Default implementation
47 % value:
object of type .DataTree.INode which replaces the
leaf node with a
51 %
this: reference to newly
set data node
55 function data =
get(
this, index)
56 %
function data =
get(
this, index)
59 % Default implementation
62 % index: the index needs to be empty.
65 % data: returns
this data
leaf node
66 assert( isempty(index) );
70 function node = get_active_leaf(
this, model,
id)
71 %
function node = get_active_leaf(
this, model,
id)
77 % model: of type DataTree.IModel
80 % node: of type .DataTree.ILeafNode
82 % Required fields of model:
83 % descr:
ModelDescr object speciyfing the problem discretization.
88 function tree = create_tree(
this, creator, ids, mu_cube, tslice, basepath)
89 %
function tree = create_tree(
this, creator, ids, mu_cube, tslice, basepath)
95 % method of the
'creator' argument.
107 tree = create_leaf_node(creator,
this, basepath, mu_cube, tslice);