- def tags=(t)
- @tags = t
- end
-
- def to_xml_node
- el1 = XML::Node.new 'way'
- el1['id'] = self.way_id.to_s
- el1['visible'] = self.visible.to_s
- el1['timestamp'] = self.timestamp.xmlschema
- if self.changeset.user.data_public?
- el1['user'] = self.changeset.user.display_name
- el1['uid'] = self.changeset.user.id.to_s
- end
- el1['version'] = self.version.to_s
- el1['changeset'] = self.changeset.id.to_s
-
- self.old_nodes.each do |nd| # FIXME need to make sure they come back in the right order
- e = XML::Node.new 'nd'
- e['ref'] = nd.node_id.to_s
- el1 << e
- end
-
- self.old_tags.each do |tag|
- e = XML::Node.new 'tag'
- e['k'] = tag.k
- e['v'] = tag.v
- el1 << e
- end
- return el1
- end
-
- # Read full version of old way
- # For get_nodes_undelete, uses same nodes, even if they've moved since
- # For get_nodes_revert, allocates new ids
- # Currently returns Potlatch-style array
- # where [5] indicates whether latest version is usable as is (boolean)
- # (i.e. is it visible? are we actually reverting to an earlier version?)
-
- def get_nodes_undelete
- points = []
- self.nds.each do |n|
- node = Node.find(n)
- points << [node.lon, node.lat, n, node.version, node.tags_as_hash, node.visible]
- end
- points
- end
-
- def get_nodes_revert(timestamp)
- points=[]
- self.nds.each do |n|
- oldnode = OldNode.where('node_id = ? AND timestamp <= ?', n, timestamp).order("timestamp DESC").first
- curnode = Node.find(n)
- id = n; reuse = curnode.visible
- if oldnode.lat != curnode.lat or oldnode.lon != curnode.lon or oldnode.tags != curnode.tags then
- # node has changed: if it's in other ways, give it a new id
- if curnode.ways-[self.node_id] then id=-1; reuse=false end
- end
- points << [oldnode.lon, oldnode.lat, id, curnode.version, oldnode.tags_as_hash, reuse]
- end
- points
- end
-
- # Temporary method to match interface to nodes
- def tags_as_hash
- return self.tags
- end