136137138139140141142143144145146
for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if (ns2.contains(n)) inter.addElement(n); } return inter; }
167168169170171172173174175176177
for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if (!ns2.contains(n)) diff.addElement(n); } return diff; }
198199200201202203204205206207208
{ 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); }
202203204205206207208209210211212
if (key == null) dist.addElement(currNode); else if (!stringTable.containsKey(key)) { stringTable.put(key, currNode); dist.addElement(currNode); } } return dist; }
152153154155156157158159160161162
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; } /**
189190191192193194195196197198199
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; } /**