if(r.contains(l)) { p = r.get(l);
if((p = r.get(l)) != null) {
	public NodeSet intersection(NodeSet other) {		long start = System.currentTimeMillis();		NodeIDSet r = new NodeIDSet();		NodeProxy l, p;		for (Iterator i = iterator(); i.hasNext();) {			l = (NodeProxy) i.next();			if (other.contains(l)) {				r.add(l);			}		}		for (Iterator i = other.iterator(); i.hasNext();) {			l = (NodeProxy) i.next();			if (contains(l)) {				if(r.contains(l)) {					p = r.get(l);					p.addMatches(l.matches);				} else					r.add(l);			}		}		return r;	}