All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.optaplanner.examples.common.experimental.impl.IntervalBreakImpl Maven / Gradle / Ivy

Go to download

OptaPlanner solves planning problems. This lightweight, embeddable planning engine implements powerful and scalable algorithms to optimize business resource scheduling and planning. This module contains the examples which demonstrate how to use it in a normal Java application.

There is a newer version: 9.44.0.Final
Show newest version
/*
 * Copyright 2021 Red Hat, Inc. and/or its affiliates.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.optaplanner.examples.common.experimental.impl;

import java.util.Objects;

import org.optaplanner.examples.common.experimental.api.IntervalBreak;
import org.optaplanner.examples.common.experimental.api.IntervalCluster;

final class IntervalBreakImpl, Difference_ extends Comparable>
        implements IntervalBreak {
    private IntervalCluster previousCluster;
    private IntervalCluster nextCluster;
    private Difference_ length;

    IntervalBreakImpl(IntervalCluster previousCluster,
            IntervalCluster nextCluster, Difference_ length) {
        this.previousCluster = previousCluster;
        this.nextCluster = nextCluster;
        this.length = length;
    }

    @Override
    public IntervalCluster getPreviousIntervalCluster() {
        return previousCluster;
    }

    @Override
    public IntervalCluster getNextIntervalCluster() {
        return nextCluster;
    }

    @Override
    public Difference_ getLength() {
        return length;
    }

    void setPreviousCluster(IntervalCluster previousCluster) {
        this.previousCluster = previousCluster;
    }

    void setNextCluster(IntervalCluster nextCluster) {
        this.nextCluster = nextCluster;
    }

    void setLength(Difference_ length) {
        this.length = length;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o)
            return true;
        if (o == null || getClass() != o.getClass())
            return false;
        IntervalBreakImpl that = (IntervalBreakImpl) o;
        return Objects.equals(previousCluster, that.previousCluster) && Objects
                .equals(nextCluster, that.nextCluster) && Objects.equals(length, that.length);
    }

    @Override
    public int hashCode() {
        return Objects.hash(previousCluster, nextCluster, length);
    }

    @Override
    public String toString() {
        return "IntervalBreak{" +
                "previousCluster=" + previousCluster +
                ", nextCluster=" + nextCluster +
                ", length=" + length +
                '}';
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy