File: TTShape.java

package info (click to toggle)
libnb-javaparser-java 9%2B2018-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 65,320 kB
  • sloc: java: 440,096; xml: 6,359; sh: 865; makefile: 314
file content (102 lines) | stat: -rw-r--r-- 3,014 bytes parent folder | download | duplicates (18)
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/*
 * Copyright (c) 2012, 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.
 */

package org.openjdk.tests.shapegen;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 *
 * @author Robert Field
 */
public class TTShape {

    private final TTNode root;
    private final TTNode[] nodes;

    TTShape(TTNode root) {
        this.root = root;
        Set<TTNode> subs = new HashSet<>();
        root.collectAllSubtypes(subs);
        nodes = subs.toArray(new TTNode[subs.size()]);
    }

    private List<ClassCase> toCases(boolean includeClasses) {
        List<ClassCase> ccs = new ArrayList<>();
        root.start(includeClasses);
        int i;
        outer:
        while (true) {
            if (root.isValid()) {
                ClassCase cc = root.genCase();
                //System.out.println(cc);
                ccs.add(cc);
            }

            i = 0;
            do {
                if (i >= nodes.length) {
                    break outer;
                }
            } while(!nodes[i++].next());
        }
        return ccs;
    }

   public static List<ClassCase> allCases(boolean includeClasses) {
        List<ClassCase> ccs = new ArrayList<>();
        for (TTShape shape : SHAPES) {
            ccs.addAll(shape.toCases(includeClasses));
        }
        return ccs;
    }

    public static TTShape parse(String s) {
        return new TTShape(new TTParser(s).parse());
    }

    public static final TTShape[] SHAPES = new TTShape[] {
        parse("a"),
        parse("a(b)"),
        parse("A(bb)"),
        parse("A(B(d)c(d))"),
        parse("A(b(c))"),
        parse("A(B(cd)d)"),
        parse("A(B(c)c)"),
        parse("A(B(Ce)d(e))"),
        parse("A(B(C)d(e))"),
        parse("A(Bc(d))"),
        parse("A(B(d)dc)"),
        parse("A(B(dc)dc)"),
        parse("A(B(c(d))d)"),
        parse("A(B(C(d))d)"),
        parse("A(B(C(e)d(e))e)"),
        parse("A(B(c(d))c)"),
        parse("A(B(dc(d))c)"),
        parse("A(B(C(d))d)"),
    };

}