Geek Answers Handbook

Jsoup node the number of hash codes when traversing the DOM tree

I am using java jsoup to create HTML DOM trees that I use Node.hashCode(). But I found that while traversing the DOM tree, there are many hash code collisions using the following code:

doc.traverse(new NodeVisitor(){

    @Override
    public void head(Node node, int depth) {

        System.out.println("node hash: "+ node.hashCode());

        /* some other operations */
    }

    @Override
    public void tail(Node node, int depth) {
        // TODO Auto-generated method stub

        /* some codes */
    }
}

So, when this is done, I see many identical hash codes even in the first few outputs.

The hash codes are quite large and I do not expect such strange behavior. I used jsoup-1.8.1. Any input would be greatly appreciated, thanks.

+4
source share
1 answer

Note. This bug was fixed in jSoup 1.8.2, so my answer is no longer relevant.

jSoup. :

@Override
public int hashCode() {
   int result = parentNode != null ? parentNode.hashCode() : 0;
   // not children, or will block stack as they go back up to parent)
   result = 31 * result + (attributes != null ? attributes.hashCode() : 0);
   return result;
}

Java, , , . ( , @alkis )

: . HTML:

<html>
    <head>
    </head>
    <body>
        <div style="blah">TODO: write content</div>
        <div style="blah">Nothing here</div>
        <p style="test">Empty</p>
        <p style="nothing">Empty</p>
    </body>
</html>

:

String html = //HTML posted above

Document doc = Jsoup.parse(html);

Elements elements = doc.select("[style]");
for (Element e : elements) {
   System.out.println(e.hashCode());
}

:

-148184373
-148184373
-1050420242
2013043377

, , , .

, .

.

+5

More articles:


All Articles