Test that the number Availability#numMatched has increased with one and that the supervisor with highest available slots are chosen.
This commit is contained in:
parent
380822ed8d
commit
8bb31b0cb7
@ -481,7 +481,7 @@ public class TestGreedyMatchingAlgorithm {
|
||||
assertTrue(result.matches.get(0).getSupervisor().equals(bachelorSupervisor2));
|
||||
found = false;
|
||||
for(Availability availability : supervisorAvailability) {
|
||||
if(availability.getSupervisor().equals(bachelorSupervisor2)) {
|
||||
if(availability.getSupervisor().equals(result.matches.get(0).getSupervisor())) {
|
||||
assertTrue(availability.getNumMatched() == 1);
|
||||
assertTrue(availability.getNumCapable() == 4);
|
||||
found = true;
|
||||
|
Loading…
x
Reference in New Issue
Block a user