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

org.neo4j.kernel.PathDescription 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 java.util.ArrayList;
import java.util.Collections;
import java.util.List;

import org.neo4j.graphdb.Direction;
import org.neo4j.graphdb.Expander;
import org.neo4j.graphdb.Path;
import org.neo4j.graphdb.PathExpander;
import org.neo4j.graphdb.Relationship;
import org.neo4j.graphdb.RelationshipType;
import org.neo4j.graphdb.traversal.BranchState;

import static org.neo4j.kernel.Traversal.expanderForTypes;

/**
 * Experimental and very crude utility for building a slightly more powerful
 * expander to use in a traversal.
 * 
 * @author Mattias Persson
 * @deprecated This was an experimental feature which we have rolled back.
 */
@Deprecated
public class PathDescription
{
    private final List steps;
    
    public PathDescription()
    {
        this( new ArrayList() );
    }
    
    private PathDescription( List steps )
    {
        this.steps = steps;
    }
    
    public PathDescription step( RelationshipType type )
    {
        return step( expanderForTypes( type ) );
    }
    
    public PathDescription step( RelationshipType type, Direction direction )
    {
        return step( expanderForTypes( type, direction ) );
    }
    
    public PathDescription step( Expander expander )
    {
        List newSteps = new ArrayList( steps );
        newSteps.add( expander );
        return new PathDescription( newSteps );
    }
    
    public PathExpander build()
    {
        return new CrudeAggregatedExpander( steps );
    }
    
    private static class CrudeAggregatedExpander implements PathExpander
    {
        private final List steps;

        CrudeAggregatedExpander( List steps )
        {
            this.steps = steps;
        }
        
        @Override
        public Iterable expand( Path path, BranchState state )
        {
            Expander expansion;
            try
            {
                expansion = steps.get( path.length() );
            }
            catch ( IndexOutOfBoundsException e )
            {
                return Collections.emptyList();
            }
            return expansion.expand( path.endNode() );
        }

        @Override
        public PathExpander reverse()
        {
            List reversedSteps = new ArrayList();
            for ( Expander step : steps )
                reversedSteps.add( step.reversed() );
            Collections.reverse( reversedSteps );
            return new CrudeAggregatedExpander( reversedSteps );
        }
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy