Merge branch 'master' into history
[potlatch2.git] / net / systemeD / halcyon / connection / Way.as
index f04a6c5..11d3214 100644 (file)
 package net.systemeD.halcyon.connection {
     import flash.geom.Point;
-       import net.systemeD.halcyon.Globals;
+    
+    import net.systemeD.halcyon.connection.actions.*;
 
     public class Way extends Entity {
         private var nodes:Array;
+               private var edge_l:Number;
+               private var edge_r:Number;
+               private var edge_t:Number;
+               private var edge_b:Number;
                public static var entity_type:String = 'way';
 
-        public function Way(id:Number, version:uint, tags:Object, loaded:Boolean, nodes:Array) {
-            super(id, version, tags, loaded);
+        public function Way(connection:Connection, id:Number, version:uint, tags:Object, loaded:Boolean, nodes:Array, uid:Number = NaN, timestamp:String = null, user:String = null) {
+            super(connection, id, version, tags, loaded, uid, timestamp, user);
             this.nodes = nodes;
                        for each (var node:Node in nodes) { node.addParent(this); }
+                       calculateBbox();
         }
 
-               public function update(version:uint, tags:Object, loaded:Boolean, nodes:Array):void {
+               public function update(version:uint, tags:Object, loaded:Boolean, parentsLoaded:Boolean, nodes:Array, uid:Number = NaN, timestamp:String = null, user:String = null):void {
                        var node:Node;
                        for each (node in this.nodes) { node.removeParent(this); }
-                       updateEntityProperties(version,tags,loaded); this.nodes=nodes;
+                       updateEntityProperties(version,tags,loaded,parentsLoaded,uid,timestamp,user); this.nodes=nodes;
                        for each (node in nodes) { node.addParent(this); }
+                       calculateBbox();
                }
                
         public function get length():uint {
             return nodes.length;
         }
-        
+
+               private function calculateBbox():void {
+                       edge_l=999999; edge_r=-999999;
+                       edge_b=999999; edge_t=-999999;
+                       for each (var node:Node in nodes) { expandBbox(node); }
+               }
+
+               public function expandBbox(node:Node):void {
+                       edge_l=Math.min(edge_l,node.lon);
+                       edge_r=Math.max(edge_r,node.lon);
+                       edge_b=Math.min(edge_b,node.lat);
+                       edge_t=Math.max(edge_t,node.lat);
+               }
+               
+               public override function within(left:Number,right:Number,top:Number,bottom:Number):Boolean {
+                       if (!edge_l ||
+                               (edge_l<left   && edge_r<left  ) ||
+                           (edge_l>right  && edge_r>right ) ||
+                           (edge_b<bottom && edge_t<bottom) ||
+                           (edge_b>top    && edge_b>top   ) || deleted) { return false; }
+                       return true;
+               }
+
         public function getNode(index:uint):Node {
             return nodes[index];
         }
 
+        public function getFirstNode():Node {
+            return nodes[0];
+        }
+
                public function getLastNode():Node {
                        return nodes[nodes.length-1];
                }
+               
+               /** Given one node, return the next in sequence, cycling around a loop if necessary. */
+               // TODO make behave correctly for P-shaped topologies?
+               public function getNextNode(node:Node):Node {
+                       // If the last node in a loop is selected, this behaves correctly.
+                   var i:uint = indexOfNode(node);
+                   if(i < length-1)
+                   return nodes[i+1];
+               return null;
+               // What should happen for very short lengths?      
+               }
+        
+        // TODO make behave correctly for P-shaped topologies?
+        /** Given one node, return the previous, cycling around a loop if necessary. */
+        public function getPrevNode(node:Node):Node {
+            var i:uint = indexOfNode(node);
+            if(i > 0)
+                return nodes[i-1];
+            if(i == 0 && isArea() )
+                return nodes[nodes.length - 2]
+            return null;
+            // What should happen for very short lengths?      
+        }
 
-        public function insertNode(index:uint, node:Node):void {
-                       node.addParent(this);
-            nodes.splice(index, 0, node);
-            markDirty();
-            dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_ADDED, node, this, index));
+        public function insertNode(index:uint, node:Node, performAction:Function):void {
+                       if (index>0 && getNode(index-1)==node) return;
+                       if (index<nodes.length-1 && getNode(index)==node) return;
+                       performAction(new AddNodeToWayAction(this, node, nodes, index, false));
         }
 
-        public function appendNode(node:Node):uint {
-                       node.addParent(this);
-            nodes.push(node);
-            markDirty();
-            dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_ADDED, node, this, nodes.length - 1));
-            return nodes.length;
+        public function appendNode(node:Node, performAction:Function):uint {
+                       if (node!=getLastNode()) performAction(new AddNodeToWayAction(this, node, nodes, -1));
+            return nodes.length + 1;
         }
         
-        public function prependNode(node:Node):uint {
-                       node.addParent(this);
-            nodes.unshift(node);
-            markDirty();
-            dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_ADDED, node, this, 0));
-            return nodes.length;
+        public function prependNode(node:Node, performAction:Function):uint {
+                       if (node!=getFirstNode()) performAction(new AddNodeToWayAction(this, node, nodes, 0));
+            return nodes.length + 1;
         }
         
-        public function indexOfNode(node:Node):uint {
+        // return the index of the Node, or -1 if not found
+        public function indexOfNode(node:Node):int {
             return nodes.indexOf(node);
         }
 
-               public function removeNode(node:Node):void {
-                       var i:int;
-                       while ((i=nodes.indexOf(node))>-1) {
-                               nodes.splice(i,1);
-               dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_REMOVED, node, this, i));
+               public function hasOnceOnly(node:Node):Boolean {
+                       return nodes.indexOf(node)==nodes.lastIndexOf(node);
+               }
+               
+               public function hasLockedNodes():Boolean {
+                       for each (var node:Node in nodes) {
+                               if (node.locked) { return true; }
                        }
-                       node.removeParent(this);
-                       markDirty();
+                       return false;
+               }
+
+               public function removeNode(node:Node, performAction:Function):void {
+                       performAction(new RemoveNodeFromWayAction(this, node, nodes));
                }
 
-        public function removeNodeByIndex(index:uint):void {
-            var removed:Array=nodes.splice(index, 1);
-                       if (nodes.indexOf(removed[0])==-1) { removed[0].removeParent(this); }
-                       markDirty();
-            dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_REMOVED, removed[0], this, index));
+        public function removeNodeByIndex(index:uint, performAction:Function, fireEvent:Boolean=true):void {
+            performAction(new RemoveNodeByIndexAction(this, nodes, index, fireEvent));
         }
 
                public function sliceNodes(start:int,end:int):Array {
                        return nodes.slice(start,end);
                }
 
-               public function deleteNodesFrom(start:int):void {
-                       nodes.splice(start);
-               }
-
-               public function mergeWith(way:Way,topos:int,frompos:int):void {
-                       var i:int;
-
-                       // merge relations
-                       for each (var r:Relation in way.parentRelations) {
-                               // ** needs to copy roles as well
-                               if (r.findEntityMemberIndex(this)==-1) {
-                                       r.appendMember(new RelationMember(this, ''));
-                               }
-                       }
-
-                       // merge tags
-                       var t:Object=way.getTagsHash();
-                       for (var k:String in t) {
-                               if (getTag(k) && getTag(k)!=t[k]) {
-                                       setTag(k,getTag(k)+"; "+t[k]);
-                                       // ** send a warning about tags not matching
-                               } else {
-                                       setTag(k,t[k]);
-                               }
-                       }
-
-                       // merge nodes
-                       if (frompos==0) { for (i=0; i<way.length;    i++) { addToEnd(topos,way.getNode(i)); } }
-                                          else { for (i=way.length-1; i>=0; i--) { addToEnd(topos,way.getNode(i)); } }
+        public function deleteNodesFrom(start:int, performAction:Function):void {
+            for (var i:int=nodes.length-1; i>=start; i--) {
+              performAction(new RemoveNodeByIndexAction(this, nodes, i));
+            }
+            markDirty();
+        }
 
-                       // delete way
-                       way.remove();
+               /** Merges another way into this one, removing the other one. */
+               public function mergeWith(way:Way,topos:int,frompos:int, performAction:Function):void {
+                       performAction(new MergeWaysAction(this, way, topos, frompos));
                }
                
-               private function addToEnd(topos:int,node:Node):void {
+               public function addToEnd(topos:int,node:Node, performAction:Function):void {
                        if (topos==0) {
                                if (nodes[0]==node) { return; }
-                               prependNode(node);
+                               prependNode(node, performAction);
                        } else {
                                if (nodes[nodes.length-1]==node) { return; }
-                               appendNode(node);
+                               appendNode(node, performAction);
                        }
                }
 
+        public function reverseNodes(performAction:Function):void {
+            performAction(new ReverseNodesAction(this, nodes));
+        }
 
+               
+               /** Is a point within this way?
+               * From http://as3.miguelmoraleda.com/2009/10/28/point-in-polygon-with-actionscript-3punto-dentro-de-un-poligono-con-actionscript-3/
+               */
+
+               public function pointWithin(lon:Number,lat:Number):Boolean {
+                       if (!isArea()) return false;
+                       
+                       var counter:uint = 0;
+                       var p1x:Number = nodes[0].lon;
+                       var p1y:Number = nodes[0].lat;
+                       var p2x:Number, p2y:Number;
+                       for (var i:uint = 1; i <= length; i++) {
+                               p2x = nodes[i % length].lon;
+                               p2y = nodes[i % length].lat;
+                               if (lat > Math.min(p1y, p2y)) {
+                                       if (lat <= Math.max(p1y, p2y)) {
+                                               if (lon <= Math.max(p1x, p2x)) {
+                                                       if (p1y != p2y) {
+                                                               var xinters:Number = (lat - p1y) * (p2x - p1x) / (p2y - p1y) + p1x;
+                                                               if (p1x == p2x || lon <= xinters) counter++;
+                                                       }
+                                               }
+                                       }
+                               }
+                               p1x = p2x;
+                               p1y = p2y;
+                       }
+                       if (counter % 2 == 0) { return false; }
+                       else { return true; }
+               }
 
         /**
          * Finds the 1st way segment which intersects the projected
@@ -131,7 +196,7 @@ package net.systemeD.halcyon.connection {
          * specified then the node is moved to exactly bisect the
          * segment.
          */
-        public function insertNodeAtClosestPosition(newNode:Node, isSnap:Boolean):int {
+        public function insertNodeAtClosestPosition(newNode:Node, isSnap:Boolean, performAction:Function):int {
             var closestProportion:Number = 1;
             var newIndex:uint = 0;
             var nP:Point = new Point(newNode.lon, newNode.latp);
@@ -156,10 +221,9 @@ package net.systemeD.halcyon.connection {
             
             // splice in new node
             if ( isSnap ) {
-                newNode.latp = snapped.y;
-                newNode.lon = snapped.x;
+                newNode.setLonLatp(snapped.x, snapped.y, performAction);
             }
-            insertNode(newIndex, newNode);
+            insertNode(newIndex, newNode, performAction);
             return newIndex;
         }
         
@@ -176,23 +240,56 @@ package net.systemeD.halcyon.connection {
         }
 
                public function isArea():Boolean {
+                       if (nodes.length==0) { return false; }
                        return (nodes[0].id==nodes[nodes.length-1].id && nodes.length>2);
                }
                
-               public override function remove():void {
-                       var node:Node;
-                       removeFromParents();
-                       while (nodes.length) { 
-                               node=nodes.pop();
-                               dispatchEvent(new WayNodeEvent(Connection.WAY_NODE_REMOVED, node, this, 0));
-                               // ** the event mechanism calls redraw once per wayNodeRemoved, which isn't too efficient
-                               //    so we should probably add a 'redraw' flag to WayNodeEvent
-                               node.removeParent(this);
-                               if (!node.hasParents) { node.remove(); }
+               public function endsWith(node:Node):Boolean {
+                       return (nodes[0]==node || nodes[nodes.length-1]==node);
+               }
+               
+               public override function remove(performAction:Function):void {
+                       performAction(new DeleteWayAction(this, setDeletedState, nodes));
+               }
+
+               public override function nullify():void {
+                       nullifyEntity();
+                       nodes=[];
+                       edge_l=edge_r=edge_t=edge_b=NaN;
+               }
+               
+               public function get clockwise():Boolean {
+                       var lowest:uint=0;
+                       var xmin:Number=-999999; var ymin:Number=-999999;
+                       for (var i:uint=0; i<nodes.length; i++) {
+                               if      (nodes[i].latp> ymin) { lowest=i; xmin=nodes[i].lon; ymin=nodes[i].latp; }
+                               else if (nodes[i].latp==ymin
+                                         && nodes[i].lon > xmin) { lowest=i; xmin=nodes[i].lon; ymin=nodes[i].latp; }
                        }
-                       deleted=true;
-            dispatchEvent(new EntityEvent(Connection.WAY_DELETED, this));
+                       return (this.onLeft(lowest)>0);
                }
+               
+               private function onLeft(j:uint):Number {
+                       var left:Number=0;
+                       var i:int, k:int;
+                       if (nodes.length>=3) {
+                               i=j-1; if (i==-1) { i=nodes.length-2; }
+                               k=j+1; if (k==nodes.length) { k=1; }
+                               left=((nodes[j].lon-nodes[i].lon) * (nodes[k].latp-nodes[i].latp) -
+                                         (nodes[k].lon-nodes[i].lon) * (nodes[j].latp-nodes[i].latp));
+                       }
+                       return left;
+               }
+
+        public function get angle():Number {
+            var dx:Number = nodes[nodes.length-1].lon - nodes[0].lon;
+            var dy:Number = nodes[nodes.length-1].latp - nodes[0].latp;
+            if (dx != 0 || dy != 0) {
+                return Math.atan2(dx,dy)*(180/Math.PI);
+            } else {
+                return 0;
+            }
+        }
 
                internal override function isEmpty():Boolean {
                        return (deleted || (nodes.length==0));
@@ -201,6 +298,77 @@ package net.systemeD.halcyon.connection {
                public override function getType():String {
                        return 'way';
                }
-    }
+               
+               public override function isType(str:String):Boolean {
+                       if (str=='way') return true;
+                       if (str=='line' && !isArea()) return true;
+                       if (str=='area' &&  isArea()) return true;
+                       return false;
+               }
+               
+               /** Whether the way has a loop that joins back midway along its length */
+               public function isPShape():Boolean {
+                       return getFirstNode() != getLastNode() && (!hasOnceOnly(getFirstNode()) || !hasOnceOnly(getLastNode()) );
+               }
+               
+               /** Given a P-shaped way, return the index of midway node that one end connects back to. */
+               public function getPJunctionNodeIndex():uint {
+                       if (isPShape()) {
+                           if (hasOnceOnly(getFirstNode())) {
+                               // nodes[0] is the free end
+                               return nodes.indexOf(getLastNode());
+                           } else {
+                               // nodes[0] is in the loop
+                               return nodes.lastIndexOf(getFirstNode());
+                           }
+                       }
+                       return null;
+               }
+
+               public function intersects(left:Number,right:Number,top:Number,bottom:Number):Boolean {
+                       // simple test first: are any nodes contained?
+                       for (var i:uint=0; i<nodes.length; i++) {
+                               if (nodes[i].within(left,right,top,bottom)) return true;
+                       }
+                       // more complex test: do any segments cross?
+                       for (i=0; i<nodes.length-1; i++) {
+                               if (lineIntersectsRectangle(
+                                       nodes[i  ].lon, nodes[i  ].lat,
+                                       nodes[i+1].lon, nodes[i+1].lat,
+                                       left,right,top,bottom)) return true;
+                       }
+                       return false;
+               }
+               
+               private function lineIntersectsRectangle(x0:Number, y0:Number, x1:Number, y1:Number, l:Number, r:Number, b:Number, t:Number):Boolean {
+                       // from http://sebleedelisle.com/2009/05/super-fast-trianglerectangle-intersection-test/
+                       // note that t and b are transposed above because we're dealing with lat (top=90), not AS3 pixels (top=0)
+                       var m:Number = (y1-y0) / (x1-x0);
+                       var c:Number = y0 -(m*x0);
+                       var top_intersection:Number, bottom_intersection:Number;
+                       var toptrianglepoint:Number, bottomtrianglepoint:Number;
 
+                       if (m>0) {
+                               top_intersection = (m*l  + c);
+                               bottom_intersection = (m*r  + c);
+                       } else {
+                               top_intersection = (m*r  + c);
+                               bottom_intersection = (m*l  + c);
+                       }
+
+                       if (y0<y1) {
+                               toptrianglepoint = y0;
+                               bottomtrianglepoint = y1;
+                       } else {
+                               toptrianglepoint = y1;
+                               bottomtrianglepoint = y0;
+                       }
+
+                       var topoverlap:Number = top_intersection>toptrianglepoint ? top_intersection : toptrianglepoint;
+                       var botoverlap:Number = bottom_intersection<bottomtrianglepoint ? bottom_intersection : bottomtrianglepoint;
+                       return (topoverlap<botoverlap) && (!((botoverlap<t) || (topoverlap>b)));
+               }
+
+
+    }
 }