harmony-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From ndbe...@apache.org
Subject svn commit: r823780 - /harmony/enhanced/classlib/trunk/modules/awt/src/main/java/common/org/apache/harmony/awt/geom/CurveCrossingHelper.java
Date Sat, 10 Oct 2009 03:41:57 GMT
Author: ndbeyer
Date: Sat Oct 10 03:41:57 2009
New Revision: 823780

URL: http://svn.apache.org/viewvc?rev=823780&view=rev
Log:
add generic types

Modified:
    harmony/enhanced/classlib/trunk/modules/awt/src/main/java/common/org/apache/harmony/awt/geom/CurveCrossingHelper.java

Modified: harmony/enhanced/classlib/trunk/modules/awt/src/main/java/common/org/apache/harmony/awt/geom/CurveCrossingHelper.java
URL: http://svn.apache.org/viewvc/harmony/enhanced/classlib/trunk/modules/awt/src/main/java/common/org/apache/harmony/awt/geom/CurveCrossingHelper.java?rev=823780&r1=823779&r2=823780&view=diff
==============================================================================
--- harmony/enhanced/classlib/trunk/modules/awt/src/main/java/common/org/apache/harmony/awt/geom/CurveCrossingHelper.java
(original)
+++ harmony/enhanced/classlib/trunk/modules/awt/src/main/java/common/org/apache/harmony/awt/geom/CurveCrossingHelper.java
Sat Oct 10 03:41:57 2009
@@ -200,9 +200,9 @@
         		for (int k = 0; k < ipCount; k++) {
                     IntersectPoint ip = null;
                     if (!containsPoint(points[2*k], points[2*k + 1])) {
-                        for (Iterator iter = isectPoints.iterator(); 
+                        for (Iterator<IntersectPoint> iter = isectPoints.iterator();

                                     iter.hasNext(); ) {
-                    	    ip = (IntersectPoint)iter.next();
+                    	    ip = iter.next();
                             if ((begIndex1 == ip.getBegIndex(true)) && 
                             	(endIndex1 == ip.getEndIndex(true))) {
                             	
@@ -303,8 +303,8 @@
     private boolean containsPoint(double x, double y) {
     	IntersectPoint ipoint;
     	
-    	for (Iterator i = isectPoints.iterator(); i.hasNext(); ) {
-        	ipoint = (IntersectPoint)i.next();
+    	for (Iterator<IntersectPoint> i = isectPoints.iterator(); i.hasNext(); ) {
+        	ipoint = i.next();
         	
         	if ((Math.abs(ipoint.getX() - x) < Math.pow(10, -6)) && 
         		(Math.abs(ipoint.getY() - y) < Math.pow(10, -6))) {



Mime
View raw message