103104105106107108109110111112113
for (int i = 0; i < nl1.getLength(); i++) { Node testNode = nl1.item(i); if (DOMHelper.isNodeAfter(startNode, testNode) && !DOMHelper.isNodeTheSame(startNode, testNode)) trailNodes.addElement(testNode); } return trailNodes; } /**
132133134135136137138139140141142
for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if (ns2.contains(n)) inter.addElement(n); } return inter; }
163164165166167168169170171172173
for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if (!ns2.contains(n)) diff.addElement(n); } return diff; }
194195196197198199200201202203204
{ Node currNode = nl.item(i); String key = toString(currNode); if (key == null) dist.addElement(currNode); else if (!stringTable.containsKey(key)) { stringTable.put(key, currNode); dist.addElement(currNode); }
198199200201202203204205206207208
if (key == null) dist.addElement(currNode); else if (!stringTable.containsKey(key)) { stringTable.put(key, currNode); dist.addElement(currNode); } } return dist; }
148149150151152153154155156157158
for (int i = 0; i < nl.getLength(); i++) { Node n = nl.item(i); double d = toNumber(n); if (d == maxValue) highNodes.addElement(n); } return highNodes; } /**
185186187188189190191192193194195
for (int i = 0; i < nl.getLength(); i++) { Node n = nl.item(i); double d = toNumber(n); if (d == minValue) lowNodes.addElement(n); } return lowNodes; } /**
6869707172737475767778
for (int i = 0; i < nl1.getLength(); i++) { Node testNode = nl1.item(i); if (DOMHelper.isNodeAfter(testNode, endNode) && !DOMHelper.isNodeTheSame(testNode, endNode)) leadNodes.addElement(testNode); } return leadNodes; } /**
152153154155156157158159160161162
189190191192193194195196197198199