#
SET(LIBSATSOLVER_MAJOR "0")
-SET(LIBSATSOLVER_MINOR "13")
-SET(LIBSATSOLVER_PATCH "5")
+SET(LIBSATSOLVER_MINOR "14")
+SET(LIBSATSOLVER_PATCH "0")
-# last released 0.13.5
+# last released 0.14.0
-------------------------------------------------------------------
+Wed Mar 4 14:39:00 CET 2009 - mls@suse.de
+
+- fix problem_to_solutions segfault
+- bump version to 0.14 to make it different from code11 branch
+- 0.14.0
+
+-------------------------------------------------------------------
Mon Mar 2 18:20:22 CET 2009 - mls@suse.de
- add solver_trivial_installable() to fix multiversion patches [bnc#480303]
/* infarch rule, find replacement */
assert(solv->rules[why].p < 0);
name = pool->solvables[-solv->rules[why].p].name;
- while (why >= solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
+ while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
why--;
p = 0;
for (; why < solv->infarchrules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
/* dist upgrade rule, find replacement */
assert(solv->rules[why].p < 0);
name = pool->solvables[-solv->rules[why].p].name;
- while (why >= solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
+ while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
why--;
p = 0;
- for (; why < solv->infarchrules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
+ for (; why < solv->duprules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
if (solv->decisionmap[-solv->rules[why].p] > 0)
{
p = -solv->rules[why].p;
#define SOLVER_SELECTMASK 0xff
+#define SOLVER_NOOP 0x0000
#define SOLVER_INSTALL 0x0100
#define SOLVER_ERASE 0x0200
#define SOLVER_UPDATE 0x0300