Mercurial > hg > truffle
view visualizer/Data/src/com/sun/hotspot/igv/data/Source.java @ 5059:ed559a528128
Perform renames on files.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Thu, 08 Mar 2012 17:57:30 +0100 |
parents | 015fb895586b |
children |
line wrap: on
line source
/* * Copyright (c) 2008, 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 com.sun.hotspot.igv.data; import java.util.*; /** * * @author Thomas Wuerthinger */ public class Source { private List<InputNode> sourceNodes; private Set<Integer> set; public Source() { sourceNodes = new ArrayList<>(1); set = new LinkedHashSet<>(1); } public List<InputNode> getSourceNodes() { return Collections.unmodifiableList(sourceNodes); } public Set<Integer> getSourceNodesAsSet() { return Collections.unmodifiableSet(set); } public void addSourceNode(InputNode n) { if (!set.contains(n.getId())) { sourceNodes.add(n); set.add(n.getId()); } } public interface Provider { public Source getSource(); } public void addSourceNodes(Source s) { for (InputNode n : s.getSourceNodes()) { addSourceNode(n); } } }