Searched refs:ndivesets (Results 1 – 4 of 4) sorted by relevance
196 heurdata->ndivesets = 0; in findAndStoreDivesets()299 for( i = 0; i < heurdata->ndivesets; ++i ) in getLPIterlimit()386 int ndivesets; in selectDiving() local394 ndivesets = heurdata->ndivesets; in selectDiving()395 assert(ndivesets > 0); in selectDiving()403 for( d = 0; d < heurdata->ndivesets; ++d ) in selectDiving()432 for( d = 0; d < heurdata->ndivesets; ++d ) in selectDiving()453 for( d = 0; d < ndivesets; ++d ) in selectDiving()483 assert(*selection >= 0 && *selection < ndivesets); in selectDiving()513 assert(heurdata->ndivesets > 0); in SCIP_DECL_HEUREXEC()[all …]
229 assert(heur->ndivesets == 0); in heurAddDiveset()234 assert(heur->ndivesets > 0); in heurAddDiveset()235 …SCIP_ALLOC( BMSreallocMemoryArray(&heur->divesets, heur->ndivesets + 1) ); /*lint !e776 I expect n… in heurAddDiveset()239 heur->divesets[heur->ndivesets] = diveset; in heurAddDiveset()240 heur->ndivesets++; in heurAddDiveset()943 (*heur)->ndivesets = 0; in doHeurCreate()1019 assert((*heur)->divesets != NULL || (*heur)->ndivesets == 0); in SCIPheurFree()1027 for( d = 0; d < (*heur)->ndivesets; ++d ) in SCIPheurFree()1081 for( d = 0; d < heur->ndivesets; ++d ) in SCIPheurInit()1643 return heur->ndivesets; in SCIPheurGetNDivesets()
111 int ndivesets; /**< number of diving controllers of this heuristic */ member
3049 int ndivesets = 0; in SCIPprintHeuristicStatistics() local3086 ndivesets += SCIPheurGetNDivesets(scip->set->heurs[i]); in SCIPprintHeuristicStatistics()3092 if ( ndivesets > 0 ) in SCIPprintHeuristicStatistics()