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

org.neo4j.kernel.impl.traversal.TraversalBranchWithState Maven / Gradle / Ivy

Go to download

Neo4j kernel is a lightweight, embedded Java database designed to store data structured as graphs rather than tables. For more information, see http://neo4j.org.

There is a newer version: 5.25.1
Show newest version
/*
 * 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 .
 */
package org.neo4j.kernel.impl.traversal;

import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.PathExpander;
import org.neo4j.graphdb.Relationship;
import org.neo4j.graphdb.ResourceIterator;
import org.neo4j.graphdb.traversal.BranchState;
import org.neo4j.graphdb.traversal.InitialBranchState;
import org.neo4j.graphdb.traversal.TraversalBranch;
import org.neo4j.graphdb.traversal.TraversalContext;
import org.neo4j.internal.helpers.collection.Iterators;

public class TraversalBranchWithState extends TraversalBranchImpl implements BranchState
{
    protected final Object stateForMe;
    protected Object stateForChildren;

    public TraversalBranchWithState( TraversalBranch parent, int depth, Node source, Relationship toHere, Object inheritedState )
    {
        super( parent, depth, source, toHere );
        this.stateForMe = this.stateForChildren = inheritedState;
    }

    public TraversalBranchWithState( TraversalBranch parent, Node source, InitialBranchState initialState )
    {
        super( parent, source );
        this.stateForMe = this.stateForChildren = initialState.initialState( this );
    }

    @Override
    public void setState( Object state )
    {
        this.stateForChildren = state;
    }

    @Override
    public Object getState()
    {
        return this.stateForMe;
    }

    @Override
    protected TraversalBranch newNextBranch( Node node, Relationship relationship )
    {
        return new TraversalBranchWithState( this, length() + 1, node, relationship, stateForChildren );
    }

    @Override
    protected ResourceIterator expandRelationshipsWithoutChecks( PathExpander expander )
    {
        Iterable expandIterable = expander.expand( this, this );
        return Iterators.asResourceIterator( expandIterable );
    }

    @Override
    public Object state()
    {
        return this.stateForMe;
    }

    @Override
    protected void evaluate( TraversalContext context )
    {
        setEvaluation( context.evaluate( this, this ) );
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy