int info = findCopyTree(root,base,false); if(  info < COPY_THRESHOLD ) { findCopyTree(root,base,true);
for( Iterator i = base.getLeft().getMatches().iterator();i.hasNext();) { BranchNode copy = (BranchNode) i.next(); if( copy.getMatchArea().getInfoBytes() < COPY_THRESHOLD ) delMatching(copy,base);
  private void removeSmallCopies( BranchNode root ) {    BaseNode base = root.getBaseMatch();    if( base != null && base.getLeft().getMatches().size() > 1 ) {      int info = findCopyTree(root,base,false);      if(  info < COPY_THRESHOLD ) {        findCopyTree(root,base,true); // Too small a copy, remove matchings for it//        System.out.println("XXX Removed small copy rooted at " + root.toString() );      }    }    for(int i=0;i<root.getChildCount();i++)      removeSmallCopies(root.getChild(i));  }