/** deinitialization method of primal heuristic (called before transformed problem is freed) */
static
SCIP_DECL_HEUREXIT(heurExitCrossover)
{ /*lint --e{715}*/
SCIP_HEURDATA* heurdata;
SOLTUPLE* soltuple;
assert(heur != NULL);
assert(scip != NULL);
/* get heuristic data */
heurdata = SCIPheurGetData(heur);
assert(heurdata != NULL);
soltuple = heurdata->lasttuple;
/* free all soltuples iteratively */
while( soltuple != NULL )
{
SOLTUPLE* tmp;
tmp = soltuple->prev;
SCIPfreeBlockMemoryArray(scip,&soltuple->indices,soltuple->size);
SCIPfreeBlockMemory(scip,&soltuple);
soltuple = tmp;
}
/* free hash table */
assert(heurdata->hashtable != NULL );
SCIPhashtableFree(&heurdata->hashtable);
return SCIP_OKAY;
}
/** frees user data of variable */
static
SCIP_RETCODE vardataDelete(
SCIP* scip, /**< SCIP data structure */
SCIP_VARDATA** vardata /**< vardata to delete */
)
{
SCIPfreeBlockMemoryArray(scip, &(*vardata)->consids, (*vardata)->nconsids);
SCIPfreeBlockMemory(scip, vardata);
return SCIP_OKAY;
}
/** frees specific constraint data */
static
SCIP_DECL_CONSDELETE(consDeleteStp)
{ /*lint --e{715}*/
assert(conshdlr != NULL);
assert(strcmp(SCIPconshdlrGetName(conshdlr), CONSHDLR_NAME) == 0);
assert(consdata != NULL);
assert(*consdata != NULL);
SCIPfreeBlockMemory(scip, consdata);
return SCIP_OKAY;
}
/** frees a logic or constraint data */
static
SCIP_RETCODE consdataFree(
SCIP* scip, /**< SCIP data structure */
SCIP_CONSDATA** consdata /**< pointer to the constraint data */
)
{
assert(consdata != NULL);
assert(*consdata != NULL);
SCIPfreeBlockMemory(scip, consdata);
return SCIP_OKAY;
}
SCIP_RETCODE SCIPpolicyFree(
SCIP* scip,
SCIP_POLICY** policy
)
{
assert(scip != NULL);
assert(policy != NULL);
assert((*policy)->weights != NULL);
BMSfreeMemoryArray(&(*policy)->weights);
SCIPfreeBlockMemory(scip, policy);
return SCIP_OKAY;
}
/** frees constraint data and releases all constraints in conjunction */
static
SCIP_RETCODE consdataFree(
SCIP* scip, /**< SCIP data structure */
SCIP_CONSDATA** consdata /**< pointer to constraint data */
)
{
int c;
assert(consdata != NULL);
assert(*consdata != NULL);
/* release constraints */
for( c = 0; c < (*consdata)->nconss; ++c )
{
SCIP_CALL( SCIPreleaseCons(scip, &(*consdata)->conss[c]) );
}
/* free memory */
SCIPfreeBlockMemoryArrayNull(scip, &(*consdata)->conss, (*consdata)->consssize);
SCIPfreeBlockMemory(scip, consdata);
return SCIP_OKAY;
}
/** frees specific constraint data */
static
SCIP_DECL_CONSDELETE(consDeleteOrigbranch)
{ /*lint --e{715}*/
SCIP_CONSDATA* parentdata;
assert(scip != NULL);
assert(conshdlr != NULL);
assert(cons != NULL);
assert(consdata != NULL);
assert(strcmp(SCIPconshdlrGetName(conshdlr), CONSHDLR_NAME) == 0);
assert(*consdata != NULL);
SCIPdebugMessage("Deleting branch orig constraint: <%s>.\n", SCIPconsGetName(cons));
/* set the origcons pointer of the corresponding mastercons to NULL */
if( (*consdata)->mastercons != NULL )
GCGconsMasterbranchSetOrigcons((*consdata)->mastercons, NULL);
/* set the pointer in the parent constraint to NULL */
if( (*consdata)->parentcons != NULL )
{
parentdata = SCIPconsGetData((*consdata)->parentcons);
if( parentdata->child1cons == cons )
parentdata->child1cons = NULL;
else if( parentdata->probingtmpcons == cons )
{
assert(SCIPinProbing(scip));
parentdata->probingtmpcons = NULL;
}
else
{
assert(parentdata->child2cons == cons);
parentdata->child2cons = NULL;
if( SCIPinProbing(scip) )
{
parentdata->child2cons = parentdata->probingtmpcons;
parentdata->probingtmpcons = NULL;
}
}
}
/* no child nodes may exist */
assert((*consdata)->child1cons == NULL);
assert((*consdata)->child2cons == NULL);
/* delete branchdata, if no mastercons is linked, which would still need the branchdata
* otherwise, the mastercons deletes the branchdata when it is deleted itself */
if( (*consdata)->mastercons == NULL && (*consdata)->branchdata != NULL )
{
SCIP_CALL( GCGrelaxBranchDataDelete(scip, (*consdata)->branchrule, &(*consdata)->branchdata) );
}
/* free propagation domain changes arrays */
if( (*consdata)->maxpropbounds > 0 )
{
SCIPfreeMemoryArray(scip, &((*consdata)->propvars));
SCIPfreeMemoryArray(scip, &((*consdata)->propboundtypes));
SCIPfreeMemoryArray(scip, &((*consdata)->propbounds));
}
/* free constraint data */
SCIPfreeBlockMemory(scip, consdata);
return SCIP_OKAY;
}
