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

io.jenetics.ext.BigIntegerGene Maven / Gradle / Ivy

/*
 * 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;

import static java.util.Objects.requireNonNull;
import static io.jenetics.internal.util.Hashes.hash;
import static io.jenetics.util.RandomRegistry.random;

import java.io.Serial;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.Objects;

import io.jenetics.NumericGene;
import io.jenetics.internal.util.Requires;
import io.jenetics.util.ISeq;
import io.jenetics.util.MSeq;
import io.jenetics.util.Mean;
import io.jenetics.util.RandomRegistry;

import io.jenetics.ext.internal.util.Randoms;

/**
 * Numeric chromosome implementation which holds an arbitrary sized integer
 * number.
 *
 * 

This is a * value-based class; use of identity-sensitive operations (including * reference equality ({@code ==}), identity hash code, or synchronization) on * instances of {@code IntegerGene} may have unpredictable results and should * be avoided. * * @author Franz Wilhelmstötter * @since 3.5 * @version 6.0 */ public final class BigIntegerGene implements NumericGene, Mean, Serializable { @Serial private static final long serialVersionUID = 1L; private static final BigInteger TWO = BigInteger.valueOf(2); private final BigInteger _value; private final BigInteger _min; private final BigInteger _max; private BigIntegerGene( final BigInteger value, final BigInteger min, final BigInteger max ) { _value = requireNonNull(value); _min = requireNonNull(min); _max = requireNonNull(max); } @Override public BigInteger allele() { return _value; } @Override public BigInteger min() { return _min; } @Override public BigInteger max() { return _max; } @Override public BigIntegerGene mean(final BigIntegerGene that) { final BigInteger value = _value.add(that._value).divide(TWO); return of(value, _min, _max); } @Override public BigIntegerGene newInstance(final Number number) { return of(BigInteger.valueOf(number.longValue()), _min, _max); } @Override public BigIntegerGene newInstance(final BigInteger value) { return of(value, _min, _max); } @Override public BigIntegerGene newInstance() { return of(_min, _max); } @Override public int hashCode() { return hash(_value, hash(_min, hash(_max, hash(getClass())))); } @Override public boolean equals(final Object obj) { return obj == this || obj instanceof BigIntegerGene other && Objects.equals(other._value, _value) && Objects.equals(other._min, _min) && Objects.equals(other._max, _max); } @Override public String toString() { return String.format("[%s]", _value); } /* ************************************************************************* * Static factory methods. **************************************************************************/ static ISeq seq( final BigInteger minimum, final BigInteger maximum, final int length ) { Requires.positive(length); final var r = random(); return MSeq.ofLength(length) .fill(() -> new BigIntegerGene( Randoms.nextBigInteger(minimum, maximum, r), minimum, maximum)) .toISeq(); } /** * Create a new random {@code BigIntegerGene} with the given value and the * given range. If the {@code value} isn't within the interval [min, max), * no exception is thrown. In this case the method * {@link BigIntegerGene#isValid()} returns {@code false}. * * @param value the value of the gene. * @param min the minimal valid value of this gene (inclusively). * @param max the maximal valid value of this gene (exclusively). * @return a new random {@code BigIntegerGene} * @throws NullPointerException if one of the arguments is {@code null} */ public static BigIntegerGene of( final BigInteger value, final BigInteger min, final BigInteger max ) { return new BigIntegerGene(value, min, max); } /** * Create a new random {@code BigIntegerGene}. It is guaranteed that the * value of the {@code BigIntegerGene} lies in the interval [min, max). * * @param min the minimal valid value of this gene (inclusively). * @param max the maximal valid value of this gene (exclusively). * @return a new random {@code BigIntegerGene} * @throws NullPointerException if one of the arguments is {@code null} */ public static BigIntegerGene of(final BigInteger min, final BigInteger max) { return of( Randoms.nextBigInteger(min, max, RandomRegistry.random()), min, max ); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy