Examples of org.neo4j.graphdb.ReturnableEvaluator

org.neo4j.graphdb.ReturnableEvaluator
rn nodes that don't have any outgoing relationships, // only incoming relationships, i.e. leaf nodes. return !position. {@link TraversalPosition#currentNode() currentNode}(). {@link Node#hasRelationship(Direction) hasRelationship}( {@link Direction#OUTGOING Direction.OUTGOING} );} };

    {
        Transaction tx = graphDb.beginTx();
        try
        {
            Traverser traverser = node.traverse( Traverser.Order.DEPTH_FIRST,
                    StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
                    {
                        public boolean isReturnableNode(
                                TraversalPosition position )
                        {
                            Node currentNode = position.currentNode();

View Full Code Here

    public Iterable<Node> getAllNodes()
    {
        return underlyingNode.traverse(
                Order.BREADTH_FIRST,
                StopEvaluator.END_OF_GRAPH,
                new ReturnableEvaluator()
                {
                    public boolean isReturnableNode( TraversalPosition position )
                    {
                        Relationship last = position.lastRelationshipTraversed();
                        if ( last != null

View Full Code Here

    }


    Iterable<Node> getAllTimeNodes()
    {
        return underlyingNode.traverse( Order.DEPTH_FIRST,
                StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
                {
                    public boolean isReturnableNode( TraversalPosition position )
                    {
                        return position.depth() > 0;
                    }

View Full Code Here

                {
                    return true;
                }
                return false;
            }
        }, new ReturnableEvaluator()
        {
            private boolean timeOk = false;


            public boolean isReturnableNode( TraversalPosition position )
            {

View Full Code Here

                {
                    return true;
                }
                return false;
            }
        }, new ReturnableEvaluator()
        {
            private boolean timeOk = false;


            public boolean isReturnableNode( TraversalPosition position )
            {

View Full Code Here

                    long currentTime = (Long) node.getProperty( TIMESTAMP );
                    return currentTime >= timestamp;
                }
                return false;
            }
        }, new ReturnableEvaluator()
        {
            public boolean isReturnableNode( TraversalPosition position )
            {
                Relationship last = position.lastRelationshipTraversed();
                if ( last != null

View Full Code Here

                    long currentTime = (Long) node.getProperty( TIMESTAMP );
                    return currentTime >= endTime;
                }
                return false;
            }
        }, new ReturnableEvaluator()
        {
            private boolean timeOk = false;


            public boolean isReturnableNode( TraversalPosition position )
            {

View Full Code Here

   */
  public Iterable<Object> values()
  {
    Traverser trav = getTreeRoot().getUnderlyingNode().traverse( 
      Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
      new ReturnableEvaluator()
      {
        public boolean isReturnableNode( TraversalPosition pos )
        {
          Relationship last = pos.lastRelationshipTraversed();
          if ( last != null && last.getType().equals(

View Full Code Here

            datasetNode = rel.getStartNode();
        }
    }
    
  public Iterable<Node> getAllUserNodes() {
    return datasetNode.traverse(Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator(){


      public boolean isReturnableNode(TraversalPosition current) {
        Relationship rel = current.lastRelationshipTraversed();
        return rel != null && rel.isType(OSMRelation.OSM_USER);
      }},

View Full Code Here

      }},
        OSMRelation.USERS, Direction.OUTGOING, OSMRelation.OSM_USER, Direction.OUTGOING);
  }


  public Iterable<Node> getAllChangesetNodes() {
    return datasetNode.traverse(Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator(){


      public boolean isReturnableNode(TraversalPosition current) {
        Relationship rel = current.lastRelationshipTraversed();
        return rel != null && rel.isType(OSMRelation.USER);
      }},

View Full Code Here

0 1

TOP

Related Classes of org.neo4j.graphdb.ReturnableEvaluator

org.neo4j.collections.btree.BTree

org.neo4j.collections.timeline.Timeline

org.neo4j.gis.spatial.osm.OSMDataset

org.neo4j.kernel.impl.traversal.CircularGraphTest

org.neo4j.kernel.impl.traversal.TestTraversal

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.