HtmlParser--TagFindingVisitor源文件

// $Header: /home/cvs/jakarta-jmeter/src/htmlparser/org/htmlparser/visitors/TagFindingVisitor.java,v 1.2 2004/02/11 02:16:59 woolfel Exp $
/*
* ====================================================================
* Copyright 2002-2004 The Apache Software Foundation.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
*   http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/

// The developers of JMeter and Apache are greatful to the developers
// of HTMLParser for giving Apache Software Foundation a non-exclusive
// license. The performance benefits of HTMLParser are clear and the
// users of JMeter will benefit from the hard work the HTMLParser
// team. For detailed information about HTMLParser, the project is
// hosted on sourceforge at http://htmlparser.sourceforge.net/.
//
// HTMLParser was originally created by Somik Raha in 2000. Since then
// a healthy community of users has formed and helped refine the
// design so that it is able to tackle the difficult task of parsing
// dirty HTML. Derrick Oswald is the current lead developer and was kind
// enough to assist JMeter.
//
// contributed by Joshua Kerievsky

package org.htmlparser.visitors;

import org.htmlparser.Node;
import org.htmlparser.tags.EndTag;
import org.htmlparser.tags.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 Node[] getTags(int index)
    {
        return tags[index].toNodeArray();
    }

    public void visitEndTag(EndTag endTag)
    {
        if (!endTagCheck)
            return;
        for (int i = 0; i < tagsToBeFound.length; i++)
            if (endTag.getTagName().equalsIgnoreCase(tagsToBeFound[i]))
            {
                endTagCount[i]++;
                endTags[i].add(endTag);
            }
    }

    public int getEndTagCount(int index)
    {
        return endTagCount[index];
    }

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值