protected void check(List<FitRow> expectedList, List<Object> computedList) {
        if (expectedList == null || expectedList.size() == 0) {
            surplus.addAll(computedList);
        } else if (computedList == null || computedList.size() == 0) {
            missing.addAll(expectedList);
        } else {
            Object computedRow = computedList.remove(0);
            List<FitCell> expectedRow = expectedList.remove(0).cells();
            compareRow(computedRow, expectedRow);

            check(expectedList, computedList);
        }
    }
protected void check(List<FitRow> expectedList, List<Object> computedList) {
        if (expectedList == null || expectedList.size() == 0) {
            surplus.addAll(computedList);
        } else if (computedList == null || computedList.size() == 0) {
            missing.addAll(expectedList);
        } else {
            Object computedRow = computedList.remove(0);
            List<FitCell> expectedRow = expectedList.remove(0).cells();
            compareRow(computedRow, expectedRow);

            check(expectedList, computedList);
        }
    }
protected void check ( List < FitRow > expectedList , List < Object > computedList ) { if ( expectedList == null || expectedList . size ( ) == 0 ) { surplus . addAll ( computedList ) ; } else if ( computedList == null || computedList . size ( ) == 0 ) { missing . addAll ( expectedList ) ; } else { Object computedRow = computedList . remove ( 0 ) ; List < FitCell > expectedRow = expectedList . remove ( 0 ) . cells ( ) ; compareRow ( computedRow , expectedRow ) ; check ( expectedList , computedList ) ; } }
Compares two lists.
<ul>
<li>if {@code expectedList} is empty, all {@code computedList} items are surplus</li>
<li>if {@code computedList} is empty, all {@code expectedList} items are missing</li>
<li>otherwise, match the first rows and compare the rest recursively</li>
</ul>

@param computedList Objects from {@link #query()}.
@param expectedList Objects from HTML.
Compares two lists . <ul > <li > if { @code expectedList } is empty all { @code computedList } items are surplus< / li > <li > if { @code computedList } is empty all { @code expectedList } items are missing< / li > <li > otherwise match the first rows and compare the rest recursively< / li > < / ul >