rd.java
2.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
import java.io.IOException;
public abstract class rd
{
private StringBuilder a = new StringBuilder();
private boolean b;
private boolean a(boolean paramBoolean)
throws IOException
{
a(this.a.toString());
this.a = new StringBuilder();
this.b = false;
return paramBoolean;
}
public final void a()
throws IOException
{
if ((this.b) || (this.a.length() > 0)) {
a(false);
}
}
public abstract void a(String paramString)
throws IOException;
public final void a(char[] paramArrayOfChar, int paramInt)
throws IOException
{
boolean bool;
if ((this.b) && (paramInt > 0)) {
if (paramArrayOfChar[0] == '\n')
{
bool = true;
if (!a(bool)) {
break label241;
}
}
}
label158:
label238:
label241:
for (int j = 1;; j = 0)
{
int n = paramInt + 0;
int i = j;
int k = j;
int m;
for (;;)
{
if (i < n)
{
j = k;
m = i;
switch (paramArrayOfChar[i])
{
default:
m = i;
j = k;
case '\013':
case '\f':
i = m + 1;
k = j;
continue;
bool = false;
break;
case '\r':
this.a.append(paramArrayOfChar, k, i - k);
this.b = true;
if (i + 1 >= n) {
break label238;
}
if (paramArrayOfChar[(i + 1)] == '\n')
{
bool = true;
if (!a(bool)) {
break label238;
}
i += 1;
}
break;
}
}
}
for (;;)
{
m = i;
j = i + 1;
break;
bool = false;
break label158;
this.a.append(paramArrayOfChar, k, i - k);
a(true);
j = i + 1;
m = i;
break;
this.a.append(paramArrayOfChar, k, paramInt + 0 - k);
return;
}
}
}
}
/* Location: /home/merong/decompile/hackery-dex2jar.jar!/rd.class
* Java compiler version: 6 (50.0)
* JD-Core Version: 0.7.1
*/