/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package org.neo4j.internal.kernel.api.helpers;

import static java.lang.String.format;

import java.util.ArrayList;
import java.util.List;
import org.neo4j.storageengine.api.RelationshipDirection;

public class TestRelationshipChain {
    private List<Data> data;
    private long originNodeId;

    public TestRelationshipChain(long originNodeId) {
        this(originNodeId, new ArrayList<>());
    }

    private TestRelationshipChain(long originNodeId, List<Data> data) {
        this.originNodeId = originNodeId;
        this.data = data;
    }

    public TestRelationshipChain outgoing(long id, long targetNode, int type) {
        data.add(new Data(id, originNodeId, targetNode, type));
        return this;
    }

    public TestRelationshipChain incoming(long id, long sourceNode, int type) {
        data.add(new Data(id, sourceNode, originNodeId, type));
        return this;
    }

    public TestRelationshipChain loop(long id, int type) {
        data.add(new Data(id, originNodeId, originNodeId, type));
        return this;
    }

    public Data get(int offset) {
        return data.get(offset);
    }

    boolean isValidOffset(int offset) {
        return offset >= 0 && offset < data.size();
    }

    long originNodeId() {
        return originNodeId;
    }

    public TestRelationshipChain tail() {
        return new TestRelationshipChain(originNodeId, data.subList(1, data.size()));
    }

    record Data(long id, long source, long target, int type) {
        RelationshipDirection relationshipDirection(long nodeReference) {
            if (source == target) {
                return RelationshipDirection.LOOP;
            }
            return nodeReference == source ? RelationshipDirection.OUTGOING : RelationshipDirection.INCOMING;
        }

        @Override
        public String toString() {
            return format("(%d)-[%d,type:%d]->(%d)", source, id, type, target);
        }
    }
}
