@@ -945,11 +945,11 @@ SCIP_RETCODE nodeReleaseParent(
945
945
SCIP_Bool singleChild = FALSE;
946
946
int focusdepth = SCIPtreeGetFocusDepth (tree );
947
947
948
- assert (tree -> effectiverootdepth >= 0 );
948
+ assert (tree -> updatedeffectiverootdepth >= 0 );
949
949
950
- while ( tree -> effectiverootdepth < focusdepth )
950
+ while ( tree -> updatedeffectiverootdepth < focusdepth )
951
951
{
952
- SCIP_NODE * effectiveroot = tree -> path [tree -> effectiverootdepth ];
952
+ SCIP_NODE * effectiveroot = tree -> path [tree -> updatedeffectiverootdepth ];
953
953
954
954
switch ( SCIPnodeGetType (effectiveroot ) )
955
955
{
@@ -994,14 +994,14 @@ SCIP_RETCODE nodeReleaseParent(
994
994
if ( !singleChild )
995
995
break ;
996
996
997
- ++ tree -> effectiverootdepth ;
997
+ ++ tree -> updatedeffectiverootdepth ;
998
998
999
999
SCIPsetDebugMsg (set ,
1000
1000
"unlinked node #%" SCIP_LONGINT_FORMAT " in depth %d -> new effective root depth: %d\n" ,
1001
- SCIPnodeGetNumber (node ), SCIPnodeGetDepth (node ), tree -> effectiverootdepth );
1001
+ SCIPnodeGetNumber (node ), SCIPnodeGetDepth (node ), tree -> updatedeffectiverootdepth );
1002
1002
}
1003
1003
1004
- assert (!singleChild || SCIPtreeGetEffectiveRootDepth ( tree ) == SCIPtreeGetFocusDepth (tree ));
1004
+ assert (!singleChild || tree -> updatedeffectiverootdepth == SCIPtreeGetFocusDepth (tree ));
1005
1005
}
1006
1006
}
1007
1007
@@ -3114,7 +3114,7 @@ SCIP_RETCODE treeSwitchPath(
3114
3114
SCIP_Bool * cutoff /**< pointer to store whether the new focus node can be cut off */
3115
3115
)
3116
3116
{
3117
- int newappliedeffectiverootdepth ;
3117
+ int neweffectiverootdepth ;
3118
3118
int forklen ; /* length of the path to subroot/fork/pseudofork/junction node, or 0 if no fork */
3119
3119
int focusnodedepth ; /* depth of the new focus node, or -1 if focusnode == NULL */
3120
3120
int i ;
@@ -3204,41 +3204,41 @@ SCIP_RETCODE treeSwitchPath(
3204
3204
3205
3205
if ( freeNode )
3206
3206
{
3207
- assert (tree -> appliedeffectiverootdepth <= tree -> effectiverootdepth );
3207
+ assert (tree -> effectiverootdepth <= tree -> updatedeffectiverootdepth );
3208
3208
SCIP_CALL ( SCIPnodeFree (& oldfocusnode , blkmem , set , stat , eventfilter , eventqueue , tree , lp ) );
3209
- assert (tree -> effectiverootdepth <= focusnodedepth || tree -> focusnode == NULL );
3209
+ assert (tree -> updatedeffectiverootdepth <= focusnodedepth || tree -> focusnode == NULL );
3210
3210
}
3211
3211
}
3212
3212
3213
3213
/* apply effective root shift up to the new focus node */
3214
3214
* cutoff = FALSE;
3215
- newappliedeffectiverootdepth = MIN (tree -> effectiverootdepth , focusnodedepth );
3215
+ neweffectiverootdepth = MIN (tree -> updatedeffectiverootdepth , focusnodedepth );
3216
3216
3217
3217
/* promote the constraint set and bound changes up to the new effective root to be global changes */
3218
- if ( tree -> appliedeffectiverootdepth < newappliedeffectiverootdepth )
3218
+ if ( tree -> effectiverootdepth < neweffectiverootdepth )
3219
3219
{
3220
3220
SCIPsetDebugMsg (set ,
3221
3221
"shift effective root from depth %d to %d: applying constraint set and bound changes to global problem\n" ,
3222
- tree -> appliedeffectiverootdepth , newappliedeffectiverootdepth );
3222
+ tree -> effectiverootdepth , neweffectiverootdepth );
3223
3223
3224
3224
/* at first globalize constraint changes to update constraint handlers before changing bounds */
3225
- for ( i = tree -> appliedeffectiverootdepth + 1 ; i <= newappliedeffectiverootdepth ; ++ i )
3225
+ for ( i = tree -> effectiverootdepth + 1 ; i <= neweffectiverootdepth ; ++ i )
3226
3226
{
3227
3227
SCIPsetDebugMsg (set , " -> applying constraint set changes of depth %d\n" , i );
3228
3228
3229
3229
SCIP_CALL ( SCIPconssetchgMakeGlobal (& tree -> path [i ]-> conssetchg , blkmem , set , stat , transprob , reopt ) );
3230
3230
}
3231
3231
3232
3232
/* at last globalize bound changes triggering delayed events processed after the path switch */
3233
- for ( i = tree -> appliedeffectiverootdepth + 1 ; i <= newappliedeffectiverootdepth && !(* cutoff ); ++ i )
3233
+ for ( i = tree -> effectiverootdepth + 1 ; i <= neweffectiverootdepth && !(* cutoff ); ++ i )
3234
3234
{
3235
3235
SCIPsetDebugMsg (set , " -> applying bound changes of depth %d\n" , i );
3236
3236
3237
3237
SCIP_CALL ( SCIPdomchgApplyGlobal (tree -> path [i ]-> domchg , blkmem , set , stat , lp , branchcand , eventqueue , cliquetable , cutoff ) );
3238
3238
}
3239
3239
3240
3240
/* update applied effective root depth */
3241
- tree -> appliedeffectiverootdepth = newappliedeffectiverootdepth ;
3241
+ tree -> effectiverootdepth = neweffectiverootdepth ;
3242
3242
}
3243
3243
3244
3244
/* fork might be cut off when applying the pending bound changes */
@@ -4916,7 +4916,7 @@ SCIP_RETCODE SCIPtreeCreate(
4916
4916
(* tree )-> pathlen = 0 ;
4917
4917
(* tree )-> pathsize = 0 ;
4918
4918
(* tree )-> effectiverootdepth = 0 ;
4919
- (* tree )-> appliedeffectiverootdepth = 0 ;
4919
+ (* tree )-> updatedeffectiverootdepth = 0 ;
4920
4920
(* tree )-> lastbranchparentid = -1L ;
4921
4921
(* tree )-> correctlpdepth = -1 ;
4922
4922
(* tree )-> cutoffdepth = INT_MAX ;
@@ -5033,7 +5033,7 @@ SCIP_RETCODE SCIPtreeClear(
5033
5033
tree -> nsiblings = 0 ;
5034
5034
tree -> pathlen = 0 ;
5035
5035
tree -> effectiverootdepth = 0 ;
5036
- tree -> appliedeffectiverootdepth = 0 ;
5036
+ tree -> updatedeffectiverootdepth = 0 ;
5037
5037
tree -> correctlpdepth = -1 ;
5038
5038
tree -> cutoffdepth = INT_MAX ;
5039
5039
tree -> repropdepth = INT_MAX ;
0 commit comments