public NodeSet intersection(NodeSet other) { long start = System.currentTimeMillis(); AVLTreeNodeSet r = new AVLTreeNodeSet(); 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 ((p = r.get(l)) != null) { p.addMatches(l.match); } else r.add(l); } } return r; }
public NodeSet intersection(NodeSet other);
	public NodeSet intersection(NodeSet other) {		long start = System.currentTimeMillis();		AVLTreeNodeSet r = new AVLTreeNodeSet();		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 ((p = r.get(l)) != null) {					p.addMatches(l.match);				} else					r.add(l);			}		}		return r;	}