| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | prop_rootredcost.c | 151 return SCIPvarCompare(var1, var2); in SCIP_DECL_SORTPTRCOMP()
|
| H A D | presol_gateextraction.c | 173 assert(SCIPvarCompare(hashdata1->vars[v], hashdata2->vars[v]) == 0); in SCIP_DECL_HASHKEYEQ()
237 assert(SCIPvarCompare(hashdata1->vars[v], hashdata2->vars[v]) == 0); in SCIP_DECL_HASHKEYEQ()
925 if( SCIPvarCompare(posresultants[d], activevars[v]) > 0 ) in extractGates()
|
| H A D | cons_and.c | 797 … assert(v == consdata->nvars-1 || SCIPvarCompare(consdata->vars[v], consdata->vars[v+1]) <= 0); in consdataSort()
3313 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 1 || in SCIP_DECL_HASHKEYEQ()
3314 SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == -1); in SCIP_DECL_HASHKEYEQ()
3318 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 0); in SCIP_DECL_HASHKEYEQ()
3419 assert(SCIPvarCompare(consdata0->resvar, consdata1->resvar) != 0); in detectRedundantConstraints()
3632 varcmp = SCIPvarCompare(consdata0->vars[v0], consdata1->vars[v1]); in preprocessConstraintPairs()
|
| H A D | cons_logicor.c | 1851 assert(SCIPvarCompare(consdata->vars[v], consdata->vars[v - 1]) >= 0); in consdataSort()
1900 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 1 || in SCIP_DECL_HASHKEYEQ()
1901 SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == -1); in SCIP_DECL_HASHKEYEQ()
1905 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 0); in SCIP_DECL_HASHKEYEQ()
2291 comp = SCIPvarCompare(var, var1); in removeRedundantConss()
2578 comp = SCIPvarCompare(var, var1); in removeRedundantNonZeros()
|
| H A D | branch_pscost.c | 507 for( j = i+1 ; j < ncands && SCIPvarCompare(candssorted[j], cand) == 0; ++j ) in selectBranchVar()
|
| H A D | pub_var.h | 135 int SCIPvarCompare(
|
| H A D | var.c | 3934 if( SCIPvarCompare(tmpvars[v], tmpvars[ntmpvars]) == 0 ) in SCIPvarGetActiveRepresentatives()
3952 assert(SCIPvarCompare(tmpvars[v], tmpvars[v-1]) > 0); in SCIPvarGetActiveRepresentatives()
4066 assert(SCIPvarCompare(tmpvars[pos], multvar) == 0); in SCIPvarGetActiveRepresentatives()
4086 if( SCIPvarCompare(tmpvars2[v], tmpvars2[pos]) == 0 ) in SCIPvarGetActiveRepresentatives()
4120 if( SCIPvarCompare(tmpvars[v], tmpvars2[k]) >= 0 ) in SCIPvarGetActiveRepresentatives()
4155 assert(SCIPvarCompare(tmpvars[v], tmpvars[v-1]) > 0); in SCIPvarGetActiveRepresentatives()
11712 int SCIPvarCompare( in SCIPvarCompare() function
11734 return SCIPvarCompare((SCIP_VAR*)elem1, (SCIP_VAR*)elem2); in SCIP_DECL_SORTPTRCOMP()
11830 if( SCIPvarCompare(tmpvars[v], tmpvars[v - 1]) == 0 ) in SCIPvarsGetActiveVars()
11911 if( SCIPvarCompare(tmpvars[v], tmpvars[v - 1]) == 0 ) in SCIPvarsGetActiveVars()
[all …]
|
| H A D | cons_quadratic.c | 1587 return SCIPvarCompare(consdata->quadvarterms[ind1].var, consdata->quadvarterms[ind2].var); in SCIP_DECL_SORTINDCOMP()
1693 cmpres = SCIPvarCompare(var, consdata->quadvarterms[middle].var); in consdataFindQuadVarTerm()
1723 var1cmp = SCIPvarCompare(consdata->bilinterms[ind1].var1, consdata->bilinterms[ind2].var1); in SCIP_DECL_SORTINDCOMP()
1727 return SCIPvarCompare(consdata->bilinterms[ind1].var2, consdata->bilinterms[ind2].var2); in SCIP_DECL_SORTINDCOMP()
2416 if( SCIPvarCompare(bilinterm->var1, bilinterm->var2) > 0 ) in replaceQuadVarTermPos()
2423 assert(SCIPvarCompare(bilinterm->var1, bilinterm->var2) == -1); in replaceQuadVarTermPos()
2541 assert(SCIPvarCompare(bilinterm->var1, bilinterm->var2) == -1); in addBilinearTerm()
3342 assert(SCIPvarCompare(consdata->bilinterms[i].var1, consdata->bilinterms[i].var2) < 0); in removeFixedVariables()
5820 var1cmp = SCIPvarCompare(bilinterms[ind1].var1, bilinterms[ind2].var1); in SCIP_DECL_SORTINDCOMP()
5824 return SCIPvarCompare(bilinterms[ind1].var2, bilinterms[ind2].var2); in SCIP_DECL_SORTINDCOMP()
[all …]
|
| H A D | cons_sos1.c | 3698 assert( SCIPvarCompare(nodedbgdata->var, SCIPnodeGetVarSOS1(conflictgraph, node)) == 0 ); in propVariableNonzero()
4719 assert( boundvar == NULL || SCIPvarCompare(boundvar, nodedata->ubboundvar) == 0 ); in getBoundConsFromVertices()
5107 … if ( boundvar1 != NULL && boundvar2 != NULL && SCIPvarCompare(boundvar1, boundvar2) == 0 ) in addBranchingComplementaritiesSOS1()
6521 else if ( SCIPvarCompare(lbboundvar, nodedata->lbboundvar) == 0 ) in generateBoundInequalityFromSOS1Nodes()
8366 else if ( SCIPvarCompare(boundvar, comparevar) != 0 ) in passConComponentVarbound()
|
| H A D | cons_setppc.c | 808 … assert(v == consdata->nvars-1 || SCIPvarCompare(consdata->vars[v], consdata->vars[v+1]) <= 0); in consdataSort()
2649 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 1 || in SCIP_DECL_HASHKEYEQ()
2650 SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == -1); in SCIP_DECL_HASHKEYEQ()
2654 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 0); in SCIP_DECL_HASHKEYEQ()
|
| H A D | cons_xor.c | 824 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 1 || in SCIP_DECL_HASHKEYEQ()
825 SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == -1); in SCIP_DECL_HASHKEYEQ()
|
| H A D | cons_linear.c | 3221 return SCIPvarCompare(var1, var2); in SCIP_DECL_SORTINDCOMP()
3233 return SCIPvarCompare(var1, var2); in SCIP_DECL_SORTINDCOMP()
13039 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 1 || in SCIP_DECL_HASHKEYEQ()
13040 SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == -1); in SCIP_DECL_HASHKEYEQ()
13043 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 0); in SCIP_DECL_HASHKEYEQ()
13578 varcmp = SCIPvarCompare(consdata0->vars[v0], consdata1->vars[v1]); in preprocessConstraintPairs()
|
| H A D | prop_pseudoobj.c | 315 return SCIPvarCompare(var1, var2); in SCIP_DECL_SORTPTRCOMP()
|
| H A D | cons_pseudoboolean.c | 353 assert(SCIPvarCompare(cdata1->vars[v], cdata2->vars[v]) == 1 || in SCIP_DECL_HASHKEYEQ()
354 SCIPvarCompare(cdata1->vars[v], cdata2->vars[v]) == -1); in SCIP_DECL_HASHKEYEQ()
357 assert(SCIPvarCompare(cdata1->vars[v], cdata2->vars[v]) == 0); in SCIP_DECL_HASHKEYEQ()
|
| H A D | cons_knapsack.c | 11384 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 1 || in SCIP_DECL_HASHKEYEQ()
11385 SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == -1); in SCIP_DECL_HASHKEYEQ()
11388 assert(SCIPvarCompare(consdata1->vars[i], consdata2->vars[i]) == 0); in SCIP_DECL_HASHKEYEQ()
|
| H A D | cons_cumulative.c | 12285 return SCIPvarCompare(consdata->vars[ind1], consdata->vars[ind2]); in SCIP_DECL_SORTINDCOMP()
12376 comp = SCIPvarCompare(var0, var1); in removeRedundantConss()
|
| H A D | nlp.c | 926 if( pos > 0 && SCIPvarCompare(nlrow->linvars[pos-1], nlrow->linvars[pos]) > 0 ) in nlrowAddLinearCoef()
|
| H A D | cons_nonlinear.c | 1391 …(SCIPvarCompare(consdata->linvars[consdata->nlinvars-2], consdata->linvars[consdata->nlinvars-1]) … in addLinearCoef()
|