annotate make/test/Queens.java @ 3011:f00918f35c7f

inlining and runtime interface related changes: added codeSize() and compilerStorage() to RiMethod HotSpotMethodResolved uses reflective methods instead of vmIds and survives compilations HotSpotResolvedType.isInitialized not represented as field (can change) inlining stores graphs into method objects and reuses them
author Lukas Stadler <lukas.stadler@jku.at>
date Thu, 16 Jun 2011 20:36:17 +0200
parents c18cbe5936b8
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1 /*
1552
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 196
diff changeset
2 * Copyright (c) 2006, 2008, Oracle and/or its affiliates. All rights reserved.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load
duke
parents:
diff changeset
4 *
a61af66fc99e Initial load
duke
parents:
diff changeset
5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load
duke
parents:
diff changeset
6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load
duke
parents:
diff changeset
7 * published by the Free Software Foundation.
a61af66fc99e Initial load
duke
parents:
diff changeset
8 *
a61af66fc99e Initial load
duke
parents:
diff changeset
9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load
duke
parents:
diff changeset
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load
duke
parents:
diff changeset
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load
duke
parents:
diff changeset
12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load
duke
parents:
diff changeset
13 * accompanied this code).
a61af66fc99e Initial load
duke
parents:
diff changeset
14 *
a61af66fc99e Initial load
duke
parents:
diff changeset
15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load
duke
parents:
diff changeset
16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load
duke
parents:
diff changeset
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load
duke
parents:
diff changeset
18 *
1552
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 196
diff changeset
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 196
diff changeset
20 * or visit www.oracle.com if you need additional information or have any
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 196
diff changeset
21 * questions.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
22 *
a61af66fc99e Initial load
duke
parents:
diff changeset
23 */
a61af66fc99e Initial load
duke
parents:
diff changeset
24
a61af66fc99e Initial load
duke
parents:
diff changeset
25 import java.util.*;
a61af66fc99e Initial load
duke
parents:
diff changeset
26
a61af66fc99e Initial load
duke
parents:
diff changeset
27 // Copyright 1996, Animorphic Systems
a61af66fc99e Initial load
duke
parents:
diff changeset
28 // gri 28 Aug 92 / 15 Jan 93 / 8 Dec 95
a61af66fc99e Initial load
duke
parents:
diff changeset
29
a61af66fc99e Initial load
duke
parents:
diff changeset
30 class Queens {
a61af66fc99e Initial load
duke
parents:
diff changeset
31
a61af66fc99e Initial load
duke
parents:
diff changeset
32 static void try_i(boolean a[], boolean b[], boolean c[], int x[], int i) {
a61af66fc99e Initial load
duke
parents:
diff changeset
33 int adj = 7;
a61af66fc99e Initial load
duke
parents:
diff changeset
34
a61af66fc99e Initial load
duke
parents:
diff changeset
35 for (int j = 1; j <= 8; j++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
36 if (b[j] && a[i+j] && c[adj+i-j]) {
a61af66fc99e Initial load
duke
parents:
diff changeset
37 x[i] = j;
a61af66fc99e Initial load
duke
parents:
diff changeset
38 b[j] = false;
a61af66fc99e Initial load
duke
parents:
diff changeset
39 a[i+j] = false;
a61af66fc99e Initial load
duke
parents:
diff changeset
40 c[adj+i-j] = false;
a61af66fc99e Initial load
duke
parents:
diff changeset
41 if (i < 8) try_i(a, b, c, x, i+1);
a61af66fc99e Initial load
duke
parents:
diff changeset
42 else print(x);
a61af66fc99e Initial load
duke
parents:
diff changeset
43 b[j] = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
44 a[i+j] = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
45 c[adj+i-j] = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
46 }
a61af66fc99e Initial load
duke
parents:
diff changeset
47 }
a61af66fc99e Initial load
duke
parents:
diff changeset
48 }
a61af66fc99e Initial load
duke
parents:
diff changeset
49
a61af66fc99e Initial load
duke
parents:
diff changeset
50 public static void main(String s[]) {
a61af66fc99e Initial load
duke
parents:
diff changeset
51 boolean a[] = new boolean[16+1];
a61af66fc99e Initial load
duke
parents:
diff changeset
52 boolean b[] = new boolean[ 8+1];
a61af66fc99e Initial load
duke
parents:
diff changeset
53 boolean c[] = new boolean[14+1];
a61af66fc99e Initial load
duke
parents:
diff changeset
54 int x[] = new int[8+1];
a61af66fc99e Initial load
duke
parents:
diff changeset
55 int adj = 7;
a61af66fc99e Initial load
duke
parents:
diff changeset
56
a61af66fc99e Initial load
duke
parents:
diff changeset
57 for (int i = -7; i <= 16; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
58 if (i >= 1 && i <= 8) b[i] = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
59 if (i >= 2) a[i] = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
60 if (i <= 7) c[adj+i] = true;
a61af66fc99e Initial load
duke
parents:
diff changeset
61 }
a61af66fc99e Initial load
duke
parents:
diff changeset
62
a61af66fc99e Initial load
duke
parents:
diff changeset
63 x[0] = 0; // solution counter
a61af66fc99e Initial load
duke
parents:
diff changeset
64
a61af66fc99e Initial load
duke
parents:
diff changeset
65 try_i(a, b, c, x, 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
66 }
a61af66fc99e Initial load
duke
parents:
diff changeset
67
a61af66fc99e Initial load
duke
parents:
diff changeset
68 static void print(int x[]) {
a61af66fc99e Initial load
duke
parents:
diff changeset
69 // first correct solution: A1 B5 C8 D6 E3 F7 G2 H4
a61af66fc99e Initial load
duke
parents:
diff changeset
70
a61af66fc99e Initial load
duke
parents:
diff changeset
71 char LF = (char)0xA;
a61af66fc99e Initial load
duke
parents:
diff changeset
72 char CR = (char)0xD;
a61af66fc99e Initial load
duke
parents:
diff changeset
73
a61af66fc99e Initial load
duke
parents:
diff changeset
74 x[0]++;
a61af66fc99e Initial load
duke
parents:
diff changeset
75 if (x[0] < 10)
a61af66fc99e Initial load
duke
parents:
diff changeset
76 System.out.print(" ");
a61af66fc99e Initial load
duke
parents:
diff changeset
77 System.out.print(x[0] + ". ");
a61af66fc99e Initial load
duke
parents:
diff changeset
78 for (int i = 1; i <= 8; i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
79 char p = (char)('A' + i - 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
80 System.out.print(p);
a61af66fc99e Initial load
duke
parents:
diff changeset
81 System.out.print (x[i] + " ");
a61af66fc99e Initial load
duke
parents:
diff changeset
82 }
a61af66fc99e Initial load
duke
parents:
diff changeset
83 System.out.println();
a61af66fc99e Initial load
duke
parents:
diff changeset
84 }
a61af66fc99e Initial load
duke
parents:
diff changeset
85
a61af66fc99e Initial load
duke
parents:
diff changeset
86 };