class org.apache.commons.collections.bidimap.TreeBidiMap$Node extends java.lang.Object implements java.util.Map$Entry, org.apache.commons.collections.KeyValue
{
private final java.lang.Comparable key;
private final java.lang.Comparable value;
private final org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode;
private final org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode;
private final org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode;
private final boolean[] blackColor;
private int hashcodeValue;
private boolean calculatedHashCode;
void <init>(java.lang.Comparable, java.lang.Comparable)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v, v, v;
boolean[] v;
java.lang.Comparable v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: 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.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable key> = v;
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable value> = v;
v = newarray (org.apache.commons.collections.bidimap.TreeBidiMap$Node)[2];
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode> = v;
v = newarray (org.apache.commons.collections.bidimap.TreeBidiMap$Node)[2];
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode> = v;
v = newarray (org.apache.commons.collections.bidimap.TreeBidiMap$Node)[2];
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode> = v;
v = newarray (boolean)[2];
v[0] = 1;
v[1] = 1;
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor> = v;
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean calculatedHashCode> = 0;
return;
}
private java.lang.Object getData(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
java.lang.IllegalArgumentException v;
int[] v;
int v, v;
java.lang.Comparable v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = <org.apache.commons.collections.bidimap.TreeBidiMap$1: int[] $SwitchMap$org$apache$commons$collections4$bidimap$TreeBidiMap$DataElement>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
lookupswitch(v)
{
case 1: goto label;
case 2: goto label;
default: goto label;
};
label:
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable getKey()>();
return v;
label:
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable getValue()>();
return v;
label:
v = new java.lang.IllegalArgumentException;
specialinvoke v.<java.lang.IllegalArgumentException: void <init>()>();
throw v;
}
private void setLeft(org.apache.commons.collections.bidimap.TreeBidiMap$Node, org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v[v] = v;
return;
}
private org.apache.commons.collections.bidimap.TreeBidiMap$Node getLeft(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
return v;
}
private void setRight(org.apache.commons.collections.bidimap.TreeBidiMap$Node, org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v[v] = v;
return;
}
private org.apache.commons.collections.bidimap.TreeBidiMap$Node getRight(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
return v;
}
private void setParent(org.apache.commons.collections.bidimap.TreeBidiMap$Node, org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v[v] = v;
return;
}
private org.apache.commons.collections.bidimap.TreeBidiMap$Node getParent(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
return v;
}
private void swapColors(org.apache.commons.collections.bidimap.TreeBidiMap$Node, org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v, v, v, v, v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
boolean v, v, v, v, v, v, v, v, v;
boolean[] v, v, v, v, v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v ^ v;
v[v] = v;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v ^ v;
v[v] = v;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v ^ v;
v[v] = v;
return;
}
private boolean isBlack(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
boolean[] v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
return v;
}
private boolean isRed(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
boolean[] v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean v, v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
private void setBlack(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
boolean[] v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v[v] = 1;
return;
}
private void setRed(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
boolean[] v;
int v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v[v] = 0;
return;
}
private void copyColor(org.apache.commons.collections.bidimap.TreeBidiMap$Node, org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
boolean[] v, v;
int v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v;
boolean v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean[] blackColor>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v[v] = v;
return;
}
private boolean isLeftChild(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v, v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v, v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v, v, v;
boolean v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
if v == null goto label;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] leftNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
if v != v goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
private boolean isRightChild(org.apache.commons.collections.bidimap.TreeBidiMap$DataElement)
{
org.apache.commons.collections.bidimap.TreeBidiMap$Node[] v, v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$DataElement v;
int v, v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v, v, v, v;
boolean v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: org.apache.commons.collections.bidimap.TreeBidiMap$DataElement;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
if v == null goto label;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] parentNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: org.apache.commons.collections.bidimap.TreeBidiMap$Node[] rightNode>;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$DataElement: int ordinal()>();
v = v[v];
if v != v goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public java.lang.Comparable getKey()
{
java.lang.Comparable v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable key>;
return v;
}
public java.lang.Comparable getValue()
{
java.lang.Comparable v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable value>;
return v;
}
public java.lang.Comparable setValue(java.lang.Comparable) throws java.lang.UnsupportedOperationException
{
java.lang.UnsupportedOperationException v;
java.lang.Comparable v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v := @parameter: java.lang.Comparable;
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)
{
java.lang.Comparable v, v;
java.lang.Object v, v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean v, v, v, v;
v := @this: 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 = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable getKey()>();
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 = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable getValue()>();
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()
{
int v, v, v, v;
java.lang.Comparable v, v;
org.apache.commons.collections.bidimap.TreeBidiMap$Node v;
boolean v;
v := @this: org.apache.commons.collections.bidimap.TreeBidiMap$Node;
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean calculatedHashCode>;
if v != 0 goto label;
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable getKey()>();
v = virtualinvoke v.<java.lang.Object: int hashCode()>();
v = virtualinvoke v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: java.lang.Comparable getValue()>();
v = virtualinvoke v.<java.lang.Object: int hashCode()>();
v = v ^ v;
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: int hashcodeValue> = v;
v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: boolean calculatedHashCode> = 1;
label:
v = v.<org.apache.commons.collections.bidimap.TreeBidiMap$Node: int hashcodeValue>;
return v;
}
}