File: AbstractNodeVisitor.java

package info (click to toggle)
herold 8.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 5,304 kB
  • sloc: java: 40,460; xml: 513; makefile: 37; sh: 29
file content (64 lines) | stat: -rw-r--r-- 1,808 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/* 
 * Copyright (C) 2001-2013 Michael Fuchs
 *
 * This file is part of herold.
 * 
 * herold is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * herold 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 for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with herold.  If not, see <http://www.gnu.org/licenses/>.  
 */
package org.dbdoclet.xiphias.dom;

import java.util.ArrayList;

import org.dbdoclet.progress.ProgressEvent;
import org.dbdoclet.progress.ProgressListener;
import org.dbdoclet.progress.ProgressManager;
import org.w3c.dom.Node;

public abstract class AbstractNodeVisitor implements INodeVisitor {

	protected final ArrayList<ProgressListener> listeners;
	private ProgressManager pm;

	public AbstractNodeVisitor() {
		this.listeners = new ArrayList<ProgressListener>();
		pm = new ProgressManager(listeners);
	}

	public AbstractNodeVisitor(ArrayList<ProgressListener> listeners) {
		this.listeners = listeners;
		pm = new ProgressManager(listeners);
	}

	protected void fireProgressEvent(String msg, int stage) {
		
		ProgressEvent event = new ProgressEvent(msg);
		event.setStage(stage);
		pm.fireProgressEvent(event);
	}

	public abstract void accept(Node node) throws Exception;

	protected void removeNodes(ArrayList<Node> nodeList) {
		
		for (Node node : nodeList) {
			
			Node parent = node.getParentNode();
			
			if (parent != null) {
				parent.removeChild(node);
			}
		}
	}

}