Block decomposition: drop unused structure fields
parent
bbdbd0807b
commit
1e377f061a
|
@ -583,21 +583,6 @@ ModelTree::computeDynamicStructureOfBlock(int blk)
|
|||
blocks[blk].max_lead = max(blocks[blk].max_endo_lead, max(blocks[blk].max_other_endo_lead,
|
||||
max(blocks[blk].max_exo_lead,
|
||||
blocks[blk].max_exo_det_lead)));
|
||||
|
||||
// Categorize endos that belong to the block
|
||||
blocks[blk].n_mixed = blocks[blk].n_forward = blocks[blk].n_backward = blocks[blk].n_static = 0;
|
||||
for (int var = 0; var < blocks[blk].size; var++)
|
||||
{
|
||||
auto [max_lag, max_lead] = max_endo_lag_lead[var];
|
||||
if (max_lag != 0 && max_lead != 0)
|
||||
blocks[blk].n_mixed++;
|
||||
else if (max_lag == 0 && max_lead != 0)
|
||||
blocks[blk].n_forward++;
|
||||
else if (max_lag != 0 && max_lead == 0)
|
||||
blocks[blk].n_backward++;
|
||||
else
|
||||
blocks[blk].n_static++;
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
|
|
|
@ -195,7 +195,6 @@ protected:
|
|||
int size{0};
|
||||
int mfs_size{0}; // Size of the minimal feedback set
|
||||
bool linear{true}; // Whether the block is linear in endogenous variable
|
||||
int n_static{0}, n_forward{0}, n_backward{0}, n_mixed{0};
|
||||
int max_endo_lag{0}, max_endo_lead{0}; // Maximum lag/lead on endos that appear in and *that belong to* the block
|
||||
int max_other_endo_lag{0}, max_other_endo_lead{0}; // Maximum lag/lead on endos that appear in but do not belong to the block
|
||||
int max_exo_lag{0}, max_exo_lead{0};
|
||||
|
|
Loading…
Reference in New Issue