@@ -3957,8 +3957,9 @@ SCIP_RETCODE addWeakSBCsSubgroup(
3957
3957
{
3958
3958
/* add element from lexorder to hashmap.
3959
3959
* Use insert, as duplicate entries in lexorder is not permitted. */
3960
- assert ( ! SCIPhashmapExists (varsinlexorder , (void * ) (long ) (* lexorder )[k ]) ); /* Use int as pointer */
3961
- SCIP_CALL ( SCIPhashmapInsertInt (varsinlexorder , (void * ) (long ) (* lexorder )[k ], k ) );
3960
+ assert ((* lexorder )[k ] >= 0 );
3961
+ assert ( ! SCIPhashmapExists (varsinlexorder , (void * ) (size_t ) (* lexorder )[k ]) ); /* Use int as pointer */
3962
+ SCIP_CALL ( SCIPhashmapInsertInt (varsinlexorder , (void * ) (size_t ) (* lexorder )[k ], k ) );
3962
3963
}
3963
3964
}
3964
3965
@@ -3979,6 +3980,7 @@ SCIP_RETCODE addWeakSBCsSubgroup(
3979
3980
graphcomp = chosencomppercolor [j ];
3980
3981
graphcompsize = graphcompbegins [graphcomp + 1 ] - graphcompbegins [graphcomp ];
3981
3982
varidx = firstvaridxpercolor [j ];
3983
+ assert (varidx >= 0 );
3982
3984
3983
3985
/* if the first variable was already contained in another orbit or if there are no variables left anyway, skip the
3984
3986
* component */
@@ -3987,7 +3989,7 @@ SCIP_RETCODE addWeakSBCsSubgroup(
3987
3989
3988
3990
/* If varidx is in lexorder, then it must be the first entry of lexorder. */
3989
3991
if ( varsinlexorder != NULL
3990
- && SCIPhashmapExists (varsinlexorder , (void * ) (long ) varidx )
3992
+ && SCIPhashmapExists (varsinlexorder , (void * ) (size_t ) varidx )
3991
3993
&& lexorder != NULL && * lexorder != NULL && * maxnvarsorder > 0 && * nvarsorder > 0
3992
3994
&& (* lexorder )[0 ] != varidx )
3993
3995
continue ;
@@ -4077,6 +4079,7 @@ SCIP_RETCODE addWeakSBCsSubgroup(
4077
4079
int varidx ;
4078
4080
4079
4081
varidx = orbit [activeorb ][0 ];
4082
+ assert (varidx >= 0 );
4080
4083
4081
4084
if ( * maxnvarsorder == 0 )
4082
4085
{
@@ -4097,13 +4100,13 @@ SCIP_RETCODE addWeakSBCsSubgroup(
4097
4100
if ( varidx == (* lexorder )[0 ] )
4098
4101
{
4099
4102
/* lexorder is already ok!! */
4100
- assert ( SCIPhashmapExists (varsinlexorder , (void * ) (long ) varidx ) );
4103
+ assert ( SCIPhashmapExists (varsinlexorder , (void * ) (size_t ) varidx ) );
4101
4104
}
4102
4105
else
4103
4106
{
4104
4107
/* Then varidx must not be in the lexorder,
4105
4108
* We must add it at the front of the array, and maintain the current order. */
4106
- assert ( ! SCIPhashmapExists (varsinlexorder , (void * ) (long ) varidx ) );
4109
+ assert ( ! SCIPhashmapExists (varsinlexorder , (void * ) (size_t ) varidx ) );
4107
4110
4108
4111
++ (* maxnvarsorder );
4109
4112
++ (* nvarsorder );
0 commit comments