public class oadd.com.carrotsearch.hppc.IntArrayDeque extends oadd.com.carrotsearch.hppc.AbstractIntCollection implements oadd.com.carrotsearch.hppc.IntDeque, oadd.com.carrotsearch.hppc.Preallocable, java.lang.Cloneable
{
public int[] buffer;
public int head;
public int tail;
protected final oadd.com.carrotsearch.hppc.ArraySizingStrategy resizer;
static final boolean $assertionsDisabled;
public void <init>()
{
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void <init>(int)>(4);
return;
}
public void <init>(int)
{
int v;
oadd.com.carrotsearch.hppc.BoundedProportionalArraySizingStrategy v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = new oadd.com.carrotsearch.hppc.BoundedProportionalArraySizingStrategy;
specialinvoke v.<oadd.com.carrotsearch.hppc.BoundedProportionalArraySizingStrategy: void <init>()>();
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void <init>(int,oadd.com.carrotsearch.hppc.ArraySizingStrategy)>(v, v);
return;
}
public void <init>(int, oadd.com.carrotsearch.hppc.ArraySizingStrategy)
{
int[] v;
int v;
oadd.com.carrotsearch.hppc.ArraySizingStrategy v;
java.lang.AssertionError v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v := @parameter: oadd.com.carrotsearch.hppc.ArraySizingStrategy;
specialinvoke v.<oadd.com.carrotsearch.hppc.AbstractIntCollection: void <init>()>();
v = <oadd.com.carrotsearch.hppc.IntArrayList: int[] EMPTY_ARRAY>;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer> = v;
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
if v != null goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: oadd.com.carrotsearch.hppc.ArraySizingStrategy resizer> = v;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureCapacity(int)>(v);
return;
}
public void <init>(oadd.com.carrotsearch.hppc.IntContainer)
{
int v;
oadd.com.carrotsearch.hppc.IntContainer v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.IntContainer;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.IntContainer: int size()>();
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void <init>(int)>(v);
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int addLast(oadd.com.carrotsearch.hppc.IntContainer)>(v);
return;
}
public void addFirst(int)
{
int[] v, v, v;
int v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v != v goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(1);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head> = v;
v[v] = v;
return;
}
public final transient void addFirst(int[])
{
int[] v;
int v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int[];
v = lengthof v;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(v);
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addFirst(int)>(v);
v = v + 1;
goto label;
label:
return;
}
public int addFirst(oadd.com.carrotsearch.hppc.IntContainer)
{
java.util.Iterator v;
int v, v;
oadd.com.carrotsearch.hppc.IntContainer v;
java.lang.Object v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.IntContainer;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.IntContainer: int size()>();
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(v);
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.IntContainer: 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.<oadd.com.carrotsearch.hppc.cursors.IntCursor: int value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addFirst(int)>(v);
goto label;
label:
return v;
}
public int addFirst(java.lang.Iterable)
{
java.util.Iterator v;
int v, v;
java.lang.Object v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
java.lang.Iterable v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: java.lang.Iterable;
v = 0;
v = interfaceinvoke v.<java.lang.Iterable: 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.<oadd.com.carrotsearch.hppc.cursors.IntCursor: int value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addFirst(int)>(v);
v = v + 1;
goto label;
label:
return v;
}
public void addLast(int)
{
int[] v, v, v;
int v, v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
if v != v goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(1);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v[v] = v;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
return;
}
public final transient void addLast(int[])
{
int[] v;
int v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int[];
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(1);
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addLast(int)>(v);
v = v + 1;
goto label;
label:
return;
}
public int addLast(oadd.com.carrotsearch.hppc.IntContainer)
{
java.util.Iterator v;
int v, v;
oadd.com.carrotsearch.hppc.IntContainer v;
java.lang.Object v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.IntContainer;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.IntContainer: int size()>();
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(v);
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.IntContainer: 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.<oadd.com.carrotsearch.hppc.cursors.IntCursor: int value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addLast(int)>(v);
goto label;
label:
return v;
}
public int addLast(java.lang.Iterable)
{
java.util.Iterator v;
int v, v;
java.lang.Object v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
java.lang.Iterable v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: java.lang.Iterable;
v = 0;
v = interfaceinvoke v.<java.lang.Iterable: 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.<oadd.com.carrotsearch.hppc.cursors.IntCursor: int value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addLast(int)>(v);
v = v + 1;
goto label;
label:
return v;
}
public int removeFirst()
{
java.lang.AssertionError v;
int[] v, v, v;
int v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v > 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The deque is empty.");
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v[v];
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v[v] = 0;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head> = v;
return v;
}
public int removeLast()
{
java.lang.AssertionError v;
int[] v, v, v;
int v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v > 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The deque is empty.");
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v[v];
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v[v] = 0;
return v;
}
public int getFirst()
{
int[] v;
int v, v, v;
java.lang.AssertionError v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v > 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The deque is empty.");
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v[v];
return v;
}
public int getLast()
{
java.lang.AssertionError v;
int[] v, v;
int v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v > 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The deque is empty.");
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v = v[v];
return v;
}
public int removeFirst(int)
{
int v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int bufferIndexOf(int)>(v);
if v < 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void removeAtBufferIndex(int)>(v);
label:
return v;
}
public int bufferIndexOf(int)
{
int[] v, v;
int v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
label:
if v == v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v[v];
if v != v goto label;
return v;
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
v = (int) -1;
return v;
}
public int removeLast(int)
{
int v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int lastBufferIndexOf(int)>(v);
if v < 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void removeAtBufferIndex(int)>(v);
label:
return v;
}
public int lastBufferIndexOf(int)
{
int[] v, v;
int v, v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
label:
if v == v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v[v];
if v != v goto label;
return v;
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
goto label;
label:
v = (int) -1;
return v;
}
public int removeAll(int)
{
int[] v, v, v, v, v, v;
int v, v, v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = 0;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v;
v = v;
label:
if v == v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v[v];
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v[v] = 0;
v = v + 1;
goto label;
label:
if v == v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v[v];
v[v] = v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v[v] = 0;
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
return v;
}
public void removeAtBufferIndex(int)
{
int[] v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
java.lang.AssertionError v;
int 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;
java.lang.String v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v > v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
if v < v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v >= v goto label;
goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
if v >= v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v < v goto label;
label:
v = new java.lang.AssertionError;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = dynamicinvoke "makeConcatWithConstants" <java.lang.String (int,int,int)>(v, v, v) <java.lang.invoke.StringConcatFactory: java.lang.invoke.CallSite makeConcatWithConstants(java.lang.invoke.MethodHandles$Lookup,java.lang.String,java.lang.invoke.MethodType,java.lang.String,java.lang.Object[])>("Index out of range (head=\u, tail=\u, index=\u).");
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>(v);
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = v - 1;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v - v;
v = staticinvoke <java.lang.Math: int abs(int)>(v);
v = v % v;
v = v - v;
v = staticinvoke <java.lang.Math: int abs(int)>(v);
v = v % v;
if v >= v goto label;
if v < v goto label;
v = v + 1;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, v, v, v, v);
goto label;
label:
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 1, v);
v = v[v];
v[0] = v;
v = v + 1;
v = v - v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, v, v, v, v);
label:
v[v] = 0;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head> = v;
goto label;
label:
if v >= v goto label;
v = v + 1;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, v, v, v, v);
goto label;
label:
v = v + 1;
v = v - v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, v, v, v, v);
v = v[0];
v[v] = v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 1, v, 0, v);
label:
v[v] = 0;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
label:
return;
}
public boolean isEmpty()
{
int v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public int size()
{
int[] v;
int v, v, v, v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v > v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v - v;
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v - v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = v + v;
return v;
}
public void clear()
{
int[] v, v, v, v;
int v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v >= v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
staticinvoke <java.util.Arrays: void fill(int[],int,int,int)>(v, v, v, 0);
goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
staticinvoke <java.util.Arrays: void fill(int[],int,int,int)>(v, 0, v, 0);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
staticinvoke <java.util.Arrays: void fill(int[],int,int,int)>(v, v, v, 0);
label:
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = 0;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head> = 0;
return;
}
public void release()
{
oadd.com.carrotsearch.hppc.IntArrayDeque v;
int[] v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = 0;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head> = 0;
v = <oadd.com.carrotsearch.hppc.IntArrayList: int[] EMPTY_ARRAY>;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer> = v;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(0);
return;
}
public void ensureCapacity(int)
{
int v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
v = v - v;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void ensureBufferSpace(int)>(v);
return;
}
protected void ensureBufferSpace(int)
{
java.lang.Object[] v;
oadd.com.carrotsearch.hppc.ArraySizingStrategy v;
java.lang.AssertionError v;
java.lang.Integer v, v;
int[] v, v;
int v, v, v, v, v, v, v, v, v;
java.lang.String v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
oadd.com.carrotsearch.hppc.BufferAllocationException v;
java.lang.OutOfMemoryError v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
v = v + v;
if v < v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: oadd.com.carrotsearch.hppc.ArraySizingStrategy resizer>;
v = v + 1;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ArraySizingStrategy: int grow(int,int,int)>(v, v, v);
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v + v;
v = v + 1;
if v >= v goto label;
v = new java.lang.AssertionError;
v = v + v;
v = dynamicinvoke "makeConcatWithConstants" <java.lang.String (int,int)>(v, v) <java.lang.invoke.StringConcatFactory: java.lang.invoke.CallSite makeConcatWithConstants(java.lang.invoke.MethodHandles$Lookup,java.lang.String,java.lang.invoke.MethodType,java.lang.String,java.lang.Object[])>("Resizer failed to return sensible new size: \u <= \u0001");
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>(v);
throw v;
label:
v = newarray (int)[v];
if v <= 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] toArray(int[])>(v);
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head> = 0;
label:
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer> = v;
label:
goto label;
label:
v := @caughtexception;
v = new oadd.com.carrotsearch.hppc.BufferAllocationException;
v = newarray (java.lang.Object)[2];
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
v[0] = v;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
v[1] = v;
specialinvoke v.<oadd.com.carrotsearch.hppc.BufferAllocationException: void <init>(java.lang.String,java.lang.Throwable,java.lang.Object[])>("Not enough memory to allocate new buffers: %,d -> %,d", v, v);
throw v;
label:
return;
catch java.lang.OutOfMemoryError from label to label with label;
}
public int[] toArray()
{
int[] v, v;
int v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
v = newarray (int)[v];
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] toArray(int[])>(v);
return v;
}
public int[] toArray(int[])
{
java.lang.AssertionError v;
int[] v, v, v, v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v;
java.lang.String v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int[];
v = <oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled>;
if v != 0 goto label;
v = lengthof v;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v >= v goto label;
v = new java.lang.AssertionError;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
v = dynamicinvoke "makeConcatWithConstants" <java.lang.String (int)>(v) <java.lang.invoke.StringConcatFactory: java.lang.invoke.CallSite makeConcatWithConstants(java.lang.invoke.MethodHandles$Lookup,java.lang.String,java.lang.invoke.MethodType,java.lang.String,java.lang.Object[])>("Target array must be >= \u0001");
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>(v);
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v >= v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, v, v, 0, v);
goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
if v <= v goto label;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = lengthof v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v - v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, v, v, 0, v);
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, v, v);
label:
return v;
}
public oadd.com.carrotsearch.hppc.IntArrayDeque clone()
{
int[] v;
java.lang.Object v, v;
java.lang.RuntimeException v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
java.lang.CloneNotSupportedException v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
label:
v = specialinvoke v.<java.lang.Object: java.lang.Object clone()>();
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = virtualinvoke v.<java.lang.Object: java.lang.Object clone()>();
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer> = v;
label:
return v;
label:
v := @caughtexception;
v = new java.lang.RuntimeException;
specialinvoke v.<java.lang.RuntimeException: void <init>(java.lang.Throwable)>(v);
throw v;
catch java.lang.CloneNotSupportedException from label to label with label;
}
protected static int oneLeft(int, int)
{
int v, v, v, v;
v := @parameter: int;
v := @parameter: int;
if v < 1 goto label;
v = v - 1;
return v;
label:
v = v - 1;
return v;
}
protected static int oneRight(int, int)
{
int v, v, v, v;
v := @parameter: int;
v := @parameter: int;
v = v + 1;
if v != v goto label;
return 0;
label:
v = v + 1;
return v;
}
public java.util.Iterator iterator()
{
oadd.com.carrotsearch.hppc.IntArrayDeque$ValueIterator v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = new oadd.com.carrotsearch.hppc.IntArrayDeque$ValueIterator;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque$ValueIterator: void <init>(oadd.com.carrotsearch.hppc.IntArrayDeque)>(v);
return v;
}
public java.util.Iterator descendingIterator()
{
oadd.com.carrotsearch.hppc.IntArrayDeque$DescendingValueIterator v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = new oadd.com.carrotsearch.hppc.IntArrayDeque$DescendingValueIterator;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque$DescendingValueIterator: void <init>(oadd.com.carrotsearch.hppc.IntArrayDeque)>(v);
return v;
}
public oadd.com.carrotsearch.hppc.procedures.IntProcedure forEach(oadd.com.carrotsearch.hppc.procedures.IntProcedure)
{
int v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
oadd.com.carrotsearch.hppc.procedures.IntProcedure v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.procedures.IntProcedure;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void forEach(oadd.com.carrotsearch.hppc.procedures.IntProcedure,int,int)>(v, v, v);
return v;
}
private void forEach(oadd.com.carrotsearch.hppc.procedures.IntProcedure, int, int)
{
oadd.com.carrotsearch.hppc.procedures.IntProcedure v;
int[] v;
int v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.procedures.IntProcedure;
v := @parameter: int;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v;
label:
if v == v goto label;
v = v[v];
interfaceinvoke v.<oadd.com.carrotsearch.hppc.procedures.IntProcedure: void apply(int)>(v);
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
return;
}
public oadd.com.carrotsearch.hppc.predicates.IntPredicate forEach(oadd.com.carrotsearch.hppc.predicates.IntPredicate)
{
oadd.com.carrotsearch.hppc.predicates.IntPredicate v;
int[] v;
int v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.IntPredicate;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v;
label:
if v == v goto label;
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.IntPredicate: boolean apply(int)>(v);
if v == 0 goto label;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
return v;
}
public oadd.com.carrotsearch.hppc.procedures.IntProcedure descendingForEach(oadd.com.carrotsearch.hppc.procedures.IntProcedure)
{
int v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
oadd.com.carrotsearch.hppc.procedures.IntProcedure v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.procedures.IntProcedure;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void descendingForEach(oadd.com.carrotsearch.hppc.procedures.IntProcedure,int,int)>(v, v, v);
return v;
}
private void descendingForEach(oadd.com.carrotsearch.hppc.procedures.IntProcedure, int, int)
{
oadd.com.carrotsearch.hppc.procedures.IntProcedure v;
int[] v;
int v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.procedures.IntProcedure;
v := @parameter: int;
v := @parameter: int;
if v != v goto label;
return;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v;
label:
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v = v[v];
interfaceinvoke v.<oadd.com.carrotsearch.hppc.procedures.IntProcedure: void apply(int)>(v);
if v != v goto label;
return;
}
public oadd.com.carrotsearch.hppc.predicates.IntPredicate descendingForEach(oadd.com.carrotsearch.hppc.predicates.IntPredicate)
{
oadd.com.carrotsearch.hppc.predicates.IntPredicate v;
int v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.IntPredicate;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void descendingForEach(oadd.com.carrotsearch.hppc.predicates.IntPredicate,int,int)>(v, v, v);
return v;
}
private void descendingForEach(oadd.com.carrotsearch.hppc.predicates.IntPredicate, int, int)
{
oadd.com.carrotsearch.hppc.predicates.IntPredicate v;
int[] v;
int v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.IntPredicate;
v := @parameter: int;
v := @parameter: int;
if v != v goto label;
return;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v;
label:
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneLeft(int,int)>(v, v);
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.IntPredicate: boolean apply(int)>(v);
if v == 0 goto label;
if v != v goto label;
label:
return;
}
public int removeAll(oadd.com.carrotsearch.hppc.predicates.IntPredicate)
{
java.lang.Throwable v;
oadd.com.carrotsearch.hppc.predicates.IntPredicate v;
int[] v;
int v, v, v, v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.IntPredicate;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = lengthof v;
v = 0;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v;
v = v;
label:
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v;
v = v;
label:
if v == v goto label;
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.IntPredicate: boolean apply(int)>(v);
if v == 0 goto label;
v[v] = 0;
v = v + 1;
goto label;
label:
if v == v goto label;
v = v[v];
v[v] = v;
v[v] = 0;
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
goto label;
label:
v := @caughtexception;
label:
if v == v goto label;
if v == v goto label;
v = v[v];
v[v] = v;
v[v] = 0;
label:
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail> = v;
throw v;
label:
return v;
catch java.lang.Throwable from label to label with label;
}
public boolean contains(int)
{
int[] v;
int v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v;
label:
if v == v goto label;
v = v[v];
if v != v goto label;
return 1;
label:
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
return 0;
}
public int hashCode()
{
int[] v, v;
int v, v, v, v, v, v, v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = 1;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int head>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int tail>;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v;
label:
if v == v goto label;
v = 31 * v;
v = v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int[] buffer>;
v = v[v];
v = staticinvoke <oadd.com.carrotsearch.hppc.BitMixer: int mix(int)>(v);
v = v + v;
v = lengthof v;
v = staticinvoke <oadd.com.carrotsearch.hppc.IntArrayDeque: int oneRight(int,int)>(v, v);
goto label;
label:
return v;
}
public boolean equals(java.lang.Object)
{
java.lang.Class v, v, v;
java.lang.Object v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: java.lang.Object;
if v == null goto label;
v = virtualinvoke v.<java.lang.Object: java.lang.Class getClass()>();
v = virtualinvoke v.<java.lang.Object: java.lang.Class getClass()>();
if v != v goto label;
v = virtualinvoke v.<java.lang.Object: java.lang.Class getClass()>();
v = virtualinvoke v.<java.lang.Class: java.lang.Object cast(java.lang.Object)>(v);
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: boolean equalElements(oadd.com.carrotsearch.hppc.IntArrayDeque)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
protected boolean equalElements(oadd.com.carrotsearch.hppc.IntArrayDeque)
{
java.util.Iterator v, v;
int v, v, v, v;
java.lang.Object v, v;
oadd.com.carrotsearch.hppc.IntArrayDeque v, v;
boolean v, v, v, v, v;
v := @this: oadd.com.carrotsearch.hppc.IntArrayDeque;
v := @parameter: oadd.com.carrotsearch.hppc.IntArrayDeque;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: int size()>();
if v == v goto label;
return 0;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: java.util.Iterator iterator()>();
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 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 = v.<oadd.com.carrotsearch.hppc.cursors.IntCursor: int value>;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = v.<oadd.com.carrotsearch.hppc.cursors.IntCursor: int value>;
if v == v goto label;
return 0;
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v != 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public static transient oadd.com.carrotsearch.hppc.IntArrayDeque 'from'(int[])
{
int v;
oadd.com.carrotsearch.hppc.IntArrayDeque v;
int[] v;
v := @parameter: int[];
v = new oadd.com.carrotsearch.hppc.IntArrayDeque;
v = lengthof v;
specialinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void <init>(int)>(v);
virtualinvoke v.<oadd.com.carrotsearch.hppc.IntArrayDeque: void addLast(int[])>(v);
return v;
}
static void <clinit>()
{
java.lang.Class v;
boolean v, v;
v = class "Loadd/com/carrotsearch/hppc/IntArrayDeque;";
v = virtualinvoke v.<java.lang.Class: boolean desiredAssertionStatus()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
<oadd.com.carrotsearch.hppc.IntArrayDeque: boolean $assertionsDisabled> = v;
return;
}
}