Discard hidden articles when using fast path

javatests/org/chromium/distiller/DomUtilTest.java

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 package org.chromium.distiller;
 
+import com.google.gwt.dom.client.NodeList;

[mdjones, 2015/10/21 18:15:02]

This belongs in the import section below.

 import org.chromium.distiller.webdocument.WebTable;
 
 import com.google.gwt.core.client.JsArray;
 import com.google.gwt.dom.client.Document;
 import com.google.gwt.dom.client.Element;
 import com.google.gwt.dom.client.Node;
 
 import java.util.Map;
 import java.util.List;
 
@@ skipping 86 matching lines @@
 
         Element currDiv = TestUtil.createDiv(3);
         div2.appendChild(currDiv);
         Element finalDiv1 = currDiv;
 
         currDiv = TestUtil.createDiv(4);
         div2.appendChild(currDiv);
         currDiv.appendChild(TestUtil.createDiv(5));
 
         assertEquals(div2, DomUtil.getNearestCommonAncestor(finalDiv1, currDiv.getChild(0)));
-        assertEquals(div2, DomUtil.getNearestCommonAncestor(
-                DomUtil.querySelectorAll(mRoot, "[id=\"3\"],[id=\"5\"]")));
+        NodeList<Element> elementNodeList = DomUtil.querySelectorAll(mRoot, "[id=\"3\"],[id=\"5\"]");
+        assertEquals(div2, DomUtil.getNearestCommonAncestor(elementNodeList));
+        assertEquals(div2, DomUtil.getNearestCommonAncestor(TestUtil.nodeListToList(elementNodeList)));

[mdjones, 2015/10/21 18:15:02]

Line length

+
     }
 
     /**
      * The tree graph is:
      * 1 - 2 - 3
      */
     public void testNearestCommonAncestorIsRoot() {
         Element div = TestUtil.createDiv(1);
         mBody.appendChild(div);
 
         Element div2 = TestUtil.createDiv(2);
         div.appendChild(div2);
 
         Element div3 = TestUtil.createDiv(3);
         div2.appendChild(div3);
 
         assertEquals(div, DomUtil.getNearestCommonAncestor(div, div3));
-        assertEquals(div, DomUtil.getNearestCommonAncestor(
-                DomUtil.querySelectorAll(mRoot, "[id=\"1\"],[id=\"3\"]")));
+        NodeList<Element> elementNodeList = DomUtil.querySelectorAll(mRoot, "[id=\"1\"],[id=\"3\"]");
+        assertEquals(div, DomUtil.getNearestCommonAncestor(elementNodeList));
+        assertEquals(div, DomUtil.getNearestCommonAncestor(TestUtil.nodeListToList(elementNodeList)));
     }
 
     public void testNodeDepth() {
         Element div = TestUtil.createDiv(1);
 
         Element div2 = TestUtil.createDiv(2);
         div.appendChild(div2);
 
         Element div3 = TestUtil.createDiv(3);
         div2.appendChild(div3);
@@ skipping 195 matching lines @@
                         "<td>text</td>" +
                     "</tr>" +
                 "</tbody>" +
             "</table>";
 
         mBody.setInnerHTML(html);
         DomUtil.stripStyleAttributes(mBody);
         assertEquals(expected, mBody.getInnerHTML());
     }
 }