A short question: I would like to extract all ways that are included in a set consisting of both ways and relations. How can I do that?

Assume the set is called "x", then, I tried:

  • way(w.x);
  • way(.x);

all without success because recurse is not defined for way-way and a bit overkill. Feels like there must be a simple solution, I just cannot see it ;)

Thanks for a hint!

asked 09 Sep '21, 11:32

G%C3%A5seborg's gravatar image

accept rate: 37%

Sorry, it is explained in the wiki:

"To read elements from a set, append . and the set name to the command.


will return all nodes in the named set a that have the key amenity with the value foo."

So, in my case, it boild down to: node.x;

permanent link

answered 09 Sep '21, 11:55

G%C3%A5seborg's gravatar image

accept rate: 37%

edited 09 Sep '21, 11:56

This answer describes what solved my problem. Unfortunately, I cannot mark it as "accepted answer"; could one of the admins please do so, thanks! I hope that marking this question as "answered" can help others that have the same problem and spare those that want to help solving a problem to have to look at this one. Thanks!

(30 Sep '21, 12:39) Gåseborg

I have marked it as accepted.

(30 Sep '21, 13:20) SomeoneElse ♦
Your answer
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Question tags:


question asked: 09 Sep '21, 11:32

question was seen: 352 times

last updated: 30 Sep '21, 13:20

powered by OSQA