return -1 < search(nodes, 0, counter - 1, proxy);
NodeProxy p = new NodeProxy(doc, nodeId); return contains(p);
	public boolean contains(NodeProxy proxy) {		sort();		return -1 < search(nodes, 0, counter - 1, proxy);	}