java-decompiler: post-import cleanup (test sources reformatted)

master
Roman Shevchenko 11 years ago
parent e629738a46
commit c0c83126a6
  1. BIN
      testData/classes/pkg/TestClassLambda.class
  2. 4
      testData/results/TestClassLambda.dec
  3. 12
      testData/src/pkg/TestClassFields.java
  4. 113
      testData/src/pkg/TestClassLambda.java
  5. 74
      testData/src/pkg/TestClassLoop.java
  6. 17
      testData/src/pkg/TestClassSwitch.java
  7. 70
      testData/src/pkg/TestClassTypes.java
  8. 54
      testData/src/pkg/TestClassVar.java

@ -26,10 +26,10 @@ public class TestClassLambda {
public void testLambda1() { public void testLambda1() {
int var1 = (int)Math.random(); int var1 = (int)Math.random();
Runnable var2 = () -> { Runnable var2 = () -> {
System.out.println("hello" + var1); System.out.println("hello1" + var1);
}; };
Runnable var3 = () -> { Runnable var3 = () -> {
System.out.println("hello1" + var1); System.out.println("hello2" + var1);
}; };
} }

@ -17,12 +17,12 @@ package pkg;
public class TestClassFields { public class TestClassFields {
private static int[] sizes; private static int[] sizes;
private static String[] names; private static String[] names;
static { static {
names = new String[]{"name1", "name2"}; names = new String[]{"name1", "name2"};
sizes = new int[names.length]; sizes = new int[names.length];
} }
} }

@ -15,68 +15,63 @@
*/ */
package pkg; package pkg;
import java.util.ArrayList; import java.util.*;
import java.util.Arrays;
import java.util.List;
import java.util.OptionalInt;
import java.util.function.IntBinaryOperator; import java.util.function.IntBinaryOperator;
import java.util.function.Supplier; import java.util.function.Supplier;
public class TestClassLambda { public class TestClassLambda {
public int field = 0; public int field = 0;
public void testLambda() { public void testLambda() {
List<Integer> list = Arrays.asList(1, 2, 3, 4, 5, 6, 7);
List<Integer> list = Arrays.asList(1, 2, 3, 4, 5, 6, 7); int b = (int)Math.random();
int b = (int)Math.random();
list.forEach(n -> {
list.forEach(n -> {int a = 2 * n; System.out.println(a + b + field);}); int a = 2 * n;
} System.out.println(a + b + field);
});
public void testLambda1() { }
int a = (int)Math.random(); public void testLambda1() {
int a = (int)Math.random();
Runnable r = () -> { System.out.println("hello" + a); }; Runnable r1 = () -> { System.out.println("hello1" + a); };
Runnable r2 = () -> { System.out.println("hello2" + a); };
Runnable r1 = () -> { System.out.println("hello1" + a); }; }
}
public void testLambda2() {
public void testLambda2() { reduce((left, right) -> Math.max(left, right));
reduce((left, right) -> Math.max(left, right)); }
}
public void testLambda3() { // IDEA-127301
public void testLambda3() { // IDEA-127301 reduce(Math::max);
reduce(Math::max); }
}
public void testLambda4() {
public void testLambda4() { reduce(TestClassLambda::localMax);
reduce(TestClassLambda::localMax); }
}
public void testLambda5() {
public void testLambda5() { String x = "abcd";
String x = "abcd"; function(x::toString);
function(x::toString); }
}
public void testLambda6() {
public void testLambda6() { List<String> list = new ArrayList<String>();
List<String> list = new ArrayList<String>(); int bottom = list.size() * 2;
int bottom = list.size() * 2; int top = list.size() * 5;
int top = list.size() * 5; list.removeIf(s -> (bottom >= s.length() && s.length() <= top));
list.removeIf( s -> (bottom >= s.length() && s.length() <= top) ); }
}
public static OptionalInt reduce(IntBinaryOperator op) {
public static OptionalInt reduce(IntBinaryOperator op) { return null;
return null; }
}
public static String function(Supplier<String> supplier) {
public static String function(Supplier<String> supplier) { return supplier.get();
return supplier.get(); }
}
public static int localMax(int first, int second) {
public static int localMax(int first, int second) { return 0;
return 0; }
}
} }

@ -17,47 +17,45 @@ package pkg;
public class TestClassLoop { public class TestClassLoop {
public static void testSimpleInfinite() { public static void testSimpleInfinite() {
while(true) { while (true) {
System.out.println(); System.out.println();
} }
}
}
public static void testFinally() {
boolean a = (Math.random() > 0);
while(true) {
try {
if(!a) {
return;
}
} finally {
System.out.println("1");
}
}
} public static void testFinally() {
public static void testFinallyContinue() { boolean a = (Math.random() > 0);
boolean a = (Math.random() > 0); while (true) {
try {
for(;;) { if (!a) {
try { return;
System.out.println("1"); }
} finally { }
if(a) { finally {
System.out.println("3"); System.out.println("1");
continue; }
} }
} }
System.out.println("4"); public static void testFinallyContinue() {
}
boolean a = (Math.random() > 0);
}
for (; ; ) {
try {
System.out.println("1");
}
finally {
if (a) {
System.out.println("3");
continue;
}
}
System.out.println("4");
}
}
} }

@ -17,15 +17,14 @@ package pkg;
public class TestClassSwitch { public class TestClassSwitch {
public void testCaseOrder(int a) { public void testCaseOrder(int a) {
switch(a) { switch (a) {
case 13: case 13:
System.out.println(13); System.out.println(13);
return; return;
case 5: case 5:
System.out.println(5); System.out.println(5);
}
} }
}
} }

@ -20,50 +20,50 @@ import java.util.List;
public class TestClassTypes { public class TestClassTypes {
public void testBoolean() { public void testBoolean() {
byte var7 = 0; byte var7 = 0;
long time = System.currentTimeMillis(); long time = System.currentTimeMillis();
if(time % 2 > 0) { if (time % 2 > 0) {
var7 = 1; var7 = 1;
} else if(time % 3 > 0) { }
var7 = 2; else if (time % 3 > 0) {
} var7 = 2;
if(var7 == 1) {
System.out.println();
}
} }
public boolean testBit(int var0) { if (var7 == 1) {
return (var0 & 1) == 1; System.out.println();
} }
}
public void testSwitchConsts(int a) { public boolean testBit(int var0) {
return (var0 & 1) == 1;
}
switch (a) { public void testSwitchConsts(int a) {
case 88:
System.out.println("1");
break;
case 656:
System.out.println("2");
break;
case 65201:
case 65489:
System.out.println("3");
}
}
public void testAssignmentType(List list) { switch (a) {
case 88:
System.out.println("1");
break;
case 656:
System.out.println("2");
break;
case 65201:
case 65489:
System.out.println("3");
}
}
List a = list; public void testAssignmentType(List list) {
if(a != null) { List a = list;
(a = new ArrayList(a)).add("23");
}
System.out.println(a.size()); if (a != null) {
} (a = new ArrayList(a)).add("23");
}
System.out.println(a.size());
}
} }

@ -18,42 +18,42 @@ package pkg;
public class TestClassVar { public class TestClassVar {
private boolean field_boolean = (Math.random() > 0); private boolean field_boolean = (Math.random() > 0);
public int field_int = 0; public int field_int = 0;
public void testFieldSSAU() { public void testFieldSSAU() {
for(int i = 0; i < 10; i++) { for (int i = 0; i < 10; i++) {
try {
System.out.println();
} finally {
if (field_boolean) {
System.out.println();
}
}
try {
System.out.println();
}
finally {
if (field_boolean) {
System.out.println();
} }
} }
}
public Long testFieldSSAU1() { // IDEA-127466 }
return new Long(field_int++);
}
public void testComplexPropagation() { public Long testFieldSSAU1() { // IDEA-127466
return new Long(field_int++);
}
int a = 0; public void testComplexPropagation() {
while (a < 10) { int a = 0;
int b = a; while (a < 10) {
for(; a < 10 && a == 0; a++) {} int b = a;
if (b != a) { for (; a < 10 && a == 0; a++) {
System.out.println(); }
}
}
}
if (b != a) {
System.out.println();
}
}
}
} }

Loading…
Cancel
Save