1/*
2 * Copyright (c) 2008, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24package com.sun.hotspot.igv.data;
25
26import java.util.*;
27
28/**
29 *
30 * @author Thomas Wuerthinger
31 */
32public class Source {
33
34    private List<InputNode> sourceNodes;
35    private Set<Integer> set;
36
37    public Source() {
38        sourceNodes = new ArrayList<>(1);
39        set = new LinkedHashSet<>(1);
40    }
41
42    public List<InputNode> getSourceNodes() {
43        return Collections.unmodifiableList(sourceNodes);
44    }
45
46    public Set<Integer> getSourceNodesAsSet() {
47        return Collections.unmodifiableSet(set);
48    }
49
50    public void addSourceNode(InputNode n) {
51        if (!set.contains(n.getId())) {
52            sourceNodes.add(n);
53            set.add(n.getId());
54        }
55    }
56
57    public interface Provider {
58
59        public Source getSource();
60    }
61
62    public void addSourceNodes(Source s) {
63        for (InputNode n : s.getSourceNodes()) {
64            addSourceNode(n);
65        }
66    }
67}
68