Mercurial > jdk8-mips64-public > langtools / annotate
test/tools/javac/foreach/Foreach.java@d9febdd5ae21 (annotated)
test/tools/javac/foreach/Foreach.java
Fri, 21 Aug 2009 14:58:21 -0700
- author
- jjg
- date
- Fri, 21 Aug 2009 14:58:21 -0700
- changeset 377
- d9febdd5ae21
- parent 289
- 84061bd68019
- child 554
- 9d9f26857129
- permissions
- -rw-r--r--
6873845: refine access to symbol file
Reviewed-by: darcy
| duke@1 | 1 | /* |
| duke@1 | 2 | * Copyright 2003 Sun Microsystems, Inc. All Rights Reserved. |
| duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| duke@1 | 4 | * |
| duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
| duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| duke@1 | 7 | * published by the Free Software Foundation. |
| duke@1 | 8 | * |
| duke@1 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| duke@1 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| duke@1 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| duke@1 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| duke@1 | 13 | * accompanied this code). |
| duke@1 | 14 | * |
| duke@1 | 15 | * You should have received a copy of the GNU General Public License version |
| duke@1 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| duke@1 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| duke@1 | 18 | * |
| duke@1 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| duke@1 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| duke@1 | 21 | * have any questions. |
| duke@1 | 22 | */ |
| duke@1 | 23 | |
| duke@1 | 24 | /* |
| duke@1 | 25 | * @test |
| duke@1 | 26 | * @bug 4855355 |
| duke@1 | 27 | * @summary implement "foreach" loops as specified in JSR 201 |
| duke@1 | 28 | * @author gafter |
| duke@1 | 29 | */ |
| duke@1 | 30 | |
| duke@1 | 31 | import java.util.Iterator; |
| duke@1 | 32 | |
| duke@1 | 33 | public class Foreach implements Iterable<Integer> { |
| duke@1 | 34 | |
| duke@1 | 35 | public Iterator<Integer> iterator() { |
| duke@1 | 36 | return new Iterator<Integer>() { |
| duke@1 | 37 | int next = 1; |
| duke@1 | 38 | public boolean hasNext() { |
| duke@1 | 39 | return next <= (1 << 12); |
| duke@1 | 40 | } |
| duke@1 | 41 | public void remove() { |
| duke@1 | 42 | throw new UnsupportedOperationException(); |
| duke@1 | 43 | } |
| duke@1 | 44 | public Integer next() { |
| duke@1 | 45 | try { |
| duke@1 | 46 | return new Integer(next); |
| duke@1 | 47 | } finally { |
| duke@1 | 48 | next <<= 1; |
| duke@1 | 49 | } |
| duke@1 | 50 | } |
| duke@1 | 51 | }; |
| duke@1 | 52 | } |
| duke@1 | 53 | |
| duke@1 | 54 | public static void main(String[] args) { |
| duke@1 | 55 | int sum; |
| duke@1 | 56 | |
| duke@1 | 57 | sum = 0; |
| duke@1 | 58 | int[] a = new int[12]; |
| duke@1 | 59 | for (int i=0; i<12; i++) a[i] = 1<<i; |
| duke@1 | 60 | for (int i : a) { |
| duke@1 | 61 | if (i > 400) break; |
| duke@1 | 62 | if (i == 16) continue; |
| duke@1 | 63 | sum += i; |
| duke@1 | 64 | } |
| duke@1 | 65 | if (sum != 495) |
| duke@1 | 66 | throw new AssertionError("cogito ergo " + sum); |
| duke@1 | 67 | |
| duke@1 | 68 | sum = 0; |
| duke@1 | 69 | Iterable<Integer> x = new Foreach(); |
| duke@1 | 70 | for (Integer j : x) |
| duke@1 | 71 | sum += j.intValue(); |
| duke@1 | 72 | if (sum != 8191) |
| duke@1 | 73 | throw new AssertionError("cogito ergo " + sum); |
| duke@1 | 74 | |
| duke@1 | 75 | System.out.println("success!"); |
| duke@1 | 76 | } |
| duke@1 | 77 | } |
