PODEILeafNode.m

classdef PODEILeafNode < Greedy.DataTree.Detailed.ILeafNode
  % tree node implementation for a detailed data structure holding a reduced
  % basis and a collateral reduced basis.

  properties (Dependent)
    % @copybrief Greedy.DataTree.Detailed.RBLeafNode
    RB;
  end

  properties
    % wrapped empirical interpolation data of type Greedy.DataTree.Detailed.EILeafNode
    ei;

    % wrapped empirical interpolation data of type Greedy.DataTree.Detailed.RBLeafNode
    rb;
  end

  properties (Access = private, Hidden=true)
    both_active = false;
  end

  methods

    function rbeiddn = PODEILeafNode(model_data, both_active)
      % function rbeiddn = PODEILeafNode(model_data, both_active)
      % constructor initializing the detailed data node
      %
      % Parameters:
      %   both_active: boolean flag specifying whether both basis trees are
      %                extended at the same time (c.f. GreedyPlugin.PODEI)
      rbeiddn  = rbeiddn@Greedy.DataTree.Detailed.ILeafNode(model_data);
      if nargin >= 2
        rbeiddn.both_active = both_active;
      end
    end

    function RB = get.RB(this)
      RB = this.rb.RB;
    end

    function this = set.RB(this, value)
      this.rb.RB = value;
    end

    function siz = get_rb_size(this)
      siz = get_rb_size(this.rb);
    end

    function siz = get_ei_size(this)
      siz = get_ei_size(this.ei);
    end

    function node = get_active_leaf(this, model, id)
      % function node = get_active_leaf(this, model, id)
      % @copybrief DataTreeINodeget_active_leaf()
      %
      % @copydetails DataTreeINodeget_active_leaf()
      %
      % Return values:
      %   node: of type GreedyDataTreeDetailed::ILeafNode
      if this.both_active
        node = this;
      else
        if nargin == 2
          id = [];
        end
        node = get_active_leaf(this.rb, model, id);
      end
    end

    function [ot1, ot2, ot3] = offtime(this, rmodel)
      [ot3, ot1, ot2] = offtime(this.rb, rmodel);
      [ot1, ot2, temp] = offtime(this.ei, rmodel);
    end


    function delete_rb(this, index)
      % function delete_rb(this, index)
      % @copybrief GreedyDataTreeDetailed::RBLeafNodedelete_rb()
      %
      % @copydetails GreedyDataTreeDetailed::RBLeafNodedelete_rb()
      delete_rb(this.rb, index);
    end
  end

  methods
%    function value = get_field_on_active_child(this, fieldname, model, id)
%      if nargin <=3
%        id = [];
%      end

%      value = [];
%      if ~isequal(id, 'rb')
%        value = get_field_on_active_child(this.ei, fieldname, model, id);
%      end
%      if ~isequal(id, 'ei')
%        value = [value, get_field_on_active_child(this.rb, fieldname, model, id)];
%      end
%    end

    function propagate_stop_flag(this, flag, on_off)

      if nargin <= 2
        on_off = [];
      end

      set_stop_flag(this, flag, on_off);
      if this.both_active
        propagate_stop_flag(this.ei, flag, on_off);
      end
      propagate_stop_flag(this.rb, flag, on_off);
    end

    function stopped_flags = stopped_on_active_child(this, flags, model, id)
      % function stopped_flags = stopped_on_active_child(this, flags, model, id)
      % @copybrief ::GreedyDataTreeInfostopped_on_active_child()
      %
      % @copydetails ::GreedyDataTreeInfostopped_on_active_child()
      %
      % Parameters:
      %   model: of type ::IModel

      if nargin <= 3
        id = [];
      end

      if ischar(flags)
        flags = { flags };
      end

      if this.both_active
        stopped_flags = stopped_on_active_child(this.ei, flags, model, id);
      else
        if length(flags) == 1
          stopped_flags = false;
        else
          stopped_flags = [];
        end
      end

      stopped_flags2 = stopped_on_active_child(this.rb, flags, model, id);
      stopped_flags3 = intersect(this.stop_flags, flags);
      if length(flags) == 1
        stopped_flags = stopped_flags | stopped_flags2 | ~isempty(stopped_flags3);
      else
        stopped_flags = union(union(stopped_flags, stopped_flags2), stopped_flags3);
      end

    end

  end

end