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

org.yx.util.kit.PriorityKits Maven / Gradle / Ivy

There is a newer version: 4.0.2
Show newest version
/**
 * Copyright (C) 2016 - 2030 youtongluan.
 *
 * 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.yx.util.kit;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Comparator;
import java.util.List;
import java.util.Objects;

import org.yx.annotation.Priority;
import org.yx.conf.Const;

public class PriorityKits {

	private static final Comparator> priorityComparator = (a, b) -> a.getAnnotation(Priority.class).value()
			- b.getAnnotation(Priority.class).value();

	public static List> sort(Collection> source) {
		List> low = new ArrayList<>();
		List> high = new ArrayList<>(20);
		List> middle = new ArrayList<>(Objects.requireNonNull(source).size());
		for (Class c : source) {
			Priority p = c.getAnnotation(Priority.class);
			if (p == null || p.value() == Const.DEFAULT_ORDER) {
				middle.add(c);
			} else if (p.value() < Const.DEFAULT_ORDER) {
				low.add(c);
			} else {
				high.add(c);
			}
		}
		low.sort(priorityComparator);
		high.sort(priorityComparator);
		List> ret = new ArrayList<>(source.size());
		ret.addAll(low);
		ret.addAll(middle);
		ret.addAll(high);
		return ret;
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy