File: NameSet.java

package info (click to toggle)
openjdk-25 25.0.1%2B8-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 825,408 kB
  • sloc: java: 5,585,680; cpp: 1,333,948; xml: 1,321,242; ansic: 488,034; asm: 404,003; objc: 21,088; sh: 15,106; javascript: 13,265; python: 8,319; makefile: 2,518; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (151 lines) | stat: -rw-r--r-- 4,997 bytes parent folder | download | duplicates (2)
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/*
 * Copyright (c) 2025, 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 compiler.lib.template_framework;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.Optional;

import jdk.test.lib.Utils;

/**
 * The {@link NameSet} defines a set of {@link Name}s (e.g. fields or variable names). They extend the
 * set of the {@code 'parent'} set.
 */
class NameSet {
    private static final Random RANDOM = Utils.getRandomInstance();

    private final NameSet parent;
    private final List<NameSet> children = new ArrayList<>();
    private final List<Name> names = new ArrayList<>();

    interface Predicate {
        boolean check(Name type);
    }

    NameSet(NameSet parent) {
        this.parent = parent;
        if (parent != null) { parent.registerChild(this); }
    }

    void registerChild(NameSet child) {
        children.add(child);
    }

    private long weight(Predicate predicate) {
        long w = names.stream().filter(predicate::check).mapToInt(Name::weight).sum();
        if (parent != null) { w += parent.weight(predicate); }
        return w;
    }

    public int count(Predicate predicate) {
        int c = (int)names.stream().filter(predicate::check).count();
        if (parent != null) { c += parent.count(predicate); }
        return c;
    }

    public boolean hasAny(Predicate predicate) {
        return names.stream().anyMatch(predicate::check) ||
               (parent != null && parent.hasAny(predicate));
    }

    public List<Name> toList(Predicate predicate) {
        List<Name> list = (parent != null) ? parent.toList(predicate)
                                           : new ArrayList<>();
        list.addAll(names.stream().filter(predicate::check).toList());
        return list;
    }

    /**
     * Randomly sample a name from this set or a parent set, restricted to the predicate.
     */
    public Name sample(Predicate predicate) {
        long w = weight(predicate);
        if (w <= 0) {
            // Negative weight should never happen, as all names have positive weight.
            if (w < 0) {
                throw new RuntimeException("Negative weight not allowed: " + w);
            }
            // If the weight is zero, there is no matching Name available.
            // Return null, and let the caller handle the situation, e.g.
            // throw an exception.
            return null;
        }

        long r = RANDOM.nextLong(w);
        return sample(predicate, r);
    }

    private Name sample(Predicate predicate, long r) {
        for (var name : names) {
            if (predicate.check(name)) {
                r -= name.weight();
                if (r < 0) { return name; }
            }
        }
        return parent.sample(predicate, r);
    }

    private Name findLocal(String name) {
        Optional<Name> opt = names.stream().filter(n -> n.name().equals(name)).findAny();
        return opt.orElse(null);
    }

    private Name findParents(String name) {
        if (parent == null) { return null; }
        Name n = parent.findLocal(name);
        if (n != null) { return n; }
        return parent.findParents(name);
    }

    private Name findChildren(String name) {
        for (NameSet child : children) {
            Name n1 = child.findLocal(name);
            if (n1 != null) { return n1; }
            Name n2 = child.findChildren(name);
            if (n2 != null) { return n2; }
        }
        return null;
    }

    private Name find(String name) {
        Name n1 = findLocal(name);
        if (n1 != null) { return n1; }
        Name n2 = findParents(name);
        if (n2 != null) { return n2; }
        return findChildren(name);
    }

    /**
     * Add a variable of a specified type to the set.
     */
    public void add(Name name) {
        Name other = find(name.name());
        if (other != null) {
            throw new RendererException("Duplicate name: " + name + ", previously: " + other);
        }
        names.add(name);
    }
}