class Node < ActiveRecord::Base
require 'xml/libxml'
+
+ include GeoRecord
+
set_table_name 'current_nodes'
validates_presence_of :user_id, :timestamp
validates_numericality_of :latitude, :longitude
validate :validate_position
- has_many :old_nodes, :foreign_key => :id
belongs_to :user
-
- before_save :update_tile
-
- def self.find_by_area(minlat, minlon, maxlat, maxlon, options)
- self.with_scope(:find => {:conditions => OSM.sql_for_area(minlat, minlon, maxlat, maxlon)}) do
- return self.find(:all, options)
- end
- end
- def update_tile
- self.tile = QuadTile.tile_for_point(lat, lon)
- end
-
- def lat=(l)
- self.latitude = (l * 10000000).round
- end
+ has_many :old_nodes, :foreign_key => :id
- def lon=(l)
- self.longitude = (l * 10000000).round
- end
+ has_many :way_nodes
+ has_many :ways, :through => :way_nodes
- def lat
- return self.latitude.to_f / 10000000
- end
+ has_many :old_way_nodes
+ has_many :ways_via_history, :class_name=> "Way", :through => :old_way_nodes, :source => :way
- def lon
- return self.longitude.to_f / 10000000
- end
+ 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
+ # Sanity check the latitude and longitude and add an error if it's broken
def validate_position
errors.add_to_base("Node is not in the world") unless in_world?
end
- def in_world?
- return false if self.lat < -90 or self.lat > 90
- return false if self.lon < -180 or self.lon > 180
- return true
+ #
+ # 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 = {})
+ min_lon, min_lat, max_lon, max_lat = *bounding_box
+ # @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(min_lat, min_lon, max_lat, max_lon,
+ :conditions => 'visible = 1',
+ :limit => APP_CONFIG['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
- p = XML::Parser.new
- p.string = xml
+ p = XML::Parser.string(xml)
doc = p.parse
node = Node.new
tags << [tag['k'],tag['v']]
end
- tags = tags.collect { |k,v| "#{k}=#{v}" }.join(';')
- tags = '' if tags.nil?
-
- node.tags = tags
+ node.tags = Tags.join(tags)
end
rescue
node = nil
return node
end
+ # Save this node with the appropriate OldNode object to represent it's history.
def save_with_history!
Node.transaction do
self.timestamp = Time.now
end
end
+ # Turn this Node in to a complete OSM XML object with <osm> wrapper
def to_xml
doc = OSM::API.new.get_xml_doc
doc.root << to_xml_node()
return doc
end
+ # Turn this Node in to an XML Node without the <osm> wrapper.
def to_xml_node(user_display_name_cache = nil)
el1 = XML::Node.new 'node'
el1['id'] = self.id.to_s
el1['user'] = user_display_name_cache[self.user_id] unless user_display_name_cache[self.user_id].nil?
- Node.split_tags(el1, self.tags)
+ Tags.split(self.tags) 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
end
- def self.split_tags(el, tags)
- tags.split(';').each do |tag|
- parts = tag.split('=')
- key = ''
- val = ''
- key = parts[0].strip unless parts[0].nil?
- val = parts[1].strip unless parts[1].nil?
- if key != '' && val != ''
- el2 = XML::Node.new('tag')
- el2['k'] = key.to_s
- el2['v'] = val.to_s
- el << el2
- end
+ # Return the node's tags as a Hash of keys and their values
+ def tags_as_hash
+ hash = {}
+ Tags.split(self.tags) do |k,v|
+ hash[k] = v
end
+ hash
end
end