Package org.htmlparser.util

Examples of org.htmlparser.util.NodeList.elementAt()

269
270
271
272
273
274
275
276
277
278
279
      );

      NodeList discNodes = parser.extractAllNodesThatMatch(discFilter);

      if (discNodes.size() == 1) {
        Node disc = discNodes.elementAt(0);
        NodeList list = new NodeList();
        disc.collectInto(list, removeFilter);
                String queueId = null;
                boolean discSet = false;
                if (list.size() == 1) {
View Full Code Here
275
276
277
278
279
280
281
282
283
284
285
        NodeList list = new NodeList();
        disc.collectInto(list, removeFilter);
                String queueId = null;
                boolean discSet = false;
                if (list.size() == 1) {
                  LinkTag removeNode = (LinkTag)list.elementAt(0);
                    queueId = removeNode.getLink();
                    discSet = queueId.indexOf("setId") != -1;
                    int index = queueId.lastIndexOf('=');
                    if (index != -1) {
                        queueId = queueId.substring(index+1);
View Full Code Here
434
435
436
437
438
439
440
441
442
443
444
                ImageTag icon = (ImageTag)infoCollector.getNode(i++);
                item.setIconUrl(icon.getImageURL().replace("&&", "&"));

                //get the description
                NodeList list = infoCollector.getNodeList(i++);
                item.setSummary(NodeUtils.getTextData(list.elementAt(list.size()-1)));
               
                //strip off the query params
                int index = item.getIconUrl().indexOf('?');
                if (index != -1) {
                    item.setIconUrl(item.getIconUrl().substring(0, index)+ "?wid=130&hei=182&cvt=jpeg");
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
       
                for (int i = 0; i < list.size(); i++)
                {
                    log.debug("Loop=" + i);
       
                    Node                linkTagNode = list.elementAt(i);
                    String              linkTag     = linkTagNode.toHtml();
                    URI                 targetURI   = parseLinkTag(uri, linkTagNode);
                    Map<String, String> properties  = new HashMap<String, String>();
                   
                    properties.put("linkTagText", linkTag);
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
      strBuf.append("<DOC>\n<DOCNO>");
      strBuf.append(doc.getDocid());
      strBuf.append("</DOCNO>\n");

      for (int i = 0; i < nl.size(); i++) {
        strBuf.append(nl.elementAt(i).toHtml()).append("\n");
      }
      strBuf.append("</DOC>\n");

      // create output document
      myValue.setDocid(doc.getDocid());
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
        }
        vector = new Vector();
        for (int i = 0; i < list.size (); i++)
            try
            {
                link = (LinkTag)list.elementAt (i);
                vector.add(new URL (link.getLink ()));
            }
            catch (MalformedURLException murle)
            {
                //vector.remove (i);
View Full Code Here
402
403
404
405
406
407
408
409
410
411
412
        list = getNodes ();
        if (0 != list.size ())
        {
            sb = new StringBean ();
            for (int i = 0; i < list.size (); i++)
                list.elementAt (i).accept (sb);
            ret = sb.getStrings ();
        }
        else
            ret = "";
       
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
            tag = (CompositeTag)node;
            children = tag.getChildren ();
            if (null != children)
            {
                for (int i = 0; !ret && i < children.size (); i++)
                    if (getChildFilter ().accept (children.elementAt (i)))
                        ret = true;
                // do recursion after all children are checked
                // to get breadth first traversal
                if (!ret && getRecursive ())
                    for (int i = 0; !ret && i < children.size (); i++)
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
                        ret = true;
                // do recursion after all children are checked
                // to get breadth first traversal
                if (!ret && getRecursive ())
                    for (int i = 0; !ret && i < children.size (); i++)
                        if (accept (children.elementAt (i)))
                            ret = true;
            }
        }

        return (ret);
View Full Code Here
663
664
665
666
667
668
669
670
671
672
673
                mParts[2], // raw
                new Attributes (tag, mSupport, mParts));
            NodeList children = tag.getChildren ();
            if (null != children)
                for (int i = 0; i < children.size (); i++)
                    doSAX (children.elementAt (i));
            end = tag.getEndTag ();
            if (null != end)
            {
                if (mNameSpaces)
                    mSupport.processName (end.getTagName (), mParts, false);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.