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

org.ojalgo.structure.VectorView Maven / Gradle / Ivy

Go to download

oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation.

There is a newer version: 55.0.1
Show newest version
/*
 * Copyright 1997-2021 Optimatika
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
package org.ojalgo.structure;

import java.util.Iterator;

import org.ojalgo.ProgrammingError;

public class VectorView> implements Access1D, Iterable>, Iterator>, Comparable> {

    private final long myCount;
    private final AccessAnyD myDelegateAnyD;
    private final long myLastOffset;
    private long myOffset;

    protected VectorView(final AccessAnyD access) {
        this(access, -1L);
    }

    VectorView(final AccessAnyD access, final long index) {

        super();

        myDelegateAnyD = access;

        myCount = access.count(0);

        myOffset = index * myCount;
        myLastOffset = myDelegateAnyD.count() - myCount;
    }

    public int compareTo(final VectorView other) {
        return Long.compare(myOffset, other.getOffset());
    }

    public long count() {
        return myCount;
    }

    public double doubleValue(final long index) {
        return myDelegateAnyD.doubleValue(myOffset + Structure2D.index(myCount, index, 0));
    }

    public long estimateSize() {
        return (myLastOffset - myOffset) / myCount;
    }

    public N get(final long index) {
        return myDelegateAnyD.get(myOffset + Structure2D.index(myCount, index, 0));
    }

    public boolean hasNext() {
        return myOffset < myLastOffset;
    }

    public boolean hasPrevious() {
        return myOffset > 0L;
    }

    /**
     * @return The index of the matrix (which matrix are we currently viewing).
     */
    public long index() {
        return myOffset / myCount;
    }

    public VectorView iterator() {
        return new VectorView<>(myDelegateAnyD);
    }

    public VectorView next() {
        myOffset += myCount;
        return this;
    }

    public VectorView previous() {
        myOffset -= myCount;
        return this;
    }

    public final void remove() {
        ProgrammingError.throwForUnsupportedOptionalOperation();
    }

    @Override
    public final String toString() {
        return this.index() + " = " + Access1D.toString(this);
    }

    protected void setIndex(final long matrix) {
        myOffset = matrix * myCount;
    }

    long getOffset() {
        return myOffset;
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy