
org.btrplace.scheduler.runner.disjoint.splitter.GatherSplitter Maven / Gradle / Ivy
Show all versions of split Show documentation
/*
* Copyright 2020 The BtrPlace Authors. All rights reserved.
* Use of this source code is governed by a LGPL-style
* license that can be found in the LICENSE.txt file.
*/
package org.btrplace.scheduler.runner.disjoint.splitter;
import gnu.trove.map.hash.TIntIntHashMap;
import org.btrplace.model.Instance;
import org.btrplace.model.VM;
import org.btrplace.model.constraint.Gather;
import org.btrplace.scheduler.runner.disjoint.model.ElementSubSet;
import org.btrplace.scheduler.runner.disjoint.model.IterateProcedure;
import org.btrplace.scheduler.runner.disjoint.model.SplittableElementSet;
import java.util.List;
/**
* Splitter for {@link org.btrplace.model.constraint.Gather} constraints.
*
* When the constraint focuses VMs among different partitions,
* then it is sure the problem has no solutions.
*
* @author Fabien Hermenier
*/
public class GatherSplitter implements ConstraintSplitter {
@Override
public Class getKey() {
return Gather.class;
}
@Override
public boolean split(Gather cstr, Instance origin, final List partitions, TIntIntHashMap vmsPosition, TIntIntHashMap nodePosition) {
final boolean c = cstr.isContinuous();
return SplittableElementSet.newVMIndex(cstr.getInvolvedVMs(), vmsPosition).
forEachPartition(new IterateProcedure() {
private boolean first = true;
@Override
public boolean extract(SplittableElementSet index, int idx, int from, int to) {
if (!first) {
return false;
}
if (to - from >= 2) {
partitions.get(idx).getSatConstraints().add(new Gather(new ElementSubSet<>(index, idx, from, to), c));
first = false;
}
return true;
}
});
}
}