+ 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.way_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
+
+ # Temporary method to match interface to ways
+ def way_nodes
+ return self.old_nodes
+ end
+
+ # Pretend we're not in any relations
+ def containing_relation_members
+ return []
+ end
+
+ # check whether this element is the latest version - that is,
+ # has the same version as its "current" counterpart.
+ def is_latest_version?
+ current_way.version == self.version
+ end