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

io.jenetics.ext.moea.GeneralObjectVecFactory Maven / Gradle / Ivy

The newest version!
/*
 * Java Genetic Algorithm Library (jenetics-8.1.0).
 * Copyright (c) 2007-2024 Franz Wilhelmstötter
 *
 * 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.
 *
 * Author:
 *    Franz Wilhelmstötter ([email protected])
 */
package io.jenetics.ext.moea;

import static java.lang.String.format;
import static java.util.Objects.requireNonNull;
import static io.jenetics.ext.moea.Vecs.requireVecLength;
import static io.jenetics.ext.moea.Vecs.toFlags;

import java.util.Comparator;
import java.util.List;

import io.jenetics.Optimize;

/**
 * @author Franz Wilhelmstötter
 * @version 5.2
 * @since 5.2
 */
final class GeneralObjectVecFactory implements VecFactory {
	private final boolean[] _maximisations;
	private final Comparator _comp;
	private final ElementDistance _dist;

	private final ElementComparator _comparator = this::cmp;
	private final ElementDistance _distance = this::dst;
	private final Comparator _dominance = this::dom;

	GeneralObjectVecFactory(
		final Comparator comparator,
		final ElementDistance distance,
		final List optimizes
	) {
		Vecs.checkVecLength(optimizes.size());
		_maximisations = toFlags(optimizes);
		_comp = requireNonNull(comparator);
		_dist = requireNonNull(distance);
	}

	private int cmp(final T[] u, final T[] v, final int i) {
		return _maximisations[i]
			? _comp.compare(u[i], v[i])
			: _comp.compare(v[i], u[i]);
	}

	private double dst(final T[] u, final T[] v, final int i) {
		return _maximisations[i]
			? _dist.distance(u, v, i)
			: _dist.distance(v, u, i);
	}

	private int dom(final T[] u, final T[] v) {
		return Pareto.dominance(u, v, _maximisations.length, _comparator);
	}

	@Override
	public Vec newVec(final T[] array) {
		requireVecLength(_maximisations.length, array.length);
		return new GeneralObjectVec<>(array, _comparator, _distance, _dominance);
	}

	@Override
	public String toString() {
		return format("VecFactory", _maximisations.length);
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy