public abstract class org.apache.commons.math.geometry.partitioning.AbstractRegion extends java.lang.Object implements org.apache.commons.math.geometry.partitioning.Region
{
private org.apache.commons.math.geometry.partitioning.BSPTree tree;
private double size;
private org.apache.commons.math.geometry.Vector barycenter;
protected void <init>()
{
org.apache.commons.math.geometry.partitioning.BSPTree v;
java.lang.Boolean v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
specialinvoke v.<java.lang.Object: void <init>()>();
v = new org.apache.commons.math.geometry.partitioning.BSPTree;
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void <init>(java.lang.Object)>(v);
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree> = v;
return;
}
protected void <init>(org.apache.commons.math.geometry.partitioning.BSPTree)
{
org.apache.commons.math.geometry.partitioning.BSPTree v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
specialinvoke v.<java.lang.Object: void <init>()>();
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree> = v;
return;
}
protected void <init>(java.util.Collection)
{
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
java.util.Collection v;
java.util.TreeSet v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v;
int v;
java.lang.Boolean v;
org.apache.commons.math.geometry.partitioning.AbstractRegion$2 v;
org.apache.commons.math.geometry.partitioning.AbstractRegion$1 v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: java.util.Collection;
specialinvoke v.<java.lang.Object: void <init>()>();
v = interfaceinvoke v.<java.util.Collection: int size()>();
if v != 0 goto label;
v = new org.apache.commons.math.geometry.partitioning.BSPTree;
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void <init>(java.lang.Object)>(v);
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree> = v;
goto label;
label:
v = new java.util.TreeSet;
v = new org.apache.commons.math.geometry.partitioning.AbstractRegion$1;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$1: void <init>(org.apache.commons.math.geometry.partitioning.AbstractRegion)>(v);
specialinvoke v.<java.util.TreeSet: void <init>(java.util.Comparator)>(v);
virtualinvoke v.<java.util.TreeSet: boolean addAll(java.util.Collection)>(v);
v = new org.apache.commons.math.geometry.partitioning.BSPTree;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void <init>()>();
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree> = v;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void insertCuts(org.apache.commons.math.geometry.partitioning.BSPTree,java.util.Collection)>(v, v);
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = new org.apache.commons.math.geometry.partitioning.AbstractRegion$2;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$2: void <init>(org.apache.commons.math.geometry.partitioning.AbstractRegion)>(v);
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void visit(org.apache.commons.math.geometry.partitioning.BSPTreeVisitor)>(v);
label:
return;
}
public void <init>(org.apache.commons.math.geometry.partitioning.Hyperplane[])
{
org.apache.commons.math.geometry.partitioning.Hyperplane v, v;
int v, v, v;
java.lang.Boolean v, v, v, v;
boolean v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.Region v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v;
org.apache.commons.math.geometry.partitioning.Hyperplane[] v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.Hyperplane[];
specialinvoke v.<java.lang.Object: void <init>()>();
if v == null goto label;
v = lengthof v;
if v != 0 goto label;
label:
v = new org.apache.commons.math.geometry.partitioning.BSPTree;
v = <java.lang.Boolean: java.lang.Boolean FALSE>;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void <init>(java.lang.Object)>(v);
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree> = v;
goto label;
label:
v = v[0];
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.Hyperplane: org.apache.commons.math.geometry.partitioning.Region wholeSpace()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.Region: org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)>(0);
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree> = v;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: boolean insertCut(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
if v == 0 goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(null);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = <java.lang.Boolean: java.lang.Boolean FALSE>;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void setAttribute(java.lang.Object)>(v);
label:
v = v + 1;
goto label;
label:
return;
}
public abstract org.apache.commons.math.geometry.partitioning.AbstractRegion buildNew(org.apache.commons.math.geometry.partitioning.BSPTree);
private void insertCuts(org.apache.commons.math.geometry.partitioning.BSPTree, java.util.Collection)
{
org.apache.commons.math.geometry.partitioning.Side v;
org.apache.commons.math.geometry.partitioning.Hyperplane v, v;
java.util.ArrayList v, v;
int[] v;
org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane v;
int v, v;
boolean v, v, v, v;
java.util.Iterator v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
java.util.Collection v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v, v;
java.lang.Object v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
v := @parameter: java.util.Collection;
v = interfaceinvoke v.<java.util.Collection: java.util.Iterator iterator()>();
v = null;
label:
if v != null goto 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.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.Hyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane copySelf()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: boolean insertCut(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
if v != 0 goto label;
v = null;
goto label;
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v != 0 goto 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>()>();
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 = <org.apache.commons.math.geometry.partitioning.AbstractRegion$3: int[] $SwitchMap$org$apache$commons$math3$geometry$partitioning$Side>;
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Side side(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.Side: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
default: goto label;
};
label:
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
goto label;
label:
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
goto label;
label:
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane split(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlus()>();
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane getMinus()>();
virtualinvoke v.<java.util.ArrayList: boolean add(java.lang.Object)>(v);
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void insertCuts(org.apache.commons.math.geometry.partitioning.BSPTree,java.util.Collection)>(v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void insertCuts(org.apache.commons.math.geometry.partitioning.BSPTree,java.util.Collection)>(v, v);
return;
}
public org.apache.commons.math.geometry.partitioning.AbstractRegion copySelf()
{
org.apache.commons.math.geometry.partitioning.BSPTree v, v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree copySelf()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.AbstractRegion buildNew(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
return v;
}
public boolean isEmpty()
{
org.apache.commons.math.geometry.partitioning.BSPTree v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
boolean v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
return v;
}
public boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)
{
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v;
java.lang.Object v;
boolean v, v, v, v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public boolean contains(org.apache.commons.math.geometry.partitioning.Region)
{
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.RegionFactory v;
org.apache.commons.math.geometry.partitioning.Region v, v;
boolean v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.Region;
v = new org.apache.commons.math.geometry.partitioning.RegionFactory;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.RegionFactory: void <init>()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.RegionFactory: org.apache.commons.math.geometry.partitioning.Region difference(org.apache.commons.math.geometry.partitioning.Region,org.apache.commons.math.geometry.partitioning.Region)>(v, v);
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.Region: boolean isEmpty()>();
return v;
}
public org.apache.commons.math.geometry.partitioning.Region$Location checkPoint(org.apache.commons.math.geometry.Vector)
{
org.apache.commons.math.geometry.Vector v;
org.apache.commons.math.geometry.partitioning.BSPTree v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.Region$Location v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.Vector;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.Region$Location checkPoint(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.Vector)>(v, v);
return v;
}
protected org.apache.commons.math.geometry.partitioning.Region$Location checkPoint(org.apache.commons.math.geometry.partitioning.BSPTree, org.apache.commons.math.geometry.Vector)
{
org.apache.commons.math.geometry.Vector v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.Region$Location v, v, v, v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v;
java.lang.Object v;
boolean v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
v := @parameter: org.apache.commons.math.geometry.Vector;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getCell(org.apache.commons.math.geometry.Vector)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
v = <org.apache.commons.math.geometry.partitioning.Region$Location: org.apache.commons.math.geometry.partitioning.Region$Location INSIDE>;
goto label;
label:
v = <org.apache.commons.math.geometry.partitioning.Region$Location: org.apache.commons.math.geometry.partitioning.Region$Location OUTSIDE>;
label:
return v;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.Region$Location checkPoint(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.Vector)>(v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.Region$Location checkPoint(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.Vector)>(v, v);
if v != v goto label;
v = v;
goto label;
label:
v = <org.apache.commons.math.geometry.partitioning.Region$Location: org.apache.commons.math.geometry.partitioning.Region$Location BOUNDARY>;
label:
return v;
}
public org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)
{
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v;
org.apache.commons.math.geometry.partitioning.AbstractRegion$BoundaryBuilder v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v;
java.lang.Object v;
boolean v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: boolean;
if v == 0 goto label;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v == null goto label;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
if v != null goto label;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = new org.apache.commons.math.geometry.partitioning.AbstractRegion$BoundaryBuilder;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$BoundaryBuilder: void <init>()>();
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void visit(org.apache.commons.math.geometry.partitioning.BSPTreeVisitor)>(v);
label:
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
return v;
}
public double getBoundarySize()
{
org.apache.commons.math.geometry.partitioning.BSPTree v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
double v;
org.apache.commons.math.geometry.partitioning.BoundarySizeVisitor v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v = new org.apache.commons.math.geometry.partitioning.BoundarySizeVisitor;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BoundarySizeVisitor: void <init>()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)>(1);
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void visit(org.apache.commons.math.geometry.partitioning.BSPTreeVisitor)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BoundarySizeVisitor: double getSize()>();
return v;
}
public double getSize()
{
org.apache.commons.math.geometry.Vector v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
double v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.Vector barycenter>;
if v != null goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void computeGeometricalProperties()>();
label:
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: double size>;
return v;
}
protected void setSize(double)
{
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
double v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: double;
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: double size> = v;
return;
}
public org.apache.commons.math.geometry.Vector getBarycenter()
{
org.apache.commons.math.geometry.Vector v, v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.Vector barycenter>;
if v != null goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void computeGeometricalProperties()>();
label:
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.Vector barycenter>;
return v;
}
protected void setBarycenter(org.apache.commons.math.geometry.Vector)
{
org.apache.commons.math.geometry.Vector v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.Vector;
v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.Vector barycenter> = v;
return;
}
protected abstract void computeGeometricalProperties();
public org.apache.commons.math.geometry.partitioning.Side side(org.apache.commons.math.geometry.partitioning.Hyperplane)
{
org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides v;
org.apache.commons.math.geometry.partitioning.Side v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.Hyperplane v;
org.apache.commons.math.geometry.partitioning.BSPTree v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v;
boolean v, v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.Hyperplane;
v = new org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void <init>()>();
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.Hyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane wholeHyperplane()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void recurseSides(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides)>(v, v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean plusFound()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean minusFound()>();
if v == 0 goto label;
v = <org.apache.commons.math.geometry.partitioning.Side: org.apache.commons.math.geometry.partitioning.Side BOTH>;
goto label;
label:
v = <org.apache.commons.math.geometry.partitioning.Side: org.apache.commons.math.geometry.partitioning.Side PLUS>;
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean minusFound()>();
if v == 0 goto label;
v = <org.apache.commons.math.geometry.partitioning.Side: org.apache.commons.math.geometry.partitioning.Side MINUS>;
goto label;
label:
v = <org.apache.commons.math.geometry.partitioning.Side: org.apache.commons.math.geometry.partitioning.Side HYPER>;
label:
return v;
}
private void recurseSides(org.apache.commons.math.geometry.partitioning.BSPTree, org.apache.commons.math.geometry.partitioning.SubHyperplane, org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides)
{
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.geometry.partitioning.Side v, v, v, v, v;
org.apache.commons.math.geometry.partitioning.Hyperplane v, v, v, v, v;
org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v, v, v, v, v, v, v, v, v, v, v, v;
int[] v;
boolean v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane v;
int v, v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
java.lang.Object v, v, v, v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
v := @parameter: org.apache.commons.math.geometry.partitioning.SubHyperplane;
v := @parameter: org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<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.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberPlusFound()>();
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberMinusFound()>();
label:
return;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = <org.apache.commons.math.geometry.partitioning.AbstractRegion$3: int[] $SwitchMap$org$apache$commons$math3$geometry$partitioning$Side>;
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Side side(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.Side: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
default: goto label;
};
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Side side(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = <org.apache.commons.math.geometry.partitioning.Side: org.apache.commons.math.geometry.partitioning.Side PLUS>;
if v != v goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberPlusFound()>();
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberMinusFound()>();
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean plusFound()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean minusFound()>();
if v != 0 goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void recurseSides(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides)>(v, v, v);
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Side side(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = <org.apache.commons.math.geometry.partitioning.Side: org.apache.commons.math.geometry.partitioning.Side PLUS>;
if v != v goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberPlusFound()>();
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: boolean isEmpty(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberMinusFound()>();
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean plusFound()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean minusFound()>();
if v != 0 goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void recurseSides(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides)>(v, v, v);
goto label;
label:
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane split(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlus()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void recurseSides(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides)>(v, v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean plusFound()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: boolean minusFound()>();
if v != 0 goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane getMinus()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: void recurseSides(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides)>(v, v, v);
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.Hyperplane: boolean sameOrientationAs(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
label:
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberPlusFound()>();
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
label:
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberMinusFound()>();
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
label:
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberMinusFound()>();
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
label:
virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion$Sides: void rememberPlusFound()>();
label:
return;
}
public org.apache.commons.math.geometry.partitioning.SubHyperplane intersection(org.apache.commons.math.geometry.partitioning.SubHyperplane)
{
org.apache.commons.math.geometry.partitioning.BSPTree v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.SubHyperplane;
v = v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree tree>;
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
return v;
}
private org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree, org.apache.commons.math.geometry.partitioning.SubHyperplane)
{
org.apache.commons.math.geometry.partitioning.Side v;
org.apache.commons.math.geometry.partitioning.Hyperplane v;
int[] v;
org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane v;
int v, v;
boolean v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v, v, v, v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v, v, v, v, v, v, v, v, v, v, v, v, v;
java.lang.Object v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
v := @parameter: org.apache.commons.math.geometry.partitioning.SubHyperplane;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane copySelf()>();
goto label;
label:
v = null;
label:
return v;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Hyperplane getHyperplane()>();
v = <org.apache.commons.math.geometry.partitioning.AbstractRegion$3: int[] $SwitchMap$org$apache$commons$math3$geometry$partitioning$Side>;
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.Side side(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.Side: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
default: goto label;
};
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
return v;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
return v;
label:
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane split(org.apache.commons.math.geometry.partitioning.Hyperplane)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane$SplitSubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane getMinus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
if v != null goto label;
return v;
label:
if v != null goto label;
return v;
label:
v = interfaceinvoke v.<org.apache.commons.math.geometry.partitioning.SubHyperplane: org.apache.commons.math.geometry.partitioning.SubHyperplane reunite(org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v);
return v;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.SubHyperplane recurseIntersection(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
return v;
}
public org.apache.commons.math.geometry.partitioning.AbstractRegion applyTransform(org.apache.commons.math.geometry.partitioning.Transform)
{
org.apache.commons.math.geometry.partitioning.BSPTree v, v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v, v;
org.apache.commons.math.geometry.partitioning.Transform v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.Transform;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree getTree(boolean)>(0);
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree recurseTransform(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.Transform)>(v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.AbstractRegion buildNew(org.apache.commons.math.geometry.partitioning.BSPTree)>(v);
return v;
}
private org.apache.commons.math.geometry.partitioning.BSPTree recurseTransform(org.apache.commons.math.geometry.partitioning.BSPTree, org.apache.commons.math.geometry.partitioning.Transform)
{
org.apache.commons.math.geometry.partitioning.BoundaryAttribute v;
org.apache.commons.math.geometry.partitioning.AbstractRegion v;
org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane v, v, v, v;
org.apache.commons.math.geometry.partitioning.Transform v;
org.apache.commons.math.geometry.partitioning.BSPTree v, v, v, v, v, v, v;
org.apache.commons.math.geometry.partitioning.SubHyperplane v, v, v, v, v, v;
java.lang.Object v, v;
v := @this: org.apache.commons.math.geometry.partitioning.AbstractRegion;
v := @parameter: org.apache.commons.math.geometry.partitioning.BSPTree;
v := @parameter: org.apache.commons.math.geometry.partitioning.Transform;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
if v != null goto label;
v = new org.apache.commons.math.geometry.partitioning.BSPTree;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void <init>(java.lang.Object)>(v);
return v;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.SubHyperplane getCut()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane: org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane applyTransform(org.apache.commons.math.geometry.partitioning.Transform)>(v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: java.lang.Object getAttribute()>();
if v == null goto label;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BoundaryAttribute: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlusOutside()>();
if v != null goto label;
v = null;
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BoundaryAttribute: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlusOutside()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane: org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane applyTransform(org.apache.commons.math.geometry.partitioning.Transform)>(v);
label:
v = v;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BoundaryAttribute: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlusInside()>();
if v != null goto label;
v = null;
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BoundaryAttribute: org.apache.commons.math.geometry.partitioning.SubHyperplane getPlusInside()>();
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane: org.apache.commons.math.geometry.partitioning.AbstractSubHyperplane applyTransform(org.apache.commons.math.geometry.partitioning.Transform)>(v);
label:
v = new org.apache.commons.math.geometry.partitioning.BoundaryAttribute;
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BoundaryAttribute: void <init>(org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.SubHyperplane)>(v, v);
v = v;
label:
v = new org.apache.commons.math.geometry.partitioning.BSPTree;
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getPlus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree recurseTransform(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.Transform)>(v, v);
v = virtualinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: org.apache.commons.math.geometry.partitioning.BSPTree getMinus()>();
v = specialinvoke v.<org.apache.commons.math.geometry.partitioning.AbstractRegion: org.apache.commons.math.geometry.partitioning.BSPTree recurseTransform(org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.Transform)>(v, v);
specialinvoke v.<org.apache.commons.math.geometry.partitioning.BSPTree: void <init>(org.apache.commons.math.geometry.partitioning.SubHyperplane,org.apache.commons.math.geometry.partitioning.BSPTree,org.apache.commons.math.geometry.partitioning.BSPTree,java.lang.Object)>(v, v, v, v);
return v;
}
}