class oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node extends java.lang.Object implements java.util.Map$Entry, oadd.org.apache.commons.collections.KeyValue
{
private java.lang.Comparable[] data;
private oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode;
private oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode;
private oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode;
private boolean[] blackColor;
private int hashcodeValue;
private boolean calculatedHashCode;
void <init>(java.lang.Comparable, java.lang.Comparable)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean[] v;
java.lang.Comparable[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v, v, v;
java.lang.Comparable v, v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: java.lang.Comparable;
v := @parameter: java.lang.Comparable;
specialinvoke v.<java.lang.Object: void <init>()>();
v = newarray (java.lang.Comparable)[2];
v[0] = v;
v[1] = v;
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data> = v;
v = newarray (oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node)[2];
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode> = v;
v = newarray (oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node)[2];
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode> = v;
v = newarray (oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node)[2];
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode> = v;
v = newarray (boolean)[2];
v[0] = 1;
v[1] = 1;
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor> = v;
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean calculatedHashCode> = 0;
return;
}
private java.lang.Comparable getData(int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
int v;
java.lang.Comparable v;
java.lang.Comparable[] v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[v];
return v;
}
private void setLeft(oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node, int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
int v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode>;
v[v] = v;
return;
}
private oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node getLeft(int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
int v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode>;
v = v[v];
return v;
}
private void setRight(oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node, int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
int v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode>;
v[v] = v;
return;
}
private oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node getRight(int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
int v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode>;
v = v[v];
return v;
}
private void setParent(oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node, int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
int v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v[v] = v;
return;
}
private oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node getParent(int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
int v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = v[v];
return v;
}
private void swapColors(oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node, int)
{
int v;
boolean v, v, v, v, v, v, v, v, v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
boolean[] v, v, v, v, v, v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v = v ^ v;
v[v] = v;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v = v ^ v;
v[v] = v;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v = v ^ v;
v[v] = v;
return;
}
private boolean isBlack(int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean[] v;
int v;
boolean v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
return v;
}
private boolean isRed(int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean[] v;
int v;
boolean v, v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
private void setBlack(int)
{
boolean[] v;
int v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v[v] = 1;
return;
}
private void setRed(int)
{
boolean[] v;
int v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v[v] = 0;
return;
}
private void copyColor(oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node, int)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
boolean[] v, v;
int v;
boolean v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: int;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = v[v];
v[v] = v;
return;
}
public java.lang.Object getKey()
{
java.lang.Comparable v;
java.lang.Comparable[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[0];
return v;
}
public java.lang.Object getValue()
{
java.lang.Comparable v;
java.lang.Comparable[] v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[1];
return v;
}
public java.lang.Object setValue(java.lang.Object) throws java.lang.UnsupportedOperationException
{
java.lang.UnsupportedOperationException v;
java.lang.Object v;
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: java.lang.Object;
v = new java.lang.UnsupportedOperationException;
specialinvoke v.<java.lang.UnsupportedOperationException: void <init>(java.lang.String)>("Map.Entry.setValue is not supported");
throw v;
}
public boolean equals(java.lang.Object)
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
java.lang.Comparable[] v, v;
java.lang.Comparable v, v;
java.lang.Object v, v, v;
boolean v, v, v, v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: java.lang.Object;
if v != v goto label;
return 1;
label:
v = v instanceof java.util.Map$Entry;
if v != 0 goto label;
return 0;
label:
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[0];
v = interfaceinvoke v.<java.util.Map$Entry: java.lang.Object getKey()>();
v = virtualinvoke v.<java.lang.Object: boolean equals(java.lang.Object)>(v);
if v == 0 goto label;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[1];
v = interfaceinvoke v.<java.util.Map$Entry: java.lang.Object getValue()>();
v = virtualinvoke v.<java.lang.Object: boolean equals(java.lang.Object)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public int hashCode()
{
oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
java.lang.Comparable[] v, v;
int v, v, v, v;
java.lang.Comparable v, v;
boolean v;
v := @this: oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean calculatedHashCode>;
if v != 0 goto label;
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[0];
v = virtualinvoke v.<java.lang.Object: int hashCode()>();
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable[] data>;
v = v[1];
v = virtualinvoke v.<java.lang.Object: int hashCode()>();
v = v ^ v;
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: int hashcodeValue> = v;
v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean calculatedHashCode> = 1;
label:
v = v.<oadd.org.apache.commons.collections.bidimap.TreeBidiMap$Node: int hashcodeValue>;
return v;
}
}