self.table_name = "ways"
self.primary_keys = "way_id", "version"
- # note this needs to be included after the table name changes, or
+ # NOTE: this needs to be included after the table name changes, or
# the queries generated by Redactable will use the wrong table name.
include Redactable
end
def tags
- @tags ||= Hash[old_tags.collect { |t| [t.k, t.v] }]
+ @tags ||= old_tags.collect { |t| [t.k, t.v] }.to_h
end
attr_writer :nds, :tags
el
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
- nds.collect do |n|
- node = Node.find(n)
- [node.lon, node.lat, n, node.version, node.tags_as_hash, node.visible]
- end
- end
-
- def get_nodes_revert(timestamp)
- points = []
- nds.each do |n|
- oldnode = OldNode.where("node_id = ? AND timestamp <= ?", n, timestamp).unredacted.order("timestamp DESC").first
- curnode = Node.find(n)
- id = n
- reuse = curnode.visible
- if oldnode.lat != curnode.lat || oldnode.lon != curnode.lon || oldnode.tags != curnode.tags
- # node has changed: if it's in other ways, give it a new id
- if curnode.ways - [way_id]
- 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 ways
def way_nodes
old_nodes