Examples of org.neo4j.graphdb.StopEvaluator

org.neo4j.graphdb.StopEvaluator
k traversal if the node has a property with key 'key' and value // 'someValue' public boolean {@link #isStopNode(TraversalPosition) isStopNode}( {@link TraversalPosition} position ){ if ( position. {@link TraversalPosition#isStartNode() isStartNode}() ) { return false; } {@link Node} node = position.{@link TraversalPosition#currentNode() currentNode}(); Object someProp = node. {@link Node#getProperty(String,Object) getProperty}( "key", null ); return someProp instanceof String && ((String) someProp).equals( "someValue" ); } };

    private List<Node> findPath( final Node startNode, final Node endNode,
        final RelationshipType relType )
    {
        final Map<Node,Node> traversedNodes1 = new HashMap<Node,Node>();
        final Map<Node,Node> traversedNodes2 = new HashMap<Node,Node>();
        final StopEvaluator stopEval = new PathStopEval();
        final PathReturnEval returnEval1 = new PathReturnEval( traversedNodes1,
            traversedNodes2 );
        final PathReturnEval returnEval2 = new PathReturnEval( traversedNodes2,
            traversedNodes1 );
        final Traverser trav1 = startNode.traverse( Order.BREADTH_FIRST,

View Full Code Here

    }


    public Iterable<Node> getAllNodesAfter( final long timestamp )
    {
        Node startNode = getIndexedStartNode( timestamp );
        return startNode.traverse( Order.DEPTH_FIRST, new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                if ( position.lastRelationshipTraversed() != null
                     && position.currentNode().equals( underlyingNode ) )

View Full Code Here

    }


    Iterable<Node> getAllTimeNodesAfter( final long timestamp )
    {
        Node startNode = getIndexedStartNode( timestamp );
        return startNode.traverse( Order.DEPTH_FIRST, new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                if ( position.lastRelationshipTraversed() != null
                     && position.currentNode().equals( underlyingNode ) )

View Full Code Here

        }, RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
    }


    public Iterable<Node> getAllNodesBefore( final long timestamp )
    {
        return underlyingNode.traverse( Order.DEPTH_FIRST, new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                Relationship last = position.lastRelationshipTraversed();
                if ( last != null

View Full Code Here

        {
            throw new IllegalArgumentException(
                    "Start time greater or equal to end time" );
        }
        Node startNode = getIndexedStartNode( startTime );
        return startNode.traverse( Order.DEPTH_FIRST, new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                Relationship last = position.lastRelationshipTraversed();
                if ( last != null

View Full Code Here

        getNodeWithName( "3" ).setProperty( "timestamp", 2L );
        tx.success();
        tx.finish();
        
        final RelationshipType type = DynamicRelationshipType.withName( "TO" );
        Traverser t = referenceNode().traverse( Order.DEPTH_FIRST, new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                Relationship last = position.lastRelationshipTraversed();
                if ( last != null && last.isType( type ) )

View Full Code Here


        // Traverse only ISE relationships
        RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };


        // Construct a stop evaluator that stops on nodes 5, 6, 3 and 4
        StopEvaluator stopEvaluator = new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                try
                {

View Full Code Here

        // Traverse only ISE relationships
        RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };


        // Construct a stop evaluator that stops on nodes 2, 3, and 4
        // (ie root's children)
        StopEvaluator stopEvaluator = new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                try
                {

View Full Code Here


        // Traverse only ISE relationships
        RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };


        // Construct a stop evaluator that stops on depth 2
        StopEvaluator stopEvaluator = new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                return position.depth() >= 2;
            }

View Full Code Here


        // Traverse only ISE relationships
        RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };


        // Construct stop- and returnable evaluators that return 5 nodes
        StopEvaluator stopEvaluator = new StopEvaluator()
        {
            public boolean isStopNode( TraversalPosition position )
            {
                // Stop traversing when we've returned 5 nodes
                return position.returnedNodesCount() >= 5;

View Full Code Here

0 1

TOP

Related Classes of org.neo4j.graphdb.StopEvaluator

org.neo4j.collections.timeline.Timeline

org.neo4j.examples.imdb.util.SimplePathFinder_Old

org.neo4j.kernel.impl.traversal.CircularGraphTest

org.neo4j.kernel.impl.traversal.TestTraversal

org.neo4j.neoclipse.view.NeoGraphRelationshipContentProvider

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.