The visitor paradigm is one way.
See StringBean which implements NodeVisitor.
You could pass all nodes to the same method:
public void visitTag (Tag tag) { do_something (tag); }
public void visitEndTag (Tag tag) { do_something (tag); }
etc.
void do_something (Node node) { <do something> }
dha...@or... wrote:
>Hi,
>
>I had started using HTMLParser version 1.2 sometime in August of last year. At
>that time the parser had more of a flat structure unlike today's tree structure
>with parents, children etc.
>
>At that time, I could find all the nodes irrespective of their depth in the
>following manner:
>
>NodeIterator e = lHTMLParser.elements();
>while (e.hasMoreNodes())
>{
> Node lNode = (Node)e.nextNode();
> <do something>
>}
>
>
>With the advent of 1.3 the tree structure came in, in which some nodes were
>inside other nodes. I have registered the scanners whose tags I want. However
>if these tags are nested within other tags that I have registered, then the
>above scenario does not work. I need to go deeper. That is not always feasible.
>Is there any mechanism in 1.3 like the one above using which I can get all the
>nodes irrespective of their nested level.
>
>
>Regards,
>
>Dhaval Udani
>Senior Analyst
>M-Line, QPEG
>OrbiTech Solutions Ltd.
>+91-22-28290019 Extn. 1457
>
>
>
>-------------------------------------------------------
>Enterprise Linux Forum Conference & Expo, June 4-6, 2003, Santa Clara
>The only event dedicated to issues related to Linux enterprise solutions
>www.enterpriselinuxforum.com
>
>_______________________________________________
>Htmlparser-developer mailing list
>Htm...@li...
>https://lists.sourceforge.net/lists/listinfo/htmlparser-developer
>
>
>
|
