io.jenetics.internal.collection.ArrayMSeq Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of jenetics Show documentation
Jenetics - Java Genetic Algorithm Library
There is a newer version: 8.1.0
/*
 * Java Genetic Algorithm Library (jenetics-4.0.0).
 * Copyright (c) 2007-2017 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.internal.collection;

import static java.lang.Math.min;
import static java.lang.String.format;

import java.util.Comparator;
import java.util.Iterator;
import java.util.ListIterator;
import java.util.Random;
import java.util.function.Function;
import java.util.function.Supplier;

import io.jenetics.util.ISeq;
import io.jenetics.util.MSeq;

/**
 * @author Franz Wilhelmstötter
 * @since 1.4
 * @version 3.4
 */
public class ArrayMSeq extends ArraySeq implements MSeq {
	private static final long serialVersionUID = 1L;

	public ArrayMSeq(final Array array) {
		super(array);
	}

	@Override
	public MSeq copy() {
		return isEmpty()
			? this
			: new ArrayMSeq<>(array.copy());
	}

	@Override
	public Iterator iterator() {
		return listIterator();
	}

	@Override
	public ListIterator listIterator() {
		return new ArrayMIterator<>(array);
	}

	@Override
	public void set(final int index, final T value) {
		array.set(index, value);
	}

	@Override
	public MSeq setAll(final Iterator it) {
		for (int i = 0; i < array.length() && it.hasNext(); ++i) {
			array.set(i, it.next());
		}
		return this;
	}

	@Override
	public MSeq setAll(final Iterable values) {
		return setAll(values.iterator());
	}

	@Override
	public MSeq setAll(final T[] values) {
		for (int i = 0, n = min(array.length(), values.length); i < n; ++i) {
			array.set(i, values[i]);
		}
		return this;
	}

	public MSeq fill(final Supplier supplier) {
		for (int i = 0; i < array.length(); ++i) {
			array.set(i, supplier.get());
		}
		return this;
	}

	@Override
	public ArrayMSeq sort(
		final int start,
		final int end,
		final Comparator comparator
	) {
		array.sort(start, end, comparator);
		return this;
	}

	@Override
	public MSeq shuffle(final Random random) {
		for (int j = length() - 1; j > 0; --j) {
			swap(j, random.nextInt(j + 1));
		}
		return this;
	}

	@Override
	public void swap(final int i, final int j) {
		final T temp = array.get(i);
		array.set(i, array.get(j));
		array.set(j, temp);
	}

	@Override
	@SuppressWarnings("unchecked")
	public void swap(int start, int end, MSeq other, int otherStart) {
		checkIndex(start, end, otherStart, other.length());

		if (start < end) {
			for (int i = end - start; --i >= 0;) {
				final T temp = array.get(i + start);
				array.set(i + start, other.get(otherStart + i));
				other.set(otherStart + i, temp);
			}
		}
	}

	protected void checkIndex(
		final int start, final int end,
		final int otherStart, final int otherLength
	) {
		array.checkIndex(start, end);
		if (otherStart < 0 || (otherStart + (end - start)) > otherLength) {
			throw new ArrayIndexOutOfBoundsException(format(
				"Invalid index range: [%d, %d)",
				otherStart, otherStart + end - start
			));
		}
	}

	@Override
	public MSeq subSeq(final int start, final int end) {
		if (start > end) {
			throw new ArrayIndexOutOfBoundsException(format(
				"start[%d] > end[%d]", start, end
			));
		}
		if (start < 0 || end > length()) {
			throw new ArrayIndexOutOfBoundsException(format(
				"Indexes (%d, %d) range: [%d..%d)", start, end, 0, length()
			));
		}

		return start == end
			? Empty.mseq()
			: new ArrayMSeq<>(array.slice(start, end));
	}

	@Override
	public MSeq subSeq(final int start) {
		if (start < 0 || start > length()) {
			throw new ArrayIndexOutOfBoundsException(format(
				"Index %d range: [%d..%d)", start, 0, length()
			));
		}

		return start == length()
			? Empty.mseq()
			: new ArrayMSeq<>(array.slice(start, length()));
	}

	@Override
	public  MSeq map(final Function mapper) {
		final Array mapped = Array.ofLength(length());
		for (int i = 0; i < length(); ++i) {
			mapped.set(i, mapper.apply(array.get(i)));
		}
		return new ArrayMSeq<>(mapped);
	}

	@Override
	public MSeq append(final Iterable values) {
		return new ArrayMSeq<>(__append(values));
	}

	@Override
	public MSeq prepend(final Iterable values) {
		return new ArrayMSeq<>(__prepend(values));
	}

	@Override
	public ISeq toISeq() {
		return isEmpty()
			? Empty.iseq()
			: new ArrayISeq<>(array.seal());
	}

}