fix sorting
Change-Id: I88cbdc9e55b8613dcd2d506531ef9a9038e63d32
diff --git a/org.eclipse.mylyn.debug.tests/src/org/eclipse/mylyn/internal/debug/ui/BreakpointsStateUtilTest.java b/org.eclipse.mylyn.debug.tests/src/org/eclipse/mylyn/internal/debug/ui/BreakpointsStateUtilTest.java
index fdecc70..3158e72 100644
--- a/org.eclipse.mylyn.debug.tests/src/org/eclipse/mylyn/internal/debug/ui/BreakpointsStateUtilTest.java
+++ b/org.eclipse.mylyn.debug.tests/src/org/eclipse/mylyn/internal/debug/ui/BreakpointsStateUtilTest.java
@@ -102,7 +102,6 @@
List<Node> childNodes = new ArrayList<>();
for (int i = 0; i < children.getLength(); i++) {
Node child = children.item(i);
- node.removeChild(child);
childNodes.add(child);
sortNodes(child);
}
@@ -120,10 +119,21 @@
}
Node nameA = a.getAttributes().getNamedItem("name");
Node nameB = b.getAttributes().getNamedItem("name");
+ if (nameA == null) {
+ if (nameB == null) {
+ return 0;
+ }
+ return 1;
+ } else if (nameB == null) {
+ return -1;
+ }
return nameA.getNodeValue().compareTo(nameB.getNodeValue());
}
});
for (Node child : childNodes) {
+ node.removeChild(child);
+ }
+ for (Node child : childNodes) {
node.appendChild(child);
}
}
