Modifier and Type | Field and Description |
---|---|
private Node |
CombineWayAction.NodePair.a |
private Node |
CombineWayAction.NodePair.b |
(package private) Node |
CreateCircleAction.PolarNode.node |
private Node |
UnGlueAction.selectedNode |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Set<Node> |
SelectNonBranchingWaySequences.nodes
endpoints of selected ways
|
(package private) java.util.Set<Node> |
SelectNonBranchingWaySequences.outerNodes
outer endpoints of selected ways
|
private java.util.Map<Node,java.util.List<CombineWayAction.NodePair>> |
CombineWayAction.NodeGraph.predecessors |
private static java.util.Map<Node,EastNorth> |
OrthogonalizeAction.rememberMovements
Remember movements, so the user can later undo it for certain nodes
|
private java.util.Set<Node> |
UnGlueAction.selectedNodes |
private java.util.Map<Node,java.util.List<CombineWayAction.NodePair>> |
CombineWayAction.NodeGraph.successors |
Modifier and Type | Method and Description |
---|---|
Node |
CombineWayAction.NodePair.getA()
Replies the first node.
|
Node |
CombineWayAction.NodePair.getB()
Replies the second node
|
private Node |
JoinAreasAction.WayTraverser.getHeadNode()
Walking through
JoinAreasAction.WayInPolygon segments, head node is the current position |
private Node |
JoinAreasAction.WayTraverser.getPrevNode()
Node just before head node.
|
protected Node |
CombineWayAction.NodeGraph.getStartNode() |
static Node |
MergeNodesAction.selectTargetLocationNode(java.util.List<Node> candidates)
Select the location of the target node after merge.
|
static Node |
MergeNodesAction.selectTargetNode(java.util.Collection<Node> candidates)
Find which node to merge into (i.e.
|
Modifier and Type | Method and Description |
---|---|
private java.util.List<java.util.List<Node>> |
JoinAreasAction.buildNodeChunks(Way way,
java.util.Collection<Node> splitNodes)
Simple chunking version.
|
protected java.util.List<Node> |
CombineWayAction.NodeGraph.buildPathFromNodePairs(java.util.Stack<CombineWayAction.NodePair> path) |
java.util.List<Node> |
CombineWayAction.NodeGraph.buildSpanningPath()
Tries to find a path through the graph which visits each edge (i.e.
|
protected java.util.List<Node> |
CombineWayAction.NodeGraph.buildSpanningPath(Node startNode)
Tries to find a spanning path starting from node
startNode . |
static java.util.List<java.util.List<Node>> |
SplitWayAction.buildSplitChunks(Way wayToSplit,
java.util.List<Node> splitPoints)
Splits the nodes of
wayToSplit into a list of node sequences
which are separated at the nodes in splitPoints . |
private java.util.List<Node> |
AlignInCircleAction.collectNodesAnticlockwise(java.util.List<Way> ways)
Assuming all ways can be joined into polygon, create an ordered list of node.
|
private java.util.List<Node> |
AlignInCircleAction.collectNodesWithExternReferers(java.util.List<Way> ways)
Collect all nodes with more than one referrer.
|
java.util.List<Node> |
JoinAreasAction.AssembledPolygon.getNodes() |
protected java.util.Set<Node> |
CombineWayAction.NodeGraph.getNodes() |
protected java.util.Set<Node> |
CombineWayAction.NodeGraph.getNodes(java.util.Stack<CombineWayAction.NodePair> pairs) |
private java.util.Collection<Node> |
CopyCoordinatesAction.getSelectedNodes() |
protected java.util.Set<Node> |
CombineWayAction.NodeGraph.getTerminalNodes() |
private java.util.Set<Node> |
DistributeAction.removeNodesWithoutCoordinates(java.util.Collection<Node> col) |
Modifier and Type | Method and Description |
---|---|
private void |
SelectNonBranchingWaySequences.addNodes(Node node)
Add a way endpoint to nodes, outerNodes
|
private Command |
AlignInLineAction.alignSingleNode(Node node,
java.util.List<AlignInLineAction.Line> lines)
Align a single node relative to a set of lines #9081
|
protected java.util.List<Node> |
CombineWayAction.NodeGraph.buildSpanningPath(Node startNode)
Tries to find a spanning path starting from node
startNode . |
int |
JoinNodeWayAction.NodeDistanceToRefNodeComparator.compare(Node first,
Node second) |
boolean |
CombineWayAction.NodePair.contains(Node n)
Determines if this pair contains the given node.
|
MoveCommand |
AlignInCircleAction.PolarCoor.createMoveCommand(Node n)
Create a MoveCommand to move a node to this PolarCoor.
|
static void |
MergeNodesAction.doMergeNodes(OsmDataLayer layer,
java.util.Collection<Node> nodes,
Node targetLocationNode)
Merges the nodes in
nodes at the specified node's location. |
private static Way |
SelectNonBranchingWaySequences.findWay(java.util.Collection<OsmPrimitive> selection,
Node node)
Finds out if the current selection can be extended.
|
protected static java.util.List<Command> |
MergeNodesAction.fixParentWays(java.util.Collection<Node> nodesToDelete,
Node targetNode)
Fixes the parent ways referring to one of the nodes.
|
private void |
UnGlueAction.fixRelations(Node originalNode,
java.util.List<Command> cmds,
java.util.List<Node> newNodes)
put all newNodes into the same relation(s) that originalNode is in
|
private static double |
JoinAreasAction.WayTraverser.getAngle(Node N1,
Node N2,
Node N3)
Oriented angle (N1N2, N1N3) in range [0; 2*Math.PI[
|
private java.util.List<AlignInLineAction.Line> |
AlignInLineAction.getInvolvedLines(Node node,
java.util.List<Way> refWays)
Get lines useful to do alignment of a single node
|
protected java.util.List<CombineWayAction.NodePair> |
CombineWayAction.NodeGraph.getOutboundPairs(Node node) |
Command |
AlignInLineAction.Line.intersectionCommand(Node n,
AlignInLineAction.Line other)
Intersection of two line.
|
protected boolean |
SimplifyWayAction.isRequiredNode(Way way,
Node node)
Replies true if
node is a required node which can't be removed
in order to simplify the way. |
protected boolean |
CombineWayAction.NodeGraph.isTerminalNode(Node n) |
static Command |
MergeNodesAction.mergeNodes(OsmDataLayer layer,
java.util.Collection<Node> nodes,
Node targetLocationNode)
Merges the nodes in
nodes at the specified node's location. |
static Command |
MergeNodesAction.mergeNodes(OsmDataLayer layer,
java.util.Collection<Node> nodes,
Node targetNode,
Node targetLocationNode)
Merges the nodes in
nodes onto one of the nodes. |
private Way |
UnGlueAction.modifyWay(Node originalNode,
Way w,
java.util.List<Command> cmds,
java.util.List<Node> newNodes)
dupe the given node of the given way
assume that OrginalNode is in the way
the new node will be put into the parameter newNodes.
the add-node command will be put into the parameter cmds.
the changed way will be returned and must be put into cmds by the caller!
|
private void |
AlignInLineAction.nodePairFurthestApart(java.util.List<Node> nodes,
Node[] resultOut)
Compute 2 anchor points to align a set of nodes.
|
Command |
AlignInLineAction.Line.projectionCommand(Node n)
Orthogonal projection of a node N along this line.
|
void |
UploadSelectionAction.UploadHullBuilder.visit(Node n) |
Modifier and Type | Method and Description |
---|---|
private boolean |
AlignInCircleAction.actionAllowed(java.util.Collection<Node> nodes)
Check if one or more nodes are outside of download area
|
private Command |
AlignInLineAction.alignOnlyNodes(java.util.List<Node> nodes)
Align nodes in case that only nodes are selected
The general algorithm here is to find the two selected nodes
that are furthest apart, and then to align all other selected
nodes onto the straight line between these nodes.
|
private java.util.List<java.util.List<Node>> |
JoinAreasAction.buildNodeChunks(Way way,
java.util.Collection<Node> splitNodes)
Simple chunking version.
|
protected void |
SimplifyWayAction.buildSimplifiedNodeList(java.util.List<Node> wnew,
int from,
int to,
double threshold,
java.util.List<Node> simplifiedNodes)
Builds the simplified list of nodes for a way segment given by a lower index
from
and an upper index to |
protected void |
SimplifyWayAction.buildSimplifiedNodeList(java.util.List<Node> wnew,
int from,
int to,
double threshold,
java.util.List<Node> simplifiedNodes)
Builds the simplified list of nodes for a way segment given by a lower index
from
and an upper index to |
static java.util.List<java.util.List<Node>> |
SplitWayAction.buildSplitChunks(Way wayToSplit,
java.util.List<Node> splitPoints)
Splits the nodes of
wayToSplit into a list of node sequences
which are separated at the nodes in splitPoints . |
static void |
MergeNodesAction.doMergeNodes(OsmDataLayer layer,
java.util.Collection<Node> nodes,
Node targetLocationNode)
Merges the nodes in
nodes at the specified node's location. |
private void |
UnGlueAction.execCommands(java.util.List<Command> cmds,
java.util.List<Node> newNodes)
Add commands to undo-redo system.
|
protected static java.util.List<Command> |
MergeNodesAction.fixParentWays(java.util.Collection<Node> nodesToDelete,
Node targetNode)
Fixes the parent ways referring to one of the nodes.
|
private void |
UnGlueAction.fixRelations(Node originalNode,
java.util.List<Command> cmds,
java.util.List<Node> newNodes)
put all newNodes into the same relation(s) that originalNode is in
|
private java.util.List<Way> |
UnJoinNodeWayAction.getApplicableWays(java.util.List<Way> selectedWays,
java.util.List<Node> selectedNodes) |
private java.util.List<Way> |
SplitWayAction.getApplicableWays(java.util.List<Way> selectedWays,
java.util.List<Node> selectedNodes) |
static Command |
MergeNodesAction.mergeNodes(OsmDataLayer layer,
java.util.Collection<Node> nodes,
Node targetLocationNode)
Merges the nodes in
nodes at the specified node's location. |
static Command |
MergeNodesAction.mergeNodes(OsmDataLayer layer,
java.util.Collection<Node> nodes,
Node targetNode,
Node targetLocationNode)
Merges the nodes in
nodes onto one of the nodes. |
private Way |
UnGlueAction.modifyWay(Node originalNode,
Way w,
java.util.List<Command> cmds,
java.util.List<Node> newNodes)
dupe the given node of the given way
assume that OrginalNode is in the way
the new node will be put into the parameter newNodes.
the add-node command will be put into the parameter cmds.
the changed way will be returned and must be put into cmds by the caller!
|
private void |
AlignInLineAction.nodePairFurthestApart(java.util.List<Node> nodes,
Node[] resultOut)
Compute 2 anchor points to align a set of nodes.
|
private static java.util.Collection<Command> |
OrthogonalizeAction.orthogonalize(java.util.List<OrthogonalizeAction.WayData> wayDataList,
java.util.List<Node> headingNodes)
Outline:
1.
|
private java.util.Set<Node> |
DistributeAction.removeNodesWithoutCoordinates(java.util.Collection<Node> col) |
static Node |
MergeNodesAction.selectTargetLocationNode(java.util.List<Node> candidates)
Select the location of the target node after merge.
|
static Node |
MergeNodesAction.selectTargetNode(java.util.Collection<Node> candidates)
Find which node to merge into (i.e.
|
static SplitWayAction.SplitWayResult |
SplitWayAction.split(OsmDataLayer layer,
Way way,
java.util.List<Node> atNodes,
java.util.Collection<? extends OsmPrimitive> selection)
Splits the way
way at the nodes in atNodes and replies
the result of this process in an instance of SplitWayAction.SplitWayResult . |
static SplitWayAction.SplitWayResult |
SplitWayAction.splitWay(OsmDataLayer layer,
Way way,
java.util.List<java.util.List<Node>> wayChunks,
java.util.Collection<? extends OsmPrimitive> selection)
Splits the way
way into chunks of wayChunks and replies
the result of this process in an instance of SplitWayAction.SplitWayResult . |
private java.util.List<Way> |
JoinAreasAction.splitWayOnNodes(Way way,
java.util.Set<Node> nodes)
This is a method splits way into smaller parts, using the prepared nodes list as split points.
|
Constructor and Description |
---|
AlignInLineAction.Line(Node first,
Node last)
Init a line by 2 nodes.
|
CombineWayAction.NodePair(Node a,
Node b)
Constructs a new
NodePair . |
CreateCircleAction.PolarNode(EastNorth center,
Node n) |
JoinNodeWayAction.NodeDistanceToRefNodeComparator(Node referenceNode,
Node referenceNode2,
boolean projectFirst) |
Constructor and Description |
---|
CombineWayAction.NodePair(Pair<Node,Node> pair)
Constructs a new
NodePair . |
CombineWayAction.NodePair(Pair<Node,Node> pair)
Constructs a new
NodePair . |
Modifier and Type | Field and Description |
---|---|
private Node |
ImproveWayAccuracyAction.candidateNode |
private Node |
DrawAction.currentBaseNode |
private Node |
DrawAction.lastUsedNode |
private Node |
DrawAction.mouseOnExistingNode |
(package private) Node |
DeleteAction.DeleteParameters.nearestNode |
private Node |
DrawAction.previousNode |
private Node |
ExtrudeAction.selectedNode |
private Node |
SelectAction.VirtualManager.virtualNode |
Modifier and Type | Field and Description |
---|---|
private java.util.ArrayList<Node> |
ExtrudeAction.movingNodeList
Collection of nodes that is moved
|
private java.util.List<Node> |
ParallelWays.sortedNodes |
Modifier and Type | Method and Description |
---|---|
private static Node |
ParallelWays.copyNode(Node source,
boolean copyTags) |
static Node |
ImproveWayAccuracyHelper.findCandidateNode(MapView mv,
Way w,
java.awt.Point p)
Returns the nearest node to cursor.
|
private Node |
DrawAction.findNodeToContinueFrom(Node selectedNode,
Way selectedWay)
Finds a node to continue drawing from.
|
private Node |
SelectAction.findNodeToMergeTo(java.awt.Point p)
Tries to find a node to merge to when in move-merge mode for the current mouse
position.
|
Node |
DrawAction.getCurrentBaseNode() |
private Node |
ExtrudeAction.getNextNode(int index)
Gets a node from selected way after given index.
|
private Node |
ExtrudeAction.getPreviousNode(int index)
Gets a node from selected way before given index.
|
Modifier and Type | Method and Description |
---|---|
private static void |
DrawAction.adjustNode(java.util.Collection<Pair<Node,Node>> segs,
Node n)
Adjusts the position of a node to lie on a segment (or a segment
intersection).
|
private void |
DrawAction.continueWayFromNode(Way way,
Node node)
if one of the ends of @param way is given @param node ,
then set currentBaseNode = node and previousNode = adjacent node of way
|
private static Node |
ParallelWays.copyNode(Node source,
boolean copyTags) |
private Node |
DrawAction.findNodeToContinueFrom(Node selectedNode,
Way selectedWay)
Finds a node to continue drawing from.
|
static Way |
DrawAction.getWayForNode(Node n) |
private static boolean |
ExtrudeAction.hasNodeOtherWays(Node node,
Way myWay)
This method tests if
node has other ways apart from the given one. |
private void |
DrawAction.insertNodeIntoAllNearbySegments(java.util.List<WaySegment> wss,
Node n,
java.util.Collection<OsmPrimitive> newSelection,
java.util.Collection<Command> cmds,
java.util.List<Way> replacedWays,
java.util.List<Way> reuseWays) |
private boolean |
DrawAction.isSelfContainedWay(Way selectedWay,
Node currentNode,
Node targetNode)
Prevent creation of ways that look like this: <---->
This happens if users want to draw a no-exit-sideway from the main way like this:
^
|<---->
|
The solution isn't ideal because the main way will end in the side way, which is bad for
navigation software ("drive straight on") but at least easier to fix.
|
private void |
DrawAction.tryToMoveNodeOnIntersection(java.util.List<WaySegment> wss,
Node n) |
Modifier and Type | Method and Description |
---|---|
private static void |
DrawAction.adjustNode(java.util.Collection<Pair<Node,Node>> segs,
Node n)
Adjusts the position of a node to lie on a segment (or a segment
intersection).
|
private static void |
DrawAction.adjustNode(java.util.Collection<Pair<Node,Node>> segs,
Node n)
Adjusts the position of a node to lie on a segment (or a segment
intersection).
|
private boolean |
SelectAction.doesImpactStatusLine(java.util.Collection<Node> affectedNodes,
java.util.Collection<Way> selectedWays) |
private void |
ExtrudeAction.joinNodesIfCollapsed(java.util.List<Node> changedNodes) |
Modifier and Type | Field and Description |
---|---|
private java.util.List<Node> |
ChangeNodesCommand.newNodes |
protected java.util.Collection<Node> |
TransformNodesCommand.nodes
The nodes to transform.
|
private java.util.Collection<Node> |
MoveCommand.nodes
The objects that should be moved.
|
protected java.util.Map<Node,Command.OldNodeState> |
TransformNodesCommand.oldStates
List of all old states of the nodes.
|
private java.util.Set<Node> |
RemoveNodesCommand.rmNodes |
Modifier and Type | Method and Description |
---|---|
protected static java.util.Collection<Node> |
DeleteCommand.computeNodesToDelete(OsmDataLayer layer,
java.util.Collection<OsmPrimitive> primitivesToDelete)
Replies the collection of nodes referred to by primitives in
primitivesToDelete which
can be deleted too. |
java.util.Collection<Node> |
MoveCommand.getParticipatingPrimitives() |
java.util.Collection<Node> |
TransformNodesCommand.getTransformedNodes()
Get the nodes with the current transformation applied.
|
Modifier and Type | Method and Description |
---|---|
void |
Command.CloneVisitor.visit(Node n) |
Constructor and Description |
---|
Command.OldNodeState(Node node)
Constructs a new
OldNodeState for the given node. |
MoveCommand(Node node,
LatLon position)
Constructs a new
MoveCommand to move a node. |
Constructor and Description |
---|
ChangeNodesCommand(Way way,
java.util.List<Node> newNodes)
Constructs a new
ChangeNodesCommand . |
RemoveNodesCommand(Way way,
java.util.List<Node> rmNodes)
Constructs a new
RemoveNodesCommand . |
Modifier and Type | Field and Description |
---|---|
private java.util.List<Node> |
WayNodesConflictResolverCommand.mergedNodeList
the list of merged nodes.
|
Constructor and Description |
---|
WayNodesConflictResolverCommand(Conflict<? extends OsmPrimitive> conflict,
java.util.List<Node> mergedNodeList) |
Modifier and Type | Field and Description |
---|---|
private Node[] |
Way.nodes
All way nodes in this way
|
Modifier and Type | Field and Description |
---|---|
java.util.List<Node> |
MultipolygonBuilder.JoinedPolygon.nodes |
private QuadBuckets<Node> |
DataSet.nodes
All nodes goes here, even when included in other data (ways etc).
|
Modifier and Type | Method and Description |
---|---|
Node |
DatasetFactory.addNode(long id) |
Node |
DatasetFactory.addNode(long id,
int version) |
Node |
Way.firstNode()
Returns the first node of this way.
|
Node |
Way.firstNode(boolean respectOneway)
Replies the first node of this way, respecting or not its oneway state.
|
Node |
WaySegment.getFirstNode()
Returns the first node of the way segment.
|
Node |
RelationMember.getNode()
Returns the relation member as a node.
|
Node |
Way.getNode(int index)
Replies the node at position
index . |
Node |
DatasetFactory.getNode(long id) |
Node |
WaySegment.getSecondNode()
Returns the second (last) node of the way segment.
|
Node |
Way.lastNode()
Returns the last node of this way.
|
Node |
Way.lastNode(boolean respectOneway)
Replies the last node of this way, respecting or not its oneway state.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Node> |
Way.getNeighbours(Node node)
Return nodes adjacent to
node |
java.util.Comparator<Node> |
NameFormatter.getNodeComparator() |
java.util.List<Pair<Node,Node>> |
Way.getNodePairs(boolean sort)
Replies the ordered
List of chunks of this way. |
java.util.List<Pair<Node,Node>> |
Way.getNodePairs(boolean sort)
Replies the ordered
List of chunks of this way. |
java.util.List<Node> |
MultipolygonBuilder.JoinedPolygon.getNodes()
Builds a list of nodes for this polygon.
|
java.util.Collection<Node> |
DataSet.getNodes()
Replies an unmodifiable collection of nodes in this dataset
|
java.util.List<Node> |
Way.getNodes()
You can modify returned list but changes will not be propagated back
to the Way.
|
java.util.Collection<Node> |
DataSet.getSelectedNodes()
Returns selected nodes.
|
private java.util.List<Node> |
Way.removeDouble(java.util.List<Node> nodes)
Prevent directly following identical nodes in ways.
|
java.util.List<Node> |
DataSet.searchNodes(BBox bbox)
Searches for nodes in the given bounding box.
|
Modifier and Type | Method and Description |
---|---|
void |
Way.addNode(int offs,
Node n)
Adds a node at position offs.
|
void |
Way.addNode(Node n)
Adds a node to the end of the list of nodes.
|
int |
NodePositionComparator.compare(Node n1,
Node n2) |
boolean |
Way.containsNode(Node node)
Replies true if this way contains the node
node , false
otherwise. |
(package private) void |
DataSet.fireNodeMoved(Node node,
LatLon newCoor,
EastNorth eastNorth) |
java.lang.String |
NameFormatter.format(Node node) |
java.util.Set<Node> |
Way.getNeighbours(Node node)
Return nodes adjacent to
node |
boolean |
Way.isFirstLastNode(Node n)
Replies true if the given node is the first or the last one of this way, false otherwise.
|
boolean |
Way.isInnerNode(Node n)
Replies true if the given node is an inner node of this way, false otherwise.
|
private void |
DataSet.reindexNode(Node node,
LatLon newCoor,
EastNorth eastNorth) |
void |
Way.removeNode(Node n)
Removes the given
Node from this way. |
java.util.Set<Way> |
DataSet.unlinkNodeFromWays(Node node)
Removes all references from ways in this dataset to a particular node.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Node.isConnectedTo(java.util.Collection<Node> otherNodes,
int hops,
Predicate<Node> predicate)
Tests whether
this node is connected to otherNode via at most hops nodes
matching the predicate (which may be null to consider all nodes). |
boolean |
Node.isConnectedTo(java.util.Collection<Node> otherNodes,
int hops,
Predicate<Node> predicate)
Tests whether
this node is connected to otherNode via at most hops nodes
matching the predicate (which may be null to consider all nodes). |
private boolean |
Node.isConnectedTo(java.util.Collection<Node> otherNodes,
int hops,
Predicate<Node> predicate,
java.util.Set<Node> visited) |
private boolean |
Node.isConnectedTo(java.util.Collection<Node> otherNodes,
int hops,
Predicate<Node> predicate,
java.util.Set<Node> visited) |
private boolean |
Node.isConnectedTo(java.util.Collection<Node> otherNodes,
int hops,
Predicate<Node> predicate,
java.util.Set<Node> visited) |
private java.util.List<Node> |
Way.removeDouble(java.util.List<Node> nodes)
Prevent directly following identical nodes in ways.
|
void |
Way.removeNodes(java.util.Set<? extends Node> selection)
Removes the given set of
nodes from this way. |
void |
Way.setNodes(java.util.List<Node> nodes)
Set new list of nodes to way.
|
Constructor and Description |
---|
BBox(Node n) |
Node(Node clone)
Constructs an identical clone of the argument (including the id).
|
Node(Node clone,
boolean clearMetadata)
Constructs an identical clone of the argument.
|
Modifier and Type | Field and Description |
---|---|
private Node |
NodeMovedEvent.node |
Modifier and Type | Method and Description |
---|---|
Node |
NodeMovedEvent.getNode() |
Constructor and Description |
---|
NodeMovedEvent(DataSet dataSet,
Node node) |
Constructor and Description |
---|
HistoryNode(Node n)
Constructs a new
HistoryNode from an existing Node . |
Modifier and Type | Field and Description |
---|---|
java.util.Collection<Node> |
AllNodesVisitor.nodes
The resulting nodes collected so far.
|
Modifier and Type | Method and Description |
---|---|
static java.util.Collection<Node> |
AllNodesVisitor.getAllNodes(java.util.Collection<? extends OsmPrimitive> osms)
Replies all nodes contained by the given primitives
|
Modifier and Type | Method and Description |
---|---|
protected void |
MergeSourceBuildingVisitor.rememberNode(Node n)
Remebers a node in the "hull"
|
void |
MergeSourceBuildingVisitor.visit(Node n) |
void |
BoundingXYVisitor.visit(Node n) |
void |
Visitor.visit(Node n)
Visiting call for points.
|
void |
AllNodesVisitor.visit(Node n)
Nodes have only itself as nodes.
|
Modifier and Type | Field and Description |
---|---|
private java.util.List<Node> |
StyledMapRenderer.OffsetIterator.nodes |
Modifier and Type | Method and Description |
---|---|
void |
StyledMapRenderer.ComputeStyleListWorker.add(Node osm,
int flags) |
void |
StyledMapRenderer.drawBoxText(Node n,
BoxTextElemStyle bs) |
void |
WireframeMapRenderer.drawNode(Node n,
java.awt.Color color,
int size,
boolean fill) |
void |
StyledMapRenderer.drawNode(Node n,
java.awt.Color color,
int size,
boolean fill) |
abstract void |
AbstractMapRenderer.drawNode(Node n,
java.awt.Color color,
int size,
boolean fill)
Draw the node as small rectangle with the given color.
|
void |
StyledMapRenderer.drawNodeIcon(Node n,
java.awt.Image img,
float alpha,
boolean selected,
boolean member) |
void |
StyledMapRenderer.drawNodeSymbol(Node n,
NodeElemStyle.Symbol s,
java.awt.Color fillColor,
java.awt.Color strokeColor) |
void |
StyledMapRenderer.drawOrderNumber(Node n1,
Node n2,
int orderNumber,
java.awt.Color clr)
Draw a number of the order of the two consecutive nodes within the
parents way
|
private boolean |
WireframeMapRenderer.isNodeTagged(Node n) |
void |
WireframeMapRenderer.visit(Node n)
Draw a small rectangle.
|
void |
StyledMapRenderer.ComputeStyleListWorker.visit(Node n) |
Constructor and Description |
---|
StyledMapRenderer.OffsetIterator(java.util.List<Node> nodes,
float offset) |
Modifier and Type | Field and Description |
---|---|
private java.util.List<Node> |
Multipolygon.JoinedWay.nodes |
private java.util.List<Node> |
Multipolygon.PolyData.nodes |
Modifier and Type | Method and Description |
---|---|
java.util.List<Node> |
Multipolygon.JoinedWay.getNodes() |
Constructor and Description |
---|
Multipolygon.JoinedWay(java.util.List<Node> nodes,
java.util.Collection<java.lang.Long> wayIds,
boolean selected) |
Multipolygon.PolyData(java.util.List<Node> nodes,
boolean selected,
java.util.Collection<java.lang.Long> wayIds) |
Modifier and Type | Method and Description |
---|---|
protected void |
PaintVisitor.drawNode(Node n,
java.awt.Color color)
Draws a circle around the node
|
protected void |
PaintVisitor.drawSegment(Node n1,
Node n2,
java.awt.Color color)
Draws a line around the segment
|
protected boolean |
PaintVisitor.isNodeVisible(Node n)
Checks if the given node is in the visible area.
|
protected boolean |
PaintVisitor.isSegmentVisible(Node n1,
Node n2)
Checks if the given segment is in the visible area.
|
void |
Test.visit(Node n) |
void |
Test.TagTest.visit(Node n) |
void |
PaintVisitor.visit(Node n)
Draw a small rectangle.
|
Modifier and Type | Method and Description |
---|---|
void |
ValidatorVisitor.visit(java.util.List<Node> nodes) |
void |
PaintVisitor.visit(java.util.List<Node> nodes) |
Modifier and Type | Field and Description |
---|---|
(package private) Node |
UnconnectedWays.MyWaySegment.n1 |
(package private) Node |
UnconnectedWays.MyWaySegment.n2 |
Modifier and Type | Field and Description |
---|---|
private QuadBuckets<Node> |
UnconnectedWays.endnodes |
private QuadBuckets<Node> |
UnconnectedWays.endnodes_highway |
private QuadBuckets<Node> |
UnconnectedWays.middlenodes |
private java.util.Set<Node> |
UnconnectedWays.MyWaySegment.nearbyNodeCache |
private MultiMap<Pair<Node,Node>,WaySegment> |
OverlappingWays.nodePairs
Bag of all way segments
|
private MultiMap<Pair<Node,Node>,WaySegment> |
OverlappingWays.nodePairs
Bag of all way segments
|
private java.util.Collection<Node> |
RelationChecker.RoleInfo.nodes |
private java.util.List<java.util.List<Node>> |
MultipolygonTest.nonClosedWays |
private java.util.Set<Node> |
UnconnectedWays.othernodes |
Modifier and Type | Method and Description |
---|---|
Node |
PowerLines.PowerLineError.getNode() |
Modifier and Type | Method and Description |
---|---|
protected java.util.Map<Node,Way> |
UnconnectedWays.getConnectedWayEndNodesNearOtherWay() |
protected java.util.Map<Node,Way> |
UnconnectedWays.getWayEndNodesNearOtherHighway() |
protected java.util.Map<Node,Way> |
UnconnectedWays.getWayEndNodesNearOtherWay() |
protected java.util.Map<Node,Way> |
UnconnectedWays.getWayNodesNearOtherWay() |
private java.util.List<java.util.List<Node>> |
MultipolygonTest.joinWays(java.util.Collection<Way> ways) |
java.util.Collection<Node> |
UnconnectedWays.MyWaySegment.nearbyNodes(double dist) |
Modifier and Type | Method and Description |
---|---|
private void |
WayConnectedToArea.addError(Way w,
Node wayNode,
OsmPrimitive p) |
private void |
UnconnectedWays.addNode(Node n,
QuadBuckets<Node> s) |
private void |
Highways.handleCarWay(Node n,
Way w) |
private void |
Highways.handleCyclistWay(Node n,
Way w) |
private void |
Highways.handlePedestrianWay(Node n,
Way w) |
protected boolean |
PowerLines.isInPowerStation(Node n) |
protected static boolean |
PowerLines.isPowerAllowed(Node n)
Determines if the specified node denotes a power infrastructure allowed on a power line.
|
protected static boolean |
PowerLines.isPowerTower(Node n)
Determines if the specified node denotes a power tower/pole.
|
boolean |
UnconnectedWays.MyWaySegment.nearby(Node n,
double dist) |
private void |
WayConnectedToArea.testForError(Way w,
Node wayNode,
OsmPrimitive p) |
private void |
Highways.testMissingPedestrianCrossing(Node n) |
void |
BarriersEntrances.visit(Node n) |
void |
DuplicateNode.visit(Node n) |
void |
UntaggedNode.visit(Node n) |
void |
Addresses.visit(Node n) |
void |
Highways.visit(Node n) |
Modifier and Type | Method and Description |
---|---|
protected void |
UnconnectedWays.addErrors(Severity severity,
java.util.Map<Node,Way> errorMap,
java.lang.String message) |
private void |
UnconnectedWays.addNode(Node n,
QuadBuckets<Node> s) |
java.util.List<TestError> |
DuplicateNode.buildTestErrors(Test parentTest,
java.util.List<Node> nodes)
Returns the list of "duplicate nodes" errors for the given selection of node and parent test
|
private java.awt.geom.GeneralPath |
MultipolygonTest.createPath(java.util.List<Node> nodes) |
private java.util.List<java.awt.geom.GeneralPath> |
MultipolygonTest.createPolygons(java.util.List<java.util.List<Node>> joinedWays) |
private Multipolygon.PolyData.Intersection |
MultipolygonTest.getPolygonIntersection(java.awt.geom.GeneralPath outer,
java.util.List<Node> inner) |
Constructor and Description |
---|
PowerLines.PowerLineError(Node n,
Way line) |
UnconnectedWays.MyWaySegment(Way w,
Node n1,
Node n2) |
Modifier and Type | Method and Description |
---|---|
static java.util.List<java.awt.geom.Point2D> |
ValUtil.getSegmentCells(Node n1,
Node n2,
double gridDetail)
Returns the coordinates of all cells in a grid that a line between 2 nodes intersects with.
|
void |
AggregatePrimitivesVisitor.visit(Node n) |
void |
NameVisitor.visit(Node n)
If the node has a name-key or id-key, this is displayed.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Comparator<Node> |
DefaultNameFormatter.nodeComparator |
Modifier and Type | Method and Description |
---|---|
Node |
NavigatableComponent.getNearestNode(java.awt.Point p,
Predicate<OsmPrimitive> predicate)
Convenience method to
NavigatableComponent.getNearestNode(Point, Predicate, boolean) . |
Node |
NavigatableComponent.getNearestNode(java.awt.Point p,
Predicate<OsmPrimitive> predicate,
boolean useSelected)
The *result* depends on the current map selection state IF use_selected is true.
|
Node |
NavigatableComponent.getNearestNode(java.awt.Point p,
Predicate<OsmPrimitive> predicate,
boolean useSelected,
java.util.Collection<OsmPrimitive> preferredRefs)
The *result* depends on the current map selection state IF use_selected is true
If more than one node within node.snap-distance pixels is found,
the nearest node selected is returned IF use_selected is true.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Node> |
NavigatableComponent.getNearestNodes(java.awt.Point p,
java.util.Collection<Node> ignore,
Predicate<OsmPrimitive> predicate)
The *result* does not depend on the current map selection state,
neither does the result *order*.
|
java.util.List<Node> |
NavigatableComponent.getNearestNodes(java.awt.Point p,
Predicate<OsmPrimitive> predicate)
The *result* does not depend on the current map selection state,
neither does the result *order*.
|
private java.util.Map<java.lang.Double,java.util.List<Node>> |
NavigatableComponent.getNearestNodesImpl(java.awt.Point p,
Predicate<OsmPrimitive> predicate)
The *result* does not depend on the current map selection state,
neither does the result *order*.
|
java.util.Comparator<Node> |
DefaultNameFormatter.getNodeComparator() |
Modifier and Type | Method and Description |
---|---|
java.lang.String |
DefaultNameFormatter.format(Node node)
Formats a name for a node
|
java.awt.Point |
NavigatableComponent.getPoint(Node n) |
java.awt.geom.Point2D |
NavigatableComponent.getPoint2D(Node n) |
private boolean |
NavigatableComponent.isPrecedenceNode(Node osm,
java.awt.Point p,
boolean use_selected)
This is used as a helper routine to
NavigatableComponent.getNearestNodeOrWay(Point, Predicate, boolean)
It decides, whether to yield the node to be tested or look for further (way) candidates. |
Modifier and Type | Method and Description |
---|---|
java.util.List<Node> |
NavigatableComponent.getNearestNodes(java.awt.Point p,
java.util.Collection<Node> ignore,
Predicate<OsmPrimitive> predicate)
The *result* does not depend on the current map selection state,
neither does the result *order*.
|
Modifier and Type | Method and Description |
---|---|
protected Node |
NodeListMergeModel.cloneEntryForMergedList(Node entry) |
Modifier and Type | Method and Description |
---|---|
protected Node |
NodeListMergeModel.cloneEntryForMergedList(Node entry) |
boolean |
NodeListMergeModel.isEqualEntry(Node e1,
Node e2) |
protected void |
NodeListTableCellRenderer.renderNode(ListMergeModel.EntriesTableModel model,
Node node,
int row,
boolean isSelected)
render a node
|
Constructor and Description |
---|
NodeListTable(java.lang.String name,
ListMergeModel<Node> model,
OsmPrimitivesTableModel dm,
javax.swing.ListSelectionModel sm) |
Modifier and Type | Method and Description |
---|---|
(package private) void |
InspectPrimitiveDialog.DataText.addCoordinates(Node n) |
Modifier and Type | Method and Description |
---|---|
void |
ValidatorDialog.ValidatorBoundingXYVisitor.visit(java.util.List<Node> nodes) |
Modifier and Type | Field and Description |
---|---|
(package private) Node |
RelationNodeMap.firstCircular |
(package private) Node |
RelationNodeMap.lastOnewayNode |
Modifier and Type | Field and Description |
---|---|
java.util.Map<Node,java.util.Set<java.lang.Integer>> |
RelationNodeMap.NodesWays.nodes |
private java.util.Map<java.lang.Integer,java.util.Set<Node>> |
RelationNodeMap.remainingOneway |
java.util.Map<java.lang.Integer,java.util.Set<Node>> |
RelationNodeMap.NodesWays.ways |
Modifier and Type | Method and Description |
---|---|
static Node |
RelationNodeMap.firstOnewayNode(RelationMember m) |
static Node |
RelationNodeMap.lastOnewayNode(RelationMember m) |
private Node |
RelationNodeMap.processBackwardIfEndOfLoopReached(java.lang.Integer way) |
Modifier and Type | Method and Description |
---|---|
private void |
RelationNodeMap.addNodeWayMap(Node n,
int i) |
private void |
RelationNodeMap.addNodeWayMapReverse(Node n,
int i) |
private void |
RelationNodeMap.addPair(Node n,
int i) |
private void |
RelationNodeMap.addRemainingForward(Node n,
int i) |
private void |
RelationNodeMap.addWayNodeMap(Node n,
int i) |
private void |
RelationNodeMap.addWayNodeMapReverse(Node n,
int i) |
private java.lang.Integer |
RelationNodeMap.deleteAndGetAdjacentNode(RelationNodeMap.NodesWays nw,
Node n)
find next node in nw NodeWays structure, if the node is found delete and return it
|
private void |
RelationNodeMap.deleteWayNode(RelationNodeMap.NodesWays nw,
java.lang.Integer way,
Node n) |
private java.lang.Integer |
RelationNodeMap.findAdjacentWay(RelationNodeMap.NodesWays nw,
Node n) |
Modifier and Type | Method and Description |
---|---|
void |
HistoryBrowserModel.HistoryPrimitiveBuilder.visit(Node n) |
Modifier and Type | Method and Description |
---|---|
void |
OsmDataLayer.DataCountVisitor.visit(Node n) |
Modifier and Type | Method and Description |
---|---|
private static void |
OsmDataLayer.nodesToGpxData(java.util.Collection<Node> nodes,
GpxData gpxData,
java.util.HashSet<Node> doneNodes) |
private static void |
OsmDataLayer.nodesToGpxData(java.util.Collection<Node> nodes,
GpxData gpxData,
java.util.HashSet<Node> doneNodes) |
private static void |
OsmDataLayer.waysToGpxData(java.util.Collection<Way> ways,
GpxData gpxData,
java.util.HashSet<Node> doneNodes) |
Modifier and Type | Method and Description |
---|---|
void |
Selector.ChildOrParentSelector.MatchingReferrerFinder.visit(Node n) |
void |
Selector.ChildOrParentSelector.AbstractFinder.visit(Node n) |
void |
Selector.ChildOrParentSelector.ContainsFinder.visit(Node n) |
Modifier and Type | Method and Description |
---|---|
protected Node |
OsmReader.parseNode() |
Modifier and Type | Method and Description |
---|---|
MultiFetchServerObjectReader |
MultiFetchServerObjectReader.appendNode(Node node)
appends a
Node id to the list of ids which will be fetched from the server. |
Modifier and Type | Method and Description |
---|---|
void |
OsmWriter.writeNodes(java.util.Collection<Node> nodes)
Writes the given nodes sorted by id
|
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Map<LatLon,Node> |
AddWayHandler.addedNodes
The place to remeber already added nodes (they are reused if needed @since 5845
|
Modifier and Type | Method and Description |
---|---|
(package private) Node |
AddWayHandler.findOrCreateNode(LatLon ll,
java.util.List<Command> commands)
Find the node with almost the same ccords in dataset or in already added nodes
|
Modifier and Type | Method and Description |
---|---|
static java.util.Set<Node> |
Geometry.addIntersections(java.util.List<Way> ways,
boolean test,
java.util.List<Command> cmds)
Will find all intersection and add nodes there for list of given ways.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
Geometry.angleIsClockwise(Node commonNode,
Node firstNode,
Node secondNode)
This method tests if secondNode is clockwise to first node.
|
protected static double |
Geometry.calcX(Node p1) |
protected static double |
Geometry.calcY(Node p1) |
static boolean |
Geometry.isNodeInsideMultiPolygon(Node node,
Relation multiPolygon,
Predicate<Way> isOuterWayAMatch)
Tests if the
node is inside the multipolygon multiPolygon . |
static boolean |
Geometry.isToTheRightSideOfLine(Node lineP1,
Node lineP2,
Node lineP3,
Node testPoint)
Tests if given point is to the right side of path consisting of 3 points.
|
static boolean |
Geometry.nodeInsidePolygon(Node point,
java.util.List<Node> polygonNodes)
Tests if point is inside a polygon.
|
Modifier and Type | Method and Description |
---|---|
static java.awt.geom.Area |
Geometry.getArea(java.util.List<Node> polygon)
Returns the Area of a polygon, from its list of nodes.
|
static java.awt.geom.Area |
Geometry.getAreaLatLon(java.util.List<Node> polygon)
Returns the Area of a polygon, from its list of nodes.
|
static EastNorth |
Geometry.getCenter(java.util.List<Node> nodes)
Compute center of the circle closest to different nodes.
|
static EastNorth |
Geometry.getCentroid(java.util.List<Node> nodes)
Compute the centroid/barycenter of nodes
|
private static BBox |
Geometry.getNodesBounds(java.util.List<Node> nodes) |
static boolean |
Geometry.isPolygonInsideMultiPolygon(java.util.List<Node> nodes,
Relation multiPolygon,
Predicate<Way> isOuterWayAMatch)
Tests if the polygon formed by
nodes is inside the multipolygon multiPolygon . |
static boolean |
Geometry.nodeInsidePolygon(Node point,
java.util.List<Node> polygonNodes)
Tests if point is inside a polygon.
|
static Geometry.PolygonIntersection |
Geometry.polygonIntersection(java.util.List<Node> first,
java.util.List<Node> second)
Tests if two polygons intersect.
|
static Geometry.PolygonIntersection |
Geometry.polygonIntersection(java.util.List<Node> first,
java.util.List<Node> second)
Tests if two polygons intersect.
|