cset.add(new CandidateEntry(cand,minDist,lrDist));
cset.add(new CandidateEntry(cand,minDist,lrdDist));
  private void findFuzzyMatches( BaseNode tree, BranchNode key, Vector candidates ) {    SortedSet cset = new TreeSet(candComp);    double cutoff = 2*MAX_FUZZY_MATCH;    for( Iterator i = new DFSTreeIterator(tree);i.hasNext();) {      BaseNode cand = (BaseNode) i.next();      double lrDist = Math.min(getDistanceOfLeft(key,cand),getDistanceOfRight(key,cand));      double minDist = Math.min(Math.min(lrDist,measure.childListDistance(key,cand)),          measure.getDistance(cand,key));      if( minDist < 2*MAX_FUZZY_MATCH ) {        cset.add(new CandidateEntry(cand,minDist,lrDist));        cutoff = cutoff < 2*minDist ? cutoff : 2*minDist;      }    }    for( Iterator i = cset.iterator();i.hasNext();) {      CandidateEntry en = (CandidateEntry) i.next();      if( en.distance > cutoff )        break;      else        candidates.add(en);    }  }