1044 |
|
++i; |
1045 |
|
if (p == (p = p.next)) |
1046 |
|
p = q.firstDataNode(); |
1047 |
< |
} while (p != null && i < n); |
1047 |
> |
} while (p != null && i < n && p.isData); |
1048 |
|
if ((current = p) == null) |
1049 |
|
exhausted = true; |
1050 |
|
if (i > 0) { |
1072 |
|
action.accept((E)e); |
1073 |
|
if (p == (p = p.next)) |
1074 |
|
p = q.firstDataNode(); |
1075 |
< |
} while (p != null); |
1075 |
> |
} while (p != null && p.isData); |
1076 |
|
} |
1077 |
|
} |
1078 |
|
|
1089 |
|
e = null; |
1090 |
|
if (p == (p = p.next)) |
1091 |
|
p = q.firstDataNode(); |
1092 |
< |
} while (e == null && p != null); |
1092 |
> |
} while (e == null && p != null && p.isData); |
1093 |
|
if ((current = p) == null) |
1094 |
|
exhausted = true; |
1095 |
|
if (e != null) { |