1 package net.systemeD.halcyon.connection {
2 import flash.geom.Point;
3 import net.systemeD.halcyon.Globals;
5 public class Way extends Entity {
6 private var nodes:Array;
7 public static var entity_type:String = 'way';
9 public function Way(id:Number, version:uint, tags:Object, loaded:Boolean, nodes:Array) {
10 super(id, version, tags, loaded);
12 for each (var node:Node in nodes) { node.addParent(this); }
15 public function update(version:uint, tags:Object, loaded:Boolean, nodes:Array):void {
17 for each (node in this.nodes) { node.removeParent(this); }
18 updateEntityProperties(version,tags,loaded); this.nodes=nodes;
19 for each (node in nodes) { node.addParent(this); }
22 public function get length():uint {
26 public function getNode(index:uint):Node {
30 public function getLastNode():Node {
31 return nodes[nodes.length-1];
34 public function insertNode(index:uint, node:Node):void {
36 nodes.splice(index, 0, node);
38 dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_ADDED, node, this, index));
41 public function appendNode(node:Node):uint {
45 dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_ADDED, node, this, nodes.length - 1));
49 public function prependNode(node:Node):uint {
53 dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_ADDED, node, this, 0));
57 public function indexOfNode(node:Node):uint {
58 return nodes.indexOf(node);
61 public function removeNode(node:Node):void {
63 while ((i=nodes.indexOf(node))>-1) {
65 dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_REMOVED, node, this, i));
67 node.removeParent(this);
71 public function removeNodeByIndex(index:uint):void {
72 var removed:Array=nodes.splice(index, 1);
73 if (nodes.indexOf(removed[0])==-1) { removed[0].removeParent(this); }
75 dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_REMOVED, removed[0], this, index));
78 public function sliceNodes(start:int,end:int):Array {
79 return nodes.slice(start,end);
82 public function deleteNodesFrom(start:int):void {
83 for (var i:int=start; i<nodes.length; i++) {
84 nodes[i].removeParent(this);
90 public function mergeWith(way:Way,topos:int,frompos:int):void {
95 for each (var r:Relation in way.parentRelations) {
96 // ** needs to copy roles as well
97 if (r.findEntityMemberIndex(this)==-1) {
98 r.appendMember(new RelationMember(this, ''));
103 var t:Object=way.getTagsHash();
104 for (var k:String in t) {
105 if (getTag(k) && getTag(k)!=t[k]) {
106 setTag(k,getTag(k)+"; "+t[k]);
107 // ** send a warning about tags not matching
114 if (frompos==0) { for (i=0; i<way.length; i++) { addToEnd(topos,way.getNode(i)); } }
115 else { for (i=way.length-1; i>=0; i--) { addToEnd(topos,way.getNode(i)); } }
122 private function addToEnd(topos:int,node:Node):void {
124 if (nodes[0]==node) { return; }
127 if (nodes[nodes.length-1]==node) { return; }
135 * Finds the 1st way segment which intersects the projected
136 * coordinate and adds the node to that segment. If snap is
137 * specified then the node is moved to exactly bisect the
140 public function insertNodeAtClosestPosition(newNode:Node, isSnap:Boolean):int {
141 var closestProportion:Number = 1;
142 var newIndex:uint = 0;
143 var nP:Point = new Point(newNode.lon, newNode.latp);
144 var snapped:Point = null;
146 for ( var i:uint; i < length - 1; i++ ) {
147 var node1:Node = getNode(i);
148 var node2:Node = getNode(i+1);
149 var p1:Point = new Point(node1.lon, node1.latp);
150 var p2:Point = new Point(node2.lon, node2.latp);
152 var directDist:Number = Point.distance(p1, p2);
153 var viaNewDist:Number = Point.distance(p1, nP) + Point.distance(nP, p2);
155 var proportion:Number = Math.abs(viaNewDist/directDist - 1);
156 if ( proportion < closestProportion ) {
158 closestProportion = proportion;
159 snapped = calculateSnappedPoint(p1, p2, nP);
163 // splice in new node
165 newNode.latp = snapped.y;
166 newNode.lon = snapped.x;
168 insertNode(newIndex, newNode);
172 private function calculateSnappedPoint(p1:Point, p2:Point, nP:Point):Point {
173 var w:Number = p2.x - p1.x;
174 var h:Number = p2.y - p1.y;
175 var u:Number = ((nP.x-p1.x) * w + (nP.y-p1.y) * h) / (w*w + h*h);
176 return new Point(p1.x + u*w, p1.y+u*h);
179 public override function toString():String {
180 return "Way("+id+"@"+version+"): "+getTagList()+
181 " "+nodes.map(function(item:Node,index:int, arr:Array):String {return item.id.toString();}).join(",");
184 public function isArea():Boolean {
185 return (nodes[0].id==nodes[nodes.length-1].id && nodes.length>2);
188 public function get clockwise():Boolean {
190 var xmin:Number=-999999; var ymin:Number=-999999;
191 for (var i:uint=0; i<nodes.length; i++) {
192 if (nodes[i].latp> ymin) { lowest=i; xmin=nodes[i].lon; ymin=nodes[i].latp; }
193 else if (nodes[i].latp==ymin
194 && nodes[i].lon > xmin) { lowest=i; xmin=nodes[i].lon; ymin=nodes[i].latp; }
196 return (this.onLeft(lowest)>0);
199 private function onLeft(j:uint):Number {
202 if (nodes.length>=3) {
203 i=j-1; if (i==-1) { i=nodes.length-2; }
204 k=j+1; if (k==nodes.length) { k=1; }
205 left=((nodes[j].lon-nodes[i].lon) * (nodes[k].latp-nodes[i].latp) -
206 (nodes[k].lon-nodes[i].lon) * (nodes[j].latp-nodes[i].latp));
211 public override function remove():void {
215 while (nodes.length) {
217 dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_REMOVED, node, this, 0));
218 node.removeParent(this);
219 if (!node.hasParents) { node.remove(); }
222 dispatchEvent(new EntityEvent(Connection.WAY_DELETED, this));
226 internal override function isEmpty():Boolean {
227 return (deleted || (nodes.length==0));
230 public override function getType():String {