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

org.neo4j.kernel.AbstractSelectorOrderer 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.26.0
Show newest version
/*
 * Copyright (c) 2002-2015 "Neo Technology,"
 * Network Engine for Objects in Lund AB [http://neotechnology.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;

import org.neo4j.graphdb.Direction;
import org.neo4j.graphdb.traversal.BranchSelector;
import org.neo4j.graphdb.traversal.SideSelector;
import org.neo4j.graphdb.traversal.TraversalBranch;
import org.neo4j.graphdb.traversal.TraversalContext;

/**
 * @deprecated This will be moved to internal packages in the next major release.
 */
@Deprecated
public abstract class AbstractSelectorOrderer implements SideSelector
{
    private static final BranchSelector EMPTY_SELECTOR = new BranchSelector()
    {
        @Override
        public TraversalBranch next( TraversalContext metadata )
        {
            return null;
        }
    };

    private final BranchSelector[] selectors;
    @SuppressWarnings( "unchecked" )
    private final T[] states = (T[]) new Object[2];
    private int selectorIndex;

    public AbstractSelectorOrderer( BranchSelector startSelector, BranchSelector endSelector )
    {
        selectors = new BranchSelector[] { startSelector, endSelector };
        states[0] = initialState();
        states[1] = initialState();
    }

    protected T initialState()
    {
        return null;
    }

    protected void setStateForCurrentSelector( T state )
    {
        states[selectorIndex] = state;
    }

    protected T getStateForCurrentSelector()
    {
        return states[selectorIndex];
    }

    protected TraversalBranch nextBranchFromCurrentSelector( TraversalContext metadata,
            boolean switchIfExhausted )
    {
        return nextBranchFromSelector( metadata, selectors[selectorIndex], switchIfExhausted );
    }

    protected TraversalBranch nextBranchFromNextSelector( TraversalContext metadata,
            boolean switchIfExhausted )
    {
        return nextBranchFromSelector( metadata, nextSelector(), switchIfExhausted );
    }

    private TraversalBranch nextBranchFromSelector( TraversalContext metadata,
            BranchSelector selector, boolean switchIfExhausted )
    {
        TraversalBranch result = selector.next( metadata );
        if ( result == null )
        {
            selectors[selectorIndex] = EMPTY_SELECTOR;
            if ( switchIfExhausted )
            {
                result = nextSelector().next( metadata );
                if ( result == null )
                {
                    selectors[selectorIndex] = EMPTY_SELECTOR;
                }
            }
        }
        return result;
    }

    protected BranchSelector nextSelector()
    {
        selectorIndex = (selectorIndex+1)%2;
        BranchSelector selector = selectors[selectorIndex];
        return selector;
    }

    @Override
    public Direction currentSide()
    {
        return selectorIndex == 0 ? Direction.OUTGOING : Direction.INCOMING;
    }

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy