You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It may make sense to instead return a set of all nodes that make up the geometry of the relation. If so, in what order should they appear? way.nodes may contain duplicates (an ordered list rather than a set), but what would make sense for relations?
Possible use cases:
Find all border crossings of a country's area relation
Count the number of traffic lights encountered by a bus route
For case 1, an unordered set of nodes would suffice.
For case 2, traffic-light nodes should appear multiple times if the route traverses a segment more than once (but what about traffic lights at the end points of two connected ways? )
To stay consistent, node.nodes should then return the node itself.
The text was updated successfully, but these errors were encountered:
Currently, relation.
nodes
returns an empty set.It may make sense to instead return a set of all nodes that make up the geometry of the relation. If so, in what order should they appear? way.
nodes
may contain duplicates (an ordered list rather than a set), but what would make sense for relations?Possible use cases:
For case 1, an unordered set of nodes would suffice.
For case 2, traffic-light nodes should appear multiple times if the route traverses a segment more than once (but what about traffic lights at the end points of two connected ways? )
To stay consistent, node.
nodes
should then return the node itself.The text was updated successfully, but these errors were encountered: