Resorted to re-sorted

Joao-Dionisio · svigerske · commit 702a61548182 · 2025-04-30T12:58:44.000+07:00
diff --git a/doc/xternal.c b/doc/xternal.c
@@ -3451,7 +3451,7 @@
  * \n
  * Note that this property only defines the default value of the priority. The user may change this value arbitrarily by
  * adjusting the corresponding parameter setting. Whenever, even during solving, the priority of a cut selector is
- * changed, the cut selectors are resorted by the new priorities.
+ * changed, the cut selectors are re-sorted by the new priorities.
  *
  *
  * @section CUTSEL_DATA Cut Selector Data
@@ -3507,7 +3507,7 @@
  * @subsection CUTSELSELECT
  *
  * The CUTSELSELECT callback should decide which cuts should be added to the relaxation.
- * The callback receives the arrays of cuts to select from. This array must be resorted and the first nselectedcuts from
+ * The callback receives the arrays of cuts to select from. This array must be re-sorted and the first nselectedcuts from
  * the sorted array are going to be selected.
  * In addition to the aforementioned cuts, the list of forced cuts is also given as an argument. This array can be used
  * to help with the selection algorithm. Note, however, that this array should not be tampered with.
diff --git a/src/scip/cons_cardinality.c b/src/scip/cons_cardinality.c
@@ -3799,7 +3799,7 @@ SCIP_RETCODE SCIPcreateConsCardinality(
 /** creates and captures a cardinality constraint with all constraint flags set to their default values.
  *
  *  @warning Do NOT set the constraint to be modifiable manually, because this might lead
- *  to wrong results as the variable array will not be resorted
+ *  to wrong results as the variable array will not be re-sorted
  *
  *  @note the constraint gets captured, hence at one point you have to release it using the method \ref SCIPreleaseCons()
  */
diff --git a/src/scip/cons_cardinality.h b/src/scip/cons_cardinality.h
@@ -122,7 +122,7 @@ SCIP_RETCODE SCIPcreateConsCardinality(
  *  @see SCIPcreateConsCardinality() for the default constraint flag configuration
  *
  *  @warning Do NOT set the constraint to be modifiable manually, because this might lead
- *  to wrong results as the variable array will not be resorted
+ *  to wrong results as the variable array will not be re-sorted
  *
  *  @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
  */
diff --git a/src/scip/cons_knapsack.c b/src/scip/cons_knapsack.c
@@ -13064,7 +13064,7 @@ SCIP_DECL_CONSRESPROP(consRespropKnapsack)
       else
       {
          /* locate the inference variable and calculate the capacity that has to be used up to conclude infervar == 0;
-          * inferinfo stores the position of the inference variable (but maybe the variables were resorted)
+          * inferinfo stores the position of the inference variable (but maybe the variables were re-sorted)
           */
          if( inferinfo < consdata->nvars && consdata->vars[inferinfo] == infervar )
             capsum = consdata->weights[inferinfo];
diff --git a/src/scip/cons_sos1.c b/src/scip/cons_sos1.c
@@ -10702,7 +10702,7 @@ SCIP_RETCODE SCIPcreateConsSOS1(
 /** creates and captures a SOS1 constraint with all constraint flags set to their default values.
  *
  *  @warning Do NOT set the constraint to be modifiable manually, because this might lead
- *  to wrong results as the variable array will not be resorted
+ *  to wrong results as the variable array will not be re-sorted
  *
  *  @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
  */
diff --git a/src/scip/cons_sos1.h b/src/scip/cons_sos1.h
@@ -116,7 +116,7 @@ SCIP_RETCODE SCIPcreateConsSOS1(
  *  @see SCIPcreateConsSOS1() for the default constraint flag configuration
  *
  *  @warning Do NOT set the constraint to be modifiable manually, because this might lead
- *  to wrong results as the variable array will not be resorted
+ *  to wrong results as the variable array will not be re-sorted
  *
  *  @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
  */
diff --git a/src/scip/cons_sos2.c b/src/scip/cons_sos2.c
@@ -2664,7 +2664,7 @@ SCIP_RETCODE SCIPcreateConsSOS2(
 /** creates and captures a SOS2 constraint with all constraint flags set to their default values.
  *
  *  @warning Do NOT set the constraint to be modifiable manually, because this might lead
- *  to wrong results as the variable array will not be resorted
+ *  to wrong results as the variable array will not be re-sorted
  *
  *  @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
  */
diff --git a/src/scip/cons_sos2.h b/src/scip/cons_sos2.h
@@ -109,7 +109,7 @@ SCIP_RETCODE SCIPcreateConsSOS2(
 /** creates and captures a SOS2 constraint with all constraint flags set to their default values.
  *
  *  @warning Do NOT set the constraint to be modifiable manually, because this might lead
- *  to wrong results as the variable array will not be resorted
+ *  to wrong results as the variable array will not be re-sorted
  *
  *  @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
  */
diff --git a/src/scip/cutsel_dynamic.c b/src/scip/cutsel_dynamic.c
@@ -533,7 +533,7 @@ SCIP_RETCODE SCIPincludeCutselDynamic(
  *
  *  This is the selection method of the dynamic cut selector which implements
  *  the dynamic orthognality filtering based on the ratio of efficacies.
- *  The input cuts array gets resorted s.t the selected cuts come first and the remaining
+ *  The input cuts array gets re-sorted s.t the selected cuts come first and the remaining
  *  ones are the end.
  */
 SCIP_RETCODE SCIPselectCutsDynamic(
diff --git a/src/scip/cutsel_dynamic.h b/src/scip/cutsel_dynamic.h
@@ -37,7 +37,7 @@
  *
  *  The selector allows the user to specify a filtering strategy during cut selection ('d'ynamic- and 'f'ull dynamic),
  *  which determines how the orthogonality filtering is applied.
- *  In both cases, after a cut is selected, the remaining cuts are resorted by computing their relative efficacy to the
+ *  In both cases, after a cut is selected, the remaining cuts are re-sorted by computing their relative efficacy to the
  *  selected cut. The efficacy ratio is then used to filter the cuts based on the filtering strategy:
  *  - 'd'ynamic-parallelism: The dynamic parallelism strategy filters cuts based on the efficacy ratio between cut
  *  pairs. It only filters cuts that are not theoretically improving the efficacy of the pair given the first cut, i.e.,
@@ -80,7 +80,7 @@ SCIP_RETCODE SCIPincludeCutselDynamic(
  *  This is an extension of the hybrid cutselector to employ a dynamic range
  *  when applying orthogonality filtering, dependent on the efficacy ratio between cuts.
  *
- *  The input cuts array should be resorted such that the selected cuts come first.
+ *  The input cuts array should be re-sorted such that the selected cuts come first.
  */
 SCIP_EXPORT
 SCIP_RETCODE SCIPselectCutsDynamic(
diff --git a/src/scip/cutsel_hybrid.c b/src/scip/cutsel_hybrid.c
@@ -432,7 +432,7 @@ SCIP_RETCODE SCIPincludeCutselHybrid(
  *
  *  This is the selection method of the hybrid cut selector which uses a weighted sum of the
  *  efficacy, parallelism, directed cutoff distance, and the integral support.
- *  The input cuts array gets resorted s.t the selected cuts come first and the remaining
+ *  The input cuts array gets re-sorted s.t the selected cuts come first and the remaining
  *  ones are the end.
  */
 SCIP_RETCODE SCIPselectCutsHybrid(
diff --git a/src/scip/cutsel_hybrid.h b/src/scip/cutsel_hybrid.h
@@ -97,7 +97,7 @@ SCIP_RETCODE SCIPincludeCutselHybrid(
  *
  *  This is the selection method of the hybrid cut selector which uses a weighted sum of the
  *  efficacy, parallelism, directed cutoff distance, and the integral support.
- *  The input cuts array gets resorted s.t the selected cuts come first and the remaining
+ *  The input cuts array gets re-sorted s.t the selected cuts come first and the remaining
  *  ones are the end.
  */
 SCIP_EXPORT
diff --git a/src/scip/cutsel_xyz.h b/src/scip/cutsel_xyz.h
@@ -56,7 +56,7 @@ SCIP_RETCODE SCIPincludeCutselXyz(
 
 /** perform a cut selection algorithm for the given array of cuts
  *
- *  The input cuts array should be resorted such that the selected cuts come first.
+ *  The input cuts array should be re-sorted such that the selected cuts come first.
  */
 SCIP_EXPORT
 SCIP_RETCODE SCIPselectCutsXyz(
diff --git a/src/scip/prop_genvbounds.c b/src/scip/prop_genvbounds.c
@@ -2295,7 +2295,7 @@ SCIP_RETCODE SCIPgenVBoundAdd(
       SCIP_CALL( addNewGenVBound(scip, propdata, genvbound) );
    }
 
-   /* mark genvbounds array to be resorted */
+   /* mark genvbounds array to be re-sorted */
    propdata->issorted = FALSE;
 
    /* debug message */
@@ -2540,7 +2540,7 @@ SCIP_DECL_PROPEXITPRE(propExitpreGenvbounds)
             propdata->genvboundstore[i] = propdata->genvboundstore[propdata->ngenvbounds];
             propdata->genvboundstore[i]->index = i;
 
-            /* mark genvbounds array to be resorted */
+            /* mark genvbounds array to be re-sorted */
             propdata->issorted = FALSE;
          }
       }
diff --git a/src/scip/scip_var.c b/src/scip/scip_var.c
@@ -5685,7 +5685,7 @@ SCIP_Real SCIPadjustedVarUbExactFloat(
  *  that in conflict analysis, this change is treated like a branching decision
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -5863,7 +5863,7 @@ SCIP_RETCODE SCIPchgVarLbExact(
  *  that in conflict analysis, this change is treated like a branching decision
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -6128,7 +6128,7 @@ SCIP_RETCODE SCIPchgVarUbNode(
  *  if the global bound is better than the local bound
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -6217,7 +6217,7 @@ SCIP_RETCODE SCIPchgVarLbGlobal(
  *  if the global bound is better than the local bound
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -6390,7 +6390,7 @@ SCIP_RETCODE SCIPchgVarUbLazy(
  *  is treated like a branching decision
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -6640,7 +6640,7 @@ SCIP_RETCODE SCIPtightenVarLbExact(
  *  is treated like a branching decision
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -6892,7 +6892,7 @@ SCIP_RETCODE SCIPtightenVarUbExact(
  *        SCIPinferVarUbCons
  *
  *  @note If SCIP is in presolving stage, it can happen that the internal variable array (which get be accessed via
- *        SCIPgetVars()) gets resorted.
+ *        SCIPgetVars()) gets re-sorted.
  *
  *  @note During presolving, an integer variable which bound changes to {0,1} is upgraded to a binary variable.
  */
@@ -6953,7 +6953,7 @@ SCIP_RETCODE SCIPinferVarFixCons(
  *  for the deduction of the bound change
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -7067,7 +7067,7 @@ SCIP_RETCODE SCIPinferVarLbCons(
  *  for the deduction of the bound change
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -7530,7 +7530,7 @@ SCIP_RETCODE SCIPinferBinvarCons(
  *        SCIPinferVarUbProp
  *
  *  @note If SCIP is in presolving stage, it can happen that the internal variable array (which get be accessed via
- *        SCIPgetVars()) gets resorted.
+ *        SCIPgetVars()) gets re-sorted.
  *
  *  @note During presolving, an integer variable which bound changes to {0,1} is upgraded to a binary variable.
  */
@@ -7591,7 +7591,7 @@ SCIP_RETCODE SCIPinferVarFixProp(
  *  for the deduction of the bound change
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -7706,7 +7706,7 @@ SCIP_RETCODE SCIPinferVarLbProp(
  *  for the deduction of the bound change
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -8032,7 +8032,7 @@ SCIP_RETCODE tightenVarLbGlobalSafe(
  *  also tightens the local bound, if the global bound is better than the local bound
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
@@ -8263,7 +8263,7 @@ SCIP_RETCODE tightenVarUbGlobalSafe(
  *  also tightens the local bound, if the global bound is better than the local bound
  *
  *  @warning If SCIP is in presolving stage, it can happen that the internal variable array (which can be accessed via
- *           SCIPgetVars()) gets resorted.
+ *           SCIPgetVars()) gets re-sorted.
  *
  *  @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
  *          SCIP_Retcode "SCIP_RETCODE" for a complete list of error codes.
diff --git a/src/scip/scip_var.h b/src/scip/scip_var.h
diff --git a/src/scip/type_cutsel.h b/src/scip/type_cutsel.h

Original file line number	Diff line number	Diff line change
`@@ -3451,7 +3451,7 @@`
`3451`	`3451`	`* \n`
`3452`	`3452`	`* Note that this property only defines the default value of the priority. The user may change this value arbitrarily by`
`3453`	`3453`	`* adjusting the corresponding parameter setting. Whenever, even during solving, the priority of a cut selector is`
`3454`		`- * changed, the cut selectors are resorted by the new priorities.`
	`3454`	`+ * changed, the cut selectors are re-sorted by the new priorities.`
`3455`	`3455`	`*`
`3456`	`3456`	`*`
`3457`	`3457`	`* @section CUTSEL_DATA Cut Selector Data`
`@@ -3507,7 +3507,7 @@`
`3507`	`3507`	`* @subsection CUTSELSELECT`
`3508`	`3508`	`*`
`3509`	`3509`	`* The CUTSELSELECT callback should decide which cuts should be added to the relaxation.`
`3510`		`- * The callback receives the arrays of cuts to select from. This array must be resorted and the first nselectedcuts from`
	`3510`	`+ * The callback receives the arrays of cuts to select from. This array must be re-sorted and the first nselectedcuts from`
`3511`	`3511`	`* the sorted array are going to be selected.`
`3512`	`3512`	`* In addition to the aforementioned cuts, the list of forced cuts is also given as an argument. This array can be used`
`3513`	`3513`	`* to help with the selection algorithm. Note, however, that this array should not be tampered with.`
Original file line number	Diff line number	Diff line change
`@@ -3799,7 +3799,7 @@ SCIP_RETCODE SCIPcreateConsCardinality(`
`3799`	`3799`	`/** creates and captures a cardinality constraint with all constraint flags set to their default values.`
`3800`	`3800`	`*`
`3801`	`3801`	`* @warning Do NOT set the constraint to be modifiable manually, because this might lead`
`3802`		`- * to wrong results as the variable array will not be resorted`
	`3802`	`+ * to wrong results as the variable array will not be re-sorted`
`3803`	`3803`	`*`
`3804`	`3804`	`* @note the constraint gets captured, hence at one point you have to release it using the method \ref SCIPreleaseCons()`
`3805`	`3805`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -122,7 +122,7 @@ SCIP_RETCODE SCIPcreateConsCardinality(`
`122`	`122`	`* @see SCIPcreateConsCardinality() for the default constraint flag configuration`
`123`	`123`	`*`
`124`	`124`	`* @warning Do NOT set the constraint to be modifiable manually, because this might lead`
`125`		`- * to wrong results as the variable array will not be resorted`
	`125`	`+ * to wrong results as the variable array will not be re-sorted`
`126`	`126`	`*`
`127`	`127`	`* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()`
`128`	`128`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -13064,7 +13064,7 @@ SCIP_DECL_CONSRESPROP(consRespropKnapsack)`
`13064`	`13064`	`else`
`13065`	`13065`	`{`
`13066`	`13066`	`/* locate the inference variable and calculate the capacity that has to be used up to conclude infervar == 0;`
`13067`		`- * inferinfo stores the position of the inference variable (but maybe the variables were resorted)`
	`13067`	`+ * inferinfo stores the position of the inference variable (but maybe the variables were re-sorted)`
`13068`	`13068`	`*/`
`13069`	`13069`	`if( inferinfo < consdata->nvars && consdata->vars[inferinfo] == infervar )`
`13070`	`13070`	`capsum = consdata->weights[inferinfo];`
Original file line number	Diff line number	Diff line change
`@@ -10702,7 +10702,7 @@ SCIP_RETCODE SCIPcreateConsSOS1(`
`10702`	`10702`	`/** creates and captures a SOS1 constraint with all constraint flags set to their default values.`
`10703`	`10703`	`*`
`10704`	`10704`	`* @warning Do NOT set the constraint to be modifiable manually, because this might lead`
`10705`		`- * to wrong results as the variable array will not be resorted`
	`10705`	`+ * to wrong results as the variable array will not be re-sorted`
`10706`	`10706`	`*`
`10707`	`10707`	`* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()`
`10708`	`10708`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -116,7 +116,7 @@ SCIP_RETCODE SCIPcreateConsSOS1(`
`116`	`116`	`* @see SCIPcreateConsSOS1() for the default constraint flag configuration`
`117`	`117`	`*`
`118`	`118`	`* @warning Do NOT set the constraint to be modifiable manually, because this might lead`
`119`		`- * to wrong results as the variable array will not be resorted`
	`119`	`+ * to wrong results as the variable array will not be re-sorted`
`120`	`120`	`*`
`121`	`121`	`* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()`
`122`	`122`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -2664,7 +2664,7 @@ SCIP_RETCODE SCIPcreateConsSOS2(`
`2664`	`2664`	`/** creates and captures a SOS2 constraint with all constraint flags set to their default values.`
`2665`	`2665`	`*`
`2666`	`2666`	`* @warning Do NOT set the constraint to be modifiable manually, because this might lead`
`2667`		`- * to wrong results as the variable array will not be resorted`
	`2667`	`+ * to wrong results as the variable array will not be re-sorted`
`2668`	`2668`	`*`
`2669`	`2669`	`* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()`
`2670`	`2670`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -109,7 +109,7 @@ SCIP_RETCODE SCIPcreateConsSOS2(`
`109`	`109`	`/** creates and captures a SOS2 constraint with all constraint flags set to their default values.`
`110`	`110`	`*`
`111`	`111`	`* @warning Do NOT set the constraint to be modifiable manually, because this might lead`
`112`		`- * to wrong results as the variable array will not be resorted`
	`112`	`+ * to wrong results as the variable array will not be re-sorted`
`113`	`113`	`*`
`114`	`114`	`* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()`
`115`	`115`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -533,7 +533,7 @@ SCIP_RETCODE SCIPincludeCutselDynamic(`
`533`	`533`	`*`
`534`	`534`	`* This is the selection method of the dynamic cut selector which implements`
`535`	`535`	`* the dynamic orthognality filtering based on the ratio of efficacies.`
`536`		`- * The input cuts array gets resorted s.t the selected cuts come first and the remaining`
	`536`	`+ * The input cuts array gets re-sorted s.t the selected cuts come first and the remaining`
`537`	`537`	`* ones are the end.`
`538`	`538`	`*/`
`539`	`539`	`SCIP_RETCODE SCIPselectCutsDynamic(`
Original file line number	Diff line number	Diff line change
`@@ -432,7 +432,7 @@ SCIP_RETCODE SCIPincludeCutselHybrid(`
`432`	`432`	`*`
`433`	`433`	`* This is the selection method of the hybrid cut selector which uses a weighted sum of the`
`434`	`434`	`* efficacy, parallelism, directed cutoff distance, and the integral support.`
`435`		`- * The input cuts array gets resorted s.t the selected cuts come first and the remaining`
	`435`	`+ * The input cuts array gets re-sorted s.t the selected cuts come first and the remaining`
`436`	`436`	`* ones are the end.`
`437`	`437`	`*/`
`438`	`438`	`SCIP_RETCODE SCIPselectCutsHybrid(`