Examples of firstNode()


Examples of org.neo4j.kernel.impl.nioneo.store.RelationshipData.firstNode()

            {
                throw new NotFoundException( "Relationship[" + data.getId()
                    + "] exist but relationship type[" + typeId
                    + "] not found." );
            }
            final long startNodeId = data.firstNode();
            final long endNodeId = data.secondNode();
            relationship = new RelationshipImpl( relId, startNodeId, endNodeId, type, false );
            relCache.put( relId, relationship );
            return new RelationshipProxy( relId, this );
        }
View Full Code Here

Examples of org.neo4j.kernel.impl.nioneo.store.RelationshipData.firstNode()

            {
                throw new NotFoundException( "Relationship[" + data.getId()
                    + "] exist but relationship type[" + typeId
                    + "] not found." );
            }
            relationship = new RelationshipImpl( relId, data.firstNode(), data.secondNode(), type,
                    false );
            relCache.put( relId, relationship );
            return relationship;
        }
        finally
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

            .putError(
                tr("The \"to\" way doesn't start or end at a \"via\" node."),
                true);
    } else {
      Way viaWay = (Way) via;
      Node firstNode = viaWay.firstNode();
      Node lastNode = viaWay.lastNode();
      if (fromWay.isFirstLastNode(firstNode))
        viaNode = firstNode;
      else if (fromWay.isFirstLastNode(lastNode))
        viaNode = firstNode;
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

            for(OsmPrimitive o: n.getReferrers())
                if(ways.contains(o))
                    referers.add((Way) o);
            if(referers.size() == 1) {
                Way way = referers.get(0);
                if(n == way.firstNode() || n == way.lastNode()) continue;
                cmds.add(lines.get(way).projectionCommand(n));
            }
            else if(referers.size() == 2) {
                Command cmd = lines.get(referers.get(0)).intersectionCommand(n, lines.get(referers.get(1)));
                cmds.add(cmd);
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

                        tailWays++;
                        prev = (Way) ref;

                        if (tail.equals(prev.lastNode())) {
                            tailReversed = true;
                        } else if (!tail.equals(prev.firstNode())) {
                            tailUnordered = true;
                        }
                    }
                }
            }
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

                        Boolean backwards = null;
                        int k = 1;
                        while (i_r - k >= 0 || i_r + k < relationMembers.size()) {
                            if ((i_r - k >= 0) && relationMembers.get(i_r - k).isWay()){
                                Way w = relationMembers.get(i_r - k).getWay();
                                if ((w.lastNode() == way.firstNode()) || w.firstNode() == way.firstNode()) {
                                    backwards = false;
                                } else if ((w.firstNode() == way.lastNode()) || w.lastNode() == way.lastNode()) {
                                    backwards = true;
                                }
                                break;
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

                        while (i_r - k >= 0 || i_r + k < relationMembers.size()) {
                            if ((i_r - k >= 0) && relationMembers.get(i_r - k).isWay()){
                                Way w = relationMembers.get(i_r - k).getWay();
                                if ((w.lastNode() == way.firstNode()) || w.firstNode() == way.firstNode()) {
                                    backwards = false;
                                } else if ((w.firstNode() == way.lastNode()) || w.lastNode() == way.lastNode()) {
                                    backwards = true;
                                }
                                break;
                            }
                            if ((i_r + k < relationMembers.size()) && relationMembers.get(i_r + k).isWay()){
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

                                }
                                break;
                            }
                            if ((i_r + k < relationMembers.size()) && relationMembers.get(i_r + k).isWay()){
                                Way w = relationMembers.get(i_r + k).getWay();
                                if ((w.lastNode() == way.firstNode()) || w.firstNode() == way.firstNode()) {
                                    backwards = true;
                                } else if ((w.firstNode() == way.lastNode()) || w.lastNode() == way.lastNode()) {
                                    backwards = false;
                                }
                                break;
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

                            }
                            if ((i_r + k < relationMembers.size()) && relationMembers.get(i_r + k).isWay()){
                                Way w = relationMembers.get(i_r + k).getWay();
                                if ((w.lastNode() == way.firstNode()) || w.firstNode() == way.firstNode()) {
                                    backwards = true;
                                } else if ((w.firstNode() == way.lastNode()) || w.lastNode() == way.lastNode()) {
                                    backwards = false;
                                }
                                break;
                            }
                            k++;
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.firstNode()

        }

        if (ways.size() == 1 && ways.get(0).firstNode() != ways.get(0).lastNode()) {
            // Case 1
            Way w = ways.get(0);
            fixNodes.add(w.firstNode());
            fixNodes.add(w.lastNode());
            fixNodes.addAll(nodes);
            fixNodes.addAll(collectNodesWithExternReferers(ways));
            // Temporary closed way used to reorder nodes
            Way closedWay = new Way(w);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.