public class oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree extends java.lang.Object
{
private oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top;
public void <init>()
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
specialinvoke v.<java.lang.Object: void <init>()>();
v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top> = null;
return;
}
public void insert(java.lang.Comparable)
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
java.lang.Comparable v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v := @parameter: java.lang.Comparable;
if v == null goto label;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
if v != null goto label;
v = new oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node;
specialinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: void <init>(oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree,java.lang.Comparable,oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node)>(v, v, null);
v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top> = v;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: boolean insert(java.lang.Comparable)>(v);
label:
return;
}
public boolean delete(java.lang.Comparable)
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v;
int v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
java.lang.Comparable v, v, v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v := @parameter: java.lang.Comparable;
if v == null goto label;
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 = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable element>;
if v != v goto label;
virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: void delete()>();
return 1;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable element>;
v = interfaceinvoke v.<java.lang.Comparable: int compareTo(java.lang.Object)>(v);
if v <= 0 goto label;
return 0;
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:
return 0;
}
public boolean isEmpty()
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v;
boolean v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
if v != null goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public int size()
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v;
int v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
if v != null goto label;
v = 0;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: int size()>();
label:
return v;
}
public oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getSmallest()
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
if v != null goto label;
v = null;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getSmallest()>();
label:
return v;
}
public oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getLargest()
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v, v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
if v != null goto label;
v = null;
goto label;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
v = virtualinvoke v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getLargest()>();
label:
return v;
}
public oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getNotSmaller(java.lang.Comparable)
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v, v, v;
int v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
java.lang.Comparable v, v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v := @parameter: java.lang.Comparable;
v = null;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
label:
if v == null goto label;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable element>;
v = interfaceinvoke v.<java.lang.Comparable: int compareTo(java.lang.Object)>(v);
if v >= 0 goto label;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node right>;
if v != null goto label;
return v;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node right>;
goto label;
label:
v = v;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node left>;
if v != null goto label;
return v;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node left>;
goto label;
label:
return null;
}
public oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node getNotLarger(java.lang.Comparable)
{
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node v, v, v, v;
int v;
oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree v;
java.lang.Comparable v, v;
v := @this: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree;
v := @parameter: java.lang.Comparable;
v = null;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node top>;
label:
if v == null goto label;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: java.lang.Comparable element>;
v = interfaceinvoke v.<java.lang.Comparable: int compareTo(java.lang.Object)>(v);
if v <= 0 goto label;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node left>;
if v != null goto label;
return v;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node left>;
goto label;
label:
v = v;
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node right>;
if v != null goto label;
return v;
label:
v = v.<oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node: oadd.org.apache.commons.math.geometry.partitioning.utilities.AVLTree$Node right>;
goto label;
label:
return null;
}
}