pmd / pmd / 43

Committed 20 Jun 2025 06:39PM UTC coverage: 78.375% (-0.002%) from 78.377%

Build # 43

Build Type

push

github

Committed by

adangel

Commit Message

Fix #1639 #5832: Use filtered comment text for UnnecessaryImport (#5833)

Merged pull request #5833 from adangel:java/issue-5832-unnecessaryimport

Run Details

17714 of 23438 branches covered (75.58%)

Branch coverage included in aggregate %.

3 of 3 new or added lines in 1 file covered. (100.0%)

109 existing lines in 17 files now uncovered.

38908 of 48807 relevant lines covered (79.72%)

0.81 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

7.14

/pmd-core/src/main/java/net/sourceforge/pmd/lang/rule/xpath/internal/PmdDocumentSorter.java

/*
 * BSD-style license; for more info see http://pmd.sourceforge.net/license.html
 */


package net.sourceforge.pmd.lang.rule.xpath.internal;

import java.util.Comparator;

import net.sourceforge.pmd.lang.ast.Node;

/**
 * Sorts nodes by document order.
 */
// renamed because it conflicts with a Saxon node
final class PmdDocumentSorter implements Comparator<Node> {

    public static final PmdDocumentSorter INSTANCE = new PmdDocumentSorter();

    private PmdDocumentSorter() {

    }

    @Override
    public int compare(Node node1, Node node2) {
        if (node1 == node2) {
            return 0;
        } else if (node1 == null) {
            return -1;
        } else if (node2 == null) {
            return 1;
        }

        return node1.compareLocation(node2);
    }
}

1	/*
2	* BSD-style license; for more info see http://pmd.sourceforge.net/license.html
3	*/
4
5
6	package net.sourceforge.pmd.lang.rule.xpath.internal;
7
8	import java.util.Comparator;
9
10	import net.sourceforge.pmd.lang.ast.Node;
11
12	/**
13	* Sorts nodes by document order.
14	*/
15	// renamed because it conflicts with a Saxon node
16	final class PmdDocumentSorter implements Comparator<Node> {
17
18	public static final PmdDocumentSorter INSTANCE = new PmdDocumentSorter();	1✔
19
20	private PmdDocumentSorter() {
21
22	}
23
24	@Override
25	public int compare(Node node1, Node node2) {
UNCOV 26	if (node1 == node2) {	×
27	return 0;	×
28	} else if (node1 == null) {	×
29	return -1;	×
30	} else if (node2 == null) {	×
31	return 1;	×
32	}
33
UNCOV 34	return node1.compareLocation(node2);	×
35	}
36	}

pmd / pmd / 43

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous