// HTMLParser Library $Name: v1_6_20060319 $ - A java-based parser for HTML
// http://sourceforge.org/projects/htmlparser
// Copyright (C) 2004 Joshua Kerievsky
//
// Revision Control Information
//
// $Source: /cvsroot/htmlparser/htmlparser/src/org/htmlparser/visitors/TagFindingVisitor.java,v $
// $Author: derrickoswald $
// $Date: 2004/05/24 00:38:19 $
// $Revision: 1.42 $
//
// 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 org.htmlparser.visitors;
import org.htmlparser.Node;
import org.htmlparser.Tag;
import org.htmlparser.util.NodeList;
public class TagFindingVisitor extends NodeVisitor {
private String [] tagsToBeFound;
private int count [];
private int endTagCount [];
private NodeList [] tags;
private NodeList [] endTags;
private boolean endTagCheck;
public TagFindingVisitor(String [] tagsToBeFound) {
this(tagsToBeFound,false);
}
public TagFindingVisitor(String [] tagsToBeFound, boolean endTagCheck) {
this.tagsToBeFound = tagsToBeFound;
this.tags = new NodeList[tagsToBeFound.length];
if (endTagCheck) {
endTags = new NodeList[tagsToBeFound.length];
endTagCount = new int[tagsToBeFound.length];
}
for (int i=0;i<tagsToBeFound.length;i++) {
tags[i] = new NodeList();
if (endTagCheck)
endTags[i] = new NodeList();
}
this.count = new int[tagsToBeFound.length];
this.endTagCheck = endTagCheck;
}
public int getTagCount(int index) {
return count[index];
}
public void visitTag(Tag tag)
{
for (int i=0;i<tagsToBeFound.length;i++)
if (tag.getTagName().equalsIgnoreCase(tagsToBeFound[i])) {
count[i]++;
tags[i].add(tag);
}
}
public void visitEndTag(Tag tag)
{
if (!endTagCheck) return;
for (int i=0;i<tagsToBeFound.length;i++)
if (tag.getTagName().equalsIgnoreCase(tagsToBeFound[i]))
{
endTagCount[i]++;
endTags[i].add(tag);
}
}
public Node [] getTags(int index) {
return tags[index].toNodeArray();
}
public int getEndTagCount(int index) {
return endTagCount[index];
}
}