X-Git-Url: https://git.openstreetmap.org./rails.git/blobdiff_plain/f03c8637f7377f34d31f4b0bd88caa4a9e7a9570..109dcfff196708f94179ed4c621a2e6d405b7118:/app/models/node.rb diff --git a/app/models/node.rb b/app/models/node.rb index 81b910f37..09f494b7c 100644 --- a/app/models/node.rb +++ b/app/models/node.rb @@ -4,12 +4,13 @@ class Node < ActiveRecord::Base include GeoRecord include ConsistencyValidations include NotRedactable + include ObjectMetadata self.table_name = "current_nodes" belongs_to :changeset - has_many :old_nodes, :order => :version + has_many :old_nodes, -> { order(:version) } has_many :way_nodes has_many :ways, :through => :way_nodes @@ -20,7 +21,7 @@ class Node < ActiveRecord::Base has_many :ways_via_history, :class_name=> "Way", :through => :old_way_nodes, :source => :way has_many :containing_relation_members, :class_name => "RelationMember", :as => :member - has_many :containing_relations, :class_name => "Relation", :through => :containing_relation_members, :source => :relation, :extend => ObjectFinder + has_many :containing_relations, :class_name => "Relation", :through => :containing_relation_members, :source => :relation validates_presence_of :id, :on => :update validates_presence_of :timestamp,:version, :changeset_id @@ -31,38 +32,14 @@ class Node < ActiveRecord::Base validate :validate_position validates_associated :changeset - scope :visible, where(:visible => true) - scope :invisible, where(:visible => false) + scope :visible, -> { where(:visible => true) } + scope :invisible, -> { where(:visible => false) } # Sanity check the latitude and longitude and add an error if it's broken def validate_position errors.add(:base, "Node is not in the world") unless in_world? end - # - # Search for nodes matching tags within bounding_box - # - # Also adheres to limitations such as within max_number_of_nodes - # - def self.search(bounding_box, tags = {}) - # @fixme a bit of a hack to search for only visible nodes - # couldn't think of another to add to tags condition - #conditions_hash = tags.merge({ 'visible' => 1 }) - - # using named placeholders http://www.robbyonrails.com/articles/2005/10/21/using-named-placeholders-in-ruby - #keys = [] - #values = {} - - #conditions_hash.each do |key,value| - # keys << "#{key} = :#{key}" - # values[key.to_sym] = value - #end - #conditions = keys.join(' AND ') - - find_by_area(bounding_box, :conditions => {:visible => true}, - :limit => MAX_NUMBER_OF_NODES+1) - end - # Read in xml as text and return it's Node object representation def self.from_xml(xml, create=false) begin @@ -199,47 +176,19 @@ class Node < ActiveRecord::Base end def to_xml_node(changeset_cache = {}, user_display_name_cache = {}) - el1 = XML::Node.new 'node' - el1['id'] = self.id.to_s - el1['version'] = self.version.to_s - el1['changeset'] = self.changeset_id.to_s - - if self.visible? - el1['lat'] = self.lat.to_s - el1['lon'] = self.lon.to_s - end - - if changeset_cache.key?(self.changeset_id) - # use the cache if available - else - changeset_cache[self.changeset_id] = self.changeset.user_id - end + el = XML::Node.new 'node' + el['id'] = self.id.to_s - user_id = changeset_cache[self.changeset_id] + add_metadata_to_xml_node(el, self, changeset_cache, user_display_name_cache) - if user_display_name_cache.key?(user_id) - # use the cache if available - elsif self.changeset.user.data_public? - user_display_name_cache[user_id] = self.changeset.user.display_name - else - user_display_name_cache[user_id] = nil + if self.visible? + el['lat'] = self.lat.to_s + el['lon'] = self.lon.to_s end - if not user_display_name_cache[user_id].nil? - el1['user'] = user_display_name_cache[user_id] - el1['uid'] = user_id.to_s - end + add_tags_to_xml_node(el, self.node_tags) - self.tags.each do |k,v| - el2 = XML::Node.new('tag') - el2['k'] = k.to_s - el2['v'] = v.to_s - el1 << el2 - end - - el1['visible'] = self.visible.to_s - el1['timestamp'] = self.timestamp.xmlschema - return el1 + return el end def tags_as_hash @@ -247,13 +196,7 @@ class Node < ActiveRecord::Base end def tags - unless @tags - @tags = {} - self.node_tags.each do |tag| - @tags[tag.k] = tag.v - end - end - @tags + @tags ||= Hash[self.node_tags.collect { |t| [t.k, t.v] }] end def tags=(t)