openSUSE/libsolv
1
0
Fork 0
mirror of https://github.com/openSUSE/libsolv.git synced 2026-02-05 12:45:46 +01:00
Code Issues Releases Activity

Support alternative disfavor in example solver

Browse Source 
Just for testing purposes...
This commit is contained in:
Michael Schroeder
2016-05-04 11:11:23 +02:00
parent 1c8f75e7c1
commit e48fbd2121
1 changed files with 16 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
examples/solv/solv.c
View File

@@ -780,7 +780,6 @@ rerunsolver:
Queue answerq;
Id id, from, chosen;
int j;
int take = 0;
queue_init(&choicesq);
queue_init(&answerq);
@@ -802,6 +801,7 @@ rerunsolver:
for (;;)
{
char inbuf[128], *ip;
int neg = 0;
printf("OK to continue (y/n), or number to change alternative: ");
fflush(stdout);
*inbuf = 0;
@@ -812,12 +812,24 @@ rerunsolver:
}
while (*ip == ' ' || *ip == '\t')
ip++;
if (*ip == '-' && ip[1] >= '0' && ip[1] <= '9')
{
neg = 1;
ip++;
}
if (*ip >= '0' && *ip <= '9')
{
take = atoi(ip);
int take = atoi(ip);
if (take > 0 && take <= answerq.count)
break;
take = 0;
{
Id p = answerq.elements[take - 1];
queue_free(&answerq);
queue_push2(&job, (neg ? SOLVER_DISFAVOR : SOLVER_FAVOR) | SOLVER_SOLVABLE_NAME, pool->solvables[p].name);
solver_free(solv);
solv = 0;
goto rerunsolver;
break;
}
}
if (*ip == 'n' || *ip == 'y')
{
@@ -825,15 +837,6 @@ rerunsolver:
break;
}
}
if (take > 0 && take <= answerq.count)
{
Id p = answerq.elements[take - 1];
queue_free(&answerq);
queue_push2(&job, SOLVER_FAVOR | SOLVER_SOLVABLE_NAME, pool->solvables[p].name);
solver_free(solv);
solv = 0;
goto rerunsolver;
}
queue_free(&answerq);
}
if (!answer)