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

org.drools.planner.core.domain.entity.PlanningEntitySorter Maven / Gradle / Ivy

Go to download

Drools Planner optimizes automated planning by combining metaheuristic search algorithms with rule engine powered score calculation. This is the drools-planner-core module which contains metaheuristic algorithms.

There is a newer version: 6.0.0.Alpha9
Show newest version
/*
 * Copyright 2011 JBoss Inc
 *
 * 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.drools.planner.core.domain.entity;

import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.SortedMap;
import java.util.TreeMap;

import org.drools.planner.api.domain.entity.PlanningEntityDifficultyWeightFactory;
import org.drools.planner.core.solution.Solution;

/**
 * Helper class for {@link PlanningEntityDifficultyWeightFactory}.
 * @see PlanningEntityDifficultyWeightFactory
 */
public class PlanningEntitySorter {

    // TODO also keep PlanningEntityDescriptor?

    private Comparator difficultyComparator = null;
    private PlanningEntityDifficultyWeightFactory difficultyWeightFactory = null;

    public PlanningEntitySorter() {
    }

    public void setDifficultyComparator(Comparator difficultyComparator) {
        this.difficultyComparator = difficultyComparator;
    }

    public void setDifficultyWeightFactory(PlanningEntityDifficultyWeightFactory difficultyWeightFactory) {
        this.difficultyWeightFactory = difficultyWeightFactory;
    }

    public boolean isSortDifficultySupported() {
        return difficultyComparator != null || difficultyWeightFactory != null;
    }

    public void sortDifficultyAscending(Solution solution, List planningEntityList) {
        if (difficultyComparator != null) {
            Collections.sort(planningEntityList, difficultyComparator);
        } else if (difficultyWeightFactory != null) {
            SortedMap planningEntityMap = new TreeMap();
            for (Object planningEntity : planningEntityList) {
                Comparable difficultyWeight = difficultyWeightFactory.createDifficultyWeight(solution, planningEntity);
                Object previous = planningEntityMap.put(difficultyWeight, planningEntity);
                if (previous != null) {
                    throw new IllegalStateException("The planningEntityList contains 2 times the same planningEntity ("
                            + previous + ") and (" + planningEntity + ").");
                }
            }
            planningEntityList.clear();
            planningEntityList.addAll(planningEntityMap.values());
        } else {
            throw new IllegalStateException("Sorting on difficulty is impossible" +
                    " because difficultyComparator and difficultyWeightFactory are null.");
        }
    }

    public void sortDifficultyDescending(Solution solution, List planningEntityList) {
        sortDifficultyAscending(solution, planningEntityList);
        Collections.reverse(planningEntityList);
    }

}
 















© 2015 - 2024 Weber Informatics LLC | Privacy Policy