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

import org.neo4j.graphdb.Transaction;
import org.neo4j.internal.kernel.api.exceptions.ProcedureException;
import org.neo4j.kernel.api.KernelTransaction;
import org.neo4j.kernel.api.exceptions.Status;
import org.neo4j.kernel.impl.coreapi.InternalTransaction;
import org.neo4j.logging.InternalLog;

public class MyCoreAPI {
    private final InternalLog log;

    public MyCoreAPI(InternalLog log) {
        this.log = log;
    }

    public long makeNode(Transaction tx, String label) throws ProcedureException {
        try {
            KernelTransaction ktx = ((InternalTransaction) tx).kernelTransaction();
            long nodeId = ktx.dataWrite().nodeCreate();
            int labelId = ktx.tokenWrite().labelGetOrCreateForName(label);
            ktx.dataWrite().nodeAddLabel(nodeId, labelId);
            return nodeId;
        } catch (Exception e) {
            log.error("Failed to create node: " + e.getMessage());
            throw new ProcedureException(
                    Status.Procedure.ProcedureCallFailed, "Failed to create node: " + e.getMessage(), e);
        }
    }

    public static long countNodes(Transaction tx) {
        KernelTransaction kernelTransaction = ((InternalTransaction) tx).kernelTransaction();
        return kernelTransaction.dataRead().countsForNode(-1);
    }
}
