X-Git-Url: https://git.openstreetmap.org./rails.git/blobdiff_plain/bcbf417796c9da00397237d6e3808859d5d3adca..0be6dd860f1843681e6380fbe69ca71a6eb01ab7:/app/models/old_way.rb

diff --git a/app/models/old_way.rb b/app/models/old_way.rb
index 136e64793..ce856e208 100644
--- a/app/models/old_way.rb
+++ b/app/models/old_way.rb
@@ -1,12 +1,14 @@
 class OldWay < ActiveRecord::Base
+  include ConsistencyValidations
+  
   set_table_name 'ways'
 
-  belongs_to :user
+  belongs_to :changeset
 
   def self.from_way(way)
     old_way = OldWay.new
     old_way.visible = way.visible
-    old_way.user_id = way.user_id
+    old_way.changeset_id = way.changeset_id
     old_way.timestamp = way.timestamp
     old_way.id = way.id
     old_way.version = way.version
@@ -94,8 +96,12 @@ class OldWay < ActiveRecord::Base
     el1['id'] = self.id.to_s
     el1['visible'] = self.visible.to_s
     el1['timestamp'] = self.timestamp.xmlschema
-    el1['user'] = self.user.display_name if self.user.data_public?
+    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'
@@ -110,5 +116,49 @@ class OldWay < ActiveRecord::Base
       el1 << e
     end
     return el1
-  end 
+  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
+  
+  def get_nodes_undelete
+	points = []
+	self.nds.each do |n|
+	  node=Node.find(n)
+	  points << [node.lon, node.lat, n, node.visible ? 1 : 0, node.tags_as_hash]
+    end
+	points
+  end
+  
+  def get_nodes_revert
+    points=[]
+    self.nds.each do |n|
+      oldnode=OldNode.find(:first, :conditions=>['id=? AND timestamp<=?',n,self.timestamp], :order=>"timestamp DESC")
+      curnode=Node.find(n)
+      id=n; v=curnode.visible ? 1 : 0
+      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.id] then id=-1; v=nil end
+      end
+      points << [oldnode.lon, oldnode.lat, id, v, oldnode.tags_as_hash]
+    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
 end