project: Rev 202
This commit is contained in:
@@ -21,19 +21,19 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
DualNode head;
|
||||
|
||||
public IterableDualNodeQueue() {
|
||||
this.sentinel = new DualNode(); // L: 7
|
||||
this.sentinel.previousDual = this.sentinel; // L: 11
|
||||
this.sentinel.nextDual = this.sentinel; // L: 12
|
||||
} // L: 13
|
||||
this.sentinel = new DualNode();
|
||||
this.sentinel.previousDual = this.sentinel;
|
||||
this.sentinel.nextDual = this.sentinel;
|
||||
}
|
||||
|
||||
@ObfuscatedName("c")
|
||||
@Export("clear")
|
||||
public void clear() {
|
||||
while (this.sentinel.previousDual != this.sentinel) { // L: 16
|
||||
this.sentinel.previousDual.removeDual(); // L: 17
|
||||
while (this.sentinel.previousDual != this.sentinel) {
|
||||
this.sentinel.previousDual.removeDual();
|
||||
}
|
||||
|
||||
} // L: 19
|
||||
}
|
||||
|
||||
@ObfuscatedName("b")
|
||||
@ObfuscatedSignature(
|
||||
@@ -41,15 +41,15 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
)
|
||||
@Export("add")
|
||||
public void add(DualNode var1) {
|
||||
if (var1.nextDual != null) { // L: 22
|
||||
if (var1.nextDual != null) {
|
||||
var1.removeDual();
|
||||
}
|
||||
|
||||
var1.nextDual = this.sentinel.nextDual; // L: 23
|
||||
var1.previousDual = this.sentinel; // L: 24
|
||||
var1.nextDual.previousDual = var1; // L: 25
|
||||
var1.previousDual.nextDual = var1; // L: 26
|
||||
} // L: 27
|
||||
var1.nextDual = this.sentinel.nextDual;
|
||||
var1.previousDual = this.sentinel;
|
||||
var1.nextDual.previousDual = var1;
|
||||
var1.previousDual.nextDual = var1;
|
||||
}
|
||||
|
||||
@ObfuscatedName("m")
|
||||
@ObfuscatedSignature(
|
||||
@@ -57,12 +57,12 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
)
|
||||
@Export("removeLast")
|
||||
public DualNode removeLast() {
|
||||
DualNode var1 = this.sentinel.previousDual; // L: 39
|
||||
DualNode var1 = this.sentinel.previousDual;
|
||||
if (var1 == this.sentinel) {
|
||||
return null; // L: 40
|
||||
return null;
|
||||
} else {
|
||||
var1.removeDual(); // L: 41
|
||||
return var1; // L: 42
|
||||
var1.removeDual();
|
||||
return var1;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -72,7 +72,7 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
)
|
||||
@Export("last")
|
||||
public DualNode last() {
|
||||
return this.previousOrLast((DualNode)null); // L: 46
|
||||
return this.previousOrLast((DualNode)null);
|
||||
}
|
||||
|
||||
@ObfuscatedName("s")
|
||||
@@ -82,18 +82,18 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
@Export("previousOrLast")
|
||||
DualNode previousOrLast(DualNode var1) {
|
||||
DualNode var2;
|
||||
if (var1 == null) { // L: 52
|
||||
if (var1 == null) {
|
||||
var2 = this.sentinel.previousDual;
|
||||
} else {
|
||||
var2 = var1; // L: 53
|
||||
var2 = var1;
|
||||
}
|
||||
|
||||
if (var2 == this.sentinel) { // L: 54
|
||||
this.head = null; // L: 55
|
||||
return null; // L: 56
|
||||
if (var2 == this.sentinel) {
|
||||
this.head = null;
|
||||
return null;
|
||||
} else {
|
||||
this.head = var2.previousDual; // L: 58
|
||||
return var2; // L: 59
|
||||
this.head = var2.previousDual;
|
||||
return var2;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -103,18 +103,18 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
)
|
||||
@Export("previous")
|
||||
public DualNode previous() {
|
||||
DualNode var1 = this.head; // L: 64
|
||||
if (var1 == this.sentinel) { // L: 65
|
||||
this.head = null; // L: 66
|
||||
return null; // L: 67
|
||||
DualNode var1 = this.head;
|
||||
if (var1 == this.sentinel) {
|
||||
this.head = null;
|
||||
return null;
|
||||
} else {
|
||||
this.head = var1.previousDual; // L: 69
|
||||
return var1; // L: 70
|
||||
this.head = var1.previousDual;
|
||||
return var1;
|
||||
}
|
||||
}
|
||||
|
||||
public Iterator iterator() {
|
||||
return new IterableDualNodeQueueIterator(this); // L: 74
|
||||
return new IterableDualNodeQueueIterator(this);
|
||||
}
|
||||
|
||||
@ObfuscatedName("p")
|
||||
@@ -123,13 +123,13 @@ public class IterableDualNodeQueue implements Iterable {
|
||||
)
|
||||
@Export("DualNodeDeque_addBefore")
|
||||
public static void DualNodeDeque_addBefore(DualNode var0, DualNode var1) {
|
||||
if (var0.nextDual != null) { // L: 30
|
||||
if (var0.nextDual != null) {
|
||||
var0.removeDual();
|
||||
}
|
||||
|
||||
var0.nextDual = var1; // L: 31
|
||||
var0.previousDual = var1.previousDual; // L: 32
|
||||
var0.nextDual.previousDual = var0; // L: 33
|
||||
var0.previousDual.nextDual = var0; // L: 34
|
||||
} // L: 35
|
||||
var0.nextDual = var1;
|
||||
var0.previousDual = var1.previousDual;
|
||||
var0.nextDual.previousDual = var0;
|
||||
var0.previousDual.nextDual = var0;
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user