public class oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet extends oadd.org.apache.commons.math.geometry.partitioning.AbstractRegion
{
private oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices;
public void <init>()
{
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.AbstractRegion: void <init>()>();
return;
}
public void <init>(oadd.org.apache.commons.math.geometry.partitioning.BSPTree)
{
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v := @parameter: oadd.org.apache.commons.math.geometry.partitioning.BSPTree;
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.AbstractRegion: void <init>(oadd.org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
return;
}
public void <init>(java.util.Collection)
{
java.util.Collection v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v := @parameter: java.util.Collection;
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.AbstractRegion: void <init>(java.util.Collection)>(v);
return;
}
public void <init>(double, double, double, double)
{
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Line[] v;
double v, v, v, v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v := @parameter: double;
v := @parameter: double;
v := @parameter: double;
v := @parameter: double;
v = staticinvoke <oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Line[] boxBoundary(double,double,double,double)>(v, v, v, v);
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.AbstractRegion: void <init>(oadd.org.apache.commons.math.geometry.partitioning.Hyperplane[])>(v);
return;
}
public transient void <init>(double, oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[])
{
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
double v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[] v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v := @parameter: double;
v := @parameter: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[];
v = staticinvoke <oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.partitioning.BSPTree verticesToTree(double,oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[])>(v, v);
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.AbstractRegion: void <init>(oadd.org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
return;
}
private static oadd.org.apache.commons.math.geometry.euclidean.twod.Line[] boxBoundary(double, double, double, double)
{
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D v, v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Line v, v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Line[] v;
double v, v, v, v;
v := @parameter: double;
v := @parameter: double;
v := @parameter: double;
v := @parameter: double;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: void <init>(double,double)>(v, v);
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: void <init>(double,double)>(v, v);
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: void <init>(double,double)>(v, v);
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: void <init>(double,double)>(v, v);
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.Line)[4];
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Line;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)>(v, v);
v[0] = v;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Line;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)>(v, v);
v[1] = v;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Line;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)>(v, v);
v[2] = v;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Line;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)>(v, v);
v[3] = v;
return v;
}
private static transient oadd.org.apache.commons.math.geometry.partitioning.BSPTree verticesToTree(double, oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[])
{
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex[] v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D v, v, v, v;
java.util.ArrayList v;
byte v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex v, v, v, v;
int v, v, v, v, v, v, v;
java.lang.Boolean v;
double v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Line v, v;
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[] v;
v := @parameter: double;
v := @parameter: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[];
v = lengthof v;
if v != 0 goto label;
v = new oadd.org.apache.commons.math.geometry.partitioning.BSPTree;
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void <init>(java.lang.Object)>(v);
return v;
label:
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex)[v];
v = 0;
label:
if v >= v goto label;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex;
v = v[v];
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)>(v);
v[v] = v;
v = v + 1;
goto label;
label:
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v + 1;
v = v % v;
v = v[v];
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.Line sharedLineWith(oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex)>(v);
if v != null goto label;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Line;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getLocation()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getLocation()>();
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)>(v, v);
v = v;
label:
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex,oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex,oadd.org.apache.commons.math.geometry.euclidean.twod.Line)>(v, v, v);
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
if v == v goto label;
if v == v goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getLocation()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: double getOffset(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double abs(double)>(v);
v = v cmpg v;
if v > 0 goto label;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: void bindWith(oadd.org.apache.commons.math.geometry.euclidean.twod.Line)>(v);
label:
v = v + 1;
goto label;
label:
v = v + 1;
goto label;
label:
v = new oadd.org.apache.commons.math.geometry.partitioning.BSPTree;
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void <init>()>();
staticinvoke <oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void insertEdges(double,oadd.org.apache.commons.math.geometry.partitioning.BSPTree,java.util.List)>(v, v, v);
return v;
}
private static void insertEdges(double, oadd.org.apache.commons.math.geometry.partitioning.BSPTree, java.util.List)
{
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D v, v;
byte v, v, v, v;
int[] v;
oadd.org.apache.commons.math.geometry.partitioning.Side v, v, v, v, v, v, v;
boolean v, v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Line v, v, v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v, v, v, v, v;
java.util.List v;
java.util.ArrayList v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex v, v, v, v;
int v, v, v, v, v;
java.lang.Boolean v, v, v, v;
double v, v, v, v, v;
java.util.Iterator v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge v, v, v, v;
java.lang.Object v, v;
v := @parameter: double;
v := @parameter: oadd.org.apache.commons.math.geometry.partitioning.BSPTree;
v := @parameter: java.util.List;
v = 0;
label:
v = interfaceinvoke v.<java.util.List: int size()>();
if v >= v goto label;
v = v;
v = v + 1;
v = interfaceinvoke v.<java.util.List: java.lang.Object get(int)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getNode()>();
if v != null goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: boolean insertCut(oadd.org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
if v == 0 goto label;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: void setNode(oadd.org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
goto label;
label:
v = null;
goto label;
label:
v = null;
goto label;
label:
if v != null goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getParent()>();
if v == null goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
if v != v goto label;
label:
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
goto label;
label:
v = <java.lang.Boolean: java.lang.Boolean FALSE>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
label:
return;
label:
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
v = interfaceinvoke v.<java.util.List: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
if v == v goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex getStart()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getLocation()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: double getOffset(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex getEnd()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getLocation()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: double getOffset(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double abs(double)>(v);
v = v cmpg v;
if v > 0 goto label;
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side HYPER>;
goto label;
label:
v = v cmpg 0.0;
if v >= 0 goto label;
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side MINUS>;
goto label;
label:
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side PLUS>;
label:
v = v;
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double abs(double)>(v);
v = v cmpg v;
if v > 0 goto label;
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side HYPER>;
goto label;
label:
v = v cmpg 0.0;
if v >= 0 goto label;
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side MINUS>;
goto label;
label:
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side PLUS>;
label:
v = <oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$1: int[] $SwitchMap$org$apache$commons$math3$geometry$partitioning$Side>;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.Side: int ordinal()>();
v = v[v];
lookupswitch(v)
{
case 1: goto label;
case 2: goto label;
default: goto label;
};
label:
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side MINUS>;
if v != v goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex split(oadd.org.apache.commons.math.geometry.euclidean.twod.Line)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge getOutgoing()>();
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge getIncoming()>();
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side PLUS>;
if v != v goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex split(oadd.org.apache.commons.math.geometry.euclidean.twod.Line)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge getIncoming()>();
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Vertex: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$Edge getOutgoing()>();
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side PLUS>;
if v != v goto label;
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
v = <oadd.org.apache.commons.math.geometry.partitioning.Side: oadd.org.apache.commons.math.geometry.partitioning.Side MINUS>;
if v != v goto label;
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
v = interfaceinvoke v.<java.util.List: boolean isEmpty()>();
if v != 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
staticinvoke <oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void insertEdges(double,oadd.org.apache.commons.math.geometry.partitioning.BSPTree,java.util.List)>(v, v, v);
goto label;
label:
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = <java.lang.Boolean: java.lang.Boolean FALSE>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
label:
v = interfaceinvoke v.<java.util.List: boolean isEmpty()>();
if v != 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
staticinvoke <oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void insertEdges(double,oadd.org.apache.commons.math.geometry.partitioning.BSPTree,java.util.List)>(v, v, v);
goto label;
label:
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
label:
return;
}
public oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet buildNew(oadd.org.apache.commons.math.geometry.partitioning.BSPTree)
{
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v, v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v := @parameter: oadd.org.apache.commons.math.geometry.partitioning.BSPTree;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void <init>(oadd.org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
return v;
}
protected void computeGeometricalProperties()
{
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D v, v, v, v, v, v, v, v, v;
byte v;
boolean v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] v;
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[] v, v;
int v, v, v, v, v, v, v, v, v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
java.lang.Object v;
oadd.org.apache.commons.math.geometry.partitioning.SubHyperplane v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] getVertices()>();
v = lengthof v;
if v != 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)>(0);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setSize(double)>(#Infinity);
v = <oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D NaN>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setBarycenter(oadd.org.apache.commons.math.geometry.Vector)>(v);
goto label;
label:
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setSize(double)>(0.0);
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: void <init>(double,double)>(0.0, 0.0);
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setBarycenter(oadd.org.apache.commons.math.geometry.Vector)>(v);
goto label;
label:
v = v[0];
v = v[0];
if v != null goto label;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setSize(double)>(#Infinity);
v = <oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D NaN>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setBarycenter(oadd.org.apache.commons.math.geometry.Vector)>(v);
goto label;
label:
v = 0.0;
v = 0.0;
v = 0.0;
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = lengthof v;
v = v - 1;
v = v[v];
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: double getX()>();
v = lengthof v;
v = v - 1;
v = v[v];
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: double getY()>();
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v;
v = v;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: double getX()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: double getY()>();
v = v * v;
v = v * v;
v = v - v;
v = v + v;
v = v + v;
v = v * v;
v = v + v;
v = v + v;
v = v * v;
v = v + v;
v = v + 1;
goto label;
label:
v = v + 1;
goto label;
label:
v = v cmpg 0.0;
if v >= 0 goto label;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setSize(double)>(#Infinity);
v = <oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D NaN>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setBarycenter(oadd.org.apache.commons.math.geometry.Vector)>(v);
goto label;
label:
v = v / 2.0;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setSize(double)>(v);
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D;
v = 3.0 * v;
v = v / v;
v = 3.0 * v;
v = v / v;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: void <init>(double,double)>(v, v);
virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: void setBarycenter(oadd.org.apache.commons.math.geometry.Vector)>(v);
label:
return;
}
public oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] getVertices()
{
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D v, v, v, v, v, v, v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$SegmentsBuilder v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] v, v, v, v, v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[] v, v, v;
java.util.ArrayList v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
oadd.org.apache.commons.math.geometry.partitioning.SubHyperplane v;
boolean v, v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.twod.Line v, v, v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.BSPTree v, v;
java.util.List v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
double v, v, v, v, v, v, v, v, v, v;
java.util.Iterator v, v, v;
oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D v, v, v, v, v, v;
java.lang.Object v, v, v, v, v, v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v = v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices>;
if v != null goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)>(0);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: oadd.org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[])[0];
v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices> = v;
goto label;
label:
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$SegmentsBuilder;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$SegmentsBuilder: void <init>()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)>(1);
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.BSPTree: void visit(oadd.org.apache.commons.math.geometry.partitioning.BSPTreeVisitor)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$SegmentsBuilder: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree getSorted()>();
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
label:
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: boolean isEmpty()>();
if v != 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getSmallest()>();
v = specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: java.util.List followLoop(oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node,oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree)>(v, v);
if v == null goto label;
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
goto label;
label:
v = virtualinvoke v.<java.util.ArrayList: int size()>();
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[])[v];
v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices> = v;
v = 0;
v = virtualinvoke v.<java.util.ArrayList: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = interfaceinvoke v.<java.util.List: int size()>();
if v >= 2 goto label;
v = interfaceinvoke v.<java.util.List: java.lang.Object get(int)>(0);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices>;
v = v;
v = v + 1;
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)[3];
v[0] = null;
v = new oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D: void <init>(double)>(-3.4028234663852886E38);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D toSpace(oadd.org.apache.commons.math.geometry.Vector)>(v);
v[1] = v;
v = new oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D: void <init>(double)>(3.4028234663852886E38);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D toSpace(oadd.org.apache.commons.math.geometry.Vector)>(v);
v[2] = v;
v[v] = v;
goto label;
label:
v = interfaceinvoke v.<java.util.List: java.lang.Object get(int)>(0);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getStart()>();
if v != null goto label;
v = interfaceinvoke v.<java.util.List: int size()>();
v = v + 2;
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)[v];
v = 0;
v = interfaceinvoke v.<java.util.List: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
if v != 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getEnd()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D toSubSpace(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D: double getX()>();
v = v / 2.0;
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double abs(double)>(v);
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double max(double,double)>(1.0, v);
v = v - v;
v = v + 1;
v[v] = null;
v = v + 1;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = new oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D: void <init>(double)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D toSpace(oadd.org.apache.commons.math.geometry.Vector)>(v);
v[v] = v;
label:
v = lengthof v;
v = v - 1;
if v >= v goto label;
v = v;
v = v + 1;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getEnd()>();
v[v] = v;
label:
v = lengthof v;
v = v - 1;
if v != v goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getStart()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D toSubSpace(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D: double getX()>();
v = v / 2.0;
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double abs(double)>(v);
v = staticinvoke <oadd.org.apache.commons.math.util.FastMath: double max(double,double)>(1.0, v);
v = v + v;
v = v;
v = v + 1;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Line getLine()>();
v = new oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.oned.Vector1D: void <init>(double)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Line: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D toSpace(oadd.org.apache.commons.math.geometry.Vector)>(v);
v[v] = v;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices>;
v = v;
v = v + 1;
v[v] = v;
goto label;
label:
v = interfaceinvoke v.<java.util.List: int size()>();
v = newarray (oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D)[v];
v = 0;
v = interfaceinvoke v.<java.util.List: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = v;
v = v + 1;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Segment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getStart()>();
v[v] = v;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices>;
v = v;
v = v + 1;
v[v] = v;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D[][] vertices>;
v = virtualinvoke v.<java.lang.Object: java.lang.Object clone()>();
return v;
}
private java.util.List followLoop(oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node, oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree)
{
oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D v, v, v, v;
java.util.ArrayList v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v, v;
byte v, v, v;
int v, v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
boolean v, v;
double v, v, v;
oadd.org.apache.commons.math.exception.MathInternalError v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet v;
oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment v, v, v;
java.lang.Comparable v, v, v;
v := @this: oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet;
v := @parameter: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node;
v := @parameter: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable getElement()>();
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getStart()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getEnd()>();
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: void delete()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getStart()>();
if v != null goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v;
label:
if v == null goto label;
if v != 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: double distance(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = v cmpl 1.0E-10;
if v <= 0 goto label;
label:
v = null;
v = null;
v = #Infinity;
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,double,double)>(v, -1.0E-10, -1.0E-10);
v = new oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment;
specialinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: void <init>(oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D,double,double)>(v, 1.0E-10, 1.0E-10);
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getNotSmaller(java.lang.Comparable)>(v);
label:
if v == null goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable getElement()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: int compareTo(oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment)>(v);
if v > 0 goto label;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable getElement()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getStart()>();
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D: double distance(oadd.org.apache.commons.math.geometry.Vector)>(v);
v = v cmpg v;
if v >= 0 goto label;
v = v;
v = v;
v = v;
label:
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getNext()>();
goto label;
label:
v = v cmpl 1.0E-10;
if v <= 0 goto label;
return null;
label:
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.euclidean.twod.PolygonsSet$ComparableSegment: oadd.org.apache.commons.math.geometry.euclidean.twod.Vector2D getEnd()>();
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: void delete()>();
goto label;
label:
v = virtualinvoke v.<java.util.ArrayList: int size()>();
if v != 2 goto label;
if v != 0 goto label;
return null;
label:
if v != null goto label;
if v != 0 goto label;
v = new oadd.org.apache.commons.math.exception.MathInternalError;
specialinvoke v.<oadd.org.apache.commons.math.exception.MathInternalError: void <init>()>();
throw v;
label:
return v;
}
}