mu$m.java
1.62 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
import java.util.Comparator;
import java.util.SortedSet;
import javax.annotation.Nullable;
class mu$m
extends mu<K, V>.i
implements SortedSet<V>
{
mu$m(K paramK, @Nullable SortedSet<V> paramSortedSet, mu<K, V>.i parammu)
{
super(paramK, paramSortedSet, parammu, locali);
}
public Comparator<? super V> comparator()
{
return d().comparator();
}
SortedSet<V> d()
{
return (SortedSet)this.c;
}
public V first()
{
a();
return (V)d().first();
}
public SortedSet<V> headSet(V paramV)
{
a();
mu localmu = this.g;
Object localObject = this.b;
SortedSet localSortedSet = d().headSet(paramV);
if (this.d == null) {}
for (paramV = this;; paramV = this.d) {
return new m(localmu, localObject, localSortedSet, paramV);
}
}
public V last()
{
a();
return (V)d().last();
}
public SortedSet<V> subSet(V paramV1, V paramV2)
{
a();
mu localmu = this.g;
Object localObject = this.b;
paramV2 = d().subSet(paramV1, paramV2);
if (this.d == null) {}
for (paramV1 = this;; paramV1 = this.d) {
return new m(localmu, localObject, paramV2, paramV1);
}
}
public SortedSet<V> tailSet(V paramV)
{
a();
mu localmu = this.g;
Object localObject = this.b;
SortedSet localSortedSet = d().tailSet(paramV);
if (this.d == null) {}
for (paramV = this;; paramV = this.d) {
return new m(localmu, localObject, localSortedSet, paramV);
}
}
}
/* Location: /home/merong/decompile/hackery-dex2jar.jar!/mu$m.class
* Java compiler version: 6 (50.0)
* JD-Core Version: 0.7.1
*/