/*
 * Java Genetic Algorithm Library (jenetics-7.2.0).
 * Copyright (c) 2007-2023 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 (franz.wilhelmstoetter@gmail.com)
 */
package io.jenetics.internal.collection;

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

import java.io.Serial;
import java.util.Comparator;
import java.util.Iterator;
import java.util.ListIterator;
import java.util.function.Function;
import java.util.function.Supplier;
import java.util.random.RandomGenerator;

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

/**
 * @author <a href="mailto:franz.wilhelmstoetter@gmail.com">Franz Wilhelmstötter</a>
 * @since 1.4
 * @version 3.4
 */
public class ArrayMSeq<T> extends ArraySeq<T> implements MSeq<T> {

        @Serial
        private static final long serialVersionUID = 1L;

        public ArrayMSeq(final Array<T> array) {
                super(array);
        }

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

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

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

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

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

        @Override
        public MSeq<T> setAll(final Iterable<? extends T> values) {
                return setAll(values.iterator());
        }

        @Override
        public MSeq<T> 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<T> fill(final Supplier<? extends T> supplier) {
                for (int i = 0; i < array.length(); ++i) {
                        array.set(i, supplier.get());
                }
                return this;
        }

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

        @Override
        public MSeq<T> shuffle(final RandomGenerator 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
        public void swap(int start, int end, MSeq<T> 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<T> 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<T> 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 <B> MSeq<B> map(final Function<? super T, ? extends B> mapper) {
                final Array<B> 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<T> append(final Iterable<? extends T> values) {
                return new ArrayMSeq<>(__append(values));
        }

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

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

}