Mercurial > hg > graal-jvmci-8
view src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/services/InputGraphProvider.java @ 22755:0b9cc0259f5a
Make node searches look through all the graphs for a match
author | Tom Rodriguez <tom.rodriguez@oracle.com> |
---|---|
date | Fri, 18 Dec 2015 00:10:30 -0800 |
parents | c18cbe5936b8 |
children | 135acd2dead4 |
line wrap: on
line source
/* * Copyright (c) 1998, 2007, 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. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * 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.services; import com.sun.hotspot.igv.data.InputGraph; import com.sun.hotspot.igv.data.InputNode; import java.util.Set; /** * * @author Thomas Wuerthinger */ public interface InputGraphProvider { InputGraph getGraph(); void setSelectedNodes(Set<InputNode> nodes); /** * @return an iterator walking forward through the {@link InputGraph}s following the {@link #getGraph()} */ Iterable<InputGraph> searchForward(); /** * @return an iterator walking backward through the {@link InputGraph}s preceeding the {@link #getGraph()} */ Iterable<InputGraph> searchBackward(); }