| /* |
| * Copyright (C) 2007-2010 JĂșlio Vilmar Gesser. |
| * Copyright (C) 2011, 2013-2016 The JavaParser Team. |
| * |
| * This file is part of JavaParser. |
| * |
| * JavaParser can be used either under the terms of |
| * a) the GNU Lesser General Public License as published by |
| * the Free Software Foundation, either version 3 of the License, or |
| * (at your option) any later version. |
| * b) the terms of the Apache License |
| * |
| * You should have received a copy of both licenses in LICENCE.LGPL and |
| * LICENCE.APACHE. Please refer to those files for details. |
| * |
| * JavaParser 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. |
| */ |
| |
| package com.github.javaparser.ast.visitor; |
| |
| import com.github.javaparser.ast.Node; |
| |
| /** |
| * Iterate over all the nodes in (a part of) the AST. |
| */ |
| public abstract class TreeVisitor { |
| |
| /** |
| * https://en.wikipedia.org/wiki/Depth-first_search |
| * |
| * @param node the start node, and the first one that is passed to process(node). |
| */ |
| public void visitDepthFirst(Node node) { |
| process(node); |
| for (Node child : node.getChildrenNodes()) { |
| visitDepthFirst(child); |
| } |
| } |
| |
| public abstract void process(Node node); |
| } |