org.btrplace.model.constraint.migration.Precedence Maven / Gradle / Ivy

Go to download
/*
 * Copyright (c) 2016 University Nice Sophia Antipolis
 *
 * This file is part of btrplace.
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 3 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see .
 */

package org.btrplace.model.constraint.migration;

import org.btrplace.model.Node;
import org.btrplace.model.VM;
import org.btrplace.model.constraint.SatConstraint;

import java.util.*;

/**
 * A constraint to force one or more VMs to migrate before one or more other VMs.
 *
 * @author Vincent Kherbache
 */
public class Precedence implements SatConstraint {

    private VM before;
    private VM after;

    /**
     * Make a new precedence constraint.
     *
     * @param vmBefore the vm to schedule before the other one
     * @param vmAfter  the vm to schedule after the other one
     */
    public Precedence(VM vmBefore, VM vmAfter) {
        this.before = vmBefore;
        this.after = vmAfter;
    }

    @Override
    public boolean setContinuous(boolean b) {
        return b;
    }

    @Override
    public PrecedenceChecker getChecker() {
        return new PrecedenceChecker(this);
    }

    @Override
    public String toString() {
        return "precedence(" + "vms=" + getInvolvedVMs() + ", continuous)";
    }

    @Override
    public Collection getInvolvedNodes() {
        return Collections.emptyList();
    }

    @Override
    public Collection getInvolvedVMs() {
        return Arrays.asList(before, after);
    }

    @Override
    public boolean isContinuous() {
        return false;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) {
            return true;
        }
        if (o == null || getClass() != o.getClass()) {
            return false;
        }
        Precedence that = (Precedence) o;
        return Objects.equals(before, that.before) &&
                Objects.equals(after, that.after);
    }

    @Override
    public int hashCode() {
        return Objects.hash(before, after);
    }

    /**
     * Instantiate discrete constraints to force a set of VMs to migrate after a single one.
     *
     * @param vmBefore the (single) VM to migrate before the others
     * @param vmsAfter the VMs to migrate after the other one
     * @return the associated list of constraints
     */
    public static List newPrecedence(VM vmBefore, Collection vmsAfter) {
        return newPrecedence(Collections.singleton(vmBefore), vmsAfter);
    }

    /**
     * Instantiate discrete constraints to force a single VM to migrate after a set of VMs.
     *
     * @param vmsBefore the VMs to migrate before the other one
     * @param vmAfter   the (single) VM to migrate after the others
     * @return the associated list of constraints
     */
    public static List newPrecedence(Collection vmsBefore, VM vmAfter) {
        return newPrecedence(vmsBefore, Collections.singleton(vmAfter));
    }

    /**
     * Instantiate discrete constraints to force a set of VMs to migrate after an other set of VMs.
     *
     * @param vmsBefore the VMs to migrate before the others
     * @param vmsAfter  the VMs to migrate after the others
     * @return the associated list of constraints
     */
    public static List newPrecedence(Collection vmsBefore, Collection vmsAfter) {
        List l = new ArrayList<>(vmsBefore.size() * vmsAfter.size());
        for (VM vmb : vmsBefore) {
            for (VM vma : vmsAfter) {
                l.add(new Precedence(vmb, vma));
            }
        }
        return l;
    }
}