tree 542890fc7998f5592a6e7f6cb32fa613e53786d6
parent 61125591e1de23992279938eebf8c54f47d7e0a9
author Benjamin Tissoires <benjamin.tissoires@redhat.com> 1428266495 -0700
committer Dmitry Torokhov <dmitry.torokhov@gmail.com> 1428338253 -0700

Input: MT - make slot assignment work for overcovered solutions

The recent inclusion of a deassignment cost in the slot assignment
algorithm did not properly account for the corner cases where the
solutions are overcovered. This change makes sure the resulting
assignment is unique, allocating new slots when necessary.

Signed-off-by: Henrik Rydberg <rydberg@bitmath.org>
Signed-off-by: Benjamin Tissoires <benjamin.tissoires@redhat.com>
Acked-by: Hans de Goede <hdegoede@redhat.com>
Signed-off-by: Dmitry Torokhov <dmitry.torokhov@gmail.com>