200201202203204205206207208209210
for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if (ns2.contains(n)) inter.addElement(n); } return inter; }
233234235236237238239240241242243
for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if (!ns2.contains(n)) diff.addElement(n); } return diff; }
269270271272273274275276277278279
String key = myContext.toString(currNode); if (!stringTable.containsKey(key)) { stringTable.put(key, currNode); dist.addElement(currNode); } currNode = ni.nextNode(); } return dist;
159160161162163164165166167168169
inter.setShouldCacheNodes(true); for (int i=0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if(ns2.contains(n)) inter.addElement(n); } return inter; } /**
183184185186187188189190191192193
diff.setShouldCacheNodes(true); for (int i = 0; i < ns1.getLength(); i++) { Node n = ns1.elementAt(i); if(!ns2.contains(n)) diff.addElement(n); } return diff; } /**
209210211212213214215216217218219
Node n = ns.elementAt(i); String key = n.getNodeValue(); if (!stringTable.containsKey(key)) { stringTable.put(key, n); dist.addElement(n); } } return dist; }
229230231232233234235236237238
{ NodeSet m_cachedNodes = getCachedNodes(); if (null != m_cachedNodes) { if(!m_cachedNodes.contains(node)) m_cachedNodes.addElement(node); } } }
221222223224225226227228229230231
if (null != newDoc) { // TODO: mnl.addNodeInDocOrder(newDoc, true, xctxt); ?? if (!mnl.contains(newDoc)) mnl.addElement(newDoc); } if (null == iterator || newDoc == null) break; }