File: HashCodeTest.java

package info (click to toggle)
openjdk-11 11.0.4%2B11-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 757,028 kB
  • sloc: java: 5,016,041; xml: 1,191,974; cpp: 934,731; ansic: 555,697; sh: 24,299; objc: 12,703; python: 3,602; asm: 3,415; makefile: 2,772; awk: 351; sed: 172; perl: 114; jsp: 24; csh: 3
file content (78 lines) | stat: -rw-r--r-- 2,741 bytes parent folder | download | duplicates (16)
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
/*
 * Copyright (c) 2004, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/*
 * @test
 * @bug 5097856
 * @summary Computing hashCode of objects modeling generics shouldn't blow stack
 * @author Joseph D. Darcy
 */

import java.util.*;
import java.lang.reflect.*;

public class HashCodeTest {

    // Mutually recursive interface types
    interface Edge<N extends Node<? extends Edge<N>>> {
        void setEndNode(N n);
    }
    interface Node<E extends Edge<? extends Node<E>>> {
        E getOutEdge();
    }

    public static void main(String argv[]) {
        List<Class<?>> classes = new ArrayList<Class<?>>();
        Set<TypeVariable> typeVariables = new HashSet<TypeVariable>();

        classes.add(java.lang.Class.class);// Simple case
        classes.add(java.util.Map.class);
        classes.add(java.lang.Enum.class); // Contains f-bound
        classes.add(Edge.class);
        classes.add(Node.class);

        for(Class<?> clazz: classes) {
            System.out.println(clazz);

            for (TypeVariable<?> tv : clazz.getTypeParameters()) {
                int hc = tv.hashCode();
                typeVariables.add(tv);
                System.out.printf("\t%s 0x%x (%d)%n", tv.getName(), hc, hc);
            }
        }

        // Loop over classes again, making sure all type variables are
        // already present
        int count = 0;
        for(Class<?> clazz: classes) {
            for (TypeVariable<?> tv : clazz.getTypeParameters()) {
                if (!typeVariables.remove(tv))
                    throw new RuntimeException("Type variable " + tv + " not found.");
            }
        }

        if (typeVariables.size() != 0 )
            throw new RuntimeException("Unexpected number of type variables.");

    }
}