📄 reversedepthfirstsearch.java
字号:
/* * Bytecode Analysis Framework * Copyright (C) 2003,2004 University of Maryland * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */package edu.umd.cs.findbugs.ba;/** * Algorithm to perform a reverse depth first search on a CFG. * (I.e., depth first search on reversed CFG.) * * @see CFG * @author David Hovemeyer */public class ReverseDepthFirstSearch extends edu.umd.cs.findbugs.graph.ReverseDepthFirstSearch<CFG, Edge, BasicBlock>{ private BasicBlock firstRoot; /** * Constructor. * * @param cfg the CFG to perform the reverse depth first search on */ public ReverseDepthFirstSearch(CFG cfg) { super(cfg); this.firstRoot = cfg.getExit(); } protected BasicBlock getNextSearchTreeRoot() { BasicBlock result = firstRoot; firstRoot = null; return result; }}// vim:ts=4
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -