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.graph; 25 26import java.util.ArrayList; 27import java.util.List; 28 29/** 30 * 31 * @author Thomas Wuerthinger 32 */ 33public class PredecessorSelector implements Selector { 34 35 private Selector innerSelector; 36 37 public PredecessorSelector(Selector innerSelector) { 38 this.innerSelector = innerSelector; 39 } 40 41 @Override 42 public List<Figure> selected(Diagram d) { 43 List<Figure> inner = innerSelector.selected(d); 44 List<Figure> result = new ArrayList<>(); 45 for (Figure f : d.getFigures()) { 46 boolean saved = false; 47 for (Figure f2 : f.getSuccessors()) { 48 if (inner.contains(f2)) { 49 saved = true; 50 } 51 } 52 53 if (saved) { 54 result.add(f); 55 } 56 } 57 58 return result; 59 } 60} 61